| Publication | Date of Publication | Type |
|---|
Covering a set of points by two axis-parallel boxes
Information Processing Letters | 2016-06-16 | Paper |
Enumerating longest increasing subsequences and patience sorting
Information Processing Letters | 2016-06-16 | Paper |
On a conjecture on Wiener indices in combinatorial chemistry
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Cylindrical Hierarchy for Deforming Necklaces
Lecture Notes in Computer Science | 2011-03-18 | Paper |
On partitioning a cake
Lecture Notes in Computer Science | 2010-02-05 | Paper |
Constrained equitable 3-cuttings
Lecture Notes in Computer Science | 2010-02-05 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Algorithms for shortest paths and d-cycle problems
Journal of Discrete Algorithms | 2007-04-26 | Paper |
Selecting distances in arrangements of hyperplanes spanned by points.
Journal of Discrete Algorithms | 2007-04-25 | Paper |
| scientific article; zbMATH DE number 2185621 (Why is no real title available?) | 2005-07-04 | Paper |
| scientific article; zbMATH DE number 2185624 (Why is no real title available?) | 2005-07-04 | Paper |
COMPUTING CLOSEST POINTS FOR SEGMENTS
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
AN OPTIMAL MORPHING BETWEEN POLYLINES
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
Computing a (1+)-approximate geometric minimum-diameter spanning tree
Algorithmica | 2004-09-22 | Paper |
| scientific article; zbMATH DE number 2079391 (Why is no real title available?) | 2004-07-28 | Paper |
Computing homotopic shortest paths in the plane
Journal of Algorithms | 2004-03-14 | Paper |
| scientific article; zbMATH DE number 2038782 (Why is no real title available?) | 2004-02-08 | Paper |
| scientific article; zbMATH DE number 2009873 (Why is no real title available?) | 2003-11-26 | Paper |
An O\((n\log n)\) algorithm for the zoo-keeper's problem
Computational Geometry | 2003-04-28 | Paper |
An efficient algorithm for enumeration of triangulations
Computational Geometry | 2003-03-10 | Paper |
| scientific article; zbMATH DE number 1796960 (Why is no real title available?) | 2002-09-05 | Paper |
Packing two disks in a polygon
Computational Geometry | 2002-09-03 | Paper |
Efficient algorithms for centers and medians in interval and circular-arc graphs
Networks | 2002-07-01 | Paper |
Fast algorithms for approximating distances
Algorithmica | 2002-06-17 | Paper |
| scientific article; zbMATH DE number 1741017 (Why is no real title available?) | 2002-06-10 | Paper |
OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS
International Journal of Computational Geometry & Applications | 2002-06-02 | Paper |
| scientific article; zbMATH DE number 1728311 (Why is no real title available?) | 2002-04-15 | Paper |
scientific article; zbMATH DE number 1588326 (Why is no real title available?)
IJMA. International Journal of Mathematical Algorithms | 2001-08-26 | Paper |
Generalizing ham sandwich cuts to equitable subdivisions
Discrete & Computational Geometry | 2001-08-16 | Paper |
An efficient algorithm for the three-dimensional diameter problem
Discrete & Computational Geometry | 2001-06-20 | Paper |
Queries with segments in Voronoi diagrams
Computational Geometry | 2000-06-05 | Paper |
| scientific article; zbMATH DE number 1303550 (Why is no real title available?) | 2000-05-25 | Paper |
| scientific article; zbMATH DE number 1305399 (Why is no real title available?) | 1999-06-17 | Paper |
An optimal algorithm for closest-pair maintenance
Discrete & Computational Geometry | 1998-03-11 | Paper |
On constructing minimum spanning trees in \(R_ 1^ k\)
Algorithmica | 1998-01-12 | Paper |
