1: Faster Maximium Priority Matchings in Bipartite Graphs
2: Geometric Memory Management
3: A Parameterized Algorithm for Bounded-Degree Vertex Deletion
4: On a generalization of Nemhauser and Trotter’s local optimization theorem
5: Firefighting on Trees Beyond Integrality Gaps
6: Motivating Time-Inconsistent Agents: A Computational Approach
7: DeFiNe: an optimisation-based method for robust disentangling of filamentous networks
8: Approximate Distance Oracles for Planar Graphs with Improved Query Time-Space Tradeoff
9: The minimal hitting set generation problem: algorithms and computation
10: A Serial Multilevel Hypergraph Partitioning Algorithm
11: Constant-factor approximations for asymmetric TSP on nearly-embeddable graphs
12: On the Computation of the Optimal Connecting Points in Road Networks
13: Maximum Leaf Spanning Trees of Growing Sierpinski Networks Models
14: An O(m log n) Algorithm for Stuttering Equivalence and Branching Bisimulation
15: k-Nearest Neighbors on Road Networks: A Journey in Experimentation and In-Memory Implementation