Hubert de Fraysseix

Proceedings of the Handbook on Graph Drawing and Visualization., 2013

2012

Trémaux trees and planarity.

[BibT_eX]

[DOI]

Eur. J. Comb., 2012

2008

Trémaux Trees and Planarity.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2008

2007

Barycentric systems and stretchability.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

Representations by Contact and Intersection of Segments.

[BibT_eX]

[DOI]

Algorithmica, 2007

Representation of Planar Hypergraphs by Contacts of Triangles.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 15th International Symposium, 2007

2006

Trémaux Trees and Planarity.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2006

2004

Contact and Intersection Representations.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003

On Cotree-Critical and DFS Cotree-Critical Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2003

Stretching of Jordan Arc Contact Systems.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002

Guest Editors' Foreword.

[BibT_eX]

[DOI]

Jan Kratochvíl

J. Graph Algorithms Appl., 2002

2001

Connectivity of Planar Graphs.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2001

On topological aspects of orientations.

[BibT_eX]

[DOI]

Discret. Math., 2001

A Characterization of DFS Cotree Critical Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 9th International Symposium, 2001

1999

On a Characterization of Gauss Codes.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 1999

An Heuristic for Graph Symmetry Detection.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 7th International Symposium, 1999

1997

A Short Proof of a Gauss Problem.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, 5th International Symposium, 1997

Intersection graphs of Jordan arcs.

[BibT_eX]

[DOI]

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

1996

Planarity and Edge Poset Dimension.

[BibT_eX]

[DOI]

Eur. J. Comb., 1996

1995

A Left-First Search Algorithm for Planar Graphs.

[BibT_eX]

[DOI]

János Pach

Discret. Comput. Geom., 1995

Bipolar orientations Revisited.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1995

1994

On Triangle Contact Graphs.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 1994

Regular Orientations, Arboricity, and Augmentation.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993

Partial orders for planarity and drawings (abstract).

[BibT_eX]

[DOI]

SIGACT News, 1993

1990

How to draw a planar graph on a grid.

[BibT_eX]

[DOI]

János Pach

Richard Pollack

Comb., 1990

1989

Notes on Oriented Depth-First Search and Longest Paths.

[BibT_eX]

[DOI]

Hiroshi Imai

Inf. Process. Lett., 1989

1988

Small Sets Supporting Fáry Embeddings of Planar Graphs

[BibT_eX]

[DOI]

János Pach

Richard Pollack

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1985

A characterization of planar graphs by Trémaux orders.

[BibT_eX]

[DOI]

Comb., 1985

1984

A Characterization of Circle Graphs.

[BibT_eX]

[DOI]

Eur. J. Comb., 1984

1981

Local complementation and interlacement graphs.

[BibT_eX]

[DOI]