Charis Papadopoulos

发表

A characterisation of clique-width through nested partitions

Bruno Courcelle, Udi Rotics, Pinar Heggernes, 2015, Discret. Appl. Math..

Minimal comparability completions ∗

P. Heggernes, Charis Papadopoulos, F. Mancini, 2006 .

Computing and Listing Avoidable Vertices and Paths

Charis Papadopoulos, A. Zisis, 2021, LATIN.

Computing and extracting minimal cograph completions in linear time ∗

Charis Papadopoulos, D. Lokshtanov, F. Mancini, 2007 .

Strong Triadic Closure in Cographs and Graphs of Low Maximum Degree

Charis Papadopoulos, Stavros D. Nikolopoulos, Athanasios L. Konstantinidis, 2017, COCOON.

Enumerating Minimal Subset Feedback Vertex Sets

Fedor V. Fomin, Dieter Kratsch, Pinar Heggernes, 2011, Algorithmica.

Cluster Deletion on Interval Graphs and Split Related Graphs pdf

Charis Papadopoulos, Athanasios L. Konstantinidis, Charis Papadopoulos, 2019, Algorithmica.

Clustering with partial information

Michael R. Fellows, Pinar Heggernes, Charis Papadopoulos, 2008, Theor. Comput. Sci..

Maximizing the number of spanning trees in Kn-complements of asteroidal graphs

Leonidas Palios, Charis Papadopoulos, Stavros D. Nikolopoulos, 2009, Discret. Math..

On the number of spanning trees of Knm±G graphs

Charis Papadopoulos, Stavros D. Nikolopoulos, Charis Papadopoulos, 2006, Discret. Math. Theor. Comput. Sci..

The Number of Spanning Trees in Kn-Complements of Quasi-Threshold Graphs

Charis Papadopoulos, Stavros D. Nikolopoulos, Charis Papadopoulos, 2004, Graphs Comb..

Parameterized Aspects of Strong Subgraph Closure

Petr A. Golovach, Pinar Heggernes, Charis Papadopoulos, 2018, Algorithmica.

Maximizing the Strong Triadic Closure in Split Graphs and Proper Interval Graphs pdf

Charis Papadopoulos, Athanasios L. Konstantinidis, Charis Papadopoulos, 2016, ISAAC.

Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions

Pinar Heggernes, Charis Papadopoulos, P. Heggernes, 2007, Theor. Comput. Sci..

Clique-width of path powers

Udi Rotics, Pinar Heggernes, Charis Papadopoulos, 2016, Discret. Appl. Math..

Strongly chordal and chordal bipartite graphs are sandwich monotone

Pinar Heggernes, Charis Papadopoulos, Federico Mancini, 2011, J. Comb. Optim..

Cutwidth of Split Graphs and Threshold Graphs

Pinar Heggernes, Charis Papadopoulos, Daniel Lokshtanov, 2011, SIAM J. Discret. Math..

A Simple Linear-Time Recognition Algorithm for Weakly Quasi-Threshold Graphs

Charis Papadopoulos, Stavros D. Nikolopoulos, Charis Papadopoulos, 2011, Graphs Comb..

Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone

Pinar Heggernes, Charis Papadopoulos, Federico Mancini, 2009, COCOON.

A new representation of proper interval graphs with an application to clique-width

Pinar Heggernes, Charis Papadopoulos, Daniel Meister, 2009, Electron. Notes Discret. Math..

Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs

Pinar Heggernes, Charis Papadopoulos, Daniel Lokshtanov, 2008, WG.

Minimal comparability completions of arbitrary graphs

Pinar Heggernes, Charis Papadopoulos, Federico Mancini, 2008, Discret. Appl. Math..

Drawing graphs using modular decomposition

Charis Papadopoulos, Constantinos Voglis, Charis Papadopoulos, 2005, J. Graph Algorithms Appl..

Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width

Charis Papadopoulos, J. A. Telle, Benjamin Bergougnoux, 2019, Algorithmica.

The Number of Spanning Trees in Kn-Complements of Quasi-Threshold Graphs

Stavros D. Nikolopoulos, Charis Papadopoulos, 2004, Graphs Comb..

An optimal parallel solution for the path cover problem on P4-sparse graphs

Charis Papadopoulos, Katerina Asdre, Stavros D. Nikolopoulos, 2007, J. Parallel Distributed Comput..

Characterizing and computing minimal cograph completions

Charis Papadopoulos, Daniel Lokshtanov, Federico Mancini, 2008, Discret. Appl. Math..

Characterising the linear clique-width of a class of graphs by forbidden induced subgraphs

Pinar Heggernes, Charis Papadopoulos, Daniel Meister, 2012, Discret. Appl. Math..

Graphs of linear clique-width at most 3

Pinar Heggernes, Charis Papadopoulos, Daniel Meister, 2008, Theor. Comput. Sci..

A Complete Characterisation of the Linear Clique-Width of Path Powers

Pinar Heggernes, Charis Papadopoulos, Daniel Meister, 2009, TAMC.