Linked e-resources
Details
Table of Contents
Graphs in Nature
Set Similarity
a Survey
Concurrent Connected Components Algorithms: Recent Results and Open Problems
Succinct Data Structures for Families of Interval Graphs
On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow
Efficient Nearest-Neighbor Query and Clustering of Planar Curves
Positive-Instance Driven Dynamic Programming for Graph Searching
How to Morph a Tree on a Small Grid
Approximating the robust bin-packing with budget uncertainty
Rank-Select Indices Without Tears
A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs
A Framework for Vehicle Routing Approximation Schemes in Trees
Avoidable Vertices and Edges in Graphs
Plane Hop Spanners for Unit Disk Graphs
On the Minimum Consistent Subset Problem
Parameterized Complexity of Conict-free Graph Coloring
Graph Isomorphism for (H1,H2)-Free Graphs: An Almost Complete Dichotomy
Hamiltonicity for convex shape Delaunay and Gabriel graphs
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives
Online Bin Covering with Advice
Stackelberg Packing Games
Range closest-pair search in higher dimensions
Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles
Kernelization of Graph Hamiltonicity: Proper H-Graphs
Weighted Throughput Maximization with Calibrations
Maximizing Dominance in the Plane and its Applications
Extending Upward Planar Graph Drawings
Online Circle Packing
Guess Free Maximization of Submodular and Linear Sums
Efficient Second-Order Shape-Constrained Function Fitting
Dynamic Online Dictionary Matching
Balanced Stable Marriage: How Close is Close Enough?
Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint
Inventory Routing Problem with Facility Location
A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space
Geometric Firefighting in the Half-plane
Most vital segment barriers
Splaying Preorders and Postorders
Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS
Discrete Morse Theory for Computing Zigzag Persistence
Optimal Offline Dynamic 2,3-Edge/Vertex Connectivity
Zip Trees
Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points.
Set Similarity
a Survey
Concurrent Connected Components Algorithms: Recent Results and Open Problems
Succinct Data Structures for Families of Interval Graphs
On Polynomial-Time Combinatorial Algorithms for Maximum L-Bounded Flow
Efficient Nearest-Neighbor Query and Clustering of Planar Curves
Positive-Instance Driven Dynamic Programming for Graph Searching
How to Morph a Tree on a Small Grid
Approximating the robust bin-packing with budget uncertainty
Rank-Select Indices Without Tears
A PTAS for Bounded-Capacity Vehicle Routing in Planar Graphs
A Framework for Vehicle Routing Approximation Schemes in Trees
Avoidable Vertices and Edges in Graphs
Plane Hop Spanners for Unit Disk Graphs
On the Minimum Consistent Subset Problem
Parameterized Complexity of Conict-free Graph Coloring
Graph Isomorphism for (H1,H2)-Free Graphs: An Almost Complete Dichotomy
Hamiltonicity for convex shape Delaunay and Gabriel graphs
Computing Maximum Independent Set on Outerstring Graphs and Their Relatives
Online Bin Covering with Advice
Stackelberg Packing Games
Range closest-pair search in higher dimensions
Orthogonal Range Reporting and Rectangle Stabbing for Fat Rectangles
Kernelization of Graph Hamiltonicity: Proper H-Graphs
Weighted Throughput Maximization with Calibrations
Maximizing Dominance in the Plane and its Applications
Extending Upward Planar Graph Drawings
Online Circle Packing
Guess Free Maximization of Submodular and Linear Sums
Efficient Second-Order Shape-Constrained Function Fitting
Dynamic Online Dictionary Matching
Balanced Stable Marriage: How Close is Close Enough?
Improved Streaming Algorithms for Maximizing Monotone Submodular Functions under a Knapsack Constraint
Inventory Routing Problem with Facility Location
A Linear-Time Algorithm for Radius-Optimally Augmenting Paths in a Metric Space
Geometric Firefighting in the Half-plane
Most vital segment barriers
Splaying Preorders and Postorders
Wannabe Bounded Treewidth Graphs Admit a Polynomial Kernel for DFVS
Discrete Morse Theory for Computing Zigzag Persistence
Optimal Offline Dynamic 2,3-Edge/Vertex Connectivity
Zip Trees
Improved Algorithms for the Bichromatic Two-Center Problem for Pairs of Points.