No. |
Title |
Author |
Year |
---|

1 |
Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 23091) |
Becker, Aaron et al. |
2023 |

2 |
The Lawn Mowing Problem: From Algebra to Algorithms |
Fekete, Sándor P. et al. |
2023 |

3 |
Efficiently Reconfiguring a Connected Swarm of Labeled Robots |
Fekete, Sándor P. et al. |
2022 |

4 |
Space Ants: Episode II - Coordinating Connected Catoms (Media Exposition) |
Bourgeois, Julien et al. |
2022 |

5 |
Can You Walk This? Eulerian Tours and IDEA Instructions (Media Exposition) |
Becker, Aaron T. et al. |
2021 |

6 |
Connected Coordinated Motion Planning with Bounded Stretch |
Fekete, Sándor P. et al. |
2021 |

7 |
Minimum Scan Cover and Variants - Theory and Experiments |
Buchin, Kevin et al. |
2021 |

8 |
Packing Squares into a Disk with Optimal Worst-Case Density |
Fekete, Sándor P. et al. |
2021 |

9 |
Coordinated Particle Relocation with Global Signals and Local Friction (Media Exposition) |
Baez, Victor M. et al. |
2020 |

10 |
Covering Rectangles by Disks: The Video (Media Exposition) |
Fekete, Sándor P. et al. |
2020 |

11 |
How to Make a CG Video (Media Exposition) |
Becker, Aaron T. et al. |
2020 |

12 |
Minimum Scan Cover with Angular Transition Costs |
Fekete, Sándor P. et al. |
2020 |

13 |
Probing a Set of Trajectories to Maximize Captured Information |
Fekete, Sándor P. et al. |
2020 |

14 |
Space Ants: Constructing and Reconfiguring Large-Scale Structures with Finite Automata (Media Exposition) |
Abdel-Rahman, Amira et al. |
2020 |

15 |
Worst-Case Optimal Covering of Rectangles by Disks |
Fekete, Sándor P. et al. |
2020 |

16 |
Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 18331) |
Berman, Spring et al. |
2019 |

17 |
Packing Disks into Disks with Optimal Worst-Case Density |
Fekete, Sándor P. et al. |
2019 |

18 |
Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition) |
Becker, Aaron T. et al. |
2019 |

19 |
Autonomous Vehicles: From Individual Navigation to Challenges of Distributed Swarms (Invited Talk) |
Fekete, Sándor P. |
2018 |

20 |
Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch |
Demaine, Erik D. et al. |
2018 |

21 |
Coordinated Motion Planning: The Video (Multimedia Exposition) |
Becker, Aaron T. et al. |
2018 |

22 |
Conflict-Free Coloring of Intersection Graphs |
Fekete, Sándor P. et al. |
2017 |

23 |
Tilt Assembly: Algorithms for Micro-Factories that Build Objects with Uniform External Forces |
Becker, Aaron T. et al. |
2017 |

24 |
Zapping Zika with a Mosquito-Managing Drone: Computing Optimal Flight Patterns with Minimum Turn Cost (Multimedia Contribution) |
Becker, Aaron T. et al. |
2017 |

25 |
Algorithmic Foundations of Programmable Matter (Dagstuhl Seminar 16271) |
Fekete, Sándor et al. |
2016 |

26 |
Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers, Sponsors |
Fekete, Sándor et al. |
2016 |

27 |
LIPIcs, Volume 51, SoCG'16, Complete Volume |
Fekete, Sándor et al. |
2016 |

28 |
Universal Guard Problems |
Fekete, Sándor P. et al. |
2016 |

29 |
Tilt: The Video - Designing Worlds to Control Robot Swarms with Only Global Signals |
Becker, Aaron T. et al. |
2015 |

30 |
09371 Abstracts Collection -- Algorithmic Methods for Distributed Cooperative Systems |
Fekete, Sándor et al. |
2010 |

31 |
On the Fairness of Probabilistic Schedulers for Population Protocols |
Chatzigiannakis, Ioannis et al. |
2010 |

32 |
06421 Abstracts Collection -- Robot Navigation |
Fekete, Sándor et al. |
2007 |

33 |
06421 Executive Summary -- Robot Navigation |
Fekete, Sándor et al. |
2007 |

34 |
Geometric Distance Estimation for Sensor Networks and Unit Disk Graphs |
Fekete, Sándor et al. |
2007 |

35 |
Polygon Exploration with Discrete Vision |
Fekete, Sándor et al. |
2007 |

36 |
Deterministic boundary recongnition and topology extraction for large sensor networks |
Fekete, Sándor et al. |
2006 |

37 |
Searching with an Autonomous Robot |
Fekete, Sándor et al. |
2005 |