From post

Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon.

, , , , и . ICCSA (2), том 10405 из Lecture Notes in Computer Science, стр. 509-524. Springer, (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.

 

Другие публикации лиц с тем же именем

Fast Gaussian Process Regression for Big Data, , и . (2015)cite arxiv:1509.05142.The balanced connected subgraph problem for geometric intersection graphs., , , и . Theor. Comput. Sci., (2022)A linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares., , , и . CoRR, (2017)Collision-Free Routing Problem with Restricted L-Path., и . IWOCA, том 10979 из Lecture Notes in Computer Science, стр. 1-13. Springer, (2018)Guarding Exterior Region of a Simple Polygon., , и . WALCOM, том 4921 из Lecture Notes in Computer Science, стр. 100-110. Springer, (2008)Base station placement on boundary of a convex polygon., , и . J. Parallel Distributed Comput., 68 (2): 265-273 (2008)Approximate Shortest Descent Path on a Terrain., , , и . CCCG, стр. 189-192. Carleton University, Ottawa, Canada, (2007)Tight Analysis of Shortest Path Convergecast in Wireless Sensor Networks., , , , и . CATS, том 119 из CRPIT, стр. 31-40. Australian Computer Society, (2011)Base Station Placement Problem on the Boundary of a Convex Region., , , и . WALCOM, стр. 151-152. Bangladesh Academy of Sciences (BAS), (2007)A new fast heuristic for labeling points., , , и . Inf. Process. Lett., 109 (10): 478-484 (2009)