| 2025 | Succinct Data Structures for Chordal Graph with Bounded Leafage or Vertex Leafage. | Meng He, Kaiyu Wu |
| 2023 | Realizability Makes A Difference: A Complexity Gap For Sink-Finding in USOs. | Simon Weber, Joel Widmer |
| 2023 | Dynamic Convex Hulls Under Window-Sliding Updates. | Haitao Wang |
| 2023 | Quick Minimization of Tardy Processing Time on a Single Machine. | Baruch Schieber, Pranav Sitaraman |
| 2023 | Fully Dynamic Clustering and Diversity Maximization in Doubling Metrics. | Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci |
| 2023 | Density Approximation for Moving Groups. | Max van Mulken, Bettina Speckmann, Kevin Verbeek |
| 2023 | An ETH-Tight Algorithm for Bidirected Steiner Connectivity. | Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2023 | Geometric Hitting Set for Line-Constrained Disks. | Gang Liu, Haitao Wang |
| 2023 | Colored Constrained Spanning Tree on Directed Graphs. | Hung-Yeh Lee, Hsuan-Yu Liao, Wing-Kai Hon |
| 2023 | 3-Coloring C | Tereza Klimosov, Vibha Sahlot |
| 2023 | Algorithmic Theory of Qubit Routing. | Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2023 | Reconfiguration of Time-Respecting Arborescences. | Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki |
| 2023 | Verifying the Product of Generalized Boolean Matrix Multiplication and Its Applications to Detect Small Subgraphs. | Wing-Kai Hon, Meng-Tsung Tsai, Hung-Lung Wang |
| 2023 | Approximating the Discrete Center Line Segment in Linear Time. | Joachim Gudmundsson, Yuan Sha |
| 2023 | External-Memory Sorting with Comparison Errors. | Michael T. Goodrich, Evrim Ozel |
| 2023 | Zip-Zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent. | Ofek Gila, Michael T. Goodrich, Robert E. Tarjan |
| 2023 | Adaptive Data Structures for 2D Dominance Colored Range Counting. | Younan Gao |
| 2023 | Linear Layouts of Bipartite Planar Graphs. | Henry Frster, Michael Kaufmann, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou |
| 2023 | Shortest Coordinated Motion for Square Robots. | Guillermo Esteban, Dan Halperin, Vctor Ruz, Vera Sacristn, Rodrigo I. Silveira |
| 2023 | Lower Bounds for Non-adaptive Shortest Path Relaxation. | David Eppstein |
| 2023 | Observation Routes and External Watchman Routes. | Adrian Dumitrescu, Csaba D. Tth |
| 2023 | Block Crossings in One-Sided Tanglegrams. | Alexander Dobler, Martin Nllenburg |
| 2023 | Revisiting Graph Persistence for Updates and Efficiency. | Tamal K. Dey, Tao Hou, Salman Parsa |
| 2023 | Differentially Private Range Query on Shortest Paths. | Chengyuan Deng, Jie Gao, Jalaj Upadhyay, Chen Wang |
| 2023 | Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs. | Ian DeHaan, Zachary Friggstad |