> Top >> Accepted Paper List
Accepted Paper List
An FPT Algorithm for Splitting a Necklace Among Two Thieves
Matching Cuts in Graphs of High Girth and H-Free Graphs
A Combinatorial Certifying Algorithm for Linear Programming Problems with Gainfree Leontief Substitution Systems
Pattern-avoiding binary trees - generation, counting, and bijections
Is the Algorithmic Kadison-Singer Problem Hard?
Finding Diverse Minimum s-t Cuts
Improved Smoothed Analysis of 2-Opt for the Euclidean TSP
Exact Matching: Correct Parity and FPT Parameterized by Independence Number
Succinct Planar Encoding with Minor Operations
New Support Size Bounds for Integer Programming, Applied to Makespan Minimization on Uniformly Related Machines
Efficient Algorithms for Euclidean Steiner Minimal Tree on Near-Convex Terminal Sets
Computing a Subtrajectory Cluster from $c$-packed Trajectories
On the Line-Separable Unit-Disk Coverage and Related Problems
An Approximation Algorithm for Two-Edge-Connected Subgraph Problem via Triangle-free Two-Edge-Cover
Regularization of Low Error PCPs and an Application to MCSP
Single-Exponential FPT Algorithms for Enumerating Secluded $\mathcal{F}$-Free Subgraphs and Deleting to Scattered Graph Classes
Small-space algorithms for the online language distance problem for palindromes and squares
FPT Approximation using Treewidth: Capacitated Vertex Cover, Target Set Selection and Vector Dominating Set
A strongly polynomial-time algorithm for weighted general factors with three feasible degrees
Improved guarantees for the a priori TSP
On the Complexity of the Eigenvalue Deletion Problem
Reconfiguration of the Union of Arborescences
Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes
Clustering What Matters in Constrained Settings
Connected Vertex Cover on AT-free Graphs
Non-Clairvoyant Makespan Minimization Scheduling with Predictions
Rectilinear-Upward Planarity Testing of Digraphs
On Min-Max Graph Balancing with Strict Negative Correlation Constraints
Improved Approximation Algorithm for Capacitated Facility Location with Uniform Facility Cost
Testing properties of distributions in the streaming model
On the fine-grained query complexity of symmetric functions
Improved Approximation for Two-dimensional Vector Multiple Knapsack
Substring Complexity in Sublinear Space
Computing paths of large rank in planar frameworks deterministically
Recognizing unit multiple intervals is hard
Clustering in Polygonal Domains
Structural Parameterizations of b-Coloring
Realizability of Free Spaces of Curves
k-Universality of Regular Languages
Fast Convolutions for Near-Convex Sequences
The st-Planar Edge Completion Problem is Fixed-Parameter Tractable
A Compact DAG for Storing and Searching Maximal Common Subsequences
Coloring and Recognizing Mixed Interval Graphs
Temporal Separators with Deadlines
Prefix Sorting DFAs: a Recursive Algorithm
Geometric TSP on Sets
Rapid mixing for the hardcore Glauber dynamics and other Markov chains in bounded-treewidth graphs
Matrix Completion: Approximating the Minimum Diameter
Depth-Three Circuits for Inner Product and Majority Functions
Distance Queries over Dynamic Interval Graphs
Shortest Beer Path Queries based on Graph Decomposition
Shortest Beer Path Queries in Digraphs with Bounded Treewidth
A unified worst case for classical simplex and policy iteration pivot rules
Sparse Graphs of Twin-width 2 Have Bounded Tree-width
Approximation Guarantees for Shortest Superstrings: Simpler and Better