Phillip Keldenich

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.

2025

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

Dominik Michael Krupke, Ahmad Moradi, Michael Perk, Phillip Keldenich, Gabriel Gehrke, Sebastian Krieter, Thomas Thüm, Sándor P. Fekete

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

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

Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra

CoRR, April, 2025

Exact Algorithms for Minimum Dilation Triangulation.

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.

Phillip-Raphaël Keldenich, Michael Perk, Sándor P. Fekete

Dataset, December, 2024

Maximum Polygon Packing: The CG: SHOP Challenge 2024.

Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra

CoRR, 2024

Edge Sparsification for Geometric Tour Problems.

Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Eike Niehs

Comput. Geom. Topol., 2024

2023

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

Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra

ACM J. Exp. Algorithmics, December, 2023

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

Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra

CoRR, 2023

2022

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

Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell

ACM J. Exp. Algorithmics, 2022

Computing Area-Optimal Simple Polygonizations.

Sándor P. Fekete, Andreas Haas, Phillip Keldenich, Michael Perk, Arne Schmidt

ACM J. Exp. Algorithmics, 2022

Area-Optimal Simple Polygonalizations: The CG Challenge 2019.

Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell

ACM J. Exp. Algorithmics, 2022

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

Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra

CoRR, 2022

2021

Worst-case optimal squares packing into disks.

Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer

J. Comput. Geom., 2021

Connected Coordinated Motion Planning with Bounded Stretch.

Sándor P. Fekete, Phillip Keldenich, Ramin Kosfeld, Christian Rieck, Christian Scheffer

Proceedings of the 32nd International Symposium on Algorithms and Computation, 2021

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

Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer

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

2020

Approximationsalgorithmen für geometrische Optimierungsprobleme.

Phillip Keldenich

Proceedings of the Ausgezeichnete Informatikdissertationen 2020., 2020

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

Phillip Keldenich

PhD thesis, 2020

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

Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell

CoRR, 2020

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

Aaron T. Becker, Sándor P. Fekete, Li Huang, Phillip Keldenich, Linda Kleist, Dominik Krupke, Christian Rieck, Arne Schmidt

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

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

Sándor P. Fekete, Phillip Keldenich, Christian Scheffer

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

Worst-Case Optimal Covering of Rectangles by Disks.

Sándor P. Fekete, Utkarsh Gupta, Phillip Keldenich, Christian Scheffer, Sahil Shah

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

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

Amira Abdel-Rahman, Aaron T. Becker, Daniel Biediger, Kenneth C. Cheung, Sándor P. Fekete, Neil A. Gershenfeld, Sabrina Hugo, Benjamin Jenett, Phillip Keldenich, Eike Niehs, Christian Rieck, Arne Schmidt, Christian Scheffer, Michael Yannuzzi

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

2019

Parallel Online Algorithms for the Bin Packing Problem.

Sándor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich, Arne Schmidt

Proceedings of the Approximation and Online Algorithms - 17th International Workshop, 2019

Packing Disks into Disks with Optimal Worst-Case Density.

Sándor P. Fekete, Phillip Keldenich, Christian Scheffer

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

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

Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Sebastian Morr, Christian Scheffer

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

2018

Conflict-Free Coloring of Graphs.

Zachary Abel, Victor Alvarez, Erik D. Demaine, Sándor P. Fekete, Aman Gour, Adam Hesterberg, Phillip Keldenich, Christian Scheffer

SIAM J. Discret. Math., 2018

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

Sándor P. Fekete, Robert Gmyr, Sabrina Hugo, Phillip Keldenich, Christian Scheffer, Arne Schmidt

Proceedings of the Algorithmic Foundations of Robotics XIII, 2018

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

Phillip Keldenich, Sheryl Manzoor, Li Huang, Dominik Krupke, Arne Schmidt, Sándor P. Fekete, Aaron T. Becker

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

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

Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Christian Scheffer, Henk Meijer

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

Coordinated Motion Planning: The Video (Multimedia Exposition).

Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Matthias Konitzny, Lillian Lin, Christian Scheffer

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

Hardware and Software Task Scheduling for ARM-FPGA Platforms.

Alexander Dörflinger, Mark Albers, Johannes Schlatow, Björn Fiethe, Harald Michalik, Phillip Keldenich, Sándor P. Fekete

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

2017

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

Zachary Abel, Victor Alvarez, Erik D. Demaine, Sándor P. Fekete, Aman Gour, Adam Hesterberg, Phillip Keldenich, Christian Scheffer

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

Conflict-Free Coloring of Intersection Graphs.

Sándor P. Fekete, Phillip Keldenich

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

Tilt Assembly: Algorithms for Micro-Factories that Build Objects with Uniform External Forces.

Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Christian Rieck, Christian Scheffer, Arne Schmidt

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

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

Alexander Dörflinger, Björn Fiethe, Harald Michalik, Sándor P. Fekete, Phillip Keldenich, Christian Scheffer

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