Lorna Stewart

Richard Anthony Valenzano

Discret. Appl. Math., 2018

2017

Equivalence of the filament and overlap graphs of subtrees of limited trees.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2017

2016

Games on interval and permutation graph representations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

2014

On List Coloring and List Homomorphism of Permutation and Interval Graphs.

[BibT_eX]

[DOI]

Gábor Tardos

SIAM J. Discret. Math., 2014

2012

Simple Graphs as Simplicial Complexes: the Mycielskian of a Graph.

[BibT_eX]

[DOI]

Piotr Rudnicki

Formaliz. Math., 2012

On List Colouring and List Homomorphism of Permutation and Interval Graphs

[BibT_eX]

[DOI]

Gábor Tardos

CoRR, 2012

2011

The Mycielskian of a Graph.

[BibT_eX]

[DOI]

Piotr Rudnicki

Formaliz. Math., 2011

On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two.

[BibT_eX]

[DOI]

Discret. Math., 2011

3-List Colouring Permutation Graphs

[BibT_eX]

[DOI]

CoRR, 2011

2010

The overlap number of a graph

[BibT_eX]

[DOI]

Bill Rosgen

CoRR, 2010

2009

The LBFS Structure and Recognition of Interval Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2009

DP-Complete Problems Derived from Extremal NP-Complete Properties.

[BibT_eX]

[DOI]

Yi Cao

Joseph C. Culberson

Proceedings of the Mathematical Foundations of Computer Science 2009, 2009

2007

Subtree filament graphs are subtree overlap graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Complexity Results on Graphs with Few Cliques.

[BibT_eX]

[DOI]

Bill Rosgen

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

2006

Linear Orderings of Subfamilies of AT-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2006

Approximating the minimum clique cover and other hard problems in subtree filament graphs.

[BibT_eX]

[DOI]

J. Mark Keil

Discret. Appl. Math., 2006

2005

Recognizing Maximal Unfrozen Graphs with respect to Independent Sets is CO-NP-complete.

[BibT_eX]

[DOI]

Nesrine Abbas

Joseph C. Culberson

Discret. Math. Theor. Comput. Sci., 2005

2003

Maximum independent set and maximum clique algorithms for overlap graphs.

[BibT_eX]

[DOI]

Eowyn Cenek

Discret. Appl. Math., 2003

2001

On Subfamilies of AT-Free Graphs.

[BibT_eX]

[DOI]

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

2000

Biconvex graphs: ordering and algorithms.

[BibT_eX]

[DOI]

Nesrine Abbas

Discret. Appl. Math., 2000

1999

Linear Time Algorithms for Dominating Pairs in Asteroidal Triple-free Graphs.

[BibT_eX]

[DOI]

SIAM J. Comput., 1999

Approximating Bandwidth by Mixing Layouts of Interval Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 1999

Clustering Bipartite, Chordal Graphs: Complexity, Sequential, Parallel Algorithms.

[BibT_eX]

[DOI]

Nesrine Abbas

Discret. Appl. Math., 1999

LBFS Orderings and Cocomparability Graphs.

[BibT_eX]

[DOI]

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1998

Polygon Graph Recognition.

[BibT_eX]

[DOI]

Ehab S. Elmallah

J. Algorithms, 1998

The Ultimate Interval Graph Recognition Algorithm? (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 1998

1997

Asteroidal Triple-Free Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1997

Total Domination and Transformation.

[BibT_eX]

[DOI]

Ramesh S. Sankaranarayana

Inf. Process. Lett., 1997

1996

Recursively decomposable well-covered graphs.

[BibT_eX]

[DOI]

Discret. Math., 1996

1995

A Linear Time Algorithm to Compute a Dominating Path in an AT-Free Graph.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Computing a Dominating Pair in an Asteroidal Triple-free Graph in Linear Time.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures, 4th International Workshop, 1995

1994

On Cocolourings and Cochromatic Numbers of Graphs.

[BibT_eX]

[DOI]

John G. Gimbel

Discret. Appl. Math., 1994

1993

Domination on Cocomparability Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1993

Independence and domination in Polygon Graphs.

[BibT_eX]

[DOI]

Ehab S. Elmallah

Ramesh S. Sankaranarayana

Discret. Appl. Math., 1993

1992

Complexity results for well-covered graphs.

[BibT_eX]

[DOI]

Networks, 1992

1990

Dominating sets in perfect graphs.

[BibT_eX]

[DOI]

Discret. Math., 1990

Permutation graphs: Connected domination and Steiner trees.

[BibT_eX]

[DOI]

Charles J. Colbourn

Discret. Math., 1990

1987

Bipartite permutation graphs.

[BibT_eX]

[DOI]

Jeremy P. Spinrad

Andreas Brandstädt

Discret. Appl. Math., 1987

1985

Permutation graph structure and algorithms.

[BibT_eX]

[DOI]

PhD thesis, 1985

A Linear Recognition Algorithm for Cographs.

[BibT_eX]

[DOI]

Yehoshua Perl

SIAM J. Comput., 1985

1981

Complement reducible graphs.

[BibT_eX]

[DOI]