| 2026 | ICALP | Computing the (k+2)-Edge-Connected Components in k-Edge-Connected Digraphs in Subquadratic Time. | Loukas Georgiadis, Evangelos Kipouridis, Evangelos Kosinas, Charis Papadopoulos, Nikos Parotsidis |
| 2023 | SODA | Faster Computation of 3-Edge-Connected Components in Digraphs. | Loukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos, Nikos Parotsidis |
| 2023 | WALCOM | Structural Parameterization of Cluster Deletion. | Giuseppe F. Italiano, Athanasios L. Konstantinidis, Charis Papadopoulos |
| 2022 | IWOCA | Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage. | Charis Papadopoulos, Spyridon Tzimas |
| 2022 | LATIN | Computing and Listing Avoidable Vertices and Paths. | Charis Papadopoulos, Athanasios E. Zisis |
| 2020 | LATIN | Graph Square Roots of Small Distance from Degree One Graphs. | Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos |
| 2020 | WG | Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. | Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle |
| 2019 | MFCS | Cluster Deletion on Interval Graphs and Split Related Graphs. | Athanasios L. Konstantinidis, Charis Papadopoulos |
| 2017 | COCOON | Strong Triadic Closure in Cographs and Graphs of Low Maximum Degree. | Athanasios L. Konstantinidis, Stavros D. Nikolopoulos, Charis Papadopoulos |
| 2017 | FCT | Polynomial-Time Algorithms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutation Graphs. | Charis Papadopoulos, Spyridon Tzimas |
| 2017 | ISAAC | Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs. | Athanasios L. Konstantinidis, Charis Papadopoulos |
| 2015 | ESA | Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. | Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis |
| 2011 | WADS | Enumerating Minimal Subset Feedback Vertex Sets. | Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger |
| 2011 | WALCOM | Counting Spanning Trees in Graphs Using Modular Decomposition. | Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos |
| 2009 | COCOON | Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone. | Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan |
| 2009 | TAMC | A Complete Characterisation of the Linear Clique-Width of Path Powers. | Pinar Heggernes, Daniel Meister, Charis Papadopoulos |
| 2008 | FAW | Characterizing and Computing Minimal Cograph Completions. | Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos |
| 2008 | MFCS | Clustering with Partial Information. | Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond |
| 2008 | TAMC | Graphs of Linear Clique-Width at Most 3. | Pinar Heggernes, Daniel Meister, Charis Papadopoulos |
| 2008 | WG | Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. | Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos |
| 2007 | COCOON | Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions. | Pinar Heggernes, Charis Papadopoulos |
| 2006 | ISAAC | Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions. | Pinar Heggernes, Federico Mancini, Charis Papadopoulos |
| 2006 | WG | A Fully Dynamic Algorithm for the Recognition of | Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos |
| 2005 | GD | Drawing Graphs Using Modular Decomposition. | Charis Papadopoulos, Constantinos Voglis |