Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Smid, Michiel
331  Ergebnisse:
Personensuche X
?
1

Improved Routing on the Delaunay Triangulation:

Bonichon, Nicolas ; Bose, Prosenjit ; De Carufel, Jean-Lou...
Discrete & Computational Geometry.  70 (2023)  3 - p. 495-549 , 2023
Link: https://doi.org/10.1007/..
 
?
2

The Minimum Moving Spanning Tree Problem:

Akitaya, Hugo A. ; Biniaz, Ahmad ; Bose, Prosenjit...
Journal of Graph Algorithms and Applications.  27 (2023)  1 - p. 1-18 , 2023
Link: https://doi.org/10.7155/..
 
?
3

On the Spanning and Routing Ratio of the Directed Theta-Fou..:

Bose, Prosenjit ; De Carufel, Jean-Lou ; Hill, Darryl.
Discrete & Computational Geometry.  71 (2023)  3 - p. 872-892 , 2023
Link: https://doi.org/10.1007/..
 
?
4

Shortest Beer Path Queries in Outerplanar Graphs:

Bacic, Joyce ; Mehrabi, Saeed ; Smid, Michiel
Algorithmica.  85 (2022)  6 - p. 1679-1705 , 2022
Link: https://doi.org/10.1007/..
 
?
5

Computing maximum independent set on outerstring graphs and..:

Bose, Prosenjit ; Carmi, Paz ; Keil, J. Mark...
Computational Geometry.  103 (2022)  - p. 101852 , 2022
Link: https://doi.org/10.1016/..
 
?
6

Closest-pair queries and minimum-weight queries are equival..:

Kazi, Abrar ; Smid, Michiel
Computational Geometry.  100 (2022)  - p. 101810 , 2022
Link: https://doi.org/10.1016/..
 
?
7

On the Minimum Consistent Subset Problem:

Biniaz, Ahmad ; Cabello, Sergio ; Carmi, Paz...
Algorithmica.  83 (2021)  7 - p. 2273-2302 , 2021
Link: https://doi.org/10.1007/..
 
?
8

The Minimum Moving Spanning Tree Problem:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,
Akitaya, Hugo A. ; Biniaz, Ahmad ; Bose, Prosenjit... - p. 15-28 , 2021
Link: https://doi.org/10.1007/..
 
?
9

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
Link: https://doi.org/10.1007/..
 
?
10

An improved construction for spanners of disks:

Smid, Michiel
Computational Geometry.  92 (2021)  - p. 101682 , 2021
Link: https://doi.org/10.1016/..
 
?
11

Window queries for intersecting objects, maximal points and..:

Chanchary, Farah ; Maheshwari, Anil ; Smid, Michiel
Discrete Applied Mathematics.  305 (2021)  - p. 295-310 , 2021
Link: https://doi.org/10.1016/..
 
?
12

Approximating Maximum Diameter-Bounded Subgraph in Unit Dis..:

Abu-Affash, A. Karim ; Carmi, Paz ; Maheshwari, Anil...
Discrete & Computational Geometry.  66 (2021)  4 - p. 1401-1414 , 2021
Link: https://doi.org/10.1007/..
 
?
13

Minimizing the continuous diameter when augmenting a geomet..:

De Carufel, Jean-Lou ; Grimm, Carsten ; Maheshwari, Anil..
Computational Geometry.  89 (2020)  - p. 101631 , 2020
Link: https://doi.org/10.1016/..
 
?
14

Querying relational event graphs using colored range search..:

Chanchary, Farah ; Maheshwari, Anil ; Smid, Michiel
Discrete Applied Mathematics.  286 (2020)  - p. 51-61 , 2020
Link: https://doi.org/10.1016/..
 
?
15

Optimal Art Gallery Localization is NP-hard:

Bose, Prosenjit ; De Carufel, Jean-Lou ; Shaikhet, Alina.
Computational Geometry.  88 (2020)  - p. 101607 , 2020
Link: https://doi.org/10.1016/..
 
1-15