The Lawnmower Problem. - Esther M. Arkin; Sándor P. Fekete; Joseph S. B. Mitchell (CCCG, 1993)

Area Optimization of Simple Polygons. - Sándor P. Fekete; William R. Pulleyblank (SCG, 1993)

New Results on a Visibility Representation of Graphs in 3D. - Sándor P. Fekete; Michael E. Houle; Sue Whitesides (GD, 1995)

The Nucleon of Cooperative Games and an Algorithm for Matching Games - Ulrich Faigle; Sándor P. Fekete; Winfried Hochstättler; Walter Kern (Electron. Colloquium Comput. Complex., 1995)

On Approximately Fair Cost Allocation in Euclidean TSP Games - Ulrich Faigle; Sándor P. Fekete; Winfried Hochstättler; Walter Kern (Electron. Colloquium Comput. Complex., 1995)

The complexity of an inverse shortest paths problem. - Sándor P. Fekete; Winfried Hochstättler; Stephan Kromberg; Christoph Moll (Contemporary Trends in Discrete Mathematics, 1997)

A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems. - Sándor P. Fekete; Jörg Schepers (ESA, 1997)

The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems. - Sándor P. Fekete; Michael E. Houle; Sue Whitesides (GD, 1997)

Angle-Restricted Tours in the Plane. - Sándor P. Fekete; Gerhard J. Woeginger (Comput. Geom., 1997)

On the complexity of testing membership in the core of min-cost spanning tree games. - Ulrich Faigle; Walter Kern; Sándor P. Fekete; Winfried Hochstättler (Int. J. Game Theory, 1997)

A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. - Sándor P. Fekete; Samir Khuller; Monika Klemmstein; Balaji Raghavachari; Neal E. Young (J. Algorithms, 1997)

Asymmetric Rendezvous on the Plane. - Edward J. Anderson; Sándor P. Fekete (SCG, 1998)

New Classes of Lower Bounds for Bin Packing Problems. - Sándor P. Fekete; Jörg Schepers (IPCO, 1998)

Traveling the Boundary of Minkowski Sums. - Sándor P. Fekete; William R. Pulleyblank (Inf. Process. Lett., 1998)

A Visibility Representation for Graphs in Three Dimensions. - 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 (J. Graph Algorithms Appl., 1998)

On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings. - Sándor P. Fekete; Henk Meijer (SCG, 1999)

Orthogonal Graph Drawing. - Markus Eiglsperger; Sándor P. Fekete; Gunnar W. Klau (Drawing Graphs, 1999)

Compile-time Optimization of Dynamic Hardware Reconfigurations. - Jürgen Teich; Sándor P. Fekete; Jörg Schepers (PDPTA, 1999)

Simplicity and Hardness of the Maximum Traveling Salesman Problem Under Geometric Distances. - Sándor P. Fekete (SODA, 1999)

Rectangle and Box Visibility Graphs in 3D. - Sándor P. Fekete; Henk Meijer (Int. J. Comput. Geom. Appl., 1999)

On the continuous Weber and k-median problems (extended abstract). - Sándor P. Fekete; Joseph S. B. Mitchell; Karin Weinbrecht (SCG, 2000)

Approximation algorithms for lawn mowing and milling. - Esther M. Arkin; Sándor P. Fekete; Joseph S. B. Mitchell (Comput. Geom., 2000)

On Simple Polygonalizations with Optimal Area. - Sándor P. Fekete (Discret. Comput. Geom., 2000)

On Minimum Stars and Maximum Matchings. - Sándor P. Fekete; Henk Meijer (Discret. Comput. Geom., 2000)

Optimal FPGA module placement with temporal precedence constraints. - Sándor P. Fekete; Ekkehard Köhler; Jürgen Teich (DATE, 2001)

On the Reflexivity of Point Sets. - Esther M. Arkin; Sándor P. Fekete; Ferran Hurtado; Joseph S. B. Mitchell; Marc Noy; Vera Sacristán; Saurabh Sethia (WADS, 2001)

Approximation of Geometric Dispersion Problems. - Christoph Baur; Sándor P. Fekete (Algorithmica, 2001)

Tree spanners in planar graphs. - Sándor P. Fekete; Jana Kremer (Discret. Appl. Math., 2001)

Matching as the Intersection of Matroids. - Sándor P. Fekete; Robert T. Firla; Bianca Spille (Electron. Notes Discret. Math., 2001)

Extending Partial Suborders. - Sándor P. Fekete; Ekkehard Köhler; Jürgen Teich (Electron. Notes Discret. Math., 2001)

Terrain Decomposition and Layered Manufacturing. - Sándor P. Fekete; Joseph S. B. Mitchell (Int. J. Comput. Geom. Appl., 2001)

Two Dimensional Rendezvous Search. - Edward J. Anderson; Sándor P. Fekete (Oper. Res., 2001)

New classes of fast lower bounds for bin packing problems. - Sándor P. Fekete; Jörg Schepers (Math. Program., 2001)

Optimization of Dynamic Hardware Reconfigurations. - Jürgen Teich; Sándor P. Fekete; Jörg Schepers (J. Supercomput., 2001)

The freeze-tag problem: how to wake up a swarm of robots. - Esther M. Arkin; Michael A. Bender; Sándor P. Fekete; Joseph S. B. Mitchell; Martin Skutella (SODA, 2002)

Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments. - Tien-Ruey Hsiang; Esther M. Arkin; Michael A. Bender; Sándor P. Fekete; Joseph S. B. Mitchell (WAFR, 2002)

Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems. - Sándor P. Fekete; Henk Meijer; André Rohe; Walter Tietze (ACM J. Exp. Algorithmics, 2002)

Online dispersion algorithms for swarms of robots. - Tien-Ruey Hsiang; Esther M. Arkin; Michael A. Bender; Sándor P. Fekete; Joseph S. B. Mitchell (SCG, 2003)

An algorithmic study of manufacturing paperclips and other folded structures. - Esther M. Arkin; Sándor P. Fekete; Joseph S. B. Mitchell (Comput. Geom., 2003)

The complexity of economic equilibria for house allocation markets. - Sándor P. Fekete; Martin Skutella; Gerhard J. Woeginger (Inf. Process. Lett., 2003)

The geometric maximum traveling salesman problem. - Alexander I. Barvinok; Sándor P. Fekete; David S. Johnson 001; Arie Tamir; Gerhard J. Woeginger; Russell Woodroofe (J. ACM, 2003)

Characterizing matchings as the intersection of matroids. - Sándor P. Fekete; Robert T. Firla; Bianca Spille (Math. Methods Oper. Res., 2003)

Neighborhood-Based Topology Recognition in Sensor Networks. - Sándor P. Fekete; Alexander Kröller; Dennis Pfisterer; Stefan Fischer 001; Carsten Buschmann (ALGOSENSORS, 2004)

Searching with an autonomous robot. - Sándor P. Fekete; Rolf Klein; Andreas Nüchter (SCG, 2004)

