The Algorithms Research Group is part of the Computer Science Department, inside the Faculty of Sciences of ULB.
News
News and seminar announcements are posted here.
Topics
The Algorithm research group centers its activities on graph algorithms,
computational geometry, data structures, optimization
algorithms, data compression, and information theory.
Permanent Staff
|
Jean Cardinal
Associate Professor
Keywords: Information theory, graphs, algorithms.
Address: N8.110, CP 212, Bvd. du Triomphe, 1050 Bruxelles
Tel: 02/650.5608
Fax: 02/650.5609
E-mail: jcardin@ulb.ac.be
|
|
| | | | | | | |
|
|
Samuel Fiorini
Associate Professor (Math Department)
Keywords: Combinatorial optimization, Polyhedral combinatorics, Graph Theory.
E-mail: sfiorini@ulb.ac.be
|
|
| | | | | | | |
|
|
Stefan Langerman
Maître de recherches (FNRS Senior Research Associate)
Keywords: Computational geometry, data structures.
Address: O8.113, CP 212, Bvd. du Triomphe, 1050 Bruxelles
Tel: 02/650.5928
Fax: 02/650.5609
E-mail: Stefan.Langerman@ulb.ac.be
|
|
Post-Docs
|
|
Sébastien Collette
Chargé de recherches du FNRS (FNRS Postdoctoral Researcher)
Keywords: Computational geometry, data structures.
Address: O8.212, CP 212, Bvd. du Triomphe, 1050 Bruxelles
Tel: 02/650.5606
Fax: 02/650.5609
E-mail: Sebastien.Collette@ulb.ac.be
|
|
| | | | | | | |
|
|
Gwenaël Joret
Chargé de recherches du FNRS (FNRS Postdoctoral Researcher)
Keywords: Graph theory.
Address: O8.101, CP 212, Bvd. du Triomphe, 1050 Bruxelles
Tel: 02/650.5875
Fax: 02/650.5609
E-mail: gjoret@ulb.ac.be
|
|
| | | | | | | |
|
|
Marcin Kamiński
Chargé de recherches du FNRS (FNRS Postdoctoral Researcher)
Keywords: Graph theory, Algorithms.
Address: O8.114, CP 212, Bvd. du Triomphe, 1050 Bruxelles
Tel: 02/650.5960
Fax: 02/650.5609
E-mail: Marcin.Kaminski@ulb.ac.be
|
|
| | | | | | | |
|
|
Matias Korman
Postdoctoral Researcher
Keywords: Computational geometry.
Address: O8.114, CP 212, Bvd. du Triomphe, 1050 Bruxelles
Tel: 02/650.5960
Fax: 02/650.5609
E-mail: mkormanc@ulb.ac.be
|
|
| | | | | | | |
|
|
Perouz Taslakian
Postdoctoral Researcher
Keywords: Computational Geometry, Computational Music Theory
Address: O8.214, CP 212, Bvd. du Triomphe, 1050 Bruxelles
Tel: 02/650.5612
Fax: 02/650.5609
E-mail: Perouz.Taslakian@ulb.ac.be
|
|
Ph.D. Students
|
|
Frédéric Pluquet
Teaching Assistant
Keywords: Persistent data structures, Decomposition and Composition of programs.
Address: N8.217, CP 212, Bvd. du Triomphe, 1050 Bruxelles
Tel: 02/650.5601
Fax: 02/650.5609
E-mail: fpluquet@ulb.ac.be
|
|
| | | | | | | |
|
|
Jérôme Vervier
Teaching Assistant
Keywords: Computational geometry.
Address: O8.214, CP 212, Bvd. du Triomphe, 1050 Bruxelles
Tel: 02/650.5612
Fax: 02/650.5609
E-mail: jvervier@ulb.ac.be
|
|
Recent Journal Publications
|
[1]
|
E.D. Demaine, S. Langerman, and E. Price.
Confluently persistent tries for efficient version control.
Algorithmica, to appear.
Special issue of selected papers from 11th Scandinavian Workshop on
Algorithm Theory, 2008.
|
|
[2]
|
E.D. Demaine, M.L. Demaine, J. Iacono, and S. Langerman.
Wrapping spheres with flat paper.
Computational Geometry: Theory and Applications, to appear.
Special issue of selected papers from 23rd European Workshop on
Computational Geometry (EuroCG'07).
|
|
[3]
|
K. Douïeb and S. Langerman.
Near-entropy hotlink assignments.
Algorithmica, to appear.
|
|
[4]
|
S. Cabello, J.M. Díaz-Báñez, S. Langerman, C. Seara, and
I. Ventura.
Reverse facility location problems.
European Journal of Operational Research, to appear.
|
|
[5]
|
E.D. Demaine, J. Iacono, and S. Langerman.
Grid vertex-unfolding orthostacks.
International Journal of Computational Geometry and
Applications, to appear.
|
|
[6]
|
E.D. Demaine, J. Iacono, and S. Langerman.
Worst-case optimal tree layout in a memory hierarchy.
Algorithmica, to appear.
|
|
[7]
|
G. Aloupis, J. Cardinal, S. Collette, F. Hurtado, S. Langerman, J. O'Rourke,
and B. Palop.
Highway hull revisited.
Computational Geometry: Theory and Applications, 43:115-130,
2010.
[ DOI ]
|
|
[8]
|
P. Bose, S. Collette, S. Langerman, A. Maheshwari, P. Morin, and M. Smid.
Sigma-local graphs.
Journal of Discrete Algorithms, 8(1), 2010.
[ DOI |
.pdf ]
|
|
[9]
|
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.
Computational Geometry: Theory and Applications, 42:652-663,
2009.
[ DOI |
.pdf ]
|
|
[10]
|
G. Aloupis, J. Cardinal, S. Collette, S. Langerman, and S. Smorodinsky.
Coloring geometric range spaces.
Discrete and Computational Geometry, 41:348-362, 2009.
[ DOI |
.pdf ]
|
|
[11]
|
J. Cardinal, S. Collette, and S. Langerman.
Empty region graphs.
Computational Geometry: Theory and Applications, 42:183-195,
2009.
[ DOI |
.pdf ]
|
|
[12]
|
J. Cardinal, S. Fiorini, G. Joret, R. M. Jungers, and J. I. Munro.
An efficient algorithm for partial order production.
SIAM Journal on Computing, 2009.
accepted.
|
|
[13]
|
J. Cardinal, M. Labbé, S. Langerman, and B. Palop.
Pricing geometric transportation networks.
International Journal of Computational Geometry and
Applications, 2009.
accepted.
|
|
[14]
|
J. Cardinal, V. Ravelomanana, and M. Valencia-Pabon.
Minimum sum edge colorings of multicycles.
Discrete Applied Mathematics, 2009.
accepted.
[ http ]
|
|
[15]
|
J. Cardinal, E. D. Demaine, S. Fiorini, G. Joret, S. Langerman, I. Newman, and
O. Weimann.
The Stackelberg minimum spanning tree game.
Algorithmica, 2009.
accepted.
|
|
[16]
|
J. Cardinal, S. Langerman, and E. Levy.
Improved approximation bounds for edge dominating set in dense
graphs.
Theoretical Computer Science, 410(8-10):949-957, 2009.
[ http ]
|
|
[17]
|
T. Abbott, M.A. Burr, T.M. Chan, E.D. Demaine, M.L. Demaine, J. Hugg, D. Kane,
S. Langerman, J. Nelson, E. Rafalin, C. Seyboth, and V. Yeung.
Dynamic ham-sandwich cuts in the plane.
Computational Geometry: Theory and Applications,
42(5):419-428, July 2009.
[ DOI ]
|
|
[18]
|
P. Bose, V. Dujmovic, F. Hurtado, S. Langerman, P. Morin, and D.R. Wood.
A polynomial bound for untangling geometric planar graphs.
Discrete & Computational Geometry, 42(4):570-585, December
2009.
[ DOI ]
|
|
[19]
|
B. Aronov, F. Aurenhammer, F. Hurtado, S. Langerman, D. Rappaport, C. Seara,
and S. Smorodinsky.
Small weak epsilon nets.
Computational Geometry: Theory and Applications,
42(5):455-462, July 2009.
Special issue of selected papers from the 17th Canadian Conference on
Computational Geometry (CCCG'05).
[ DOI ]
|
|
[20]
|
J. Cardinal, S. Collette, F. Hurtado, S. Langerman, and B. Palop.
Optimal location of transportation devices.
Computational Geometry: Theory and Applications, 41:219-229,
2008.
[ DOI |
.pdf ]
|
|
[21]
|
S. Collette, L. Cucu, and J. Goossens.
Integrating job parallelism in real-time scheduling theory.
Information Processing Letters, 106:180-187, 2008.
[ DOI |
.pdf ]
|
|
[22]
|
J. Cardinal, S. Collette, and S. Langerman.
Local properties of geometric graphs.
Computational Geometry: Theory and Applications, 39(1):55-64,
2008.
Special issue of selected papers from the 16th Canadian Conference on
Computational Geometry (CCCG'04).
[ DOI |
.pdf ]
|
|
[23]
|
J. Cardinal, S. Fiorini, and G. Joret.
Minimum entropy orientations.
Operations Research Letters, 36:680-683, 2008.
[ http ]
|
|
[24]
|
J. Cardinal, S. Fiorini, and G. Joret.
Minimum entropy coloring.
Journal of Combinatorial Optimization, 16(4):361-377, November
2008.
[ http ]
|
|
[25]
|
J. Cardinal, S. Fiorini, and G. Joret.
Tight results on minimum entropy set cover.
Algorithmica, 51(1):49-60, May 2008.
[ http ]
|
|
[26]
|
P.K. Agarwal, R. Klein, C. Knauer, S. Langerman, P. Morin, M. Sharir, and
M. Soss.
Computing the detour and spanning ratio of paths, trees, and cycles
in 2D and 3D.
Discrete & Computational Geometry, 39(1):17-37, 2008.
Special issue: Discrete and Computational Geometry - Twenty Years
Later.
[ DOI ]
|
|
[27]
|
D. Bremner, D. Chen, J. Iacono, S. Langerman, and P. Morin.
Output-sensitive algorithms for Tukey depth and related problems.
Statistics and Computing, 18(3):259-266, September 2008.
[ DOI ]
|
|
[28]
|
P. Bose, V. Dujmovic, D. Krizanc, S. Langerman, P. Morin, D.R. Wood, and
S. Wuhrer.
A characterization of the degree sequences of 2-trees.
Journal of Graph Theory, 58(3):191-209, July 2008.
[ DOI ]
|
|
[29]
|
K. Douïeb and S. Langerman.
Dynamic hotlinks.
Algorithmica, 50(2):208-222, February 2008.
Special issue of selected papers from the 9th Workshop on Algorithms
and Data Structures (WADS 2005).
[ DOI ]
|
|
[30]
|
G. Aloupis, E.D. Demaine, S. Langerman, P. Morin, J. O'Rourke, I. Streinu, and
G.T. Toussaint.
Unfolding polyhedral bands.
Computational Geometry: Theory and Applications, 39:30-42,
2008.
Special issue of selected papers from the 16th Canadian Conference on
Computational Geometry (CCCG'04).
[ DOI ]
|
|
[31]
|
M. Röder, J. Cardinal, and R. Hamzaoui.
Efficient rate-distortion optimized media streaming for
tree-structured packet dependencies.
IEEE Transactions on Multimedia, 9(6):1259-1272, October 2007.
[ http ]
|
|
[32]
|
E.D. Demaine, J. Iacono, and S. Langerman.
Retroactive data structures.
ACM Transactions on Algorithms, 3(2):13.1-13.20, May 2007.
[ DOI ]
|
|
[33]
|
J. Colannino, M. Damian, F. Hurtado, S. Langerman, H. Meijer, S. Ramaswami,
D. Souvaine, and G.T. Toussaint.
Efficient many-to-many point matching in one dimension.
Graphs and Combinatorics, 23(Supplement):169-178, 2007.
Special issue on Computational Geometry and Graph Theory: The
Akiyama-Chvatal Festschrift.
[ DOI ]
|
|
[34]
|
P. Bose, E.D. Demaine, F. Hurtado, J. Iacono, S. Langerman, and P. Morin.
Geodesic ham-sandwich cuts.
Discrete & Computational Geometry, 37(3):325-339, March
2007.
[ DOI ]
|
|
[35]
|
J.-P. Doignon, S. Fiorini, and G. Joret.
Facets of the linear ordering polytope: a unification for the fence
family through weighted graphs.
Journal of Mathematical Psychology, 50(3):251-262, 2006.
|
|
[36]
|
J. Cardinal, S. Kremer, and S. Langerman.
Juggling with pattern matching.
Theory of Computing Systems, 39(3):425-437, June 2006.
[ http ]
|
|
[37]
|
M. Röder, J. Cardinal, and R. Hamzaoui.
Branch and bound algorithms for rate-distortion optimized media
streaming.
IEEE Transactions on Multimedia, 8(1):170-178, February 2006.
[ http ]
|
|
[38]
|
G. Aloupis, T. Fevens, S. Langerman, T. Matsui, A. Mesa, Y. Nu nez,
D. Rappaport, and G.T. Toussaint.
Algorithms for computing geometric measures of melodic similarity.
Computer Music Journal, 30(3):67-76, Fall 2006.
[ DOI ]
|
|
[39]
|
E.D. Demaine, M.L. Demaine, A. Langerman, and S. Langerman.
Morpion solitaire.
Theory of Computing Systems, 39(3):439-453, 2006.
Special issue of selected papers from the 3rd International
Conference on Fun with Algorithms (FUN 2004). Translated into Portuguese:
“Cinco-em-linha solitário”, Boletim da Sociedade Portuguesa de
Matemática 54:125-142, May 2006.
[ DOI ]
|
|
[40]
|
E.D. Demaine, S. Langerman, and J. O'Rourke.
Geometric restrictions on polygonal protein chain production.
Algorithmica, 44(2):167-181, February 2006.
Special issue of selected papers from the 14th Annual International
Symposium on Algorithms and Computation (ISAAC 2003).
[ DOI ]
|
|
[41]
|
J. Cardinal and S. Langerman.
Designing small keyboards is hard.
Theoretical Computer Science, 332(1-3):405-415, February 2005.
[ http ]
|
|
[42]
|
E.D. Demaine, J. Erickson, F. Hurtado, J. Iacono, S. Langerman, H. Meijer,
M. Overmars, and S. Whitesides.
Separating point sets in polygonal environments.
International Journal of Computational Geometry and
Applications, 15(4):403-419, August 2005.
Special issue of selected papers from the 20th Annual ACM Symposium
on Computational Geometry (SoCG 2004).
|
|
[43]
|
D. Bremner, E.D. Demaine, J. Erickson, J. Iacono, S. Langerman, P. Morin, and
G.T. Toussaint.
Output-sensitive algorithms for computing nearest-neighbour decision
boundaries.
Discrete & Computational Geometry, 33(4):593-604, April
2005.
[ DOI ]
|
|
[44]
|
S. Langerman and P. Morin.
Covering things with things.
Discrete & Computational Geometry, 33(4):717-729, April
2005.
[ DOI ]
|
|
[45]
|
J. Iacono and S. Langerman.
Queaps.
Algorithmica, 42(1):49-56, March 2005.
Special issue of selected papers from the 13th Annual International
Symposium on Algorithms and Computation (ISAAC 2002).
[ DOI ]
|
Recent Conference Publications
|
[1]
|
F. Pluquet, S. Langerman, and R. Wuyts.
Executing code in the past: Efficient in-memory object graph
versioning.
In Proceedings of the 2009 ACM SIGPLAN Conference on
Object-Oriented Programming Systems, Languages, and Applications
(OOPSLA'09), to appear.
|
|
[2]
|
P. Bose, V. Dujmovic, F. Hurtado, S. Langerman, P. Morin, and D.R. Wood.
A polynomial bound for untangling geometric planar graphs.
In Proceedings of the International Conference on Topological
& Geometric Graph Theory (TGGT'08), to appear.
|
|
[3]
|
E.D. Demaine, M.L. Demaine, V. Hart, and J. Iacono.
Continuous blooming of convex polyhedra.
In Abstracts from the 7th Japan Conference on Computational
Geometry and Graphs (JCCGG 2009), to appear.
|
|
[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.
|
|
[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.
|
|
[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.
|
|
[7]
|
J. Cardinal, S. Fiorini, G. Joret, R. M. Jungers, and J. I. Munro.
An efficient algorithm for partial order production.
In Proc. ACM Symposium on Theory of Computing (STOC), pages
93-100. ACM, 2009.
[ http ]
|
|
[8]
|
J. Cardinal, S. Fiorini, and G. Joret.
Minimum entropy combinatorial optimization problems.
In Proc. Computability in Europe (CiE), volume 5635 of
Lecture Notes in Computer Science, pages 79-88. Springer-Verlag, 2009.
[ http ]
|
|
[9]
|
J. Cardinal, E. D. Demaine, M. L. Demaine, S. Imahori, S. Langerman, and
R. Uehara.
Algorithmic folding complexity.
In Proc. International Symposium on Algorithms and Computation
(ISAAC), 2009.
Also presented at the 7th Japan Conference on Computational Geometry
and Graphs (JCCGG09).
|
|
[10]
|
J. Cardinal, E. D. Demaine, S. Fiorini, G. Joret, I. Newman, and O. Weimann.
The stackelberg minimum spanning tree game on planar and
bounded-treewidth graphs.
In Proc. Workshop on Internet and Network Economics (WINE),
2009.
accepted.
|
|
[11]
|
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.
|
|
[12]
|
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.
[ .pdf ]
|
|
[13]
|
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.
|
|
[14]
|
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.
[ DOI |
.pdf ]
|
|
[15]
|
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.
[ .pdf ]
|
|
[16]
|
J. Cardinal and E. Levy.
Connected vertex covers in dense graphs.
In Proc. International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX), volume 5171 of Lecture
Notes in Computer Science, pages 35-48. Springer-Verlag, 2008.
|
|
[17]
|
E.D. Demaine, S. Langerman, and E. Price.
Confluently persistent tries for efficient version control.
In Proceedings of the 11th Scandinavian Workshop on Algorithm
Theory, volume 5124 of LNCS, pages 160-172. Springer-Verlag, 2008.
[ DOI ]
|
|
[18]
|
F. Pluquet, S. Langerman, A. Marot, and R. Wuyts.
Implementing partial persistence in object-oriented languages.
In Proceedings of the Workshop on Algorithm Engineering and
Experiments (ALENEX08), pages 37-48, 2008.
[ .pdf ]
|
|
[19]
|
P. Bose, K. Douïeb, and S. Langerman.
Dynamic optimality for skip lists and B-trees.
In Proceedings of the ACM-SIAM Symposium On Discrete Algorithms
(SODA2008), pages 1106-1114, 2008.
|
|
[20]
|
P. Bose, S. Langerman, and S. Roy.
Smallest enclosing circle centered on a query line segment.
In Proceedings of the 20th Canadian Conference on Computational
Geometry (CCCG 2008), pages 167-170, 2008.
|
|
[21]
|
G. Aloupis, P. Bose, V. Dujmovic, C. Gray, S. Langerman, and B. Speckmann.
Triangulating and guarding realistic polygons.
In Proceedings of the 20th Canadian Conference on Computational
Geometry (CCCG 2008), pages 107-110, 2008.
|
|
[22]
|
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.
[ DOI |
.pdf ]
|
|
[23]
|
J. Cardinal, S. Collette, F. Hurtado, S. Langerman, and B. Palop.
Moving walkways, escalators, and elevators.
In Proceedings of the Kyoto International Conference on
Computational Geometry and Graph Theory (KyotoCGGT2007), 2007.
[ http ]
|
|
[24]
|
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.
|
|
[25]
|
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.
[ DOI |
.pdf ]
|
|
[26]
|
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.
[ DOI |
.pdf ]
|
|
[27]
|
J. Cardinal, E. D. Demaine, S. Fiorini, G. Joret, S. Langerman, I. Newman, and
O. Weimann.
The Stackelberg minimum spanning tree game.
In Proc. Workshop on Algorithms and Data Structures (WADS),
volume 4619 of Lecture Notes in Computer Science, pages 64-76.
Springer-Verlag, 2007.
[ http ]
|
|
[28]
|
J. Cardinal, S. Langerman, and G. Louchard.
Randomized optimization : a probabilistic analysis.
In Proc. International Conference on Analysis of Algorithms
(AofA), 2007.
|
|
[29]
|
J. Cardinal, V. Ravelomanana, and M. Valencia-Pabon.
Chromatic edge strength of some multigraphs.
In Proc. IV Latin-American Algorithms, Graphs and Optimization
Symposium (LAGOS), Electronic Notes in Discrete Mathematics, volume 30,
pages 39-44, 2007.
[ http ]
|
|
[30]
|
P. Bose, V. Dujmovic, D. Krizanc, S. Langerman, P. Morin, D.R. Wood, and
S. Wuhrer.
A characterization of the degree sequences of 2-trees.
In Workshop on Analytic Algorithms and Combinatorics
(ANALCO07), 2007.
|
|
[31]
|
G. Aloupis, B. Ballinger, P. Bose, M. Damian, E.D. Demaine, M.L. Demaine,
R. Flatland, F. Hurtado, S. Langerman, J. O'Rourke, P. Taslakian, and G.T.
Toussaint.
Vertex pops and popturns.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG 2007), pages 137-140, 2007.
|
|
[32]
|
E.D. Demaine, M.L. Demaine, J. Iacono, and S. Langerman.
Wrapping the mozartkugel.
In Abstracts from the 23rd European Workshop on Computational
Geometry (EuroCG 2007), pages 14-17, 2007.
|
|
[33]
|
G. Aloupis and H. Meijer.
Reconfiguring planar dihedral chains.
In 22nd European Workshop on Computational Geometry (EuroCG
2006), pages 67-70, 2006.
|
|
[34]
|
J. Cardinal and M. Hoefer.
Selfish service installation in networks.
In Proc. Workshop on Internet and Network Economics (WINE),
volume 4286 of Lecture Notes in Computer Science, pages 174-185.
Springer-Verlag, 2006.
[ .pdf ]
|
|
[35]
|
J. Cardinal, S. Langerman, and E. Levy.
Improved approximation bounds for edge dominating set in dense
graphs.
In Proc. Workshop on Approximation and Online Algorithms
(WAOA), volume 4368 of Lecture Notes in Computer Science, pages
108-120. Springer-Verlag, 2006.
[ .pdf ]
|
|
[36]
|
J. Cardinal, S. Fiorini, and G. Joret.
Tight results on minimum entropy set cover.
In Proc. International Workshop on Approximation Algorithms for
Combinatorial Optimization Problems (APPROX), volume 4110 of Lecture
Notes in Computer Science, pages 61-69. Springer-Verlag, 2006.
[ .pdf ]
|
|
[37]
|
M. Röder, J. Cardinal, and R. Hamzaoui.
Efficient rate-distortion optimized media streaming for
tree-reducible packet dependencies.
In Proc. Multimedia Computing and Networking (MMCN), volume
6071, pages 40-51. SPIE/IS&T/ACM, 2006.
[ .pdf ]
|
|
[38]
|
J. Cardinal and S. Langerman.
Min-max-min geometric facility location problems.
In Proc. European Workshop on Computational Geometry (EWCG),
pages 149-152, 2006.
[ .pdf ]
|
|
[39]
|
K. Douïeb and S. Langerman.
Near-entropy hotlink assignments.
In Proceedings of the 14th Annual European Symposium on
Algorithms (ESA 2006), volume 4168 of LNCS, pages 292-303, Zürich,
Switzerland, 2006. Springer Berlin / Heidelberg.
[ DOI ]
|
|
[40]
|
D. Bremner, T.M. Chan, E.D. Demaine, J. Erickson, F. Hurtado, J. Iacono,
S. Langerman, and P. Taslakian.
Necklaces, convolutions, and X+Y.
In Proceedings of the 14th Annual European Symposium on
Algorithms (ESA 2006), volume 4168 of LNCS, pages 160-171, Zürich,
Switzerland, 2006. Springer Berlin / Heidelberg.
[ DOI ]
|
|
[41]
|
R. Connelly, E.D. Demaine, M.L. Demaine, S.P. Fekete, S. Langerman, J.S.B.
Mitchell, A. Ribó, and G. Rote.
Locked and unlocked chains of planar shapes.
In Proceedings of the 2006 ACM Symposium on Computational
Geometry (SoCG 2006), pages 61-70, 2006.
[ DOI ]
|
|
[42]
|
B. Aronov, P. Bose, E.D. Demaine, J. Gudmundsson, J. Iacono, S. Langerman, and
M. Smid.
Data structures for halfplane proximity queries and incremental
voronoi diagrams.
In Proceedings of Latin American Theoretical INformatics (LATIN
2006), volume 3887 of LNCS, pages 80-92. Springer-Verlag, 2006.
[ DOI ]
|
|
[43]
|
M. Damian, E.D. Demaine, M.L. Demaine, V. Dujmovic, D. El-Khechen, R. Flatland,
J. Iacono, S. Langerman, H. Meijer, S. Ramaswami, D. Souvaine, P. Taslakian,
and G.T. Toussaint.
Curves in the sand: Algorithmic drawing.
In Proceedings of the 18th Canadian Conference on Computational
Geometry (CCCG 2006), pages 11-14, Kingston, Ontario, Canada, 2006.
|
|
[44]
|
M. Röder, J. Cardinal, and R. Hamzaoui.
Dynamic programming algorithm for rate-distortion optimized media
streaming.
In Proc. IEEE International Conf. Image Processing (ICIP),
volume 2, pages 169-172, 2005.
|
|
[45]
|
J. Cardinal, M. Labbé, S. Langerman, E. Levy, and H. Mélot.
A tight analysis of the maximal matching heuristic.
In Proc. International Computing and Combinatorics Conference
(COCOON), volume 3595 of Lecture Notes in Computer Science, pages
701-709. Springer-Verlag, 2005.
[ .pdf ]
|
|
[46]
|
J. Cardinal, M. Labbé, S. Langerman, and B. Palop.
Pricing of geometric transportation networks.
In Proc. Canadian Conference on Computational Geometry
(CCCG), pages 92-96, 2005.
[ .pdf ]
|
|
[47]
|
J. Cardinal, S. Fiorini, and G. Joret.
Minimum entropy coloring.
In Proc. International Symposium on Algorithms and Computation
(ISAAC), volume 3827 of Lecture Notes in Computer Science, pages
819-828. Springer-Verlag, 2005.
[ .pdf ]
|
|
[48]
|
E.D. Demaine and S. Langerman.
Optimizing a 2D function satisfying unimodality properties.
In Proceedings of the 13th European Symposium on Algorithms (ESA
2005), volume 3669 of LNCS, pages 887-898. Springer-Verlag, 2005.
[ DOI ]
|
|
[49]
|
K. Douïeb and S. Langerman.
Dynamic hotlinks.
In Proceedings of the 9th Workshop on Algorithms and Data
Structures (WADS 2005), volume 3608 of LNCS, pages 182-194.
Springer-Verlag, 2005.
[ DOI ]
|
|
[50]
|
P. Bose and S. Langerman.
Weighted ham-sandwich cuts.
In Proceedings of the Japan Conference on Discrete and
Computational Geometry (JCDCG 2004), volume 3742 of LNCS, pages
48-53. Springer-Verlag, 2005.
[ DOI ]
|
|
[51]
|
E.D. Demaine, J. Iacono, and S. Langerman.
Grid vertex-unfolding orthostacks.
In Proceedings of the Japan Conference on Discrete and
Computational Geometry (JCDCG 2004), volume 3742 of LNCS, pages
76-82. Springer-Verlag, 2005.
[ DOI ]
|
|
[52]
|
T. Abbott, E.D. Demaine, M.L. Demaine, D. Kane, S. Langerman, J. Nelson, and
V. Yeung.
Dynamic ham-sandwich cuts of convex polygons in the plane.
In Proceedings of the 17th Canadian Conference on Computational
Geometry (CCCG 2005), pages 61-64, Windsor, Ontario, Canada, August 10-12
2005.
[ .pdf ]
|
|
[53]
|
S. Cabello, J.M. Díaz-Báñez, S. Langerman, C. Seara, and
I. Ventura.
Reverse facility location problems.
In Proceedings of the 17th Canadian Conference on Computational
Geometry (CCCG 2005), pages 68-71, Windsor, Ontario, Canada, August 10-12
2005.
[ .pdf ]
|
|
[54]
|
B. Aronov, F. Aurenhammer, F. Hurtado, S. Langerman, D. Rappaport, C. Seara,
and S. Smorodinsky.
Small weak epsilon nets.
In Proceedings of the 17th Canadian Conference on Computational
Geometry (CCCG 2005), pages 52-56, Windsor, Ontario, Canada, August 10-12
2005.
[ .pdf ]
|
|
