Author of the publication

The Galois Complexity of Graph Drawing: Why Numerical Solutions Are Ubiquitous for Force-Directed, Spectral, and Circle Packing Drawings.

, , , and . GD, volume 8871 of Lecture Notes in Computer Science, page 149-161. Springer, (2014)

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.

 

Other publications of authors with the same name

The Online House Numbering Problem: Min-Max Online List Labeling., , , and . ESA, volume 87 of LIPIcs, page 33:1-33:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Quadratic Time Algorithms Appear to be Optimal for Sorting Evolving Data., , , , and . CoRR, (2018)Parallel Equivalence Class Sorting: Algorithms, Lower Bounds, and Distribution-Based Analysis., , and . SPAA, page 265-274. ACM, (2016)Windows into Geometric Events: Data Structures for Time-Windowed Querying of Temporal Point Sets., , , , and . CCCG, Carleton University, Ottawa, Canada, (2014)Small Superpatterns for Dominance Drawing., , and . ANALCO, page 92-103. SIAM, (2014)Graph Drawing Contest Report., , , and . GD, volume 11282 of Lecture Notes in Computer Science, page 609-617. Springer, (2018)Scheduling Autonomous Vehicle Platoons Through an Unregulated Intersection., , , and . ATMOS, volume 54 of OASIcs, page 5:1-5:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Track Layouts, Layered Path Decompositions, and Leveled Planarity., , , , and . Algorithmica, 81 (4): 1561-1583 (2019)Optimally Sorting Evolving Data., , , , and . ICALP, volume 107 of LIPIcs, page 81:1-81:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Square-Contact Representations of Partial 2-Trees and Triconnected Simply-Nested Graphs., , , and . ISAAC, volume 92 of LIPIcs, page 24:1-24:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)