Sándor P. Fekete

Orcid: 0000-0002-9062-4241

Affiliations:
  • TU Braunschweig, Institute of Operating Systems and Computer Networks, Germany
  • TU Berlin, Department of Mathematics, Germany (former)
  • University of Cologne, Center for Parallel Computing, Germany (former)
  • University of Waterloo, ON, Canada (PhD 1992)


According to our database1, Sándor P. Fekete authored at least 257 papers between 1993 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Efficiently reconfiguring a connected swarm of labeled robots.
Auton. Agents Multi Agent Syst., December, 2024

What Goes Around Comes Around: Covering Tours and Cycle Covers with Turn Costs.
Theory Comput. Syst., October, 2024

Coordinated Motion Planning: Multi-Agent Path Finding in a Densely Packed, Bounded Domain.
CoRR, 2024

Dispersive Vertex Guarding for Simple and Non-Simple Polygons.
CoRR, 2024

Maximum Polygon Packing: The CG: SHOP Challenge 2024.
CoRR, 2024

Edge Sparsification for Geometric Tour Problems.
Comput. Geom. Topol., 2024

Reconfiguration of a 2D Structure Using Spatio-Temporal Planning and Load Transferring.
Proceedings of the IEEE International Conference on Robotics and Automation, 2024

2023
Minimum Partition into Plane Subgraphs: The CG:SHOP Challenge 2022.
ACM J. Exp. Algorithmics, December, 2023

Connected coordinated motion planning with bounded stretch.
Auton. Agents Multi Agent Syst., October, 2023

Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 23091).
Dagstuhl Reports, February, 2023

Competitive location problems: balanced facility location and the One-Round Manhattan Voronoi Game.
Ann. Oper. Res., February, 2023

Packing Disks into Disks with Optimal Worst-Case Density.
Discret. Comput. Geom., 2023

Realistic Runtime Analysis for Quantum Simplex Computation.
CoRR, 2023

Minimum Coverage by Convex Polygons: The CG: SHOP Challenge 2023.
CoRR, 2023

Parallel Online Algorithms for the Bin Packing Problem.
Algorithmica, 2023

The Lawn Mowing Problem: From Algebra to Algorithms.
Proceedings of the 31st Annual European Symposium on Algorithms, 2023

A Closer Cut: Computing Near-Optimal Lawn Mowing Tours.
Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2022
Computing Coordinated Motion Plans for Robot Swarms: The CG: SHOP Challenge 2021.
ACM J. Exp. Algorithmics, 2022

Computing Area-Optimal Simple Polygonizations.
ACM J. Exp. Algorithmics, 2022

Area-Optimal Simple Polygonalizations: The CG Challenge 2019.
ACM J. Exp. Algorithmics, 2022

Minimum Scan Cover and Variants: Theory and Experiments.
ACM J. Exp. Algorithmics, 2022

Cooperative 2D Reconfiguration using Spatio-Temporal Planning and Load Transferring.
CoRR, 2022

Minimum Partition into Plane Subgraphs: The CG: SHOP Challenge 2022.
CoRR, 2022

Robust disease module mining via enumeration of diverse prize-collecting Steiner trees.
Bioinform., 2022

Connected Reconfiguration of Lattice-Based Cellular Structures by Finite-Memory Robots.
Algorithmica, 2022

Gathering Physical Particles with a Global Magnetic Field Using Reinforcement Learning.
Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems, 2022

Space Ants: Episode II - Coordinating Connected Catoms (Media Exposition).
Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021
Minimum Scan Cover with Angular Transition Costs.
SIAM J. Discret. Math., 2021

Worst-Case Optimal Squares Packing into Disks.
J. Comput. Geom., 2021

Folding polyominoes with holes into a cube.
Comput. Geom., 2021

CADbots: Algorithmic Aspects of Manipulating Programmable Matter with Finite Automata.
Algorithmica, 2021

Packing Squares into a Disk with Optimal Worst-Case Density.
Proceedings of the 37th International Symposium on Computational Geometry, 2021

Can You Walk This? Eulerian Tours and IDEA Instructions (Media Exposition).
Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020
Coordinated Particle Relocation Using Finite Static Friction With Boundary Walls.
IEEE Robotics Autom. Lett., 2020

