default search action
Dominik Krupke
Person information
- affiliation (PhD 2022): Braunschweig University of Technology, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j10]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) - [j9]Sándor P. Fekete, Dominik Krupke:
What Goes Around Comes Around: Covering Tours and Cycle Covers with Turn Costs. Theory Comput. Syst. 68(5): 1207-1238 (2024) - [c20]Dominik Krupke:
Near-Optimal Coverage Path Planning with Turn Costs. ALENEX 2024: 118-132 - [i19]Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra:
Maximum Polygon Packing: The CG: SHOP Challenge 2024. CoRR abs/2403.16203 (2024) - [i18]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
- [j8]Sándor P. Fekete
, Phillip Keldenich, Dominik Krupke
Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022. ACM J. Exp. Algorithmics 28: 1.9:1-1.9:13 (2023) - [c19]Sándor P. Fekete, Dominik Krupke, Michael Perk
A Closer Cut: Computing Near-Optimal Lawn Mowing Tours. ALENEX 2023: 1-14 - [c18]Sándor P. Fekete, Dominik Krupke, Michael Perk, Christian Rieck, Christian Scheffer:
The Lawn Mowing Problem: From Algebra to Algorithms. ESA 2023: 45:1-45:18 - [i17]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) - [i16]Sándor P. Fekete, Dominik Krupke, Michael Perk, Christian Rieck, Christian Scheffer:
The Lawn Mowing Problem: From Algebra to Algorithms. CoRR abs/2307.01092 (2023) - [i15]Dominik Michael Krupke:
Near-Optimal Coverage Path Planning with Turn Costs. CoRR abs/2310.20340 (2023) - 2022
- [b1]Dominik Krupke:
Algorithm Engineering for Hard Problems in Computational Geometry / Dominik Michael Krupke ; Sándor Fekete, William Cook, Joseph S.B. Mitchell. Braunschweig University of Technology, Germany, 2022 - [j7]Judith Bernett
Robust disease module mining via enumeration of diverse prize-collecting Steiner trees. Bioinform. 38(6): 1600-1606 (2022) - [j6]Erik D. Demaine, Sándor P. Fekete
Area-Optimal Simple Polygonalizations: The CG Challenge 2019. ACM J. Exp. Algorithmics 27: 2.4:1-2.4:12 (2022) - [j5]Sándor P. Fekete
Computing Coordinated Motion Plans for Robot Swarms: The CG: SHOP Challenge 2021. ACM J. Exp. Algorithmics 27: 3.1:1-3.1:12 (2022) - [j4]Kevin Buchin
Minimum Scan Cover and Variants: Theory and Experiments. ACM J. Exp. Algorithmics 27: 4.5:1-4.5:28 (2022) - [i14]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) - [i13]Sándor P. Fekete, Dominik Krupke, Michael Perk, Christian Rieck, Christian Scheffer:
A Closer Cut: Computing Near-Optimal Lawn Mowing Tours. CoRR abs/2211.05891 (2022) - 2021
- [j3]Sándor P. Fekete
Minimum Scan Cover with Angular Transition Costs. SIAM J. Discret. Math. 35(2): 1337-1355 (2021) - [c17]Kevin Buchin, Sándor P. Fekete, Alexander Hill, Linda Kleist
Minimum Scan Cover and Variants - Theory and Experiments. SEA 2021: 4:1-4:16 - [i12]Kevin Buchin, Sándor P. Fekete, Alexander Hill, Linda Kleist, Irina Kostitsyna, Dominik Krupke, Roel Lambers, Martijn Struijs:
Minimum Scan Cover and Variants - Theory and Experiments. CoRR abs/2103.14599 (2021) - [i11]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) - [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
- [j2]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, Linda Kleist
Minimum Scan Cover with Angular Transition Costs. SoCG 2020: 43:1-43:18 - [c15]Aaron T. Becker, Sándor P. Fekete, Li Huang, Phillip Keldenich, Linda Kleist
Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform, External Forces. ICRA 2020: 2508-2514 - [c14]Sándor P. Fekete, Alexander Hill
Probing a Set of Trajectories to Maximize Captured Information. SEA 2020: 5:1-5:14 - [i9]Sándor P. Fekete, Linda Kleist, Dominik Krupke:
Minimum Scan Cover with Angular Transition Costs. CoRR abs/2003.08816 (2020) - [i8]Sándor P. Fekete, Alexander Hill, Dominik Krupke, Tyler Mayer, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips:
Probing a Set of Trajectories to Maximize Captured Information. CoRR abs/2004.03486 (2020) - [i7]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
- [c13]Sándor P. Fekete, Dominik Krupke:
Practical Methods for Computing Large Covering Tours and Cycle Covers with Turn Cost. ALENEX 2019: 186-198 - [c12]Dominik Krupke, Volker Schaus
Automated Data Retrieval from Large-Scale Distributed Satellite Systems. CASE 2019: 1789-1795 - [c11]Sándor P. Fekete
Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation. CIAC 2019: 224-236 - 2018
- [c10]An Nguyen, Dominik Krupke, Mary Burbage, Shriya Bhatnagar, Sándor P. Fekete, Aaron T. Becker
U sing a UAV for Destructive Surveys of Mosquito Population. ICRA 2018: 7812-7819 - [c9]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 - [i6]Sándor P. Fekete, Dominik Krupke:
Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation. CoRR abs/1808.04417 (2018) - 2017
- [j1]Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt
Computing nonsimple polygons of minimum perimeter. J. Comput. Geom. 8(1): 340-365 (2017) - [c8]Aaron T. Becker
Zapping Zika with a Mosquito-Managing Drone: Computing Optimal Flight Patterns with Minimum Turn Cost (Multimedia Contribution). SoCG 2017: 62:1-62:5 - [c7]Arun Mahadev, Dominik Krupke, Sándor P. Fekete, Aaron T. Becker
Mapping and coverage with a particle swarm controlled by uniform inputs. IROS 2017: 1097-1104 - [c6]Aaron T. Becker
Tilt Assembly: Algorithms for Micro-Factories that Build Objects with Uniform External Forces. ISAAC 2017: 11:1-11:13 - [i5]Arun V. Mahadev, Dominik Krupke, Jan-Marc Reinhardt, Sándor P. Fekete, Aaron T. Becker:
Collecting a Swarm in a Grid Environment Using Shared, Global Inputs. CoRR abs/1701.00441 (2017) - [i4]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) - 2016
- [c5]Arun V. Mahadev, Dominik Krupke, Jan-Marc Reinhardt, Sándor P. Fekete, Aaron T. Becker
Collecting a swarm in a grid environment using shared, global inputs. CASE 2016: 1231-1236 - [c4]Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna
Computing Nonsimple Polygons of Minimum Perimeter. SEA 2016: 134-149 - [i3]Sándor P. Fekete, Andreas Haas, Michael Hemmer, Michael Hoffmann, Irina Kostitsyna, Dominik Krupke, Florian Maurer, Joseph S. B. Mitchell, Arne Schmidt, Christiane Schmidt, Julian Troegel:
Computing Nonsimple Polygons of Minimum Perimeter. CoRR abs/1603.07077 (2016) - 2015
- [c3]Dominik Krupke, Maximilian Ernestus, Michael Hemmer, Sándor P. Fekete:
Distributed cohesive control for robot swarms: Maintaining good connectivity in the presence of exterior forces. IROS 2015: 413-420 - [c2]Dominik Krupke, Michael Hemmer, James McLurkin, Yu Zhou, Sándor P. Fekete:
A parallel distributed strategy for arraying a scattered robot swarm. IROS 2015: 2795-2802 - [i2]Dominik Krupke, Maximilian Ernestus, Michael Hemmer, Sándor P. Fekete:
Distributed Cohesive Control for Robot Swarms: Maintaining Good Connectivity in the Presence of Exterior Forces. CoRR abs/1505.03116 (2015) - [i1]Dominik Krupke, Michael Hemmer, James McLurkin, Yu Zhou, Sándor P. Fekete:
A Parallel Distributed Strategy for Arraying a Scattered Robot Swarm. CoRR abs/1505.03128 (2015) - 2014
- [c1]Björn Bankowski, Thiemo Clausen, Dirk Ehmen, Maximilian Ernestus, Henning Hasemann, Tobias Jura, Alexander Kröller, Dominik Krupke, Marco Nikander:
Panic Room: Experiencing Overload and Having Fun in the Process. HCI (21) 2014: 241-252
Coauthor Index
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 2024-12-10 20:47 CET 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: