Irina Kostitsyna

MIT-NASA Space Robots Team

Cai Wood

Damien Woods

Nat. Comput., June, 2024

Ultralight, strong, and self-reprogrammable mechanical metamaterials.

[BibT_eX]

[DOI]

Sci. Robotics, January, 2024

Sorting under partial (interval order) information.

[BibT_eX]

[DOI]

J. Comput. Geom., 2024

Reconfiguration Algorithms for Cubic Modular Robots with Realistic Movement Constraints.

[BibT_eX]

[DOI]

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Optimal In-Place Compaction of Sliding Cubes.

[BibT_eX]

[DOI]

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

Universal Coating by 3D Hybrid Programmable Matter.

[BibT_eX]

[DOI]

David Liedtke

Proceedings of the Structural Information and Communication Complexity, 2024

Optimal In-Place Compaction of Sliding Cubes (Media Exposition).

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 23091).

[BibT_eX]

[DOI]

Ioannis Chatzigiannakis

Dagstuhl Reports, February, 2023

Universal Coating in the 3D Hybrid Model.

[BibT_eX]

[DOI]

David Liedtke

CoRR, 2023

Morphing Planar Graph Drawings Through 3D.

[BibT_eX]

[DOI]

Comput. Geom. Topol., 2023

Fast Reconfiguration for Programmable Matter.

[BibT_eX]

[DOI]

Tom Peters

Bettina Speckmann

Proceedings of the 37th International Symposium on Distributed Computing, 2023

2022

Minimum Scan Cover and Variants: Theory and Experiments.

[BibT_eX]

[DOI]

ACM J. Exp. Algorithmics, 2022

The Shortest Path with Increasing Chords in a Simple Polygon.

[BibT_eX]

[DOI]

Mart Hagedoorn

CoRR, 2022

Brief Announcement: An Effective Geometric Communication Structure for Programmable Matter.

[BibT_eX]

[DOI]

Tom Peters

Bettina Speckmann

Proceedings of the 36th International Symposium on Distributed Computing, 2022

Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares.

[BibT_eX]

[DOI]

Proceedings of the 18th Scandinavian Symposium and Workshops on Algorithm Theory, 2022

Preprocessing Imprecise Points for the Pareto Front.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

On the Computational Power of Energy-Constrained Mobile Robots: Algorithms and Cross-Model Analysis.

[BibT_eX]

[DOI]

Proceedings of the Structural Information and Communication Complexity, 2022

Brief Announcement: Fault-Tolerant Shape Formation in the Amoebot Model.

[BibT_eX]

[DOI]

Daniel Warner

Proceedings of the 1st Symposium on Algorithmic Foundations of Dynamic Networks, 2022

Fault-Tolerant Shape Formation in the Amoebot Model.

[BibT_eX]

[DOI]

Daniel Warner

Proceedings of the 28th International Conference on DNA Computing and Molecular Programming, 2022

Unlabeled Multi-Robot Motion Planning with Tighter Separation Bounds.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Chasing Puppies: Mobile Beacon Routing on Closed Curves.

[BibT_eX]

[DOI]

J. Comput. Geom., 2021

Compacting Squares.

[BibT_eX]

[DOI]

CoRR, 2021

Folding polyominoes with holes into a cube.

[BibT_eX]

[DOI]

Comput. Geom., 2021

Separating Bounded and Unbounded Asynchrony for Autonomous Robots: Point Convergence with Limited Visibility.

[BibT_eX]

[DOI]

Proceedings of the PODC '21: ACM Symposium on Principles of Distributed Computing, 2021

Dots & Boxes Is PSPACE-Complete.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

Autonomous Mobile Robots: Refining the Computational Landscape.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Parallel and Distributed Processing Symposium Workshops, 2021

Embedding Ray Intersection Graphs and Global Curve Simplification.

[BibT_eX]

[DOI]

Mees van de Kerkhof

G. Wessel van der Heijden

Maarten Löffler

Proceedings of the Graph Drawing and Network Visualization - 29th International Symposium, 2021

Multi-Robot Motion Planning of k-Colored Discs Is PSPACE-Hard.

[BibT_eX]

[DOI]

Thomas Brocken

Lloyd E. Lo-Wong

Remco J. A. Surtel

Proceedings of the 10th International Conference on Fun with Algorithms, 2021

2020

Forming tile shapes with simple robots.

[BibT_eX]

[DOI]

Nat. Comput., 2020

Algorithmic Approaches to Reconfigurable Assembly Systems.

[BibT_eX]

[DOI]

CoRR, 2020

Dots & Polygons.

[BibT_eX]

[DOI]

CoRR, 2020

Self-approaching paths in simple polygons.

[BibT_eX]

[DOI]

Prosenjit Bose

Stefan Langerman

Comput. Geom., 2020

Convex Hull Formation for Programmable Matter.

[BibT_eX]

[DOI]

Proceedings of the ICDCN 2020: 21st International Conference on Distributed Computing and Networking, 2020

Route-preserving Road Network Generalization.

[BibT_eX]

[DOI]

Proceedings of the SIGSPATIAL '20: 28th International Conference on Advances in Geographic Information Systems, 2020