Optimal Routing-Conscious Dynamic Placement for Reconfigurable Devices. - Ali Ahmadinia; Christophe Bobda; Sándor P. Fekete; Jürgen Teich; Jan van der Veen (FPL, 2004)

SpyGlass: taking a closer look at sensor networks. - Carsten Buschmann; Dennis Pfisterer; Stefan Fischer 001; Sándor P. Fekete; Alexander Kröller (SenSys, 2004)

Maximum Dispersion and Geometric Maximum Weight Cliques. - Sándor P. Fekete; Henk Meijer (Algorithmica, 2004)

A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems. - Sándor P. Fekete; Jörg Schepers (Math. Methods Oper. Res., 2004)

A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing. - Sándor P. Fekete; Jörg Schepers (Math. Oper. Res., 2004)

Traveling salesmen in the presence of competition. - Sándor P. Fekete; Rudolf Fleischer; Aviezri S. Fraenkel; Matthias Schmitt (Theor. Comput. Sci., 2004)

A New Approach for Boundary Recognition in Geometric Sensor Networks. - Sándor P. Fekete; Michael Kaufmann 001; Alexander Kröller; Katharina Anna Lehmann (CCCG, 2005)

Deterministic boundary recongnition and topology extraction for large sensor networks. - Sándor P. Fekete; Alexander Kröller; Dennis Pfisterer; Stefan Fischer 001 (Algorithmic Aspects of Large and Complex Networks, 2005)

Defragmenting the Module Layout of a Partially Reconfigurable Device. - Jan van der Veen; Sándor P. Fekete; Mateusz Majer; Ali Ahmadinia; Christophe Bobda; Frank Hannig; Jürgen Teich (ERSA, 2005)

The Erlangen Slot Machine: A Highly Flexible FPGA-Based Reconfigurable Platform. - Christophe Bobda; Mateusz Majer; Ali Ahmadinia; Thomas Haller; André Linarth; Jürgen Teich; Sándor P. Fekete; Jan van der Veen (FCCM, 2005)

DyNoC: A Dynamic Infrastructure for Communication in Dynamically Reconfigurable Devices. - Christophe Bobda; Ali Ahmadinia; Mateusz Majer; Jürgen Teich; Sándor P. Fekete; Jan van der Veen (FPL, 2005)

A Practical Approach for Circuit Routing on Dynamic Reconfigurable Devices. - Ali Ahmadinia; Christophe Bobda; Ji Ding 004; Mateusz Majer; Jürgen Teich; Sándor P. Fekete; Jan van der Veen (IEEE International Workshop on Rapid System Prototyping, 2005)

Communication-Aware Processor Allocation for Supercomputers. - Michael A. Bender; David P. Bunde; Erik D. Demaine; Sándor P. Fekete; Vitus J. Leung; Henk Meijer; Cynthia A. Phillips (WADS, 2005)

The one-round Voronoi game replayed. - Sándor P. Fekete; Henk Meijer (Comput. Geom., 2005)

Shawn: A new approach to simulating wireless sensor networks - Alexander Kröller; Dennis Pfisterer; Carsten Buschmann; Sándor P. Fekete; Stefan Fischer 001 (CoRR, 2005)

Defragmenting the Module Layout of a Partially Reconfigurable Device - Jan van der Veen; Sándor P. Fekete; Ali Ahmadinia; Christophe Bobda; Frank Hannig; Jürgen Teich (CoRR, 2005)

On the Continuous Fermat-Weber Problem. - Sándor P. Fekete; Joseph S. B. Mitchell; Karin Beurer (Oper. Res., 2005)

Koordinatenfreies Lokationsbewusstsein (Localization without Coordinates). - Sándor P. Fekete; Alexander Kröller; Carsten Buschmann; Stefan Fischer 001; Dennis Pfisterer (it Inf. Technol., 2005)

Optimal Covering Tours with Turn Costs. - Esther M. Arkin; Michael A. Bender; Erik D. Demaine; Sándor P. Fekete; Joseph S. B. Mitchell; Saurabh Sethia (SIAM J. Comput., 2005)

SpyGlass: a wireless sensor network visualizer. - Carsten Buschmann; Dennis Pfisterer; Stefan Fischer 001; Sándor P. Fekete; Alexander Kröller (SIGBED Rev., 2005)

Minimum-cost coverage of point sets by disks. - Helmut Alt; Esther M. Arkin; Hervé Brönnimann; Jeff Erickson 001; Sándor P. Fekete; Christian Knauer; Jonathan Lenchner; Joseph S. B. Mitchell; Kim Whittlesey (SCG, 2006)

Geometry-based reasoning for a large sensor network. - Sándor P. Fekete; Alexander Kröller (SCG, 2006)

06421 Executive Summary – Robot Navigation. - Sándor P. Fekete; Rudolf Fleischer; Rolf Klein; Alejandro López-Ortiz (Robot Navigation, 2006)

06421 Abstracts Collection – Robot Navigation. - Sándor P. Fekete; Rudolf Fleischer; Rolf Klein; Alejandro López-Ortiz (Robot Navigation, 2006)

Geometric Distance Estimation for Sensor Networks and Unit Disk Graphs. - Sándor P. Fekete; Alexander Kröller; Carsten Buschmann; Stefan Fischer 001 (Geometric Networks and Metric Space Embeddings, 2006)

Polygon Exploration with Discrete Vision. - Sándor P. Fekete; Christiane Schmidt 001 (Robot Navigation, 2006)

Hovering Data Clouds: A Decentralized and Self-organizing Information System. - Axel Wegener; Elad Michael Schiller; Horst Hellbrück; Sándor P. Fekete; Stefan Fischer 001 (IWSOS/EuroNGI, 2006)

Optimal Simultaneous Scheduling, Binding and Routing for Processor-Like Reconfigurable Architectures. - Janina A. Brenner; Jan van der Veen; Sándor P. Fekete; Julio A. de Oliveira Filho; Wolfgang Rosenstiel (FPL, 2006)

Minimizing Communication Cost for Reconfigurable Slot Modules. - Sándor P. Fekete; Jan van der Veen; Mateusz Majer; Jürgen Teich (FPL, 2006)

Recognizing Traffic Jams with Hovering Data Clouds. - Sándor P. Fekete; Christiane Schmidt 001; Axel Wegener; Stefan Fischer 001 (ISoLA, 2006)

Deterministic boundary recognition and topology extraction for large sensor networks. - Alexander Kröller; Sándor P. Fekete; Dennis Pfisterer; Stefan Fischer 001 (SODA, 2006)

The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots. - Esther M. Arkin; Michael A. Bender; Sándor P. Fekete; Joseph S. B. Mitchell; Martin Skutella (Algorithmica, 2006)

Online searching with an autonomous robot. - Sándor P. Fekete; Rolf Klein; Andreas Nüchter (Comput. Geom., 2006)

Minimum-Cost Coverage of Point Sets by Disks - Esther M. Arkin; Hervé Brönnimann; Jeff Erickson 001; Sándor P. Fekete; Christian Knauer; Jonathan Lenchner; Joseph S. B. Mitchell; Kim Whittlesey (CoRR, 2006)

