Papers of Sándor Fekete
Disclaimer:
These papers are for personal academic use only. Most of the versions linked from here are preliminary (and sometimes very early and unpolished) versions.
Sometimes they date considerably before and therefore are quite different from the actual published versions. (See Jeff Erickson's copyright page if you want to know why.)
If you are interested in clean details, or plan to work on follow-up research, I suggest you:
- look at the actual printed article, which is referenced in the publication data;
- get in touch with me at: s.fekete AT tu-bs.de.
Some papers are available in gzipped Postcript format as well as PDF (which in some cases may have higher quality images).
You may need:
Published by publication year:
indicates
changes since July 1, 2011.
journal
No-Break Dynamic Defragmentation of Reconfigurable Devices,

To appear in: ACM Transactions on Reconfigurable Technology and Systems, 2012.
journal article
Exact Solutions and Bounds for General Art Gallery Problems,
journal
Online square packing,
Submitted for publication
journal
Geoff Coulson,
Barry Porter,
I. Chatzigiannakis,
C. Koninis,
S. Fischer,
D. Pfisterer:
D. Bimschas,
Torsten Braun,
Philipp Hurni,
Markus Anwander,
Gerald Wagenknecht,
S.P. Fekete,
A. Kröller,
T. Baumgartner,
Flexible experimentation in wireless sensor networks.

Commun. ACM 55(1): 82-90 (2012)
journal
M. Stelzer,
J. Sun,
A.-P. Zeng,
T. Kamphans,
S.P. Fekete,
An extended bioreaction database that significantly
improves reconstruction and analysis of genome-scale
metabolic networks,

In Integr. Biol., 2011, 3 (11), pp. 1071-1086
conference
Exploring and Triangulating a Region by a Swarm of Robots,

In: Proceedings of the 14th International Workshop on Approximation, Ranodomization, and Combinatorial Optimization (APPROX-RANDOM 2011). Springer LNCS #6845, pp. 206-217, 2011.
conference
Connecting a Set of Circles with Minimum Sum of Radii,

In: Proceedings of Algorithms and Data Structures - 12th International Symposium (WADS 2011). Springer LNCS #6844, pp. 183-194, 2011.
book chapter
Circle packing for Origami is hard,

In: P. Wang-Iverson, R.J. Lang, M. Yim (eds.), Origami5: Fifth International Meeting of Origami Science, Mathematics, and Education, AK Peters/CRC Press, 2011, pp.609-626.
workshop
Connecting a Set of Circles with Minimum Sum of Radii,
workshop
A Competitive Strategy for Distance-Aware Online Shape Allocation,
workshop
Geometric Motion Planning: Finding Intersections,
book chapter
Methods for Improving the Flow of Traffic,
In: Organic Computing - A Paradigm Shift for Complex systems, Birkhäser Verlag, 2011, 447-460.
book chapter
Hovering Data Clouds for Organic Computing,
In: Organic Computing - A Paradigm Shift for Complex systems, Birkhäser Verlag, 2011, 221-236.
conference
Disruption Management with Re-Scheduling of Rolling Stock and Re-Timing,
conference
Using a Sensor Network to Enhance a Standardized Medical Test,
In: European Workshop on Sensor Networks
journal article
A survey on relay placement with runtime and approximation guarantees,
In: Computer Science Review, 5(1), 2011, pp. 57-68.
journal article
Distributed algorithm engineering for networks of tiny artifacts,
In: Computer Science Review, 5(1), 2011, pp. 85-102.
journal article
Integer point sets minimizing average pairwise L1 distance: What Is the Optimal Shape of a Town?,
In: Computational Geometry: Theory and Applications, 44 (2011), 82-94.
conference
Real-World G-Lab: Integrating Wireless Sensor Networks with the Future Internet,
Proceedings of the
6th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks & Communities
(
TridentCom 10),
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 2011, Volume 46, Part 12, 577-579.
conference
Topology Virtualization for Wireless Sensor Network Testbeds,
Proceedings of the
6th International ICST Conference on Testbeds and Research Infrastructures for the Development of Networks & Communities
(
TridentCom 10),
Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, 2011, Volume 46, Part 12, 632-634.
conference
A Protocol for Self-Synchronized Duty-Cycling in Sensor Networks: Generic Implementation in Wiselib,
In: Proceedings of the 6th IEEE Conference on Mobile Ad-hoc and Sensor Networks (MSN 2010), ISBN 978-0-7695-4315-4, pp. 134-139.
tech report
Shortest Paths with Pairwise-Distinct Edge Labels: Finding Biochemical Pathways in Metabolic Networks,
Technical Report
conference
Evacuation of Rectilinear Polygons,
In Proceedings of the 4th International Conference Combinatorial Optimization and Applications
(
COCOA 2010),
Springer LNCS #6508, pp. 21-30.
conference
Hallway Monitoring: Distributed Data Processing with Wireless Sensor Networks,
4th International Workshop on Real-World Wireless Sensor Networks
(
REALWSN'10),
Springer LNCS #6511, pp. 94-105.
conference
Bridging the Gap between Simulated Sensor Nodes and the Real World,
4th International Workshop on Real-World Wireless Sensor Networks
(
REALWSN'10),
Springer LNCS #6511, pp. 174-177.
conference
Connectivity Graphs of Uncertainty Regions. ,
21st International Symposium on Algorithms and Computation
(
ISAAC 2010),
Springer LNCS #6507, pp. 434-445.
journal article
Locked and unlocked chains of planar shapes,
Discrete and Computational Geometry, 44(2): 439-462 (2010).
journal article
Simultaneous Event Execution in Heterogeneous Sensor Networks,
Journal of Networks, Vol 5, No 10 (2010), 1221-1226, Oct 2010
journal article
Empowered by Wireless Communication: Distributed Methods for Self-Organizing Traffic Collectives,
ACM Transactions on Autonomous and Adaptive Systems, 5(3), pp. 11:1-30, 2010
workshop
On the complexity of Origami design,
5th International Conference on Origami in Science, Mathematics, and Education, 2010.
book chapter
A. Ahmadinia,
J. Angermeier,
S.P. Fekete,
D. Göhringer,
T. Kamphans,
D. Koch,
M. Majer,
N. Schweer,
J. Teich,
C. Tessars,
J. van der Veen:
ReCoNodes - Optimization Methods for Module Scheduling and Placement on Reconfigurable Hardware Devices,
In: J. Becker, M. Platzner, J.Teich (eds.), Dynamically Reconfigurable Systems: Architectures, Design Methods and Applications, pp. 199-221.
conference
Virtual Area Management: Multitasking on dynamically reconfigurable devices,
17th International Reconfigurable Architectures Workshop (
RAW 2010).
workshop
Evacuation of Rectilinear Polygons,
Proceedings of the 26th European Workshop on Computational Geometry (
EuroCG 10), pp. 149-152.
workshop
Robot Swarms for Exploration and Triangulation of Unknown Environments,
Proceedings of the 26th European Workshop on Computational Geometry (
EuroCG 10), pp. 153-156.
conference
Wiselib: A Generic Algorithm Library for Heterogeneous Sensor Networks,
Proceedings of the 7th European Conference on Wireless Sensor Networks (
EWSN 2010), Springer LNCS #5970, pp. 162-177.
journal
Minimum covering with travel cost,
Journal of Combinatorial Optimization, 20 (2), 2010.
journal article
Polygon exploration with time-discrete vision,
Computational Geometry: Theory and Applications, 43 (2010), 148-168.
conference
Exact Solutions and Bounds for General Art Gallery Problems,
Proceedings of the SIAM-ACM Workshop on Algorithm Engineering and Experiments (
ALENEX 10), pp. 11-22.
conference
Flash Mob Organization in Heterogeneous Wireless Sensor Networks,
Proceedings of the 2nd International Workshop on Wireless Sensor Network: Theory and Practice (
WSN 09).
conference
Minimum covering with travel cost,
Proceedings of the 20th International Symposium on Algorithms and Computation (
ISAAC 2009), pp. 393-402.
conference
Not all fair probabilistic schedulers are equivalent,
Proceedings of the 13th International Conference on Principle of Distributed Systems (
OPODIS 2009), pp. 33-47.
conference
Hallway Monitoring with Sensor Networks (Demo),
Proceedings of the 7th ACM Conference on Embedded Networked Sensor Systems (
SenSys 09), pp. 331-332.
workshop
The pencil packing problem,
Proceedings of the 19th Annual Fall Workshop on Computational Geometry (
FWCG 09).
conference
Maintaining Arrays of Contiguous Objects,
Proc. of the 17th Internat. Symposium on Fundamentals of Computation Theory, Springer LNCS 5699, pp. 14-25 (
FCT 2009).
conference
Integer point sets minimizing average pairwise L1 distance: What Is the Optimal Shape of a Town?,
Proc. of the 21st Canadian Conference on Computational Geometry, 2009, pp. 145-148 (
CCCG 2009).
book chapter
Algorithms and simulation methods for topology-aware sensor networks,
In: Algorithmics of Large and Complex Networks, LNCS 5515, pp. 380-400. J. Lerner, D. Wagner, and K.A. Zweig (Eds.). Springer Verlag, 2009.
journal article
Not being (super)thin or solid is hard: A study of grid Hamiltonicity,
Computational Geometry: Theory and Applications, 42 (2009) pp. 582-605.
conference
Online square packing,
Proceedings of the 11th Algorithms and Data Structures Symposium (
WADS 2009) pp. 302-314, Springer LNCS #5664.
conference
Designing a Decentralized Traffic Information System - AutoNomos,
In KiVS 2009 (Proceedings of the 16. GTI/GI - Fachtagung Kommunikation in verteilten Systemen). Springer Series "Informatik Aktuell", pp. 309-315.
conference
Distributed Vision with Smart Pixels,
Proceedings of the 25th Annual ACM Symposium on Computational Geometry, pp. 257-266, (
SCG 09).
journal article
A Minimization Version of a Directed Subgraph Homeomorphism Problem,
Mathematical Methods of Operations Research, 69(2) 2009, pp. 281-296.
workshop
Low-cost Tours for Near-Sighted Watchmen with Discrete Vision,
Proceedings of 25th European Workshop on Computational Geometry, 171-174 (
EuroCG 2009).
workshop
Online Square Packing,
Proceedings of 25th European Workshop on Computational Geometry, 269-272 (
EuroCG 2009).
book
S.P. Fekete (ed.):
Algorithmic Aspects of Wireless Sensor Networks,
Proceedings of the 4th International Workshop on Algorithmic Aspects of Wireless Sensor Networks, Springer LNCS #5389 (ALGOSENSORS 2008).
journal article
Minimizing the Stabbing Number of Matchings, Trees, and Triangulations,
Discrete and Computational Geometry 40(4): 595-621 (2008).
conference
Improved Approximation Algorithms for Relay Placement,
Proceedings of the 16th Annual European Symposium on Algorithms - ESA 2008, pp. 356-367.
workshop
FRONTS - Foundations of Adaptive Networked Societies of Tiny Artefacts,
Proceedings of 7th GI/ITG KuVS Fachgespräch "Drahtlose Sensornetze", FGSN'08.
journal article
Offline and Online Aspects of Defragmenting the Module Layout of a Partially Reconfigurable Device,
IEEE Transactions on VLSI, 16(9): 1210-1219 (2008).
conference
No-Break Dynamic Defragmentation of Reconfigurable Devices,
Proceedings of the 18th International Conference on Field-Programmable Logic and Applications (FPL2008).
workshop
WISEBED - Pan-European Wireless Sensor Network Testbeds,
KuVS '08 (Proceedings of GI/ITG KuVS Fachgespräch "Kommunikation und Verteilte Systeme").
conference
The Maximum Energy-Constrained Dynamic Flow Problem,
Proceedings of the 11th Scandinavian Workshop on Algorithm Theory (SWAT 2008), pp. 114-126.
conference
Emergent Algorithms for Centroid and Orientation Detection in High-Performance Embedded Cameras,
Proceedings of the 5th Conference Computing Frontiers 2008 (CF'08), pp. 221-230.
journal article
Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance,
Algorithmica, 50(2): 279-298 (2008).
journal article
Staged self-assembly: nanomanufacture of arbitrary shapes with O(1) glues,
Natural Computing, 7(3): 347-370 (2008).
conference
Topology and Routing in Sensor Networks,
Third International Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS 2007), pp. 6-15.
journal article
PackLib²: An Integrated Library of Multi-Dimensional Packing Problems,
European Journal on Operational Research, 183 (3), 1131-1135. ("Special issue on cutting and packing").
conference
The Minimum-Backlog Problem,
International Conference on Mathematical Aspects of Computer and Information Sciences (MACIS'07), pp. 1-18.
conference
AutoCast: An Adaptive Data Dissemination Protocol for Traffic Information Systems,
conference
On Rolling Cube Puzzles,
Proceeding of the 19th Canadian Conference on Computational Geometry (
CCCG 2007), pp. 141-144.
journal article
An Exact Algorithm for Higher-Dimensional Orthogonal Packing,
Operations Research, Vol. 55, No. 3, 2007, pp. 569-587.
conference
Staged Self-Assembly: Nanomanufacture of Arbitraxry Shapes with O(1) glues,
journal article
The Erlangen Slot Machine - A Platform for Interdisciplinary Research in Reconfigurable Computing (ESM - Eine Hardware-Plattform für interdisziplinäre Forschung im Bereich des dynamischen rekonfigurierbaren Rechnens),
it - Information Technology, Vol. 49, No. 3, 2007, pp. 143-148.
journal article
Optimal Free-Space Management and Routing-Conscious Dynamic Placement for Reconfigurable Devices,
IEEE Transactions on Computing, Vol. 56, No. 5, 2007, pp. 673-680.
conference
Radio Propagation-Aware Distance Estimation Based on Neighborhood Comparison,
Proceedings of the 4th European Conference on Sensor Networks (EWSN 2007), 325-340.
workshop
Polygon Exploration with Discrete Vision,
Proceedings of the 23rd European Workshop on Computational Geometry (EuroCG 2007), pp. 86-89.
conference
Scheduling and Communication-Aware Mapping of HW/SW Modules for Dynamically and Partially Reconfigurable SoC Architectures,
Proceedings of the 20th International Conference on Architecture of Computing Systems (ARCS '07), pp. 151-160.
journal article
Higher-Dimensional Packing with Order Constraints,
SIAM Journal on Discrete Mathematics, Vol. 20, No. 4, 2006, pp. 1056-1078.
conference
Recognizing Traffic Jams with Hovering Data Clouds,
Proceedings of the 2nd International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (IEEE-ISoLA '06), pp. 198-203.
conference
Geometric Distance Estimation for Sensor Networks and Unit Disk Graphs,
Proceedings of the 16th Fall Workshop on Computational Geometry (
FWCG 2006).
conference
Algorithmic Aspects of Large Sensor Networks,
Proceedings of Mobility and Scalability in Wireless Sensor Networks (
MSWSN '06), pp. 141-152.
conference
Minimizing Communication Cost for Reconfigurable Slot Modules,
Proceedings of the 16th International Conference on Field-Programmable Logic and Applications (FPL2006), 535-540.
conference
Optimal Simultaneous Scheduling, Binding and Routing for Processor-Like Reconfigurable Architectures,
Proceedings of the 16th International Conference on Field-Programmable Logic and Applications (FPL2006), 527-534.
conference
Estimating Distances Using Neighborhood Intersection,
Proceedings of the 11th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA 2006).
conference
Hovering Data Clouds: A Decentralized and Self-organizing Information System,
Proceedings of the 1st International Workshop on Self-Organizing Systems (IWSOS 2006), 243-247.
journal article
Online Searching with Turn Cost,
Theoretical Computer Science, 361 (2006), pp. 342-355.
journal article
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots,
Algorithmica, 46 (2006), pp. 193-221.
conference
Simultaneous Scheduling, Binding and Routing for Coarse-Grain Reconfigurable Architectures,
Electronic Notes in Discrete Mathematics, 25 (2006), 21-22.
conference
Geometry-Based Reasoning for a Large Sensor Network,
Proceedings of the 22nd Annual ACM Symposium on Computational Geometry (
SoCG 2006), pp. 475-476.
conference
Locked and Unlocked Chains of Planar Shapes,
Proceedings of the 22nd Annual ACM Symposium on Computational Geometry (
SoCG 2006), pp. 61-70.
conference
Minimum-Cost Coverage of Point Sets by Disks,
Proceedings of the 22nd Annual ACM Symposium on Computational Geometry (
SoCG 2006), 449-458.
journal article
Online Searching with an Autonomous Robot,
Computational Geometry: Theory and Applications, 34 (2), 2006, pp. 102-115.
conference
Deterministic Boundary Recognition and Topology Extraction for Large Sensor Networks,
Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), pp. 1000-1009.
journal article
Optimal Covering Tours with Turn Costs,
SIAM Journal on Computing, 35 (2005), pp. 531-566.
conference
DyNoC: A Dynamic Infrastructure for Communication in Dynamically Reconfigurable Devices,
Proceedings of the 15th International Conference on Field-Programmable Logic and Applications (FPL 2005), pp. 153-158.
conference
Communication-Aware Processor Allocation for Supercomputers,
Proceedings of the 9th International Workshop on Algorithms and Data Structures (WADS 2005), Springer LNCS #3608, pp. 169-181.
conference
A New Approach for Boundary Recognition in Geometric Sensor Networks,
Proceedings of the 17th Canadian Conference on Computational Geometry (
CCCG 2005), pp. 82-85.
conference
The Erlangen Slot Machine: A Highly Flexible FPGA-Based Reconfigurable Platform,
Proceedings of the 13th IEEE Symposium on Field-Programmable Custom Computing Machine (FPCCM 2005), pp. 319-320.
conference
How to water carrots: geometric coverage problems for point sets,
Proceedings ofthe 15th Annual Fall Workshop on Computational Geometry and Vizualization (FWCG 2005), pp. 71-72.
conference
Defragmenting the Module Layout of a Partially Reconfigurable Device,
Proceedings of the 2005 International Conference on Engineering of Reconfigurable Systems and Algorithms (ERSA), Distinguished Paper, pp. 92-101, 2005.
conference
Defragmenting the Module Layout of a Partially Reconfigurable Device,
Proceedings of the 16th International Workshop on Rapid System Prototyping (RSP 2005), pp. 84-90.
book chapter
Online Searching with an Autonomous Robot,
conference
Shawn: A New Approach to Simulating Wireless Sensor Networks,
Proceedings of the 3rd Symposium on Design, Analysis, and Simulation of Distributed Systems (DASD '05), pp. 117-124.
journal article
On the Continuous Fermat-Weber Problem,
Operations Research, 53 (2005), 61-76.
journal article
Koordinatenfreies Lokationsbewusstsein (Localization without Coordinates),
journal article
SpyGlass: A Wireless Sensor Network Visualizer,
journal article
The One-Round Voronoi Game Replayed,
Computational Geometry: Theory and Applications, 30 (2005), pp. 81-94.
journal article
A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems,
Mathematical Methods of Operations Research, 60 (2004), 311-329.
conference
SpyGlass: Taking a Closer Look Into Sensor Networks,
Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems (ACM SenSys 2004), pp. 301-302.
conference
Optimal Routing-Conscious Dynamic Placement for Reconfigurable Devices,
Proceedings of the 14th International Conference on Field-Programmable Logic and Application (FPL 2004), Springer LNCS #3203, 2004, pp. 847-851.
conference
Online Searching with an Autonomous Robot,
Proceedings of the 6th International Workshop on Algorithmic Foundations of Robotics (WAFR2004), 335-350.
conference
Neighborhood-Based Topology Recognition in Sensor Networks ,
Proceedings of the 1st International Workshop on Algorithmic Aspects Wireless Sensor Networks (ALGOSENSORS 2004), Springer LNCS #3121, 2004, pp. 123-136.
conference
Searching with an Autonomous Robot,
Proceedings of the 20th Annual ACM Symposium on Computational Geometry (SoCG 2004), pp. 449-450.
journal article
A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing,
Mathematics of Operations Research, 29 (2004), pp. 353-368.
journal article
Traveling Salesmen in the Presence of Competition,
Theoretical Computer Science, 313 (2004), pp. 377-392.
conference
Minimizing the Stabbing Number of Matchings, Trees, and Triangulations,
Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2004), pp. 437-446.
journal article
What is the optimal shape of a city?,
Journal of Physics A: Mathematical and General, 37 (2004), pp. 147-159.
journal article
Maximum Dispersion and Geometric Maximum Weight Cliques,
Algorithmica, 38 (3) (2003), pp. 501-511.
journal article
Characterizing Matching as the Intersection of Matroids,
Mathematical Methods of Operations Research, 58 (2003), pp. 319-329.
journal article
The Complexity of Economic Equilibria for House Allocation Markets,
Information Processing Letters, 88 (2003), pp. 219-223.
journal article
The Geometric Maximum Traveling Salesman Problem,
Journal of the ACM, 50 (2003), 641-664.
conference
The One-Round Voronoi Game Replayed,
Proceedings of the 8th International Workshop on Algorithms and Data Structues. Springer LNCS #2748, 2003, pp. 150-161.
book chapter
Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments,
book chapter
On the Reflexivity of Point Sets,
B. Aronov, S. Basu, J. Pach, and M. Sharir (eds.): Discrete and Computational Geometry - The Goodman-Pollack Festschrift. Series "Algorithms and Combinatorics", vol. 25, Springer-Verlag 2003, pp. 139--156.
conference
Online Dispersion Algorithms for Swarms of Robots,
Proceedings of the 19th Annual ACM Symposium on Computational Geometry (SoCG '03), 382-383.
workshop
The One-Round Voronoi Game Replayed,
Proceedings of the 19th European Conference on Computational Geometry (EuroCG 2003), 15-18.
journal article
An Algorithmic Study of Manufacturing Paperclips and other Folded Structures,
Computational Geometry: Theory and Applications. 25 (2003), 117-138.
journal article
Solving a ''Hard'' Problem to Approximate an ''Easy'' One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems,
Journal of Experimental Algorithms. 7 (2002), article 11.
conference
The Freeze-Tag Problem: How to Wake Up a Swarm of Robots,
Proceedings of the 13th ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 568-577.
book chapter
Orthogonal graph drawing,
In: M. Kaufmann, D. Wagner, eds., Drawing Graphs -- Models and Methods, Springer LNCS #2025, 2001, pp. 121-171.
conference
Matching as the intersection of matroids,
Electronic Notes in Discrete Mathematics, vol. 10 (special issue for Euroconference on Combinatorics, Graph Theory and Applications), Elsevier Science 2001.
journal article
Terrain Decomposition and Layered Manufacturing,
International Journal of Computational Geometry & Applications, 11 (6), 2001, pp. 647-668.
journal article
New Classes of Fast Lower Bounds for Bin Packing Problems,
Mathematical Programming, 91 (2001), pp. 11-31.
conference
Solving a "hard" problem to approximate and "easy" one: good and fast heuristics for large geometric maximum matching and maximum Traveling Salesman problems,
Proceedings of the 3rd International Workshop on Algorithm Engineering and Experiments (ALENEX'01), Springer LNCS #2153, 2001, pp. 1-16.
conference
Higher-Dimensional Packing with order Constraints,
Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS 2001), Springer LNCS #2125, 2001, pp. 300-312.
conference
On the reflexivity of point sets,
Proceedings of the 7th International Workshop on Algorithms and Data Structures (WADS 2001), Springer LNCS #2125, 2001, pp. 192-204.
workshop
Extending Partial Suborders,
Electronic Notes in Discrete Mathematics, vol. 8, (special issue for the Cologne-Twente Workshop on Graphs and Combinatorial Optimization), Elsevier Science, 2001.
workshop
The Freeze-Tag Problem: Theoretical and Experimental Investigations,
Proceedings of the 11th Fall Workshop on Computational Geometry (FWCG 2001).
conference
Optimal FPGA Module Placement with Temporal Precedence Constraints,
Proceedings of the Conference on Design, Automation and Test in Europe (DATE 2001), pp. 658-667.
journal article
Optimization of Dynamic Hardware Reconfigurations,
Journal of Supercomputing, 19 (2001), pp. 57-75.
journal article
C. Baur,
S.P. Fekete:
Approximation of Geometric Dispersion Problems,
Algorithmica, 30 (2001), pp. 451-470.
journal article
Two-Dimensional Rendezvous Search,
Operations Research, 49 (2001), pp. 107-118.
journal article
S.P. Fekete,
J. Kremer:
Tree spanners in planar graphs,
Discrete Applied Mathematics, 108 (2001), pp. 85-103.
workshop
On the Manufacturability of Paperclips and Sheet Metal Structures,
Proceedings of the 17th European Workshop on Computational Geometry (EuroCG 2001), pp. 187-190.
conference
Optimal Covering Tours with Turn Costs,
Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 01), pp. 138-147.
journal article
Approximation Algorithms for Lawn Mowing and Milling,
Computational Geometry: Theory and Applications, 17 (2000), pp. 25-50.
workshop
On the reflexivity of point sets,
Proceedings of the 10th Annual Fall Workshop On Computational Geometry (FWCG 2000), Stony Brook, NY.
conference
On the Continuous Weber and k-Median Problems,
Proceedings of the 16th Annual ACM Symposium on Computational Geometry (SoCG 2000), pp. 70-79.
conference
Maximum Dispersion and Geometric Maximum Weight Cliques,
Proceedings of the 3rd International workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 2000), pp. 132-141.
journal article
On Minimum Stars and Maximum Matchings,
Discrete and Computational Geometry, 2000, pp. 389-407.
journal article
S.P. Fekete:
On Simple Polygonalizations with Optimal Area,
Discrete and Computational Geometry, 23 (2000), pp. 73-110.
conference
Compile-Time Optimization of Dynamic Hardware Reconfigurations,
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA'99), pp. 1097-1103.
conference
On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings,
Proceedings of the 15th Annual ACM Symposium on Computational Geometry (SoCG 1999), pp. 217-226.
conference
S.P. Fekete:
Simplicity and Hardness of the Maximum Traveling Salesman Problem under Geometric Distances,
Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 99), pp. 337-345.
book chapter
The Complexity of an Inverse Shortest Path Problem,
In: R. Graham, J. Kratochvil, J. Nesetril, F. Roberts, eds., Contemporary Trends Discrete Mathematics, vol. 49, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, AMS, 1999, pp. 113-127.
journal article
Rectangle and Box Visibility Graphs in 3D,
International Journal of Computational Geometry and its Applications, 9 (1999), pp. 1-27.
conference
S.P. Fekete,
J. Kremer:
Tree Spanners in Planar Graphs,
Proceedings of the 24th International Annual Workshop on Graph-Theoretic Concepts in Computer Science (WG '98). Springer LNCS #1517, 1998, pp. 298-309.
journal article
The Nucleon of Cooperative Games and an Algorithm for Matching Games,
Mathematical Programming, 83 (1998), pp. 195-211.
journal article
Traveling the Boundary of Minkowski Sums,
Information Processing Letters, 66 (1998), pp. 171-174.
conference
C. Baur,
S.P. Fekete:
Approximation of Geometric Dispersion Problems,
Proceedings of the International Workshop on Approximation Algorithms for Combinatorial Optimization (APPROX 98), Springer LNCS #1444, 1998, pp. 63-75.
conference
New Classes of Lower Bounds for Bin Packing Problems,
Proceedings of the 6th International IPCO Conference on Integer Programming and Combinatorial Optimization (IPCO 98), Springer LNCS #1412, 1998, pp. 257-270.
conference
E.J. Anderson,
S.P. Fekete:
Asymmetric Rendezvous on the Plane,
Proceedings of the 14th Annual ACM Symposium on Computational Geometry (SoCG '98), pp. 365-373.
journal article
P. Bose,
H. Everett,
S.P. Fekete,
M. Houle,
A. Lubiw,
H. Meijer,
K. Romanik,
G. Rote,
T. Shermer,
S. Whitesides,
C. Zelle:
A Visibility Representation for Graphs in Three Dimensions,
Journal of Graph Algorithms and Applications, 2 (3) (1998).
journal article
On Approximately Fair Cost Allocation for the Euclidean Traveling Salesman Problem,
OR Spectrum, 20 (1998), pp. 29-37.
conference
The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems,
Proceedings of the 5th International Symposium on Graph Drawing (GD '97), Springer LNCS #1353, 1998, pp. 272-283.
journal article
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees,
Journal of Algorithms, 24 (1997), pp. 310-324.
conference
A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems,
Proceedings of the 5th Annual European Symposium on Algorithms (ESA '97), Springer LNCS #1284, 1997, pp. 144-156.
journal article
On the Complexity of Testing Membership in the Core of Min-Cost Spanning Tree Games,
International Journal of Game Theory, 26 (1997), pp. 361-366.
journal article
Angle-Restricted Tours in the Plane,
Computational Geometry: Theory and Applications, 8 (1997), pp. 195-218.
conference
A. Bachem,
S.P. Fekete,
B. Knab,
R. Schrader,
I. Vannahme,
I. Weber,
R. Wegener,
K. Weinbrecht,
B. Wichern:
Analyse großer Datenmengen und Clusteralgorithmen im Bausparwesen,
In: C. Hipp, Geld, Finanzwirtschaft, Banken und Versicherungen, VVW Karlsruhe, 1997, pp. 955-961.
Habilitationsschrift
S.P. Fekete:
Geometric Ideas for Graph Representation and for Cooperative Game Theory,
Habilitationsschrift, Universität zu Köln, 1997.
tech report
On higher-dimensional packing I: Modeling,
Technical Report ZPR 97-288. Note: There is a more recent journal version! (In Mathematics of Operations Research, see above.)
tech report
On higher-dimensional packing II: Bounds,
Technical Report ZPR 97-289. Note: There is a more recent journal version! (In Mathematical Methods of Operations Research, see above.)
tech report
On higher-dimensional packing III: Exact algorithms,
Technical Report ZPR 97-290. Note: There is a more recent journal version! (To appear in Operations Research, see above.)
tech report
S.P. Fekete,
M. Schmitt:
Traveling Salesmen in the Age of Competition,
Technical Report ZPR 97-266. 1997, 5 pages.
conference
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees,
Proceedings of the 5th International Conference on Integer Programming and Combinatorial Optimization (IPCO 96), Springer LNCS #1084, 1996, pp. 105-117.
tech report
Geometrische Verdrahtungsprobleme,
Technical Report ZPR 96-247. 1996, 81 pages.
conference
New Results on a Visibility Representation of Graphs in 3D,
Proceedings of the 3rd International Symposium on Graph Drawing (GD '95), Springer LNCS #1072, 1996, pp. 234-241.
workshop
Rectangle and Box Visibility Graphs in 3D,
Proceedings of the 12th European Workshop on Computational Geometry (EuroCG '96), pp. 31-34.
workshop
S.P. Fekete,
M. Klemmstein:
Worst-Case Ratios for Bounded-Degree Trees,
Proceedings of the 4th Biannual Twente Workshop on Graph Theory and Discrete Optimization, Twente, 1995, pp. 103-106.
journal article
On a Visibility Representation for Graphs in Three Dimensions,
In: D. Avis, P. Bose, eds.: Snapshots of Computational and Discrete Geometry, 3 (1994), Montreal, pp. 2-25.
conference
Area Optimization of Simple Polygons,
Proceedings of the 9th Annual ACM Symposium on Computational Geometry (SoCG '93), pp. 173-182.
conference
The lawnmower problem,
Proceedings of the 5th Canadian Conference on Computational Geometry (CCCG '93), pp. 461-466.
workshop
On Approximately Fair Cost Allocation for the Euclidean Traveling Salesman Problem,
In: A. Bachem, U. Derigs, M. Jünger, R. Schrader, Operations Research '93, pp. 153-156.
conference
3-dimensional visibility representation of graphs,
Proceedings of the ALCOM International Workshop on Graph Drawing (GD '93), pp. 40-41.
technical report
Backward Error Analysis for the Travelling Salesman Problem: Generalized Convexity,
Technical Report ZPR 93-142, 1993.
Ph.D. thesis
S.P. Fekete:
Geometry and the Travelling Salesman Problem,
Ph.D. thesis. University of Waterloo, 1992.
conference
S.P. Fekete:
Finding all anchored squares in a convex polygon in subquadratic time,
Proceedings of the 4th Canadian Conference on Computational Geometry (CCCG 1992), pp. 71-76.
Last update: Mon Jan 30 10:40:17 CET 2012
Sandor Fekete, s.fekete AT tu-bs.de