Person:294805

Available identifiers

zbMath Open bespamyatnikh.sergei-nMaRDI QIDQ294805

List of research outcomes

Publication	Date of Publication	Type
Covering a set of points by two axis-parallel boxes	2016-06-16	Paper
Enumerating longest increasing subsequences and patience sorting	2016-06-16	Paper
Cylindrical Hierarchy for Deforming Necklaces	2011-03-18	Paper
On a Conjecture on Wiener Indices in Combinatorial Chemistry	2011-03-18	Paper
Discrete and Computational Geometry	2010-02-05	Paper
Discrete and Computational Geometry	2010-02-05	Paper
LATIN 2004: Theoretical Informatics	2009-05-07	Paper
Algorithms for shortest paths and \(d\)-cycle problems	2007-04-26	Paper
Selecting distances in arrangements of hyperplanes spanned by points.	2007-04-25	Paper
https://portal.mardi4nfdi.de/entity/Q3024786	2005-07-04	Paper
https://portal.mardi4nfdi.de/entity/Q3024790	2005-07-04	Paper
AN OPTIMAL MORPHING BETWEEN POLYLINES	2004-09-29	Paper
COMPUTING CLOSEST POINTS FOR SEGMENTS	2004-09-29	Paper
Computing a \((1+\varepsilon)\)-approximate geometric minimum-diameter spanning tree	2004-09-22	Paper
https://portal.mardi4nfdi.de/entity/Q4471350	2004-07-28	Paper
Computing homotopic shortest paths in the plane	2004-03-14	Paper
https://portal.mardi4nfdi.de/entity/Q4449249	2004-02-08	Paper
https://portal.mardi4nfdi.de/entity/Q4434784	2003-11-26	Paper
An O\((n\log n)\) algorithm for the zoo-keeper's problem	2003-04-28	Paper
An efficient algorithm for enumeration of triangulations	2003-03-10	Paper
https://portal.mardi4nfdi.de/entity/Q4551354	2002-09-05	Paper
Packing two disks in a polygon	2002-09-03	Paper
Efficient algorithms for centers and medians in interval and circular-arc graphs	2002-07-01	Paper
Fast algorithms for approximating distances	2002-06-17	Paper
https://portal.mardi4nfdi.de/entity/Q4331201	2002-06-10	Paper
OPTIMAL FACILITY LOCATION UNDER VARIOUS DISTANCE FUNCTIONS	2002-06-02	Paper
https://portal.mardi4nfdi.de/entity/Q2779372	2002-04-15	Paper
https://portal.mardi4nfdi.de/entity/Q2708487	2001-08-26	Paper
Generalizing ham sandwich cuts to equitable subdivisions	2001-08-16	Paper
An efficient algorithm for the three-dimensional diameter problem	2001-06-20	Paper
Queries with segments in Voronoi diagrams	2000-06-05	Paper
https://portal.mardi4nfdi.de/entity/Q4250174	2000-05-25	Paper
https://portal.mardi4nfdi.de/entity/Q4252280	1999-06-17	Paper
An optimal algorithm for closest-pair maintenance	1998-03-11	Paper
On constructing minimum spanning trees in \(R_ 1^ k\)	1998-01-12	Paper

Research outcomes over time

This page was built for person: Sergei Bespamyatnikh