Simultaneous Scheduling, Binding and Routing for Coarse-Grain Reconfigurable Architectures. - Janina A. Brenner; Sándor P. Fekete; Jan van der Veen (Electron. Notes Discret. Math., 2006)

Higher-Dimensional Packing with Order Constraints. - Sándor P. Fekete; Ekkehard Köhler; Jürgen Teich (SIAM J. Discret. Math., 2006)

Online searching with turn cost. - Erik D. Demaine; Sándor P. Fekete; Shmuel Gal (Theor. Comput. Sci., 2006)

Topology and Routing in Sensor Networks. - Sándor P. Fekete; Alexander Kröller (ALGOSENSORS, 2007)

On Rolling Cube Puzzles. - Kevin Buchin; Maike Buchin; Erik D. Demaine; Martin L. Demaine; Dania El-Khechen; Sándor P. Fekete; Christian Knauer; André Schulz 001; Perouz Taslakian (CCCG, 2007)

Radio Propagation-Aware Distance Estimation Based on Neighborhood Comparison. - Carsten Buschmann; Horst Hellbrück; Stefan Fischer 001; Alexander Kröller; Sándor P. Fekete (EWSN, 2007)

AutoCast: An Adaptive Data Dissemination Protocol for Traffic Information Systems. - Axel Wegener; Horst Hellbrück; Stefan Fischer 001; Christiane Schmidt 001; Sándor P. Fekete (VTC Fall, 2007)

PackLib2: An integrated library of multi-dimensional packing problems. - Sándor P. Fekete; Jan van der Veen (Eur. J. Oper. Res., 2007)

An Exact Algorithm for Higher-Dimensional Orthogonal Packing. - Sándor P. Fekete; Jörg Schepers; Jan van der Veen (Oper. Res., 2007)

The Erlangen Slot Machine - A Platform for Interdisciplinary Research in Dynamically Reconfigurable Computing (ESM - Eine Hardware-Plattform für interdisziplinäre Forschung im Bereich des dynamischen rekonfigurierbaren Rechnens). - Josef Angermeier; Diana Göhringer; Mateusz Majer; Jürgen Teich; Sándor P. Fekete; Jan van der Veen (it Inf. Technol., 2007)

Emergent algorithms for centroid and orientation detection in high-performance embedded cameras. - Marcus Komann; Alexander Kröller; Christiane Schmidt 001; Dietmar Fey; Sándor P. Fekete (Conf. Computing Frontiers, 2008)

Improved Approximation Algorithms for Relay Placement. - Alon Efrat; Sándor P. Fekete; Poornananda R. Gaddehosur; Joseph S. B. Mitchell; Valentin Polishchuk; Jukka Suomela (ESA, 2008)

No-break dynamic defragmentation of reconfigurable devices. - Sándor P. Fekete; Tom Kamphans; Nils Schweer; Christopher Tessars; Jan van der Veen; Josef Angermeier; Dirk Koch; Jürgen Teich (FPL, 2008)

The Maximum Energy-Constrained Dynamic Flow Problem. - Sándor P. Fekete; Alexander Hall; Ekkehard Köhler; Alexander Kröller (SWAT, 2008)

Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance. - Michael A. Bender; David P. Bunde; Erik D. Demaine; Sándor P. Fekete; Vitus J. Leung; Henk Meijer; Cynthia A. Phillips (Algorithmica, 2008)

Staged Self-Assembly:Nanomanufacture of Arbitrary Shapes with O(1) Glues - Erik D. Demaine; Martin L. Demaine; Sándor P. Fekete; Mashhood Ishaque; Eynat Rafalin; Robert T. Schweller; Diane L. Souvaine (CoRR, 2008)

Minimizing the Stabbing Number of Matchings, Trees, and Triangulations. - Sándor P. Fekete; Marco E. Lübbecke; Henk Meijer (Discret. Comput. Geom., 2008)

Staged self-assembly: nanomanufacture of arbitrary shapes with O (1) glues. - Erik D. Demaine; Martin L. Demaine; Sándor P. Fekete; Mashhood Ishaque; Eynat Rafalin; Robert T. Schweller; Diane L. Souvaine (Nat. Comput., 2008)

Offline and Online Aspects of Defragmenting the Module Layout of a Partially Reconfigurable Device. - Sándor P. Fekete; Jan van der Veen; Ali Ahmadinia; Diana Göhringer; Mateusz Majer; Jürgen Teich (IEEE Trans. Very Large Scale Integr. Syst., 2008)

Distributed vision with smart pixels. - Sándor P. Fekete; Dietmar Fey; Marcus Komann; Alexander Kröller; Marc Reichenbach; Christiane Schmidt 001 (SCG, 2009)

On the Fairness of Probabilistic Schedulers for Population Protocols. - Ioannis Chatzigiannakis; Shlomi Dolev; Sándor P. Fekete; Othon Michail; Paul G. Spirakis (Algorithmic Methods for Distributed Cooperative Systems, 2009)

09371 Abstracts Collection - Algorithmic Methods for Distributed Cooperative Systems. - Sándor P. Fekete; Stefan Fischer 001; Martin A. Riedmiller; Subhash Suri (Algorithmic Methods for Distributed Cooperative Systems, 2009)

Algorithms and Simulation Methods for Topology-Aware Sensor Networks. - Alexander Kröller; Dennis Pfisterer; Sándor P. Fekete; Stefan Fischer 001 (Algorithmics of Large and Complex Networks, 2009)

Maintaining Arrays of Contiguous Objects. - Michael A. Bender; Sándor P. Fekete; Tom Kamphans; Nils Schweer (FCT, 2009)

Designing a Decentralized Traffic Information System - AutoNomos. - Axel Wegener; Horst Hellbrück; Stefan Fischer 001; Björn Hendriks; Christiane Schmidt 001; Sándor P. Fekete (KiVS, 2009)

Flash Mob Organization in Heterogeneous Wireless Sensor Networks. - Tobias Baumgartner 001; Sándor P. Fekete; Winfried Hellmann; Alexander Kröller (NTMS, 2009)

Not All Fair Probabilistic Schedulers Are Equivalent. - Ioannis Chatzigiannakis; Shlomi Dolev; Sándor P. Fekete; Othon Michail; Paul G. Spirakis (OPODIS, 2009)

Hallway monitoring with sensor networks. - Tobias Baumgartner 001; Sándor P. Fekete; Alexander Kröller (SenSys, 2009)

Online Square Packing. - Sándor P. Fekete; Tom Kamphans; Nils Schweer (WADS, 2009)

Not being (super)thin or solid is hard: A study of grid Hamiltonicity. - Esther M. Arkin; Sándor P. Fekete; Kamrul Islam 001; Henk Meijer; Joseph S. B. Mitchell; Yurai Núñez Rodríguez; Valentin Polishchuk; David Rappaport; Henry Xiao (Comput. Geom., 2009)

