default search action
Sándor P. Fekete
- > Home > Persons > Sándor P. Fekete
Publications
- 2019
- [j85]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) - 2018
- [c126]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 - [i98]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) - 2009
- [j46]Esther M. Arkin, Sándor P. Fekete, Kamrul Islam, Henk Meijer, Joseph S. B. Mitchell, Yurai Núñez Rodríguez, Valentin Polishchuk, David Rappaport, Henry Xiao:
Not being (super)thin or solid is hard: A study of grid Hamiltonicity. Comput. Geom. 42(6-7): 582-605 (2009) - 2008
- [j44]Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips:
Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance. Algorithmica 50(2): 279-298 (2008) - [j43]Sándor P. Fekete, Marco E. Lübbecke
Minimizing the Stabbing Number of Matchings, Trees, and Triangulations. Discret. Comput. Geom. 40(4): 595-621 (2008) - 2005
- [j32]Sándor P. Fekete, Henk Meijer:
The one-round Voronoi game replayed. Comput. Geom. 30(2): 81-94 (2005) - [c33]Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips:
Communication-Aware Processor Allocation for Supercomputers. WADS 2005: 169-181 - 2004
- [j27]Sándor P. Fekete, Henk Meijer:
Maximum Dispersion and Geometric Maximum Weight Cliques. Algorithmica 38(3): 501-511 (2004) - [c28]Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer:
Minimizing the stabbing number of matchings, trees, and triangulations. SODA 2004: 437-446 - [i19]Michael A. Bender, David P. Bunde, Erik D. Demaine, Sándor P. Fekete, Vitus J. Leung, Henk Meijer, Cynthia A. Phillips:
Communication-Aware Processor Allocation for Supercomputers. CoRR cs.DS/0407058 (2004) - 2003
- [c25]Sándor P. Fekete, Henk Meijer:
The One-Round Voronoi Game Replayed. WADS 2003: 150-171 - [i17]Sándor P. Fekete, Henk Meijer:
The one-round Voronoi game replayed. CoRR cs.CG/0305016 (2003) - [i15]Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer:
Minimizing the stabbing number of matchings, trees, and triangulations. CoRR cs.CG/0310034 (2003) - [i11]Sándor P. Fekete, Henk Meijer:
Maximum dispersion and geometric maximum weight cliques. CoRR cs.DS/0310037 (2003) - 2002
- [j19]Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze:
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. ACM J. Exp. Algorithmics 7: 11 (2002) - [i5]Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze:
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. CoRR cs.DS/0212044 (2002) - 2001
- [c22]Sándor P. Fekete, Henk Meijer, André Rohe, Walter Tietze:
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. ALENEX 2001: 1-16 - 2000
- [j8]Sándor P. Fekete, Henk Meijer:
On Minimum Stars and Maximum Matchings. Discret. Comput. Geom. 23(3): 389-407 (2000) - [c17]Sándor P. Fekete, Henk Meijer:
Maximum dispersion and geometric maximum weight cliques. APPROX 2000: 132-143 - 1999
- [j7]Sándor P. Fekete, Henk Meijer:
Rectangle and Box Visibility Graphs in 3D. Int. J. Comput. Geom. Appl. 9(1): 1-28 (1999) - [c15]Sándor P. Fekete, Henk Meijer:
On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings. SCG 1999: 217-226 - 1998
- [j5]Prosenjit Bose, Hazel Everett, Sándor P. Fekete, Michael E. Houle, Anna Lubiw, Henk Meijer, Kathleen Romanik, Günter Rote, Thomas C. Shermer, Sue Whitesides, Christian Zelle:
A Visibility Representation for Graphs in Three Dimensions. J. Graph Algorithms Appl. 2(3): 1-16 (1998)
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-11-12 00:18 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: