Sergey Bereg

According to our database1, Sergey Bereg authored at least 152 papers between 1994 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2020
On the robustness of a synchronized multi-robot system.
J. Comb. Optim., 2020

Constructing permutation arrays using partition and extension.
Des. Codes Cryptogr., 2020

A lower bound on permutation codes of distance n-1.
Des. Codes Cryptogr., 2020

New lower bounds for Tverberg partitions with tolerance in the plane.
Discret. Appl. Math., 2020

Improved Lower Bounds for Permutation Arrays Using Permutation Rational Functions.
CoRR, 2020

Algorithms for Radon Partitions with Tolerance.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

New Algorithms and Bounds for Halving Pseudolines.
Proceedings of the Algorithms and Discrete Applied Mathematics, 2020

2019
On some matching problems under the color-spanning model.
Theor. Comput. Sci., 2019

New lower bounds for permutation arrays using contraction.
Des. Codes Cryptogr., 2019

Equivalence Relations for Computing Permutation Polynomials.
CoRR, 2019

On Maximum-Sum Matchings of Points.
CoRR, 2019

A framework for synchronizing a team of aerial robots in communication-limited environments.
CoRR, 2019

Computing melodic templates in oral music traditions.
Appl. Math. Comput., 2019

2018
Preface.
Theor. Comput. Sci., 2018

Optimizing squares covering a set of points.
Theor. Comput. Sci., 2018

Computing the k-resilience of a synchronized multi-robot system.
J. Comb. Optim., 2018

Constructing permutation arrays from groups.
Des. Codes Cryptogr., 2018

A construction of product blocks with a fixed block size.
CoRR, 2018

Maximizing Hamming Distance in Contraction of Permutation Arrays.
CoRR, 2018

Saliency improvement through genetic programming.
Proceedings of the 3rd International Workshop on Interactive and Spatial Computing, 2018

Visualization of genome rearrangements using DCJ operations.
Proceedings of the 3rd International Workshop on Interactive and Spatial Computing, 2018

2017
A General Framework for Synchronizing a Team of Robots Under Communication Constraints.
IEEE Trans. Robotics, 2017

Transforming Graphs with the Same Graphic Sequence.
J. Inf. Process., 2017

Node Overlap Removal by Growing a Tree.
J. Graph Algorithms Appl., 2017

Monadic Decomposition.
J. ACM, 2017

Extending permutation arrays: improving MOLS bounds.
Des. Codes Cryptogr., 2017

A new algorithmic framework for basic problems on binary images.
Discret. Appl. Math., 2017

Efficient Inspection of Underground Galleries Using k Robots with Limited Energy.
Proceedings of the ROBOT 2017: Third Iberian Robotics Conference, 2017

Kronecker product and tiling of permutation arrays for hamming distances.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model.
Proceedings of the Frontiers in Algorithmics - 11th International Workshop, 2017

Parallel Partition and Extension.
Proceedings of the 51st Annual Conference on Information Sciences and Systems, 2017

2016
Representing Permutations with Few Moves.
SIAM J. Discret. Math., 2016

Optimizing some constructions with bars: new geometric knapsack problems.
J. Comb. Optim., 2016

Resilience of a synchronized multi-agent system.
CoRR, 2016

Edge routing with ordered bundles.
Comput. Geom., 2016

On the edge crossing properties of Euclidean minimum weight Laman graphs.
Comput. Geom., 2016

On the 2-Center Problem Under Convex Polyhedral Distance Function.
Proceedings of the Combinatorial Optimization and Applications, 2016

2015
Balanced partitions of 3-colored geometric sets in the plane.
Discret. Appl. Math., 2015

On balanced 4-holes in bichromatic point sets.
Comput. Geom., 2015

An intra-fraction markerless daily lung tumor localization algorithm for EPID images.
Proceedings of the 8th ACM International Conference on PErvasive Technologies Related to Assistive Environments, 2015

Colored Non-crossing Euclidean Steiner Forest.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

The synchronization problem for information exchange between aerial robots under communication constraints.
Proceedings of the IEEE International Conference on Robotics and Automation, 2015

Smallest Maximum-Weight Circle for Weighted Points in the Plane.
Proceedings of the Computational Science and Its Applications - ICCSA 2015, 2015

2014
Embedding the double Circle in a Square Grid of Minimum Size.
Int. J. Comput. Geom. Appl., 2014

Continuous Surveillance of Points by rotating Floodlights.
Int. J. Comput. Geom. Appl., 2014

Guarding Orthogonal Galleries with Rectangular Rooms.
Comput. J., 2014

A markerless tiling method for tracking daily lung tumor motion on imperfectly matched images.
Proceedings of the 7th International Conference on PErvasive Technologies Related to Assistive Environments, 2014

2013
Drawing the double circle on a grid of minimum size
CoRR, 2013

On the coarseness of bicolored point sets.
Comput. Geom., 2013