A minimization version of a directed subgraph homeomorphism problem. - Janina A. Brenner; Sándor P. Fekete; Jan van der Veen (Math. Methods Oper. Res., 2009)

ReCoNodes - Optimization Methods for Module Scheduling and Placement on Reconfigurable Hardware Devices. - Ali Ahmadinia; Josef Angermeier; Sándor P. Fekete; Tom Kamphans; Dirk Koch; Mateusz Majer; Nils Schweer; Jürgen Teich; Christopher Tessars; Jan van der Veen (Dynamically Reconfigurable Systems, 2010)

Evacuation of Rectilinear Polygons. - Sándor P. Fekete; Chris Gray; Alexander Kröller (COCOA (1), 2010)

Wiselib: A Generic Algorithm Library for Heterogeneous Sensor Networks. - Tobias Baumgartner 001; Ioannis Chatzigiannakis; Sándor P. Fekete; Christos Koninis; Alexander Kröller; Apostolos Pyrgelis (EWSN, 2010)

Virtual area management: Multitasking on dynamically partially reconfigurable devices. - Josef Angermeier; Sándor P. Fekete; Tom Kamphans; Nils Schweer; Jürgen Teich (IPDPS Workshops, 2010)

A Protocol for Self-Synchronized Duty-Cycling in Sensor Networks: Generic Implementation in Wiselib. - Hugo Hernández; Maria J. Blesa; Christian Blum 001; Tobias Baumgartner 001; Sándor P. Fekete; Alexander Kröller (MSN, 2010)

Demo Abstract: Bridging the Gap between Simulated Sensor Nodes and the Real World. - Tobias Baumgartner 001; Daniel Bimschas; Sándor P. Fekete; Stefan Fischer 001; Alexander Kröller; Max Pagel; Dennis Pfisterer (REALWSN, 2010)

Hallway Monitoring: Distributed Data Processing with Wireless Sensor Networks. - Tobias Baumgartner 001; Sándor P. Fekete; Tom Kamphans; Alexander Kröller; Max Pagel (REALWSN, 2010)

Topology Virtualization for Wireless Sensor Network Testbeds. - Daniel Bimschas; Maick Danckwardt; Dennis Pfisterer; Stefan Fischer 001; Tobias Baumgartner 001; Alexander Kröller; Sándor P. Fekete (TRIDENTCOM, 2010)

Real-World G-Lab: Integrating Wireless Sensor Networks with the Future Internet. - Daniel Bimschas; Sándor P. Fekete; Stefan Fischer 001; Horst Hellbrück; Alexander Kröller; Richard Mietz; Max Pagel; Dennis Pfisterer; Kay Römer; Torsten Teubler (TRIDENTCOM, 2010)

Polygon exploration with time-discrete vision. - Sándor P. Fekete; Christiane Schmidt 001 (Comput. Geom., 2010)

Maintaining Virtual Areas on FPGAs using Strip Packing with Delays - Josef Angermeier; Sándor P. Fekete; Tom Kamphans; Nils Schweer; Jürgen Teich (CoRR, 2010)

Empowered by Wireless Communication: Self-Organizing Traffic Collectives - Sándor P. Fekete; Christiane Schmidt 001; Axel Wegener; Horst Hellbrück; Stefan Fischer 001 (CoRR, 2010)

Circle Packing for Origami Design Is Hard - Erik D. Demaine; Sándor P. Fekete; Robert J. Lang (CoRR, 2010)

Integer Point Sets Minimizing Average Pairwise L1-Distance: What is the Optimal Shape of a Town? - Erik D. Demaine; Sándor P. Fekete; Günter Rote; Nils Schweer; Daria Schymura; Mariano Zelke (CoRR, 2010)

Shortest Paths with Pairwise-Distinct Edge Labels: Finding Biochemical Pathways in Metabolic Networks - Sándor P. Fekete; Tom Kamphans; Michael Stelzer (CoRR, 2010)

No-Break Dynamic Defragmentation of Reconfigurable - Sándor P. Fekete; Tom Kamphans; Nils Schweer; Christopher Tessars; Jan van der Veen; Josef Angermeier; Dirk Koch; Jürgen Teich (CoRR, 2010)

Locked and Unlocked Chains of Planar Shapes. - Robert Connelly; Erik D. Demaine; Martin L. Demaine; Sándor P. Fekete; Stefan Langerman; Joseph S. B. Mitchell; Ares Ribó; Günter Rote (Discret. Comput. Geom., 2010)

Simultaneous Event Execution in Heterogeneous Wireless Sensor Networks. - Tobias Baumgartner 001; Sándor P. Fekete; Winfried Hellmann; Alexander Kröller (J. Networks, 2010)

Empowered by wireless communication: Distributed methods for self-organizing traffic collectives. - Sándor P. Fekete; Christiane Schmidt 001; Axel Wegener; Horst Hellbrück; Stefan Fischer 001 (ACM Trans. Auton. Adapt. Syst., 2010)

Hovering Data Clouds for Organic Computing. - Sebastian Ebers; Sándor P. Fekete; Stefan Fischer 001; Horst Hellbrück; Björn Hendriks; Axel Wegener (Organic Computing, 2011)

Methods for Improving the Flow of Traffic. - Sándor P. Fekete; Björn Hendriks; Christopher Tessars; Axel Wegener; Horst Hellbrück; Stefan Fischer 001; Sebastian Ebers (Organic Computing, 2011)

Exploring and Triangulating a Region by a Swarm of Robots. - Sándor P. Fekete; Tom Kamphans; Alexander Kröller; Joseph S. B. Mitchell; Christiane Schmidt 001 (APPROX-RANDOM, 2011)

Integer point sets minimizing average pairwise L1 distance: What is the optimal shape of a town? - Erik D. Demaine; Sándor P. Fekete; Günter Rote; Nils Schweer; Daria Schymura; Mariano Zelke (Comput. Geom., 2011)

Disruption Management with Rescheduling of Trips and Vehicle Circulations - Sándor P. Fekete; Alexander Kroeller; Martin Lorek; Marc E. Pfetsch (CoRR, 2011)

Distributed algorithm engineering for networks of tiny artifacts. - Tobias Baumgartner 001; Ioannis Chatzigiannakis; Sándor P. Fekete; Stefan Fischer 001; Christos Koninis; Alexander Kröller; Daniela Krüger; Georgios Mylonas; Dennis Pfisterer (Comput. Sci. Rev., 2011)

A survey on relay placement with runtime and approximation guarantees. - Bastian Degener; Sándor P. Fekete; Barbara Kempkes; Friedhelm Meyer auf der Heide (Comput. Sci. Rev., 2011)

Algorithmik an der TU Braunschweig. - Sándor P. Fekete (40 Jahre Informatik @ Braunschweig, 2012)

Flexible experimentation in wireless sensor networks. - Geoff Coulson; Barry Porter; Ioannis Chatzigiannakis; Christos Koninis; Stefan Fischer 001; Dennis Pfisterer; Daniel Bimschas; Torsten Braun; Philipp Hurni; Markus Anwander; Gerald Wagenknecht; Sándor P. Fekete; et al. (Commun. ACM, 2012)

