Phillip Keldenich

Orcid: 0000-0002-6677-5090

According to our database¹, Phillip Keldenich authored at least 35 papers between 2017 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2025

How Low Can We Go? Minimizing Interaction Samples for Configurable Systems.

[BibT_eX]

[DOI]

Dominik Michael Krupke

ACM Trans. Softw. Eng. Methodol., July, 2025

Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025.

[BibT_eX]

[DOI]

CoRR, April, 2025

Exact Algorithms for Minimum Dilation Triangulation.

[BibT_eX]

[DOI]

Sándor P. Fekete

Phillip Keldenich

Michael Perk

Proceedings of the 41st International Symposium on Computational Geometry, 2025

2024

Exact Algorithms for Minimum Dilation Triangulation.

[BibT_eX]

[DOI]

Phillip-Raphaël Keldenich

Michael Perk

Sándor P. Fekete

Dataset, December, 2024

Worst-Case Optimal Covering of Rectangles by Disks.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2024

Maximum Polygon Packing: The CG: SHOP Challenge 2024.

[BibT_eX]

[DOI]

CoRR, 2024

Edge Sparsification for Geometric Tour Problems.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2024

2023

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

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, December, 2023

Connected coordinated motion planning with bounded stretch.

[BibT_eX]

[DOI]

Auton. Agents Multi Agent Syst., October, 2023

Packing Disks into Disks with Optimal Worst-Case Density.

[BibT_eX]

[DOI]

Sándor P. Fekete

Phillip Keldenich

Christian Scheffer

Discret. Comput. Geom., 2023

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

[BibT_eX]

[DOI]

CoRR, 2023

Parallel Online Algorithms for the Bin Packing Problem.

[BibT_eX]

[DOI]

Algorithmica, 2023

2022

Computing Coordinated Motion Plans for Robot Swarms: The CG: SHOP Challenge 2021.

[BibT_eX]

[DOI]

Sándor P. Fekete

Phillip Keldenich

Dominik Krupke

Joseph S. B. Mitchell

ACM J. Exp. Algorithmics, 2022

Computing Area-Optimal Simple Polygonizations.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2022

Area-Optimal Simple Polygonalizations: The CG Challenge 2019.

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

ACM J. Exp. Algorithmics, 2022

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

[BibT_eX]

[DOI]

CoRR, 2022

2021

Worst-case optimal squares packing into disks.

[BibT_eX]

[DOI]

Sándor P. Fekete

Vijaykrishna Gurunathan

J. Comput. Geom., 2021

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

[BibT_eX]

[DOI]

Algorithmica, 2021

Packing Squares into a Disk with Optimal Worst-Case Density.

[BibT_eX]

[DOI]

Sándor P. Fekete

Vijaykrishna Gurunathan

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Approximationsalgorithmen für geometrische Optimierungsprobleme.

[BibT_eX]

[DOI]

Phillip Keldenich

Proceedings of the Ausgezeichnete Informatikdissertationen 2020., 2020

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

[BibT_eX]

[DOI]

Phillip Keldenich

PhD thesis, 2020

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

[BibT_eX]

[DOI]

Joseph S. B. Mitchell

CoRR, 2020

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

[BibT_eX]

[DOI]

Algorithmica, 2020

Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform, External Forces.

[BibT_eX]

[DOI]

Proceedings of the 2020 IEEE International Conference on Robotics and Automation, 2020

Covering Rectangles by Disks: The Video (Media Exposition).

[BibT_eX]

[DOI]

Sándor P. Fekete

Phillip Keldenich

Christian Scheffer

Proceedings of the 36th International Symposium on Computational Geometry, 2020

Space Ants: Constructing and Reconfiguring Large-Scale Structures with Finite Automata (Media Exposition).

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019

Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch.

[BibT_eX]

[DOI]

SIAM J. Comput., 2019

Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition).

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

Conflict-Free Coloring of Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2018

Conflict-Free Coloring of Intersection Graphs.

[BibT_eX]

[DOI]

Sándor P. Fekete

Phillip Keldenich

Int. J. Comput. Geom. Appl., 2018

On Designing 2D Discrete Workspaces to Sort or Classify Polynminoes.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2018

Coordinated Motion Planning: The Video (Multimedia Exposition).

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

Hardware and Software Task Scheduling for ARM-FPGA Platforms.

[BibT_eX]

[DOI]

Proceedings of the 2018 NASA/ESA Conference on Adaptive Hardware and Systems, 2018

2017

Three Colors Suffice: Conflict-Free Coloring of Planar Graphs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Resource-efficient dynamic partial reconfiguration on FPGAs for space instruments.

[BibT_eX]

[DOI]

Proceedings of the 2017 NASA/ESA Conference on Adaptive Hardware and Systems, 2017

Phillip Keldenich

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...