Effectively Monadic Predicates.
Proceedings of the LPAR 2013, 2013

Drawing Permutations with Few Corners.
Proceedings of the Graph Drawing - 21st International Symposium, 2013

2012
Optimizing Phylogenetic Networks for Circular Split Systems.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Approximating Metrics with Planar boundary-Labeled Phylogenetic Networks.
J. Bioinform. Comput. Biol., 2012

Computing generalized ham-sandwich cuts.
Inf. Process. Lett., 2012

Angle Optimization of Graphs Embedded in the Plane
CoRR, 2012

The class cover problem with boxes.
Comput. Geom., 2012

Balanced Line for a 3-Colored Point Set in the Plane.
Electron. J. Comb., 2012

Small Work Space Algorithms for Some Basic Problems on Binary Images.
Proceedings of the Combinatorial Image Analysis - 15th International Workshop, 2012

A New Framework for Connected Components Labeling of Binary Images.
Proceedings of the Combinatorial Image Analysis - 15th International Workshop, 2012

2011
On the red/blue spanning tree problem.
Theor. Comput. Sci., 2011

The Maximum Box Problem for moving points in the plane.
J. Comb. Optim., 2011

2010
Maximum Area Independent Sets in Disk Intersection Graphs.
Int. J. Comput. Geom. Appl., 2010

Voronoi Diagram of Polygonal Chains under the Discrete FRéChet Distance.
Int. J. Comput. Geom. Appl., 2010

On Covering Problems of Rado.
Algorithmica, 2010

Guarding a Terrain by Two Watchtowers.
Algorithmica, 2010

Orthogonal Ham-Sandwich Theorem in R<sup>3</sup>.
Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, 2010

2009
A Polynomial Time Solution to Minimum Forwarding Set Problem in Wireless Networks under Unit Disk Coverage Model.
IEEE Trans. Parallel Distributed Syst., 2009

On Characterizations of Rigid Graphs in the Plane Using Spanning Trees - On Characterizations of Rigid Graphs in the Plane.
Graphs Comb., 2009

Traversing a Set of Points with a Minimum Number of Turns.
Discret. Comput. Geom., 2009

Matching points with rectangles and squares.
Comput. Geom., 2009

Orthogonal equipartitions.
Comput. Geom., 2009

A PTAS for Cutting Out Polygons with Lines.
Algorithmica, 2009

Counting Faces in Split Networks.
Proceedings of the Bioinformatics Research and Applications, 5th International Symposium, 2009

Finding Nearest Larger Neighbors.
Proceedings of the Efficient Algorithms, 2009

Approximating Barrier Resilience in Wireless Sensor Networks.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

2008
Robust Point-Location in Generalized Voronoi Diagrams.
Proceedings of the Generalized Voronoi Diagram: A Geometry-Based Approach to Computational Intelligence, 2008

Sliding Disks in the Plane.
Int. J. Comput. Geom. Appl., 2008

Compatible Geometric Matchings.
Electron. Notes Discret. Math., 2008

Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs.
Comput. Geom., 2008

Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance.
Proceedings of the LATIN 2008: Theoretical Informatics, 2008

Automatically Approximating 3D Points with Co-Axisal Objects.
Proceedings of the Selected Papers of the Sixth International Conference on Computational Sciences and Its Applications, 2008

On Some City Guarding Problems.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

Clustered SplitsNetworks.
Proceedings of the Combinatorial Optimization and Applications, 2008

2007
Phylogenetic Networks Based on the Molecular Clock Hypothesis.
IEEE ACM Trans. Comput. Biol. Bioinform., 2007

RNA multiple structural alignment with longest common subsequences.
J. Comb. Optim., 2007

Wiener indices of balanced binary trees.
Discret. Appl. Math., 2007

Faster Algorithms for Rigidity in the Plane
CoRR, 2007

Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
CoRR, 2007

On finding widest empty curved corridors.
Comput. Geom., 2007

Straightening Drawings of Clustered Hierarchical Graphs.
Proceedings of the SOFSEM 2007: Theory and Practice of Computer Science, 2007

Transforming Graphs with the Same Degree Sequence.
Proceedings of the Computational Geometry and Graph Theory, 2007

2006
Competitive Algorithms for Maintaining a Mobile Center.
Mob. Networks Appl., 2006

The Lifting Model for Reconfiguration.
Discret. Comput. Geom., 2006

Equitable subdivisions within polygonal regions.
Comput. Geom., 2006

Moving coins.
Comput. Geom., 2006

Robust Point-Location in Generalized Voronoi Diagrams.
Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering, 2006

Recent Developments and Open Problems in Voronoi Diagrams.
Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering, 2006

2005
An approximate morphing between polylines.
Int. J. Comput. Geom. Appl., 2005

Facility location problems with uncertainty on the plane.
Discret. Optim., 2005

Equipartitions of Measures by 2-Fans.
Discret. Comput. Geom., 2005