Computing Convex Partitions for Point Sets in the Plane: The CG: SHOP Challenge 2020.
CoRR, 2020

Existence and Hardness of Conveyor Belts.
Electron. J. Comb., 2020

Tilt Assembly: Algorithms for Micro-factories That Build Objects with Uniform External Forces.
Algorithmica, 2020

Probing a Set of Trajectories to Maximize Captured Information.
Proceedings of the 18th International Symposium on Experimental Algorithms, 2020

Coordinating Swarms of Objects at Extreme Dimensions.
Proceedings of the Combinatorial Algorithms - 31st International Workshop, 2020

Recognition and Reconfiguration of Lattice-Based Cellular Structures by Simple Robots.
Proceedings of the 2020 IEEE International Conference on Robotics and Automation, 2020

Targeted Drug Delivery: Algorithmic Methods for Collecting a Swarm of Particles with Uniform, External Forces.
Proceedings of the 2020 IEEE International Conference on Robotics and Automation, 2020

Covering Rectangles by Disks: The Video (Media Exposition).
Proceedings of the 36th International Symposium on Computational Geometry, 2020

Worst-Case Optimal Covering of Rectangles by Disks.
Proceedings of the 36th International Symposium on Computational Geometry, 2020

How to Make a CG Video (Media Exposition).
Proceedings of the 36th International Symposium on Computational Geometry, 2020

Coordinated Particle Relocation with Global Signals and Local Friction (Media Exposition).
Proceedings of the 36th International Symposium on Computational Geometry, 2020

Space Ants: Constructing and Reconfiguring Large-Scale Structures with Finite Automata (Media Exposition).
Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019
Geometric Aspects of Robot Navigation: From Individual Robots to Massive Particle Swarms.
Proceedings of the Distributed Computing by Mobile Entities, 2019

Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch.
SIAM J. Comput., 2019

Particle computation: complexity, algorithms, and logic.
Nat. Comput., 2019

Split Packing: Algorithms for Packing Circles with Optimal Worst-Case Density.
Discret. Comput. Geom., 2019

Connected Assembly and Reconfiguration by Finite Automata.
CoRR, 2019

Online Circle Packing.
Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition).
Proceedings of the 35th International Symposium on Computational Geometry, 2019

Covering Tours and Cycle Covers with Turn Costs: Hardness and Approximation.
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

Automated Data Retrieval from Large-Scale Distributed Satellite Systems.
Proceedings of the 15th IEEE International Conference on Automation Science and Engineering, 2019

Practical Methods for Computing Large Covering Tours and Cycle Covers with Turn Cost.
Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments, 2019

2018
Conflict-Free Coloring of Graphs.
SIAM J. Discret. Math., 2018

Efficient Parallel Self-Assembly Under Uniform Control Inputs.
IEEE Robotics Autom. Lett., 2018

Geometric Hitting Set for Segments of Few Orientations.
Theory Comput. Syst., 2018

Computing maxmin edge length triangulations.
J. Comput. Geom., 2018

Universal Guard Problems.
Int. J. Comput. Geom. Appl., 2018

Conflict-Free Coloring of Intersection Graphs.
Int. J. Comput. Geom. Appl., 2018

Folding Polyominoes into (Poly)Cubes.
Int. J. Comput. Geom. Appl., 2018

Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 18331).
Dagstuhl Reports, 2018

Connecting a set of circles with minimum sum of radii.
Comput. Geom., 2018

Autonomous Vehicles: From Individual Navigation to Challenges of Distributed Swarms (Invited Talk).
Proceedings of the 32nd International Symposium on Distributed Computing, 2018

Don't Rock the Boat: Algorithms for Balanced Dynamic Loading and Unloading.
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

On Designing 2D Discrete Workspaces to Sort or Classify Polynminoes.
Proceedings of the 2018 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2018

U sing a UAV for Destructive Surveys of Mosquito Population.
Proceedings of the 2018 IEEE International Conference on Robotics and Automation, 2018

Coordinated Motion Planning: The Video (Multimedia Exposition).
Proceedings of the 34th International Symposium on Computational Geometry, 2018

