S. Bereg

发表

Monadic Decomposition

Sergey Bereg, Nikolaj Bjørner, Margus Veanes, 2014, CAV.

Competitive Algorithms for Mobile Centers ∗

B. Bhattacharya, D. Kirkpatrick, M. Segal, 2022 .

Wiener Indices of Binary Trees

S. Bereg, 2004 .

Representing Permutations with Few Moves

Sergey Bereg, Lev Nachmanson, Alexander E. Holroyd, 2015, SIAM J. Discret. Math..

Bichromatic Discrepancy via Convex Partitions

S. Bereg, C. Seara, D. Lara, 2006 .

Phylogenetic Networks Based on the Molecular Clock Hypothesis

S. Bereg, Yuanyi Zhang, Sergey Bereg, 2007, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

Analysis of Layered Hierarchies for Necklaces

S. Bereg, Kathryn Bean, 2004 .

Analysis of Layered Hierarchy for Necklaces

S. Bereg, Kathryn Bean, 2004 .

Computing homotopic shortest paths in the plane

Sergey Bereg, S. Bereg, 2003, SODA.

Computation of new diagonal graph Ramsey numbers

S. Bereg, R. Low, Ardak Kapbasov, 2022, Electron. J. Graph Theory Appl..

Constructing permutation arrays using partition and extension

Luis Gerardo Mojica, S. Bereg, H. Sudborough, 2019, Designs, Codes and Cryptography.

New lower bounds for permutation arrays using contraction

I. H. Sudborough, Luis Gerardo Mojica, Z. Miller, 2019, Designs, Codes and Cryptography.

Constructing permutation arrays from groups

I. H. Sudborough, S. Bereg, Avi Levy, 2017, Designs, Codes and Cryptography.

Extending permutation arrays: improving MOLS bounds

I. H. Sudborough, S. Bereg, L. Morales, 2016, Designs, Codes and Cryptography.

On Partitioning a Cake

Sergey Bereg, S. Bereg, 2002, JCDCG.

Optimal Facility Location under Various Distance Functions

Sergey Bereg, Michael Segal, Klara Kedem, 1999, WADS.

Facility location problems with uncertainty on the plane

Sergey Bereg, Igor Averbakh, I. Averbakh, 2005, Discret. Optim..

Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs

Sergey Bereg, S. Bereg, 2008, Comput. Geom..

Approximating Metrics with Planar boundary-Labeled Phylogenetic Networks

Sergey Bereg, Ruogu Sheng, S. Bereg, 2012, J. Bioinform. Comput. Biol..

Constructing phylogenetic networks from trees

Sergey Bereg, Kathryn Bean, S. Bereg, 2005, Fifth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'05).

An accurate algorithm to match imperfectly matched images for lung tumor detection without markers

Sergey Bereg, Weihua Mao, Yulong Yan, 2015, Journal of applied clinical medical physics.

An optimal algorithm for closest pair maintenance (extended abstract)

Sergey Bereg, S. Bereg, Sergey Bereg, 1995, SCG '95.

Phylogenetic networks based on the molecular clock hypothesis

