Author of the publication

Computing the Center of Uncertain Points on Tree Networks.

, and . Algorithmica, 78 (1): 232-254 (2017)

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

A Cross-Range Scaling Method for Isar Non-Uniformly Rotating Targets Based on Sharpness Maximization., , , , and . IGARSS, page 2282-2285. IEEE, (2018)L1 Shortest Path Queries in Simple Polygons., and . CoRR, (2018)Optimal Point Movement for Covering Circular Regions, , , and . CoRR, (2011)Improved Points Approximation Algorithms Based on Simplicial Thickness Data Structures., and . IWOCA, volume 6460 of Lecture Notes in Computer Science, page 363-376. Springer, (2010)Approximating Points by a Piecewise Linear Function: II. Dealing with Outliers., and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 234-243. Springer, (2009)Locating an Obnoxious Line among Planar Objects., and . ISAAC, volume 5878 of Lecture Notes in Computer Science, page 740-749. Springer, (2009)Optimal Point Movement for Covering Circular Regions., , , and . ISAAC, volume 7676 of Lecture Notes in Computer Science, page 332-341. Springer, (2012)Covering Uncertain Points in a Tree., and . WADS, volume 10389 of Lecture Notes in Computer Science, page 557-568. Springer, (2017)Computing the Visibility Polygon of an Island in a Polygonal Domain., and . ICALP (1), volume 7391 of Lecture Notes in Computer Science, page 218-229. Springer, (2012)Computing Maximum Non-crossing Matching in Convex Bipartite Graphs., , and . FAW-AAIM, volume 7285 of Lecture Notes in Computer Science, page 105-116. Springer, (2012)