The Complexity of MaxMin Length Triangulation - Sándor P. Fekete (CoRR, 2012)

One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece - Erik D. Demaine; Martin L. Demaine; Sándor P. Fekete; Matthew J. Patitz; Robert T. Schweller; Andrew Winslow; Damien Woods (CoRR, 2012)

Minimum covering with travel cost. - Sándor P. Fekete; Joseph S. B. Mitchell; Christiane Schmidt 001 (J. Comb. Optim., 2012)

Exact solutions and bounds for general art gallery problems. - Alexander Kröller; Tobias Baumgartner 001; Sándor P. Fekete; Christiane Schmidt 001 (ACM J. Exp. Algorithmics, 2012)

Dynamic Defragmentation of Reconfigurable Devices. - Sándor P. Fekete; Tom Kamphans; Nils Schweer; Christopher Tessars; Jan van der Veen; Josef Angermeier; Dirk Koch; Jürgen Teich (ACM Trans. Reconfigurable Technol. Syst., 2012)

Reconfiguring Massive Particle Swarms with Limited, Global Control. - Aaron T. Becker; Erik D. Demaine; Sándor P. Fekete; Golnaz Habibi; James McLurkin (ALGOSENSORS, 2013)

Triangulating unknown environments using robot swarms. - Aaron T. Becker; Sándor P. Fekete; Alexander Kröller; SeoungKyou Lee; James McLurkin; Christiane Schmidt 001 (SoCG, 2013)

Point guards and point clouds: solving general art gallery problems. - Dorit Borrmann; Pedro J. de Rezende; Cid C. de Souza; Sándor P. Fekete; Stephan Friedrichs; Alexander Kröller; Andreas Nüchter; Christiane Schmidt 001; Davi C. Tozoni (SoCG, 2013)

Online Exploration and Triangulation in Orthogonal Polygonal Regions. - Sándor P. Fekete; Sophia Rex; Christiane Schmidt 001 (WALCOM, 2013)

Efficient reconfiguration of processing modules on FPGAs for space instruments. - Sándor P. Fekete; Björn Fiethe; Stephan Friedrichs; Harald Michalik; Christos Orlis (AHS, 2014)

On the Chromatic Art Gallery Problem. - Sándor P. Fekete; Stephan Friedrichs; Michael Hemmer; Joseph S. B. Mitchell; Christiane Schmidt 001 (CCCG, 2014)

One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile. - Erik D. Demaine; Martin L. Demaine; Sándor P. Fekete; Matthew J. Patitz; Robert T. Schweller; Andrew Winslow; Damien Woods (ICALP (1), 2014)

Particle computation: Designing worlds to control robot swarms with only global signals. - Aaron T. Becker; Erik D. Demaine; Sándor P. Fekete; James McLurkin (ICRA, 2014)

Exploration via structured triangulation by a multi-robot system with bearing-only low-resolution sensors. - Seoung Kyou Lee; Aaron T. Becker; Sándor P. Fekete; Alexander Kröller; James McLurkin (ICRA, 2014)

Geodesic topological voronoi tessellations in triangulated environments with multi-robot systems. - SeoungKyou Lee; Sándor P. Fekete; James McLurkin (IROS, 2014)

Online Square Packing with Gravity. - Sándor P. Fekete; Tom Kamphans; Nils Schweer (Algorithmica, 2014)

Complexity of the General Chromatic Art Gallery Problem. - Sándor P. Fekete; Stephan Friedrichs; Michael Hemmer (CoRR, 2014)

Covering Folded Shapes. - Oswin Aichholzer; Greg Aloupis; Erik D. Demaine; Martin L. Demaine; Sándor P. Fekete; Michael Hoffmann 001; Anna Lubiw; Jack Snoeyink; Andrew Winslow (J. Comput. Geom., 2014)

A competitive strategy for distance-aware online shape allocation. - Sándor P. Fekete; Jan-Marc Reinhardt; Nils Schweer (Theor. Comput. Sci., 2014)

Finding Longest Geometric Tours. - Sándor P. Fekete (Gems of Combinatorial Optimization and Graph Algorithms, 2015)

Tilt: The Video - Designing Worlds to Control Robot Swarms with Only Global Signals. - Aaron T. Becker; Erik D. Demaine; Sándor P. Fekete; Hamed Mohtasham Shad; Rose Morris-Wright (SoCG, 2015)

Local policies for efficiently patrolling a triangulated region by a robot swarm. - Daniela Maftuleac; SeoungKyou Lee; Sándor P. Fekete; Aditya Kumar Akash; Alejandro López-Ortiz; James McLurkin (ICRA, 2015)

Particle computation: Device fan-out and binary memory. - Hamed Mohtasham Shad; Rose Morris-Wright; Erik D. Demaine; Sándor P. Fekete; Aaron T. Becker (ICRA, 2015)

Distributed cohesive control for robot swarms: Maintaining good connectivity in the presence of exterior forces. - Dominik Krupke; Maximilian Ernestus; Michael Hemmer; Sándor P. Fekete (IROS, 2015)

A parallel distributed strategy for arraying a scattered robot swarm. - Dominik Krupke; Michael Hemmer; James McLurkin; Yu Zhou 027; Sándor P. Fekete (IROS, 2015)

Size-Dependent Tile Self-Assembly: Constant-Height Rectangles and Stability. - Sándor P. Fekete; Robert T. Schweller; Andrew Winslow (ISAAC, 2015)

Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly. - Sándor P. Fekete; Jacob Hendricks; Matthew J. Patitz; Trent A. Rogers; Robert T. Schweller (SODA, 2015)

Cost-Oblivious Reallocation for Scheduling and Planning. - Michael A. Bender; Martin Farach-Colton; Sándor P. Fekete; Jeremy T. Fineman; Seth Gilbert (SPAA, 2015)

Reallocation Problems in Scheduling. - Michael A. Bender; Martin Farach-Colton; Sándor P. Fekete; Jeremy T. Fineman; Seth Gilbert (Algorithmica, 2015)

Facets for Art Gallery Problems. - Sándor P. Fekete; Stephan Friedrichs; Alexander Kröller; Christiane Schmidt 001 (Algorithmica, 2015)

The minimum backlog problem. - Michael A. Bender; Sándor P. Fekete; Alexander Kröller; Vincenzo Liberatore; Joseph S. B. Mitchell; Valentin Polishchuk; Jukka Suomela (Theor. Comput. Sci., 2015)

Collecting a swarm in a grid environment using shared, global inputs. - Arun V. Mahadev; Dominik Krupke; Jan-Marc Reinhardt; Sándor P. Fekete; Aaron T. Becker (CASE, 2016)

Distributed Object Characterization with Local Sensing by a Multi-robot System. - Golnaz Habibi; Sándor P. Fekete; Zachary Kingston; James McLurkin (DARS, 2016)

