( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Super Guarding and Dark Rays in Art Galleries.

, , , , , , , и . CoRR, (2024)

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.

Heike Anna Brücker

Dirk Annacker

Thomas Annan

Carola Annas

John A Anna Selva

 

Другие публикации лиц с тем же именем

Flipping Edge-Labelled Triangulations., , , и . CoRR, (2013)Counterexample to a Conjecture of Szymanski on Hypercube Routing.. Inf. Process. Lett., 35 (2): 57-61 (1990)On the Planar Split Thickness of Graphs, , , , , , , , и . Proceedings of the 12th Latin American Theoretical Informatics Symposium (LATIN'16), том 9644 из Lecture Notes in Computer Science, стр. 403--415. Springer-Verlag, (апреля 2016)How to Morph Planar Graph Drawings., , , , , , , , , и 3 other автор(ы). SIAM J. Comput., 46 (2): 824-852 (2017)Embedding Problems for Paths with Direction Constrained Edges., , , и . COCOON, том 1858 из Lecture Notes in Computer Science, стр. 64-73. Springer, (2000)Decomposing polygonal regions into convex quadrilaterals.. SCG, стр. 97-106. ACM, (1985)Recovery of Convex Hulls From External Visibility Graphs., , и . CCCG, стр. 309-314. University of Waterloo, (1993)Reconfiguring a Chain of Cubes., , , , и . CCCG, Queen's University, Ontario, Canada, (2015)Rollercoasters and Caterpillars., , , , , , и . ICALP, том 107 из LIPIcs, стр. 18:1-18:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The Visibility Center of a Simple Polygon., и . ESA, том 204 из LIPIcs, стр. 65:1-65:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)