Hardware and Software Task Scheduling for ARM-FPGA Platforms.
Proceedings of the 2018 NASA/ESA Conference on Adaptive Hardware and Systems, 2018

2017
New geometric algorithms for fully connected staged self-assembly.
Theor. Comput. Sci., 2017

Cost-Oblivious Storage Reallocation.
ACM Trans. Algorithms, 2017

Algorithmic Foundations of Programmable Matter Dagstuhl Seminar 16271.
SIGACT News, 2017

An efficient data structure for dynamic two-dimensional reconfiguration.
J. Syst. Archit., 2017

Computing nonsimple polygons of minimum perimeter.
J. Comput. Geom., 2017

Lower Bounds for Graph Exploration Using Local Policies.
J. Graph Algorithms Appl., 2017

Guest Editors' Foreword.
Discret. Comput. Geom., 2017

Online Square-into-Square Packing.
Algorithmica, 2017

Connectivity Graphs of Uncertainty Regions.
Algorithmica, 2017

Split Packing: Packing Circles into Triangles with Optimal Worst-Case Density.
Proceedings of the Algorithms and Data Structures - 15th International Symposium, 2017

Three Colors Suffice: Conflict-Free Coloring of Planar Graphs.
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 2017

Mapping and coverage with a particle swarm controlled by uniform inputs.
Proceedings of the 2017 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2017

Zapping Zika with a Mosquito-Managing Drone: Computing Optimal Flight Patterns with Minimum Turn Cost (Multimedia Contribution).
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

Resource-efficient dynamic partial reconfiguration on FPGAs for space instruments.
Proceedings of the 2017 NASA/ESA Conference on Adaptive Hardware and Systems, 2017

2016
Improved Approximation Algorithms for Relay Placement.
ACM Trans. Algorithms, 2016

Structured triangulation in multi-robot systems: Coverage, patrolling, Voronoi partitions, and geodesic centers.
Int. J. Robotics Res., 2016

Distributed Object Characterization with Local Sensing by a Multi-robot System.
Proceedings of the Distributed Autonomous Robotic Systems, 2016

Collecting a swarm in a grid environment using shared, global inputs.
Proceedings of the IEEE International Conference on Automation Science and Engineering, 2016

2015
The minimum backlog problem.
Theor. Comput. Sci., 2015

Facets for Art Gallery Problems.
Algorithmica, 2015

Reallocation Problems in Scheduling.
Algorithmica, 2015

Cost-Oblivious Reallocation for Scheduling and Planning.
Proceedings of the 27th ACM on Symposium on Parallelism in Algorithms and Architectures, 2015

Universal Computation with Arbitrary Polyomino Tiles in Non-Cooperative Self-Assembly.
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 2015

Size-Dependent Tile Self-Assembly: Constant-Height Rectangles and Stability.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

A parallel distributed strategy for arraying a scattered robot swarm.
Proceedings of the 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2015

Distributed cohesive control for robot swarms: Maintaining good connectivity in the presence of exterior forces.
Proceedings of the 2015 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2015

Particle computation: Device fan-out and binary memory.
Proceedings of the IEEE International Conference on Robotics and Automation, 2015

Local policies for efficiently patrolling a triangulated region by a robot swarm.
Proceedings of the IEEE International Conference on Robotics and Automation, 2015

Tilt: The Video - Designing Worlds to Control Robot Swarms with Only Global Signals.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

Finding Longest Geometric Tours.
Proceedings of the Gems of Combinatorial Optimization and Graph Algorithms, 2015

2014
A competitive strategy for distance-aware online shape allocation.
Theor. Comput. Sci., 2014

Covering Folded Shapes.
J. Comput. Geom., 2014

Complexity of the General Chromatic Art Gallery Problem.
CoRR, 2014

Online Square Packing with Gravity.
Algorithmica, 2014

Geodesic topological voronoi tessellations in triangulated environments with multi-robot systems.
Proceedings of the 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2014

Exploration via structured triangulation by a multi-robot system with bearing-only low-resolution sensors.
Proceedings of the 2014 IEEE International Conference on Robotics and Automation, 2014

Particle computation: Designing worlds to control robot swarms with only global signals.
Proceedings of the 2014 IEEE International Conference on Robotics and Automation, 2014

