Sergey Bereg

Sergey Bereg is a Professor of Computer Science at the University of Texas at Dallas (UTD), affiliated with the Erik Jonsson School of Engineering and Computer Science. He has held this position since 2018. His research focuses on computational geometry, combinatorial optimization, and algorithm design, with applications in computational biology, geographic information systems, and network communications. He earned his Ph.D. in Computer Science from the Minsk Institute of Mathematics in 1992.

His research interests include computational geometry and geometric optimization, with notable contributions to permutation arrays, convex partitions, and geometric algorithms. He has also explored applications in bioinformatics, such as genome rearrangement visualization, and robotics, including multi-drone coordination and coverage problems. His work often bridges theoretical foundations with practical implementations in areas like sensor networks and vehicular systems.

Bereg’s publications span a wide range of topics, emphasizing combinatorial algorithms and geometric problems. Recent trends in his work include permutation arrays under various metrics, drone-based coverage algorithms, and robust synchronization in multi-agent systems. His research demonstrates a strong focus on both theoretical advancements and real-world applications.

Though no specific awards are mentioned in the provided text, his extensive publication record underscores his contributions to the field. He has advised numerous students through his academic career, though specific names are not listed here. His projects include work on graph rigidity and Voronoi diagrams, reflecting his interdisciplinary approach to computational challenges.