The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sergey Bereg: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Sergey Bereg, Kathryn Bean
    Constructing Phylogenetic Networks from Trees. [Citation Graph (0, 0)][DBLP]
    BIBE, 2005, pp:299-305 [Conf]
  2. S. Bereg, Y. Zhang
    Phylogenetic Networks Based on the Molecular Clock Hypothesis. [Citation Graph (0, 0)][DBLP]
    BIBE, 2005, pp:320-323 [Conf]
  3. Francois Anton, Sergey Bereg
    The fitting line problem in the laguerre geometry. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:166-169 [Conf]
  4. Sergey Bereg, Ovidiu Daescu, Minghui Jiang
    A PTAS for Cutting Out Polygons with Lines. [Citation Graph (0, 0)][DBLP]
    COCOON, 2006, pp:176-185 [Conf]
  5. Sergey Bereg, Binhai Zhu
    RNA Multiple Structural Alignment with Longest Common Subsequences. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:32-41 [Conf]
  6. Pankaj K. Agarwal, Sergey Bereg, Ovidiu Daescu, Haim Kaplan, Simeon C. Ntafos, Binhai Zhu
    Guarding a terrain by two watchtowers. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:346-355 [Conf]
  7. Sergey Bereg
    Certifying and constructing minimally rigid graphs in the plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:73-80 [Conf]
  8. Sergey Bereg, Adrian Dumitrescu
    The lifting model for reconfiguration. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:55-62 [Conf]
  9. Sergey Bereg, David G. Kirkpatrick
    Curvature-bounded traversals of narrow corridors. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:278-287 [Conf]
  10. Sergey Bereg, Prosenjit Bose, Adrian Dumitrescu, Ferran Hurtado, Pavel Valtr
    Traversing a set of points with a minimum number of turns. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2007, pp:46-55 [Conf]
  11. Sergey Bereg, Hao Wang
    Wiener Indices of Balanced Binary Trees. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2005, pp:851-859 [Conf]
  12. Sergey Bereg
    Equipartitions of Measures by 2-Fans. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:149-158 [Conf]
  13. Minghui Jiang, Sergey Bereg, Zhongping Qin, Binhai Zhu
    New Bounds on Map Labeling with Circular Labels. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:606-617 [Conf]
  14. Sergey Bereg
    Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:29-36 [Conf]
  15. Sergey Bereg, Adrian Dumitrescu, János Pach
    Sliding Disks in the Plane. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:37-47 [Conf]
  16. Sergey Bereg
    Reconstruction of gt-Networks from Gene Trees. [Citation Graph (0, 0)][DBLP]
    METMBS, 2004, pp:336-340 [Conf]
  17. Sergey Bereg, Nikolaus Mutsanas, Alexander Wolff
    Matching Points with Rectangles and Squares. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:177-186 [Conf]
  18. Yih-En Andrew Ban, Sergey Bereg, Nabil H. Mustafa
    A Conjecture on Wiener Indices in Combinatorial Chemistry. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:40, n:2, pp:99-117 [Journal]
  19. Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Alfredo García Olaverri, David Rappaport, Javier Tejel
    Moving coins. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:1, pp:35-48 [Journal]
  20. Sergey Bereg
    Enumerating pseudo-triangulations in the plane. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:3, pp:207-222 [Journal]
  21. Sergey Bereg, Prosenjit Bose, J. David Kirkpatrick
    Equitable subdivisions within polygonal regions. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:1, pp:20-27 [Journal]
  22. Sergey Bereg, Hao Wang
    Wiener indices of balanced binary trees. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:4, pp:457-467 [Journal]
  23. Sergey Bereg
    Equipartitions of Measures by 2-Fans. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:34, n:1, pp:87-96 [Journal]
  24. Sergey Bereg, Adrian Dumitrescu
    The Lifting Model for Reconfiguration. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2006, v:35, n:4, pp:653-669 [Journal]
  25. Sergey Bereg
    Cylindrical hierarchy for deforming necklaces. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2004, v:14, n:1-2, pp:3-17 [Journal]
  26. Sergey Bereg
    An approximate morphing between polylines. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:2, pp:193-208 [Journal]
  27. Sergey Bereg
    Transforming pseudo-triangulations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2004, v:90, n:3, pp:141-145 [Journal]
  28. Sergey Bereg, Andrei Kelarev
    An Algorithm for Analysis of Images in Spatial Information Systems. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2003, v:8, n:4, pp:557-565 [Journal]
  29. Sergey Bereg, Marcin Kubica, Tomasz Walen, Binhai Zhu
    RNA multiple structural alignment with longest common subsequences. [Citation Graph (0, 0)][DBLP]
    J. Comb. Optim., 2007, v:13, n:2, pp:179-188 [Journal]
  30. Sergey Bereg, Binay K. Bhattacharya, David Kirkpatrick, Michael Segal
    Competitive Algorithms for Maintaining a Mobile Center. [Citation Graph (0, 0)][DBLP]
    MONET, 2006, v:11, n:2, pp:177-186 [Journal]
  31. Sergey Bereg, Michael Segal
    Dynamic Algorithms for Approximating Interdistances. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2004, v:11, n:4, pp:344-355 [Journal]
  32. Sergey Bereg, Markus Völker, Alexander Wolff, Yuanyi Zhang
    Straightening Drawings of Clustered Hierarchical Graphs. [Citation Graph (0, 0)][DBLP]
    SOFSEM (1), 2007, pp:176-187 [Conf]
  33. Sergey Bereg, José Miguel Díaz-Báñez, Carlos Seara, Inmaculada Ventura
    On finding widest empty curved corridors. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:38, n:3, pp:154-169 [Journal]
  34. Sergey Bereg, Marina L. Gavrilova, Binhai Zhu
    Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  35. Approximating Barrier Resilience in Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  36. Finding Nearest Larger Neighbors. [Citation Graph (, )][DBLP]


  37. On Some City Guarding Problems. [Citation Graph (, )][DBLP]


  38. Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance. [Citation Graph (, )][DBLP]


  39. Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance. [Citation Graph (, )][DBLP]


  40. Orthogonal Ham-Sandwich Theorem in R3. [Citation Graph (, )][DBLP]


  41. On Covering Problems of Rado. [Citation Graph (, )][DBLP]


  42. On the Red/Blue Spanning Tree Problem. [Citation Graph (, )][DBLP]


  43. Robust Point-Location in Generalized Voronoi Diagrams. [Citation Graph (, )][DBLP]


  44. Recent Developments and Open Problems in Voronoi Diagrams. [Citation Graph (, )][DBLP]


  45. Counting Faces in Split Networks. [Citation Graph (, )][DBLP]


  46. Clustered SplitsNetworks. [Citation Graph (, )][DBLP]


  47. A PTAS for Cutting Out Polygons with Lines. [Citation Graph (, )][DBLP]


  48. Efficient algorithms for the d-dimensional rigidity matroid of sparse graphs. [Citation Graph (, )][DBLP]


  49. Orthogonal equipartitions. [Citation Graph (, )][DBLP]


  50. Matching points with rectangles and squares. [Citation Graph (, )][DBLP]


  51. Compatible geometric matchings. [Citation Graph (, )][DBLP]


  52. Faster Algorithms for Rigidity in the Plane [Citation Graph (, )][DBLP]


  53. Traversing a Set of Points with a Minimum Number of Turns. [Citation Graph (, )][DBLP]


Search in 0.079secs, Finished in 0.082secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002