-
[1]
-
S. Collette and J. Iacono.
Distances and shortest paths on graphs of bounded highway
dimension: simple, fast, dynamic.
In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms
(SODA'24), 2024.
[ bib |
Abstract ]
-
[2]
-
P. Bose, S. Collette, R. Fagerberg, and S. Langerman.
De-amortizing binary search trees.
In Proceedings of the 39th International Colloquium on Automata,
Languages and Programming (ICALP 2012), LNCS, 2012.
[ bib ]
-
[3]
-
S. Collette, J. Iacono, and S. Langerman.
Confluent persistence revisited.
In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms
(SODA'12), pages 593--601, 2012.
[ bib |
Abstract ]
-
[4]
-
G. Aloupis, J. Cardinal, S. Collette, E. D. Demaine, M. L. Demaine, M. Dulieu,
R. Fabila-Monroy, V. Hart, F. Hurtado, S. Langerman, M. Saumell, C. Seara,
and P. Taslakian.
Matching points with things.
In Proceedings of the 8th Latin American Theoretical Informatics
(LATIN'10), LNCS, 2010.
12 pages.
[ bib ]
-
[5]
-
G. Aloupis, J. Cardinal, S. Collette, S. Imahori, M. Korman, S. Langerman,
O. Schwartz, S. Smorodinsky, and P. Taslakian.
Colorful strips.
In Proceedings of the 8th Latin American Theoretical Informatics
(LATIN'10), LNCS, 2010.
12 pages.
[ bib ]
-
[6]
-
G. Aloupis, J. Cardinal, S. Collette, S. Langerman, D. Orden, and P. Ramos.
Decomposition of multiple coverings into more parts.
In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms
(SODA'09), 2009.
9 pages.
[ bib |
Abstract ]
-
[7]
-
G. Aloupis, S. Collette, M. Damian, E. Demaine, D. El-Khechen, R. Flatland,
S. Langerman, J. O'Rourke, V. Pinciu, S. Ramaswami, V. Sacristan, and
S. Wuhrer.
Realistic reconfiguration of crystalline (and telecube)
robots.
In Proceedings of the Workshop on the Algorithmic Foundations of
Robotics (WAFR'08), 2008.
18 pages.
[ bib |
Abstract ]
-
[8]
-
P. Bose, P. Carmi, S. Collette, and M. Smid.
On the stretch factor of convex delaunay graphs.
In Proceedings of the International Symposium on Algorithms and
Computation (ISAAC 2008), volume 5369 of LNCS, 2008.
12 pages.
[ bib |
Abstract ]
-
[9]
-
G. Aloupis, S. Collette, E. D. Demaine, S. Langerman, V. Sacristan, and
S. Wuhrer.
Reconfiguration of cube-style modular robots using O(log n)
parallel moves.
In Proceedings of the International Symposium on Algorithms and
Computation (ISAAC 2008), volume 5369 of LNCS, 2008.
12 pages.
[ bib |
Abstract ]
-
[10]
-
G. Aloupis, J. Cardinal, S. Collette, S. Langerman, and S. Smorodinsky.
Coloring geometric range spaces.
In Proceedings of the 8th Latin American Theoretical Informatics
(LATIN'08), volume 4957 of LNCS, 2008.
12 pages.
[ bib |
DOI |
Abstract ]
-
[11]
-
S. Collette, V. Dujmović, J. Iacono, S. Langerman, and P. Morin.
Distribution-sensitive point location in convex
subdivisions.
In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms
(SODA'08), 2008.
11 pages.
[ bib |
Abstract ]
-
[12]
-
G. Aloupis, S. Collette, M. Damian, E. D. Demaine, R. Flatland, S. Langerman,
J. O'Rourke, S. Ramaswami, V. Sacristan, and S. Wuhrer.
Linear reconfiguration of cube-style modular robots.
In Proceedings of the International Symposium on Algorithms and
Computation (ISAAC 2007), volume 4835 of LNCS, 2007.
14 pages.
[ bib |
DOI |
Abstract ]
-
[13]
-
S. Collette, L. Cucu, and J. Goossens.
Algorithm and complexity for the global scheduling of
sporadic tasks on multiprocessors with work-limited parallelism.
In Proceedings of the 15th International Conference on Real-Time
and Network systems (RTNS'2007), 2007.
6 pages.
[ bib |
Abstract ]
-
[14]
-
G. Aloupis, J. Cardinal, S. Collette, and S. Langerman.
Lumines strategies.
In Proceedings of the 5th International Conference on Computers
and Games (CG 2006), volume 4630 of LNCS, pages 190--199, 2007.
[ bib |
DOI |
.pdf |
Abstract ]
-
[15]
-
S. Collette, J.-F. Raskin, and F. Servais.
On the symbolic computation of the hardest configurations of
the rush hour game.
In Proceedings of the 5th International Conference on Computers
and Games (CG 2006), volume 4630 of LNCS, pages 220--233, 2007.
[ bib |
DOI |
.pdf |
Abstract ]