Hubert de Fraysseix

According to our database1, Hubert de Fraysseix authored at least 30 papers between 1981 and 2013.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

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

2012
Trémaux trees and planarity.
Eur. J. Comb., 2012

2008
Trémaux Trees and Planarity.
Electron. Notes Discret. Math., 2008

2007
Barycentric systems and stretchability.
Discret. Appl. Math., 2007

Representations by Contact and Intersection of Segments.
Algorithmica, 2007

Representation of Planar Hypergraphs by Contacts of Triangles.
Proceedings of the Graph Drawing, 15th International Symposium, 2007

2006
Trémaux Trees and Planarity.
Int. J. Found. Comput. Sci., 2006

2004
Contact and Intersection Representations.
Proceedings of the Graph Drawing, 12th International Symposium, 2004

2003
On Cotree-Critical and DFS Cotree-Critical Graphs.
J. Graph Algorithms Appl., 2003

Stretching of Jordan Arc Contact Systems.
Proceedings of the Graph Drawing, 11th International Symposium, 2003

2002
Guest Editors' Foreword.
J. Graph Algorithms Appl., 2002

2001
Connectivity of Planar Graphs.
J. Graph Algorithms Appl., 2001

On topological aspects of orientations.
Discret. Math., 2001

A Characterization of DFS Cotree Critical Graphs.
Proceedings of the Graph Drawing, 9th International Symposium, 2001

1999
On a Characterization of Gauss Codes.
Discrete & Computational Geometry, 1999

An Heuristic for Graph Symmetry Detection.
Proceedings of the Graph Drawing, 7th International Symposium, 1999

1997
A Short Proof of a Gauss Problem.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

Intersection graphs of Jordan arcs.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1996
Planarity and Edge Poset Dimension.
Eur. J. Comb., 1996

1995
A Left-First Search Algorithm for Planar Graphs.
Discrete & Computational Geometry, 1995

Bipolar orientations Revisited.
Discret. Appl. Math., 1995

1994
On Triangle Contact Graphs.
Combinatorics, Probability & Computing, 1994

Regular Orientations, Arboricity, and Augmentation.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

1993
Partial orders for planarity and drawings (abstract).
SIGACT News, 1993

1990
How to draw a planar graph on a grid.
Combinatorica, 1990

1989
Notes on Oriented Depth-First Search and Longest Paths.
Inf. Process. Lett., 1989

1988
Small Sets Supporting Fáry Embeddings of Planar Graphs
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1985
A characterization of planar graphs by Trémaux orders.
Combinatorica, 1985

1984
A Characterization of Circle Graphs.
Eur. J. Comb., 1984

1981
Local complementation and interlacement graphs.
Discret. Math., 1981


  Loading...