| 2025 | Independent Set Reconfiguration Under Bounded-Hop Token Jumping. | Hiroki Hatano, Naoki Kitamura, Taisuke Izumi, Takehiro Ito, Toshimitsu Masuzawa |
| 2025 | Popularity on the 3D-Euclidean Stable Roommates. | Steven Ge, Toshiya Itoh |
| 2025 | An Efficient Implementation of Cosine Distance on Minimal Absent Word Sets Using Suffix Automata. | Mohammad Tamimul Ehsan, Sk. Sabit Bin Mosaddek, Mohammad Saifur Rahman |
| 2025 | Optimal Uniform Shortest Path Sampling. | Simon Dreyer, Antoine Genitrini, Mehdi Naima |
| 2025 | Evaluating Monotone Circuits on Surfaces. | Samir Datta, Chetan Gupta |
| 2025 | Multipacking and Broadcast Domination on Cactus Graphs and Its Impact on Hyperbolic Graphs. | Sandip Das, Sk Samim Islam |
| 2025 | Parameterized Complexity of (d, r)-Domination via Modular Decomposition. | Gennaro Cordasco, Luisa Gargano, Adele A. Rescigno |
| 2025 | A Piecewise Approach for the Analysis of Exact Algorithms. | Katie Clinch, Serge Gaspers, Zixu He, Abdallah Saffidine, Tiankuang Zhang |
| 2025 | Algorithms for the Collaborative Delivery Problem with Monitored Constraints. | Lotte Blank, Kien C. Huynh, Kelin Luo, Anurag Murty Naredla |
| 2025 | On the Approximability of Graph Visibility Problems. | Davide Bil, Alessia Di Fonso, Gabriele Di Stefano, Stefano Leucci |
| 2025 | Computing Conforming Partitions with Low Stabbing Number for Rectilinear Polygons. | Therese Biedl, Stephane Durocher, Debajyoti Mondal, Rahnuma Islam Nishat, Bastien Rivier |
| 2025 | Ranking and Unranking of the Planar Embeddings of a Planar Graph. | Giuseppe Di Battista, Fabrizio Grosso, Giulia Maragno, Maurizio Patrignani |
| 2025 | Proportionally Dense Subgraphs: Parameterized Hardness and Efficiently Solvable Cases. | Narmina Baghirova, Antoine Castillon |
| 2025 | Parameterized Voter Relevance in Facility Location Games with Tree-Shaped Invitation Graphs. | Ryoto Ando, Kei Kimura, Taiki Todo, Makoto Yokoo |
| 2024 | Combinatorial Reconfiguration with Answer Set Programming: Algorithms, Encodings, and Empirical Analysis. | Yuya Yamada, Mutsunori Banbara, Katsumi Inoue, Torsten Schaub, Ryuhei Uehara |
| 2024 | Generating Cyclic 2-Gray Codes for Fibonacci q-Decreasing Words. | Dennis Wong, Bowie Liu, Chan-Tong Lam, Marcus Im |
| 2024 | Plane Multigraphs with One-Bend and Circular-Arc Edges of a Fixed Angle. | Csaba D. Tth |
| 2024 | On MAX-SAT with Cardinality Constraint. | Fahad Panolan, Hannane Yaghoubizade |
| 2024 | Reasons to Fall (More) in Love with Combinatorial Reconfiguration. | Naomi Nishimura |
| 2024 | (t, s)-Completely Independent Spanning Trees. | Shin-Ichi Nakano |
| 2024 | Recent Research Activities on Algorithmic Foundations for Social Advancement. | Shin-ichi Minato |
| 2024 | On the Hardness of Gray Code Problems for Combinatorial Objects. | Arturo Merino, Namrata, Aaron Williams |
| 2024 | Efficient Enumeration of Drawings and Combinatorial Structures for Maximal Planar Graphs. | Giordano Da Lozzo, Giuseppe Di Battista, Fabrizio Frati, Fabrizio Grosso, Maurizio Patrignani |
| 2024 | Simultaneous Drawing of Layered Trees. | Julia Katheder, Stephen G. Kobourov, Axel Kuckuk, Maximilian Pfister, Johannes Zink |
| 2024 | Reconfiguration of Multisets with Applications to Bin Packing. | Jeffrey Kam, Shahin Kamali, Avery Miller, Naomi Nishimura |