The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Pierre Rosenstiehl: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bojan Mohar, Pierre Rosenstiehl
    A Flow Approach to Upward Drawings of Toroidal Maps. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1994, pp:33-39 [Conf]
  2. Pascal Auillans, Patrice Ossona de Mendez, Pierre Rosenstiehl, Bernard Vatant
    A Formal Model for Topic Maps. [Citation Graph (0, 0)][DBLP]
    International Semantic Web Conference, 2002, pp:69-83 [Conf]
  3. Hubert de Fraysseix, Pierre Rosenstiehl
    A characterization of planar graphs by Trémaux orders. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:2, pp:127-135 [Journal]
  4. Patrice Ossona de Mendez, Pierre Rosenstiehl
    Transitivity And Connectivity Of Permutations. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2004, v:24, n:3, pp:487-501 [Journal]
  5. Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl
    On Triangle Contact Graphs. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1994, v:3, n:, pp:233-246 [Journal]
  6. Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl
    Bipolar orientations Revisited. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1995, v:56, n:2-3, pp:157-179 [Journal]
  7. Bojan Mohar, Pierre Rosenstiehl
    Tessellation and Visibility Representations of Maps on the Torus. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:19, n:2, pp:249-263 [Journal]
  8. Pierre Rosenstiehl, Robert Endre Tarjan
    Rectilinear Planar Layouts and Bipolar Orientations of Planar Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1986, v:1, n:, pp:343-353 [Journal]
  9. Henry Crapo, Pierre Rosenstiehl
    On lacets and their manifolds. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:233, n:1-3, pp:299-320 [Journal]
  10. Michel Deza, Michel LasVergnas, Pierre Rosenstiehl
    Dedication. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 1993, v:14, n:3, pp:- [Journal]
  11. Kurt Hoffman, Kurt Mehlhorn, Pierre Rosenstiehl, Robert Endre Tarjan
    Sorting Jordan Sequences in Linear Time Using Level-Linked Search Trees [Citation Graph (0, 0)][DBLP]
    Information and Control, 1986, v:68, n:1-3, pp:170-184 [Journal]
  12. Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl
    Trémaux Trees and Planarity. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2006, v:17, n:5, pp:1017-1030 [Journal]
  13. Pierre Rosenstiehl, Robert Endre Tarjan
    Gauss Codes, Planar Hamiltonian Graphs, and Stack-Sortable Permutations. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:3, pp:375-390 [Journal]
  14. Pierre Rosenstiehl
    Scaffold permutations. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1989, v:75, n:1-3, pp:335-342 [Journal]
  15. Jean-Luc Fouquet, Pierre Rosenstiehl
    Preface. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:165, n:, pp:1-2 [Journal]

  16. Sorting Jordan sequences in linear time. [Citation Graph (, )][DBLP]


  17. Representation of Planar Hypergraphs by Contacts of Triangles. [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.005secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002