| 2023 | 3-Coloring C Tereza Klimosová, Vibha Sahlot |
| 2023 | A Parameterized Approximation Scheme for Generalized Partial Vertex Cover. Sayan Bandyapadhyay, Zachary Friggstad, Ramin Mousavi |
| 2023 | Adaptive Data Structures for 2D Dominance Colored Range Counting. Younan Gao |
| 2023 | Algorithmic Theory of Qubit Routing. Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, Yoshio Okamoto |
| 2023 | Algorithms and Data Structures - 18th International Symposium, WADS 2023, Montreal, QC, Canada, July 31 - August 2, 2023, Proceedings Pat Morin, Subhash Suri |
| 2023 | An ETH-Tight Algorithm for Bidirected Steiner Connectivity. Daniel Lokshtanov, Pranabendu Misra, Fahad Panolan, Saket Saurabh, Meirav Zehavi |
| 2023 | Approximate Minimum Sum Colorings and Maximum k-Colorable Subgraphs of Chordal Graphs. Ian DeHaan, Zachary Friggstad |
| 2023 | Approximating the Discrete Center Line Segment in Linear Time. Joachim Gudmundsson, Yuan Sha |
| 2023 | Approximating the Smallest k-Enclosing Geodesic Disc in a Simple Polygon. Prosenjit Bose, Anthony D'Angelo, Stephane Durocher |
| 2023 | Block Crossings in One-Sided Tanglegrams. Alexander Dobler, Martin Nöllenburg |
| 2023 | Classification via Two-Way Comparisons (Extended Abstract). Marek Chrobak, Neal E. Young |
| 2023 | Colored Constrained Spanning Tree on Directed Graphs. Hung-Yeh Lee, Hsuan-Yu Liao, Wing-Kai Hon |
| 2023 | Compact Distance Oracles with Large Sensitivity and Low Stretch. Davide Bilò, Keerti Choudhary, Sarel Cohen, Tobias Friedrich, Simon Krogmann, Martin Schirneck |
| 2023 | Density Approximation for Moving Groups. Max van Mulken, Bettina Speckmann, Kevin Verbeek |
| 2023 | Differentially Private Range Query on Shortest Paths. Chengyuan Deng, Jie Gao, Jalaj Upadhyay, Chen Wang |
| 2023 | Dominator Coloring and CD Coloring in Almost Cluster Graphs. Aritra Banik, Prahlad Narasimhan Kasthurirangan, Venkatesh Raman |
| 2023 | Dynamic Convex Hulls Under Window-Sliding Updates. Haitao Wang |
| 2023 | Efficient k-Center Algorithms for Planar Points in Convex Position. Jongmin Choi, Jaegun Lee, Hee-Kap Ahn |
| 2023 | External-Memory Sorting with Comparison Errors. Michael T. Goodrich, Evrim Ozel |
| 2023 | Faster Algorithms for Cycle Hitting Problems on Disk Graphs. Shinwoo An, Kyungjin Cho, Eunjin Oh |
| 2023 | Finding Diameter-Reducing Shortcuts in Trees. Davide Bilò, Luciano Gualà, Stefano Leucci, Luca Pepè Sciarria |
| 2023 | From Curves to Words and Back Again: Geometric Computation of Minimum-Area Homotopy. Hsien-Chih Chang, Brittany Terese Fasy, Bradley McCoy, David L. Millman, Carola Wenk |
| 2023 | Fully Dynamic Clustering and Diversity Maximization in Doubling Metrics. Paolo Pellizzoni, Andrea Pietracaprina, Geppino Pucci |
| 2023 | General Space-Time Tradeoffs via Relational Queries. Shaleen Deep, Xiao Hu, Paraschos Koutris |
| 2023 | Geometric Hitting Set for Line-Constrained Disks. Gang Liu, Haitao Wang |
| 2023 | Geometric Spanning Trees Minimizing the Wiener Index. A. Karim Abu-Affash, Paz Carmi, Ori Luwisch, Joseph S. B. Mitchell |
| 2023 | Hardness of Graph-Structured Algebraic and Symbolic Problems. Jingbang Chen, Yu Gao, Yufan Huang, Richard Peng, Runze Wang |
| 2023 | Improved Bounds for Discrete Voronoi Games. Mark de Berg, Geert van Wordragen |
| 2023 | Linear Layouts of Bipartite Planar Graphs. Henry Förster, Michael Kaufmann, Laura Merker, Sergey Pupyrev, Chrysanthi N. Raftopoulou |
| 2023 | Lower Bounds for Non-adaptive Shortest Path Relaxation. David Eppstein |
| 2023 | Observation Routes and External Watchman Routes. Adrian Dumitrescu, Csaba D. Tóth |
| 2023 | On Length-Sensitive Fréchet Similarity. Kevin Buchin, Brittany Terese Fasy, Erfan Hosseini Sereshgi, Carola Wenk |
| 2023 | Online Interval Scheduling with Predictions. Joan Boyar, Lene M. Favrholdt, Shahin Kamali, Kim S. Larsen |
| 2023 | Online Minimum Spanning Trees with Weight Predictions. Magnus Berg, Joan Boyar, Lene M. Favrholdt, Kim S. Larsen |
| 2023 | Online TSP with Known Locations. Evripidis Bampis, Bruno Escoffier, Niklas Hahn, Michalis Xefteris |
| 2023 | Quick Minimization of Tardy Processing Time on a Single Machine. Baruch Schieber, Pranav Sitaraman |
| 2023 | Realizability Makes A Difference: A Complexity Gap For Sink-Finding in USOs. Simon Weber, Joel Widmer |
| 2023 | Reconfiguration of Time-Respecting Arborescences. Takehiro Ito, Yuni Iwamasa, Naoyuki Kamiyama, Yasuaki Kobayashi, Yusuke Kobayashi, Shun-ichi Maezawa, Akira Suzuki |
| 2023 | Revisiting Graph Persistence for Updates and Efficiency. Tamal K. Dey, Tao Hou, Salman Parsa |
| 2023 | Shortest Coordinated Motion for Square Robots. Guillermo Esteban, Dan Halperin, Víctor Ruíz, Vera Sacristán, Rodrigo I. Silveira |
| 2023 | Socially Fair Matching: Exact and Approximation Algorithms. Sayan Bandyapadhyay, Fedor V. Fomin, Tanmay Inamdar, Fahad Panolan, Kirill Simonov |
| 2023 | Space-Efficient Functional Offline-Partially-Persistent Trees with Applications to Planar Point Location. Gerth Stølting Brodal, Casper Moldrup Rysgaard, Jens Kristian Refsgaard Schou, Rolf Svenning |
| 2023 | Sublinear-Space Streaming Algorithms for Estimating Graph Parameters on Sparse Graphs. Xiuge Chen, Rajesh Chitnis, Patrick Eades, Anthony Wirth |
| 2023 | The Mutual Visibility Problem for Fat Robots. Rusul J. Alsaedi, Joachim Gudmundsson, André van Renssen |
| 2023 | Tight Analysis of the Lazy Algorithm for Open Online Dial-a-Ride. Júlia Baligács, Yann Disser, Farehe Soheil, David Weckbecker |
| 2023 | Tight Approximation Algorithms for Ordered Covering. Jatin Batra, Syamantak Das, Agastya Vibhuti Jha |
| 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 | Zip-Zip Trees: Making Zip Trees More Balanced, Biased, Compact, or Persistent. Ofek Gila, Michael T. Goodrich, Robert E. Tarjan |