Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSándor P. Fekete
Person information
- affiliation: TU Braunschweig, Institute of Operating Systems and Computer Networks, Germany
- affiliation (former): TU Berlin, Department of Mathematics, Germany
- affiliation (former): University of Cologne, Center for Parallel Computing, Germany
- affiliation (PhD 1992): University of Waterloo, ON, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j106]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)- [i124]Sándor P. Fekete, Phillip Keldenich, Dominik Krupke, Stefan Schirra:
Maximum Polygon Packing: The CG: SHOP Challenge 2024. CoRR abs/2403.16203 (2024) - 2023
- [j105]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) - [j104]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) - [j103]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) - [j102]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) - [j101]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) - [c156]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 - [c155]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 - [i123]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) - [i122]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) - [i121]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) - [i120]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
- [j100]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) - [j99]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) - [j98]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) - [j97]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) - [j96]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) - [j95]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) - [c154]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 - [c153]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 - [c152]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 - [i119]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) - [i118]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) - [i117]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) - [i116]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
- [j94]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) - [j93]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) - [j92]Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer:
Worst-Case Optimal Squares Packing into Disks. J. Comput. Geom. 12(2): 149-175 (2021) - [j91]Sándor P. Fekete, Linda Kleist, Dominik Krupke:
Minimum Scan Cover with Angular Transition Costs. SIAM J. Discret. Math. 35(2): 1337-1355 (2021) - [c151]Sándor P. Fekete, Vijaykrishna Gurunathan, Kushagra Juneja, Phillip Keldenich, Linda Kleist, Christian Scheffer:
Packing Squares into a Disk with Optimal Worst-Case Density. SoCG 2021: 36:1-36:16 - [c150]Aaron T. Becker, Sándor P. Fekete, Matthias Konitzny, Sebastian Morr, Arne Schmidt:
Can You Walk This? Eulerian Tours and IDEA Instructions (Media Exposition). SoCG 2021: 62:1-62:4 - [c149]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 - [c148]Thomas Byrne, Sándor P. Fekete, Jörg Kalcsics, Linda Kleist:
Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game. WALCOM 2021: 103-115 - [c147]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. SEA 2021: 4:1-4:16 - [i115]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) - [i114]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) - [i113]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) - [i112]Sándor P. Fekete, Phillip Keldenich, Ramin Kosfeld, Christian Rieck, Christian Scheffer:
Connected Coordinated Motion Planning with Bounded Stretch. CoRR abs/2109.12381 (2021) - [i111]Sándor P. Fekete, Andreas Haas, Phillip Keldenich, Michael Perk, Arne Schmidt:
Computing Area-Optimal Simple Polygonizations. CoRR abs/2111.05386 (2021) - [i110]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
- [j90]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) - [j89]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:
Existence and Hardness of Conveyor Belts. Electron. J. Comb. 27(4): 4 (2020) - [j88]Arne Schmidt, Victor M. Baez, Aaron T. Becker, Sándor P. Fekete:
Coordinated Particle Relocation Using Finite Static Friction With Boundary Walls. IEEE Robotics Autom. Lett. 5(2): 985-992 (2020) - [c146]Sándor P. Fekete, Eike Niehs, Christian Scheffer, Arne Schmidt:
Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots. ALGOSENSORS 2020: 60-75 - [c145]Sándor P. Fekete, Utkarsh Gupta, Phillip Keldenich, Christian Scheffer, Sahil Shah:
Worst-Case Optimal Covering of Rectangles by Disks. SoCG 2020: 42:1-42:23 - [c144]Sándor P. Fekete, Linda Kleist, Dominik Krupke:
Minimum Scan Cover with Angular Transition Costs. SoCG 2020: 43:1-43:18 - [c143]Victor M. Baez, Aaron T. Becker, Sándor P. Fekete, Arne Schmidt:
Coordinated Particle Relocation with Global Signals and Local Friction (Media Exposition). SoCG 2020: 72:1-72:5 - [c142]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 - [c141]Aaron T. Becker, Sándor P. Fekete:
How to Make a CG Video (Media Exposition). SoCG 2020: 74:1-74:6 - [c140]Sándor P. Fekete, Phillip Keldenich, Christian Scheffer:
Covering Rectangles by Disks: The Video (Media Exposition). SoCG 2020: 75:1-75:4 - [c139]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. ICRA 2020: 2508-2514 - [c138]Eike Niehs, Arne Schmidt, Christian Scheffer, Daniel E. Biediger, Michael Yannuzzi, Benjamin Jenett, Amira Abdel-Rahman, Kenneth C. Cheung, Aaron T. Becker, Sándor P. Fekete:
Recognition and Reconfiguration of Lattice-Based Cellular Structures by Simple Robots. ICRA 2020: 8252-8259 - [c137]Sándor P. Fekete:
Coordinating Swarms of Objects at Extreme Dimensions. IWOCA 2020: 3-13 - [c136]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. SEA 2020: 5:1-5:14 - [i109]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) - [i108]Sándor P. Fekete, Linda Kleist, Dominik Krupke:
Minimum Scan Cover with Angular Transition Costs. CoRR abs/2003.08816 (2020) - [i107]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) - [i106]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) - [i105]Thomas Byrne, Sándor P. Fekete, Jörg Kalcsics, Linda Kleist:
Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game. CoRR abs/2011.13275 (2020)
2010 – 2019
- 2019
- [j87]Sándor P. Fekete, Sebastian Morr, Christian Scheffer:
Split Packing: Algorithms for Packing Circles with Optimal Worst-Case Density. Discret. Comput. Geom. 61(3): 562-594 (2019) - [j86]Aaron T. Becker, Erik D. Demaine, Sándor P. Fekete, Jarrett Lonsford, Rose Morris-Wright:
Particle computation: complexity, algorithms, and logic. Nat. Comput. 18(1): 181-201 (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) - [c135]Sándor P. Fekete, Dominik Krupke:
Practical Methods for Computing Large Covering Tours and Cycle Covers with Turn Cost. ALENEX 2019: 186-198 - [c134]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, Christian Schurig, Sándor P. Fekete:
Automated Data Retrieval from Large-Scale Distributed Satellite Systems. CASE 2019: 1789-1795 - [c133]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. CCCG 2019: 164-170 - [c132]Sándor P. Fekete, Dominik Krupke:
Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation. CIAC 2019: 224-236 - [c131]Sándor P. Fekete, Phillip Keldenich, Christian Scheffer:
Packing Disks into Disks with Optimal Worst-Case Density. SoCG 2019: 35:1-35:19 - [c130]Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Sebastian Morr, Christian Scheffer:
Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition). SoCG 2019: 63:1-63:6 - [c129]Sándor P. Fekete, Sven von Höveling, Christian Scheffer:
Online Circle Packing. WADS 2019: 366-379 - [c128]Sándor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich, Arne Schmidt:
Parallel Online Algorithms for the Bin Packing Problem. WAOA 2019: 106-119 - [p5]Sándor P. Fekete:
Geometric Aspects of Robot Navigation: From Individual Robots to Massive Particle Swarms. Distributed Computing by Mobile Entities 2019: 587-614 - [i104]Sándor P. Fekete, Phillip Keldenich, Christian Scheffer:
Packing Disks into Disks with Optimal Worst-Case Density. CoRR abs/1903.07908 (2019) - [i103]Sándor P. Fekete, Sven von Höveling, Christian Scheffer:
Online Circle Packing. CoRR abs/1905.00612 (2019) - [i102]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:
Existence and hardness of conveyor belts. CoRR abs/1908.07668 (2019) - [i101]Sándor P. Fekete, Eike Niehs, Christian Scheffer, Arne Schmidt:
Connected Assembly and Reconfiguration by Finite Automata. CoRR abs/1909.03880 (2019) - [i100]Sándor P. Fekete, Jonas Grosse-Holz, Phillip Keldenich, Arne Schmidt:
Parallel Online Algorithms for the Bin Packing Problem. CoRR abs/1910.03249 (2019) - [i99]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. CoRR abs/1910.09917 (2019) - 2018
- [j84]Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides:
Connecting a set of circles with minimum sum of radii. Comput. Geom. 68: 62-76 (2018) - [j83]Sándor P. Fekete, Qian Li, Joseph S. B. Mitchell, Christian Scheffer:
Universal Guard Problems. Int. J. Comput. Geom. Appl. 28(2): 129-160 (2018) - [j82]Oswin Aichholzer, Michael Biro, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, Christiane Schmidt:
Folding Polyominoes into (Poly)Cubes. Int. J. Comput. Geom. Appl. 28(3): 197-226 (2018) - [j81]Sándor P. Fekete, Phillip Keldenich:
Conflict-Free Coloring of Intersection Graphs. Int. J. Comput. Geom. Appl. 28(3): 289-307 (2018) - [j80]Sándor P. Fekete, Winfried Hellmann, Michael Hemmer, Arne Schmidt, Julian Troegel:
Computing maxmin edge length triangulations. J. Comput. Geom. 9(1): 1-26 (2018) - [j79]Sándor P. Fekete, Kan Huang, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips:
Geometric Hitting Set for Segments of Few Orientations. Theory Comput. Syst. 62(2): 268-303 (2018) - [j78]Arne Schmidt, Sheryl Manzoor, Li Huang, Aaron T. Becker, Sándor P. Fekete:
Efficient Parallel Self-Assembly Under Uniform Control Inputs. IEEE Robotics Autom. Lett. 3(4): 3521-3528 (2018) - [j77]Zachary Abel, Victor Alvarez, Erik D. Demaine, Sándor P. Fekete, Aman Gour, Adam Hesterberg, Phillip Keldenich, Christian Scheffer:
Conflict-Free Coloring of Graphs. SIAM J. Discret. Math. 32(4): 2675-2702 (2018) - [c127]Alexander Dörflinger, Mark Albers, Johannes Schlatow, Björn Fiethe, Harald Michalik, Phillip Keldenich, Sándor P. Fekete:
Hardware and Software Task Scheduling for ARM-FPGA Platforms. AHS 2018: 66-73 - [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 - [c125]Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Matthias Konitzny, Lillian Lin, Christian Scheffer:
Coordinated Motion Planning: The Video (Multimedia Exposition). SoCG 2018: 74:1-74:6 - [c124]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 - [c123]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 - [c122]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. LATIN 2018: 448-460 - [c121]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 - [c120]Sándor P. Fekete:
Autonomous Vehicles: From Individual Navigation to Challenges of Distributed Swarms (Invited Talk). DISC 2018: 1:1-1:1 - [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) - [i97]Arne Schmidt, Sheryl Manzoor, Li Huang, Aaron T. Becker, Sándor P. Fekete:
Efficient Parallel Self-Assembly Under Uniform Control Inputs. CoRR abs/1807.01584 (2018) - [i96]Sándor P. Fekete, Dominik Krupke:
Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation. CoRR abs/1808.04417 (2018) - [i95]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) - [i94]Spring Berman, Sándor P. Fekete, Matthew J. Patitz, Christian Scheideler:
Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 18331). Dagstuhl Reports 8(8): 48-66 (2018) - 2017
- [j76]Sándor P. Fekete, Hella-Franziska Hoffmann:
Online Square-into-Square Packing. Algorithmica 77(3): 867-901 (2017) - [j75]Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, S. Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides:
Connectivity Graphs of Uncertainty Regions. Algorithmica 78(3): 990-1019 (2017) - [j74]Sándor P. Fekete, Anna Lubiw:
Guest Editors' Foreword. Discret. Comput. Geom. 58(4): 755-756 (2017) - [j73]Sándor P. Fekete, Andréa W. Richa, Kay Römer, Christian Scheideler:
Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271. Bull. EATCS 122 (2017) - [j72]Aditya Kumar Akash, Sándor P. Fekete, Seoung Kyou Lee, Alejandro López-Ortiz, Daniela Maftuleac, James McLurkin:
Lower Bounds for Graph Exploration Using Local Policies. J. Graph Algorithms Appl. 21(3): 371-387 (2017) - [j71]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. J. Comput. Geom. 8(1): 340-365 (2017) - [j70]Sándor P. Fekete, Anna Lubiw:
Guest editors' foreword. J. Comput. Geom. 8(2): 1 (2017) - [j69]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) - [j68]Sándor P. Fekete, Andréa W. Richa, Kay Römer, Christian Scheideler:
Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271. SIGACT News 48(2): 87-94 (2017) - [j67]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-Oblivious Storage Reallocation. ACM Trans. Algorithms 13(3): 38:1-38:20 (2017) - [j66]Erik D. Demaine, Sándor P. Fekete, Christian Scheffer, Arne Schmidt:
New geometric algorithms for fully connected staged self-assembly. Theor. Comput. Sci. 671: 4-18 (2017) - [c119]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 - [c118]Aaron T. Becker, Mustapha Debboun, Sándor P. Fekete, Dominik Krupke, An Nguyen:
Zapping Zika with a Mosquito-Managing Drone: Computing Optimal Flight Patterns with Minimum Turn Cost (Multimedia Contribution). SoCG 2017: 62:1-62:5 - [c117]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 - [c116]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. ISAAC 2017: 11:1-11:13 - [c115]Sándor P. Fekete, Phillip Keldenich:
Conflict-Free Coloring of Intersection Graphs. ISAAC 2017: 31:1-31:12 - [c114]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 - [c113]Sándor P. Fekete, Sebastian Morr, Christian Scheffer:
Split Packing: Packing Circles into Triangles with Optimal Worst-Case Density. WADS 2017: 373-384 - [e6]Sándor P. Fekete, Vijaya Ramachandran:
Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments, ALENEX 2017, Barcelona, Spain, Hotel Porta Fira, January 17-18, 2017. SIAM 2017, ISBN 978-1-61197-476-8 [contents] - [i93]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) - [i92]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) - [i91]Sándor P. Fekete, Jan-Marc Reinhardt, Christian Scheffer:
An Efficient Data Structure for Dynamic Two-Dimensional Reconfiguration. CoRR abs/1702.07696 (2017) - [i90]Sándor P. Fekete, Sebastian Morr, Christian Scheffer:
Split Packing: Algorithms for Packing Circles with Optimal Worst-Case Density. CoRR abs/1705.00924 (2017) - [i89]Sándor P. Fekete, Phillip Keldenich:
Conflict-Free Coloring of Intersection Graphs. CoRR abs/1709.03876 (2017) - [i88]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) - [i87]Aaron T. Becker, Erik D. Demaine, Sándor P. Fekete, Jarrett Lonsford, Rose Morris-Wright:
Particle Computation: Complexity, Algorithms, and Logic. CoRR abs/1712.01197 (2017) - [i86]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) - [i85]Oswin Aichholzer, Michael Biro, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, Christiane Schmidt:
Folding Polyominoes into (Poly)Cubes. CoRR abs/1712.09317 (2017) - 2016
- [j65]Seoung Kyou Lee, Sándor P. Fekete, James McLurkin:
Structured triangulation in multi-robot systems: Coverage, patrolling, Voronoi partitions, and geodesic centers. Int. J. Robotics Res. 35(10): 1234-1260 (2016) - [j64]Alon Efrat, Sándor P. Fekete, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela:
Improved Approximation Algorithms for Relay Placement. ACM Trans. Algorithms 12(2): 20:1-20:28 (2016) - [c112]Sándor P. Fekete, Jan-Marc Reinhardt, Christian Scheffer:
An Efficient Data Structure for Dynamic Two-Dimensional Reconfiguration. ARCS 2016: 306-318 - [c111]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 - [c110]Golnaz Habibi, Sándor P. Fekete, Zachary K. Kingston, James McLurkin:
Distributed Object Characterization with Local Sensing by a Multi-robot System. DARS 2016: 205-218 - [c109]Sándor P. Fekete, Qian Li, Joseph S. B. Mitchell, Christian Scheffer:
Universal Guard Problems. ISAAC 2016: 32:1-32:13 - [c108]Aditya Kumar Akash, Sándor P. Fekete, Seoung Kyou Lee, Alejandro López-Ortiz, Daniela Maftuleac, James McLurkin:
Lower Bounds for Graph Exploration Using Local Policies. WALCOM 2016: 55-67 - [c107]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. SEA 2016: 134-149 - [e5]Sándor P. Fekete, Anna Lubiw:
32nd International Symposium on Computational Geometry, SoCG 2016, June 14-18, 2016, Boston, MA, USA. LIPIcs 51, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2016, ISBN 978-3-95977-009-5 [contents] - [i84]Aditya Kumar Akash, Sándor P. Fekete, SeoungKyou Lee, Alejandro López-Ortiz, Daniela Maftuleac, James McLurkin:
Lower Bounds for Graph Exploration Using Local Policies. CoRR abs/1603.05944 (2016) - [i83]Sándor P. Fekete, Kan Huang, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips:
Geometric Hitting Set for Segments of Few Orientations. CoRR abs/1603.06077 (2016) - [i82]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) - [i81]Sándor P. Fekete, Qian Li, Joseph S. B. Mitchell, Christian Scheffer:
Universal Guard Problems. CoRR abs/1611.08315 (2016) - [i80]Sándor P. Fekete, Andréa W. Richa, Kay Römer, Christian Scheideler:
Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 16271). Dagstuhl Reports 6(7): 1-14 (2016) - 2015
- [j63]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Reallocation Problems in Scheduling. Algorithmica 73(2): 389-409 (2015) - [j62]Sándor P. Fekete, Stephan Friedrichs, Alexander Kröller, Christiane Schmidt:
Facets for Art Gallery Problems. Algorithmica 73(2): 411-440 (2015) - [j61]Michael A. Bender, Sándor P. Fekete, Alexander Kröller, Vincenzo Liberatore, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela:
The minimum backlog problem. Theor. Comput. Sci. 605: 51-61 (2015) - [c106]Sándor P. Fekete, Winfried Hellmann, Michael Hemmer, Arne Schmidt, Julian Troegel:
Computing MaxMin Edge Length Triangulations. ALENEX 2015: 55-69 - [c105]Oswin Aichholzer, Michael Biro, Erik D. Demaine, Martin L. Demaine, David Eppstein, Sándor P. Fekete, Adam Hesterberg, Irina Kostitsyna, Christiane Schmidt:
Folding Polyominoes into (Poly)Cubes. CCCG 2015 - [c104]Aaron T. Becker, Erik D. Demaine, Sándor P. Fekete, Hamed Mohtasham Shad, Rose Morris-Wright:
Tilt: The Video - Designing Worlds to Control Robot Swarms with Only Global Signals. SoCG 2015: 16-18 - [c103]Erik D. Demaine, Sándor P. Fekete, Christian Scheffer, Arne Schmidt:
New Geometric Algorithms for Fully Connected Staged Self-Assembly. DNA 2015: 104-116 - [c102]Daniela Maftuleac, SeoungKyou Lee, Sándor P. Fekete, Aditya Kumar Akash, Alejandro López-Ortiz, James McLurkin:
Local policies for efficiently patrolling a triangulated region by a robot swarm. ICRA 2015: 1809-1815 - [c101]Hamed Mohtasham Shad, Rose Morris-Wright, Erik D. Demaine, Sándor P. Fekete, Aaron T. Becker:
Particle computation: Device fan-out and binary memory. ICRA 2015: 5384-5389 - [c100]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 - [c99]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 - [c98]Sándor P. Fekete, Robert T. Schweller, Andrew Winslow:
Size-Dependent Tile Self-Assembly: Constant-Height Rectangles and Stability. ISAAC 2015: 296-306 - [c97]Sándor P. Fekete, Jacob Hendricks, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller:
Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly. SODA 2015: 148-167 - [c96]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-Oblivious Reallocation for Scheduling and Planning. SPAA 2015: 143-154 - [c95]Sándor P. Fekete, Kan Huang, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips:
Geometric Hitting Set for Segments of Few Orientations. WAOA 2015: 145-157 - [p4]Sándor P. Fekete:
Finding Longest Geometric Tours. Gems of Combinatorial Optimization and Graph Algorithms 2015: 29-36 - [e4]Jie Gao, Alon Efrat, Sándor P. Fekete, Yanyong Zhang:
Algorithms for Sensor Systems - 10th International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics, ALGOSENSORS 2014, Wroclaw, Poland, September 12, 2014, Revised Selected Papers. Lecture Notes in Computer Science 8847, Springer 2015, ISBN 978-3-662-46017-7 [contents] - [i79]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) - [i78]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) - [i77]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) - [i76]Sándor P. Fekete, Robert T. Schweller, Andrew Winslow:
Size-Dependent Tile Self-Assembly: Constant-Height Rectangles and Stability. CoRR abs/1509.06898 (2015) - [i75]Alon Efrat, Sándor P. Fekete, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela:
Improved Approximation Algorithms for Relay Placement. CoRR abs/1511.02525 (2015) - 2014
- [j60]Sándor P. Fekete, Tom Kamphans, Nils Schweer:
Online Square Packing with Gravity. Algorithmica 68(4): 1019-1044 (2014) - [j59]Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow:
Covering Folded Shapes. J. Comput. Geom. 5(1): 150-167 (2014) - [j58]Sándor P. Fekete, Jan-Marc Reinhardt, Nils Schweer:
A competitive strategy for distance-aware online shape allocation. Theor. Comput. Sci. 555: 43-54 (2014) - [c94]Sándor P. Fekete, Björn Fiethe, Stephan Friedrichs, Harald Michalik, Christos Orlis:
Efficient reconfiguration of processing modules on FPGAs for space instruments. AHS 2014: 15-22 - [c93]Sándor P. Fekete, Stephan Friedrichs, Michael Hemmer, Joseph S. B. Mitchell, Christiane Schmidt:
On the Chromatic Art Gallery Problem. CCCG 2014 - [c92]Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Matthew J. Patitz, Robert T. Schweller, Andrew Winslow, Damien Woods:
One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile. ICALP (1) 2014: 368-379 - [c91]Seoung Kyou Lee, Aaron T. Becker, Sándor P. Fekete, Alexander Kröller, James McLurkin:
Exploration via structured triangulation by a multi-robot system with bearing-only low-resolution sensors. ICRA 2014: 2150-2157 - [c90]Aaron T. Becker, Erik D. Demaine, Sándor P. Fekete, James McLurkin:
Particle computation: Designing worlds to control robot swarms with only global signals. ICRA 2014: 6751-6756 - [c89]SeoungKyou Lee, Sándor P. Fekete, James McLurkin:
Geodesic topological voronoi tessellations in triangulated environments with multi-robot systems. IROS 2014: 3858-3865 - [c88]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-oblivious storage reallocation. PODS 2014: 278-288 - [i74]SeoungKyou Lee, Aaron T. Becker, Sándor P. Fekete, Alexander Kröller, James McLurkin:
Exploration via Structured Triangulation by a Multi-Robot System with Bearing-Only Low-Resolution Sensors. CoRR abs/1402.0400 (2014) - [i73]Aaron T. Becker, Erik D. Demaine, Sándor P. Fekete, James McLurkin:
Particle Computation: Designing Worlds to Control Robot Swarms with only Global Signals. CoRR abs/1402.3749 (2014) - [i72]Sándor P. Fekete, Stephan Friedrichs, Michael Hemmer:
Complexity of the General Chromatic Art Gallery Problem. CoRR abs/1403.2972 (2014) - [i71]Sándor P. Fekete, Hella-Franziska Hoffmann:
Online Square-into-Square Packing. CoRR abs/1403.5665 (2014) - [i70]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Cost-oblivious storage reallocation. CoRR abs/1404.2019 (2014) - [i69]Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow:
Covering Folded Shapes. CoRR abs/1405.2378 (2014) - [i68]Sándor P. Fekete, Jacob Hendricks, Matthew J. Patitz, Trent A. Rogers, Robert T. Schweller:
Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly. CoRR abs/1408.3351 (2014) - [i67]Daniela Maftuleac, SeoungKyou Lee, Sándor P. Fekete, Aditya Kumar Akash, Alejandro López-Ortiz, James McLurkin:
Local Policies for Efficiently Patrolling a Triangulated Region by a Robot Swarm. CoRR abs/1410.2295 (2014) - 2013
- [c87]Aaron T. Becker, Erik D. Demaine, Sándor P. Fekete, Golnaz Habibi, James McLurkin:
Reconfiguring Massive Particle Swarms with Limited, Global Control. ALGOSENSORS 2013: 51-66 - [c86]Sándor P. Fekete, Hella-Franziska Hoffmann:
Online Square-into-Square Packing. APPROX-RANDOM 2013: 126-141 - [c85]Oswin Aichholzer, Greg Aloupis, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Michael Hoffmann, Anna Lubiw, Jack Snoeyink, Andrew Winslow:
Covering Folded Shapes. CCCG 2013 - [c84]Sándor P. Fekete, Stephan Friedrichs, Alexander Kröller, Christiane Schmidt:
Facets for Art Gallery Problems. COCOON 2013: 208-220 - [c83]Aaron T. Becker, Sándor P. Fekete, Alexander Kröller, SeoungKyou Lee, James McLurkin, Christiane Schmidt:
Triangulating unknown environments using robot swarms. SoCG 2013: 345-346 - [c82]Dorit Borrmann, Pedro J. de Rezende, Cid C. de Souza, Sándor P. Fekete, Stephan Friedrichs, Alexander Kröller, Andreas Nüchter, Christiane Schmidt, Davi C. Tozoni:
Point guards and point clouds: solving general art gallery problems. SoCG 2013: 347-348 - [c81]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Reallocation problems in scheduling. SPAA 2013: 271-279 - [c80]Sándor P. Fekete, Sophia Rex, Christiane Schmidt:
Online Exploration and Triangulation in Orthogonal Polygonal Regions. WALCOM 2013: 29-40 - [c79]Sándor P. Fekete, Nils Schweer, Jan-Marc Reinhardt:
A Competitive Strategy for Distance-Aware Online Shape Allocation. WALCOM 2013: 41-52 - [i66]Sándor P. Fekete, Nils Schweer, Jan-Marc Reinhardt:
A Competitive Strategy for Distance-Aware Online Shape Allocation. CoRR abs/1304.5971 (2013) - [i65]Michael A. Bender, Martin Farach-Colton, Sándor P. Fekete, Jeremy T. Fineman, Seth Gilbert:
Reallocation Problems in Scheduling. CoRR abs/1305.6555 (2013) - [i64]Sándor P. Fekete, Stephan Friedrichs, Alexander Kröller, Christiane Schmidt:
Facets for Art Gallery Problems. CoRR abs/1308.4670 (2013) - 2012
- [j57]Geoff Coulson, Barry Porter, Ioannis Chatzigiannakis, Christos Koninis, Stefan Fischer, Dennis Pfisterer, Daniel Bimschas, Torsten Braun, Philipp Hurni, Markus Anwander, Gerald Wagenknecht, Sándor P. Fekete, Alexander Kröller, Tobias Baumgartner:
Flexible experimentation in wireless sensor networks. Commun. ACM 55(1): 82-90 (2012) - [j56]Sándor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt:
Minimum covering with travel cost. J. Comb. Optim. 24(1): 32-51 (2012) - [j55]Alexander Kröller, Tobias Baumgartner, Sándor P. Fekete, Christiane Schmidt:
Exact solutions and bounds for general art gallery problems. ACM J. Exp. Algorithmics 17(1) (2012) - [j54]Sándor P. Fekete, Tom Kamphans, Nils Schweer, Christopher Tessars, Jan van der Veen, Josef Angermeier, Dirk Koch, Jürgen Teich:
Dynamic Defragmentation of Reconfigurable Devices. ACM Trans. Reconfigurable Technol. Syst. 5(2): 8:1-8:20 (2012) - [c78]Sándor P. Fekete:
Algorithmik an der TU Braunschweig. 40 Jahre Informatik @ Braunschweig 2012: 156-163 - [i63]Sándor P. Fekete:
The Complexity of MaxMin Length Triangulation. CoRR abs/1208.0202 (2012) - [i62]Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Matthew J. Patitz, Robert T. Schweller, Andrew Winslow, Damien Woods:
One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece. CoRR abs/1212.4756 (2012) - 2011
- [j53]Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke:
Integer point sets minimizing average pairwise L1 distance: What is the optimal shape of a town? Comput. Geom. 44(2): 82-94 (2011) - [j52]Bastian Degener, Sándor P. Fekete, Barbara Kempkes, Friedhelm Meyer auf der Heide:
A survey on relay placement with runtime and approximation guarantees. Comput. Sci. Rev. 5(1): 57-68 (2011) - [j51]Tobias Baumgartner, Ioannis Chatzigiannakis, Sándor P. Fekete, Stefan Fischer, Christos Koninis, Alexander Kröller, Daniela Krüger, Georgios Mylonas, Dennis Pfisterer:
Distributed algorithm engineering for networks of tiny artifacts. Comput. Sci. Rev. 5(1): 85-102 (2011) - [c77]Sándor P. Fekete, Tom Kamphans, Alexander Kröller, Joseph S. B. Mitchell, Christiane Schmidt:
Exploring and Triangulating a Region by a Swarm of Robots. APPROX-RANDOM 2011: 206-217 - [c76]Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides:
Connecting a Set of Circles with Minimum Sum of Radii. WADS 2011: 183-194 - [p3]Sebastian Ebers, Sándor P. Fekete, Stefan Fischer, Horst Hellbrück, Björn Hendriks, Axel Wegener:
Hovering Data Clouds for Organic Computing. Organic Computing 2011: 221-234 - [p2]Sándor P. Fekete, Björn Hendriks, Christopher Tessars, Axel Wegener, Horst Hellbrück, Stefan Fischer, Sebastian Ebers:
Methods for Improving the Flow of Traffic. Organic Computing 2011: 447-460 - [i61]Sándor P. Fekete, Alexander Kroeller, Martin Lorek, Marc E. Pfetsch:
Disruption Management with Rescheduling of Trips and Vehicle Circulations. CoRR abs/1101.2123 (2011) - [i60]Sándor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt:
Minimum Covering with Travel Cost. CoRR abs/1101.2360 (2011) - [i59]Tobias Baumgartner, Ioannis Chatzigiannakis, Sándor P. Fekete, Christos Koninis, Alexander Kröller, Apostolos Pyrgelis:
Wiselib: A Generic Algorithm Library for Heterogeneous Sensor Networks. CoRR abs/1101.3067 (2011) - [i58]Michael A. Bender, Sándor P. Fekete, Tom Kamphans, Nils Schweer:
Maintaining Arrays of Contiguous Objects. CoRR abs/1101.5407 (2011) - [i57]Erin W. Chambers, Sándor P. Fekete, Hella-Franziska Hoffmann, Dimitri Marinakis, Joseph S. B. Mitchell, Srinivasan Venkatesh, Ulrike Stege, Sue Whitesides:
Connecting a Set of Circles with Minimum Sum of Radii. CoRR abs/1105.0791 (2011) - 2010
- [j50]Sándor P. Fekete, Christiane Schmidt:
Polygon exploration with time-discrete vision. Comput. Geom. 43(2): 148-168 (2010) - [j49]Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote:
Locked and Unlocked Chains of Planar Shapes. Discret. Comput. Geom. 44(2): 439-462 (2010) - [j48]Tobias Baumgartner, Sándor P. Fekete, Winfried Hellmann, Alexander Kröller:
Simultaneous Event Execution in Heterogeneous Wireless Sensor Networks. J. Networks 5(10): 1221-1226 (2010) - [j47]Sándor P. Fekete, Christiane Schmidt, Axel Wegener, Horst Hellbrück, Stefan Fischer:
Empowered by wireless communication: Distributed methods for self-organizing traffic collectives. ACM Trans. Auton. Adapt. Syst. 5(3): 11:1-11:30 (2010) - [c75]Tobias Baumgartner, Sándor P. Fekete, Alexander Kröller, Christiane Schmidt:
Exact Solutions and Bounds for General Art Gallery Problems. ALENEX 2010: 11-22 - [c74]Sándor P. Fekete, Chris Gray, Alexander Kröller:
Evacuation of Rectilinear Polygons. COCOA (1) 2010: 21-30 - [c73]Tobias Baumgartner, Ioannis Chatzigiannakis, Sándor P. Fekete, Christos Koninis, Alexander Kröller, Apostolos Pyrgelis:
Wiselib: A Generic Algorithm Library for Heterogeneous Sensor Networks. EWSN 2010: 162-177 - [c72]Josef Angermeier, Sándor P. Fekete, Tom Kamphans, Nils Schweer, Jürgen Teich:
Virtual area management: Multitasking on dynamically partially reconfigurable devices. IPDPS Workshops 2010: 1-4 - [c71]Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Srinivasan Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides:
Connectivity Graphs of Uncertainty Regions. ISAAC (2) 2010: 434-445 - [c70]Hugo Hernández, Maria J. Blesa, Christian Blum, Tobias Baumgartner, Sándor P. Fekete, Alexander Kröller:
A Protocol for Self-Synchronized Duty-Cycling in Sensor Networks: Generic Implementation in Wiselib. MSN 2010: 134-139 - [c69]Tobias Baumgartner, Sándor P. Fekete, Tom Kamphans, Alexander Kröller, Max Pagel:
Hallway Monitoring: Distributed Data Processing with Wireless Sensor Networks. REALWSN 2010: 94-105 - [c68]Tobias Baumgartner, Daniel Bimschas, Sándor P. Fekete, Stefan Fischer, Alexander Kröller, Max Pagel, Dennis Pfisterer:
Demo Abstract: Bridging the Gap between Simulated Sensor Nodes and the Real World. REALWSN 2010: 174-177 - [c67]Daniel Bimschas, Sándor P. Fekete, Stefan Fischer, Horst Hellbrück, Alexander Kröller, Richard Mietz, Max Pagel, Dennis Pfisterer, Kay Römer, Torsten Teubler:
Real-World G-Lab: Integrating Wireless Sensor Networks with the Future Internet. TRIDENTCOM 2010: 577-579 - [c66]Daniel Bimschas, Maick Danckwardt, Dennis Pfisterer, Stefan Fischer, Tobias Baumgartner, Alexander Kröller, Sándor P. Fekete:
Topology Virtualization for Wireless Sensor Network Testbeds. TRIDENTCOM 2010: 632-634 - [p1]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:
ReCoNodes - Optimization Methods for Module Scheduling and Placement on Reconfigurable Hardware Devices. Dynamically Reconfigurable Systems 2010: 199-221 - [i56]Josef Angermeier, Sándor P. Fekete, Tom Kamphans, Nils Schweer, Jürgen Teich:
Maintaining Virtual Areas on FPGAs using Strip Packing with Delays. CoRR abs/1001.4493 (2010) - [i55]Sándor P. Fekete, Christiane Schmidt, Axel Wegener, Horst Hellbrück, Stefan Fischer:
Empowered by Wireless Communication: Self-Organizing Traffic Collectives. CoRR abs/1005.0675 (2010) - [i54]Erik D. Demaine, Sándor P. Fekete, Robert J. Lang:
Circle Packing for Origami Design Is Hard. CoRR abs/1008.1224 (2010) - [i53]Sándor P. Fekete, Chris Gray, Alexander Kroeller:
Evacuation of rectilinear polygons. CoRR abs/1008.4420 (2010) - [i52]Erin W. Chambers, Alejandro Erickson, Sándor P. Fekete, Jonathan Lenchner, Jeff Sember, Srinivasan Venkatesh, Ulrike Stege, Svetlana Stolpner, Christophe Weibel, Sue Whitesides:
Connectivity graphs of uncertainty regions. CoRR abs/1009.3469 (2010) - [i51]Tobias Baumgartner, Sándor P. Fekete, Tom Kamphans, Alexander Kroeller, Max Pagel:
Hallway Monitoring: Distributed Data Processing with Wireless Sensor Networks. CoRR abs/1009.4870 (2010) - [i50]Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke:
Integer Point Sets Minimizing Average Pairwise L1-Distance: What is the Optimal Shape of a Town? CoRR abs/1009.5628 (2010) - [i49]Tobias Baumgartner, Sándor P. Fekete, Winfried Hellmann, Alexander Kroeller:
Simultaneous Event Execution in Heterogeneous Wireless Sensor Networks. CoRR abs/1009.5853 (2010) - [i48]Hugo Hernández, Tobias Baumgartner, Maria J. Blesa, Christian Blum, Alexander Kröller, Sándor P. Fekete:
A Protocol for Self-Synchronized Duty-Cycling in Sensor Networks: Generic Implementation in Wiselib. CoRR abs/1010.4385 (2010) - [i47]Sándor P. Fekete, Tom Kamphans, Nils Schweer:
Online Square Packing. CoRR abs/1010.4502 (2010) - [i46]Sándor P. Fekete, Tom Kamphans, Michael Stelzer:
Shortest Paths with Pairwise-Distinct Edge Labels: Finding Biochemical Pathways in Metabolic Networks. CoRR abs/1012.5024 (2010) - [i45]Sándor P. Fekete, Tom Kamphans, Nils Schweer, Christopher Tessars, Jan van der Veen, Josef Angermeier, Dirk Koch, Jürgen Teich:
No-Break Dynamic Defragmentation of Reconfigurable. CoRR abs/1012.5330 (2010)
2000 – 2009
- 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) - [j45]Janina A. Brenner, Sándor P. Fekete, Jan van der Veen:
A minimization version of a directed subgraph homeomorphism problem. Math. Methods Oper. Res. 69(2): 281-296 (2009) - [c65]Erik D. Demaine, Sándor P. Fekete, Günter Rote, Nils Schweer, Daria Schymura, Mariano Zelke:
Integer Point Sets Minimizing Average Pairwise l1 Distance: What is the Optimal Shape of a Town? CCCG 2009: 145-148 - [c64]Sándor P. Fekete, Dietmar Fey, Marcus Komann, Alexander Kröller, Marc Reichenbach, Christiane Schmidt:
Distributed vision with smart pixels. SCG 2009: 257-266 - [c63]Alexander Kröller, Dennis Pfisterer, Sándor P. Fekete, Stefan Fischer:
Algorithms and Simulation Methods for Topology-Aware Sensor Networks. Algorithmics of Large and Complex Networks 2009: 380-400 - [c62]Michael A. Bender, Sándor P. Fekete, Tom Kamphans, Nils Schweer:
Maintaining Arrays of Contiguous Objects. FCT 2009: 14-25 - [c61]Sándor P. Fekete, Joseph S. B. Mitchell, Christiane Schmidt:
Minimum Covering with Travel Cost. ISAAC 2009: 393-402 - [c60]Axel Wegener, Horst Hellbrück, Stefan Fischer, Björn Hendriks, Christiane Schmidt, Sándor P. Fekete:
Designing a Decentralized Traffic Information System - AutoNomos. KiVS 2009: 309-315 - [c59]Tobias Baumgartner, Sándor P. Fekete, Winfried Hellmann, Alexander Kröller:
Flash Mob Organization in Heterogeneous Wireless Sensor Networks. NTMS 2009: 1-4 - [c58]Ioannis Chatzigiannakis, Shlomi Dolev, Sándor P. Fekete, Othon Michail, Paul G. Spirakis:
Not All Fair Probabilistic Schedulers Are Equivalent. OPODIS 2009: 33-47 - [c57]Tobias Baumgartner, Sándor P. Fekete, Alexander Kröller:
Hallway monitoring with sensor networks. SenSys 2009: 331-332 - [c56]Sándor P. Fekete, Tom Kamphans, Nils Schweer:
Online Square Packing. WADS 2009: 302-314 - [e3]Sándor P. Fekete, Stefan Fischer, Martin A. Riedmiller, Subhash Suri:
Algorithmic Methods for Distributed Cooperative Systems, 06.09. - 11.09.2009. Dagstuhl Seminar Proceedings 09371, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [i44]Ioannis Chatzigiannakis, Shlomi Dolev, Sándor P. Fekete, Othon Michail, Paul G. Spirakis:
On the Fairness of Probabilistic Schedulers for Population Protocols. Algorithmic Methods for Distributed Cooperative Systems 2009 - [i43]Sándor P. Fekete, Stefan Fischer, Martin A. Riedmiller, Subhash Suri:
09371 Abstracts Collection - Algorithmic Methods for Distributed Cooperative Systems. Algorithmic Methods for Distributed Cooperative Systems 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, Henk Meijer:
Minimizing the Stabbing Number of Matchings, Trees, and Triangulations. Discret. Comput. Geom. 40(4): 595-621 (2008) - [j42]Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Mashhood Ishaque, Eynat Rafalin, Robert T. Schweller, Diane L. Souvaine:
Staged self-assembly: nanomanufacture of arbitrary shapes with O (1) glues. Nat. Comput. 7(3): 347-370 (2008) - [j41]Sándor P. Fekete, Jan van der Veen, Ali Ahmadinia, Diana Göhringer, Mateusz Majer, Jürgen Teich:
Offline and Online Aspects of Defragmenting the Module Layout of a Partially Reconfigurable Device. IEEE Trans. Very Large Scale Integr. Syst. 16(9): 1210-1219 (2008) - [c55]Marcus Komann, Alexander Kröller, Christiane Schmidt, Dietmar Fey, Sándor P. Fekete:
Emergent algorithms for centroid and orientation detection in high-performance embedded cameras. Conf. Computing Frontiers 2008: 221-230 - [c54]Alon Efrat, Sándor P. Fekete, Poornananda R. Gaddehosur, Joseph S. B. Mitchell, Valentin Polishchuk, Jukka Suomela:
Improved Approximation Algorithms for Relay Placement. ESA 2008: 356-367 - [c53]Sándor P. Fekete, Tom Kamphans, Nils Schweer, Christopher Tessars, Jan van der Veen, Josef Angermeier, Dirk Koch, Jürgen Teich:
No-break dynamic defragmentation of reconfigurable devices. FPL 2008: 113-118 - [c52]Sándor P. Fekete, Alexander Hall, Ekkehard Köhler, Alexander Kröller:
The Maximum Energy-Constrained Dynamic Flow Problem. SWAT 2008: 114-126 - [e2]Sándor P. Fekete:
Algorithmic Aspects of Wireless Sensor Networks, Fourth International Workshop, ALGOSENSORS 2008, Reykjavik, Iceland, July 2008. Revised Selected Papers. Lecture Notes in Computer Science 5389, Springer 2008, ISBN 978-3-540-92861-4 [contents] - [i42]Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Mashhood Ishaque, Eynat Rafalin, Robert T. Schweller, Diane L. Souvaine:
Staged Self-Assembly:Nanomanufacture of Arbitrary Shapes with O(1) Glues. CoRR abs/0803.0316 (2008) - [i41]Sándor P. Fekete, Christiane Schmidt:
Polygon Exploration with Discrete Vision. CoRR abs/0807.2358 (2008) - 2007
- [j40]Sándor P. Fekete, Jan van der Veen:
PackLib2: An integrated library of multi-dimensional packing problems. Eur. J. Oper. Res. 183(3): 1131-1135 (2007) - [j39]Sándor P. Fekete, Jörg Schepers, Jan van der Veen:
An Exact Algorithm for Higher-Dimensional Orthogonal Packing. Oper. Res. 55(3): 569-587 (2007) - [j38]Josef Angermeier, Diana Göhringer, Mateusz Majer, Jürgen Teich, Sándor P. Fekete, Jan van der Veen:
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). it Inf. Technol. 49(3): 143- (2007) - [c51]Sándor P. Fekete, Alexander Kröller:
Topology and Routing in Sensor Networks. ALGOSENSORS 2007: 6-15 - [c50]Kevin Buchin, Maike Buchin, Erik D. Demaine, Martin L. Demaine, Dania El-Khechen, Sándor P. Fekete, Christian Knauer, André Schulz, Perouz Taslakian:
On Rolling Cube Puzzles. CCCG 2007: 141-144 - [c49]Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Mashhood Ishaque, Eynat Rafalin, Robert T. Schweller, Diane L. Souvaine:
Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O (1) Glues. DNA 2007: 1-14 - [c48]Carsten Buschmann, Horst Hellbrück, Stefan Fischer, Alexander Kröller, Sándor P. Fekete:
Radio Propagation-Aware Distance Estimation Based on Neighborhood Comparison. EWSN 2007: 325-340 - [c47]Axel Wegener, Horst Hellbrück, Stefan Fischer, Christiane Schmidt, Sándor P. Fekete:
AutoCast: An Adaptive Data Dissemination Protocol for Traffic Information Systems. VTC Fall 2007: 1947-1951 - [e1]Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz:
Robot Navigation, 15.10. - 20.10.2006. Dagstuhl Seminar Proceedings 06421, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - 2006
- [j37]Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella:
The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots. Algorithmica 46(2): 193-221 (2006) - [j36]Sándor P. Fekete, Rolf Klein, Andreas Nüchter:
Online searching with an autonomous robot. Comput. Geom. 34(2): 102-115 (2006) - [j35]Janina A. Brenner, Sándor P. Fekete, Jan van der Veen:
Simultaneous Scheduling, Binding and Routing for Coarse-Grain Reconfigurable Architectures. Electron. Notes Discret. Math. 25: 21-22 (2006) - [j34]Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich:
Higher-Dimensional Packing with Order Constraints. SIAM J. Discret. Math. 20(4): 1056-1078 (2006) - [j33]Erik D. Demaine, Sándor P. Fekete, Shmuel Gal:
Online searching with turn cost. Theor. Comput. Sci. 361(2-3): 342-355 (2006) - [c46]Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote:
Locked and unlocked chains of planar shapes. SCG 2006: 61-70 - [c45]Helmut Alt, Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey:
Minimum-cost coverage of point sets by disks. SCG 2006: 449-458 - [c44]Sándor P. Fekete, Alexander Kröller:
Geometry-based reasoning for a large sensor network. SCG 2006: 475-476 - [c43]Axel Wegener, Elad Michael Schiller, Horst Hellbrück, Sándor P. Fekete, Stefan Fischer:
Hovering Data Clouds: A Decentralized and Self-organizing Information System. IWSOS/EuroNGI 2006: 243-247 - [c42]Janina A. Brenner, Jan van der Veen, Sándor P. Fekete, Julio A. de Oliveira Filho, Wolfgang Rosenstiel:
Optimal Simultaneous Scheduling, Binding and Routing for Processor-Like Reconfigurable Architectures. FPL 2006: 1-6 - [c41]Sándor P. Fekete, Jan van der Veen, Mateusz Majer, Jürgen Teich:
Minimizing Communication Cost for Reconfigurable Slot Modules. FPL 2006: 1-6 - [c40]Sándor P. Fekete, Christiane Schmidt, Axel Wegener, Stefan Fischer:
Recognizing Traffic Jams with Hovering Data Clouds. ISoLA 2006: 198-203 - [c39]Alexander Kröller, Sándor P. Fekete, Dennis Pfisterer, Stefan Fischer:
Deterministic boundary recognition and topology extraction for large sensor networks. SODA 2006: 1000-1009 - [i40]Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz:
06421 Executive Summary -- Robot Navigation. Robot Navigation 2006 - [i39]Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz:
06421 Abstracts Collection -- Robot Navigation. Robot Navigation 2006 - [i38]Sándor P. Fekete, Alexander Kröller, Carsten Buschmann, Stefan Fischer:
Geometric Distance Estimation for Sensor Networks and Unit Disk Graphs. Geometric Networks and Metric Space Embeddings 2006 - [i37]Sándor P. Fekete, Christiane Schmidt:
Polygon Exploration with Discrete Vision. Robot Navigation 2006 - [i36]Esther M. Arkin, Hervé Brönnimann, Jeff Erickson, Sándor P. Fekete, Christian Knauer, Jonathan Lenchner, Joseph S. B. Mitchell, Kim Whittlesey:
Minimum-Cost Coverage of Point Sets by Disks. CoRR abs/cs/0604008 (2006) - [i35]Robert Connelly, Erik D. Demaine, Martin L. Demaine, Sándor P. Fekete, Stefan Langerman, Joseph S. B. Mitchell, Ares Ribó, Günter Rote:
Locked and Unlocked Chains of Planar Shapes. CoRR abs/cs/0604022 (2006) - [i34]Sándor P. Fekete, Jörg Schepers, Jan van der Veen:
An exact algorithm for higher-dimensional orthogonal packing. CoRR abs/cs/0604045 (2006) - 2005
- [j32]Sándor P. Fekete, Henk Meijer:
The one-round Voronoi game replayed. Comput. Geom. 30(2): 81-94 (2005) - [j31]Sándor P. Fekete, Joseph S. B. Mitchell, Karin Beurer:
On the Continuous Fermat-Weber Problem. Oper. Res. 53(1): 61-76 (2005) - [j30]Sándor P. Fekete, Alexander Kröller, Carsten Buschmann, Stefan Fischer, Dennis Pfisterer:
Koordinatenfreies Lokationsbewusstsein (Localization without Coordinates). it Inf. Technol. 47(2): 70-78 (2005) - [j29]Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia:
Optimal Covering Tours with Turn Costs. SIAM J. Comput. 35(3): 531-566 (2005) - [j28]Carsten Buschmann, Dennis Pfisterer, Stefan Fischer, Sándor P. Fekete, Alexander Kröller:
SpyGlass: a wireless sensor network visualizer. SIGBED Rev. 2(1): 1-6 (2005) - [c38]Sándor P. Fekete, Michael Kaufmann, Alexander Kröller, Katharina Anna Lehmann:
A New Approach for Boundary Recognition in Geometric Sensor Networks. CCCG 2005: 84-87 - [c37]Jan van der Veen, Sándor P. Fekete, Mateusz Majer, Ali Ahmadinia, Christophe Bobda, Frank Hannig, Jürgen Teich:
Defragmenting the Module Layout of a Partially Reconfigurable Device. ERSA 2005: 92-104 - [c36]Christophe Bobda, Mateusz Majer, Ali Ahmadinia, Thomas Haller, André Linarth, Jürgen Teich, Sándor P. Fekete, Jan van der Veen:
The Erlangen Slot Machine: A Highly Flexible FPGA-Based Reconfigurable Platform. FCCM 2005: 319-320 - [c35]Christophe Bobda, Ali Ahmadinia, Mateusz Majer, Jürgen Teich, Sándor P. Fekete, Jan van der Veen:
DyNoC: A Dynamic Infrastructure for Communication in Dynamically Reconfigurable Devices. FPL 2005: 153-158 - [c34]Ali Ahmadinia, Christophe Bobda, Ji Ding, Mateusz Majer, Jürgen Teich, Sándor P. Fekete, Jan van der Veen:
A Practical Approach for Circuit Routing on Dynamic Reconfigurable Devices. IEEE International Workshop on Rapid System Prototyping 2005: 84-90 - [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 - [i33]Sándor P. Fekete, Rolf Klein, Andreas Nüchter:
Searching with an Autonomous Robot. Algorithms for Optimization with Incomplete Information 2005 - [i32]Sándor P. Fekete, Alexander Kröller, Dennis Pfisterer, Stefan Fischer:
Deterministic boundary recongnition and topology extraction for large sensor networks. Algorithmic Aspects of Large and Complex Networks 2005 - [i31]Alexander Kröller, Dennis Pfisterer, Carsten Buschmann, Sándor P. Fekete, Stefan Fischer:
Shawn: A new approach to simulating wireless sensor networks. CoRR abs/cs/0502003 (2005) - [i30]Alexander Kröller, Sándor P. Fekete, Carsten Buschmann, Stefan Fischer, Dennis Pfisterer:
Koordinatenfreies Lokationsbewusstsein (Localization without Coordinates). CoRR abs/cs/0502069 (2005) - [i29]Ali Ahmadinia, Christophe Bobda, Ji Ding, Mateusz Majer, Jürgen Teich, Sándor P. Fekete, Jan van der Veen:
A Practical Approach for Circuit Routing on Dynamic Reconfigurable Devices. CoRR abs/cs/0503066 (2005) - [i28]Jan van der Veen, Sándor P. Fekete, Ali Ahmadinia, Christophe Bobda, Frank Hannig, Jürgen Teich:
Defragmenting the Module Layout of a Partially Reconfigurable Device. CoRR abs/cs/0505005 (2005) - [i27]Sándor P. Fekete, Michael Kaufmann, Alexander Kröller, Katharina Anna Lehmann:
A New Approach for Boundary Recognition in Geometric Sensor Networks. CoRR abs/cs/0508006 (2005) - [i26]Christophe Bobda, Ali Ahmadinia, Mateusz Majer, Jürgen Teich, Sándor P. Fekete, Jan van der Veen:
DyNoC: A Dynamic Infrastructure for Communication in Dynamically Reconfigurable Devices. CoRR abs/cs/0510039 (2005) - [i25]Alexander Kröller, Sándor P. Fekete, Dennis Pfisterer, Stefan Fischer:
Deterministic boundary recognition and topology extraction for large sensor networks. CoRR abs/cs/0510048 (2005) - 2004
- [j27]Sándor P. Fekete, Henk Meijer:
Maximum Dispersion and Geometric Maximum Weight Cliques. Algorithmica 38(3): 501-511 (2004) - [j26]Sándor P. Fekete, Jörg Schepers:
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems. Math. Methods Oper. Res. 60(2): 311-329 (2004) - [j25]Sándor P. Fekete, Jörg Schepers:
A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing. Math. Oper. Res. 29(2): 353-368 (2004) - [j24]Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt:
Traveling salesmen in the presence of competition. Theor. Comput. Sci. 313(3): 377-392 (2004) - [c32]Sándor P. Fekete, Alexander Kröller, Dennis Pfisterer, Stefan Fischer, Carsten Buschmann:
Neighborhood-Based Topology Recognition in Sensor Networks. ALGOSENSORS 2004: 123-136 - [c31]Sándor P. Fekete, Rolf Klein, Andreas Nüchter:
Searching with an autonomous robot. SCG 2004: 449-450 - [c30]Ali Ahmadinia, Christophe Bobda, Sándor P. Fekete, Jürgen Teich, Jan van der Veen:
Optimal Routing-Conscious Dynamic Placement for Reconfigurable Devices. FPL 2004: 847-851 - [c29]Carsten Buschmann, Dennis Pfisterer, Stefan Fischer, Sándor P. Fekete, Alexander Kröller:
SpyGlass: taking a closer look at sensor networks. SenSys 2004: 301-302 - [c28]Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer:
Minimizing the stabbing number of matchings, trees, and triangulations. SODA 2004: 437-446 - [c27]Sándor P. Fekete, Rolf Klein, Andreas Nüchter:
Online Searching with an Autonomous Robot. WAFR 2004: 139-154 - [i24]Sándor P. Fekete, Jörg Schepers:
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems. CoRR cs.DS/0402044 (2004) - [i23]Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella:
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots. CoRR cs.DS/0402045 (2004) - [i22]Sándor P. Fekete, Alexander Kröller, Dennis Pfisterer, Stefan Fischer, Carsten Buschmann:
Neighborhood-Based Topology Recognition in Sensor Networks. CoRR cs.DS/0405058 (2004) - [i21]Ali Ahmadinia, Christophe Bobda, Sándor P. Fekete, Jürgen Teich, Jan van der Veen:
Optimal Routing-Conscious Dynamic Placement for Reconfigurable Devices. CoRR cs.DS/0406035 (2004) - [i20]Erik D. Demaine, Sándor P. Fekete, Shmuel Gal:
Online Searching with Turn Cost. CoRR cs.DS/0406045 (2004) - [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) - [i18]Sándor P. Fekete, Rolf Klein, Andreas Nüchter:
Online Searching with an Autonomous Robot. CoRR cs.RO/0404036 (2004) - 2003
- [j23]Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell:
An algorithmic study of manufacturing paperclips and other folded structures. Comput. Geom. 25(1-2): 117-138 (2003) - [j22]Sándor P. Fekete, Martin Skutella, Gerhard J. Woeginger:
The complexity of economic equilibria for house allocation markets. Inf. Process. Lett. 88(5): 219-223 (2003) - [j21]Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe:
The geometric maximum traveling salesman problem. J. ACM 50(5): 641-664 (2003) - [j20]Sándor P. Fekete, Robert T. Firla, Bianca Spille:
Characterizing matchings as the intersection of matroids. Math. Methods Oper. Res. 58(2): 319-329 (2003) - [c26]Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell:
Online dispersion algorithms for swarms of robots. SCG 2003: 382-383 - [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) - [i16]Sándor P. Fekete, Joseph S. B. Mitchell, Karin Beurer:
On the continuous Fermat-Weber problem. CoRR cs.CG/0310027 (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) - [i14]Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich:
Higher-Dimensional Packing with Order Constraints. CoRR cs.DS/0308006 (2003) - [i13]Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia:
Optimal Covering Tours with Turn Costs. CoRR cs.DS/0309014 (2003) - [i12]Sándor P. Fekete, Jörg Schepers:
A combinatorial characterization of higher-dimensional orthogonal packing. CoRR cs.DS/0310032 (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) - [c24]Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell, Martin Skutella:
The freeze-tag problem: how to wake up a swarm of robots. SODA 2002: 568-577 - [c23]Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell:
Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments. WAFR 2002: 77-94 - [i10]Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt:
Traveling Salesmen in the Presence of Competition. CoRR cs.CC/0212001 (2002) - [i9]Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell:
An Algorithmic Study of Manufacturing Paperclips and Other Folded Structures. CoRR cs.CG/0209034 (2002) - [i8]Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristán, Saurabh Sethia:
On the Reflexivity of Point Sets. CoRR cs.CG/0210003 (2002) - [i7]Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe:
The Geometric Maximum Traveling Salesman Problem. CoRR cs.DS/0204024 (2002) - [i6]Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young:
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. CoRR cs.DS/0205050 (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) - [i4]Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell:
Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments. CoRR cs.RO/0212022 (2002) - 2001
- [j18]Christoph Baur, Sándor P. Fekete:
Approximation of Geometric Dispersion Problems. Algorithmica 30(3): 451-470 (2001) - [j17]Sándor P. Fekete, Jana Kremer:
Tree spanners in planar graphs. Discret. Appl. Math. 108(1-2): 85-103 (2001) - [j16]Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich:
Extending Partial Suborders. Electron. Notes Discret. Math. 8: 34-37 (2001) - [j15]Sándor P. Fekete, Robert T. Firla, Bianca Spille:
Matching as the Intersection of Matroids. Electron. Notes Discret. Math. 10: 96-99 (2001) - [j14]Sándor P. Fekete, Joseph S. B. Mitchell:
Terrain Decomposition and Layered Manufacturing. Int. J. Comput. Geom. Appl. 11(6): 647-668 (2001) - [j13]Edward J. Anderson, Sándor P. Fekete:
Two Dimensional Rendezvous Search. Oper. Res. 49(1): 107-118 (2001) - [j12]Sándor P. Fekete, Jörg Schepers:
New classes of fast lower bounds for bin packing problems. Math. Program. 91(1): 11-31 (2001) - [j11]Jürgen Teich, Sándor P. Fekete, Jörg Schepers:
Optimization of Dynamic Hardware Reconfigurations. J. Supercomput. 19(1): 57-75 (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 - [c21]Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich:
Optimal FPGA module placement with temporal precedence constraints. DATE 2001: 658-667 - [c20]Esther M. Arkin, Michael A. Bender, Erik D. Demaine, Sándor P. Fekete, Joseph S. B. Mitchell, Saurabh Sethia:
Optimal covering tours with turn costs. SODA 2001: 138-147 - [c19]Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristán, Saurabh Sethia:
On the Reflexivity of Point Sets. WADS 2001: 192-204 - [c18]Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich:
Higher-Dimensional Packing with Order Constraints. WADS 2001: 300-312 - 2000
- [j10]Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell:
Approximation algorithms for lawn mowing and milling. Comput. Geom. 17(1-2): 25-50 (2000) - [j9]Sándor P. Fekete:
On Simple Polygonalizations with Optimal Area. Discret. Comput. Geom. 23(1): 73-110 (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 - [c16]Sándor P. Fekete, Joseph S. B. Mitchell, Karin Weinbrecht:
On the continuous Weber and k-median problems (extended abstract). SCG 2000: 70-79
1990 – 1999
- 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 - [c14]Markus Eiglsperger, Sándor P. Fekete, Gunnar W. Klau:
Orthogonal Graph Drawing. Drawing Graphs 1999: 121-171 - [c13]Jürgen Teich, Sándor P. Fekete, Jörg Schepers:
Compile-time Optimization of Dynamic Hardware Reconfigurations. PDPTA 1999: 1097-1103 - [c12]Sándor P. Fekete:
Simplicity and Hardness of the Maximum Traveling Salesman Problem Under Geometric Distances. SODA 1999: 337-345 - 1998
- [j6]Sándor P. Fekete, William R. Pulleyblank:
Traveling the Boundary of Minkowski Sums. Inf. Process. Lett. 66(4): 171-174 (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) - [j4]Ulrich Faigle, Walter Kern, Sándor P. Fekete, Winfried Hochstättler:
The nucleon of cooperative games and an algorithm for matching games. Math. Program. 83: 195-211 (1998) - [c11]Christoph Baur, Sándor P. Fekete:
Approximation of Geometric Dispersion Problems. APPROX 1998: 63-75 - [c10]Edward J. Anderson, Sándor P. Fekete:
Asymmetric Rendezvous on the Plane. SCG 1998: 365-373 - [c9]Sándor P. Fekete, Jörg Schepers:
New Classes of Lower Bounds for Bin Packing Problems. IPCO 1998: 257-270 - [c8]Sándor P. Fekete, Jana Kremer:
Tree Spanners in Planar Graphs. WG 1998: 298-309 - 1997
- [j3]Sándor P. Fekete, Gerhard J. Woeginger:
Angle-Restricted Tours in the Plane. Comput. Geom. 8: 195-218 (1997) - [j2]Ulrich Faigle, Walter Kern, Sándor P. Fekete, Winfried Hochstättler:
On the complexity of testing membership in the core of min-cost spanning tree games. Int. J. Game Theory 26(3): 361-366 (1997) - [j1]Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young:
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. J. Algorithms 24(2): 310-324 (1997) - [c7]Sándor P. Fekete, Winfried Hochstättler, Stephan Kromberg, Christoph Moll:
The complexity of an inverse shortest paths problem. Contemporary Trends in Discrete Mathematics 1997: 113-127 - [c6]Sándor P. Fekete, Jörg Schepers:
A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems. ESA 1997: 144-156 - [c5]Sándor P. Fekete, Michael E. Houle, Sue Whitesides:
The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems. GD 1997: 272-283 - 1996
- [c4]Sándor P. Fekete, Samir Khuller, Monika Klemmstein, Balaji Raghavachari, Neal E. Young:
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees. IPCO 1996: 105-117 - 1995
- [c3]Sándor P. Fekete, Michael E. Houle, Sue Whitesides:
New Results on a Visibility Representation of Graphs in 3D. GD 1995: 234-241 - [i3]Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern:
The Nucleon of Cooperative Games and an Algorithm for Matching Games. Electron. Colloquium Comput. Complex. TR95 (1995) - [i2]Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern:
On the Complexity of Testing Membership in the Core of min-Cost Spanning Tree Games. Electron. Colloquium Comput. Complex. TR95 (1995) - [i1]Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern:
On Approximately Fair Cost Allocation in Euclidean TSP Games. Electron. Colloquium Comput. Complex. TR95 (1995) - 1993
- [c2]Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell:
The Lawnmower Problem. CCCG 1993: 461-466 - [c1]Sándor P. Fekete, William R. Pulleyblank:
Area Optimization of Simple Polygons. SCG 1993: 173-182
Coauthor Index
[j98] [j93] [i110] [j89] [i106] [j86] [j85] [c133] [i102] [i99] [j82] [j77] [c126] [i98] [j66] [c114] [i92] [i87] [i85] [c105] [c104] [c103] [c101] [i77] [j59] [c92] [c90] [i73] [i69] [c87] [c85] [i62] [j53] [j49] [i54] [i50] [c65] [j44] [j42] [i42] [c50] [c49] [j33] [c46] [i35] [j29] [c33] [i20] [i19] [i13] [c20]
[j106] [i124] [j105] [j104] [j102] [j101] [i123] [j98] [j97] [j96] [i119] [j94] [j92] [c151] [c149] [i115] [i113] [i112] [i111] [i110] [j90] [c145] [c142] [c140] [c139] [i109] [i106] [j85] [c131] [c130] [c128] [i104] [i100] [j81] [j77] [c127] [c126] [c125] [c123] [c121] [i98] [i95] [c119] [c116] [c115] [c114] [i92] [i89] [i88]
Alexander Kröller
aka: Alexander Kroeller
aka: Alexander Kroeller
[j98] [j96] [i113] [i110] [j89] [c136] [i107] [i106] [i102] [j84] [j83] [j79] [c122] [j71] [i86] [j64] [c109] [c107] [i83] [i82] [i81] [j61] [c95] [i75] [c93] [j56] [c77] [c76] [i60] [i57] [j49] [j46] [c61] [c54] [j37] [c46] [c45] [i36] [i35] [j31] [j29] [i23] [j23] [c26] [i16] [i13] [c24] [c23] [i9] [i8] [i4] [j14] [c20] [c19] [j10] [c16] [c2]
[j105] [j102] [c156] [c155] [i122] [j100] [c154] [c152] [i118] [i117] [j94] [j92] [c151] [c149] [i115] [i112] [j90] [c146] [c145] [c142] [c140] [c138] [i109] [j87] [j85] [c131] [c130] [c129] [i104] [i103] [i101] [j83] [j77] [c126] [c125] [c122] [c121] [i98] [i95] [j69] [j66] [c119] [c116] [c114] [c113] [i92] [i91] [i90] [i88] [i86] [c112] [c109] [i81] [c103] [i77]
a service of 
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-04-11 20:16 CEST 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:
