Charis Papadopoulos

Publication Activity (10 Years)

Years Active: 2000-2024
Publications (10 Years): 38

Top Topics

Top Venues

Theor. Comput. Sci.

Discret. Appl. Math.

Publications

Charis Papadopoulos, Spyridon Tzimas
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage. Algorithmica 86 (3) (2024)
Charis Papadopoulos, Athanasios E. Zisis
Computing and Listing Avoidable Vertices and Paths. Algorithmica 86 (1) (2024)
Loukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos, Nikos Parotsidis
Faster Computation of 3-Edge-Connected Components in Digraphs. SODA (2023)
Giuseppe F. Italiano, Athanasios L. Konstantinidis, Charis Papadopoulos
Structural Parameterization of Cluster Deletion. WALCOM (2023)
Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos
Graph Square Roots of Small Distance from Degree One Graphs. Theory Comput. Syst. 66 (4) (2022)
Stelios Andreadis, Thanassis Mavropoulos, Nick Pantelidis, Stefanos Vrochidis, Mirette Elias, Charis Papadopoulos, Ilias Gialampoukidis, Ioannis Kompatsiaris
SPARQL querying for validating the usage of automatically georeferenced social media data as human sensors for air quality. IVMSP (2022)
Charis Papadopoulos, Athanasios E. Zisis
Computing and Listing Avoidable Vertices and Paths. LATIN (2022)
Charis Papadopoulos, Spyridon Tzimas
Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage. IWOCA (2022)
Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width. Algorithmica 84 (5) (2022)
Charis Papadopoulos, Athanasios Zisis
Computing and Listing Avoidable Vertices and Paths. CoRR (2021)
Charis Papadopoulos, Spyridon Tzimas
Computing Subset Feedback Vertex Set via Leafage. CoRR (2021)
Athanasios L. Konstantinidis, Charis Papadopoulos
Cluster Deletion on Interval Graphs and Split Related Graphs. Algorithmica 83 (7) (2021)
Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos
Parameterized Aspects of Strong Subgraph Closure. Algorithmica 82 (7) (2020)
Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos
Graph Square Roots of Small Distance from Degree One Graphs. LATIN (2020)
Athanasios L. Konstantinidis, Charis Papadopoulos
Maximizing the strong triadic closure in split graphs and proper interval graphs. Discret. Appl. Math. 285 (2020)
Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos
Graph Square Roots of Small Distance from Degree One Graphs. CoRR (2020)
Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. WG (2020)
Charis Papadopoulos, Spyridon Tzimas
Subset feedback vertex set on graphs of bounded independent set size. Theor. Comput. Sci. 814 (2020)
Charis Papadopoulos, Spyridon Tzimas
Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs. Discret. Appl. Math. 258 (2019)
Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. CoRR (2019)
Athanasios L. Konstantinidis, Charis Papadopoulos
Cluster Deletion on Interval Graphs and Split Related Graphs. MFCS (2019)
Athanasios L. Konstantinidis, Charis Papadopoulos
Cluster Deletion on Interval Graphs and Split Related Graphs. CoRR (2019)
Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos
Parameterized Aspects of Strong Subgraph Closure. CoRR (2018)
Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos
Parameterized Aspects of Strong Subgraph Closure. SWAT (2018)
Charis Papadopoulos, Spyridon Tzimas
Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size. CoRR (2018)
Athanasios L. Konstantinidis, Stavros D. Nikolopoulos, Charis Papadopoulos
Strong triadic closure in cographs and graphs of low maximum degree. Theor. Comput. Sci. 740 (2018)
Charis Papadopoulos, Spyridon Tzimas
Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size. IPEC (2018)
Charis Papadopoulos, Spyridon Tzimas
Polynomial-time Algorithms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutation Graphs. CoRR (2017)
Athanasios L. Konstantinidis, Charis Papadopoulos
Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs. ISAAC (2017)
Athanasios L. Konstantinidis, Stavros D. Nikolopoulos, Charis Papadopoulos
Strong Triadic Closure in Cographs and Graphs of Low Maximum Degree. COCOON (2017)
Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis
Sparse certificates for 2-connectivity in directed graphs. Theor. Comput. Sci. 698 (2017)
Charis Papadopoulos, Spyridon Tzimas
Polynomial-Time Algorithms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutation Graphs. FCT (2017)
Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics
Clique-width of path powers. Discret. Appl. Math. 205 (2016)
Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis
Sparse Subgraphs for 2-Connectivity in Directed Graphs. SEA (2016)
Athanasios L. Konstantinidis, Charis Papadopoulos
Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs. CoRR (2016)
Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. CoRR (2015)
Bruno Courcelle, Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics
A characterisation of clique-width through nested partitions. Discret. Appl. Math. 187 (2015)
Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis
Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. ESA (2015)
Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
Counting spanning trees using modular decomposition. Theor. Comput. Sci. 526 (2014)
Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger
Enumerating Minimal Subset Feedback Vertex Sets. Algorithmica 69 (1) (2014)
Charis Papadopoulos, Costas Voglis
Untangling graphs representing spatial relationships driven by drawing aesthetics. Panhellenic Conference on Informatics (2013)
Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
-sparse graphs. Theor. Comput. Sci. 439 (2012)
Pinar Heggernes, Daniel Meister, Charis Papadopoulos
Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs. Discret. Appl. Math. 160 (6) (2012)
Charis Papadopoulos
Restricted vertex multicut on permutation graphs. Discret. Appl. Math. 160 (12) (2012)
Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos
Cutwidth of Split Graphs and Threshold Graphs. SIAM J. Discret. Math. 25 (3) (2011)
Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
Counting Spanning Trees in Graphs Using Modular Decomposition. WALCOM (2011)
Pinar Heggernes, Daniel Meister, Charis Papadopoulos
Graphs of linear clique-width at most 3. Theor. Comput. Sci. 412 (39) (2011)
Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger
Enumerating Minimal Subset Feedback Vertex Sets. WADS (2011)
Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan
Strongly chordal and chordal bipartite graphs are sandwich monotone. J. Comb. Optim. 22 (3) (2011)
Stavros D. Nikolopoulos, Charis Papadopoulos
A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs. Graphs Comb. 27 (4) (2011)
Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos
Characterizing and computing minimal cograph completions. Discret. Appl. Math. 158 (7) (2010)
Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond
Clustering with partial information. Theor. Comput. Sci. 411 (7-9) (2010)
Stavros D. Nikolopoulos, Charis Papadopoulos
Counting Spanning Trees in Cographs: An Algorithmic Approach. Ars Comb. 90 (2009)
Stavros D. Nikolopoulos, Charis Papadopoulos
A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs. CTW (2009)
Pinar Heggernes, Daniel Meister, Charis Papadopoulos
A Complete Characterisation of the Linear Clique-Width of Path Powers. TAMC (2009)
Pinar Heggernes, Charis Papadopoulos
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions. Theor. Comput. Sci. 410 (1) (2009)
Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
-complements of asteroidal graphs. Discret. Math. 309 (10) (2009)
Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan
Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone. COCOON (2009)
Pinar Heggernes, Daniel Meister, Charis Papadopoulos
A new representation of proper interval graphs with an application to clique-width. Electron. Notes Discret. Math. 32 (2009)
Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond
Clustering with Partial Information. MFCS (2008)
Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos
Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. WG (2008)
Pinar Heggernes, Federico Mancini, Charis Papadopoulos
Minimal comparability completions of arbitrary graphs. Discret. Appl. Math. 156 (5) (2008)
Pinar Heggernes, Daniel Meister, Charis Papadopoulos
Graphs of Linear Clique-Width at Most 3. TAMC (2008)
Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos
Characterizing and Computing Minimal Cograph Completions. FAW (2008)
Pinar Heggernes, Charis Papadopoulos
Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions. COCOON (2007)
Katerina Asdre, Stavros D. Nikolopoulos, Charis Papadopoulos
-sparse graphs. J. Parallel Distributed Comput. 67 (1) (2007)
Charis Papadopoulos, Constantinos Voglis
Drawing graphs using modular decomposition. J. Graph Algorithms Appl. 11 (2) (2007)
Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
-Sparse Graphs. WG (2006)
Stavros D. Nikolopoulos, Charis Papadopoulos
graphs. Discret. Math. Theor. Comput. Sci. 8 (1) (2006)
Pinar Heggernes, Federico Mancini, Charis Papadopoulos
Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions. ISAAC (2006)
Stavros D. Nikolopoulos, Charis Papadopoulos
The Number of Spanning Trees in Kn-complements of Quasi-threshold Graphs CoRR (2005)
Charis Papadopoulos, Constantinos Voglis
Drawing Graphs Using Modular Decomposition. Graph Drawing (2005)
Stavros D. Nikolopoulos, Charis Papadopoulos
-Complements of Quasi-Threshold Graphs. Graphs Comb. 20 (3) (2004)
Stavros D. Nikolopoulos, Charis Papadopoulos
Counting Spanning Trees in Cographs. Electron. Notes Discret. Math. 13 (2003)
Stavros D. Nikolopoulos, Charis Papadopoulos
On the performance of the first-fit coloring algorithm on permutation graphs. Inf. Process. Lett. 75 (6) (2000)