![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
- Sándor P. Fekete
TU Braunschweig, Institute of Operating Systems and Computer Networks, Germany
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 401 matches
- 2024
- 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) - Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra:
Maximum Polygon Packing: The CG: SHOP Challenge 2024. CoRR abs/2403.16203 (2024) - 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) - 2023
- 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) - 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) - Thomas Byrne
, Sándor P. Fekete
, Jörg Kalcsics
, Linda Kleist
:
Competitive location problems: balanced facility location and the One-Round Manhattan Voronoi Game. Ann. Oper. Res. 321(1): 79-101 (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) - 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) - Markus Scheidgen
, Lauri Himanen
, Alvin N. Ladines
, David Sikter
, Mohammad Nakhaee
, Ádám Fekete
, Theodore Chang
, Amir Golparvar
, José A. Márquez
, Sandor Brockhauser
, Sebastian Brückner
, Luca M. Ghiringhelli
, Felix Dietrich
, Daniel Lehmberg
, Thea Denell
, Andrea Albino
, Hampus Näsström
, Sherjeel Shabih
, Florian Dobener
, Markus Kühbach
, Rubel Mozumder
, Joseph F. Rudzinski
, Nathan Daelman
, José M. Pizarro
, Martin Kuban
, Cuauhtemoc Salazar
, Pavel Ondracka
, Hans-Joachim Bungartz
, Claudia Draxl
:
NOMAD: A distributed web-based platform for managing materials science research data. J. Open Source Softw. 8(90): 5388 (2023) - Sándor P. Fekete, Dominik Krupke, Michael Perk
, Christian Rieck, Christian Scheffer:
A Closer Cut: Computing Near-Optimal Lawn Mowing Tours. ALENEX 2023: 1-14 - 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 - 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) - 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) - Sabrina Ammann, Maximilian Hess, Debora Ramacciotti, Sándor P. Fekete, Paulina L. A. Goedicke, David Gross, Andreea Lefterovici, Tobias J. Osborne, Michael Perk, Antonio Rotundo, S. E. Skelton, Sebastian Stiller, Timo de Wolff:
Realistic Runtime Analysis for Quantum Simplex Computation. CoRR abs/2311.09995 (2023) - Aaron T. Becker, Sándor P. Fekete, Irina Kostitsyna, Matthew J. Patitz, Damien Woods, Ioannis Chatzigiannakis:
Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 23091). Dagstuhl Reports 13(2): 183-198 (2023) - 2022
- Sándor P. Fekete
, Eike Niehs, Christian Scheffer, Arne Schmidt:
Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots. Algorithmica 84(10): 2954-2986 (2022) - Judith Bernett
, Dominik Krupke, Sepideh Sadegh
, Jan Baumbach
, Sándor P. Fekete, Tim Kacprowski
, Markus List
, David B. Blumenthal
:
Robust disease module mining via enumeration of diverse prize-collecting Steiner trees. Bioinform. 38(6): 1600-1606 (2022) - Kevin Buchin
, Alexander Hill
, Sándor P. Fekete
, Linda Kleist
, Irina Kostitsyna
, Dominik Krupke
, Roel Lambers
, Martijn Struijs
:
Minimum Scan Cover and Variants: Theory and Experiments. ACM J. Exp. Algorithmics 27: 4.5:1-4.5:28 (2022) - 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) - Julien Bourgeois, Sándor P. Fekete, Ramin Kosfeld, Peter Kramer
, Benoît Piranda, Christian Rieck, Christian Scheffer:
Space Ants: Episode II - Coordinating Connected Catoms (Media Exposition). SoCG 2022: 65:1-65:6 - Matthias Konitzny, Yitong Lu, Julien Leclerc, Sándor P. Fekete, Aaron T. Becker:
Gathering Physical Particles with a Global Magnetic Field Using Reinforcement Learning. IROS 2022: 10126-10132 - Sándor P. Fekete, Peter Kramer
, Christian Rieck, Christian Scheffer, Arne Schmidt:
Efficiently Reconfiguring a Connected Swarm of Labeled Robots. ISAAC 2022: 17:1-17:15 - 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) - 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) - 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) - Javier Garcia, Michael Yannuzzi, Peter Kramer
, Christian Rieck, Sándor P. Fekete, Aaron T. Becker:
Cooperative 2D Reconfiguration using Spatio-Temporal Planning and Load Transferring. CoRR abs/2211.09198 (2022) - 2021
- 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) - Oswin Aichholzer
, Hugo A. Akitaya
, Kenneth C. Cheung, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete
, Linda Kleist
, Irina Kostitsyna
, Maarten Löffler, Zuzana Masárová, Klara Mundilova, Christiane Schmidt
:
Folding polyominoes with holes into a cube. Comput. Geom. 93: 101700 (2021)
skipping 371 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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.
retrieved on 2024-07-27 10:15 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint