Author of the publication

When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem.

, and . Theory Comput. Syst., 58 (2): 287-303 (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

When Diameter Matters: Parameterized Approximation Algorithms for Bounded Diameter Minimum Steiner Tree Problem., and . Theory Comput. Syst., 58 (2): 287-303 (2016)A Combinatorial Approximation Algorithm for Correlation Clustering., and . CoRR, (2023)Recognizing Visibility Graphs of Polygons with Holes and Internal-External Visibility Graphs of Polygons., , and . CoRR, (2018)Visibility Testing and Counting., and . FAW-AAIM, volume 6681 of Lecture Notes in Computer Science, page 343-351. Springer, (2011)Touring a sequence of disjoint polygons: Complexity and extension., , and . Theor. Comput. Sci., (2014)Efficient Visibility Maintenance of a Moving Segment Observer inside a Simple Polygon., , and . CCCG, page 249-252. Carleton University, Ottawa, Canada, (2007)Der SSH Open Marketplace - Kontextualisiertes Praxiswissen für die Digital Humanities., , , , , , and . DHd, (2022)Efficient Observer-Dependent Simplification in Polygonal Domains., and . Algorithmica, 62 (3-4): 842-862 (2012)A Simple, Faster Method for Kinetic Proximity Problems., , , , and . CoRR, (2013)Weak Visibility of Two Objects in Planar Polygonal Scenes., , and . ICCSA (1), volume 4705 of Lecture Notes in Computer Science, page 68-81. Springer, (2007)