Enumerating pseudo-triangulations in the plane.
Comput. Geom., 2005

Curvature-bounded traversals of narrow corridors.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Certifying and constructing minimally rigid graphs in the plane.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Guarding a terrain by two watchtowers.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

RNA Multiple Structural Alignment with Longest Common Subsequences.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

Constructing Phylogenetic Networks from Trees.
Proceedings of the Fifth IEEE International Symposium on Bioinformatic and Bioengineering (BIBE 2005), 2005

2004
Dynamic Algorithms for Approximating Interdistances.
Nord. J. Comput., 2004

Selecting distances in arrangements of hyperplanes spanned by points.
J. Discrete Algorithms, 2004

Transforming pseudo-triangulations.
Inf. Process. Lett., 2004

Cylindrical hierarchy for deforming necklaces.
Int. J. Comput. Geom. Appl., 2004

Computing a (1+epsilon)-Approximate Geometric Minimum-Diameter Spanning Tree.
Algorithmica, 2004

A Conjecture on Wiener Indices in Combinatorial Chemistry.
Algorithmica, 2004

Contour interpolation with bounded dihedral angles.
Proceedings of the Ninth ACM Symposium on Solid Modeling and Applications, 2004

Reconstruction of gt-Networks from Gene Trees.
Proceedings of the International Conference on Mathematics and Engineering Techniques in Medicine and Biological Scienes, 2004

Encoding Homotopy of Paths in the Plane.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

Algorithms for the <i>d</i>-Dimensional Rigidity Matroid of Sparse Graphs.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2004

New Bounds on Map Labeling with Circular Labels.
Proceedings of the Algorithms and Computation, 15th International Symposium, 2004

The fitting line problem in the laguerre geometry.
Proceedings of the 16th Canadian Conference on Computational Geometry, 2004

2003
Algorithms for shortest paths and d-cycle problems.
J. Discrete Algorithms, 2003

An Algorithm for Analysis of Images in Spatial Information Systems.
J. Autom. Lang. Comb., 2003

Computing homotopic shortest paths in the plane.
J. Algorithms, 2003

Computing Closest Points for Segments.
Int. J. Comput. Geom. Appl., 2003

An O(nlogn) algorithm for the zoo-keeper's problem.
Comput. Geom., 2003

Approximating the geometric minimum-diameter spanning tree.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

On exact solution of a point-location problem in a system of d-dimensional hyperbolic surfaces.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
Efficient algorithms for centers and medians in interval and circular-arc graphs.
Networks, 2002

An Optimal Morphing Between Polylines.
Int. J. Comput. Geom. Appl., 2002

An efficient algorithm for enumeration of triangulations.
Comput. Geom., 2002

Packing two disks in a polygon.
Comput. Geom., 2002

Fast Algorithms for Approximating Distances.
Algorithmica, 2002

Constrained Equitable 3-Cuttings.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

On Partitioning a Cake.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

Lower and Upper Bounds for Tracking Mobile Users.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2001
An Efficient Algorithm for the Three-Dimensional Diameter Problem.
Discret. Comput. Geom., 2001

Fast Maintenance of Rectilinear Centers.
Proceedings of the Computational Science - ICCS 2001, 2001

Enumerating Triangulations of Convex Polytopes.
Proceedings of the Discrete Models: Combinatorics, Computation, and Geometry, 2001

On the Planar Two-Watchtower Problem.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

2000
Enumerating longest increasing subsequences and patience sorting.
Inf. Process. Lett., 2000

Covering a set of points by two axis-parallel boxes.
Inf. Process. Lett., 2000

Optimal Facility Location Under Various Distance Functions.
Int. J. Comput. Geom. Appl., 2000

Generalizing Ham Sandwich Cuts to Equitable Subdivisions.
Discret. Comput. Geom., 2000

Queries with segments in Voronoi diagrams.
Comput. Geom., 2000

Mobile facility location.
Proceedings of the 4th International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIAL-M 2000), 2000

1999
Rectilinear Static and Dynamic Discrete 2-center Problems.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Optimal Facility Location under Various Distance Functions.
Proceedings of the Algorithms and Data Structures, 6th International Workshop, 1999

Rectilinear 2-center problems.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998
An Optimal Algorithm for Closest-Pair Maintenance.
Discret. Comput. Geom., 1998

1997
On Constructing Minimum Spanning Trees in R<sup>k</sup><sub>l</sub>.
Algorithmica, 1997

1996
Dynamic Algorithms for Approximate Neighbor Searching.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

An Optimal Algorithm for Dynamic Post-office Problem in R21 and Related Problems.
Proceedings of the 8th Canadian Conference on Computational Geometry, 1996

1995
An Optimal Algorithm for Closest Pair Maintenance (Extended Abstract).
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
The Region Approach for some Dynamic Closest-Point Problems.
Proceedings of the 6th Canadian Conference on Computational Geometry, 1994


  Loading...