Charis Papadopoulos

79 papers A* 1A 2B 15C 4Misc 4Journal 49Unranked 3

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Algorithms and Complexity of Hedge Cluster Deletion Problems. CoRR Athanasios L. Konstantinidis, Charis Papadopoulos, Georgios Velissaris
2025	J	`jnl`	Cgta. Comput. Geom. Michael A. Bekos, Charis Papadopoulos
2025	J	`jnl`	Structural Parameterization of Cluster Deletion. Algorithmica Giuseppe F. Italiano, Athanasios L. Konstantinidis, Charis Papadopoulos
2024	J	`jnl`	Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage. Algorithmica Charis Papadopoulos, Spyridon Tzimas
2024	J	`jnl`	Computing and Listing Avoidable Vertices and Paths. Algorithmica Charis Papadopoulos, Athanasios E. Zisis
2023	A*	`conf`	Faster Computation of 3-Edge-Connected Components in Digraphs. SODA Loukas Georgiadis, Evangelos Kipouridis, Charis Papadopoulos, Nikos Parotsidis
2023	B	`conf`	Structural Parameterization of Cluster Deletion. WALCOM Giuseppe F. Italiano, Athanasios L. Konstantinidis, Charis Papadopoulos
2022	C	`conf`	Computing a Minimum Subset Feedback Vertex Set on Chordal Graphs Parameterized by Leafage. IWOCA Charis Papadopoulos, Spyridon Tzimas
2022	B	`conf`	Computing and Listing Avoidable Vertices and Paths. LATIN Charis Papadopoulos, Athanasios E. Zisis
2022	J	`jnl`	Graph Square Roots of Small Distance from Degree One Graphs. Theory Comput. Syst. Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos
2022	J	`jnl`	Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width. Algorithmica Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle
2022	—	`conf`	SPARQL querying for validating the usage of automatically georeferenced social media data as human sensors for air quality. IVMSP Stelios Andreadis, Thanassis Mavropoulos, Nick Pantelidis, Stefanos Vrochidis, Mirette Elias, Charis Papadopoulos, Ilias Gialampoukidis, Ioannis Kompatsiaris
2021	J	`jnl`	Cluster Deletion on Interval Graphs and Split Related Graphs. Algorithmica Athanasios L. Konstantinidis, Charis Papadopoulos
2021	J	`jnl`	Computing Subset Feedback Vertex Set via Leafage. CoRR Charis Papadopoulos, Spyridon Tzimas
2021	J	`jnl`	Computing and Listing Avoidable Vertices and Paths. CoRR Charis Papadopoulos, Athanasios Zisis
2020	B	`conf`	Graph Square Roots of Small Distance from Degree One Graphs. LATIN Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos
2020	J	`jnl`	Graph Square Roots of Small Distance from Degree One Graphs. CoRR Petr A. Golovach, Paloma T. Lima, Charis Papadopoulos
2020	J	`jnl`	Maximizing the strong triadic closure in split graphs and proper interval graphs. Discret. Appl. Math. Athanasios L. Konstantinidis, Charis Papadopoulos
2020	B	`conf`	Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. WG Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle
2020	J	`jnl`	Parameterized Aspects of Strong Subgraph Closure. Algorithmica Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos
2020	J	`jnl`	Subset feedback vertex set on graphs of bounded independent set size. Theor. Comput. Sci. Charis Papadopoulos, Spyridon Tzimas
2019	B	`conf`	Cluster Deletion on Interval Graphs and Split Related Graphs. MFCS Athanasios L. Konstantinidis, Charis Papadopoulos
2019	J	`jnl`	Cluster Deletion on Interval Graphs and Split Related Graphs. CoRR Athanasios L. Konstantinidis, Charis Papadopoulos
2019	J	`jnl`	Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width. CoRR Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle
2019	J	`jnl`	Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs. Discret. Appl. Math. Charis Papadopoulos, Spyridon Tzimas
2018	—	`conf`	Parameterized Aspects of Strong Subgraph Closure. SWAT Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos
2018	J	`jnl`	Parameterized Aspects of Strong Subgraph Closure. CoRR Petr A. Golovach, Pinar Heggernes, Athanasios L. Konstantinidis, Paloma T. Lima, Charis Papadopoulos
2018	J	`jnl`	Strong triadic closure in cographs and graphs of low maximum degree. Theor. Comput. Sci. Athanasios L. Konstantinidis, Stavros D. Nikolopoulos, Charis Papadopoulos
2018	B	`conf`	Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size. IPEC Charis Papadopoulos, Spyridon Tzimas
2018	J	`jnl`	Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size. CoRR Charis Papadopoulos, Spyridon Tzimas
2017	B	`conf`	Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs. ISAAC Athanasios L. Konstantinidis, Charis Papadopoulos
2017	B	`conf`	Polynomial-Time Algorithms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutation Graphs. FCT Charis Papadopoulos, Spyridon Tzimas
2017	J	`jnl`	Polynomial-time Algorithms for the Subset Feedback Vertex Set Problem on Interval Graphs and Permutation Graphs. CoRR Charis Papadopoulos, Spyridon Tzimas
2017	J	`jnl`	Sparse certificates for 2-connectivity in directed graphs. Theor. Comput. Sci. Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis
2017	Misc	`conf`	Strong Triadic Closure in Cographs and Graphs of Low Maximum Degree. COCOON Athanasios L. Konstantinidis, Stavros D. Nikolopoulos, Charis Papadopoulos
2016	J	`jnl`	Clique-width of path powers. Discret. Appl. Math. Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics
2016	J	`jnl`	Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs. CoRR Athanasios L. Konstantinidis, Charis Papadopoulos
2016	B	`conf`	Sparse Subgraphs for 2-Connectivity in Directed Graphs. SEA Loukas Georgiadis, Giuseppe F. Italiano, Aikaterini Karanasiou, Charis Papadopoulos, Nikos Parotsidis
2015	J	`jnl`	A characterisation of clique-width through nested partitions. Discret. Appl. Math. Bruno Courcelle, Pinar Heggernes, Daniel Meister, Charis Papadopoulos, Udi Rotics
2015	A	`conf`	Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. ESA Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis
2015	J	`jnl`	Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs. CoRR Loukas Georgiadis, Giuseppe F. Italiano, Charis Papadopoulos, Nikos Parotsidis
2014	J	`jnl`	Counting spanning trees using modular decomposition. Theor. Comput. Sci. Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
2014	J	`jnl`	Enumerating Minimal Subset Feedback Vertex Sets. Algorithmica Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger
2013	—	`conf`	Untangling graphs representing spatial relationships driven by drawing aesthetics. Panhellenic Conference on Informatics Charis Papadopoulos, Costas Voglis
2012	J	`jnl`	A fully dynamic algorithm for the recognition of P Theor. Comput. Sci. Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
2012	J	`jnl`	Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs. Discret. Appl. Math. Pinar Heggernes, Daniel Meister, Charis Papadopoulos
2012	J	`jnl`	Restricted vertex multicut on permutation graphs. Discret. Appl. Math. Charis Papadopoulos
2011	J	`jnl`	A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs. Graphs Comb. Stavros D. Nikolopoulos, Charis Papadopoulos
2011	B	`conf`	Counting Spanning Trees in Graphs Using Modular Decomposition. WALCOM Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
2011	J	`jnl`	Cutwidth of Split Graphs and Threshold Graphs. SIAM J. Discret. Math. Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos
2011	B	`conf`	Enumerating Minimal Subset Feedback Vertex Sets. WADS Fedor V. Fomin, Pinar Heggernes, Dieter Kratsch, Charis Papadopoulos, Yngve Villanger
2011	J	`jnl`	Graphs of linear clique-width at most 3. Theor. Comput. Sci. Pinar Heggernes, Daniel Meister, Charis Papadopoulos
2011	J	`jnl`	Strongly chordal and chordal bipartite graphs are sandwich monotone. J. Comb. Optim. Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan
2010	J	`jnl`	Characterizing and computing minimal cograph completions. Discret. Appl. Math. Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos
2010	J	`jnl`	Clustering with partial information. Theor. Comput. Sci. Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond
2009	C	`conf`	A Complete Characterisation of the Linear Clique-Width of Path Powers. TAMC Pinar Heggernes, Daniel Meister, Charis Papadopoulos
2009	C	`conf`	A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs. CTW Stavros D. Nikolopoulos, Charis Papadopoulos
2009	J	`jnl`	A new representation of proper interval graphs with an application to clique-width. Electron. Notes Discret. Math. Pinar Heggernes, Daniel Meister, Charis Papadopoulos
2009	J	`jnl`	Counting Spanning Trees in Cographs: An Algorithmic Approach. Ars Comb. Stavros D. Nikolopoulos, Charis Papadopoulos
2009	J	`jnl`	Maximizing the number of spanning trees in K Discret. Math. Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
2009	J	`jnl`	Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions. Theor. Comput. Sci. Pinar Heggernes, Charis Papadopoulos
2009	Misc	`conf`	Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone. COCOON Pinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan
2008	Misc	`conf`	Characterizing and Computing Minimal Cograph Completions. FAW Daniel Lokshtanov, Federico Mancini, Charis Papadopoulos
2008	B	`conf`	Clustering with Partial Information. MFCS Hans L. Bodlaender, Michael R. Fellows, Pinar Heggernes, Federico Mancini, Charis Papadopoulos, Frances A. Rosamond
2008	B	`conf`	Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. WG Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos
2008	C	`conf`	Graphs of Linear Clique-Width at Most 3. TAMC Pinar Heggernes, Daniel Meister, Charis Papadopoulos
2008	J	`jnl`	Minimal comparability completions of arbitrary graphs. Discret. Appl. Math. Pinar Heggernes, Federico Mancini, Charis Papadopoulos
2007	J	`jnl`	An optimal parallel solution for the path cover problem on P J. Parallel Distributed Comput. Katerina Asdre, Stavros D. Nikolopoulos, Charis Papadopoulos
2007	J	`jnl`	Drawing graphs using modular decomposition. J. Graph Algorithms Appl. Charis Papadopoulos, Constantinos Voglis
2007	Misc	`conf`	Single-Edge Monotonic Sequences of Graphs and Linear-Time Algorithms for Minimal Completions and Deletions. COCOON Pinar Heggernes, Charis Papadopoulos
2006	B	`conf`	A Fully Dynamic Algorithm for the Recognition of WG Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos
2006	B	`conf`	Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions. ISAAC Pinar Heggernes, Federico Mancini, Charis Papadopoulos
2006	J	`jnl`	On the number of spanning trees of K Discret. Math. Theor. Comput. Sci. Stavros D. Nikolopoulos, Charis Papadopoulos
2005	A	`conf`	Drawing Graphs Using Modular Decomposition. GD Charis Papadopoulos, Constantinos Voglis
2005	J	`jnl`	The Number of Spanning Trees in Kn-complements of Quasi-threshold Graphs CoRR Stavros D. Nikolopoulos, Charis Papadopoulos
2005	—	`—`	Αλγόριθμοι σε κατηγορίες τέλειων γραφημάτων Charis Papadopoulos
2004	J	`jnl`	The Number of Spanning Trees in Graphs Comb. Stavros D. Nikolopoulos, Charis Papadopoulos
2003	J	`jnl`	Counting Spanning Trees in Cographs. Electron. Notes Discret. Math. Stavros D. Nikolopoulos, Charis Papadopoulos
2000	J	`jnl`	On the performance of the first-fit coloring algorithm on permutation graphs. Inf. Process. Lett. Stavros D. Nikolopoulos, Charis Papadopoulos