374 results on '"BEREG, SERGEY"'
Search Results
52. Computing Balanced Convex Partitions of Lines
53. New Algorithms and Bounds for Halving Pseudolines
54. Faster Algorithms for Rigidity in the Plane
55. Compatible Geometric Matchings
56. Voronoi Diagram of Polygonal Chains under the Discrete Fr\'echet Distance
57. On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model
58. New lower bounds for permutation arrays using contraction
59. On the 2-Center Problem Under Convex Polyhedral Distance Function
60. Smallest Maximum-Weight Circle for Weighted Points in the Plane
61. Computing the k-resilience of a synchronized multi-robot system
62. Constructing permutation arrays from groups
63. Edge routing with ordered bundles
64. On the edge crossing properties of Euclidean minimum weight Laman graphs
65. Improved Permutation Arrays for Kendall Tau Metric
66. Monadic Decomposition
67. Computing Balanced Convex Partitions of Lines
68. Extending permutation arrays: improving MOLS bounds
69. On the Edge Crossing Properties of Euclidean Minimum Weight Laman Graphs
70. Small Work Space Algorithms for Some Basic Problems on Binary Images
71. A New Framework for Connected Components Labeling of Binary Images
72. Edge Routing with Ordered Bundles
73. Balanced partitions of 3-colored geometric sets in the plane
74. Approximating Barrier Resilience in Wireless Sensor Networks
75. Finding Nearest Larger Neighbors : A Case Study in Algorithm Design and Analysis
76. On the Red/Blue Spanning Tree Problem
77. Counting Faces in Split Networks
78. Robust Point-Location in Generalized Voronoi Diagrams
79. On Covering Problems of Rado
80. Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
81. On Some City Guarding Problems
82. Transforming Graphs with the Same Degree Sequence
83. Clustered SplitsNetworks
84. Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
85. On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model
86. Straightening Drawings of Clustered Hierarchical Graphs
87. A PTAS for Cutting Out Polygons with Lines
88. Matching Points with Rectangles and Squares
89. Wiener Indices of Balanced Binary Trees
90. Sliding Disks in the Plane
91. Algorithms for the d-Dimensional Rigidity Matroid of Sparse Graphs
92. RNA Multiple Structural Alignment with Longest Common Subsequences
93. New Bounds on Map Labeling with Circular Labels
94. Equipartitions of Measures by 2-Fans
95. On maximum-sum matchings of points
96. Node Overlap Removal by Growing a Tree
97. On the 2-Center Problem Under Convex Polyhedral Distance Function
98. On the red/blue spanning tree problem
99. Colored Non-crossing Euclidean Steiner Forest
100. Smallest Maximum-Weight Circle for Weighted Points in the Plane
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.