| 2021 | Three Problems on Well-Partitioned Chordal Graphs. | Jungho Ahn, Lars Jaffke, O-joung Kwon, Paloma T. Lima |
| 2021 | Throughput Scheduling with Equal Additive Laxity. | Martin Bhm, Nicole Megow, Jens Schlter |
| 2021 | Circumventing Connectivity for Kernelization. | Pallavi Jain, Lawqueen Kanesh, Shivesh Kumar Roy, Saket Saurabh, Roohani Sharma |
| 2019 | Subset Feedback Vertex Set in Chordal and Split Graphs. | Geevarghese Philip, Varun Rajan, Saket Saurabh, Prafullkumar Tale |
| 2019 | Independent Lazy Better-Response Dynamics on Network Games. | Paolo Penna, Laurent Viennot |
| 2019 | Complexity of Vertex Switching on Edge-Bicolored Graphs. | Ho Lam Pang, Leizhen Cai |
| 2019 | On the Necessary Memory to Compute the Plurality in Multi-agent Systems. | Emanuele Natale, Iliad Ramezani |
| 2019 | A Faster Algorithm for the Strongly Stable b-Matching Problem. | Adam Kunysz |
| 2019 | Linear-Time In-Place DFS and BFS on the Word RAM. | Frank Kammer, Andrej Sajenko |
| 2019 | Turing Tumble Is P(SPACE)-Complete. | Matthew P. Johnson |
| 2019 | Eternal Domination in Grids. | Fionn Mc Inerney, Nicolas Nisse, Stphane Prennes |
| 2019 | Shortest Reconfiguration Sequence for Sliding Tokens on Spiders. | Duc A. Hoang, Amanj Khorramian, Ryuhei Uehara |
| 2019 | Towards a Theory of Mixing Graphs: A Characterization of Perfect Mixability (Extended Abstract). | Miguel Coviello Gonzalez, Marek Chrobak |
| 2019 | Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set. | Alexander Gke, Dniel Marx, Matthias Mnich |
| 2019 | The Parameterized Position Heap of a Trie. | Noriki Fujisato, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda |
| 2019 | Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation. | Sndor P. Fekete, Dominik Krupke |
| 2019 | Finding a Mediocre Player. | Adrian Dumitrescu |
| 2019 | Searching by Heterogeneous Agents. | Dariusz Dereniowski, Lukasz Kuszner, Robert Ostrowski |
| 2019 | Fair Hitting Sequence Problem: Scheduling Activities with Varied Frequency Requirements. | Serafino Cicerone, Gabriele Di Stefano, Leszek Gasieniec, Tomasz Jurdzinski, Alfredo Navarra, Tomasz Radzik, Grzegorz Stachowiak |
| 2019 | Vertex Deletion on Split Graphs: Beyond 4-Hitting Set. | Pratibha Choudhary, Pallavi Jain, R. Krithika, Vibha Sahlot |
| 2019 | Complexity of Scheduling for DARP with Soft Ride Times. | Janka Chlebkov, Clment Dallard, Niklas Paulsen |
| 2019 | On Hedonic Games with Common Ranking Property. | Bugra askurlu, Fatih Erdem Kizilkaya |
| 2019 | Extension of Vertex Cover and Independent Set in Some Classes of Graphs. | Katrin Casel, Henning Fernau, Mehdi Khosravian Ghadikolaei, Jrme Monnot, Florian Sikora |
| 2019 | k -cuts on a Path. | Xing Shi Cai, Luc Devroye, Cecilia Holmgren, Fiona Skerman |
| 2019 | Your Rugby Mates Don't Need to Know Your Colleagues: Triadic Closure with Edge Colors. | Laurent Bulteau, Niels Grttemeier, Christian Komusiewicz, Manuel Sorge |