Structured triangulation in multi-robot systems: Coverage, patrolling, Voronoi partitions, and geodesic centers. - Seoung Kyou Lee; Sándor P. Fekete; James McLurkin (Int. J. Robotics Res., 2016)

Improved Approximation Algorithms for Relay Placement. - Alon Efrat; Sándor P. Fekete; Joseph S. B. Mitchell; Valentin Polishchuk; Jukka Suomela (ACM Trans. Algorithms, 2016)

Resource-efficient dynamic partial reconfiguration on FPGAs for space instruments. - Alexander Dörflinger; Björn Fiethe; Harald Michalik; Sándor P. Fekete; Phillip Keldenich; Christian Scheffer (AHS, 2017)

Zapping Zika with a Mosquito-Managing Drone: Computing Optimal Flight Patterns with Minimum Turn Cost (Multimedia Contribution). - Aaron T. Becker; Mustapha Debboun; Sándor P. Fekete; Dominik Krupke; An Nguyen (SoCG, 2017)

Mapping and coverage with a particle swarm controlled by uniform inputs. - Arun Mahadev; Dominik Krupke; Sándor P. Fekete; Aaron T. Becker (IROS, 2017)

Three Colors Suffice: Conflict-Free Coloring of Planar Graphs. - Zachary Abel; Victor Alvarez 001; Erik D. Demaine; Sándor P. Fekete; Aman Gour; Adam Hesterberg; Phillip Keldenich; Christian Scheffer (SODA, 2017)

Split Packing: Packing Circles into Triangles with Optimal Worst-Case Density. - Sándor P. Fekete; Sebastian Morr; Christian Scheffer (WADS, 2017)

Connectivity Graphs of Uncertainty Regions. - Erin W. Chambers; Alejandro Erickson; Sándor P. Fekete; Jonathan Lenchner; Jeff Sember; S. Venkatesh 001; Ulrike Stege; Svetlana Stolpner; Christophe Weibel; Sue Whitesides (Algorithmica, 2017)

Online Square-into-Square Packing. - Sándor P. Fekete; Hella-Franziska Hoffmann (Algorithmica, 2017)

Guest Editors' Foreword. - Sándor P. Fekete; Anna Lubiw (Discret. Comput. Geom., 2017)

Lower Bounds for Graph Exploration Using Local Policies. - Aditya Kumar Akash; Sándor P. Fekete; Seoung Kyou Lee; Alejandro López-Ortiz; Daniela Maftuleac; James McLurkin (J. Graph Algorithms Appl., 2017)

Computing nonsimple polygons of minimum perimeter. - Sándor P. Fekete; Andreas Haas; Michael Hemmer; Michael Hoffmann 001; Irina Kostitsyna; Dominik Krupke; Florian Maurer 001; Joseph S. B. Mitchell; Arne Schmidt 001; Christiane Schmidt 001; Julian Troegel (J. Comput. Geom., 2017)

An efficient data structure for dynamic two-dimensional reconfiguration. - Sándor P. Fekete; Jan-Marc Reinhardt; Christian Scheffer (J. Syst. Archit., 2017)

Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271. - Sándor P. Fekete; Andréa W. Richa; Kay Römer; Christian Scheideler (SIGACT News, 2017)

Cost-Oblivious Storage Reallocation. - Michael A. Bender; Martin Farach-Colton; Sándor P. Fekete; Jeremy T. Fineman; Seth Gilbert (ACM Trans. Algorithms, 2017)

New geometric algorithms for fully connected staged self-assembly. - Erik D. Demaine; Sándor P. Fekete; Christian Scheffer; Arne Schmidt 001 (Theor. Comput. Sci., 2017)

Hardware and Software Task Scheduling for ARM-FPGA Platforms. - Alexander Dörflinger; Mark Albers; Johannes Schlatow; Björn Fiethe; Harald Michalik; Phillip Keldenich; Sándor P. Fekete (AHS, 2018)

Coordinated Motion Planning: The Video (Multimedia Exposition). - Aaron T. Becker; Sándor P. Fekete; Phillip Keldenich; Matthias Konitzny; Lillian Lin; Christian Scheffer (SoCG, 2018)

U sing a UAV for Destructive Surveys of Mosquito Population. - An Nguyen; Dominik Krupke; Mary Burbage; Shriya Bhatnagar; Sándor P. Fekete; Aaron T. Becker (ICRA, 2018)

On Designing 2D Discrete Workspaces to Sort or Classify Polynminoes. - Phillip Keldenich; Sheryl Manzoor; Li Huang; Dominik Krupke; Arne Schmidt 001; Sándor P. Fekete; Aaron T. Becker (IROS, 2018)

Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading. - Sándor P. Fekete; Sven von Höveling; Joseph S. B. Mitchell; Christian Rieck; Christian Scheffer; Arne Schmidt 001; James R. Zuber (LATIN, 2018)

Autonomous Vehicles: From Individual Navigation to Challenges of Distributed Swarms (Invited Talk). - Sándor P. Fekete (DISC, 2018)

Connecting a set of circles with minimum sum of radii. - Erin W. Chambers; Sándor P. Fekete; Hella-Franziska Hoffmann; Dimitri Marinakis; Joseph S. B. Mitchell; Srinivasan Venkatesh 001; Ulrike Stege; Sue Whitesides (Comput. Geom., 2018)

Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 18331). - Spring Berman; Sándor P. Fekete; Matthew J. Patitz; Christian Scheideler (Dagstuhl Reports, 2018)

Folding Polyominoes into (Poly)Cubes. - Oswin Aichholzer; Michael Biro; Erik D. Demaine; Martin L. Demaine; David Eppstein; Sándor P. Fekete; Adam Hesterberg; Irina Kostitsyna; Christiane Schmidt 001 (Int. J. Comput. Geom. Appl., 2018)

Conflict-Free Coloring of Intersection Graphs. - Sándor P. Fekete; Phillip Keldenich (Int. J. Comput. Geom. Appl., 2018)

Universal Guard Problems. - Sándor P. Fekete; Qian Li 031; Joseph S. B. Mitchell; Christian Scheffer (Int. J. Comput. Geom. Appl., 2018)

Computing maxmin edge length triangulations. - Sándor P. Fekete; Winfried Hellmann; Michael Hemmer; Arne Schmidt 001; Julian Troegel (J. Comput. Geom., 2018)

Geometric Hitting Set for Segments of Few Orientations. - Sándor P. Fekete; Kan Huang; Joseph S. B. Mitchell; Ojas Parekh; Cynthia A. Phillips (Theory Comput. Syst., 2018)

Efficient Parallel Self-Assembly Under Uniform Control Inputs. - Arne Schmidt 001; Sheryl Manzoor; Li Huang; Aaron T. Becker; Sándor P. Fekete (IEEE Robotics Autom. Lett., 2018)

Conflict-Free Coloring of Graphs. - Zachary Abel; Victor Alvarez 001; Erik D. Demaine; Sándor P. Fekete; Aman Gour; Adam Hesterberg; Phillip Keldenich; Christian Scheffer (SIAM J. Discret. Math., 2018)

