PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Bonichon, Nicolas"

Author of the publication

copydeleteadd this publication to your clipboard
A Bijection for Essentially 4-Connected Toroidal Triangulations.

, and . Electr. J. Comb., 26 (1): P1.13 (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Nicolas Huber University of Stuttgart

Nicolas Kroneberg University of Stuttgart

Nicolas Möbs University of Stuttgart

Nicolas Hornek University of Stuttgart

Nicolas Chatzikiriakos University of Stuttgart

 

Other publications of authors with the same name

Improved Routing on the Delaunay Triangulation., , , , , and . ESA, volume 112 of LIPIcs, page 22:1-22:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2018)Wagner's Theorem on Realizers., , and . ICALP, volume 2380 of Lecture Notes in Computer Science, page 1043-1053. Springer, (2002)A Distributed Algorithm for Resource Clustering in Large Scale Platforms., , , , and . OPODIS, volume 5401 of Lecture Notes in Computer Science, page 564-567. Springer, (2008)Mixed Data-Parallel Scheduling for Distributed Continuous Integration., , , , and . IPDPS Workshops, page 91-98. IEEE Computer Society, (2012)Tight stretch factors for L1- and L∞-Delaunay triangulations., , , and . Comput. Geom., 48 (3): 237-250 (2015)Orthogonal drawings based on the stratification of planar graphs., , and . Discrete Mathematics, 276 (1-3): 43-57 (2004)Watermelon uniform random generation with applications., and . Theor. Comput. Sci., 307 (2): 241-256 (2003)Upper and Lower Bounds for Competitive Online Routing on Delaunay Triangulations., , , , and . CoRR, (2015)The Stretch Factor of L 1- and L ∞ -Delaunay Triangulations., , , and . ESA, volume 7501 of Lecture Notes in Computer Science, page 205-216. Springer, (2012)Planar Graphs, via Well-Orderly Maps and Trees., , , , and . Graphs and Combinatorics, 22 (2): 185-202 (2006)