| 2023 | Away from Each Other. Tetsuya Araki, Shin-Ichi Nakano |
| 2023 | Better Hardness Results for the Minimum Spanning Tree Congestion Problem. Huong Luu, Marek Chrobak |
| 2023 | Certifying Induced Subgraphs in Large Graphs. Ulrich Meyer, Hung Tran, Konstantinos Tsakalidis |
| 2023 | Efficient Non-isomorphic Graph Enumeration Algorithms for Subclasses of Perfect Graphs. Jun Kawahara, Toshiki Saitoh, Hirokazu Takeda, Ryo Yoshinaka, Yui Yoshioka |
| 2023 | Energy Efficient Sorting, Selection and Searching. Varunkumar Jayapaul, Seungbum Jo, Krishna V. Palem, Srinivasa Rao Satti |
| 2023 | Finding the Cyclic Covers of a String. Roberto Grossi, Costas S. Iliopoulos, Jesper Jansson, Zara Lim, Wing-Kin Sung, Wiktor Zuba |
| 2023 | Flipping Plane Spanning Paths. Oswin Aichholzer, Kristin Knorr, Wolfgang Mulzer, Johannes Obenaus, Rosna Paul, Birgit Vogtenhuber |
| 2023 | Graph Covers: Where Topology Meets Computer Science, and Simple Means Difficult. Jan Kratochvíl |
| 2023 | Groups Burning: Analyzing Spreading Processes in Community-Based Networks. Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno |
| 2023 | Improved and Generalized Algorithms for Burning a Planar Point Set. Prashant Gokhale, J. Mark Keil, Debajyoti Mondal |
| 2023 | Inferring Strings from Position Heaps in Linear Time. Koshiro Kumagai, Diptarama Hendrian, Ryo Yoshinaka, Ayumi Shinohara |
| 2023 | Internal Longest Palindrome Queries in Optimal Time. Kazuki Mitani, Takuya Mieno, Kazuhisa Seto, Takashi Horiyama |
| 2023 | Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput. Baruch Schieber, Bhargav Samineni, Soroush Vahidi |
| 2023 | Minimum Ply Covering of Points with Unit Squares. Stephane Durocher, J. Mark Keil, Debajyoti Mondal |
| 2023 | On Star-Multi-interval Pairwise Compatibility Graphs. Angelo Monti, Blerina Sinaimeri |
| 2023 | On the Complexity of Distance-d Independent Set Reconfiguration. Duc A. Hoang |
| 2023 | On the Longest Flip Sequence to Untangle Segments in the Plane. Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier |
| 2023 | On the Parameterized Complexity of Compact Set Packing. Ameet Gadekar |
| 2023 | Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms. Takumi Shiota, Toshiki Saitoh |
| 2023 | Parameterized Complexity of Optimizing List Vertex-Coloring Through Reconfiguration. Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou |
| 2023 | Parameterized Complexity of Path Set Packing. N. R. Aravind, Roopam Saxena |
| 2023 | Parity Permutation Pattern Matching. Virginia Ardévol Martínez, Florian Sikora, Stéphane Vialette |
| 2023 | Piercing Diametral Disks Induced by Edges of Maximum Spanning Trees. A. Karim Abu-Affash, Paz Carmi, Meytal Maman |
| 2023 | Recognizing When a Preference System is Close to Admitting a Master List. Ildikó Schlotter |
| 2023 | Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs. Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara |
| 2023 | Reflective Guarding a Gallery. Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi |
| 2023 | Roman k-Domination: Hardness, Approximation and Parameterized Results. A. Mohanapriya, P. Renjith, N. Sadagopan |
| 2023 | Some Algorithmic Results for Eternal Vertex Cover Problem in Graphs. Kaustav Paul, Arti Pandey |
| 2023 | Splitting Plane Graphs to Outerplanarity. Martin Gronemann, Martin Nöllenburg, Anaïs Villedieu |
| 2023 | Structural Parameterization of Cluster Deletion. Giuseppe F. Italiano, Athanasios L. Konstantinidis, Charis Papadopoulos |
| 2023 | The Family of Fan-Planar Graphs. Michael Kaufmann |
| 2023 | WALCOM: Algorithms and Computation - 17th International Conference and Workshops, WALCOM 2023, Hsinchu, Taiwan, March 22-24, 2023, Proceedings Chun-Cheng Lin, Bertrand M. T. Lin, Giuseppe Liotta |
| 2023 | k-Transmitter Watchman Routes. Bengt J. Nilsson, Christiane Schmidt |