Smid, Michiel
26  Ergebnisse:
Personensuche X
?
1

The Minimum Moving Spanning Tree Problem:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,
 
?
2

Euclidean Maximum Matchings in the Plane—Local to Global:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,
Biniaz, Ahmad ; Maheshwari, Anil ; Smid, Michiel - p. 186-199 , 2021
 
?
3

On the Minimum Consistent Subset Problem:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,
Biniaz, Ahmad ; Cabello, Sergio ; Carmi, Paz... - p. 155-167 , 2019
 
?
4

Computing Maximum Independent Set on Outerstring Graphs and..:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,
Bose, Prosenjit ; Carmi, Paz ; Keil, Mark J.... - p. 211-224 , 2019
 
?
5

On the spanning and routing ratio of theta-four:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,
 
?
6

Orthogonal Range Reporting and Rectangle Stabbing for Fat R..:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,
 
?
7

Robust geometric spanners:

, In: Proceedings of the twenty-ninth annual symposium on Computational geometry,
Bose, Prosenjit ; Dujmović, Vida ; Morin, Pat. - p. 449-458 , 2013
 
?
11

Approximate distance oracles for geometric graphs:

, In: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms,
 
?
12

Closest-Point Problems in Computational Geometry:

, In: Handbook of Computational Geometry,
Smid, Michiel - p. 877-935 , 2000
 
?
13

Multi-criteria geometric optimization problems in layered m..:

, In: Proceedings of the fourteenth annual symposium on Computational geometry,
 
?
14

Efficient algorithms for constructing fault-tolerant geomet..:

, In: Proceedings of the thirtieth annual ACM symposium on Theory of computing,
 
?
15

Computing the minimum diameter for moving points : an ex..:

, In: Proceedings of the thirteenth annual symposium on Computational geometry,
 
1-15