PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Verbeek, Kevin"

Author of the publication

copydeleteadd this publication to your clipboard
Tight bounds for conflict-free chromatic guarding of orthogonal art galleries.

, , , , and . Comput. Geom., (2018)

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.

Kevin Gutsche University of Stuttgart

M.Sc. Technically Oriented Business Administration Kevin Christopher Dorling University of Stuttgart

Grill and Chill : A Comprehensive Analysis of the Environmental Impacts of Private Household Barbecuing in Germany, , , and . Sustainability, 16 (3): 1041 (2024)

Kevin Bareiß University of Stuttgart

Kevin Schlegel University of Stuttgart

Kevin Treptow University of Stuttgart

 

Other publications of authors with the same name

On Planar Supports for Hypergraphs., , , , and . J. Graph Algorithms Appl., 15 (4): 533-549 (2011)Stability analysis of kinetic orientation-based shape descriptors., , and . CoRR, (2019)Geometric Simultaneous Embeddings of a Graph and a Matching., , , , , and . Graph Drawing, volume 5849 of Lecture Notes in Computer Science, page 183-194. Springer, (2009)Bundled Crossings in Embedded Graphs., , , and . LATIN, volume 9644 of Lecture Notes in Computer Science, page 454-468. Springer, (2016)A Framework for Algorithm Stability and Its Application to Kinetic Euclidean MSTs., , , and . LATIN, volume 10807 of Lecture Notes in Computer Science, page 805-819. Springer, (2018)Metric Embedding, Hyperbolic Space, and Social Networks., and . Symposium on Computational Geometry, page 501. ACM, (2014)Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries., , , , and . Symposium on Computational Geometry, volume 34 of LIPIcs, page 421-435. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (2015)Optimal Morphs of Planar Orthogonal Drawings II., , and . GD, volume 11904 of Lecture Notes in Computer Science, page 33-45. Springer, (2019)Geometric k Shortest Paths., , , , , , , and . SODA, page 1616-1625. SIAM, (2015)Strict confluent drawing., , , , , and . JoCG, 7 (1): 22-46 (2016)