default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPhillip Keldenich
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j16]Dominik Michael Krupke
, Ahmad Moradi, Michael Perk, Phillip Keldenich, Gabriel Gehrke, Sebastian Krieter, Thomas Thüm, Sándor P. Fekete:
How Low Can We Go? Minimizing Interaction Samples for Configurable Systems. ACM Trans. Softw. Eng. Methodol. 34(6): 175:1-175:29 (2025)- [c19]Sándor P. Fekete, Phillip Keldenich, Michael Perk:
Exact Algorithms for Minimum Dilation Triangulation. SoCG 2025: 48:1-48:18 - [i21]Dominik Krupke, Ahmad Moradi, Michael Perk, Phillip Keldenich, Gabriel Gehrke, Sebastian Krieter, Thomas Thüm, Sándor P. Fekete:
How Low Can We Go? Minimizing Interaction Samples for Configurable Systems. CoRR abs/2501.06788 (2025) - [i20]Sándor P. Fekete, Phillip Keldenich, Michael Perk:
Exact Algorithms for Minimum Dilation Triangulation. CoRR abs/2502.18189 (2025) - [i19]Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra:
Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025. CoRR abs/2504.04412 (2025) - 2024
- [j15]Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Eike Niehs:
Edge Sparsification for Geometric Tour Problems. Comput. Geom. Topol. 3(1): 1:1-1:23 (2024) - [j14]Sándor P. Fekete, Utkarsh Gupta, Phillip Keldenich, Sahil Shah, Christian Scheffer:
Worst-Case Optimal Covering of Rectangles by Disks. Discret. Comput. Geom. 72(3): 1232-1283 (2024) - [d1]Phillip-Raphaël Keldenich, Michael Perk, Sándor P. Fekete:
Exact Algorithms for Minimum Dilation Triangulation. Zenodo, 2024
- [i18]Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra:
Maximum Polygon Packing: The CG: SHOP Challenge 2024. CoRR abs/2403.16203 (2024) - [i17]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. CoRR abs/2408.09729 (2024) - 2023
- [j13]Sándor P. Fekete, Phillip Keldenich, Ramin Kosfeld, Christian Rieck, Christian Scheffer:
Connected coordinated motion planning with bounded stretch. Auton. Agents Multi Agent Syst. 37(2): 43 (2023) - [j12]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) - [j11]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) - [j10]Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra:
Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022. ACM J. Exp. Algorithmics 28: 1.9:1-1.9:13 (2023) - [i16]Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra:
Minimum Coverage by Convex Polygons: The CG: SHOP Challenge 2023. CoRR abs/2303.07007 (2023) - 2022
- [j9]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) - [j8]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) - [j7]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) - [i15]Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra:
Minimum Partition into Plane Subgraphs: The CG: SHOP Challenge 2022. CoRR abs/2203.07444 (2022) - 2021
- [j6]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) - [j5]Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer:
Worst-case optimal squares packing into disks. J. Comput. Geom. 13(2): 3-29 (2021) - [c18]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 - [c17]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 - [i14]Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer:
Packing Squares into a Disk with Optimal Worst-Case Density. CoRR abs/2103.07258 (2021) - [i13]Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell:
Computing Coordinated Motion Plans for Robot Swarms: The CG: SHOP Challenge 2021. CoRR abs/2103.15381 (2021) - [i12]Sándor P. Fekete, Phillip Keldenich, Ramin Kosfeld, Christian Rieck, Christian Scheffer:
Connected Coordinated Motion Planning with Bounded Stretch. CoRR abs/2109.12381 (2021) - [i11]Sándor P. Fekete, Andreas Haas, Phillip Keldenich, Michael Perk, Arne Schmidt:
Computing Area-Optimal Simple Polygonizations. CoRR abs/2111.05386 (2021) - [i10]Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell:
Area-Optimal Simple Polygonalizations: The CG Challenge 2019. CoRR abs/2111.07304 (2021) - 2020
- [b1]Phillip Keldenich:
Tight worst-case guarantees and approximation algorithms for several classes of geometric optimization problems. Braunschweig University of Technology, Germany, 2020, pp. 1-385 - [j4]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) - [c16]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 - [c15]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 - [c14]Sándor P. Fekete, Phillip Keldenich, Christian Scheffer:
Covering Rectangles by Disks: The Video (Media Exposition). SoCG 2020: 75:1-75:4 - [c13]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 - [p1]Phillip Keldenich:
Approximationsalgorithmen für geometrische Optimierungsprobleme. Ausgezeichnete Informatikdissertationen 2020: 179-188 - [i9]Sándor P. Fekete, Utkarsh Gupta, Phillip Keldenich, Christian Scheffer, Sahil Shah:
Worst-Case Optimal Covering of Rectangles by Disks. CoRR abs/2003.08236 (2020) - [i8]Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Joseph S. B. Mitchell:
Computing Convex Partitions for Point Sets in the Plane: The CG: SHOP Challenge 2020. CoRR abs/2004.04207 (2020)
2010 – 2019
- 2019
- [j3]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) - [c12]Sándor P. Fekete, Phillip Keldenich, Christian Scheffer:
Packing Disks into Disks with Optimal Worst-Case Density. SoCG 2019: 35:1-35:19 - [c11]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 - [c10]Sándor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich, Arne Schmidt:
Parallel Online Algorithms for the Bin Packing Problem. WAOA 2019: 106-119 - [i7]Sándor P. Fekete, Phillip Keldenich, Christian Scheffer:
Packing Disks into Disks with Optimal Worst-Case Density. CoRR abs/1903.07908 (2019) - [i6]Sándor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich, Arne Schmidt:
Parallel Online Algorithms for the Bin Packing Problem. CoRR abs/1910.03249 (2019) - 2018
- [j2]Sándor P. Fekete, Phillip Keldenich:
Conflict-Free Coloring of Intersection Graphs. Int. J. Comput. Geom. Appl. 28(3): 289-307 (2018) - [j1]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) - [c9]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 - [c8]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 - [c7]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 - [c6]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 - [c5]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 - [i5]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. CoRR abs/1801.01689 (2018) - [i4]Sándor P. Fekete, Robert Gmyr, Sabrina Hugo, Phillip Keldenich, Christian Scheffer, Arne Schmidt:
CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata. CoRR abs/1810.06360 (2018) - 2017
- [c4]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 - [c3]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 - [c2]Sándor P. Fekete, Phillip Keldenich:
Conflict-Free Coloring of Intersection Graphs. ISAAC 2017: 31:1-31:12 - [c1]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 - [i3]Zachary Abel, Victor Alvarez, Aman Gour, Adam Hesterberg, Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Christian Scheffer:
Three Colors Suffice: Conflict-Free Coloring of Planar Graphs. CoRR abs/1701.05999 (2017) - [i2]Sándor P. Fekete, Phillip Keldenich:
Conflict-Free Coloring of Intersection Graphs. CoRR abs/1709.03876 (2017) - [i1]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. CoRR abs/1709.06299 (2017)
Coauthor Index
aka: Dominik Michael Krupke
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-10-22 03:43 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