One Tile to Rule Them All: Simulating Any Tile Assembly System with a Single Universal Tile.
Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

On the Chromatic Art Gallery Problem.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Efficient reconfiguration of processing modules on FPGAs for space instruments.
Proceedings of the 2014 NASA/ESA Conference on Adaptive Hardware and Systems, 2014

2013
Online Exploration and Triangulation in Orthogonal Polygonal Regions.
Proceedings of the WALCOM: Algorithms and Computation, 7th International Workshop, 2013

Point guards and point clouds: solving general art gallery problems.
Proceedings of the Symposium on Computational Geometry 2013, 2013

Triangulating unknown environments using robot swarms.
Proceedings of the Symposium on Computational Geometry 2013, 2013

Reconfiguring Massive Particle Swarms with Limited, Global Control.
Proceedings of the Algorithms for Sensor Systems, 2013

2012
Dynamic Defragmentation of Reconfigurable Devices.
ACM Trans. Reconfigurable Technol. Syst., 2012

Exact solutions and bounds for general art gallery problems.
ACM J. Exp. Algorithmics, 2012

Minimum covering with travel cost.
J. Comb. Optim., 2012

One Tile to Rule Them All: Simulating Any Turing Machine, Tile Assembly System, or Tiling System with a Single Puzzle Piece
CoRR, 2012

The Complexity of MaxMin Length Triangulation
CoRR, 2012

Flexible experimentation in wireless sensor networks.
Commun. ACM, 2012

Algorithmik an der TU Braunschweig.
Proceedings of the 40 Jahre Informatik an der Technischen Universität Braunschweig, 1972, 2012

2011
A survey on relay placement with runtime and approximation guarantees.
Comput. Sci. Rev., 2011

Distributed algorithm engineering for networks of tiny artifacts.
Comput. Sci. Rev., 2011

Disruption Management with Rescheduling of Trips and Vehicle Circulations
CoRR, 2011

Integer point sets minimizing average pairwise L<sub>1</sub> distance: What is the optimal shape of a town?
Comput. Geom., 2011

Exploring and Triangulating a Region by a Swarm of Robots.
Proceedings of the Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques, 2011

Methods for Improving the Flow of Traffic.
Proceedings of the Organic Computing - A Paradigm Shift for Complex Systems, 2011

Hovering Data Clouds for Organic Computing.
Proceedings of the Organic Computing - A Paradigm Shift for Complex Systems, 2011

2010
Empowered by wireless communication: Distributed methods for self-organizing traffic collectives.
ACM Trans. Auton. Adapt. Syst., 2010

Simultaneous Event Execution in Heterogeneous Wireless Sensor Networks.
J. Networks, 2010

Locked and Unlocked Chains of Planar Shapes.
Discret. Comput. Geom., 2010

No-Break Dynamic Defragmentation of Reconfigurable
CoRR, 2010

Shortest Paths with Pairwise-Distinct Edge Labels: Finding Biochemical Pathways in Metabolic Networks
CoRR, 2010

Integer Point Sets Minimizing Average Pairwise L1-Distance: What is the Optimal Shape of a Town?
CoRR, 2010

Circle Packing for Origami Design Is Hard
CoRR, 2010

Empowered by Wireless Communication: Self-Organizing Traffic Collectives
CoRR, 2010

Maintaining Virtual Areas on FPGAs using Strip Packing with Delays
CoRR, 2010

Polygon exploration with time-discrete vision.
Comput. Geom., 2010

Real-World G-Lab: Integrating Wireless Sensor Networks with the Future Internet.
Proceedings of the Testbeds and Research Infrastructures. Development of Networks and Communities, 2010

Topology Virtualization for Wireless Sensor Network Testbeds.
Proceedings of the Testbeds and Research Infrastructures. Development of Networks and Communities, 2010

Hallway Monitoring: Distributed Data Processing with Wireless Sensor Networks.
Proceedings of the Real-World Wireless Sensor Networks - 4th International Workshop, 2010

Demo Abstract: Bridging the Gap between Simulated Sensor Nodes and the Real World.
Proceedings of the Real-World Wireless Sensor Networks - 4th International Workshop, 2010

