Van Bang Le

Theory Comput. Syst., April, 2024

On the d-Claw Vertex Deletion Problem.

[BibT_eX]

[DOI]

Algorithmica, February, 2024

2023

Maximizing Matching Cuts.

[BibT_eX]

[DOI]

CoRR, 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

Computing Optimal Leaf Roots of Chordal Cographs in Linear Time.

[BibT_eX]

[DOI]

Christian Rosenke

Proceedings of the Fundamentals of Computation Theory - 24th International Symposium, 2023

2022

The perfect matching cut problem revisited.

[BibT_eX]

[DOI]

Jan Arne Telle

Theor. Comput. Sci., 2022

Refined notions of parameterized enumeration kernels with applications to matching cut enumeration.

[BibT_eX]

[DOI]

Petr A. Golovach

Christian Komusiewicz

J. Comput. Syst. Sci., 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

On the d-Claw Vertex Deletion Problem.

[BibT_eX]

[DOI]

Sun-Yuan Hsieh

Proceedings of the Computing and Combinatorics - 27th International Conference, 2021

2020

Color-line and proper color-line graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

Matching cut: Kernelization, single-exponential time FPT, and exact exponential algorithms.

[BibT_eX]

[DOI]

Christian Komusiewicz

Discret. Appl. Math., 2020

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

2018

On the complete width and edge clique cover problems.

[BibT_eX]

[DOI]

J. Comb. Optim., 2018

2017

Good characterizations and linear time recognition for 2-probe block graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Characterization and recognition of some opposition and coalition graph classes.

[BibT_eX]

[DOI]

Thomas Podelleck

Discret. Appl. Math., 2017

Preface: Special graph classes and algorithms-in honor of Professor Andreas Brandstädt on the occasion of his 65th birthday.

[BibT_eX]

[DOI]

Feodor F. Dragan

Discret. Appl. Math., 2017

2016

A unified approach to recognize squares of split graphs.

[BibT_eX]

[DOI]

Andrea Oversberg

Oliver Schaudt

Theor. Comput. Sci., 2016

Algorithms solving the Matching Cut problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 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

2015

Characterizing and recognizing probe block graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2015

Polynomial time recognition of squares of Ptolemaic graphs and 3-sun-free split graphs.

[BibT_eX]

[DOI]

Andrea Oversberg

Oliver Schaudt

Theor. Comput. Sci., 2015

Forests and trees among Gallai graphs.

[BibT_eX]

[DOI]

Felix Joos

Discret. Math., 2015

2014

Complexity results for rainbow matchings.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2014

Complexity and algorithms for recognizing polar and monopolar graphs.

[BibT_eX]

[DOI]

Ragnar Nevries

Theor. Comput. Sci., 2014

A note on efficient domination in a superclass of P5-free graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2014

On opposition graphs, coalition graphs, and bipartite permutation graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2014

Preface.

[BibT_eX]

[DOI]

Hans-Dietrich O. F. Gronau

Konrad Engel

Roger Labahn

Discret. Appl. Math., 2014

Squares of $3$-sun-free split graphs.

[BibT_eX]

[DOI]

Andrea Oversberg

Oliver Schaudt

CoRR, 2014

2013

Integral mixed unit interval graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2013

Extremal Graphs Having No Stable Cutset.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

2012

Mixed unit interval graphs.

[BibT_eX]

[DOI]

Jayme Luiz Szwarcfiter

Discret. Math., 2012

Complexity of Finding Graph Roots with Girth Conditions.

[BibT_eX]

[DOI]

Algorithmica, 2012

2011

A good characterization of squares of strongly chordal split graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2011

Path-Bicolorable Graphs.

[BibT_eX]

[DOI]

Martin Charles Golumbic

Marina Lipshteyn

Graphs Comb., 2011

Two characterizations of chain partitioned probe graphs.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2011

Recognizing Polar Planar Graphs Using New Results for Monopolarity.

[BibT_eX]

[DOI]

Ragnar Nevries

Proceedings of the Algorithms and Computation - 22nd International Symposium, 2011

2010

Exact leaf powers.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

The square of a block graph.

[BibT_eX]

[DOI]

Discret. Math., 2010

2009

Simplicial powers of graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Probe threshold and probe trivially perfect graphs.

[BibT_eX]

[DOI]

Daniel Bayer

Theor. Comput. Sci., 2009

A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers.

[BibT_eX]

[DOI]

Discret. Math., 2009

Preface.

[BibT_eX]

[DOI]

Hans-Dietrich O. F. Gronau

Konrad Engel

Discret. Appl. Math., 2009

Hardness Results and Efficient Algorithms for Graph Powers.

[BibT_eX]

[DOI]

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

Computing Graph Roots Without Short Cycles.

[BibT_eX]

[DOI]

Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, 2009

2008

Structure and linear-time recognition of 4-leaf powers.

