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

The Crossing Number of P(N, 3)., and . Graphs Comb., 18 (2): 381-394 (2002)A lower bound for the crossing number of Cm × Cn.. J. Graph Theory, 35 (3): 222-226 (2000)Bounding the crossing number of a graph in terms of the crossing number of a minor with small maximum degree., and . J. Graph Theory, 36 (3): 168-173 (2001)The maximum number of halving lines and the rectilinear crossing number of Kn for n., , , and . Electron. Notes Discret. Math., (2008)The Optimal Drawings of $K_5, n$., , and . Electron. J. Comb., 21 (4): 4 (2014)On the length of longest alternating paths for multicoloured point sets in convex position., , and . Discret. Math., 306 (15): 1791-1797 (2006)Visibility-preserving convexifications using single-vertex moves., , , and . Inf. Process. Lett., 112 (5): 161-163 (2012)On the Intersection Number of Matchings and Minimum Weight Perfect Matchings of Multicolored Point Sets., , and . Graphs Comb., 21 (3): 333-341 (2005)Morelia Test: Improving the Efficiency of the Gabriel Test and Face Routing in Ad-Hoc Networks., , , , , , and . SIROCCO, volume 3104 of Lecture Notes in Computer Science, page 23-34. Springer, (2004)On the Crossing Number of Almost Planar Graphs., and . GD, volume 4372 of Lecture Notes in Computer Science, page 162-173. Springer, (2006)