Accepted papers

- Bounded-Degree Spanners in the Presence of Polygonal Obstacles
- Subspace approximation with outliers
- On the Parameterized Complexity of Completeness Reasoning for Conjunctive Queries
- Computational Complexity of Synchronization under Regular Commutative Constraints
- Seamless Interpolation between Contraction Hierarchies and Hub Labels for fast and space-efficient Shortest Path Queries in Road Networks
- Local Routing in a Tree Metric 1-Spanner
- Deep Specification Mining with Attention
- $k$-Critical Graphs in $P_5$-Free Graphs
- On the Restricted 1-Steiner Tree Problem
- Approximation algorithms for cluster general routing problem
- Parallelized maximization of nonsubmodular function subject to a cardinality constraint
- An improved Bregman $k$-means++ algorithm via local search
- Approximation algorithms for the lower-bounded k-median and its generalizations
- A Survey for Conditional Diagnosability of Alternating Group Networks
- Realization Problems on Reachability Sequences
- Graph Classes and Approximability of the Happy Set Problem
- Constructing Tree Decompositions of Graphs with Bounded Gonality
- Approximate Set Union via Approximate Randomization
- A new lower bound for the eternal vertex cover number of graphs
- Approximation algorithms for car-sharing problems
- Computing a maximum clique in geometric superclasses of disk graphs
- Uniqueness of $DP$-Nash Subgraphs and $D$-sets
- Election Control through Social Influence with Unknown Preferences
- Succinct Monotone Circuit Certification: Planarity and Parameterized Complexity
- Visibility polygon queries among dynamic polygonal obstacles in plane
- Imbalance Parameterized by Twin Cover Revisited
- W[1]-Hardness of the k-Center Problem Parameterized by the Skeleton Dimension
- An Optimal Lower Bound for Hierarchical Universal Solutions for TSP on the Plane
- Quantum Speedup for the Minimum Steiner Tree Problem
- Access Structure Hiding Secret Sharing from Novel Set Systems and Vector Families
- Power of Decision Trees with Monotone Queries
- On the Enumeration of Minimal Non-Pairwise Compatibility Graphs
- On the Area Requirements of Planar Greedy Drawings of Triconnected Planar Graphs
- Hardness of Sparse Sets and Minimal Circuit Size Problem
- Approximating Maximum Acyclic Matchings by Greedy and Local Search Strategies
- On the complexity of directed intersection representation of DAG's
- Even better fixed-parameter algorithms for bicluster editing
- A Non-Extendibility Certificate for Submodularity and Applications
- Parameterized Complexity of Maximum Edge Colorable Subgraph
- Mixing of Markov Chains for Independent Sets on Chordal Graphs with Bounded Separators
- Linear-time Algorithms for Eliminating Claws in Graphs
- End-Vertices of AT-free Bigraphs
- Approaching Optimal Duplicate Detection in a Sliding Window
- Computational Complexity Characterization of Protecting Elections from Bribery
- Coding with Noiseless Feedback over the Z-channel
- Path-monotonic Upward Drawings of Plane Graphs
- Constructing Independent Spanning Trees in Alternating Group Networks
- Shortest Watchman Tours in Simple Polygonsunder Rotated Monotone Visibility
- Tight approximation for the minimum bottleneck generalized matching problem
- A Simple Primal-Dual Approximation Algorithm for 2-Edge-Connected Spanning Subgraphs
- New Symmetry-less ILP Formulation for the Classical One Dimensional Bin-Packing Problem
- On Measures of Space Over Real and Complex numbers
- On the Mystery of Negations in Circuits : Structure vs Power
- Fixed Parameter Tractability of Graph Deletion Problems over Data Streams