| 2023 | A Linear Algorithm for Radio k-Coloring Powers of Paths Having Small Diameter. Dipayan Chakraborty, Soumen Nandi, Sagnik Sen, D. K. Supraja |
| 2023 | A Linear Delay Algorithm for Enumeration of 2-Edge/Vertex-Connected Induced Subgraphs. Takumi Tada, Kazuya Haraguchi |
| 2023 | A Polyhedral Perspective on Tropical Convolutions. Cornelius Brand, Martin Koutecký, Alexandra Lassota |
| 2023 | A Polynomial-Time Approximation Scheme for Thief Orienteering on Directed Acyclic Graphs. Andrew Bloch-Hansen, Daniel R. Page, Roberto Solis-Oba |
| 2023 | Advice Complexity Bounds for Online Delayed ℱ-Node-, H-Node- and H-Edge-Deletion Problems. Niklas Berndt, Henri Lotze |
| 2023 | Budget-Constrained Cost-Covering Job Assignment for a Total Contribution-Maximizing Platform. Chi-Hao Wang, Chi-Jen Lu, Ming-Tat Ko, Po-An Chen, Chuang-Chieh Lin |
| 2023 | Burn and Win. Pradeesha Ashok, Sayani Das, Lawqueen Kanesh, Saket Saurabh, Avi Tomar, Shaily Verma |
| 2023 | Capacity-Preserving Subgraphs of Directed Flow Networks. Markus Chimani, Max Ilsen |
| 2023 | Combinatorial Algorithms - 34th International Workshop, IWOCA 2023, Tainan, Taiwan, June 7-10, 2023, Proceedings Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee |
| 2023 | Computing the Center of Uncertain Points on Cactus Graphs. Ran Hu, Divy H. Kanani, Jingru Zhang |
| 2023 | Connected Feedback VertexSet on AT-Free Graphs. Joydeep Mukherjee, Tamojit Saha |
| 2023 | Cosecure Domination: Hardness Results and Algorithms. Kusum, Arti Pandey |
| 2023 | Deterministic Performance Guarantees for Bidirectional BFS on Real-World Networks. Thomas Bläsius, Marcus Wilhelm |
| 2023 | Finding Perfect Matching Cuts Faster. Neeldhara Misra, Yash More |
| 2023 | Finding Small Complete Subgraphs Efficiently. Adrian Dumitrescu, Andrzej Lingas |
| 2023 | Generating Cyclic Rotation Gray Codes for Stamp Foldings and Semi-meanders. Bowie Liu, Dennis Wong |
| 2023 | Hardness of Balanced Mobiles. Virginia Ardévol Martínez, Romeo Rizzi, Florian Sikora |
| 2023 | Improved Analysis of Two Algorithms for Min-Weighted Sum Bin Packing. Guillaume Sagnol |
| 2023 | Make a Graph Singly Connected by Edge Orientations. Tim A. Hartmann, Komal Muluk |
| 2023 | Maximal Distortion of Geodesic Diameters in Polygonal Domains. Adrian Dumitrescu, Csaba D. Tóth |
| 2023 | Min-Max Relative Regret for Scheduling to Minimize Maximum Lateness. Imad Assayakh, Imed Kacem, Giorgio Lucarelli |
| 2023 | Minimum Surgical Probing with Convexity Constraints. Toni Böhnlein, Niccolò Di Marco, Andrea Frosini |
| 2023 | Multi-priority Graph Sparsification. Abu Reyan Ahmed, Keaton Hamm, Stephen G. Kobourov, Mohammad Javad Latifi Jebelli, Faryad Darabi Sahneh, Richard Spence |
| 2023 | On 2-Strong Connectivity Orientations of Mixed Graphs and Related Problems. Loukas Georgiadis, Dionysios Kefallinos, Evangelos Kosinas |
| 2023 | On Computing Large Temporal (Unilateral) Connected Components. Isnard Lopes Costa, Raul Lopes, Andrea Marino, Ana Silva |
| 2023 | On Integer Linear Programs for Treewidth Based on Perfect Elimination Orderings. Sven Mallach |
| 2023 | Online Knapsack with Removal and Recourse. Hans-Joachim Böckenhauer, Ralf Klasing, Tobias Mömke, Peter Rossmanith, Moritz Stocker, David Wehner |
| 2023 | Optimal Cost-Based Allocations Under Two-Sided Preferences. Girija Limaye, Meghana Nasre |
| 2023 | Parameterized Algorithms for Eccentricity Shortest Path Problem. Sriram Bhyravarapu, Satyabrata Jana, Lawqueen Kanesh, Saket Saurabh, Shaily Verma |
| 2023 | Partial-Adaptive Submodular Maximization. Shaojie Tang, Jing Yuan |
| 2023 | Point Enclosure Problem for Homothetic Polygons. Waseem Akram, Sanjeev Saxena |
| 2023 | Reconfiguration and Enumeration of Optimal Cyclic Ladder Lotteries. Yuta Nozaki, Kunihiro Wasa, Katsuhisa Yamanaka |
| 2023 | Sorting and Ranking of Self-Delimiting Numbers with Applications to Tree Isomorphism. Frank Kammer, Johannes Meintrup, Andrej Sajenko |
| 2023 | Timeline Cover in Temporal Graphs: Exact and Approximation Algorithms. Riccardo Dondi, Alexandru Popa |