Ich stimme zu, dass diese Seite Cookies verwende. Weitere Informationen finden Sie unter unseren Datenschutzerklärungen .
X
Keldenich, Phillip
53  Ergebnisse:
Personensuche X
?
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

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

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

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

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

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

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

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..
 
?
10

Parallel Online Algorithms for the Bin Packing Problem:

, In: Approximation and Online Algorithms; Lecture Notes in Computer Science,
Fekete, Sándor P. ; Grosse-Holz, Jonas ; Keldenich, Phillip. - p. 106-119 , 2020
Link: https://doi.org/10.1007/..
 
?
11

CADbots: Algorithmic Aspects of Manipulating Programmable M..:

Fekete, Sándor P. ; Gmyr, Robert ; Hugo, Sabrina...
Algorithmica.  83 (2020)  1 - p. 387-412 , 2020
Link: https://doi.org/10.1007/..
 
?
12

CADbots: Algorithmic Aspects of Manipulating Programmable M..:

, In: Springer Proceedings in Advanced Robotics; Algorithmic Foundations of Robotics XIII,
Fekete, Sándor P. ; Gmyr, Robert ; Hugo, Sabrina... - p. 727-743 , 2020
Link: https://doi.org/10.1007/..
 
?
13

Targeted Drug Delivery: Algorithmic Methods for Collecting ..:

, In: 2020 IEEE International Conference on Robotics and Automation (ICRA),
Becker, Aaron T. ; Fekete, Sandor P. ; Huang, Li... - p. 2508-2514 , 2020
Link: https://doi.org/10.1109/..
 
?
14

Coordinated Motion Planning: Reconfiguring a Swarm of Label..:

Demaine, Erik D. ; Fekete, Sándor P. ; Keldenich, Phillip..
SIAM Journal on Computing.  48 (2019)  6 - p. 1727-1762 , 2019
Link: https://doi.org/10.1137/..
 
?
15

Conflict-Free Coloring of Graphs:

Abel, Zachary ; Alvarez, Victor ; Demaine, Erik D....
SIAM Journal on Discrete Mathematics.  32 (2018)  4 - p. 2675-2702 , 2018
Link: https://doi.org/10.1137/..
 
1-15