Multi-Priority Graph Sparsification
Point Enclosure Problem for Homothetic Polygons
Hardness of Balanced Mobiles
Burn and Win
Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness
Advice Complexity Bounds for Online Delayed F-Node-, H-Node- and H-Edge-Deletion Problems
Parameterized algorithms for Eccentricity Shortest Path Problem
A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs
Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks
A Polyhedral Perspective on Tropical Convolutions
Online Knapsack with Removal and Recourse
Minimum Surgical Probing with Convexity Constraints
A linear algorithm for radio k-coloring powers of paths having small diameter
Capacity-Preserving Subgraphs of Directed Flow Networks
Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms
Finding Small Complete Subgraphs Efficiently
Maximal distortion of geodesic diameters in polygonal domains
On 2-strong connectivity orientations of mixed graphs and related problems
Make a Graph Singly Connected By Edge Orientations
Computing the Center of Uncertain Points on Cactus Graphs
Cosecure Domination: Hardness Results and Algorithms
Optimal cost-based allocations under two-sided preferences
Generating cyclic rotation Gray codes for stamp foldings and semi-meanders
On Computing Large Temporal (Unilateral) Connected Components
On Integer Linear Programs for Treewidth based on Perfect Elimination Orderings
Finding Perfect Matching Cuts Faster
Connected Feedback Vertex Set on AT-Free graphs
Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries
Improved Analysis of two Algorithms for Min-Weighted Sum Bin Packing
Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism
A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-connected Induced Subgraphs
Partial-Adaptive Submodular Maximization
Budget-Constrained Cost-Covering Job Assignment for a Total Contribution-Maximizing Platform.