( en | de | ru )

 

Disambiguation of "Roy, Sasanka"

Author of the publication

copydeleteadd this publication to your clipboard
Covering Segments with Unit Squares.

, , , and . WADS, volume 10389 of Lecture Notes in Computer Science, page 1-12. 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. You can also use the button next to the name to display some publications already assigned to the person.

Roy Hornig

Beschreibung mikro-rheologischer Vorgänge und resultierender Verbundstrukturen beim Elastomermischprozeß im Innenmischer durch rheologische Untersuchungen. NA Halle-Wittenberg, (2009)

Trina Roy

Wolfgang Roy

Amitava Roy

Smritindu Roy

 

Other publications of authors with the same name

Largest Empty Circle Centered on a Query Line, , and . CoRR, (2008)Rectilinear Path Problems in Restricted Memory Setup., , , , and . CALDAM, volume 8959 of Lecture Notes in Computer Science, page 69-80. Springer, (2015)Optimal Algorithm for a Special Point-Labeling Problem., , , and . SWAT, volume 2368 of Lecture Notes in Computer Science, page 110-120. Springer, (2002)In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs., , and . FAW-AAIM, volume 7285 of Lecture Notes in Computer Science, page 327-338. Springer, (2012)Computing the Triangle Maximizing the Length of Its Smallest Side Inside a Convex Polygon., , , , and . ICCSA (2), volume 10405 of Lecture Notes in Computer Science, page 509-524. Springer, (2017)Linear time algorithm to cover and hit a set of line segments optimally by two axis-parallel squares., , , and . Theor. Comput. Sci., (2019)Near optimal algorithm for the shortest descending path on the surface of a convex terrain.. J. Discrete Algorithms, (2012)A new fast heuristic for labeling points., , , and . Inf. Process. Lett., 109 (10): 478-484 (2009)Maximum Bipartite Subgraph of Geometric Intersection Graphs., , , and . WALCOM, volume 12049 of Lecture Notes in Computer Science, page 158-169. Springer, (2020)Fast Computation of Smallest Enclosing Circle with Center on a Query Line Segment., , and . CCCG, page 273-276. Carleton University, Ottawa, Canada, (2007)