Charis Papadopoulos

Algorithmica, March, 2024

Computing and Listing Avoidable Vertices and Paths.

[BibT_eX]

[DOI]

Athanasios E. Zisis

Algorithmica, January, 2024

2023

Structural Parameterization of Cluster Deletion.

[BibT_eX]

[DOI]

Giuseppe F. Italiano

Proceedings of the WALCOM: Algorithms and Computation, 2023

Faster Computation of 3-Edge-Connected Components in Digraphs.

[BibT_eX]

[DOI]

Proceedings of the 2023 ACM-SIAM Symposium on Discrete Algorithms, 2023

2022

Graph Square Roots of Small Distance from Degree One Graphs.

[BibT_eX]

[DOI]

Petr A. Golovach

Paloma T. Lima

Theory Comput. Syst., 2022

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

[BibT_eX]

[DOI]

Benjamin Bergougnoux

Jan Arne Telle

Algorithmica, 2022

SPARQL querying for validating the usage of automatically georeferenced social media data as human sensors for air quality.

[BibT_eX]

[DOI]

Stelios Andreadis

Thanassis Mavropoulos

Proceedings of the 14th IEEE Image, Video, and Multidimensional Signal Processing Workshop, 2022

2021

Computing Subset Feedback Vertex Set via Leafage.

[BibT_eX]

[DOI]

CoRR, 2021

Cluster Deletion on Interval Graphs and Split Related Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2021

2020

Subset feedback vertex set on graphs of bounded independent set size.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

Maximizing the strong triadic closure in split graphs and proper interval graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Parameterized Aspects of Strong Subgraph Closure.

[BibT_eX]

[DOI]

Petr A. Golovach

Paloma T. Lima

Algorithmica, 2020

2019

Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2019

2018

Strong triadic closure in cographs and graphs of low maximum degree.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2018

2017

Sparse certificates for 2-connectivity in directed graphs.

[BibT_eX]

[DOI]

Loukas Georgiadis

Giuseppe F. Italiano

Aikaterini Karanasiou

Nikos Parotsidis

Theor. Comput. Sci., 2017

2016

Clique-width of path powers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2016

Sparse Subgraphs for 2-Connectivity in Directed Graphs.

[BibT_eX]

[DOI]

Loukas Georgiadis

Giuseppe F. Italiano

Aikaterini Karanasiou

Nikos Parotsidis

Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

2015

A characterisation of clique-width through nested partitions.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2015

Approximating the Smallest Spanning Subgraph for 2-Edge-Connectivity in Directed Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2015, 2015

2014

Counting spanning trees using modular decomposition.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Enumerating Minimal Subset Feedback Vertex Sets.

[BibT_eX]

[DOI]

Algorithmica, 2014

2013

Untangling graphs representing spatial relationships driven by drawing aesthetics.

[BibT_eX]

[DOI]

Costas Voglis

Proceedings of the 17th Panhellenic Conference on Informatics, 2013

2012

A fully dynamic algorithm for the recognition of P4-sparse graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

Restricted vertex multicut on permutation graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

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

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

2011

Graphs of linear clique-width at most 3.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Cutwidth of Split Graphs and Threshold Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

Strongly chordal and chordal bipartite graphs are sandwich monotone.

[BibT_eX]

[DOI]

J. Comb. Optim., 2011

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

[BibT_eX]

[DOI]

Graphs Comb., 2011

Counting Spanning Trees in Graphs Using Modular Decomposition.

[BibT_eX]

[DOI]

Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

2010

Clustering with partial information.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Characterizing and computing minimal cograph completions.

[BibT_eX]

[DOI]

Daniel Lokshtanov

Federico Mancini

Discret. Appl. Math., 2010

2009

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

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

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2009

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

[BibT_eX]

[DOI]

Discret. Math., 2009

Counting Spanning Trees in Cographs: An Algorithmic Approach.

[BibT_eX]

Ars Comb., 2009

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

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 6th Annual Conference, 2009

2008

Minimal comparability completions of arbitrary graphs.

[BibT_eX]

[DOI]

Federico Mancini

Discret. Appl. Math., 2008

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

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2008

2007

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

[BibT_eX]

[DOI]

Katerina Asdre

J. Parallel Distributed Comput., 2007

Drawing graphs using modular decomposition.

[BibT_eX]

[DOI]

Constantinos Voglis

J. Graph Algorithms Appl., 2007

2006

On the number of spanning trees of Knm±G graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2006

A Fully Dynamic Algorithm for the Recognition of P4-Sparse Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2006

Making Arbitrary Graphs Transitively Orientable: Minimal Comparability Completions.

[BibT_eX]

[DOI]

Federico Mancini

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

2005

Αλγόριθμοι σε κατηγορίες τέλειων γραφημάτων

[BibT_eX]

[DOI]

PhD thesis, 2005

The Number of Spanning Trees in Kn-complements of Quasi-threshold Graphs

[BibT_eX]

[DOI]

CoRR, 2005

2004

The Number of Spanning Trees in K n-Complements of Quasi-Threshold Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2004

2003

Counting Spanning Trees in Cographs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2003

2000

On the performance of the first-fit coloring algorithm on permutation graphs.

[BibT_eX]

[DOI]