IBR Login
- Institute of Operating Systems and Computer Networks
- News
- About us
- Connected and Mobile Systems
- Distributed Systems
- Algorithms
- Microprocessor Lab
- Education
- Services
- Spin-Offs
- Research Cooperations
Contact
Dr. Phillip Keldenich
Wissenschaftlicher Mitarbeiter
Technische Universität Braunschweig
Institute of Operating Systems and Computer Networks
Mühlenpfordtstraße 23, 3rd floor
38106 Braunschweig
Room 317
+49 531 3913112
+49 531 3913109
keldenich[[at]]ibr.cs.tu-bs.de
Institute of Operating Systems and Computer Networks
Mühlenpfordtstraße 23, 3rd floor
38106 Braunschweig
Room 317
+49 531 3913112
+49 531 3913109
keldenich[[at]]ibr.cs.tu-bs.de
Dissertation
My doctoral thesis with the title Tight worst-case guarantees and approximation algorithms for several classes of geometric optimization problems won the Heinrich-Büssing-Preis for the best doctoral thesis of the TU Braunschweig in 2020. I was also nominated for the GI Dissertationspreis 2020 (of the german Gesellschaft für Informatik), which resulted in the inclusion of my dissertation in the yearbook Ausgezeichnete Informatikdissertationen 2020 published by the GI.
Publications
I try my best to keep the lists below up to date; for automatically updated information you can also refer to DBLP and Google Scholar.
The lists below contain only peer-reviewed publications; for other publications, refer to the DBLP.
Peer-Reviewed Journals
- Sándor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich, Arne Schmidt:
Parallel Online Algorithms for the Bin Packing Problem.
Algorithmica 85(1): 296-323 (2023). - Sándor P. Fekete, Phillip Keldenich, Christian Scheffer:
Packing Disks into Disks with Optimal Worst-Case Density.
Discret. Comput. Geom. 69(1): 51-90 (2023). - Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell:
Area-Optimal Simple Polygonalizations: The CG Challenge 2019.
ACM J. Exp. Algorithmics 27: 2.4:1-2.4:12 (2022). - Sándor P. Fekete, Andreas Haas, Phillip Keldenich, Michael Perk, Arne Schmidt:
Computing Area-Optimal Simple Polygonizations.
ACM J. Exp. Algorithmics 27: 2.6:1-2.6:23 (2022). - Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell:
Computing Coordinated Motion Plans for Robot Swarms: The CG: SHOP Challenge 2021.
ACM J. Exp. Algorithmics 27: 3.1:1-3.1:12 (2022). - Sándor P. Fekete, Robert Gmyr, Sabrina Hugo, Phillip Keldenich, Christian Scheffer, Arne Schmidt:
CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata.
Algorithmica 83(1): 387-412 (2021). - Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer:
Worst-Case Optimal Squares Packing into Disks.
J. Comput. Geom. 12(2): 149-175 (2021). - Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Christian Rieck, Christian Scheffer, Arne Schmidt:
Tilt Assembly: Algorithms for Micro-factories That Build Objects with Uniform External Forces.
Algorithmica 82(2): 165-187 (2020). - Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Henk Meijer, Christian Scheffer:
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch.
SIAM J. Comput. 48(6): 1727-1762 (2019). - Sándor P. Fekete, Phillip Keldenich:
Conflict-Free Coloring of Intersection Graphs.
Int. J. Comput. Geom. Appl. 28(3): 289-307 (2018). - Zachary Abel, Victor Alvarez, Erik D. Demaine, Sándor P. Fekete, Aman Gour, Adam Hesterberg, Phillip Keldenich, Christian Scheffer:
Conflict-Free Coloring of Graphs.
SIAM J. Discret. Math. 32(4): 2675-2702 (2018).
Peer-Reviewed Conferences
- Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer:
Packing Squares into a Disk with Optimal Worst-Case Density.
SoCG 2021: 36:1-36:16. - Sándor P. Fekete, Phillip Keldenich, Ramin Kosfeld, Christian Rieck, Christian Scheffer:
Connected Coordinated Motion Planning with Bounded Stretch.
ISAAC 2021: 9:1-9:16. - Sándor P. Fekete, Utkarsh Gupta, Phillip Keldenich, Christian Scheffer, Sahil Shah:
Worst-Case Optimal Covering of Rectangles by Disks.
SoCG 2020: 42:1-42:23. - 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:
Space Ants: Constructing and Reconfiguring Large-Scale Structures with Finite Automata (Media Exposition).
SoCG 2020: 73:1-73:6. - Sándor P. Fekete, Phillip Keldenich, Christian Scheffer:
Covering Rectangles by Disks: The Video (Media Exposition).
SoCG 2020: 75:1-75:4. - Aaron T. Becker, Sándor P. Fekete, Li Huang, Phillip Keldenich, Linda Kleist, Dominik Krupke, Christian Rieck, Arne Schmidt:
Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform, External Forces.
ICRA 2020: 2508-2514. - Sándor P. Fekete, Phillip Keldenich, Christian Scheffer:
Packing Disks into Disks with Optimal Worst-Case Density.
SoCG 2019: 35:1-35:19. - Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Sebastian Morr, Christian Scheffer:
Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition).
SoCG 2019: 63:1-63:6. - Sándor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich, Arne Schmidt:
Parallel Online Algorithms for the Bin Packing Problem.
WAOA 2019: 106-119. - Alexander Dörflinger, Mark Albers, Johannes Schlatow, Björn Fiethe, Harald Michalik, Phillip Keldenich, Sándor P. Fekete:
Hardware and Software Task Scheduling for ARM-FPGA Platforms.
AHS 2018: 66-73. - Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Christian Scheffer, Henk Meijer:
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch.
SoCG 2018: 29:1-29:15. - Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Matthias Konitzny, Lillian Lin, Christian Scheffer:
Coordinated Motion Planning: The Video (Multimedia Exposition).
SoCG 2018: 74:1-74:6. - Phillip Keldenich, Sheryl Manzoor, Li Huang, Dominik Krupke, Arne Schmidt, Sándor P. Fekete, Aaron T. Becker:
On Designing 2D Discrete Workspaces to Sort or Classify Polynminoes.
IROS 2018: 1-9. - Sándor P. Fekete, Robert Gmyr, Sabrina Hugo, Phillip Keldenich, Christian Scheffer, Arne Schmidt:
CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata.
WAFR 2018: 727-743. - Alexander Dörflinger, Björn Fiethe, Harald Michalik, Sándor P. Fekete, Phillip Keldenich, Christian Scheffer:
Resource-efficient dynamic partial reconfiguration on FPGAs for space instruments.
AHS 2017: 24-31. - Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Christian Rieck, Christian Scheffer, Arne Schmidt:
Tilt Assembly: Algorithms for Micro-Factories that Build Objects with Uniform External Forces.
ISAAC 2017: 11:1-11:13. - Sándor P. Fekete, Phillip Keldenich:
Conflict-Free Coloring of Intersection Graphs.
ISAAC 2017: 31:1-31:12. - Zachary Abel, Victor Alvarez, Erik D. Demaine, Sándor P. Fekete, Aman Gour, Adam Hesterberg, Phillip Keldenich, Christian Scheffer:
Three Colors Suffice: Conflict-Free Coloring of Planar Graphs.
SODA 2017: 1951-1963.
last changed 2023-07-31, 16:43 by Dr. Phillip Keldenich