( en | de | ru )

 

Disambiguation of "Bereg, Sergey"

Author of the publication

copydeleteadd this publication to your clipboard
Straightening Drawings of Clustered Hierarchical Graphs

, , , and . Proc. 33rd Int. Conf. Current Trends Theory & Practice Comput. Sci. (SOFSEM'07), volume 4362 of Lecture Notes in Computer Science, page 177--186. Springer-Verlag, (2007)
DOI: 10.1007/978-3-540-69507-3_14

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Sergey Libert

Sergey Stepanov

Sergey Gorbunov

Sergey Groppa

Sergey Leontyev

 

Other publications of authors with the same name

On Maximum-Sum Matchings of Points., , , , , and . CoRR, (2019)Preface., and . Theor. Comput. Sci., (2018)On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model., , , , and . CoRR, (2018)A New Framework for Connected Components Labeling of Binary Images., and . IWCIA, volume 7655 of Lecture Notes in Computer Science, page 90-102. Springer, (2012)A PTAS for Cutting Out Polygons with Lines., , and . COCOON, volume 4112 of Lecture Notes in Computer Science, page 176-185. Springer, (2006)On the Red/Blue Spanning Tree Problem., , , and . TAMC, volume 5532 of Lecture Notes in Computer Science, page 118-127. Springer, (2009)Transforming Graphs with the Same Degree Sequence., and . KyotoCGGT, volume 4535 of Lecture Notes in Computer Science, page 25-32. Springer, (2007)Finding Nearest Larger Neighbors., , and . Efficient Algorithms, volume 5760 of Lecture Notes in Computer Science, page 249-260. Springer, (2009)Computing Balanced Convex Partitions of Lines.. Algorithmica, 85 (8): 2515-2528 (August 2023)On the coarseness of bicolored point sets., , , , , and . Comput. Geom., 46 (1): 65-77 (2013)