Sergey Bereg, Yuanyi Zhang, S. Bereg, 2005, Fifth IEEE Symposium on Bioinformatics and Bioengineering (BIBE'05).

Computing melodic templates in oral music traditions

Sergey Bereg, José Miguel Díaz-Báñez, Inmaculada Ventura, 2019, Appl. Math. Comput..

Equivalence Relations for Computing Permutation Polynomials

I. H. Sudborough, S. Bereg, Brian Malouf, 2019, ArXiv.

Constructing Order Type Graphs using an Axiomatic Approach

Sergey Bereg, Mohammadreza Haghpanah, S. Bereg, 2020, COCOA.

Monadic Decomposition

Sergey Bereg, Nikolaj Bjørner, Margus Veanes, 2014, CAV.

A Conjecture on Wiener Indices in Combinatorial Chemistry

Sergey Bereg, Nabil H. Mustafa, Yih-En Andrew Ban, 2003, Algorithmica.

On a Conjecture on Wiener Indices in Combinatorial Chemistry

Sergey Bereg, Nabil H. Mustafa, Yih-En Andrew Ban, 2003, COCOON.

Optimizing some constructions with bars: new geometric knapsack problems

Sergey Bereg, Jorge Urrutia, Stefan Langerman, 2016, J. Comb. Optim..

Certifying and constructing minimally rigid graphs in the plane

Sergey Bereg, S. Bereg, 2005, SCG.

An intra-fraction markerless daily lung tumor localization algorithm for EPID images

Sergey Bereg, Weihua Mao, Timothy Rozario, 2015, PETRA.

On the robustness of a synchronized multi-robot system

Sergey Bereg, José Miguel Díaz-Báñez, Luis Evaristo Caraballo, 2020, J. Comb. Optim..

A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Networks under Unit Disk Coverage Model

Sergey Bereg, Kamil Saraç, Ramaswamy Chandrasekaran, 2009, IEEE Transactions on Parallel and Distributed Systems.

The Lifting Model for Reconfiguration

Sergey Bereg, Adrian Dumitrescu, S. Bereg, 2005, Discret. Comput. Geom..

Node Overlap Removal by Growing a Tree pdf

Sergey Bereg, Lev Nachmanson, Alexander E. Holroyd, 2016, J. Graph Algorithms Appl..

Transforming Graphs with the Same Graphic Sequence

Sergey Bereg, Hiro Ito, Hiro Ito, 2017, J. Inf. Process..

Optimizing Phylogenetic Networks for Circular Split Systems

Sergey Bereg, Paul Phipps, S. Bereg, 2012, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

Approximating the geometric minimum-diameter spanning tree

Sergey Bereg, Michael Segal, Jack Snoeyink, 2003, CCCG.

Computing a (1+ε)-Approximate Geometric Minimum-Diameter Spanning Tree

Sergey Bereg, Michael Segal, Jack Snoeyink, 2003, Algorithmica.

Enumerating longest increasing subsequences and patience sorting

Sergey Bereg, Michael Segal, M. Segal, 2000, Inf. Process. Lett..

A Novel Markerless Lung Tumor-Tracking Method Using Treatment MV Beam Imaging

Sergey Bereg, Weiguo Lu, Weihua Mao, 2018, Applied Sciences.

Efficient algorithms for centers and medians in interval and circular‐arc graphs

Sergey Bereg, Michael Segal, David G. Kirkpatrick, 2002, Networks.

Constructing permutation arrays from groups

Sergey Bereg, Ivan Hal Sudborough, Avi Levy, 2015, Designs, Codes and Cryptography.

Compatible geometric matchings

Sergey Bereg, Jorge Urrutia, David R. Wood, 2007, Comput. Geom..

Recent Developments and Open Problems in Voronoi Diagrams

Sergey Bereg, S. Bereg, 2006, 2006 3rd International Symposium on Voronoi Diagrams in Science and Engineering.

RNA multiple structural alignment with longest common subsequences

Sergey Bereg, Binhai Zhu, B. Zhu, 2005, J. Comb. Optim..

Algorithms for shortest paths and d-cycle problems

Sergey Bereg, Andrei V. Kelarev, A. Kelarev, 2003, J. Discrete Algorithms.

Visualization of genome rearrangements using DCJ operations

Sergey Bereg, Sruthi Chappidi, S. Bereg, 2018, IWISC.

DCJVis: visualization of genome rearrangements using DCJ operations

S. Bereg, Sruthi Chappidi, 2017, 1712.09403.

Saliency improvement through genetic programming

Sergey Bereg, Marco A. Contreras-Cruz, Uriel Haile Hernández Belmonte, 2018, IWISC.

Traversing a Set of Points with a Minimum Number of Turns

Sergey Bereg, Prosenjit Bose, Pavel Valtr, 2007, SCG '07.

Colored Non-crossing Euclidean Steiner Forest

Alexander Wolff, Sergey Bereg, Philipp Kindermann, 2015, ISAAC.

On the red/blue spanning tree problem

Sergey Bereg, Boting Yang, Binhai Zhu, 2009, Theor. Comput. Sci..

Rectilinear Static and Dynamic Discrete 2-center Problems

Sergey Bereg, Michael Segal, M. Segal, 1999, WADS.

Rectilinear 2-center problems

Sergey Bereg, David G. Kirkpatrick, D. Kirkpatrick, 1999, CCCG.

Dynamic Algorithms for Approximate Neighbor Searching

Sergey Bereg, S. Bereg, 1996, CCCG.

On Covering Problems of Rado

Sergey Bereg, Adrian Dumitrescu, Minghui Jiang, 2010, Algorithmica.

Maximum Area Independent Sets in Disk Intersection Graphs

Sergey Bereg, Adrian Dumitrescu, Minghui Jiang, 2010, Int. J. Comput. Geom. Appl..

Algorithms for Radon Partitions with Tolerance

Sergey Bereg, Mohammadreza Haghpanah, S. Bereg, 2020, CALDAM.

On Characterizations of Rigid Graphs in the Plane Using Spanning Trees

Sergey Bereg, S. Bereg, 2009, Graphs Comb..

An Algorithm for Analysis of Images in Spatial Information Systems

Sergey Bereg, Andrei V. Kelarev, A. Kelarev, 2003, J. Autom. Lang. Comb..

Transforming Graphs with the Same Graphic Sequence

Hiro Ito, S. Bereg, 2017, J. Inf. Process..

A decentralized geometric approach for the formation keeping in unmanned aircraft navigation

S. Bereg, J. M. Diaz-Banez, M. A. Lopez, 2015, 2015 International Conference on Unmanned Aircraft Systems (ICUAS).

Fast Algorithms for Approximating Distances

Sergey Bereg, Michael Segal, M. Segal, 2002, Algorithmica.

The class cover problem with boxes

Sergey Bereg, Pablo Pérez-Lantero, José Miguel Díaz-Báñez, 2012, Comput. Geom..

The Maximum Box Problem for moving points in the plane

Sergey Bereg, Pablo Pérez-Lantero, José Miguel Díaz-Báñez, 2011, J. Comb. Optim..

The fitting line problem in the laguerre geometry

Sergey Bereg, François Anton, S. Bereg, 2004, CCCG.

Guarding Orthogonal Galleries with Rectangular Rooms

Sergey Bereg, António Leslie Bajuelos, Ana Mafalda Martins, 2014, Comput. J..

On Some City Guarding Problems

Sergey Bereg, Ovidiu Daescu, Junqiang Zhou, 2008, COCOON.

Contour interpolation with bounded dihedral angles

Sergey Bereg, Binhai Zhu, Minghui Jiang, 2004, SM '04.

Generalizing Ham Sandwich Cuts to Equitable Subdivisions

Sergey Bereg, David G. Kirkpatrick, Jack Snoeyink, 1999, SCG '99.

New lower bounds for permutation arrays using contraction

Sergey Bereg, Zevi Miller, Linda Morales, 2018, Designs, Codes and Cryptography.

Maximizing Hamming Distance in Contraction of Permutation Arrays pdf

Sergey Bereg, Zevi Miller, Ivan Hal Sudborough, 2018, ArXiv.

Kronecker product and tiling of permutation arrays for hamming distances

Sergey Bereg, Ivan Hal Sudborough, Linda Morales, 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

Parallel Partition and Extension

Sergey Bereg, Ivan Hal Sudborough, Linda Morales, 2017, 2017 51st Annual Conference on Information Sciences and Systems (CISS).

Parallel Partition and Extension : Better Permutation Arrays for Hamming Distances

Sergey Bereg, Linda Morales, Hal Sudborough, 2017 .

Voronoi Diagram of Polygonal Chains under the Discrete FRéChet Distance pdf

Sergey Bereg, Marina L. Gavrilova, Kevin Buchin, 2007, Int. J. Comput. Geom. Appl..

Approximating Barrier Resilience in Wireless Sensor Networks

Sergey Bereg, David G. Kirkpatrick, D. Kirkpatrick, 2009, ALGOSENSORS.

Automatically Approximating 3D Points with Co-Axisal Objects

Sergey Bereg, Chenglei Yang, Xiangxu Meng, 2008, 2008 International Conference on Computational Sciences and Its Applications.

Cylindrical hierarchy for deforming necklaces

Sergey Bereg, S. Bereg, 2004, Int. J. Comput. Geom. Appl..

Using permutation rational functions to obtain permutation arrays with large hamming distance

I. H. Sudborough, S. Bereg, Brian Malouf, 2022, Designs, Codes and Cryptography.

Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions pdf

Sergey Bereg, Linda Morales, I. H. Sudborough, 2020, WAIFI.

Constructing permutation arrays using partition and extension

Sergey Bereg, Ivan Hal Sudborough, Linda Morales, 2018, Designs, Codes and Cryptography.

Extending permutation arrays: improving MOLS bounds

Sergey Bereg, Ivan Hal Sudborough, Linda Morales, 2016, Designs, Codes and Cryptography.

On finding widest empty curved corridors

Sergey Bereg, José Miguel Díaz-Báñez, Inmaculada Ventura, 2007, Comput. Geom..

A framework for synchronizing a team of aerial robots in communication-limited environments pdf

Aníbal Ollero, Sergey Bereg, José Miguel Díaz-Báñez, 2019, ArXiv.

A General Framework for Synchronizing a Team of Robots Under Communication Constraints

Sergey Bereg, Anibal Ollero, Luis Evaristo Caraballo, 2017, IEEE Transactions on Robotics.

A lower bound on permutation codes of distance n-1\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$n-1$$\end{document}

S. Bereg, Peter J. Dukes, 2019, Designs, Codes and Cryptography.

A lower bound on permutation codes of distance $$n-1$$n-1

Sergey Bereg, Peter Dukes, S. Bereg, 2019, Des. Codes Cryptogr..

A new algorithmic framework for basic problems on binary images

Sergey Bereg, Tetsuo Asano, Lilian Buzer, 2017, Discret. Appl. Math..

Enumerating pseudo-triangulations in the plane

Sergey Bereg, S. Bereg, 2005, Comput. Geom..