Author of the publication

Ortho-Polygon Visibility Representations of Embedded Graphs.

, , , , , , and . GD, volume 9801 of Lecture Notes in Computer Science, page 280-294. Springer, (2016)

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

Lower Bounds for Noisy Boolean Decision Trees., and . STOC, page 620-628. ACM, (1996)Clone Detection via Structural Abstraction., , and . Structure-Based Compression of Complex Massive Data, volume 08261 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2008)On k-Guarding Polygons., , and . CCCG, Carleton University, Ottawa, Canada, (2013)On characterizing terrain visibility graphs., and . J. Comput. Geom., 6 (1): 108-141 (2015)Profile-Guided Code Compression., and . PLDI, page 95-105. ACM, (2002)Ortho-Polygon Visibility Representations of Embedded Graphs., , , , , , and . GD, volume 9801 of Lecture Notes in Computer Science, page 280-294. Springer, (2016)Visualization of Bipartite Graphs in Limited Window Size., , and . SOFSEM, volume 14519 of Lecture Notes in Computer Science, page 198-210. Springer, (2024)Fractional Bamboo Trimming and Distributed Windows Scheduling., , and . SOFSEM, volume 14519 of Lecture Notes in Computer Science, page 69-81. Springer, (2024)SEFE with No Mapping via Large Induced Outerplane Graphs in Plane Graphs., , , and . ISAAC, volume 8283 of Lecture Notes in Computer Science, page 185-195. Springer, (2013)Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas, and . FOCS, page 594-603. IEEE Computer Society, (1993)