Jan Kratochvíl

Jaroslav Nesetril

Discret. Math., 2001

Foreword.

[BibT_eX]

[DOI]

Miroslav Fiedler

Jaroslav Nesetril

Discret. Math., 2001

Efficient algorithms for graphs with few P4's.

[BibT_eX]

[DOI]

Discret. Math., 2001

Fixed-parameter complexity of lambda-labelings.

[BibT_eX]

[DOI]

Jirí Fiala

Ton Kloks

Discret. Appl. Math., 2001

Complexity of Coloring Graphs without Forbidden Induced Subgraphs.

[BibT_eX]

[DOI]

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

Complexity Note on Mixed Hypergraphs.

[BibT_eX]

[DOI]

Daniel Král

Heinz-Jürgen Voss

Proceedings of the Mathematical Foundations of Computer Science 2001, 2001

Complexity of Partial Covers of Graphs.

[BibT_eX]

[DOI]

Jirí Fiala

Proceedings of the Algorithms and Computation, 12th International Symposium, 2001

Distance Constrained Labeling of Precolored Trees.

[BibT_eX]

[DOI]

Jirí Fiala

Proceedings of the Theoretical Computer Science, 7th Italian Conference, 2001

2000

Mod-2 Independence and Domination in Graphs.

[BibT_eX]

[DOI]

Magnús M. Halldórsson

Int. J. Found. Comput. Sci., 2000

Hom-properties are uniquely factorizable into irreducible factors.

[BibT_eX]

[DOI]

Peter Mihók

Discret. Math., 2000

Independent Sets with Domination Constraints.

[BibT_eX]

[DOI]

Magnús M. Halldórsson

Discret. Appl. Math., 2000

On the complexity of bicoloring clique hypergraphs of graphs (extended abstract).

[BibT_eX]

[DOI]

Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999

Rankings of Directed Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1999

New Branchwidth Territories.

[BibT_eX]

[DOI]

Ton Kloks

Haiko Müller

Proceedings of the STACS 99, 1999

1998

On the Complexity of Graph Covering Problems.

[BibT_eX]

Nord. J. Comput., 1998

Brooks-type theorems for choosability with separation.

[BibT_eX]

[DOI]

Margit Voigt

J. Graph Theory, 1998

Complexity of choosing subsets from color sets.

[BibT_eX]

[DOI]

Margit Voigt

Discret. Math., 1998

On intersection representations of co-planar graphs.

[BibT_eX]

[DOI]

Ales Kubena

Discret. Math., 1998

Disjoint and unfolding domination in graphs.

[BibT_eX]

[DOI]

Australas. J Comb., 1998

Crossing Number of Abstract Topological Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 6th International Symposium, 1998

1997

Coloring precolored perfect graphs.

[BibT_eX]

[DOI]

András Sebö

J. Graph Theory, 1997

Covering Regular Graphs.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1997

On the computational complexity of (O, P)-partition problems.

[BibT_eX]

[DOI]

Ingo Schiermeyer

Discuss. Math. Graph Theory, 1997

Graphs maximal with respect to hom-properties.

[BibT_eX]

[DOI]

Peter Mihók

Gabriel Semanisin

Discuss. Math. Graph Theory, 1997

Covering and coloring polygon-circle graphs.

[BibT_eX]

[DOI]

Alexandr V. Kostochka

Discret. Math., 1997

Transversal Partitioning in Balanced Hypergraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1997

Complexity of Colored Graph Covers I. Colored Directed Multigraphs.

[BibT_eX]

[DOI]

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

Computational Complexity of the Krausz Dimension of Graphs.

[BibT_eX]

[DOI]

Petr Hlinený

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

New trends in the theory of graph colorings: Choosability and list coloring.

[BibT_eX]

[DOI]

Margit Voigt

Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996

Intersection Graphs of Noncrossing Arc-Connected Sets in the Plane.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1996

1995

Generalized Domination in Chordal Graphs.

[BibT_eX]

Paul D. Manuel

Mirka Miller

Nord. J. Comput., 1995

The Complexity of Induced Minors and Related Problems.

[BibT_eX]

[DOI]

Algorithmica, 1995

Grid Intersection and Box Intersection Graphs on Surfaces (Extended Abstract).

[BibT_eX]

[DOI]

Teresa M. Przytycka

Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

1994

Intersection Graphs of Segments.

[BibT_eX]

[DOI]

Jirí Matousek

J. Comb. Theory, Ser. B, 1994

Intersection Dimensions of Graph Classes.

[BibT_eX]

[DOI]

Graphs Comb., 1994

Regular codes in regular graphs are difficult.

[BibT_eX]

[DOI]

Discret. Math., 1994

Algorithmic complexity of list colorings.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

A Special Planar Satisfiability Problem and a Consequence of Its NP-completeness.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1994

1993

One More Occurrence of Variables Makes Satisfiability Jump From Trivial to NP-Complete.

[BibT_eX]

[DOI]

Petr Savický

SIAM J. Comput., 1993

Satisfiability of Co-Nested Formulas.

[BibT_eX]

[DOI]

Mirko Krivánek

Acta Informatica, 1993

1992

Thresholds for classes of intersection graphs.

[BibT_eX]

[DOI]

Svante Janson

Discret. Math., 1992

Compatible 2-factors.

[BibT_eX]

[DOI]

Svatopluk Poljak

Discret. Appl. Math., 1992

1991

Noncrossing Subgraphs in Topological Layouts.

[BibT_eX]

[DOI]

Anna Lubiw

Jaroslav Nesetril

SIAM J. Discret. Math., 1991

Proportional Graphs.

[BibT_eX]

[DOI]

Svante Janson

Random Struct. Algorithms, 1991

String graphs requiring exponential representations.

[BibT_eX]

[DOI]

Jirí Matousek

J. Comb. Theory, Ser. B, 1991

String graphs. II. recognizing string graphs is NP-hard.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1991

String graphs. I. The number of critical nonstring graphs is infinite.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 1991

Induced minors and related problems.

[BibT_eX]

Proceedings of the Graph Structure Theory, 1991

1988

On Restricted Two-Factors.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 1988

On the number of Hamiltonian cycles in triangulations.

[BibT_eX]

[DOI]

Dainis Zeps

J. Graph Theory, 1988

On the Computational Complexity of Codes in Graphs.

[BibT_eX]

[DOI]

Mirko Krivánek

Proceedings of the Mathematical Foundations of Computer Science 1988, 1988

1986

Perfect codes over graphs.

[BibT_eX]

[DOI]