Turning Machines.

[BibT_eX]

[DOI]

Cai Wood

Damien Woods

Proceedings of the 26th International Conference on DNA Computing and Molecular Programming, 2020

Dots & Polygons (Media Exposition).

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

Designing Art Galleries (Media Exposition).

[BibT_eX]

[DOI]

Proceedings of the 36th International Symposium on Computational Geometry, 2020

2019

Region-Based Approximation of Probability Distributions (for Visibility Between Imprecise Points Among Obstacles).

[BibT_eX]

[DOI]

Algorithmica, 2019

Most Vital Segment Barriers.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 16th International Symposium, 2019

Approximating (k, ℓ)-center clustering for curves.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2019

A Sampling-based Strategy for Distributing Taxis in a Road Network for Occupancy Maximization (GIS Cup).

[BibT_eX]

[DOI]

Proceedings of the 27th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, 2019

Global Curve Simplification.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Fragile Complexity of Comparison-Based Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 27th Annual European Symposium on Algorithms, 2019

Preprocessing Ambiguous Imprecise Points.

[BibT_eX]

[DOI]

Proceedings of the 35th International Symposium on Computational Geometry, 2019

2018

Folding Polyominoes into (Poly)Cubes.

[BibT_eX]

[DOI]

Int. J. Comput. Geom. Appl., 2018

On Optimal Min-# Curve Simplification Problem.

[BibT_eX]

[DOI]

CoRR, 2018

Approximating (k, 𝓁)-center clustering for curves.

[BibT_eX]

[DOI]

CoRR, 2018

Shape Recognition by a Finite Automaton Robot.

[BibT_eX]

[DOI]

Proceedings of the 43rd International Symposium on Mathematical Foundations of Computer Science, 2018

Toward Unfolding Doubly Covered n-Stars.

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry, Graphs, and Games, 2018

Convex Partial Transversals of Planar Regions.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Algorithms and Computation, 2018

An Optimal Algorithm to Compute the Inverse Beacon Attraction Region.

[BibT_eX]

[DOI]

Proceedings of the 34th International Symposium on Computational Geometry, 2018

Theoretical analysis of beaconless geocast protocols in 1D.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, 2018

2017

On the complexity of minimum-link path problems.

[BibT_eX]

[DOI]

J. Comput. Geom., 2017

Computing nonsimple polygons of minimum perimeter.

[BibT_eX]

[DOI]

Arne Schmidt

Christiane Schmidt

Julian Troegel

J. Comput. Geom., 2017

Unfolding and Dissection of Multiple Cubes, Tetrahedra, and Doubly Covered Squares.

[BibT_eX]

[DOI]

J. Inf. Process., 2017

Non-Crossing Geometric Steiner Arborescences.

[BibT_eX]

[DOI]

Bettina Speckmann

Kevin Verbeek

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

The Painter's Problem: Covering a Grid with Colored Connected Polygons.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 25th International Symposium, 2017

2016

Single-Player and Two-Player Buttons & Scissors Games.

[BibT_eX]

[DOI]

CoRR, 2016

Gabriel Triangulations and Angle-Monotone Graphs: Local Routing and Recognition.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 24th International Symposium, 2016

Homotopy Measures for Representative Trajectories.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Mapping Polygons to the Grid with Small Hausdorff and Fréchet Distance.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Critical Placements of a Square or Circle amidst Trajectories for Junction Detection.

[BibT_eX]

Proceedings of the 28th Canadian Conference on Computational Geometry, 2016

2015

Optimizing airspace closure with respect to politicians' egos.

[BibT_eX]

[DOI]

Maarten Löffler

Theor. Comput. Sci., 2015

Single-Player and Two-Player Buttons & Scissors Games - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

On Minimizing Crossings in Storyline Visualizations.

[BibT_eX]

[DOI]

Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Trajectory Grouping Structure under Geodesic Distance.

[BibT_eX]

[DOI]

Proceedings of the 31st International Symposium on Computational Geometry, 2015

Region-based Approximation Algorithms for Visibility between Imprecise Locations.

[BibT_eX]

[DOI]

Proceedings of the Seventeenth Workshop on Algorithm Engineering and Experiments, 2015

2014

Scandinavian Thins on Top of Cake: New and Improved Algorithms for Stacking and Packing.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

2013

Local Redesigning of Airspace Sectors

[BibT_eX]

[DOI]

CoRR, 2013

Beacon-Based Algorithms for Geometric Routing.

[BibT_eX]

[DOI]

Michael Biro

Justin Iwerks

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

Combinatorics of Beacon Routing and Coverage.

[BibT_eX]

[DOI]

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012

Simple Wriggling is Hard Unless You Are a Fat Hippo.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2012

Scandinavian Thins on Top of Cake: On the Smallest One-Size-Fits-All Box.

[BibT_eX]

[DOI]

Proceedings of the Fun with Algorithms - 6th International Conference, 2012

2011

Hardness Results for Two-Dimensional Curvature-Constrained Motion Planning.

[BibT_eX]

[DOI]

David G. Kirkpatrick

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2008

The Embroidery Problem.

[BibT_eX]