default search action
Christian Scheffer
Person information
- affiliation: University of Münster, Computer Science Department, Germany
- affiliation: TU Braunschweig, Department of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j26]Sándor P. Fekete, Peter Kramer
, Christian Rieck, Christian Scheffer, Arne Schmidt:
Efficiently reconfiguring a connected swarm of labeled robots. Auton. Agents Multi Agent Syst. 38(2): 39 (2024) - [j25]Christian Rieck, Christian Scheffer:
The dispersive art gallery problem. Comput. Geom. 117: 102054 (2024) - [i24]Sándor P. Fekete, Joseph S. B. Mitchell, Christian Rieck, Christian Scheffer, Christiane Schmidt:
Dispersive Vertex Guarding for Simple and Non-Simple Polygons. CoRR abs/2406.05861 (2024) - [i23]Sándor P. Fekete, Ramin Kosfeld, Peter Kramer, Jonas Neutzner, Christian Rieck, Christian Scheffer:
Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain. CoRR abs/2409.06486 (2024) - 2023
- [j24]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) - [j23]Sándor P. Fekete
Packing Disks into Disks with Optimal Worst-Case Density. Discret. Comput. Geom. 69(1): 51-90 (2023) - [c34]Sándor P. Fekete, Dominik Krupke, Michael Perk
A Closer Cut: Computing Near-Optimal Lawn Mowing Tours. ALENEX 2023: 1-14 - [c33]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 - [i22]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) - 2022
- [j22]Jakob Keller, Christian Rieck, Christian Scheffer, Arne Schmidt:
Particle-Based Assembly Using Precise Global Control. Algorithmica 84(10): 2871-2897 (2022) - [j21]Sándor P. Fekete
Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots. Algorithmica 84(10): 2954-2986 (2022) - [j20]Christian Scheffer
The prefix Fréchet similarity. Comput. Geom. 103: 101853 (2022) - [c32]Julien Bourgeois, Sándor P. Fekete, Ramin Kosfeld, Peter Kramer
Space Ants: Episode II - Coordinating Connected Catoms (Media Exposition). SoCG 2022: 65:1-65:6 - [c31]Sándor P. Fekete, Peter Kramer
Efficiently Reconfiguring a Connected Swarm of Labeled Robots. ISAAC 2022: 17:1-17:15 - [c30]Christian Rieck, Christian Scheffer:
The Dispersive Art Gallery Problem. ISAAC 2022: 67:1-67:18 - [i21]Christian Rieck, Christian Scheffer:
The Dispersive Art Gallery Problem. CoRR abs/2209.10291 (2022) - [i20]Sándor P. Fekete, Peter Kramer, Christian Rieck, Christian Scheffer, Arne Schmidt:
Efficiently Reconfiguring a Connected Swarm of Labeled Robots. CoRR abs/2209.11028 (2022) - [i19]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
- [j19]Sándor P. Fekete
CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata. Algorithmica 83(1): 387-412 (2021) - [j18]Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist
Worst-Case Optimal Squares Packing into Disks. J. Comput. Geom. 12(2): 149-175 (2021) - [j17]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) - [c29]Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist
Packing Squares into a Disk with Optimal Worst-Case Density. SoCG 2021: 36:1-36:16 - [c28]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 - [c27]Jakob Keller, Christian Rieck, Christian Scheffer, Arne Schmidt:
Particle-Based Assembly Using Precise Global Control. WADS 2021: 513-527 - [i18]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) - [i17]Jakob Keller, Christian Rieck, Christian Scheffer, Arne Schmidt:
Particle-Based Assembly Using Precise Global Control. CoRR abs/2105.05784 (2021) - [i16]Sándor P. Fekete, Phillip Keldenich, Ramin Kosfeld, Christian Rieck, Christian Scheffer:
Connected Coordinated Motion Planning with Bounded Stretch. CoRR abs/2109.12381 (2021) - 2020
- [j16]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) - [c26]Sándor P. Fekete
Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots. ALGOSENSORS 2020: 60-75 - [c25]Christian Scheffer:
Scheduling Three Trains is NP-Complete. CCCG 2020: 87-93 - [c24]Sándor P. Fekete, Utkarsh Gupta
Worst-Case Optimal Covering of Rectangles by Disks. SoCG 2020: 42:1-42:23 - [c23]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 - [c22]Sándor P. Fekete, Phillip Keldenich
Covering Rectangles by Disks: The Video (Media Exposition). SoCG 2020: 75:1-75:4 - [c21]Eike Niehs
Recognition and Reconfiguration of Lattice-Based Cellular Structures by Simple Robots. ICRA 2020: 8252-8259 - [c20]Christian Scheffer
Train Scheduling: Hardness and Algorithms. WALCOM 2020: 342-347 - [i15]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)
2010 – 2019
- 2019
- [j15]Sándor P. Fekete
Split Packing: Algorithms for Packing Circles with Optimal Worst-Case Density. Discret. Comput. Geom. 61(3): 562-594 (2019) - [j14]Christian Scheffer, Jan Vahrenhold:
Approximate shortest distances among smooth obstacles in 3D. J. Comput. Geom. 10(1): 389-422 (2019) - [j13]Erik D. Demaine, Sándor P. Fekete
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch. SIAM J. Comput. 48(6): 1727-1762 (2019) - [c19]Sándor P. Fekete, Phillip Keldenich
Packing Disks into Disks with Optimal Worst-Case Density. SoCG 2019: 35:1-35:19 - [c18]Aaron T. Becker
Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition). SoCG 2019: 63:1-63:6 - [c17]Sándor P. Fekete
Online Circle Packing. WADS 2019: 366-379 - [c16]Christian Scheffer
The Prefix Fréchet Similarity. WALCOM 2019: 96-107 - [i14]Sándor P. Fekete, Phillip Keldenich, Christian Scheffer:
Packing Disks into Disks with Optimal Worst-Case Density. CoRR abs/1903.07908 (2019) - [i13]Sándor P. Fekete, Sven von Höveling, Christian Scheffer:
Online Circle Packing. CoRR abs/1905.00612 (2019) - [i12]Sándor P. Fekete, Eike Niehs, Christian Scheffer, Arne Schmidt:
Connected Assembly and Reconfiguration by Finite Automata. CoRR abs/1909.03880 (2019) - 2018
- [j12]Amin Gheibi
Path Refinement in Weighted Regions. Algorithmica 80(12): 3766-3802 (2018) - [j11]Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Approximating the integral Fréchet distance. Comput. Geom. 70-71: 13-30 (2018) - [j10]Sándor P. Fekete, Qian Li
Universal Guard Problems. Int. J. Comput. Geom. Appl. 28(2): 129-160 (2018) - [j9]Zachary Abel, Victor Alvarez, Erik D. Demaine, Sándor P. Fekete
Conflict-Free Coloring of Graphs. SIAM J. Discret. Math. 32(4): 2675-2702 (2018) - [c15]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 - [c14]Aaron T. Becker
Coordinated Motion Planning: The Video (Multimedia Exposition). SoCG 2018: 74:1-74:6 - [c13]Sándor P. Fekete
Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading. LATIN 2018: 448-460 - [c12]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 - [i11]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) - [i10]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
- [j8]Sándor P. Fekete, Jan-Marc Reinhardt, Christian Scheffer:
An efficient data structure for dynamic two-dimensional reconfiguration. J. Syst. Archit. 75: 15-25 (2017) - [j7]Erik D. Demaine, Sándor P. Fekete
New geometric algorithms for fully connected staged self-assembly. Theor. Comput. Sci. 671: 4-18 (2017) - [c11]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 - [c10]Aaron T. Becker
Tilt Assembly: Algorithms for Micro-Factories that Build Objects with Uniform External Forces. ISAAC 2017: 11:1-11:13 - [c9]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 - [c8]Sándor P. Fekete, Sebastian Morr, Christian Scheffer:
Split Packing: Packing Circles into Triangles with Optimal Worst-Case Density. WADS 2017: 373-384 - [i9]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) - [i8]Sándor P. Fekete, Jan-Marc Reinhardt, Christian Scheffer:
An Efficient Data Structure for Dynamic Two-Dimensional Reconfiguration. CoRR abs/1702.07696 (2017) - [i7]Sándor P. Fekete, Sebastian Morr, Christian Scheffer:
Split Packing: Algorithms for Packing Circles with Optimal Worst-Case Density. CoRR abs/1705.00924 (2017) - [i6]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) - [i5]Sándor P. Fekete, Sven von Höveling, Joseph S. B. Mitchell, Christian Rieck, Christian Scheffer, Arne Schmidt, James R. Zuber:
Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading. CoRR abs/1712.06498 (2017) - 2016
- [j6]Christian Scheffer:
More Flexible Curve Matching via the Partial Fréchet Similarity. Int. J. Comput. Geom. Appl. 26(1): 33-52 (2016) - [j5]Christian Scheffer:
Near-linear time medial axis approximation of smooth curves in $\mathbb{R}^3$. J. Comput. Geom. 7(1): 360-429 (2016) - [c7]Sándor P. Fekete, Jan-Marc Reinhardt, Christian Scheffer:
An Efficient Data Structure for Dynamic Two-Dimensional Reconfiguration. ARCS 2016: 306-318 - [c6]Sándor P. Fekete, Qian Li, Joseph S. B. Mitchell, Christian Scheffer:
Universal Guard Problems. ISAAC 2016: 32:1-32:13 - [c5]Christian Scheffer, Jan Vahrenhold:
Approximate Shortest Distances Among Smooth Obstacles in 3D. ISAAC 2016: 60:1-60:13 - [c4]Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Approximating the Integral Fréchet Distance. SWAT 2016: 26:1-26:14 - [i4]Sándor P. Fekete, Qian Li, Joseph S. B. Mitchell, Christian Scheffer:
Universal Guard Problems. CoRR abs/1611.08315 (2016) - 2015
- [j4]Christian Scheffer, Jan Vahrenhold:
Subquadratic medial-axis approximation in $\mathbb{R}^3$. J. Comput. Geom. 6(1): 249-287 (2015) - [c3]Erik D. Demaine, Sándor P. Fekete, Christian Scheffer, Arne Schmidt:
New Geometric Algorithms for Fully Connected Staged Self-Assembly. DNA 2015: 104-116 - [i3]Erik D. Demaine, Sándor P. Fekete, Christian Scheffer, Arne Schmidt:
New Geometric Algorithms for Fully Connected Staged Self-Assembly. CoRR abs/1505.07862 (2015) - [i2]Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Approximating the Integral Fréchet Distance. CoRR abs/1512.03359 (2015) - 2014
- [b1]Christian Scheffer:
Approximation algorithms for geometrical distance problems that are not solvable exactly. Universität Münster, 2014, pp. I-X, 1-149 - [j3]Christian Scheffer, Jan Vahrenhold:
Approximating geodesic distances on 2-manifolds in R3. Comput. Geom. 47(2): 125-140 (2014) - [j2]Jean-Lou De Carufel, Amin Gheibi
Similarity of polygonal curves in the presence of outliers. Comput. Geom. 47(5): 625-641 (2014) - [j1]Christian Scheffer, Jan Vahrenhold:
Approximating geodesic distances on 2-manifolds in R3: The weighted case. Comput. Geom. 47(8): 789-808 (2014) - [c2]Amin Gheibi
Minimum backward fréchet distance. SIGSPATIAL/GIS 2014: 381-388 - 2012
- [i1]Jean-Lou De Carufel, Amin Gheibi, Anil Maheshwari, Jörg-Rüdiger Sack, Christian Scheffer:
Similarity of Polygonal Curves in the Presence of Outliers. CoRR abs/1212.1617 (2012) - 2011
- [c1]Christian Scheffer, Jan Vahrenhold:
Approximating Geodesic Distances on 2-Manifolds in R3. CCCG 2011
Coauthor Index
[j26] [i24] [i23] [j24] [j23] [c34] [c33] [i22] [j21] [c32] [c31] [i20] [i19] [j19] [j18] [j17] [c29] [c28] [i18] [i16] [j16] [c26] [c24] [c23] [c22] [c21] [i15] [j15] [j13] [c19] [c18] [c17] [i14] [i13] [i12] [j10] [j9] [c15] [c14] [c13] [c12] [i11] [i10] [j8] [j7] [c11] [c10] [c9] [c8] [i9] [i8] [i7] [i6] [i5] [c7] [c6] [i4] [c3] [i3]
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-11-15 20:35 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: