Seguir
Sergey Bereg
Sergey Bereg
Associate Professor, University of Texas at Dallas
Dirección de correo verificada de utdallas.edu
Título
Citado por
Citado por
Año
Generalizing Ham Sandwich Cuts to Equitable Subdivisions
S Bespamyatnikh, DG Kirkpatrick, J Snoeyink
Discrete Computational Geometry 24 (4), 605-622, 2000
1302000
Computing Homotopic Shortest Paths in the Plane
S Bespamyatnikh
Journal of algorithms 49 (2), 284-303, 2003
932003
An Optimal Algorithm for Closest-Pair Maintenance
S Bespamyatnikh
Discrete and Computational Geometry 19, 175-195, 1998
851998
Mobile facility location
S Bespamyatnikh, B Bhattacharya, D Kirkpatrick, M Segal
4th Workshop on Discrete Algorithms and Methods for Mobile Computing and …, 2000
672000
Compatible geometric matchings
O Aichholzer, S Bereg, A Dumitrescu, A García, C Huemer, F Hurtado, ...
Computational Geometry 42 (6-7), 617-626, 2009
662009
Edge routing with ordered bundles
S Pupyrev, L Nachmanson, S Bereg, AE Holroyd
Graph Drawing: 19th International Symposium, GD 2011, Eindhoven, The …, 2012
602012
Curvature-bounded traversals of narrow corridors
S Bereg, D Kirkpatrick
Proceedings of the twenty-first Annual Symposium on Computational Geometry …, 2005
602005
An Efficient Algorithm for Enumeration of Triangulations
S Bespamyatnikh
Computational Geometry - Theory and Applications 23 (3), 271-279, 2002
562002
Approximating barrier resilience in wireless sensor networks
S Bereg, D Kirkpatrick
International Symposium on Algorithms and Experiments for Sensor Systems …, 2009
542009
An Efficient Algorithm for the Three-Dimensional Diameter Problem
S Bespamyatnikh
Discrete and Computational Geometry 25 (2), 235-255, 2001
422001
Simplifying 3D polygonal chains under the discrete Fréchet distance
S Bereg, M Jiang, W Wang, B Yang, B Zhu
LATIN 2008: Theoretical Informatics: 8th Latin American Symposium, Búzios …, 2008
392008
Enumerating pseudo-triangulations in the plane
S Bereg
Computational Geometry 30 (3), 207-222, 2005
392005
Efficient Algorithms for Centers and Medians in Interval and Circular-arc Graphs
S Bespamyatnikh, B Bhattacharya, M Keil, D Kirkpatrick, M Segal
Networks 33 (3), 144-152, 2002
392002
Moving coins
M Abellanas, S Bereg, F Hurtado, AG Olaverri, D Rappaport, J Tejel
Computational Geometry 34 (1), 35-48, 2006
382006
The class cover problem with boxes
S Bereg, S Cabello, JM Díaz-Báñez, P Pérez-Lantero, C Seara, I Ventura
Computational Geometry 45 (7), 294-304, 2012
332012
Certifying and constructing minimally rigid graphs in the plane
S Bereg
Proceedings of the twenty-first annual symposium on Computational geometry …, 2005
332005
Sliding disks in the plane
S Bereg, A Dumitrescu, J Pach
International Journal of Computational Geometry & Applications 18 (05), 373-387, 2008
32*2008
Monadic decomposition
M Veanes, N Bjørner, L Nachmanson, S Bereg
Journal of the ACM (JACM) 64 (2), 1-28, 2017
292017
An O (nlogn) algorithm for the zoo-keeper's problem
S Bespamyatnikh
Computational Geometry - Theory and Applications 24 (2), 63-74, 2003
272003
An optimal morphing between polylines
S Bespamyatnikh
International Journal on Computational Geometry and Applications 12 (3), 217-228, 2002
272002
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20