Hubert de Fraysseix

Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.

? Tutorial for this page

Demo Data from EDBT 2026 / reviewers in the wild / expert

dblp:22/2095 · DBLP profile ↗

← Back

13ranked-venue papers

13as first author

0since 2021 · last 2007

—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 11 · 11 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science

1 paper

Computational geometry · 67% Graph algorithms and graph theory · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

Topic	Papers	Last	Evidence papers
Computational geometry graph drawing	1	1988	Small Sets Supporting Fáry Embeddings of Planar Graphs · STOC 1988
Graph algorithms and graph theory › graph embedding grid embedding	1	1988	Small Sets Supporting Fáry Embeddings of Planar Graphs · STOC 1988
Computational geometry › graph drawing planar straight-line drawing	1	1988	Small Sets Supporting Fáry Embeddings of Planar Graphs · STOC 1988

Year	Publication	Venue	Position
2007	Representation of Planar Hypergraphs by Contacts of Triangles Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl	GD	1
2007	Representations by Contact and Intersection of Segments Hubert de Fraysseix, Patrice Ossona de Mendez	Algorithmica	1
2007	Barycentric systems and stretchability Hubert de Fraysseix, Patrice Ossona de Mendez	Discret. Appl. Math.	1
2004	Contact and Intersection Representations Hubert de Fraysseix, Patrice Ossona de Mendez	GD	1
2003	Stretching of Jordan Arc Contact Systems Hubert de Fraysseix, Patrice Ossona de Mendez	GD	1
2001	A Characterization of DFS Cotree Critical Graphs Hubert de Fraysseix, Patrice Ossona de Mendez	GD	1
1999	An Heuristic for Graph Symmetry Detection Hubert de Fraysseix	GD	1
1999	On a Characterization of Gauss Codes Hubert de Fraysseix, Patrice Ossona de Mendez	Discret. Comput. Geom.	1
1997	A Short Proof of a Gauss Problem Hubert de Fraysseix, Patrice Ossona de Mendez	GD	1
1995	Bipolar orientations Revisited Hubert de Fraysseix, Patrice Ossona de Mendez, Pierre Rosenstiehl	Discret. Appl. Math.	1
1995	A Left-First Search Algorithm for Planar Graphs Hubert de Fraysseix, Patrice Ossona de Mendez, János Pach	Discret. Comput. Geom.	1
1989	Notes on Oriented Depth-First Search and Longest Paths Hubert de Fraysseix, Hiroshi Imai	Inf. Process. Lett.	1
1988	Small Sets Supporting Fáry Embeddings of Planar Graphs abstract Answering a question of Rosenstiehl and Tarjan, we show that every plane graph with n vertices has a Fáry embedding (i.e., straight-line embedding) on the 2n - 4 by n - 2 grid and provide an Ο(n) space, Ο(n log n) time algorithm to effect this embedding. The grid size is asymptotically optimal and it had been previously unknown whether one can always find a polynomial sized grid to support such an embedding. On the other hand we show that any set F, which can support a Fáry embedding of every planar graph of size n, has cardinality at least n + (1 - ο(1)) √n which settles a problem of Mohar. Hubert de Fraysseix, János Pach, Ricky Pollack	STOC	1