Author of the publication

How to eat a graph: computing selection sequences for the continuous generalization of road networks.

, , and . SIGSPATIAL/GIS, page 243-252. ACM, (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

A Closer Look at the Closest String and Closest Substring Problem., , and . ALENEX, page 13-24. SIAM, (2011)A Practical Method for the Minimum Genus of a Graph: Models and Experiments., , , and . SEA, volume 9685 of Lecture Notes in Computer Science, page 75-88. Springer, (2016)How not to characterize planar-emulable graphs., , , and . Adv. Appl. Math., 50 (1): 46-68 (2013)Planarisation and Crossing Minimisation.. Encyclopedia of Algorithms, (2016)Obtaining optimal k-cardinality trees fast., , , and . ACM J. Exp. Algorithmics, (2009)Properties of Large 2-Crossing-Critical Graphs., , , , , , and . CoRR, (2021)Crossing Number for Graphs With Bounded Pathwidth., , , and . CoRR, (2016)Computing Crossing Numbers: Berechnen von Kreuzungszahlen.. Ausgezeichnete Informatikdissertationen, volume D-9 of LNI, GI, (2008)Computing crossing numbers. Dortmund University, Germany, (2009)base-search.net (ftunivdortmund:oai:eldorado.tu-dortmund.de:2003/25955).Approximating Multiobjective Shortest Path in Practice., and . ALENEX, page 120-133. SIAM, (2020)