| Publication | Date of Publication | Type |
|---|
The lawn mowing problem: from algebra to algorithms
| 2025-01-06 | Paper |
What goes around comes around: covering tours and cycle covers with turn costs
Theory of Computing Systems | 2024-11-12 | Paper |
Worst-case optimal covering of rectangles by disks
Discrete & Computational Geometry | 2024-10-25 | Paper |
Efficiently reconfiguring a connected swarm of labeled robots
| 2024-09-11 | Paper |
Minimum partition into plane subgraphs: the CG:SHOP challenge 2022
ACM Journal of Experimental Algorithmics | 2024-07-26 | Paper |
A closer cut: computing near-optimal lawn mowing tours
| 2024-05-24 | Paper |
Space ants: Episode II -- coordinating connected catoms (media exposition)
| 2024-05-14 | Paper |
Minimum Scan Cover and Variants: Theory and Experiments
ACM Journal of Experimental Algorithmics | 2024-04-14 | Paper |
Edge sparsification for geometric tour problems
| 2024-04-02 | Paper |
Particle computation: complexity, algorithms, and logic
Natural Computing | 2024-02-09 | Paper |
scientific article; zbMATH DE number 7788582 (Why is no real title available?)
| 2024-01-15 | Paper |
Space ants: constructing and reconfiguring large-scale structures with finite automata (media exposition)
| 2023-11-02 | Paper |
Coordinated Particle Relocation with Global Signals and Local Friction (Media Exposition).
| 2023-11-02 | Paper |
scientific article; zbMATH DE number 7760172 (Why is no real title available?)
| 2023-11-02 | Paper |
scientific article; zbMATH DE number 7760203 (Why is no real title available?)
| 2023-11-02 | Paper |
Covering rectangles by disks: the video (media exposition)
| 2023-11-02 | Paper |
Worst-case optimal covering of rectangles by disks
| 2023-11-02 | Paper |
Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game
Annals of Operations Research | 2023-06-20 | Paper |
Parallel online algorithms for the bin packing problem
Algorithmica | 2023-04-21 | Paper |
Probing a set of trajectories to maximize captured information
| 2023-02-07 | Paper |
Packing disks into disks with optimal worst-case density
Discrete & Computational Geometry | 2023-01-23 | Paper |
Worst-case optimal squares packing into disks
| 2022-10-31 | Paper |
Coordinating Swarms of Objects at Extreme Dimensions
Lecture Notes in Computer Science | 2022-10-13 | Paper |
Connected reconfiguration of lattice-based cellular structures by finite-memory robots
Algorithmica | 2022-10-06 | Paper |
Computing coordinated motion plans for robot swarms: the CG:SHOP challenge 2021
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
Computing area-optimal simple polygonizations
ACM Journal of Experimental Algorithmics | 2022-09-06 | Paper |
Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)
| 2022-07-18 | Paper |
scientific article; zbMATH DE number 7559235 (Why is no real title available?)
| 2022-07-18 | Paper |
A new exact algorithm for general orthogonal d-dimensional knapsack problems
| 2021-12-20 | Paper |
Competitive location problems: balanced facility location and the one-round Manhattan Voronoi game
| 2021-10-04 | Paper |
Connected reconfiguration of lattice-based cellular structures by finite-memory robots
Algorithms for Sensor Systems | 2021-07-08 | Paper |
Minimum scan cover with angular transition costs
SIAM Journal on Discrete Mathematics | 2021-06-28 | Paper |
CADbots: algorithmic aspects of manipulating programmable matter with finite automata
Algorithmica | 2021-02-01 | Paper |
Folding polyominoes with holes into a cube
Computational Geometry | 2021-01-07 | Paper |
Competitive Location Problems: Balanced Facility Location and the One-Round Manhattan Voronoi Game
| 2020-11-26 | Paper |
Tilt assembly: algorithms for micro-factories that build objects with uniform external forces
| 2020-11-25 | Paper |
Conflict-free coloring of intersection graphs
| 2020-11-25 | Paper |
Existence and hardness of conveyor belts
The Electronic Journal of Combinatorics | 2020-11-05 | Paper |
Parallel online algorithms for the Bin Packing Problem
| 2020-08-24 | Paper |
Coordinated motion planning: the video (multimedia exposition)
| 2020-08-18 | Paper |
Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
| 2020-08-18 | Paper |
Tilt assembly: algorithms for micro-factories that build objects with uniform external forces
Algorithmica | 2020-04-09 | Paper |
Don't rock the boat: algorithms for balanced dynamic loading and unloading
| 2020-02-12 | Paper |
Covering tours and cycle covers with turn costs: hardness and approximation
| 2020-02-06 | Paper |
Online circle packing
| 2020-01-16 | Paper |
Coordinated motion planning: reconfiguring a swarm of labeled robots with bounded stretch
SIAM Journal on Computing | 2019-12-09 | Paper |
Practical methods for computing large covering tours and cycle covers with turn cost
2019 Proceedings of the Twenty-First Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-13 | Paper |
Computing MaxMin edge length triangulations
2015 Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-12 | Paper |
Exact Solutions and Bounds for General Art Gallery Problems
2010 Proceedings of the Twelfth Workshop on Algorithm Engineering and Experiments (ALENEX) | 2019-09-11 | Paper |
Split packing: algorithms for packing circles with optimal worst-case density
Discrete & Computational Geometry | 2019-03-13 | Paper |
Computing MaxMin edge length triangulations
| 2019-02-27 | Paper |
A network-flow technique for finding low-weight bounded-degree spanning trees
Lecture Notes in Computer Science | 2019-01-11 | Paper |
Conflict-free coloring of graphs
SIAM Journal on Discrete Mathematics | 2018-11-28 | Paper |
Folding Polyominoes into (Poly)Cubes
International Journal of Computational Geometry & Applications | 2018-11-26 | Paper |
Conflict-free coloring of intersection graphs
International Journal of Computational Geometry & Applications | 2018-11-26 | Paper |
Cost-oblivious storage reallocation
ACM Transactions on Algorithms | 2018-11-05 | Paper |
Improved approximation algorithms for relay placement
ACM Transactions on Algorithms | 2018-10-30 | Paper |
Reconfiguring massive particle swarms with limited, global control
| 2018-10-17 | Paper |
Universal guard problems
International Journal of Computational Geometry & Applications | 2018-08-02 | Paper |
Three colors suffice: conflict-free coloring of planar graphs
Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms | 2018-07-16 | Paper |
Optimal Free-Space Management and Routing-Conscious Dynamic Placement for Reconfigurable Devices
IEEE Transactions on Computers | 2018-06-12 | Paper |
Universal guard problems
| 2018-04-19 | Paper |
Geometric hitting set for segments of few orientations
Theory of Computing Systems | 2018-04-12 | Paper |
Connecting a set of circles with minimum sum of radii
Computational Geometry | 2018-02-19 | Paper |
Distributed vision with smart pixels
Proceedings of the twenty-fifth annual symposium on Computational geometry | 2017-10-20 | Paper |
Tilt: the video -- designing worlds to control robot swarms with only global signals
| 2017-10-10 | Paper |
Connectivity graphs of uncertainty regions
Algorithmica | 2017-10-09 | Paper |
Universal computation with arbitrary polyomino tiles in non-cooperative self-assembly
Proceedings of the Twenty-Sixth Annual ACM-SIAM Symposium on Discrete Algorithms | 2017-10-05 | Paper |
On the continuous Weber and k -median problems (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry | 2017-09-29 | Paper |
Split packing: packing circles into triangles with optimal worst-case density
| 2017-09-22 | Paper |
New geometric algorithms for fully connected staged self-assembly
Theoretical Computer Science | 2017-05-18 | Paper |
Online square-into-square packing
Algorithmica | 2017-04-12 | Paper |
Lower bounds for graph exploration using local policies
Journal of Graph Algorithms and Applications | 2017-04-05 | Paper |
Extending partial suborders
| 2016-07-01 | Paper |
Lower bounds for graph exploration using local policies
Lecture Notes in Computer Science | 2016-05-03 | Paper |
Geometric hitting set for segments of few orientations
Lecture Notes in Computer Science | 2016-02-26 | Paper |
Size-dependent tile self-assembly: constant-height rectangles and stability
Algorithms and Computation | 2016-01-11 | Paper |
The geometric maximum traveling salesman problem
Journal of the ACM | 2015-11-12 | Paper |
The minimum backlog problem
Theoretical Computer Science | 2015-10-30 | Paper |
Reallocation problems in scheduling
Algorithmica | 2015-10-19 | Paper |
Facets for art gallery problems
Algorithmica | 2015-10-19 | Paper |
New geometric algorithms for fully connected staged self-assembly
Lecture Notes in Computer Science | 2015-09-30 | Paper |
scientific article; zbMATH DE number 6469175 (Why is no real title available?)
| 2015-08-03 | Paper |
Online square packing with gravity
Algorithmica | 2014-12-02 | Paper |
A survey on relay placement with runtime and approximation guarantees
Computer Science Review | 2014-10-24 | Paper |
A competitive strategy for distance-aware online shape allocation
Theoretical Computer Science | 2014-10-06 | Paper |
One tile to rule them all: simulating any tile assembly system with a single universal tile
Automata, Languages, and Programming | 2014-07-01 | Paper |
Exact solutions and bounds for general art gallery problems
ACM Journal of Experimental Algorithmics | 2014-04-01 | Paper |
Online square-into-square packing
Lecture Notes in Computer Science | 2013-10-04 | Paper |
Facets for art gallery problems
Lecture Notes in Computer Science | 2013-06-11 | Paper |
A competitive strategy for distance-aware online shape allocation
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Online exploration and triangulation in orthogonal polygonal regions
WALCOM: Algorithms and Computation | 2013-04-12 | Paper |
Minimum covering with travel cost
Journal of Combinatorial Optimization | 2012-10-01 | Paper |
Exploring and triangulating a region by a swarm of robots
Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques | 2011-08-17 | Paper |
Connecting a set of circles with minimum sum of radii
Lecture Notes in Computer Science | 2011-08-12 | Paper |
Integer point sets minimizing average pairwise \(L_{1}\) distance: What is the optimal shape of a town?
Computational Geometry | 2011-01-31 | Paper |
Evacuation of rectilinear polygons
Combinatorial Optimization and Applications | 2011-01-08 | Paper |
Connectivity graphs of uncertainty regions
Lecture Notes in Computer Science | 2010-12-09 | Paper |
Bild der Mathematik. Mathematiker als Superhelden
Mitteilungen der Deutschen Mathematiker-Vereinigung | 2010-10-19 | Paper |
Locked and unlocked chains of planar shapes
Discrete & Computational Geometry | 2010-09-22 | Paper |
Deterministic boundary recognition and topology extraction for large sensor networks
Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm - SODA '06 | 2010-08-16 | Paper |
The one-round Voronoi game replayed.
Lecture Notes in Computer Science | 2010-04-20 | Paper |
Minimum covering with travel cost
Algorithms and Computation | 2009-12-17 | Paper |
Polygon exploration with time-discrete vision
Computational Geometry | 2009-11-16 | Paper |
Maintaining Arrays of Contiguous Objects
Fundamentals of Computation Theory | 2009-10-20 | Paper |
Online Square Packing
Lecture Notes in Computer Science | 2009-10-20 | Paper |
An Exact Algorithm for Higher-Dimensional Orthogonal Packing
Operations Research | 2009-08-13 | Paper |
Not being (super)thin or solid is hard: A study of grid Hamiltonicity
Computational Geometry | 2009-07-27 | Paper |
On the Continuous Fermat-Weber Problem
Operations Research | 2009-07-17 | Paper |
The complexity of economic equilibria for house allocation markets
Information Processing Letters | 2009-07-09 | Paper |
Algorithms and Simulation Methods for Topology-Aware Sensor Networks
Algorithmics of Large and Complex Networks | 2009-07-09 | Paper |
Two Dimensional Rendezvous Search
Operations Research | 2009-07-03 | Paper |
A minimization version of a directed subgraph homeomorphism problem
Mathematical Methods of Operations Research | 2009-04-27 | Paper |
Minimizing the stabbing number of matchings, trees, and triangulations
Discrete & Computational Geometry | 2009-03-24 | Paper |
scientific article; zbMATH DE number 5506193 (Why is no real title available?)
| 2009-02-10 | Paper |
scientific article; zbMATH DE number 5506240 (Why is no real title available?)
| 2009-02-10 | Paper |
Minimum-cost coverage of point sets by disks
| 2009-02-10 | Paper |
Improved approximation algorithms for relay placement
Lecture Notes in Computer Science | 2008-11-25 | Paper |
Staged self-assembly: nanomanufacture of arbitrary shapes with \(O(1)\) glues
Natural Computing | 2008-09-02 | Paper |
The Maximum Energy-Constrained Dynamic Flow Problem
Algorithm Theory – SWAT 2008 | 2008-07-15 | Paper |
Angle-restricted tours in the plane.
Computational Geometry | 2008-04-25 | Paper |
Staged Self-assembly: Nanomanufacture of Arbitrary Shapes with O(1) Glues
DNA Computing | 2008-04-04 | Paper |
Communication-aware processor allocation for supercomputers: Finding point sets of small average distance
Algorithmica | 2008-04-03 | Paper |
Higher‐Dimensional Packing with Order Constraints
SIAM Journal on Discrete Mathematics | 2007-11-16 | Paper |
PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
European Journal of Operational Research | 2007-08-27 | Paper |
Simultaneous Scheduling, Binding and Routing for Coarse-Grain Reconfigurable Architectures
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
Matching as the Intersection of Matroids
Electronic Notes in Discrete Mathematics | 2007-05-29 | Paper |
The freeze-tag problem: How to wake up a swarm of robots
Algorithmica | 2006-11-06 | Paper |
Algorithms and Data Structures
Lecture Notes in Computer Science | 2006-10-25 | Paper |
Online searching with turn cost
Theoretical Computer Science | 2006-09-14 | Paper |
Optimal Covering Tours with Turn Costs
SIAM Journal on Computing | 2006-06-01 | Paper |
Online searching with an autonomous robot
Computational Geometry | 2006-05-16 | Paper |
Traveling the boundary of Minkowski sums.
Information Processing Letters | 2006-01-17 | Paper |
A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
Mathematics of Operations Research | 2005-11-11 | Paper |
scientific article; zbMATH DE number 2209713 (Why is no real title available?)
| 2005-09-28 | Paper |
Algorithmic Aspects of Wireless Sensor Networks
Lecture Notes in Computer Science | 2005-08-25 | Paper |
Solving a "Hard" problem to approximate an "Easy" one
ACM Journal of Experimental Algorithmics | 2005-08-04 | Paper |
TERRAIN DECOMPOSITION AND LAYERED MANUFACTURING
International Journal of Computational Geometry & Applications | 2005-06-10 | Paper |
The one-round Voronoi game replayed
Computational Geometry | 2005-01-31 | Paper |
A general framework for bounds for higher-dimensional orthogonal packing problems.
Mathematical Methods of Operations Research | 2005-01-11 | Paper |
The freeze-tag problem: how to wake up a swarm of robots
| 2004-11-29 | Paper |
Traveling salesmen in the presence of competition
Theoretical Computer Science | 2004-10-27 | Paper |
Maximum dispersion and geometric maximum weight cliques
Algorithmica | 2004-09-22 | Paper |
What is the optimal shape of a city?
Journal of Physics A: Mathematical and General | 2004-06-15 | Paper |
Characterizing matchings as the intersection of matroids
Mathematical Methods of Operations Research | 2003-12-16 | Paper |
An algorithmic study of manufacturing paperclips and other folded structures.
Computational Geometry | 2003-05-19 | Paper |
Solving a “Hard” Problem to Approximate an “Easy” One: Heuristics for Maximum Matchings and Maximum Traveling Salesman Problems
Algorithm Engineering and Experimentation | 2003-04-07 | Paper |
scientific article; zbMATH DE number 1830733 (Why is no real title available?)
| 2002-11-18 | Paper |
scientific article; zbMATH DE number 1830743 (Why is no real title available?)
| 2002-11-18 | Paper |
Optimization of dynamic hardware reconfigurations
The Journal of Supercomputing | 2002-07-22 | Paper |
Optimal covering tours with turn costs
| 2002-03-24 | Paper |
scientific article; zbMATH DE number 1693471 (Why is no real title available?)
| 2002-01-22 | Paper |
Approximation of geometric dispersion problems
Algorithmica | 2002-01-09 | Paper |
scientific article; zbMATH DE number 1670536 (Why is no real title available?)
| 2001-11-11 | Paper |
Tree spanners in planar graphs
Discrete Applied Mathematics | 2001-04-04 | Paper |
Approximation algorithms for lawn mowing and milling
Computational Geometry | 2001-02-22 | Paper |
New classes of fast lower bounds for bin packing problems
Mathematical Programming. Series A. Series B | 2001-01-01 | Paper |
RECTANGLE AND BOX VISIBILITY GRAPHS IN 3D
International Journal of Computational Geometry & Applications | 2000-11-07 | Paper |
scientific article; zbMATH DE number 1305423 (Why is no real title available?)
| 2000-09-26 | Paper |
On minimum stars and maximum matchings.
Discrete & Computational Geometry | 2000-04-26 | Paper |
scientific article; zbMATH DE number 1341907 (Why is no real title available?)
| 2000-01-02 | Paper |
scientific article; zbMATH DE number 1262806 (Why is no real title available?)
| 1999-08-17 | Paper |
The nucleon of cooperative games and an algorithm for matching games
Mathematical Programming. Series A. Series B | 1999-06-03 | Paper |
scientific article; zbMATH DE number 1187157 (Why is no real title available?)
| 1999-04-19 | Paper |
scientific article; zbMATH DE number 1182762 (Why is no real title available?)
| 1998-10-25 | Paper |
A Visibility Representation for Graphs in Three Dimensions
Journal of Graph Algorithms and Applications | 1998-07-05 | Paper |
On the complexity of testing membership in the core of min-cost spanning tree games
International Journal of Game Theory | 1998-04-22 | Paper |
On approximately fair cost allocation in Euclidean TSP games
OR Spektrum | 1998-04-13 | Paper |
A network-flow technique for finding low-weight bounded-degree spanning trees
Journal of Algorithms | 0001-01-03 | Paper |
