E-LIB Suche - Ergebnisse für: Smid, Michiel

1

Geometric Covering via Extraction Theorem:

Bandyapadhyay, Sayan ; Maheshwari, Anil ; Roy, Sasanka..
Is Part Of LIPIcs, Volume 287, 15th Innovations in Theoretical Computer Science Conference (ITCS 2024). , 2024

Link: https://doi.org/10.4230/..

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

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/..

4

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/..

5

On Separating Path and Tree Systems in Graphs:

Biniaz, Ahmad ; Bose, Prosenjit ; De Carufel, Jean-Lou...
http://arxiv.org/abs/2312.14295. , 2023

Link: http://arxiv.org/abs/231..

6

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/..

7

The growth‐survival trade‐off is hard‐wired in the Lactococ..:

Ercan, Onur ; den Besten, Heidy M. W. ; Smid, Eddy J..
Environmental Microbiology Reports. 14 (2022) 4 - p. 632-636 , 2022

Link: https://doi.org/10.1111/..

8

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/..

9

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/..

10

The growth-survival trade-off is hard-wired in the Lactococ..:

Ercan, Onur ; den Besten, Heidy M.W ; Smid, Eddy J.
https://edepot.wur.nl/569129. , 2022

Link: https://research.wur.nl/..

11

An improved construction for spanners of disks:

Smid, Michiel
Computational Geometry. 92 (2021) - p. 101682 , 2021

Link: https://doi.org/10.1016/..

12

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/..

13

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/..

14

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/..

15

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/..