A Protocol for Self-Synchronized Duty-Cycling in Sensor Networks: Generic Implementation in Wiselib.
Proceedings of the Sixth International Conference on Mobile Ad-hoc and Sensor Networks, 2010

Virtual area management: Multitasking on dynamically partially reconfigurable devices.
Proceedings of the 24th IEEE International Symposium on Parallel and Distributed Processing, 2010

Wiselib: A Generic Algorithm Library for Heterogeneous Sensor Networks.
Proceedings of the Wireless Sensor Networks, 7th European Conference, 2010

Evacuation of Rectilinear Polygons.
Proceedings of the Combinatorial Optimization and Applications, 2010

ReCoNodes - Optimization Methods for Module Scheduling and Placement on Reconfigurable Hardware Devices.
Proceedings of the Dynamically Reconfigurable Systems - Architectures, 2010

2009
A minimization version of a directed subgraph homeomorphism problem.
Math. Methods Oper. Res., 2009

Not being (super)thin or solid is hard: A study of grid Hamiltonicity.
Comput. Geom., 2009

Online Square Packing.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Hallway monitoring with sensor networks.
Proceedings of the 7th International Conference on Embedded Networked Sensor Systems, 2009

Not All Fair Probabilistic Schedulers Are Equivalent.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Flash Mob Organization in Heterogeneous Wireless Sensor Networks.
Proceedings of the NTMS 2009, 2009

Designing a Decentralized Traffic Information System - AutoNomos.
Proceedings of the Kommunikation in Verteilten Systemen (KiVS), 2009

Maintaining Arrays of Contiguous Objects.
Proceedings of the Fundamentals of Computation Theory, 17th International Symposium, 2009

Algorithms and Simulation Methods for Topology-Aware Sensor Networks.
Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

09371 Abstracts Collection - Algorithmic Methods for Distributed Cooperative Systems.
Proceedings of the Algorithmic Methods for Distributed Cooperative Systems, 06.09., 2009

On the Fairness of Probabilistic Schedulers for Population Protocols.
Proceedings of the Algorithmic Methods for Distributed Cooperative Systems, 06.09., 2009

Distributed vision with smart pixels.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008
Offline and Online Aspects of Defragmenting the Module Layout of a Partially Reconfigurable Device.
IEEE Trans. Very Large Scale Integr. Syst., 2008

Staged self-assembly: nanomanufacture of arbitrary shapes with <i>O</i> (1) glues.
Nat. Comput., 2008

Minimizing the Stabbing Number of Matchings, Trees, and Triangulations.
Discret. Comput. Geom., 2008

Staged Self-Assembly:Nanomanufacture of Arbitrary Shapes with O(1) Glues
CoRR, 2008

Communication-Aware Processor Allocation for Supercomputers: Finding Point Sets of Small Average Distance.
Algorithmica, 2008

The Maximum Energy-Constrained Dynamic Flow Problem.
Proceedings of the Algorithm Theory, 2008

No-break dynamic defragmentation of reconfigurable devices.
Proceedings of the FPL 2008, 2008

Improved Approximation Algorithms for Relay Placement.
Proceedings of the Algorithms, 2008

Emergent algorithms for centroid and orientation detection in high-performance embedded cameras.
Proceedings of the 5th Conference on Computing Frontiers, 2008

2007
The Erlangen Slot Machine - A Platform for Interdisciplinary Research in Dynamically Reconfigurable Computing (ESM - Eine Hardware-Plattform für interdisziplinäre Forschung im Bereich des dynamischen rekonfigurierbaren Rechnens).
it Inf. Technol., 2007

An Exact Algorithm for Higher-Dimensional Orthogonal Packing.
Oper. Res., 2007

PackLib<sup>2</sup>: An integrated library of multi-dimensional packing problems.
Eur. J. Oper. Res., 2007

AutoCast: An Adaptive Data Dissemination Protocol for Traffic Information Systems.
Proceedings of the 66th IEEE Vehicular Technology Conference, 2007

Radio Propagation-Aware Distance Estimation Based on Neighborhood Comparison.
Proceedings of the Wireless Sensor Networks, 2007

