Author of the publication

Complexity Measures for Mosaic Drawings.

, , and . WALCOM, volume 10167 of Lecture Notes in Computer Science, page 149-160. Springer, (2017)

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

On the Most Likely Convex Hull of Uncertain Points., , and . ESA, volume 8125 of Lecture Notes in Computer Science, page 791-802. Springer, (2013)Rectangular cartograms: the game., , , and . SCG, page 96-97. ACM, (2009)A Practical Algorithm for Spatial Agglomerative Clustering., , and . ALENEX, page 174-185. SIAM, (2019)Angle-Restricted Steiner Arborescences for Flow Map Layout., , and . ISAAC, volume 7074 of Lecture Notes in Computer Science, page 250-259. Springer, (2011)On the Most Likely Voronoi Diagramand Nearest Neighbor Searching., and . ISAAC, volume 8889 of Lecture Notes in Computer Science, page 338-350. Springer, (2014)Volume-based similarity of linear features on terrains., , , , and . SIGSPATIAL/GIS, page 444-447. ACM, (2018)Complexity Measures for Mosaic Drawings., , and . WALCOM, volume 10167 of Lecture Notes in Computer Science, page 149-160. Springer, (2017)Computing the Fréchet Distance Between Uncertain Curves in One Dimension., , , , , and . WADS, volume 12808 of Lecture Notes in Computer Science, page 243-257. Springer, (2021)Most Likely Voronoi Diagrams in Higher Dimensions., , , and . FSTTCS, volume 65 of LIPIcs, page 31:1-31:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Area-universal rectangular layouts., , , and . SCG, page 267-276. ACM, (2009)