The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sándor P. Fekete: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2001, pp:1-16 [Conf]
  2. Sándor P. Fekete, Alexander Kröller, Dennis Pfisterer, Stefan Fischer, Carsten Buschmann
    Neighborhood-Based Topology Recognition in Sensor Networks. [Citation Graph (0, 0)][DBLP]
    ALGOSENSORS, 2004, pp:123-136 [Conf]
  3. Christoph Baur, Sándor P. Fekete
    Approximation of Geometric Dispersion Problems. [Citation Graph (0, 0)][DBLP]
    APPROX, 1998, pp:63-75 [Conf]
  4. Sándor P. Fekete, Henk Meijer
    Maximum dispersion and geometric maximum weight cliques. [Citation Graph (0, 0)][DBLP]
    APPROX, 2000, pp:132-143 [Conf]
  5. Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell
    The Lawnmower Problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:461-466 [Conf]
  6. Sándor P. Fekete, Michael Kaufmann, Alexander Kröller, Katharina Anna Lehmann
    A New Approach for Boundary Recognition in Geometric Sensor Networks. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:84-87 [Conf]
  7. Edward J. Anderson, Sándor P. Fekete
    Asymmetric Rendezvous on the Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:365-373 [Conf]
  8. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:449-458 [Conf]
  9. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:61-70 [Conf]
  10. Sándor P. Fekete, Alexander Kröller
    Geometry-based reasoning for a large sensor network. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:475-476 [Conf]
  11. Sándor P. Fekete, Rolf Klein, Andreas Nüchter
    Searching with an autonomous robot. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:449-450 [Conf]
  12. Sándor P. Fekete, Henk Meijer
    On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:217-226 [Conf]
  13. Sándor P. Fekete, Joseph S. B. Mitchell, Karin Weinbrecht
    On the continuous Weber and k-median problems (extended abstract). [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:70-79 [Conf]
  14. Sándor P. Fekete, William R. Pulleyblank
    Area Optimization of Simple Polygons. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:173-182 [Conf]
  15. Tien-Ruey Hsiang, Esther M. Arkin, Michael A. Bender, Sándor P. Fekete, Joseph S. B. Mitchell
    Online dispersion algorithms for swarms of robots. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:382-383 [Conf]
  16. Markus Eiglsperger, Sándor P. Fekete, Gunnar W. Klau
    Orthogonal Graph Drawing. [Citation Graph (0, 0)][DBLP]
    Drawing Graphs, 1999, pp:121-171 [Conf]
  17. Sándor P. Fekete, Rolf Klein, Andreas Nüchter
    Searching with an Autonomous Robot. [Citation Graph (0, 0)][DBLP]
    Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
  18. Sándor P. Fekete, Alexander Kröller, Dennis Pfisterer, Stefan Fischer
    Deterministic boundary recongnition and topology extraction for large sensor networks. [Citation Graph (0, 0)][DBLP]
    Algorithmic Aspects of Large and Complex Networks, 2005, pp:- [Conf]
  19. Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich
    Optimal FPGA module placement with temporal precedence constraints. [Citation Graph (0, 0)][DBLP]
    DATE, 2001, pp:658-667 [Conf]
  20. 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. [Citation Graph (0, 0)][DBLP]
    ERSA, 2005, pp:92-104 [Conf]
  21. Sándor P. Fekete, Jörg Schepers
    A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems. [Citation Graph (0, 0)][DBLP]
    ESA, 1997, pp:144-156 [Conf]
  22. Axel Wegener, Elad Michael Schiller, Horst Hellbrück, Sándor P. Fekete, Stefan Fischer
    Hovering Data Clouds: A Decentralized and Self-organizing Information System. [Citation Graph (0, 0)][DBLP]
    IWSOS/EuroNGI, 2006, pp:243-247 [Conf]
  23. Carsten Buschmann, Horst Hellbrück, Stefan Fischer, Alexander Kröller, Sándor P. Fekete
    Radio Propagation-Aware Distance Estimation Based on Neighborhood Comparison. [Citation Graph (0, 0)][DBLP]
    EWSN, 2007, pp:325-340 [Conf]
  24. 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. [Citation Graph (0, 0)][DBLP]
    FCCM, 2005, pp:319-320 [Conf]
  25. Ali Ahmadinia, Christophe Bobda, Sándor P. Fekete, Jürgen Teich, Jan van der Veen
    Optimal Routing-Conscious Dynamic Placement for Reconfigurable Devices. [Citation Graph (0, 0)][DBLP]
    FPL, 2004, pp:847-851 [Conf]
  26. 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. [Citation Graph (0, 0)][DBLP]
    FPL, 2005, pp:153-158 [Conf]
  27. Sándor P. Fekete, Michael E. Houle, Sue Whitesides
    New Results on a Visibility Representation of Graphs in 3D. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1995, pp:234-241 [Conf]
  28. Sándor P. Fekete, Michael E. Houle, Sue Whitesides
    The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1997, pp:272-283 [Conf]
  29. 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. [Citation Graph (0, 0)][DBLP]
    IPCO, 1996, pp:105-117 [Conf]
  30. Sándor P. Fekete, Jörg Schepers
    New Classes of Lower Bounds for Bin Packing Problems. [Citation Graph (0, 0)][DBLP]
    IPCO, 1998, pp:257-270 [Conf]
  31. Jürgen Teich, Sándor P. Fekete, Jörg Schepers
    Compile-time Optimization of Dynamic Hardware Reconfigurations. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1999, pp:1097-1103 [Conf]
  32. 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. [Citation Graph (0, 0)][DBLP]
    IEEE International Workshop on Rapid System Prototyping, 2005, pp:84-90 [Conf]
  33. Carsten Buschmann, Dennis Pfisterer, Stefan Fischer, Sándor P. Fekete, Alexander Kröller
    SpyGlass: taking a closer look at sensor networks. [Citation Graph (0, 0)][DBLP]
    SenSys, 2004, pp:301-302 [Conf]
  34. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2001, pp:138-147 [Conf]
  35. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2002, pp:568-577 [Conf]
  36. Sándor P. Fekete
    Simplicity and Hardness of the Maximum Traveling Salesman Problem Under Geometric Distances. [Citation Graph (0, 0)][DBLP]
    SODA, 1999, pp:337-345 [Conf]
  37. Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer
    Minimizing the stabbing number of matchings, trees, and triangulations. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:437-446 [Conf]
  38. Alexander Kröller, Sándor P. Fekete, Dennis Pfisterer, Stefan Fischer
    Deterministic boundary recognition and topology extraction for large sensor networks. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:1000-1009 [Conf]
  39. 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. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:169-181 [Conf]
  40. Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristan, Saurabh Sethia
    On the Reflexivity of Point Sets. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:192-204 [Conf]
  41. Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich
    Higher-Dimensional Packing with Order Constraints. [Citation Graph (0, 0)][DBLP]
    WADS, 2001, pp:300-312 [Conf]
  42. Sándor P. Fekete, Henk Meijer
    The One-Round Voronoi Game Replayed. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:150-171 [Conf]
  43. Sándor P. Fekete, Jana Kremer
    Tree Spanners in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1998, pp:298-309 [Conf]
  44. Christoph Baur, Sándor P. Fekete
    Approximation of Geometric Dispersion Problems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2001, v:30, n:3, pp:451-470 [Journal]
  45. Sándor P. Fekete, Henk Meijer
    Maximum Dispersion and Geometric Maximum Weight Cliques. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2003, v:38, n:3, pp:501-511 [Journal]
  46. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:46, n:2, pp:193-221 [Journal]
  47. Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell
    Approximation algorithms for lawn mowing and milling. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:17, n:1-2, pp:25-50 [Journal]
  48. Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell
    An algorithmic study of manufacturing paperclips and other folded structures. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:25, n:1-2, pp:117-138 [Journal]
  49. Sándor P. Fekete, Rolf Klein, Andreas Nüchter
    Online searching with an autonomous robot. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:2, pp:102-115 [Journal]
  50. Sándor P. Fekete, Henk Meijer
    The one-round Voronoi game replayed. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:2, pp:81-94 [Journal]
  51. Sándor P. Fekete, Gerhard J. Woeginger
    Angle-Restricted Tours in the Plane. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:195-218 [Journal]
  52. Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt
    Traveling Salesmen in the Presence of Competition [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  53. Esther M. Arkin, Sándor P. Fekete, Joseph S. B. Mitchell
    An Algorithmic Study of Manufacturing Paperclips and Other Folded Structures [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  54. Esther M. Arkin, Sándor P. Fekete, Ferran Hurtado, Joseph S. B. Mitchell, Marc Noy, Vera Sacristan, Saurabh Sethia
    On the Reflexivity of Point Sets [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  55. Sándor P. Fekete, Henk Meijer
    The one-round Voronoi game replayed [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  56. Sándor P. Fekete, Joseph S. B. Mitchell, Karin Beurer
    On the continuous Fermat-Weber problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  57. Sándor P. Fekete, Marco E. Lübbecke, Henk Meijer
    Minimizing the stabbing number of matchings, trees, and triangulations [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  58. Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe
    The Geometric Maximum Traveling Salesman Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  59. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  60. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  61. Sándor P. Fekete, Ekkehard Köhler, Jürgen Teich
    Higher-Dimensional Packing with Order Constraints [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  62. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  63. Sándor P. Fekete, Jörg Schepers
    A combinatorial characterization of higher-dimensional orthogonal packing [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  64. Sándor P. Fekete, Henk Meijer
    Maximum dispersion and geometric maximum weight cliques [Citation Graph (0, 0)][DBLP]
    CoRR, 2003, v:0, n:, pp:- [Journal]
  65. Sándor P. Fekete, Jörg Schepers
    A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  66. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  67. Sándor P. Fekete, Alexander Kröller, Dennis Pfisterer, Stefan Fischer, Carsten Buschmann
    Neighborhood-Based Topology Recognition in Sensor Networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  68. Ali Ahmadinia, Christophe Bobda, Sándor P. Fekete, Jürgen Teich, Jan van der Veen
    Optimal Routing-Conscious Dynamic Placement for Reconfigurable Devices [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  69. Erik D. Demaine, Sándor P. Fekete, Shmuel Gal
    Online Searching with Turn Cost [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  70. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  71. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  72. Sándor P. Fekete, Rolf Klein, Andreas Nüchter
    Online Searching with an Autonomous Robot [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  73. Sándor P. Fekete, Jana Kremer
    Tree spanners in planar graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:108, n:1-2, pp:85-103 [Journal]
  74. Sándor P. Fekete
    On Simple Polygonalizations with Optimal Area. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:23, n:1, pp:73-110 [Journal]
  75. Sándor P. Fekete, Henk Meijer
    On Minimum Stars and Maximum Matchings. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2000, v:23, n:3, pp:389-407 [Journal]
  76. Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
    The Nucleon of Cooperative Games and an Algorithm for Matching Games [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:7, pp:- [Journal]
  77. 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 [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:12, pp:- [Journal]
  78. Ulrich Faigle, Sándor P. Fekete, Winfried Hochstättler, Walter Kern
    On Approximately Fair Cost Allocation in Euclidean TSP Games [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:16, pp:- [Journal]
  79. Sándor P. Fekete, Joseph S. B. Mitchell
    Terrain Decomposition and Layered Manufacturing. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2001, v:11, n:6, pp:647-668 [Journal]
  80. Sándor P. Fekete, Henk Meijer
    Rectangle and Box Visibility Graphs in 3D. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1999, v:9, n:1, pp:1-0 [Journal]
  81. Sándor P. Fekete, William R. Pulleyblank
    Traveling the Boundary of Minkowski Sums. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:66, n:4, pp:171-174 [Journal]
  82. Sándor P. Fekete, Martin Skutella, Gerhard J. Woeginger
    The complexity of economic equilibria for house allocation markets. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:88, n:5, pp:219-223 [Journal]
  83. Sándor P. Fekete, Alexander Kröller, Carsten Buschmann, Stefan Fischer, Dennis Pfisterer
    Koordinatenfreies Lokationsbewusstsein (Localization without Coordinates). [Citation Graph (0, 0)][DBLP]
    it - Information Technology, 2005, v:47, n:2, pp:70-78 [Journal]
  84. Alexander I. Barvinok, Sándor P. Fekete, David S. Johnson, Arie Tamir, Gerhard J. Woeginger, Russell Woodroofe
    The geometric maximum traveling salesman problem. [Citation Graph (0, 0)][DBLP]
    J. ACM, 2003, v:50, n:5, pp:641-664 [Journal]
  85. 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. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:24, n:2, pp:310-324 [Journal]
  86. 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. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 2002, v:7, n:, pp:11- [Journal]
  87. 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. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 1998, v:2, n:2, pp:- [Journal]
  88. Sándor P. Fekete, Jörg Schepers
    A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing. [Citation Graph (0, 0)][DBLP]
    Math. Oper. Res., 2004, v:29, n:2, pp:353-368 [Journal]
  89. Ulrich Faigle, Walter Kern, Sándor P. Fekete, Winfried Hochstättler
    The nucleon of cooperative games and an algorithm for matching games. [Citation Graph (0, 0)][DBLP]
    Math. Program., 1998, v:83, n:, pp:195-211 [Journal]
  90. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:35, n:3, pp:531-566 [Journal]
  91. Erik D. Demaine, Sándor P. Fekete, Shmuel Gal
    Online searching with turn cost. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:361, n:2-3, pp:342-355 [Journal]
  92. Sándor P. Fekete, Rudolf Fleischer, Aviezri S. Fraenkel, Matthias Schmitt
    Traveling salesmen in the presence of competition. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:377-392 [Journal]
  93. Jürgen Teich, Sándor P. Fekete, Jörg Schepers
    Optimization of Dynamic Hardware Reconfigurations. [Citation Graph (0, 0)][DBLP]
    The Journal of Supercomputing, 2001, v:19, n:1, pp:57-75 [Journal]
  94. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:141-144 [Conf]
  95. Sándor P. Fekete, Jan van der Veen, Mateusz Majer, Jürgen Teich
    Minimizing Communication Cost for Reconfigurable Slot Modules. [Citation Graph (0, 0)][DBLP]
    FPL, 2006, pp:1-6 [Conf]
  96. J. A. Brenner, Jan van der Veen, Sándor P. Fekete, J. Oliveira Filho, Wolfgang Rosenstiel
    Optimal Simultaneous Scheduling, Binding and Routing for Processor-Like Reconfigurable Architectures. [Citation Graph (0, 0)][DBLP]
    FPL, 2006, pp:1-6 [Conf]
  97. Alexander Kröller, Dennis Pfisterer, Carsten Buschmann, Sándor P. Fekete, Stefan Fischer
    Shawn: A new approach to simulating wireless sensor networks [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  98. Alexander Kröller, Sándor P. Fekete, Carsten Buschmann, Stefan Fischer, Dennis Pfisterer
    Koordinatenfreies Lokationsbewusstsein (Localization without Coordinates) [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  99. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  100. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  101. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  102. Sándor P. Fekete, Jörg Schepers, Jan van der Veen
    An exact algorithm for higher-dimensional orthogonal packing [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  103. 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). [Citation Graph (0, 0)][DBLP]
    it - Information Technology, 2007, v:49, n:3, pp:143-0 [Journal]

  104. Exact Solutions and Bounds for General Art Gallery Problems. [Citation Graph (, )][DBLP]


  105. Topology and Routing in Sensor Networks. [Citation Graph (, )][DBLP]


  106. Integer Point Sets Minimizing Average Pairwise l1 Distance: What is the Optimal Shape of a Town? [Citation Graph (, )][DBLP]


  107. Emergent algorithms for centroid and orientation detection in high-performance embedded cameras. [Citation Graph (, )][DBLP]


  108. Distributed vision with smart pixels. [Citation Graph (, )][DBLP]


  109. Polygon Exploration with Discrete Vision. [Citation Graph (, )][DBLP]


  110. 06421 Abstracts Collection -- Robot Navigation. [Citation Graph (, )][DBLP]


  111. 06421 Executive Summary -- Robot Navigation. [Citation Graph (, )][DBLP]


  112. Geometric Distance Estimation for Sensor Networks and Unit Disk Graphs. [Citation Graph (, )][DBLP]


  113. Algorithms and Simulation Methods for Topology-Aware Sensor Networks. [Citation Graph (, )][DBLP]


  114. Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O (1) Glues. [Citation Graph (, )][DBLP]


  115. Improved Approximation Algorithms for Relay Placement. [Citation Graph (, )][DBLP]


  116. Wiselib: A Generic Algorithm Library for Heterogeneous Sensor Networks. [Citation Graph (, )][DBLP]


  117. Maintaining Arrays of Contiguous Objects. [Citation Graph (, )][DBLP]


  118. No-break dynamic defragmentation of reconfigurable devices. [Citation Graph (, )][DBLP]


  119. Minimum Covering with Travel Cost. [Citation Graph (, )][DBLP]


  120. Recognizing Traffic Jams with Hovering Data Clouds. [Citation Graph (, )][DBLP]


  121. Designing a Decentralized Traffic Information System - AutoNomos. [Citation Graph (, )][DBLP]


  122. Not All Fair Probabilistic Schedulers Are Equivalent. [Citation Graph (, )][DBLP]


  123. Hallway monitoring with sensor networks. [Citation Graph (, )][DBLP]


  124. The Maximum Energy-Constrained Dynamic Flow Problem. [Citation Graph (, )][DBLP]


  125. Online Square Packing. [Citation Graph (, )][DBLP]


  126. AutoCast: An Adaptive Data Dissemination Protocol for Traffic Information Systems. [Citation Graph (, )][DBLP]


  127. Flash Mob Organization in Heterogeneous Wireless Sensor Networks. [Citation Graph (, )][DBLP]


  128. Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance. [Citation Graph (, )][DBLP]


  129. Not being (super)thin or solid is hard: A study of grid Hamiltonicity. [Citation Graph (, )][DBLP]


  130. Polygon exploration with time-discrete vision. [Citation Graph (, )][DBLP]


  131. Defragmenting the Module Layout of a Partially Reconfigurable Device [Citation Graph (, )][DBLP]


  132. A New Approach for Boundary Recognition in Geometric Sensor Networks [Citation Graph (, )][DBLP]


  133. DyNoC: A Dynamic Infrastructure for Communication in Dynamically Reconfigurable Devices [Citation Graph (, )][DBLP]


  134. Deterministic boundary recognition and topology extraction for large sensor networks [Citation Graph (, )][DBLP]


  135. Staged Self-Assembly:Nanomanufacture of Arbitrary Shapes with O(1) Glues [Citation Graph (, )][DBLP]


  136. Polygon Exploration with Discrete Vision [Citation Graph (, )][DBLP]


  137. Maintaining Virtual Areas on FPGAs using Strip Packing with Delays [Citation Graph (, )][DBLP]


  138. Empowered by Wireless Communication: Self-Organizing Traffic Collectives [Citation Graph (, )][DBLP]


  139. Circle Packing for Origami Design Is Hard [Citation Graph (, )][DBLP]


  140. Evacuation of rectilinear polygons [Citation Graph (, )][DBLP]


  141. Minimizing the Stabbing Number of Matchings, Trees, and Triangulations. [Citation Graph (, )][DBLP]


  142. Locked and Unlocked Chains of Planar Shapes. [Citation Graph (, )][DBLP]


Search in 6.732secs, Finished in 6.739secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002