Pierre Rosenstiehl

According to our database1, Pierre Rosenstiehl authored at least 21 papers between 1984 and 2017.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2017
Announcement from the Editors.
Eur. J. Comb., 2017

2015
Foreword.
Eur. J. Comb., 2015

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
Transitivity And Connectivity Of Permutations.
Comb., 2004

2002
A Formal Model for Topic Maps.
Proceedings of the Semantic Web, 2002

2001
On lacets and their manifolds.
Discret. Math., 2001

2000
Coding Properties of Breadth-First Search Orderings.
Electron. Notes Discret. Math., 2000

1998
Tessellation and Visibility Representations of Maps on the Torus.
Discret. Comput. Geom., 1998

1997
Preface.
Discret. Math., 1997

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

1994
On Triangle Contact Graphs.
Comb. Probab. Comput., 1994

A Flow Approach to Upward Drawings of Toroidal Maps.
Proceedings of the Graph Drawing, DIMACS International Workshop, 1994

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

Dedication.
Eur. J. Comb., 1993

1989
Scaffold permutations.
Discret. Math., 1989

1986
Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees
Inf. Control., 1986

Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs.
Discret. Comput. Geom., 1986

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

Sorting Jordan sequences in linear time.
Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984
Gauss Codes, Planar Hamiltonian Graphs, and Stack-Sortable Permutations.
J. Algorithms, 1984


  Loading...