E-LIB Suche - Ergebnisse für: Keldenich, Phillip

1

Minimum Partition into Plane Subgraphs: The CG:SHOP Challen..:

Fekete, Sándor P. ; Keldenich, Phillip ; Krupke, Dominik.
ACM Journal of Experimental Algorithmics. 28 (2023) - p. 1-13 , 2023

Link: https://doi.org/10.1145/..

2

Connected coordinated motion planning with bounded stretch:

Fekete, Sándor P. ; Keldenich, Phillip ; Kosfeld, Ramin..
Autonomous Agents and Multi-Agent Systems. 37 (2023) 2 - p. , 2023

Link: https://doi.org/10.1007/..

3

Worst-Case Optimal Covering of Rectangles by Disks:

Fekete, Sándor P. ; Gupta, Utkarsh ; Keldenich, Phillip..
Discrete & Computational Geometry. , 2023

Link: https://doi.org/10.1007/..

4

Minimum Coverage by Convex Polygons: The CG:SHOP Challenge ..:

Fekete, Sándor P ; Keldenich, Phillip ; Krupke, Dominik.
http://arxiv.org/abs/2303.07007. , 2023

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

5

Computing Coordinated Motion Plans for Robot Swarms: The CG..:

Fekete, Sándor P. ; Keldenich, Phillip ; Krupke, Dominik.
ACM Journal of Experimental Algorithmics. 27 (2022) - p. 1-12 , 2022

Link: https://doi.org/10.1145/..

6

Area-Optimal Simple Polygonalizations: The CG Challenge 201:

Demaine, Erik D. ; Fekete, Sándor P. ; Keldenich, Phillip..
ACM Journal of Experimental Algorithmics. 27 (2022) - p. 1-12 , 2022

Link: https://doi.org/10.1145/..

7

Parallel Online Algorithms for the Bin Packing Problem:

Fekete, Sándor P. ; Grosse-Holz, Jonas ; Keldenich, Phillip.
Algorithmica. 85 (2022) 1 - p. 296-323 , 2022

Link: https://doi.org/10.1007/..

8

Computing Area-Optimal Simple Polygonizations:

Fekete, Sándor P. ; Haas, Andreas ; Keldenich, Phillip..
ACM Journal of Experimental Algorithmics. 27 (2022) - p. 1-23 , 2022

Link: https://doi.org/10.1145/..

9

Packing Disks into Disks with Optimal Worst-Case Density:

Fekete, Sándor P. ; Keldenich, Phillip ; Scheffer, Christian
Discrete & Computational Geometry. 69 (2022) 1 - p. 51-90 , 2022

Link: https://doi.org/10.1007/..

10

Area-Optimal Simple Polygonalizations: The CG Challenge 201:

Demaine, Erik D. ; Fekete, Sándor P. ; Keldenich, Phillip..
Journal of Experimental Algorithmics (JEA). 27 (2022) 27 - p. 1-12 , 2022

Link: https://dl.acm.org/doi/1..

11

Worst-case optimal squares packing into disks:

Fekete, Sándor P ; Gurunathan, Vijaykrishna ; Juneja, Kushagra...
https://jocg.org/index.php/jocg/article/view/3719/3102. , 2022

Link: https://jocg.org/index.p..

12

Minimum Partition into Plane Subgraphs: The CG:SHOP Challen..:

Fekete, Sándor P ; Keldenich, Phillip ; Krupke, Dominik.
http://arxiv.org/abs/2203.07444. , 2022

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

13

Worst-case optimal squares packing into disks:

Fekete, Sándor P ; Gurunathan, Vijaykrishna ; Juneja, Kushagra...
https://jocg.org/index.php/jocg/article/view/3719/3102. , 2022

Link: https://jocg.org/index.p..

14

Area-Optimal Simple Polygonalizations: The CG Challenge 201:

Demaine, Erik ; Fekete, S?ndor ; Keldenich, Phillip..
https://doi.org/10.1145/3504000. , 2022

Link: https://hdl.handle.net/1..

15

Connected Coordinated Motion Planning with Bounded Stretch:

Fekete, Sándor P ; Keldenich, Phillip ; Kosfeld, Ramin..
http://arxiv.org/abs/2109.12381. , 2021

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