On Rolling Cube Puzzles.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Topology and Routing in Sensor Networks.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2007

2006
Online searching with turn cost.
Theor. Comput. Sci., 2006

Higher-Dimensional Packing with Order Constraints.
SIAM J. Discret. Math., 2006

Simultaneous Scheduling, Binding and Routing for Coarse-Grain Reconfigurable Architectures.
Electron. Notes Discret. Math., 2006

Minimum-Cost Coverage of Point Sets by Disks
CoRR, 2006

Online searching with an autonomous robot.
Comput. Geom., 2006

The Freeze-Tag Problem: How to Wake Up a Swarm ofRobots.
Algorithmica, 2006

Deterministic boundary recognition and topology extraction for large sensor networks.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Recognizing Traffic Jams with Hovering Data Clouds.
Proceedings of the Leveraging Applications of Formal Methods, 2006

Minimizing Communication Cost for Reconfigurable Slot Modules.
Proceedings of the 2006 International Conference on Field Programmable Logic and Applications (FPL), 2006

Optimal Simultaneous Scheduling, Binding and Routing for Processor-Like Reconfigurable Architectures.
Proceedings of the 2006 International Conference on Field Programmable Logic and Applications (FPL), 2006

Hovering Data Clouds: A Decentralized and Self-organizing Information System.
Proceedings of the Self-Organizing Systems, First International Workshop, 2006

Polygon Exploration with Discrete Vision.
Proceedings of the Robot Navigation, 15.10. - 20.10.2006, 2006

Geometric Distance Estimation for Sensor Networks and Unit Disk Graphs.
Proceedings of the Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006, 2006

06421 Abstracts Collection -- Robot Navigation.
Proceedings of the Robot Navigation, 15.10. - 20.10.2006, 2006

06421 Executive Summary -- Robot Navigation.
Proceedings of the Robot Navigation, 15.10. - 20.10.2006, 2006

Geometry-based reasoning for a large sensor network.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

Minimum-cost coverage of point sets by disks.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
SpyGlass: a wireless sensor network visualizer.
SIGBED Rev., 2005

Optimal Covering Tours with Turn Costs.
SIAM J. Comput., 2005

Koordinatenfreies Lokationsbewusstsein (Localization without Coordinates).
it Inf. Technol., 2005

On the Continuous Fermat-Weber Problem.
Oper. Res., 2005

Defragmenting the Module Layout of a Partially Reconfigurable Device
CoRR, 2005

Shawn: A new approach to simulating wireless sensor networks
CoRR, 2005

The one-round Voronoi game replayed.
Comput. Geom., 2005

Communication-Aware Processor Allocation for Supercomputers.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

A Practical Approach for Circuit Routing on Dynamic Reconfigurable Devices.
Proceedings of the 16th IEEE International Workshop on Rapid System Prototyping (RSP 2005), 2005

DyNoC: A Dynamic Infrastructure for Communication in Dynamically Reconfigurable Devices.
Proceedings of the 2005 International Conference on Field Programmable Logic and Applications (FPL), 2005

The Erlangen Slot Machine: A Highly Flexible FPGA-Based Reconfigurable Platform.
Proceedings of the 13th IEEE Symposium on Field-Programmable Custom Computing Machines (FCCM 2005), 2005

Defragmenting the Module Layout of a Partially Reconfigurable Device.
Proceedings of The 2005 International Conference on Engineering of Reconfigurable Systems and Algorithms, 2005

Deterministic boundary recongnition and topology extraction for large sensor networks.
Proceedings of the Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005, 2005

A New Approach for Boundary Recognition in Geometric Sensor Networks.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Traveling salesmen in the presence of competition.
Theor. Comput. Sci., 2004

A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing.
Math. Oper. Res., 2004

A General Framework for Bounds for Higher-Dimensional Orthogonal Packing Problems.
Math. Methods Oper. Res., 2004

Maximum Dispersion and Geometric Maximum Weight Cliques.
Algorithmica, 2004

SpyGlass: taking a closer look at sensor networks.
Proceedings of the 2nd International Conference on Embedded Networked Sensor Systems, 2004

Optimal Routing-Conscious Dynamic Placement for Reconfigurable Devices.
Proceedings of the Field Programmable Logic and Application, 2004