Practical Methods for Computing Large Covering Tours and Cycle Covers with Turn Cost. - Sándor P. Fekete; Dominik Krupke (ALENEX, 2019)

Automated Data Retrieval from Large-Scale Distributed Satellite Systems. - Dominik Krupke; Volker Schaus; Andreas Haas; Michael Perk; Jonas Dippel; Benjamin Grzesik; Mohamed Khalil Ben Larbi; Enrico Stoll; Tom Haylock; Harald Konstanski; Kattia Flores Pozo; Mirue Choi; et al. (CASE, 2019)

Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation. - Sándor P. Fekete; Dominik Krupke (CIAC, 2019)

Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition). - Aaron T. Becker; Sándor P. Fekete; Phillip Keldenich; Sebastian Morr; Christian Scheffer (SoCG, 2019)

Online Circle Packing. - Sándor P. Fekete; Sven von Höveling; Christian Scheffer (WADS, 2019)

Connected Assembly and Reconfiguration by Finite Automata. - Sándor P. Fekete; Eike Niehs; Christian Scheffer; Arne Schmidt 001 (CoRR, 2019)

Split Packing: Algorithms for Packing Circles with Optimal Worst-Case Density. - Sándor P. Fekete; Sebastian Morr; Christian Scheffer (Discret. Comput. Geom., 2019)

Particle computation: complexity, algorithms, and logic. - Aaron T. Becker; Erik D. Demaine; Sándor P. Fekete; Jarrett Lonsford; Rose Morris-Wright (Nat. Comput., 2019)

Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch. - Erik D. Demaine; Sándor P. Fekete; Phillip Keldenich; Henk Meijer; Christian Scheffer (SIAM J. Comput., 2019)

Geometric Aspects of Robot Navigation: From Individual Robots to Massive Particle Swarms. - Sándor P. Fekete (Distributed Computing by Mobile Entities, 2019)

Space Ants: Constructing and Reconfiguring Large-Scale Structures with Finite Automata (Media Exposition). - 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 001; et al. (SoCG, 2020)

Coordinated Particle Relocation with Global Signals and Local Friction (Media Exposition). - Victor M. Baez; Aaron T. Becker; Sándor P. Fekete; Arne Schmidt 001 (SoCG, 2020)

How to Make a CG Video (Media Exposition). - Aaron T. Becker; Sándor P. Fekete (SoCG, 2020)

Covering Rectangles by Disks: The Video (Media Exposition). - Sándor P. Fekete; Phillip Keldenich; Christian Scheffer (SoCG, 2020)

Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform, External Forces. - Aaron T. Becker; Sándor P. Fekete; Li Huang; Phillip Keldenich; Linda Kleist; Dominik Krupke; Christian Rieck; Arne Schmidt 001 (ICRA, 2020)

Recognition and Reconfiguration of Lattice-Based Cellular Structures by Simple Robots. - Eike Niehs; Arne Schmidt 001; Christian Scheffer; Daniel E. Biediger; Michael Yannuzzi; Benjamin Jenett; Amira Abdel-Rahman; Kenneth C. Cheung; Aaron T. Becker; Sándor P. Fekete (ICRA, 2020)

Coordinating Swarms of Objects at Extreme Dimensions. - Sándor P. Fekete (IWOCA, 2020)

Probing a Set of Trajectories to Maximize Captured Information. - Sándor P. Fekete; Alexander Hill; Dominik Krupke; Tyler Mayer; Joseph S. B. Mitchell; Ojas Parekh; Cynthia A. Phillips (SEA, 2020)

Tilt Assembly: Algorithms for Micro-factories That Build Objects with Uniform External Forces. - Aaron T. Becker; Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Christian Rieck; Christian Scheffer; Arne Schmidt 001 (Algorithmica, 2020)

Existence and Hardness of Conveyor Belts. - Molly Baird; Sara C. Billey; Erik D. Demaine; Martin L. Demaine; David Eppstein; Sándor P. Fekete; Graham Gordon; Sean Griffin; Joseph S. B. Mitchell; Joshua P. Swanson (Electron. J. Comb., 2020)

Computing Convex Partitions for Point Sets in the Plane: The CG: SHOP Challenge 2020. - Erik D. Demaine; Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Joseph S. B. Mitchell (CoRR, 2020)

Coordinated Particle Relocation Using Finite Static Friction With Boundary Walls. - Arne Schmidt 001; Victor M. Baez; Aaron T. Becker; Sándor P. Fekete (IEEE Robotics Autom. Lett., 2020)

Can You Walk This? Eulerian Tours and IDEA Instructions (Media Exposition). - Aaron T. Becker; Sándor P. Fekete; Matthias Konitzny; Sebastian Morr; Arne Schmidt 001 (SoCG, 2021)

Packing Squares into a Disk with Optimal Worst-Case Density. - Sándor P. Fekete; Vijaykrishna Gurunathan; Kushagra Juneja; Phillip Keldenich; Linda Kleist; Christian Scheffer (SoCG, 2021)

CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata. - Sándor P. Fekete; Robert Gmyr; Sabrina Hugo; Phillip Keldenich; Christian Scheffer; Arne Schmidt 001 (Algorithmica, 2021)

Folding polyominoes with holes into a cube. - 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 001 (Comput. Geom., 2021)

Worst-case optimal squares packing into disks. - Sándor P. Fekete; Vijaykrishna Gurunathan; Kushagra Juneja; Phillip Keldenich; Linda Kleist; Christian Scheffer (J. Comput. Geom., 2021)

Minimum Scan Cover with Angular Transition Costs. - Sándor P. Fekete; Linda Kleist; Dominik Krupke (SIAM J. Discret. Math., 2021)

Space Ants: Episode II - Coordinating Connected Catoms (Media Exposition). - Julien Bourgeois; Sándor P. Fekete; Ramin Kosfeld; Peter Kramer 001; Benoît Piranda; Christian Rieck; Christian Scheffer (SoCG, 2022)

Gathering Physical Particles with a Global Magnetic Field Using Reinforcement Learning. - Matthias Konitzny; Yitong Lu; Julien Leclerc; Sándor P. Fekete; Aaron T. Becker (IROS, 2022)

Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots. - Sándor P. Fekete; Eike Niehs; Christian Scheffer; Arne Schmidt 001 (Algorithmica, 2022)

Robust disease module mining via enumeration of diverse prize-collecting Steiner trees. - Judith Bernett; Dominik Krupke; Sepideh Sadegh; Jan Baumbach; Sándor P. Fekete; Tim Kacprowski; Markus List; David B. Blumenthal (Bioinform., 2022)

Minimum Partition into Plane Subgraphs: The CG: SHOP Challenge 2022. - Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Stefan Schirra (CoRR, 2022)

Cooperative 2D Reconfiguration using Spatio-Temporal Planning and Load Transferring. - Javier Garcia; Michael Yannuzzi; Peter Kramer 001; Christian Rieck; Sándor P. Fekete; Aaron T. Becker (CoRR, 2022)

