Author of the publication

Convexifying Monotone Polygons while Maintaining Internal Visibility.

, , , , , and . EGC, volume 7579 of Lecture Notes in Computer Science, page 98-108. Springer, (2011)

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

Characterizing all graphs with 2-exceptional edges., and . Ars Math. Contemp., 15 (2): 383-406 (2018)Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c <= 12., , , , , and . SoCG, volume 129 of LIPIcs, page 14:1-14:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)The maximum number of halving lines and the rectilinear crossing number of Kn for n., , , and . Electron. Notes Discret. Math., (2008)Bounded maximum degree conjecture holds precisely for c-crossing-critical graphs with c≤12., , , , , and . CoRR, (2019)Convexifying Monotone Polygons while Maintaining Internal Visibility., , , , , and . EGC, volume 7579 of Lecture Notes in Computer Science, page 98-108. Springer, (2011)There is a unique crossing-minimal rectilinear drawing of K_18., , , , and . Ars Math. Contemp., 24 (2): 2 (2024)On ≤k-Edges, Crossings, and Halving Lines of Geometric Drawings of K n., , , , and . Discret. Comput. Geom., 48 (1): 192-215 (2012)Spanning Trees of Multicoloured Point Sets with Few Intersections., , , and . IJCCGGT, volume 3330 of Lecture Notes in Computer Science, page 113-122. Springer, (2003)The Crossing Number of a Projective Graph is Quadratic in the Face-Width., , , and . Electr. J. Comb., (2008)On the connectivity of the disjointness graph of segments of point sets in general position in the plane., , and . Discret. Math. Theor. Comput. Sci., (2022)