Searching with an autonomous robot.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

Neighborhood-Based Topology Recognition in Sensor Networks.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks: First International Workshop, 2004

2003
Characterizing matchings as the intersection of matroids.
Math. Methods Oper. Res., 2003

The geometric maximum traveling salesman problem.
J. ACM, 2003

The complexity of economic equilibria for house allocation markets.
Inf. Process. Lett., 2003

An algorithmic study of manufacturing paperclips and other folded structures.
Comput. Geom., 2003

Online dispersion algorithms for swarms of robots.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

2002
Solving a "Hard" Problem to Approximate an "Easy" One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems.
ACM J. Exp. Algorithmics, 2002

Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments.
Proceedings of the Algorithmic Foundations of Robotics V, 2002

The freeze-tag problem: how to wake up a swarm of robots.
Proceedings of the Thirteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2002

2001
Optimization of Dynamic Hardware Reconfigurations.
J. Supercomput., 2001

New classes of fast lower bounds for bin packing problems.
Math. Program., 2001

Two Dimensional Rendezvous Search.
Oper. Res., 2001

Terrain Decomposition and Layered Manufacturing.
Int. J. Comput. Geom. Appl., 2001

Extending Partial Suborders.
Electron. Notes Discret. Math., 2001

Matching as the Intersection of Matroids.
Electron. Notes Discret. Math., 2001

Tree spanners in planar graphs.
Discret. Appl. Math., 2001

Approximation of Geometric Dispersion Problems.
Algorithmica, 2001

On the Reflexivity of Point Sets.
Proceedings of the Algorithms and Data Structures, 7th International Workshop, 2001

Optimal FPGA module placement with temporal precedence constraints.
Proceedings of the Conference on Design, Automation and Test in Europe, 2001

2000
On Minimum Stars and Maximum Matchings.
Discret. Comput. Geom., 2000

On Simple Polygonalizations with Optimal Area.
Discret. Comput. Geom., 2000

Approximation algorithms for lawn mowing and milling.
Comput. Geom., 2000

On the continuous Weber and <i>k</i>-median problems (extended abstract).
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1999
Rectangle and Box Visibility Graphs in 3D.
Int. J. Comput. Geom. Appl., 1999

Simplicity and Hardness of the Maximum Traveling Salesman Problem Under Geometric Distances.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

Compile-time Optimization of Dynamic Hardware Reconfigurations.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 1999

Orthogonal Graph Drawing.
Proceedings of the Drawing Graphs, 1999

On Minimum Stars, Minimum Steiner Stars, and Maximum Matchings.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998
A Visibility Representation for Graphs in Three Dimensions.
J. Graph Algorithms Appl., 1998

Traveling the Boundary of Minkowski Sums.
Inf. Process. Lett., 1998

New Classes of Lower Bounds for Bin Packing Problems.
Proceedings of the Integer Programming and Combinatorial Optimization, 1998

Asymmetric Rendezvous on the Plane.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997
A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning Trees.
J. Algorithms, 1997

On the complexity of testing membership in the core of min-cost spanning tree games.
Int. J. Game Theory, 1997

Angle-Restricted Tours in the Plane.
Comput. Geom., 1997

The Wobbly Logic Engine: Proving Hardness of Non-rigid Geometric Graph Representation Problems.
Proceedings of the Graph Drawing, 5th International Symposium, 1997

A New Exact Algorithm for General Orthogonal D-Dimensional Knapsack Problems.
Proceedings of the Algorithms, 1997

The complexity of an inverse shortest paths problem.
Proceedings of the Contemporary Trends in Discrete Mathematics: From DIMACS and DIMATIA to the Future, 1997

1995
On Approximately Fair Cost Allocation in Euclidean TSP Games
Electron. Colloquium Comput. Complex., 1995

The Nucleon of Cooperative Games and an Algorithm for Matching Games
Electron. Colloquium Comput. Complex., 1995

New Results on a Visibility Representation of Graphs in 3D.
Proceedings of the Graph Drawing, Symposium on Graph Drawing, 1995

1993
Area Optimization of Simple Polygons.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

The Lawnmower Problem.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993


  Loading...