Phillip Keldenich

Orcid: 0000-0002-6677-5090

According to our database1, Phillip Keldenich authored at least 31 papers between 2017 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Maximum Polygon Packing: The CG: SHOP Challenge 2024.
CoRR, 2024

Edge Sparsification for Geometric Tour Problems.
Comput. Geom. Topol., 2024

2023
Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022.
ACM J. Exp. Algorithmics, December, 2023

Connected coordinated motion planning with bounded stretch.
Auton. Agents Multi Agent Syst., October, 2023

Packing Disks into Disks with Optimal Worst-Case Density.
Discret. Comput. Geom., 2023

Minimum Coverage by Convex Polygons: The CG: SHOP Challenge 2023.
CoRR, 2023

Parallel Online Algorithms for the Bin Packing Problem.
Algorithmica, 2023

2022
Computing Coordinated Motion Plans for Robot Swarms: The CG: SHOP Challenge 2021.
ACM J. Exp. Algorithmics, 2022

Computing Area-Optimal Simple Polygonizations.
ACM J. Exp. Algorithmics, 2022

Area-Optimal Simple Polygonalizations: The CG Challenge 2019.
ACM J. Exp. Algorithmics, 2022

Minimum Partition into Plane Subgraphs: The CG: SHOP Challenge 2022.
CoRR, 2022

2021
Worst-Case Optimal Squares Packing into Disks.
J. Comput. Geom., 2021

CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata.
Algorithmica, 2021

Packing Squares into a Disk with Optimal Worst-Case Density.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
Approximationsalgorithmen für geometrische Optimierungsprobleme.
Proceedings of the Ausgezeichnete Informatikdissertationen 2020., 2020

Tight worst-case guarantees and approximation algorithms for several classes of geometric optimization problems.
PhD thesis, 2020

Computing Convex Partitions for Point Sets in the Plane: The CG: SHOP Challenge 2020.
CoRR, 2020

Tilt Assembly: Algorithms for Micro-factories That Build Objects with Uniform External Forces.
Algorithmica, 2020

Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform, External Forces.
Proceedings of the 2020 IEEE International Conference on Robotics and Automation, 2020

Covering Rectangles by Disks: The Video (Media Exposition).
Proceedings of the 36th International Symposium on Computational Geometry, 2020

Worst-Case Optimal Covering of Rectangles by Disks.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

Space Ants: Constructing and Reconfiguring Large-Scale Structures with Finite Automata (Media Exposition).
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch.
SIAM J. Comput., 2019

Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition).
Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018
Conflict-Free Coloring of Graphs.
SIAM J. Discret. Math., 2018

Conflict-Free Coloring of Intersection Graphs.
Int. J. Comput. Geom. Appl., 2018

On Designing 2D Discrete Workspaces to Sort or Classify Polynminoes.
Proceedings of the 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2018

Coordinated Motion Planning: The Video (Multimedia Exposition).
Proceedings of the 34th International Symposium on Computational Geometry, 2018

Hardware and Software Task Scheduling for ARM-FPGA Platforms.
Proceedings of the 2018 NASA/ESA Conference on Adaptive Hardware and Systems, 2018

2017
Three Colors Suffice: Conflict-Free Coloring of Planar Graphs.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Resource-efficient dynamic partial reconfiguration on FPGAs for space instruments.
Proceedings of the 2017 NASA/ESA Conference on Adaptive Hardware and Systems, 2017


  Loading...