[BibT_eX]

[DOI]

R. Sritharan

ACM Trans. Algorithms, 2008

On stable cutsets in claw-free graphs and planar graphs.

[BibT_eX]

[DOI]

Raffaele Mosca

Haiko Müller

J. Discrete Algorithms, 2008

Probe Ptolemaic Graphs.

[BibT_eX]

[DOI]

Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

2007

On the complexity of 4-coloring graphs without long induced paths.

[BibT_eX]

[DOI]

Bert Randerath

Ingo Schiermeyer

Theor. Comput. Sci., 2007

New applications of clique separator decomposition for the Maximum Weight Stable Set problem.

[BibT_eX]

[DOI]

Suhail Mahfud

Theor. Comput. Sci., 2007

Probe Split Graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2007

Tree Spanners for Bipartite Graphs and Probe Interval Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2007

Characterisations and Linear-Time Recognition of Probe Cographs.

[BibT_eX]

[DOI]

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

Linear-time certifying recognition for partitioned probe cographs.

[BibT_eX]

[DOI]

Proceedings of the Exact, Approximative, Robust and Certifying Algorithms on Particular Graph Classes, 20.05., 2007

2006

Structure and linear time recognition of 3-leaf powers.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Graph classes related to chordal graphs and chordal bipartite graphs.

[BibT_eX]

[DOI]

Jörg Bornemann

Electron. Notes Discret. Math., 2006

On probe classes of graphs.

[BibT_eX]

[DOI]

Daniel Bayer

Electron. Notes Discret. Math., 2006

Distance-Hereditary 5-Leaf Powers.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2006

2005

Bisplit graphs.

[BibT_eX]

[DOI]

Discret. Math., 2005

2004

Tree spanners on chordal graphs: complexity and algorithms.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Split-Perfect Graphs: Characterizations and Algorithmic Use.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2004

Efficient robust algorithms for the Maximum Weight Stable Set Problem in chair-free graph classes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2004

Consequences of an algorithm for bridged graphs.

[BibT_eX]

[DOI]

Jeremy P. Spinrad

Discret. Math., 2004

2003

On stable cutsets in line graphs.

[BibT_eX]

[DOI]

Bert Randerath

Theor. Comput. Sci., 2003

Graph Subcolorings: Complexity and Algorithms.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2003

Splitting a graph into disjoint induced paths or cycles.

[BibT_eX]

[DOI]

Haiko Müller

Discret. Appl. Math., 2003

Stability number of bull- and chair-free graphs revisited.

[BibT_eX]

[DOI]

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

Recognizing the P4-structure of claw-free graphs and a larger graph class.

[BibT_eX]

[DOI]

Luitpold Babel

Discret. Math. Theor. Comput. Sci., 2002

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

[BibT_eX]

[DOI]

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

2001

P4-Colorings and P4-Bipartite Graphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2001

2000

Recognizing Perfect 2-Split Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2000

Efficiently Recognizing the P 4-Structure of Trees and of Bipartite Graphs Without Short Cycles.

[BibT_eX]

[DOI]

Stephan Olariu

Graphs Comb., 2000

Some conjectures on perfect graphs.

[BibT_eX]

[DOI]

Discuss. Math. Graph Theory, 2000

On P4-transversals of perfect graphs.

[BibT_eX]

[DOI]

Discret. Math., 2000

Recognizing the P4-structure of Block Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

On stable cutsets in graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2000

1999

Optimal tree 3-spanners in directed path graphs.

[BibT_eX]

[DOI]

Networks, 1999

A good characterization of cograph contractions.

[BibT_eX]

[DOI]

J. Graph Theory, 1999

Bipartite-Perfect Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 1999

Tree- and Forest-perfect Graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1999

Recognizing the P4-structure of Bipartite Graphs.

[BibT_eX]

[DOI]

Luitpold Babel

Discret. Appl. Math., 1999

1998

The Complexity of some Problems Related to Graph 3-colorability.

[BibT_eX]

[DOI]

Thomas Szymczak

Discret. Appl. Math., 1998

1997

Wing-triangulated graphs are perfect.

[BibT_eX]

[DOI]

Stefan Hougardy

Annegret Wagler

J. Graph Theory, 1997

Duchet-type theorems for powers of HHD-free graphs.

[BibT_eX]

[DOI]

Thomas Szymczak

Discret. Math., 1997

1996

Cycle-perfect graphs are perfect.

[BibT_eX]

[DOI]

J. Graph Theory, 1996

Gallai graphs and anti-Gallai graphs.

[BibT_eX]

[DOI]

Discret. Math., 1996

1994

Iteratedk-line graphs.

[BibT_eX]

[DOI]

Erich Prisner

Graphs Comb., 1994

1993

Perfect k-line graphs and k-total graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 1993

1992

On inverse problems for the cycle graph operator.

[BibT_eX]

[DOI]