136 citations
- Aix-Marseille UniversitéFR68 papers
- Centre National de la Recherche ScientifiqueFR68 papers
- Laboratoire d'Informatique Fondamentale d'Orléans14 papers
- Laboratoire d’Informatique et SystèmesFR10 papers
- Institut national de recherche en sciences et technologies du numériqueFR8 papers
- Institut de Mathématiques de MarseilleFR7 papers
- King's College LondonGB7 papers
- Laboratoire Bordelais de Recherche en InformatiqueFR6 papers
- Laboratoire d'Informatique, de Modélisation et d'Optimisation des SystèmesFR6 papers
- École Normale Supérieure Paris-SaclayFR5 papers
- Fafo FoundationNO5 papers
- Technische Universität BerlinDE5 papers
Showing 2010 · cs.DSShow all
2 papers · 2 filters
cs.DS2010
A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set
Serge Gaspers, Mathieu Liedloff
An independent dominating set D of a graph G = (V,E) is a subset of vertices such that every vertex in V \ D has at least one neighbor in D and D is an independent set, i.e. no two…
cs.DS2010★ 4 cited
Optimal Exploration of Terrains with Obstacles
Jurek Czyzowicz, David Ilcinkas, Arnaud Labourel +1
A mobile robot represented by a point moving in the plane has to explore an unknown terrain with obstacles. Both the terrain and the obstacles are modeled as arbitrary polygons. We…