| 2021 | A Heuristic Approach to the Treedepth Decomposition Problem for Large Graphs. Sylwester Swat, Marta Kasprzak |
| 2021 | A Linear-Time Parameterized Algorithm for Computing the Width of a DAG. Manuel Cáceres, Massimo Cairo, Brendan Mumey, Romeo Rizzi, Alexandru I. Tomescu |
| 2021 | Acyclic, Star, and Injective Colouring: Bounding the Diameter. Christoph Brause, Petr A. Golovach, Barnaby Martin, Daniël Paulusma, Siani Smith |
| 2021 | Bears with Hats and Independence Polynomials. Václav Blazej, Pavel Dvorák, Michal Opler |
| 2021 | Beyond Helly Graphs: The Diameter Problem on Absolute Retracts. Guillaume Ducoffe |
| 2021 | Block Elimination Distance. Öznur Yasar Diner, Archontia C. Giannopoulou, Giannos Stamoulis, Dimitrios M. Thilikos |
| 2021 | Can Romeo and Juliet Meet? or Rendezvous Games with Adversaries on Graphs. Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos |
| 2021 | Complementation in T-perfect Graphs. Yixin Cao, Shenghua Wang |
| 2021 | Completion to Chordal Distance-Hereditary Graphs: A Quartic Vertex-Kernel. Christophe Crespelle, Benjamin Gras, Anthony Perez |
| 2021 | Disjoint Stable Matchings in Linear Time. Aadityan Ganesh, Vishwa Prakash HV, Prajakta Nimbhorkar, Geevarghese Philip |
| 2021 | FPT Algorithms to Compute the Elimination Distance to Bipartite Graphs and More. Bart M. P. Jansen, Jari J. H. de Kroon |
| 2021 | Feedback Vertex Set on Hamiltonian Graphs. Dario Cavallaro, Till Fluschnik |
| 2021 | Graph-Theoretic Concepts in Computer Science - 47th International Workshop, WG 2021, Warsaw, Poland, June 23-25, 2021, Revised Selected Papers Lukasz Kowalik, Michal Pilipczuk, Pawel Rzazewski |
| 2021 | Labeling Schemes for Deterministic Radio Multi-broadcast. Colin Krisko, Avery Miller |
| 2021 | Linearizable Special Cases of the Quadratic Shortest Path Problem. Eranda Çela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, Lasse Wulf |
| 2021 | Odd Cycle Transversal in Mixed Graphs. Avinandan Das, Lawqueen Kanesh, Jayakrishnan Madathil, Saket Saurabh |
| 2021 | On 3-Coloring of (2P Vít Jelínek, Tereza Klimosová, Tomás Masarík, Jana Novotná, Aneta Pokorná |
| 2021 | On Additive Spanners in Weighted Graphs with Local Error. Abu Reyan Ahmed, Greg Bodwin, Keaton Hamm, Stephen G. Kobourov, Richard Spence |
| 2021 | On Fair Covering and Hitting Problems. Sayan Bandyapadhyay, Aritra Banik, Sujoy Bhore |
| 2021 | On Morphing 1-Planar Drawings. Patrizio Angelini, Michael A. Bekos, Fabrizio Montecchiani, Maximilian Pfister |
| 2021 | On Subgraph Complementation to H-free Graphs. Dhanyamol Antony, Jay Garchar, Sagartanu Pal, R. B. Sandeep, Sagnik Sen, R. Subashini |
| 2021 | On the Parameterized Complexity of the Connected Flow and Many Visits TSP Problem. Isja Mannens, Jesper Nederlof, Céline M. F. Swennenhuis, Krisztina Szilágyi |
| 2021 | Parameterized Complexity of Bandwidth of Caterpillars and Weighted Path Emulation. Hans L. Bodlaender |
| 2021 | Preprocessing to Reduce the Search Space: Antler Structures for Feedback Vertex Set. Huib Donkers, Bart M. P. Jansen |
| 2021 | Preventing Small (s,t)Cuts by Protecting Edges. Niels Grüttemeier, Christian Komusiewicz, Nils Morawietz, Frank Sommer |
| 2021 | The Complexity of Gerrymandering over Graphs: Paths and Trees. Matthias Bentert, Tomohiro Koana, Rolf Niedermeier |
| 2021 | The Dynamic Complexity of Acyclic Hypergraph Homomorphisms. Nils Vortmeier, Ioannis Kokkinis |
| 2021 | The Graphs of Stably Matchable Pairs. David Eppstein |
| 2021 | The Largest Connected Subgraph Game. Julien Bensmail, Foivos Fioravantes, Fionn Mc Inerney, Nicolas Nisse |
| 2021 | The Perfect Matching Cut Problem Revisited. Van Bang Le, Jan Arne Telle |
| 2021 | Towards Classifying the Polynomial-Time Solvability of Temporal Betweenness Centrality. Maciej Rymar, Hendrik Molter, André Nichterlein, Rolf Niedermeier |