Minimum Scan Cover and Variants: Theory and Experiments. - Kevin Buchin; Alexander Hill; Sándor P. Fekete; Linda Kleist; Irina Kostitsyna; Dominik Krupke; Roel Lambers; Martijn Struijs (ACM J. Exp. Algorithmics, 2022)

Area-Optimal Simple Polygonalizations: The CG Challenge 2019. - Erik D. Demaine; Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Joseph S. B. Mitchell (ACM J. Exp. Algorithmics, 2022)

Computing Area-Optimal Simple Polygonizations. - Sándor P. Fekete; Andreas Haas; Phillip Keldenich; Michael Perk; Arne Schmidt 001 (ACM J. Exp. Algorithmics, 2022)

Computing Coordinated Motion Plans for Robot Swarms: The CG: SHOP Challenge 2021. - Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Joseph S. B. Mitchell (ACM J. Exp. Algorithmics, 2022)

A Closer Cut: Computing Near-Optimal Lawn Mowing Tours. - Sándor P. Fekete; Dominik Krupke; Michael Perk; Christian Rieck; Christian Scheffer (ALENEX, 2023)

The Lawn Mowing Problem: From Algebra to Algorithms. - Sándor P. Fekete; Dominik Krupke; Michael Perk; Christian Rieck; Christian Scheffer (ESA, 2023)

Parallel Online Algorithms for the Bin Packing Problem. - Sándor P. Fekete; Jonas Grosse-Holz; Phillip Keldenich; Arne Schmidt 001 (Algorithmica, 2023)

Minimum Coverage by Convex Polygons: The CG: SHOP Challenge 2023. - Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Stefan Schirra (CoRR, 2023)

Realistic Runtime Analysis for Quantum Simplex Computation. - Sabrina Ammann; Maximilian Hess; Debora Ramacciotti; Sándor P. Fekete; Paulina L. A. Goedicke; David Gross 003; Andreea Lefterovici; Tobias J. Osborne; Michael Perk; Antonio Rotundo; Shawn E. Skelton; Sebastian Stiller; et al. (CoRR, 2023)

Packing Disks into Disks with Optimal Worst-Case Density. - Sándor P. Fekete; Phillip Keldenich; Christian Scheffer (Discret. Comput. Geom., 2023)

Competitive location problems: balanced facility location and the One-Round Manhattan Voronoi Game. - Thomas Byrne; Sándor P. Fekete; Jörg Kalcsics; Linda Kleist (Ann. Oper. Res., 2023)

Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 23091). - Aaron T. Becker; Sándor P. Fekete; Irina Kostitsyna; Matthew J. Patitz; Damien Woods; Ioannis Chatzigiannakis (Dagstuhl Reports, 2023)

Connected coordinated motion planning with bounded stretch. - Sándor P. Fekete; Phillip Keldenich; Ramin Kosfeld; Christian Rieck; Christian Scheffer (Auton. Agents Multi Agent Syst., 2023)

Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022. - Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Stefan Schirra (ACM J. Exp. Algorithmics, 2023)

Dispersive Vertex Guarding for Simple and Non-Simple Polygons. - Sándor P. Fekete; Joseph S. B. Mitchell; Christian Rieck; Christian Scheffer; Christiane Schmidt 001 (CCCG, 2024)

Reconfiguration of a 2D Structure Using Spatio-Temporal Planning and Load Transferring. - Javier Garcia; Michael Yannuzzi; Peter Kramer 001; Christian Rieck; Sándor P. Fekete; Aaron T. Becker (ICRA, 2024)

Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain. - Sándor P. Fekete; Ramin Kosfeld; Peter Kramer 001; Jonas Neutzner; Christian Rieck; Christian Scheffer (ISAAC, 2024)

Edge Sparsification for Geometric Tour Problems. - Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Eike Niehs (Comput. Geom. Topol., 2024)

Maximum Polygon Packing: The CG: SHOP Challenge 2024. - Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Stefan Schirra (CoRR, 2024)

Sliding Squares in Parallel. - Hugo A. Akitaya; Sándor P. Fekete; Peter Kramer 001; Saba Molaei; Christian Rieck; Frederick Stock; Tobias Wallner (CoRR, 2024)

Worst-Case Optimal Covering of Rectangles by Disks. - Sándor P. Fekete; Utkarsh Gupta; Phillip Keldenich; Sahil Shah; Christian Scheffer (Discret. Comput. Geom., 2024)

What Goes Around Comes Around: Covering Tours and Cycle Covers with Turn Costs. - Sándor P. Fekete; Dominik Krupke (Theory Comput. Syst., 2024)

Exact Algorithms for Minimum Dilation Triangulation. - Phillip-Raphaël Keldenich; Michael Perk; Sándor P. Fekete (Zenodo, 2024)

Efficiently reconfiguring a connected swarm of labeled robots. - Sándor P. Fekete; Peter Kramer 001; Christian Rieck; Christian Scheffer; Arne Schmidt 001 (Auton. Agents Multi Agent Syst., 2024)

Exact Algorithms for Minimum Dilation Triangulation. - Sándor P. Fekete; Phillip Keldenich; Michael Perk (SoCG, 2025)

Drainability and Fillability of Polyominoes in Diverse Models of Global Control. - Sándor P. Fekete; Peter Kramer 001; Jan-Marc Reinhardt; Christian Rieck; Christian Scheffer (ICALP, 2025)

Guarding Offices with Maximum Dispersion. - Sándor P. Fekete; Kai Kobbe; Dominik Krupke; Joseph S. B. Mitchell; Christian Rieck; Christian Scheffer (MFCS, 2025)

Moving Matter: Efficient Reconfiguration of Tile Arrangements by a Single Active Robot. - Aaron T. Becker; Sándor P. Fekete; Jonas Friemel; Ramin Kosfeld; Peter Kramer 001; Harm Kube; Christian Rieck; Christian Scheffer; Arne Schmidt 001 (CoRR, 2025)

Multi-Covering a Point Set by m Disks with Minimum Total Area. - Mariem Guitouni; Chek-Manh Loi; Sándor P. Fekete; Michael Perk; Aaron T. Becker (CoRR, 2025)

Minimum Non-Obtuse Triangulations: The CG:SHOP Challenge 2025. - Sándor P. Fekete; Phillip Keldenich; Dominik Krupke; Stefan Schirra (CoRR, 2025)

Moving Matter: Using a Single, Simple Robot to Reconfigure a Connected Set of Building Blocks. - Javier Garcia; Jonas Friemel; Ramin Kosfeld; Michael Yannuzzi; Peter Kramer 001; Christian Rieck; Christian Scheffer; Arne Schmidt 001; Harm Kube; Daniel Biediger; Sándor P. Fekete; Aaron T. Becker (CoRR, 2025)

How Low Can We Go? Minimizing Interaction Samples for Configurable Systems. - Dominik Michael Krupke; Ahmad Moradi; Michael Perk; Phillip Keldenich; Gabriel Gehrke; Sebastian Krieter; Thomas Thüm; Sándor P. Fekete (ACM Trans. Softw. Eng. Methodol., 2025)