| 2024 | A Bisection Approach to Subcubic Maximum Induced Matching. | Gordon Hoi, Sanjay Jain, Ammar Fathin Sabili, Frank Stephan |
| 2024 | On Layered Area-Proportional Rectangle Contact Representations. | Carolina Haase, Philipp Kindermann |
| 2024 | Dichotomies for Tree Minor Containment with Structural Parameters. | Tatsuya Gima, Soh Kumabe, Kazuhiro Kurita, Yuto Okada, Yota Otachi |
| 2024 | On the Complexity of List H-Packing for Sparse Graph Classes. | Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Yota Otachi, Tomohito Shirai, Akira Suzuki, Yuma Tamura, Xiao Zhou |
| 2024 | Structural Parameterizations of Vertex Integrity. | Tatsuya Gima, Tesshu Hanaka, Yasuaki Kobayashi, Ryota Murai, Hirotaka Ono, Yota Otachi |
| 2024 | Short Flip Sequences to Untangle Segments in the Plane. | Guilherme Dias da Fonseca, Yan Gerard, Bastien Rivier |
| 2024 | The Shortest Path Reconfiguration Problem Based on Relaxation of Reconfiguration Rules. | Naoki Domon, Akira Suzuki, Yuma Tamura, Xiao Zhou |
| 2024 | Minimizing Corners in Colored Rectilinear Grids. | Thomas Depian, Alexander Dobler, Christoph Kern, Jules Wulms |
| 2024 | Orientable Burning Number of Graphs. | Julien Courtiel, Paul Dorbec, Tatsuya Gima, Romain Lecoq, Yota Otachi |
| 2024 | Fully Dynamic Algorithms for Euclidean Steiner Tree. | T.-H. Hubert Chan, Gramoz Goranci, Shaofeng H.-C. Jiang, Bo Wang, Quan Xue |
| 2024 | Quantum Graph Drawing. | Susanna Caroppo, Giordano Da Lozzo, Giuseppe Di Battista |
| 2024 | Recognition and Isomorphism of Proper $\boldsymbol{H}$-Graphs for Unicyclic $\boldsymbol{H}$ in FPT-Time. | Deniz Agaoglu agirici, Peter Zeman |
| 2024 | Counting Vanishing Matrix-Vector Products. | Cornelius Brand, Viktoriia Korchemna, Kirill Simonov, Michael Skotnica |
| 2024 | Black Hole Search in Dynamic Cactus Graph. | Adri Bhattacharya, Giuseppe F. Italiano, Partha Sarathi Mandal |
| 2024 | Stable and Dynamic Minimum Cuts. | Mark de Berg, Andrs Lpez Martnez, Frits C. R. Spieksma |
| 2024 | The Parameterized Complexity of Terminal Monitoring Set. | N. R. Aravind, Roopam Saxena |
| 2024 | Exact and Approximate Hierarchical Hub Labeling. | Ruoying Li, Sabine Storandt |
| 2024 | Canonization of a Random Circulant Graph by Counting Walks. | Oleg Verbitsky, Maksim Zhukovskii |
| 2024 | Improved Approximation Algorithms for Cycle and Path Packings. | Jingyang Zhao, Mingyu Xiao |
| 2023 | Parameterized Complexity of Optimizing List Vertex-Coloring Through Reconfiguration. | Yusuke Yanagisawa, Akira Suzuki, Yuma Tamura, Xiao Zhou |
| 2023 | Reflective Guarding a Gallery. | Arash Vaezi, Bodhayan Roy, Mohammad Ghodsi |
| 2023 | Overlapping Edge Unfoldings for Archimedean Solids and (Anti)prisms. | Takumi Shiota, Toshiki Saitoh |
| 2023 | Recognizing When a Preference System is Close to Admitting a Master List. | Ildik Schlotter |
| 2023 | Interweaving Real-Time Jobs with Energy Harvesting to Maximize Throughput. | Baruch Schieber, Bhargav Samineni, Soroush Vahidi |
| 2023 | Reconfiguration of Vertex-Disjoint Shortest Paths on Graphs. | Rin Saito, Hiroshi Eto, Takehiro Ito, Ryuhei Uehara |