Hoàng-Oanh Le

Theory Comput. Syst., April, 2024

On the d-Claw Vertex Deletion Problem.

[BibT_eX]

[DOI]

Algorithmica, February, 2024

The complexity of strong conflict-free vertex-connection k-colorability.

[BibT_eX]

[DOI]

CoRR, 2024

2023

Complexity Results for Matching Cut Problems in Graphs Without Long Induced Paths.

[BibT_eX]

[DOI]

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

2022

Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs.

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

2021

Matching Cut in Graphs with Large Minimum Degree.

[BibT_eX]

[DOI]

Algorithmica, 2021

2019

Map graphs having witnesses of large girth.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

A complexity dichotomy for matching cut in (bipartite) graphs of fixed diameter.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2019

Hardness and Structural Results for Half-Squares of Restricted Tree Convex Bipartite Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2019

Constrained Representations of Map Graphs and Half-Squares.

[BibT_eX]

[DOI]

Proceedings of the 44th International Symposium on Mathematical Foundations of Computer Science, 2019

Matching Cut in Graphs with Large Minimum Degree.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics - 25th International Conference, 2019

2016

On the Complexity of Matching Cut in Graphs of Fixed Diameter.

[BibT_eX]

[DOI]

Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

2007

Tree Spanners for Bipartite Graphs and Probe Interval Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2007

2006

Clique-Width for 4-Vertex Forbidden Subgraphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2006

2005

New Graph Classes of Bounded Clique-Width.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2005

Chordal co-gem-free and (P5, gem)-free graphs have bounded clique-width.

[BibT_eX]

[DOI]

Raffaele Mosca

Discret. Appl. Math., 2005

Clique-Width for Four-Vertex Forbidden Subgraphs.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

2004

Contributions to clique-width of graphs.

[BibT_eX]

[DOI]

PhD thesis, 2004

Tree spanners on chordal graphs: complexity and algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Gem- And Co-Gem-Free Graphs Have Bounded Clique-Width.

[BibT_eX]

[DOI]

Raffaele Mosca

Int. J. Found. Comput. Sci., 2004

2003

Structure and stability number of chair-, co-P- and gem-free graphs revisited.

[BibT_eX]

[DOI]

Jean-Marie Vanherpe

Inf. Process. Lett., 2003

Splitting a graph into disjoint induced paths or cycles.

[BibT_eX]

[DOI]

Haiko Müller

Discret. Appl. Math., 2003

2002

The NP-completeness of (1, r)-subcolorability of cubic graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

On alpha-redundant vertices in P5-free graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2002

Tree Spanners on Chordal Graphs: Complexity, Algorithms, Open Problems.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

1999

Optimal tree 3-spanners in directed path graphs.

[BibT_eX]

[DOI]