default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSergey Bereg
Sergei Bespamyatnikh
Person information
- affiliation: University of Texas at Dallas, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2025
[j94]Sergey Bereg, José Miguel Díaz-Báñez, Alina Kasiuk, Miguel Angel Pérez-Cutiño, Fabio Rodríguez:
Covering segments on a line with drones. Inf. Process. Lett. 188: 106540 (2025)- 2024
- [j93]Sergey Bereg
, José Miguel Díaz-Báñez, Paul Horn, Mario Alberto López, Jorge Urrutia:
Connectivity and stochastic robustness of synchronized multi-drone systems. Discret. Appl. Math. 349: 170-181 (2024) - [j92]Sergey Bereg, Mohammadreza Haghpanah, Brian Malouf, Ivan Hal Sudborough:
Improved bounds for permutation arrays under Chebyshev distance. Des. Codes Cryptogr. 92(4): 1023-1039 (2024) - 2023
- [j91]Sergey Bereg:
Computing Balanced Convex Partitions of Lines. Algorithmica 85(8): 2515-2528 (2023) - [j90]Sergey Bereg, Oscar Chacón-Rivera, David Flores-Peñaloza, Clemens Huemer, Pablo Pérez-Lantero, Carlos Seara:
On maximum-sum matchings of points. J. Glob. Optim. 85(1): 111-128 (2023) - [c92]Sergey Bereg:
Computing Random r-Orthogonal Latin Squares. COCOA (2) 2023: 165-174 - [c91]Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Junichi Teruyama, Yuki Tokuni, Binhai Zhu:
Red-Black Spanners for Mixed-Charging Vehicular Networks. COCOON (1) 2023: 220-231 - [i28]Sergey Bereg, Yuya Higashikawa, Naoki Katoh, Manuel Lafond, Yuki Tokuni, Binhai Zhu:
The Two-Squirrel Problem and Its Relatives. CoRR abs/2302.05937 (2023) - [i27]Sergey Bereg, Mohammadreza Haghpanah, Brian Malouf, Ivan Hal Sudborough:
Improved Bounds for Permutation Arrays Under Chebyshev Distance. CoRR abs/2302.12855 (2023) - [i26]Sergey Bereg:
Computing random r-orthogonal Latin squares. CoRR abs/2311.00992 (2023) - 2022
- [j89]Sergey Bereg, Mohammadreza Haghpanah:
New algorithms and bounds for halving pseudolines. Discret. Appl. Math. 319: 194-206 (2022) - [j88]Sergey Bereg, Mohammadreza Haghpanah:
Algorithms for Radon partitions with tolerance. Discret. Appl. Math. 319: 207-215 (2022) - [j87]Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough:
Using permutation rational functions to obtain permutation arrays with large hamming distance. Des. Codes Cryptogr. 90(7): 1659-1677 (2022) - [j86]Richard M. Low, Ardak Kapbasov, Arman Kapbasov, Sergey Bereg:
Computation of new diagonal graph Ramsey numbers. Electron. J. Graph Theory Appl. 10(2): 575-588 (2022) - [j85]Sergey Bereg, José Miguel Díaz-Báñez, Mohammadreza Haghpanah, Paul Horn, Mario Alberto López, Nestaly Marín, Adriana Ramírez-Vigueras, Fabio Rodríguez, Oriol Andreu Solé-Pi, Alex Stevens, Jorge Urrutia:
Optimal placement of base stations in border surveillance using limited capacity drones. Theor. Comput. Sci. 928: 183-196 (2022) - [i25]Sergey Bereg, Luis Evaristo Caraballo, José Miguel Díaz-Báñez:
Efficient inspection of underground galleries using k robots with limited energy. CoRR abs/2209.10400 (2022) - [i24]Sergey Bereg, José Miguel Díaz-Báñez, Mohammadreza Haghpanah, Paul Horn, Mario Alberto López, Nestaly Marín, Adriana Ramírez-Vigueras, Fabio Rodríguez, Oriol Andreu Solé-Pi, Alex Stevens, Jorge Urrutia:
Optimal Placement of Base Stations in Border Surveillance using Limited Capacity Drones. CoRR abs/2209.13311 (2022) - [i23]Sergey Bereg, José Miguel Díaz-Báñez, Nadine Kroher, Inmaculada Ventura:
Computing Melodic Templates in Oral Music Traditions. CoRR abs/2209.13598 (2022) - 2021
- [c90]Sergey Bereg, José Miguel Díaz-Báñez, Paul Horn, Mario Alberto López, Jorge Urrutia:
Failure and Communication in a Synchronized Multi-drone System. CALDAM 2021: 413-425 - 2020
- [j84]Sergey Bereg, Mohammadreza Haghpanah:
New lower bounds for Tverberg partitions with tolerance in the plane. Discret. Appl. Math. 283: 596-603 (2020) - [j83]Sergey Bereg, Peter J. Dukes:
A lower bound on permutation codes of distance n-1. Des. Codes Cryptogr. 88(1): 63-72 (2020) - [j82]Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough:
Constructing permutation arrays using partition and extension. Des. Codes Cryptogr. 88(2): 311-339 (2020) - [j81]Sergey Bereg, Andrew Brunner, Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Mario Alberto López:
On the robustness of a synchronized multi-robot system. J. Comb. Optim. 39(4): 988-1016 (2020) - [c89]Sergey Bereg, Mohammadreza Haghpanah:
New Algorithms and Bounds for Halving Pseudolines. CALDAM 2020: 463-475 - [c88]Sergey Bereg, Mohammadreza Haghpanah:
Algorithms for Radon Partitions with Tolerance. CALDAM 2020: 476-487 - [c87]Sergey Bereg, Mohammadreza Haghpanah:
Computing the Caratheodory Number of a Point. CCCG 2020: 182-188 - [c86]Sergey Bereg, Mohammadreza Haghpanah:
Constructing Order Type Graphs Using an Axiomatic Approach. COCOA 2020: 802-816 - [c85]Sergey Bereg:
Computing Balanced Convex Partitions of Lines. LATIN 2020: 247-257 - [c84]Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough:
Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions. WAIFI 2020: 234-252 - [i22]Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough:
Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions. CoRR abs/2003.10072 (2020) - [i21]Sergey Bereg, Mohammadreza Haghpanah:
Constructing Order Type Graphs using an Axiomatic Approach. CoRR abs/2011.14282 (2020)
2010 – 2019
- 2019
- [j80]Sergey Bereg, José Miguel Díaz-Báñez, Nadine Kroher, Inmaculada Ventura:
Computing melodic templates in oral music traditions. Appl. Math. Comput. 344-345: 219-229 (2019) - [j79]Sergey Bereg, Zevi Miller, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough:
New lower bounds for permutation arrays using contraction. Des. Codes Cryptogr. 87(9): 2105-2128 (2019) - [j78]Sergey Bereg, Feifei Ma, Wencheng Wang, Jian Zhang, Binhai Zhu:
On some matching problems under the color-spanning model. Theor. Comput. Sci. 786: 26-31 (2019) - [i20]José Miguel Díaz-Báñez, Luis Evaristo Caraballo, Mario Alberto López, Sergey Bereg, Iván Maza, Aníbal Ollero:
A framework for synchronizing a team of aerial robots in communication-limited environments. CoRR abs/1902.05107 (2019) - [i19]Sergey Bereg, Oscar Chacón-Rivera, David Flores-Peñaloza, Clemens Huemer, Pablo Pérez-Lantero, Carlos Seara:
On Maximum-Sum Matchings of Points. CoRR abs/1911.10610 (2019) - [i18]Sergey Bereg, Brian Malouf, Linda Morales, Thomas Stanley, Ivan Hal Sudborough, Alexander Wong:
Equivalence Relations for Computing Permutation Polynomials. CoRR abs/1911.12823 (2019) - 2018
- [j77]Sergey Bereg, Avi Levy, Ivan Hal Sudborough:
Constructing permutation arrays from groups. Des. Codes Cryptogr. 86(5): 1095-1111 (2018) - [j76]Sergey Bereg, Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Mario Alberto López:
Computing the k-resilience of a synchronized multi-robot system. J. Comb. Optim. 36(2): 365-391 (2018) - [j75]Sergey Bereg, Binay Bhattacharya, Sandip Das, Tsunehiko Kameda, Priya Ranjan Sinha Mahapatra, Zhao Song:
Optimizing squares covering a set of points. Theor. Comput. Sci. 729: 68-83 (2018) - [j74]Daming Zhu, Sergey Bereg:
Preface. Theor. Comput. Sci. 734: 1-2 (2018) - [c83]Sruthi Chappidi, Sergey Bereg:
Visualization of genome rearrangements using DCJ operations. IWISC 2018: 15-22 - [c82]Diana E. Martinez Rodríguez, Marco A. Contreras-Cruz, Uriel Haile Hernández Belmonte, Sergey Bereg, Víctor Ayala-Ramírez:
Saliency improvement through genetic programming. IWISC 2018: 29-38 - [i17]Sergey Bereg, Zevi Miller, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough:
Maximizing Hamming Distance in Contraction of Permutation Arrays. CoRR abs/1804.03768 (2018) - [i16]Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough:
Constructing Permutation Arrays using Partition and Extension. CoRR abs/1804.08252 (2018) - [i15]Sergey Bereg:
A construction of product blocks with a fixed block size. CoRR abs/1805.03165 (2018) - [i14]Sergey Bereg, Feifei Ma, Wencheng Wang, Jian Zhang, Binhai Zhu:
On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model. CoRR abs/1805.05448 (2018) - 2017
- [j73]Tetsuo Asano, Lilian Buzer, Sergey Bereg:
A new algorithmic framework for basic problems on binary images. Discret. Appl. Math. 216: 376-392 (2017) - [j72]Sergey Bereg, Linda Morales, Ivan Hal Sudborough:
Extending permutation arrays: improving MOLS bounds. Des. Codes Cryptogr. 83(3): 661-683 (2017) - [j71]Margus Veanes, Nikolaj S. Bjørner, Lev Nachmanson, Sergey Bereg:
Monadic Decomposition. J. ACM 64(2): 14:1-14:28 (2017) - [j70]Lev Nachmanson, Arlind Nocaj, Sergey Bereg, Leishi Zhang, Alexander E. Holroyd:
Node Overlap Removal by Growing a Tree. J. Graph Algorithms Appl. 21(5): 857-872 (2017) - [j69]Sergey Bereg, Hiro Ito:
Transforming Graphs with the Same Graphic Sequence. J. Inf. Process. 25: 627-633 (2017) - [j68]José Miguel Díaz-Báñez, Luis Evaristo Caraballo, Mario Alberto López, Sergey Bereg, Jesús Iván Maza, Aníbal Ollero Baturone:
A General Framework for Synchronizing a Team of Robots Under Communication Constraints. IEEE Trans. Robotics 33(3): 748-755 (2017) - [c81]Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough:
Parallel Partition and Extension. CISS 2017: 1-6 - [c80]Sergey Bereg, Feifei Ma, Wencheng Wang, Jian Zhang, Binhai Zhu:
On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model. FAW 2017: 13-21 - [c79]Sergey Bereg, Luis Gerardo Mojica, Linda Morales, Ivan Hal Sudborough:
Kronecker product and tiling of permutation arrays for hamming distances. ISIT 2017: 2198-2202 - [c78]Sergey Bereg, Luis Evaristo Caraballo, José Miguel Díaz-Báñez:
Efficient Inspection of Underground Galleries Using k Robots with Limited Energy. ROBOT (1) 2017: 706-717 - [i13]Sergey Bereg, Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Mario Alberto López:
Computing the $k$-resilience of a Synchronized Multi-Robot System. CoRR abs/1707.07083 (2017) - [i12]Sergey Bereg, José Miguel Díaz-Báñez, Ruy Fabila Monroy, Pablo Pérez-Lantero, Adriana Ramírez-Vigueras, Toshinori Sakai, Jorge Urrutia, Inmaculada Ventura:
On balanced 4-holes in bichromatic point sets. CoRR abs/1708.01321 (2017) - [i11]Sergey Bereg, Matias Korman, Rodrigo I. Silveira, Ferran Hurtado, Dolores Lara, Jorge Urrutia, Mikio Kano, Carlos Seara, Kevin Verbeek:
Balanced partitions of 3-colored geometric sets in the plane. CoRR abs/1708.06062 (2017) - 2016
- [j67]Sergey Bereg, Seok-Hee Hong, Naoki Katoh, Sheung-Hung Poon, Shin-ichi Tanigawa:
On the edge crossing properties of Euclidean minimum weight Laman graphs. Comput. Geom. 51: 15-24 (2016) - [j66]Sergey Pupyrev, Lev Nachmanson, Sergey Bereg, Alexander E. Holroyd:
Edge routing with ordered bundles. Comput. Geom. 52: 18-33 (2016) - [j65]Sergey Bereg, José Miguel Díaz-Báñez, David Flores-Peñaloza, Stefan Langerman, Pablo Pérez-Lantero, Jorge Urrutia:
Optimizing some constructions with bars: new geometric knapsack problems. J. Comb. Optim. 31(3): 1160-1173 (2016) - [j64]Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev:
Representing Permutations with Few Moves. SIAM J. Discret. Math. 30(4): 1950-1977 (2016) - [c77]Sergey Bereg:
On the 2-Center Problem Under Convex Polyhedral Distance Function. COCOA 2016: 365-377 - [c76]Lev Nachmanson, Arlind Nocaj, Sergey Bereg, Leishi Zhang, Alexander E. Holroyd:
Node Overlap Removal by Growing a Tree. GD 2016: 33-43 - [e1]Daming Zhu, Sergey Bereg:
Frontiers in Algorithmics, 10th International Workshop, FAW 2016, Qingdao, China, June 30- July 2, 2016, Proceedings. Lecture Notes in Computer Science 9711, Springer 2016, ISBN 978-3-319-39816-7 [contents] - [i10]Sergey Bereg, Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Mario Alberto López:
Resilience of a synchronized multi-agent system. CoRR abs/1604.08804 (2016) - [i9]Lev Nachmanson, Arlind Nocaj, Sergey Bereg, Leishi Zhang, Alexander E. Holroyd:
Node Overlap Removal by Growing a Tree. CoRR abs/1608.02653 (2016) - 2015
- [j63]Sergey Bereg, José Miguel Díaz-Báñez, Ruy Fabila Monroy, Pablo Pérez-Lantero, Adriana Ramírez-Vigueras, Toshinori Sakai, Jorge Urrutia, Inmaculada Ventura:
On balanced 4-holes in bichromatic point sets. Comput. Geom. 48(3): 169-179 (2015) - [j62]Sergey Bereg, Ferran Hurtado, Mikio Kano, Matias Korman, Dolores Lara, Carlos Seara, Rodrigo I. Silveira, Jorge Urrutia, Kevin Verbeek:
Balanced partitions of 3-colored geometric sets in the plane. Discret. Appl. Math. 181: 21-32 (2015) - [c75]Sergey Bereg, Ovidiu Daescu, Marko Zivanic, Timothy Rozario:
Smallest Maximum-Weight Circle for Weighted Points in the Plane. ICCSA (2) 2015: 244-253 - [c74]José Miguel Díaz-Báñez, Luis Evaristo Caraballo, Mario Alberto López, Sergey Bereg, Iván Maza, Aníbal Ollero:
The synchronization problem for information exchange between aerial robots under communication constraints. ICRA 2015: 4650-4655 - [c73]Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff:
Colored Non-crossing Euclidean Steiner Forest. ISAAC 2015: 429-441 - [c72]Timothy Rozario, Sergey Bereg, Weihua Mao:
An intra-fraction markerless daily lung tumor localization algorithm for EPID images. PETRA 2015: 22:1-22:8 - [i8]Sergey Bereg, Krzysztof Fleszar, Philipp Kindermann, Sergey Pupyrev, Joachim Spoerhase, Alexander Wolff:
Colored Non-Crossing Euclidean Steiner Forest. CoRR abs/1509.05681 (2015) - [i7]Sergey Bereg, Avi Levy, Ivan Hal Sudborough:
Constructing Permutation Arrays from Groups. CoRR abs/1511.04494 (2015) - 2014
- [j61]António Leslie Bajuelos, Sergey Bereg, Ana Mafalda Martins:
Guarding Orthogonal Galleries with Rectangular Rooms. Comput. J. 57(11): 1668-1673 (2014) - [j60]Sergey Bereg, José Miguel Díaz-Báñez, Marta Fort, Mario Alberto López, Pablo Pérez-Lantero, Jorge Urrutia:
Continuous Surveillance of Points by rotating Floodlights. Int. J. Comput. Geom. Appl. 24(3): 183-196 (2014) - [j59]Sergey Bereg, Ruy Fabila Monroy, David Flores-Peñaloza, Mario Alberto López, Pablo Pérez-Lantero:
Embedding the double Circle in a Square Grid of Minimum Size. Int. J. Comput. Geom. Appl. 24(3): 247- (2014) - [c71]Margus Veanes, Nikolaj S. Bjørner, Lev Nachmanson, Sergey Bereg:
Monadic Decomposition. CAV 2014: 628-645 - [c70]Timothy Rozario, Sergey Bereg, Weihua Mao:
A markerless tiling method for tracking daily lung tumor motion on imperfectly matched images. PETRA 2014: 27:1-27:4 - 2013
- [j58]Sergey Bereg, José Miguel Díaz-Báñez, Dolores Lara, Pablo Pérez-Lantero, Carlos Seara, Jorge Urrutia:
On the coarseness of bicolored point sets. Comput. Geom. 46(1): 65-77 (2013) - [c69]Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev:
Drawing Permutations with Few Corners. GD 2013: 484-495 - [c68]Sergey Bereg, Seok-Hee Hong, Naoki Katoh, Sheung-Hung Poon, Shin-ichi Tanigawa:
On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs. ISAAC 2013: 33-43 - [c67]Margus Veanes, Nikolaj S. Bjørner, Lev Nachmanson, Sergey Bereg:
Effectively Monadic Predicates. LPAR (short papers) 2013: 97-103 - [i6]Sergey Bereg, Ruy Fabila Monroy, David Flores-Peñaloza, Mario Alberto López, Pablo Pérez-Lantero:
Drawing the double circle on a grid of minimum size. CoRR abs/1305.6693 (2013) - [i5]Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev:
Drawing Permutations with Few Corners. CoRR abs/1306.4048 (2013) - 2012
- [j57]Sergey Bereg, Mikio Kano:
Balanced Line for a 3-Colored Point Set in the Plane. Electron. J. Comb. 19(1): 33 (2012) - [j56]Sergey Bereg, Sergio Cabello, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Carlos Seara, Inmaculada Ventura:
The class cover problem with boxes. Comput. Geom. 45(7): 294-304 (2012) - [j55]Sergey Bereg:
Computing generalized ham-sandwich cuts. Inf. Process. Lett. 112(13): 532-534 (2012) - [j54]Ruogu Sheng, Sergey Bereg:
Approximating Metrics with Planar boundary-Labeled Phylogenetic Networks. J. Bioinform. Comput. Biol. 10(6) (2012) - [j53]Paul Phipps, Sergey Bereg:
Optimizing Phylogenetic Networks for Circular Split Systems. IEEE ACM Trans. Comput. Biol. Bioinform. 9(2): 535-547 (2012) - [c66]Tetsuo Asano, Sergey Bereg:
A New Framework for Connected Components Labeling of Binary Images. IWCIA 2012: 90-102 - [c65]Tetsuo Asano, Sergey Bereg, Lilian Buzer:
Small Work Space Algorithms for Some Basic Problems on Binary Images. IWCIA 2012: 103-114 - [i4]Sergey Bereg, Alexander E. Holroyd, Lev Nachmanson, Sergey Pupyrev:
Edge Routing with Ordered Bundles. CoRR abs/1209.4227 (2012) - [i3]Sergey Bereg, Timothy Rozario:
Angle Optimization of Graphs Embedded in the Plane. CoRR abs/1211.4927 (2012) - 2011
- [j52]Sergey Bereg, José Miguel Díaz-Báñez, Pablo Pérez-Lantero, Inmaculada Ventura:
The Maximum Box Problem for moving points in the plane. J. Comb. Optim. 22(4): 517-530 (2011) - [j51]Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu:
On the red/blue spanning tree problem. Theor. Comput. Sci. 412(23): 2459-2467 (2011) - [c64]Sergey Pupyrev, Lev Nachmanson, Sergey Bereg, Alexander E. Holroyd:
Edge Routing with Ordered Bundles. GD 2011: 136-147 - 2010
- [j50]Sergey Bereg, Adrian Dumitrescu, Minghui Jiang:
On Covering Problems of Rado. Algorithmica 57(3): 538-561 (2010) - [j49]Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Micha Sharir, Binhai Zhu:
Guarding a Terrain by Two Watchtowers. Algorithmica 58(2): 352-390 (2010) - [j48]Sergey Bereg, Adrian Dumitrescu, Minghui Jiang:
Maximum Area Independent Sets in Disk Intersection Graphs. Int. J. Comput. Geom. Appl. 20(2): 105-118 (2010) - [j47]Sergey Bereg, Kevin Buchin, Maike Buchin, Marina L. Gavrilova, Binhai Zhu:
Voronoi Diagram of Polygonal Chains under the Discrete FRéChet Distance. Int. J. Comput. Geom. Appl. 20(4): 471-484 (2010) - [c63]Sergey Bereg:
Orthogonal Ham-Sandwich Theorem in R3. SODA 2010: 1605-1612
2000 – 2009
- 2009
- [j46]Sergey Bereg, Ovidiu Daescu, Minghui Jiang:
A PTAS for Cutting Out Polygons with Lines. Algorithmica 53(2): 157-171 (2009) - [j45]Sergey Bereg, Nikolaus Mutsanas, Alexander Wolff:
Matching points with rectangles and squares. Comput. Geom. 42(2): 93-108 (2009) - [j44]Sergey Bereg:
Orthogonal equipartitions. Comput. Geom. 42(4): 305-314 (2009) - [j43]Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood:
Compatible geometric matchings. Comput. Geom. 42(6-7): 617-626 (2009) - [j42]Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr:
Traversing a Set of Points with a Minimum Number of Turns. Discret. Comput. Geom. 41(4): 513-532 (2009) - [j41]Sergey Bereg:
On Characterizations of Rigid Graphs in the Plane Using Spanning Trees - On Characterizations of Rigid Graphs in the Plane. Graphs Comb. 25(2): 139-144 (2009) - [j40]Mehmet Baysan, Kamil Saraç, R. Chandrasekaran, Sergey Bereg:
A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Networks under Unit Disk Coverage Model. IEEE Trans. Parallel Distributed Syst. 20(7): 913-924 (2009) - [c62]Sergey Bereg, David G. Kirkpatrick:
Approximating Barrier Resilience in Wireless Sensor Networks. ALGOSENSORS 2009: 29-40 - [c61]Tetsuo Asano, Sergey Bereg, David G. Kirkpatrick:
Finding Nearest Larger Neighbors. Efficient Algorithms 2009: 249-260 - [c60]Lichen Bao, Sergey Bereg:
Counting Faces in Split Networks. ISBRA 2009: 112-123 - [c59]Sergey Bereg, Minghui Jiang, Boting Yang, Binhai Zhu:
On the Red/Blue Spanning Tree Problem. TAMC 2009: 118-127 - 2008
- [j39]Sergey Bereg:
Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs. Comput. Geom. 40(1): 37-44 (2008) - [j38]Oswin Aichholzer, Sergey Bereg, Adrian Dumitrescu, Alfredo García Olaverri, Clemens Huemer, Ferran Hurtado, Mikio Kano, Alberto Márquez, David Rappaport, Shakhar Smorodinsky, Diane L. Souvaine, Jorge Urrutia, David R. Wood:
Compatible Geometric Matchings. Electron. Notes Discret. Math. 31: 201-206 (2008) - [j37]Sergey Bereg, Adrian Dumitrescu, János Pach:
Sliding Disks in the Plane. Int. J. Comput. Geom. Appl. 18(5): 373-387 (2008) - [c58]Lichen Bao, Sergey Bereg:
Clustered SplitsNetworks. COCOA 2008: 469-478 - [c57]Sergey Bereg, Kevin Buchin, Maike Buchin, Marina L. Gavrilova, Binhai Zhu:
Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance. COCOON 2008: 352-362 - [c56]Lichen Bao, Sergey Bereg, Ovidiu Daescu, Simeon C. Ntafos, Junqiang Zhou:
On Some City Guarding Problems. COCOON 2008: 600-610 - [c55]Russell Tempero, Sergey Bereg, Xiangxu Meng, Changhe Tu, Chenglei Yang, Binhai Zhu:
Automatically Approximating 3D Points with Co-Axisal Objects. ICCSA Workshops 2008: 373-381 - [c54]Sergey Bereg, Minghui Jiang, Wencheng Wang, Boting Yang, Binhai Zhu:
Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance. LATIN 2008: 630-641 - [c53]Sergey Bereg, Adrian Dumitrescu, Minghui Jiang:
On Covering Problems of Rado. SWAT 2008: 294-305 - [p1]Sergey Bereg, Marina L. Gavrilova, Yuanyi Zhang:
Robust Point-Location in Generalized Voronoi Diagrams. Generalized Voronoi Diagram 2008: 285-299 - 2007
- [j36]Sergey Bereg, José Miguel Díaz-Báñez, Carlos Seara, Inmaculada Ventura:
On finding widest empty curved corridors. Comput. Geom. 38(3): 154-169 (2007) - [j35]Sergey Bereg, Hao Wang:
Wiener indices of balanced binary trees. Discret. Appl. Math. 155(4): 457-467 (2007) - [j34]Sergey Bereg, Marcin Kubica, Tomasz Walen, Binhai Zhu:
RNA multiple structural alignment with longest common subsequences. J. Comb. Optim. 13(2): 179-188 (2007) - [j33]Sergey Bereg, Yuanyi Zhang:
Phylogenetic Networks Based on the Molecular Clock Hypothesis. IEEE ACM Trans. Comput. Biol. Bioinform. 4(4): 661-667 (2007) - [c52]Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr:
Traversing a set of points with a minimum number of turns. SCG 2007: 46-55 - [c51]Sergey Bereg, Hiro Ito:
Transforming Graphs with the Same Degree Sequence. KyotoCGGT 2007: 25-32 - [c50]Sergey Bereg, Markus Völker, Alexander Wolff, Yuanyi Zhang:
Straightening Drawings of Clustered Hierarchical Graphs. SOFSEM (1) 2007: 176-187 - [i2]Sergey Bereg, Marina L. Gavrilova, Binhai Zhu:
Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance. CoRR abs/0705.2835 (2007) - [i1]Sergey Bereg:
Faster Algorithms for Rigidity in the Plane. CoRR abs/0711.2835 (2007) - 2006
- [j32]Sergey Bereg, Prosenjit Bose, David G. Kirkpatrick:
Equitable subdivisions within polygonal regions. Comput. Geom. 34(1): 20-27 (2006) - [j31]Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, David Rappaport, Javier Tejel:
Moving coins. Comput. Geom. 34(1): 35-48 (2006) - [j30]Sergey Bereg, Adrian Dumitrescu:
The Lifting Model for Reconfiguration. Discret. Comput. Geom. 35(4): 653-669 (2006) - [j29]Sergey Bereg, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal:
Competitive Algorithms for Maintaining a Mobile Center. Mob. Networks Appl. 11(2): 177-186 (2006) - [c49]Sergey Bereg, Ovidiu Daescu, Minghui Jiang:
A PTAS for Cutting Out Polygons with Lines. COCOON 2006: 176-185 - [c48]Sergey Bereg:
Recent Developments and Open Problems in Voronoi Diagrams. ISVD 2006: 4-5 - [c47]Sergey Bereg, Yuanyi Zhang, Marina L. Gavrilova:
Robust Point-Location in Generalized Voronoi Diagrams. ISVD 2006: 54-59 - [c46]Sergey Bereg, Nikolaus Mutsanas, Alexander Wolff:
Matching Points with Rectangles and Squares. SOFSEM 2006: 177-186 - 2005
- [j28]Sergey Bereg:
Enumerating pseudo-triangulations in the plane. Comput. Geom. 30(3): 207-222 (2005) - [j27]Sergey Bereg:
Equipartitions of Measures by 2-Fans. Discret. Comput. Geom. 34(1): 87-96 (2005) - [j26]Igor Averbakh, Sergey Bereg:
Facility location problems with uncertainty on the plane. Discret. Optim. 2(1): 3-34 (2005) - [j25]Sergey Bereg:
An approximate morphing between polylines. Int. J. Comput. Geom. Appl. 15(2): 193-208 (2005) - [c45]Sergey Bereg, Kathryn Bean:
Constructing Phylogenetic Networks from Trees. BIBE 2005: 299-305 - [c44]Sergey Bereg, Yuanyi Zhang:
Phylogenetic Networks Based on the Molecular Clock Hypothesis. BIBE 2005: 320-323 - [c43]Sergey Bereg, Binhai Zhu:
RNA Multiple Structural Alignment with Longest Common Subsequences. COCOON 2005: 32-41 - [c42]Sergey Bereg, Adrian Dumitrescu:
The lifting model for reconfiguration. SCG 2005: 55-62 - [c41]Sergey Bereg:
Certifying and constructing minimally rigid graphs in the plane. SCG 2005: 73-80 - [c40]Sergey Bereg, David G. Kirkpatrick:
Curvature-bounded traversals of narrow corridors. SCG 2005: 278-287 - [c39]Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Binhai Zhu:
Guarding a terrain by two watchtowers. SCG 2005: 346-355 - [c38]Sergey Bereg, Hao Wang:
Wiener Indices of Balanced Binary Trees. International Conference on Computational Science (2) 2005: 851-859 - 2004
- [j24]Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink:
Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree. Algorithmica 38(4): 577-589 (2004) - [j23]Yih-En Andrew Ban, Sergey Bereg, Nabil H. Mustafa:
A Conjecture on Wiener Indices in Combinatorial Chemistry. Algorithmica 40(2): 99-117 (2004) - [j22]Sergey Bereg:
Cylindrical hierarchy for deforming necklaces. Int. J. Comput. Geom. Appl. 14(1-2): 3-17 (2004) - [j21]Sergey Bereg:
Transforming pseudo-triangulations. Inf. Process. Lett. 90(3): 141-145 (2004) - [j20]Sergei Bespamyatnikh, Michael Segal:
Selecting distances in arrangements of hyperplanes spanned by points. J. Discrete Algorithms 2(3): 333-345 (2004) - [j19]Sergey Bereg, Michael Segal:
Dynamic Algorithms for Approximating Interdistances. Nord. J. Comput. 11(4): 344-355 (2004) - [c37]Francois Anton, Sergey Bereg:
The fitting line problem in the laguerre geometry. CCCG 2004: 166-169 - [c36]Sergey Bereg:
Equipartitions of Measures by 2-Fans. ISAAC 2004: 149-158 - [c35]Minghui Jiang, Sergey Bereg, Zhongping Qin, Binhai Zhu:
New Bounds on Map Labeling with Circular Labels. ISAAC 2004: 606-617 - [c34]Sergey Bereg:
Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs. JCDCG 2004: 29-36 - [c33]Sergey Bereg, Adrian Dumitrescu, János Pach:
Sliding Disks in the Plane. JCDCG 2004: 37-47 - [c32]Sergei Bespamyatnikh:
Encoding Homotopy of Paths in the Plane. LATIN 2004: 329-338 - [c31]Sergey Bereg:
Reconstruction of gt-Networks from Gene Trees. METMBS 2004: 336-340 - [c30]Sergey Bereg, Minghui Jiang, Binhai Zhu:
Contour interpolation with bounded dihedral angles. Symposium on Solid Modeling and Applications 2004: 303-308 - 2003
- [j18]Sergei Bespamyatnikh:
An O(nlogn) algorithm for the zoo-keeper's problem. Comput. Geom. 24(2): 63-74 (2003) - [j17]Sergei Bespamyatnikh:
Computing Closest Points for Segments. Int. J. Comput. Geom. Appl. 13(5): 419-438 (2003) - [j16]Sergei Bespamyatnikh:
Computing homotopic shortest paths in the plane. J. Algorithms 49(2): 284-303 (2003) - [j15]Sergey Bereg, Andrei V. Kelarev:
An Algorithm for Analysis of Images in Spatial Information Systems. J. Autom. Lang. Comb. 8(4): 557-565 (2003) - [j14]Sergei Bespamyatnikh, Andrei V. Kelarev:
Algorithms for shortest paths and d-cycle problems. J. Discrete Algorithms 1(1): 1-9 (2003) - [c29]Michael J. Spriggs, J. Mark Keil, Sergei Bespamyatnikh, Michael Segal, Jack Snoeyink:
Approximating the geometric minimum-diameter spanning tree. CCCG 2003: 39-42 - [c28]Marina L. Gavrilova, Sergei Bespamyatnikh:
On exact solution of a point-location problem in a system of d-dimensional hyperbolic surfaces. CCCG 2003: 136-139 - [c27]Sergei Bespamyatnikh:
Cylindrical Hierarchy for Deforming Necklaces. COCOON 2003: 20-29 - [c26]Yih-En Andrew Ban, Sergei Bespamyatnikh, Nabil H. Mustafa:
On a Conjecture on Wiener Indices in Combinatorial Chemistry. COCOON 2003: 509-518 - [c25]Sergei Bespamyatnikh, Michael Segal:
Dynamic Algorithms for Approximating Interdistances. ICALP 2003: 1169-1180 - [c24]Sergei Bespamyatnikh:
Transforming Pseudo-Triangulations. International Conference on Computational Science 2003: 533-539 - [c23]Sergei Bespamyatnikh:
An Approximate Morphing between Polylines. ICCSA (3) 2003: 807-816 - [c22]Sergei Bespamyatnikh:
Computing homotopic shortest paths in the plane. SODA 2003: 609-617 - 2002
- [j13]Sergei Bespamyatnikh, Michael Segal:
Fast Algorithms for Approximating Distances. Algorithmica 33(2): 263-269 (2002) - [j12]Sergei Bespamyatnikh:
Packing two disks in a polygon. Comput. Geom. 23(1): 31-42 (2002) - [j11]Sergei Bespamyatnikh:
An efficient algorithm for enumeration of triangulations. Comput. Geom. 23(3): 271-279 (2002) - [j10]Sergei Bespamyatnikh:
An Optimal Morphing Between Polylines. Int. J. Comput. Geom. Appl. 12(3): 217-228 (2002) - [j9]Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal:
Efficient algorithms for centers and medians in interval and circular-arc graphs. Networks 39(3): 144-152 (2002) - [c21]Sergei Bespamyatnikh:
Computing closest points for segments. CCCG 2002: 118-122 - [c20]Sergei Bespamyatnikh:
Enumerating pseudo-triangulations in the plane. CCCG 2002: 162-166 - [c19]Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal:
Lower and Upper Bounds for Tracking Mobile Users. IFIP TCS 2002: 47-58 - [c18]Sergei Bespamyatnikh:
On Partitioning a Cake. JCDCG 2002: 60-71 - [c17]Sergei Bespamyatnikh, David G. Kirkpatrick:
Constrained Equitable 3-Cuttings. JCDCG 2002: 72-83 - 2001
- [j8]Sergei Bespamyatnikh:
An Efficient Algorithm for the Three-Dimensional Diameter Problem. Discret. Comput. Geom. 25(2): 235-255 (2001) - [c16]Sergei Bespamyatnikh, Zhixiang Chen, Kanliang Wang, Binhai Zhu:
On the Planar Two-Watchtower Problem. COCOON 2001: 121-130 - [c15]Sergei Bespamyatnikh:
Enumerating Triangulations of Convex Polytopes. DM-CCG 2001: 111-122 - [c14]Sergei Bespamyatnikh, Michael Segal:
Fast Maintenance of Rectilinear Centers. International Conference on Computational Science (1) 2001: 633-639 - 2000
- [j7]Sergei Bespamyatnikh, Jack Snoeyink:
Queries with segments in Voronoi diagrams. Comput. Geom. 16(1): 23-33 (2000) - [j6]Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink:
Generalizing Ham Sandwich Cuts to Equitable Subdivisions. Discret. Comput. Geom. 24(4): 605-622 (2000) - [j5]Sergei Bespamyatnikh, Klara Kedem, Michael Segal, Arie Tamir:
Optimal Facility Location Under Various Distance Functions. Int. J. Comput. Geom. Appl. 10(5): 523-534 (2000) - [j4]Sergei Bespamyatnikh, Michael Segal:
Covering a set of points by two axis-parallel boxes. Inf. Process. Lett. 75(3): 95-100 (2000) - [j3]Sergei Bespamyatnikh, Michael Segal:
Enumerating longest increasing subsequences and patience sorting. Inf. Process. Lett. 76(1-2): 7-11 (2000) - [c13]Sergei Bespamyatnikh, Binay K. Bhattacharya, David G. Kirkpatrick, Michael Segal:
Mobile facility location. DIAL-M 2000: 46-53 - [c12]Sergei Bespamyatnikh, Binay K. Bhattacharya, J. Mark Keil, David G. Kirkpatrick, Michael Segal:
Efficient Algorithms for Centers and Medians in Interval and Circular-Arc Graphs. ESA 2000: 100-111
1990 – 1999
- 1999
- [c11]Sergei Bespamyatnikh, David G. Kirkpatrick:
Rectilinear 2-center problems. CCCG 1999 - [c10]Sergei Bespamyatnikh, David G. Kirkpatrick, Jack Snoeyink:
Generalizing Ham Sandwich Cuts to Equitable Subdivisions. SCG 1999: 49-58 - [c9]Sergei Bespamyatnikh, Jack Snoeyink:
Queries with Segments in Voronoi Diagrams. SODA 1999: 122-129 - [c8]Sergei Bespamyatnikh, Michael Segal:
Rectilinear Static and Dynamic Discrete 2-center Problems. WADS 1999: 276-287 - [c7]Sergei Bespamyatnikh, Klara Kedem, Michael Segal:
Optimal Facility Location under Various Distance Functions. WADS 1999: 318-329 - 1998
- [j2]Sergei Bespamyatnikh:
An Optimal Algorithm for Closest-Pair Maintenance. Discret. Comput. Geom. 19(2): 175-195 (1998) - [c6]Sergei Bespamyatnikh:
An Efficient Algorithm for the Three-Dimensional Diameter Problem. SODA 1998: 137-146 - 1997
- [j1]Sergei Bespamyatnikh:
On Constructing Minimum Spanning Trees in Rkl. Algorithmica 18(4): 524-529 (1997) - [c5]Sergei Bespamyatnikh, Michael Segal:
Covering a set of points by two axis-parallel boxes. CCCG 1997 - 1996
- [c4]Sergei Bespamyatnikh:
An Optimal Algorithm for Dynamic Post-office Problem in R21 and Related Problems. CCCG 1996: 101-106 - [c3]Sergei Bespamyatnikh:
Dynamic Algorithms for Approximate Neighbor Searching. CCCG 1996: 252-257 - 1995
- [c2]Sergei Bespamyatnikh:
An Optimal Algorithm for Closest Pair Maintenance (Extended Abstract). SCG 1995: 152-161 - 1994
- [c1]Sergei Bespamyatnikh:
The Region Approach for some Dynamic Closest-Point Problems. CCCG 1994: 75-80
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-20 21:56 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
