The Algorithms Research Group is part of the Computer Science Department, within the Faculty of Sciences of ULB.
Contact
Address: Département d'Informatique, ULB CP 212, Bvd. du Triomphe, 1050 Bruxelles
Fax: +32 2 650.5609
Map and Directions: link
Administration: C.S. Department
link
Topics
The Algorithms Research Group centers its activities on graph algorithms,
computational geometry, data structures, optimization
algorithms, data compression, and information theory.
Permanent Staff
Postdocs
|
Greg Aloupis
Chargé de recherches du FNRS (FNRS Postdoctoral Researcher)
Keywords: Computational geometry
Office: O8.214
Tel: 02/650.5612
E-mail:
aloupis d0t greg ;at; gmail
|
|
| | | | | | | |
|
|
Nathann Cohen
Postdoc
Keywords: Computational geometry.
Office: O8.???
Tel: 02/650.5606
E-mail: nathann dot cohen 'at' gmail dot com
|
|
| | | | | | | |
|
|
Gwenaël Joret
Chargé de recherches du FNRS (FNRS Postdoctoral Researcher)
Keywords: Graph theory.
Office: O8.101
Tel: 02/650.5875
E-mail: gjoret@ulb.ac.be
|
|
| | | | | | | |
|
|
Marcin Kamiński
Chargé de recherches du FNRS (FNRS Postdoctoral Researcher)
Keywords: Graph theory, Algorithms.
Office: O8.114
Tel: 02/650.5960
E-mail: Marcin.Kaminski@ulb.ac.be
|
|
Ph.D. Students
External Members
Visitors in 2012
|
|
Dimitrios Thilikos - University of Athens
|
|
|
Remy Belmonte - University of Bergen
|
|
|
Pim van 't Hof - University of Bergen
|
|
|
Daniel Paulusma - Durham University
|
|
|
Martin Milanic - University of Primorska
|
|
|
Diane Souvaine - Tufts University
|
|
|
Jean-Lou de Carufel - Carleton University
|
|
|
Vida Dujmovic (upoming) - Carleton University
|
|
|
Prosenjit Bose (upcoming) - Carleton University
|
|
|
Perouz Taslakian (upcoming) - American University of Armenia
|
|
|
Robert E. Tarjan (upcoming) - Princeton University
|
|
|
John Iacono (upcoming) - Polytechnic Institute of NYU
|
Visitors in 2011
|
|
Dimitrios Thilikos - University of Athens
|
| |
Ian Munro - University of Waterloo
|
|
|
Tetsuo Asano - JAIST
|
|
|
Ozgur Ozkan - Polytechnic Institute of NYU
|
|
|
Stefanie Wuhrer - Saarland University
|
|
|
Sergio Cabello - University of Ljubljana
|
|
|
David Wood - University of Melbourne
|
|
|
Luis Felipe Barba - UNAM
|
|
|
Naomi Nishimura - University of Waterloo
|
|
|
Shakhar Smorodinsky - Ben-Gurion University
|
|
|
Ferran Hurtado - Universitat Politecnica de Catalunya
|
|
|
Nicolas Trotignon - Ecole Normale Superieure de Lyon
|
|
|
Hiro Ito - Kyoto University
|
|
|
John Iacono - Polytechnic Institute of NYU
|
|
|
Daniel Paulusma - Durham University
|
|
|
Martin Milanic - University of Primorska
|
Former Members
Recent Journal Publications
|
[1]
|
Vida Dujmović, Gwenaël Joret, and David R. Wood.
An improved bound for First-Fit on posets without two long
incomparable chains.
SIAM Journal on Discrete Mathematics (accepted), to appear.
[ http ]
|
|
[2]
|
Louis Esperet and Gwenaël Joret.
Boxicity of graphs on surfaces.
Graphs and Combinatorics, to appear.
[ http ]
|
|
[3]
|
G. Aloupis, P. Bose, V. Dujmovic, C. Gray, S. Langerman, and B. Speckmann.
Triangulating and guarding realistic polygons.
Computational Geometry: Theory and Applications, to appear.
Special issue of selected papers from the 20th Canadian Conference on
Computational Geometry (CCCG'08).
|
|
[4]
|
E.D. Demaine, J. Iacono, and S. Langerman.
Worst-case optimal tree layout in external memory.
Algorithmica, to appear.
|
|
[5]
|
Victor Campos, Vasek Chvátal, Luc Devroye, and Perouz Taslakian.
Transversals in trees.
Journal of Graph Theory, to appear.
|
|
[6]
|
G. Aloupis, J. Cardinal, S. Collette, S. Imahori, M. Korman, S. Langerman,
O. Schwartz, S. Smorodinsky, and P. Taslakian.
Colorful strips.
Graphs and Combinatorics, to appear.
[ DOI ]
|
|
[7]
|
G. Aloupis, J. Cardinal, S. Collette, F. Hurtado, S. Langerman, and
J. O'Rourke.
Draining a polygon - or - rolling a ball out of a polygon.
Computational Geometry: Theory and Applications, to appear.
|
|
[8]
|
Gwenaël Joret and David R. Wood.
Nordhaus-Gaddum for treewidth.
European Journal of Combinatorics, 33(4):488-490, 2012.
[ http ]
|
|
[9]
|
Samuel Fiorini and Gwenaël Joret.
Approximating the balanced minimum evolution problem.
Operations Research Letters, 40(1):31-35, 2012.
[ http ]
|
|
[10]
|
Samuel Fiorini, Gwenaël Joret, Dirk O. Theis, and David R. Wood.
Small minors in dense graphs.
European Journal of Combinatorics, 33(6):1226-1245, 2012.
[ http ]
|
|
[11]
|
Véronique Bruyère, Gwenaël Joret, and Hadrien Mélot.
Trees with given stability number and minimum number of stable sets.
Graphs and Combinatorics, 28(2):167-187, 2012.
[ http ]
|
|
[12]
|
J. Cardinal, M. Karpinski, R. Schmied, and C. Viehmann.
Approximating vertex cover in dense hypergraphs.
Journal of Discrete Algorithms, 2012.
accepted.
|
|
[13]
|
Barry Balof, Jean-Paul Doignon, and Samuel Fiorini.
The polyhedron of all representations of a semiorder.
Order (accepted), 2011.
|
|
[14]
|
Céline Engelbeen, Samuel Fiorini, and Antje Kiesel.
A closest vector problem arising in radiation therapy planning.
Journal of Combinatorial Optimization, 22:609-629, 2011.
|
|
[15]
|
Greg Aloupis, Brad Ballinger, Prosenjit Bose, S}ebastien Collette, Stefan
Langerman, Attila Por, and David Wood.
Blocking coloured point sets.
Springer Volume on Geometric Graph Theory (accepted), 2011.
|
|
[16]
|
János Barát, Gwenaël Joret, and David R. Wood.
Disproof of the list Hadwiger conjecture.
Electronic Journal of Combinatorics, 18(1):R232, 2011.
[ http ]
|
|
[17]
|
Gwenaël Joret and Kevin G. Milans.
First-Fit is linear on posets excluding two long incomparable
chains.
Order, 28(3):455-464, 2011.
[ http ]
|
|
[18]
|
Vida Dujmović, Gašper Fijavž, Gwenaël Joret, Thom Sulanke, and
David R. Wood.
On the maximum number of cliques in a graph embedded in a surface.
European Journal of Combinatorics, 32(8):1244-1252, 2011.
[ http ]
|
|
[19]
|
Gwenaël Joret.
Stackelberg network pricing is hard to approximate.
Networks, 57(2):117-120, 2011.
[ http ]
|
|
[20]
|
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.
Journal of Combinatorial Optimization, 2011.
accepted subject to minor revisions.
|
|
[21]
|
J. Cardinal, S. Fiorini, and G. Joret.
Minimum entropy combinatorial optimization problems.
Theory of Computing Systems, 2011.
accepted.
|
|
[22]
|
J. Cardinal, E. D. Demaine, M. L. Demaine, S. Imahori, T. Ito, M. Kiyomi,
S. Langerman, R. Uehara, and T. Uno.
Algorithmic folding complexity.
Graphs and Combinatorics, 27(3):341-351, 2011.
[ http ]
|
|
[23]
|
J. Cardinal, E. D. Demaine, S. Fiorini, G. Joret, S. Langerman, I. Newman, and
O. Weimann.
The Stackelberg minimum spanning tree game.
Algorithmica, 59(2):129-144, 2011.
[ http ]
|
|
[24]
|
E.D. Demaine, M.L. Demaine, V. Hart, J. Iacono, S. Langerman, and J. O'Rourke.
Continuous blooming of convex polyhedra.
Graphs and Combinatorics, 27(3):363-376, 2011.
Special issue on The Japan Conference on Computational Geometry and
Graphs (JCCGG2009).
[ DOI ]
|
|
[25]
|
G. Aloupis, P. Bose, E.D. Demaine, S. Langerman, H. Meijer, M. Overmars, and
G.T. Toussaint.
Computing signed permutations of polygons.
International Journal of Computational Geometry and
Applications, 21(1):87-100, February 2011.
[ DOI ]
|
|
[26]
|
Takehiro Ito, Marcin Kaminski, Daniël Paulusma, and Dimitrios M. Thilikos.
On disconnected cuts and separators.
Discrete Applied Mathematics, 159(13):1345-1351, 2011.
|
|
[27]
|
Marcin Kaminski, Daniël Paulusma, and Dimitrios M. Thilikos.
Contracting planar graphs to contractions of triangulations.
J. Discrete Algorithms, 9(3):299-306, 2011.
|
|
[28]
|
Marcin Kaminski, Paul Medvedev, and Martin Milanic.
The plane-width of graphs.
Journal of Graph Theory, 68(3):229-245, 2011.
|
|
[29]
|
Marcin Kaminski, Paul Medvedev, and Martin Milanic.
Shortest paths between shortest paths.
Theor. Comput. Sci., 412(39):5205-5210, 2011.
|
|
[30]
|
Takehiro Ito, Marcin Kaminski, Daniël Paulusma, and Dimitrios M. Thilikos.
Parameterizing cut sets in a graph by the number of their components.
Theor. Comput. Sci., 412(45):6340-6350, 2011.
|
|
[31]
|
Petr A. Golovach, Marcin Kamiński, Daniël Paulusma, and Dimitrios M.
Thilikos.
Lift contractions.
Electronic Notes in Discrete Mathematics, 38(0):407 - 412,
2011.
<ce:title>The Sixth European Conference on Combinatorics, Graph
Theory and Applications, EuroComb 2011</ce:title>.
|
|
[32]
|
Hee-Kap Ahn, Sang Won Bae, Erik D. Demaine, Martin L. Demaine, Sang-Sub Kim,
Matias Korman, Iris Reinbacher, and Wanbin Son.
Covering points by disjoint boxes with outliers.
Computational Geometry: Theory and Applications, 44(3):178 -
190, 2011.
[ DOI |
http ]
|
|
[33]
|
J. M. Díaz-Báñez, M. Korman, P. Pérez-Lantero, and I. Ventura.
Simultaneous location of a center and a highway.
Information Processing Letters (submitted), 2011.
8 pages.
|
|
[34]
|
J. M. Díaz-Báñez, M. Korman, P. Pérez-Lantero, and I. Ventura.
Locating a service facility and a rapid transit line.
European Journal of Operational Research, 2011.
10 pages.
[ http ]
|
|
[35]
|
Jinhee Chun, Kasai Ryosei, Matias Korman, Martin Nöllenburg, and Takeshi
Tokuyama.
Algorithms for computing the maximum weight region decomposable into
elementary shapes.
Computer Vision and Image Understanding (in press), 2011.
22 pages.
|
|
[36]
|
Sang Won Bae, Matias Korman, and Yoshio Okamoto.
The geodesic diameter of polygonal domains.
Discrete & Computational Geometry (submitted), 2011.
21 pages.
|
|
[37]
|
Greg Aloupis, Mirela Damian, Robin Flatland, Matias Korman, Özgür Özkan,
David Rappaport, and Stefanie Wuhrer.
Establishing strong connectivity using optimal radius half-disk
antennas.
Algorithmica (submitted), 2011.
|
|
[38]
|
J. M. Díaz-Báñez, M. Korman, P. Pérez-Lantero, and I. Ventura.
Locating a service facility and a rapid transit line of variable
length.
OR Spectrum (submitted), 2011.
|
|
[39]
|
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.
Efficient constant-velocity reconfiguration of crystalline robots.
Robotica, 29(1):59 - 71, 2011.
[ DOI ]
|
|
[40]
|
Z. Abel, B. Ballinger, P. Bose, S. Collette, V. Dujmović, F. Hurtado, S. D.
Kominers, S. Langerman, A. Pór, and D. R. Wood.
Every large point set contains many collinear points or an empty
pentagon.
Graphs and Combinatorics, 27(1):47-60, 2011.
[ DOI ]
|
|
[41]
|
Gwenaël Joret and David R. Wood.
Irreducible triangulations are small.
Journal of Combinatorial Theory, Series B, 100(5):446-455,
2010.
[ http ]
|
|
[42]
|
Gwenaël Joret, Marcin Kamiński, and Dirk O. Theis.
The Cops and Robber game on graphs with forbidden
(induced) subgraphs.
Contributions to Discrete Mathematics, 5(2):40-51, 2010.
[ http ]
|
|
[43]
|
J. Cardinal and E. Levy.
Connected vertex covers in dense graphs.
Theoretical Computer Science, 411(26-28):2581-2590, 2010.
|
|
[44]
|
J. Cardinal, S. Fiorini, G. Joret, R. M. Jungers, and J. I. Munro.
An efficient algorithm for partial order production.
SIAM Journal on Computing, 39(7):2927-294, 2010.
|
|
[45]
|
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.
Discrete & Computational Geometry, 44(2):439-462, September
2010.
[ DOI ]
|
|
[46]
|
E.D. Demaine, S. Langerman, and E. Price.
Confluently persistent tries for efficient version control.
Algorithmica, 57(3):462-483, July 2010.
Special issue of selected papers from 11th Scandinavian Workshop on
Algorithm Theory, 2008.
|
|
[47]
|
K. Douïeb and S. Langerman.
Near-entropy hotlink assignments.
Algorithmica, 58(2):221-244, October 2010.
[ DOI ]
|
|
[48]
|
S. Cabello, J.M. Díaz-Báñez, S. Langerman, C. Seara, and
I. Ventura.
Reverse facility location problems.
European Journal of Operational Research, 102(1):99-106, April
2010.
[ DOI ]
|
|
[49]
|
E.D. Demaine, J. Iacono, and S. Langerman.
Grid vertex-unfolding orthostacks.
International Journal of Computational Geometry and
Applications, 20(3):245-254, June 2010.
[ DOI ]
|
|
[50]
|
Shinya Anzai, Jinhee Chun, Ryosei Kasai, Matias Korman, and Takeshi Tokuyama.
Effect of corner information in simultaneous placement of k
rectangles and tableaux.
Discrete Mathematics, Algorithms and Applications, 2(4):527 -
537, 2010.
Special issue of selected papers from the 16th International
Conference on Computing and Combinatorics (COCOON'10).
[ DOI |
.pdf ]
|
|
[51]
|
P. Bose, P. Carmi, S. Collette, and M. Smid.
On the stretch factor of convex delaunay graphs.
Journal of Computational Geometry, 1(1):41 - 56, 2010.
[ http ]
|
|
[52]
|
G. Aloupis, J. Cardinal, S. Collette, S. Langerman, D. Orden, and P. Ramos.
Decomposition of multiple coverings into more parts.
Discrete and Computational Geometry, 44, 2010.
[ DOI ]
|
|
[53]
|
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 ]
|
|
[54]
|
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 ]
|
|
[55]
|
Frédéric Pluquet, Antoine Marot, and Roel Wuyts.
Fast type reconstruction for dynamically typed programming languages.
DLS '09: Proceedings of the 5th symposium on Dynamic languages,
Oct 2009.
[ http ]
|
|
[56]
|
Jean-Paul Doignon, Samuel Fiorini, and Gwenaël Joret.
Weighted graphs defining facets: a connection between stable set and
linear ordering polytopes.
Discrete Optimization, 6(1):1-9, 2009.
[ http ]
|
|
[57]
|
Samuel Fiorini and Gwenaël Joret.
On a theorem of Sewell and Trotter.
European Journal of Combinatorics, 30(2):425-428, 2009.
[ http ]
|
|
[58]
|
J. Cardinal, M. Labbé, S. Langerman, and B. Palop.
Pricing geometric transportation networks.
International Journal of Computational Geometry and
Applications, 19(6):507-520, 2009.
|
|
[59]
|
J. Cardinal, V. Ravelomanana, and M. Valencia-Pabon.
Minimum sum edge colorings of multicycles.
Discrete Applied Mathematics, 158(12):1216-1223, 2009.
[ http ]
|
|
[60]
|
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 ]
|
|
[61]
|
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 ]
|
|
[62]
|
E.D. Demaine, M.L. Demaine, J. Iacono, and S. Langerman.
Wrapping spheres with flat paper.
Computational Geometry: Theory and Applications,
42(8):748-757, October 2009.
Special issue of selected papers from 23rd European Workshop on
Computational Geometry (EuroCG'07).
[ DOI ]
|
|
[63]
|
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 ]
|
|
[64]
|
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 ]
|
|
[65]
|
Jinhee Chun, Matias Korman, Martin Nöllenburg, and Takeshi Tokuyama.
Consistent digital rays.
Discrete & Computational Geometry, 42(3):359 - 378, 2009.
Special issue of selected papers from the 24th Symposium on
Computational geometry (SoCG'08).
[ DOI |
.pdf ]
|
|
[66]
|
Erik D. Demaine, Francisco Gomez-Martin, Henk Meijer, David Rappaport, Perouz
Taslakian, Godfried T. Toussaint, Terry Winograd, and David R. Wood.
The distance geometry of music.
Computational Geometry: Theory and Application, 42(5):429-454,
July 2009.
|
|
[67]
|
Francisco Gomez-Martin, Perouz Taslakian, and Godfried T. Toussaint.
Structural properties of Euclidean rhythms.
Journal of Mathematics and Music, 3(1):1-14, March 2009.
|
|
[68]
|
Francisco Gomez-Martin, Perouz Taslakian, and Godfried T. Toussaint.
Interlocking and Euclidean rhythms.
Journal of Mathematics and Music, 3(1):15-30, March 2009.
|
|
[69]
|
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 ]
|
|
[70]
|
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 ]
|
|
[71]
|
J. Cardinal, S. Collette, and S. Langerman.
Empty region graphs.
Computational Geometry: Theory and Applications, 42:183-195,
2009.
[ DOI |
.pdf ]
|
|
[72]
|
Attila Bernáth and Gwenaël Joret.
Well-balanced orientations of mixed graphs.
Information Processing Letters, 106(4):149-151, 2008.
[ .pdf ]
|
|
[73]
|
Nicolas Bougard and Gwenaël Joret.
Turán's theorem and k-connected graphs.
Journal of Graph Theory, 58(1):1-13, 2008.
[ .pdf ]
|
|
[74]
|
J. Cardinal, S. Fiorini, and G. Joret.
Minimum entropy orientations.
Operations Research Letters, 36:680-683, 2008.
[ http ]
|
|
[75]
|
J. Cardinal, S. Fiorini, and G. Joret.
Minimum entropy coloring.
Journal of Combinatorial Optimization, 16(4):361-377, 2008.
|
|
[76]
|
J. Cardinal, S. Fiorini, and G. Joret.
Tight results on minimum entropy set cover.
Algorithmica, 51(1):49-60, 2008.
|
|
[77]
|
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 ]
|
|
[78]
|
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 ]
|
|
[79]
|
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 ]
|
|
[80]
|
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 ]
|
|
[81]
|
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 ]
|
|
[82]
|
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 ]
|
|
[83]
|
S. Collette, L. Cucu, and J. Goossens.
Integrating job parallelism in real-time scheduling theory.
Information Processing Letters, 106:180-187, 2008.
[ DOI |
.pdf ]
|
|
[84]
|
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 ]
|
|
[85]
|
Greg Aloupis, Prosenjit Bose, and Pat Morin.
Reconfiguring triangulations with edge flips and point moves.
Algorithmica, 47(4):367-378, 2007.
|
|
[86]
|
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, 2007.
|
|
[87]
|
E.D. Demaine, J. Iacono, and S. Langerman.
Retroactive data structures.
ACM Transactions on Algorithms, 3(2):13.1-13.20, May 2007.
[ DOI ]
|
|
[88]
|
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 ]
|
|
[89]
|
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 ]
|
|
[90]
|
Erik D. Demaine, Martin L. Demaine, Perouz Taslakian, and Godfried T.
Toussaint.
Sand drawings and Gaussian graphs.
Journal of Mathematics and the Arts, pages 125-132, June 2007.
|
Recent Conference Publications
|
[1]
|
J. Cardinal and M. Korman.
Coloring planar homothets and three-dimensional hypergraphs.
In Proc. Latin American Theoretical INformatics (LATIN),
2012.
|
|
[2]
|
H. Ito, S. Langerman, and Y. Yoshida.
Algorithms and complexity of generalized river crossing problems.
In Proceedings of the sixth International Conference on Fun with
Algorithms (FUN 2012) (to appear), 2012.
|
|
[3]
|
G. Aloupis, M. Dulieu, J. Iacono, S. Langerman, Ö. Özkan, S. Ramaswami, and
S. Wuhrer.
Order type invariant labeling and comparison of point sets.
In Proceedings of the 28th European Workshop on Computational
Geometry (EuroCG12), 2012.
|
|
[4]
|
P. Bose, V. Dujmovic, F. Hurtado, J. Iacono, S. Langerman, H. Meijer,
V. Sacristán, M. Saumell, and D.R. Wood.
Proximity graphs: E, δ, Δ, χ and ω.
In Proceedings of the 28th European Workshop on Computational
Geometry (EuroCG12), 2012.
|
|
[5]
|
Oswin Aichholzer, Matias Korman, Alex Pilz, and Birgit Vogtenhuber.
Geodesic order types.
In Submitted to the 28th Symposium on Computational geometry
(SoCG'12), 2012.
|
|
[6]
|
Tetsuo Asano, Kevin Buchin, Maike Buchin, Matias Korman, Wolfgang Mulzer,
Günter Rote, and André Schulz.
Memory-constrained algorithms for simple polygons.
In Submitted to the 28th Symposium on Computational geometry
(SoCG'12), 2012.
|
|
[7]
|
Therese Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, and
Maxwell Young.
Optimal algorithms for segment minimization with small maximal value.
In Algorithms and Data Structures Symposium, 2011.
|
|
[8]
|
Oswin Aichholzer, Greg Aloupis, Erik Demaine, Martin Demaine, Vida
Dujmović, Ferran Hurtado, Anna Lubiw, Gunter Rote, André Schulz,
Diane Souvaine, and Andrew Winslow.
Convexifying polygons without losing visibilities.
In Proc. 23rd CCCG, 2011.
|
|
[9]
|
Greg Aloupis, Mirela Damian, Robin Flatland, Matias Korman, Ozgur Ozkan, and
David Rappaport.
Establishing connectivity using optimal radius directional antennas.
In Proc. 23rd CCCG, 2011.
|
|
[10]
|
J. Cardinal and M. Korman.
Coloring planar homothets and three-dimensional hypergraphs.
In Proc. European Workshop on Computational Geometry
(EuroCG), 2011.
|
|
[11]
|
J. Cardinal, M. Karpinski, R. Schmied, and C. Viehmann.
Approximating subdense instances of graph covering problems.
In Proc. VI Latin-American Algorithms, Graphs and Optimization
Symposium (LAGOS), Electronic Notes in Discrete Mathematics, 2011.
|
|
[12]
|
J. Cardinal, H. Ito, and S. Langerman.
Helly numbers of polyminoes.
In Proc. Canadian Conference on Computational Geometry
(CCCG), 2011.
|
|
[13]
|
L. Barba, M. Korman, S. Langerman, and R.I. Silveira.
Computing the visibility polygon using few variables.
In Proceedings of the International Symposium on Algorithms and
Computation (ISAAC 2011), volume 7074 of LNCS, pages 70-79.
Springer-Verlag, 2011.
[ DOI ]
|
|
[14]
|
V. Dujmovic and S. Langerman.
A center transversal theorem for hyperplanes and applications to
graph drawing.
In Proceedings of the 2011 ACM Symposium on Computational
Geometry (SoCG 2011), pages 117-124, 2011.
[ DOI ]
|
|
[15]
|
M. Korman and S. Langerman.
On recognizing circle-freeness.
In Abstracts of the Japan Conference on Discrete and
Computational Geometry (JCDCG11), pages 46-47, 2011.
|
|
[16]
|
S. Langerman and Y. Okamoto.
Planar convex hulls against lies.
In Abstracts of the 4th Annual Meeting of the AAAC (AAAC11),
2011.
|
|
[17]
|
Petr A. Golovach, Marcin Kaminski, Daniël Paulusma, and Dimitrios M.
Thilikos.
Increasing the minimum degree of a graph by contractions.
In IPEC, pages 67-79, 2011.
|
|
[18]
|
Rémy Belmonte, Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Marcin
Kaminski, and Daniël Paulusma.
Finding contractions and induced minors in chordal graphs via
disjoint paths.
In ISAAC, pages 110-119, 2011.
|
|
[19]
|
Petr A. Golovach, Marcin Kaminski, and Daniël Paulusma.
Contracting a chordal graph to a split graph or a tree.
In MFCS, pages 339-350, 2011.
|
|
[20]
|
J. M. Díaz-Báñez, M. Korman, P. Pérez-Lantero, and I. Ventura.
The 1-center and 1-highway problem.
In special LNCS Festschrift volume (submitted), 2011.
Special issue of selected papers from the 14th Spanish Meeting on
Computational Geometry. 12 pages.
|
|
[21]
|
J. M. Díaz-Báñez, M. Korman, P. Pérez-Lantero, and I. Ventura.
Locating a service facility and a rapid transit line.
In special LNCS Festschrift volume (submitted), 2011.
Special issue of selected papers from the 14th Spanish Meeting on
Computational Geometry. 12 pages.
|
|
[22]
|
Matias Korman.
Minimizing interference in ad-hoc networks with bounded communication
radius.
In Proc. of the 22nd International Symposium on Algorithms and
Computation (ISAAC'11), pages 80-89, 2011.
[ DOI |
http ]
|
|
[23]
|
J. M. Díaz-Báñez, M. Korman, P. Pérez-Lantero, and I. Ventura.
Locating a service facility and a rapid transit line of variable
length.
In Proc. of the 30th International Conference of the Chilean
Computer Science Society (SCCC'2011), 2011.
10 pages.
|
|
[24]
|
Greg Aloupis, Mirela Damian, Robin Flatland, Matias Korman, Özgür Özkan,
David Rappaport, and Stefanie Wuhrer.
Establishing strong connectivity using optimal radius half-disk
antennas.
In Proc. of the 23rd Canadian Conference on Computational
Geometry, pages 361-366, 2011.
[ http ]
|
|
[25]
|
J. M. Díaz-Báñez, M. Korman, P. Pérez-Lantero, and I. Ventura.
Locating a service facility and a rapid transit line.
In Proc. of the 14th Spanish Meeting on Computational Geometry,
pages 189-192, 2011.
|
|
[26]
|
J. M. Díaz-Báñez, M. Korman, P. Pérez-Lantero, and I. Ventura.
The 1-center and 1-highway problem.
In Proc. of the 14th Spanish Meeting on Computational Geometry,
pages 193-196, 2011.
|
|
[27]
|
J. Cardinal, S. Fiorini, G. Joret, R. M. Jungers, and J. I. Munro.
Sorting under partial information (without the ellipsoid algorithm).
In Proc. ACM Symposium on Theory of Computing (STOC), pages
359-368. ACM, 2010.
|
|
[28]
|
S.-W. Cheng, C. Knauer, S. Langerman, and M. Smid.
Approximating the average stretch factor of geometric graphs.
In Proceedings of the International Symposium on Algorithms and
Computation (ISAAC 2010), volume 5606 of LNCS, pages 37-48.
Springer-Verlag, 2010.
[ DOI ]
|
|
[29]
|
Y. Higashikawa, N. Katoh, S. Langerman, and S. Tanigawa.
Online graph exploration algorithms for cycles and trees by multiple
searchers.
In Abstracts of the China-Japan Joint Conference on
Computational Geometry, Graphs and Applications (CGGA 2010), pages 54-55,
2010.
|
|
[30]
|
Y. Higashikawa, N. Katoh, S. Langerman, and S. Tanigawa.
Online graph exploration algorithms for cycles and trees by multiple
searchers.
In Abstracts of the 3rd Annual Meeting of the Asian Association
for Algorithms and Computation (AAAC 2010), 2010.
|
|
[31]
|
Sang Won Bae, Matias Korman, and Yoshio Okamoto.
The geodesic diameter of polygonal domains.
In Proc. of the 18th European Symposium on Algorithms (ESA'10),
pages 500-511, 2010.
[ DOI |
http ]
|
|
[32]
|
Shinya Anzai, Jinhee Chun, Ryosei Kasai, Matias Korman, and Takeshi Tokuyama.
Effect of corner information in simultaneous placement of k
rectangles and tableaux.
In Proc. of the 16th International Conference on Computing and
Combinatorics (COCOON'10), pages 235-243, 2010.
[ DOI |
.pdf ]
|
|
[33]
|
Shinya Anzai, Jinhee Chun, Ryosei Kasai, Matias Korman, and Takeshi Tokuyama.
Effect of corner information in simultaneous placement of k
rectangles and tableaux.
In Dutch CG Day (DCGD'10), 2010.
|
|
[34]
|
Sang Won Bae, Matias Korman, and Yoshio Okamoto.
The geodesic diameter of polygonal domains.
In Proc. of the 26th European Workshop on Computational
Geometry, pages 49-52, 2010.
[ .pdf ]
|
|
[35]
|
Isabel Hubard and Perouz Taslakian.
Deflating polygons to the limit.
In Proceedings of the 22nd Canadian Conference on Computational
Geometry (CCCG 2010), pages 67-70, August 2010.
|
|
[36]
|
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.
|
|
[37]
|
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.
|
|
[38]
|
Greg Aloupis, Nadia Benbernou, Mirela Damian, Erik Demaine, Robin Flatland,
John Iacono, and Stefanie Wuhrer.
Efficient reconfiguration for lattice-based modular robots.
In Proc. European Conference on Mobile Robotics, pages 81-86,
2009.
|
|
[39]
|
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 ]
|
|
[40]
|
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 ]
|
|
[41]
|
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), volume 5878 of Lecture Notes in Computer Science, pages
452-461. Springer-Verlag, 2009.
Also presented at the 7th Japan Conference on Computational Geometry
and Graphs (JCCGG09).
|
|
[42]
|
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),
volume 5929 of Lecture Notes in Computer Science, pages 125-136.
Springer-Verlag, 2009.
|
|
[43]
|
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), 2009.
|
|
[44]
|
E.D. Demaine, M.L. Demaine, V. Hart, J. Iacono, S. Langerman, and J. O'Rourke.
Continuous blooming of convex polyhedra.
In Abstracts from the 7th Japan Conference on Computational
Geometry and Graphs (JCCGG 2009), pages 123-124, 2009.
|
|
[45]
|
E.D. Demaine, M.L. Demaine, S. Langerman, and J. Vervier.
Locked thick chains.
In Abstracts from the 25th European Workshop on Computational
Geometry (EuroCG 2009), pages 65-68, 2009.
|
|
[46]
|
Jinhee Chun, Kasai Ryosei, Matias Korman, and Takeshi Tokuyama.
Algorithms for computing the maximum weight region decomposable into
elementary shapes.
In Proc. of the 20th International Symposium on Algorithms and
Computation (ISAAC'09), pages 1166-1174, 2009.
[ DOI |
.pdf ]
|
|
[47]
|
Sang Won Bae, Matias Korman, and Takeshi Tokuyama.
All farthest neighbors in the presence of highways and obstacles.
In Proc. of the 3rd International Workshop on Algorithms and
Computation (WALCOM'09), pages 71-82, 2009.
[ DOI |
.pdf ]
|
|
[48]
|
Hee Kap Ahn, Sang Won Bae, Sang Sub Kim, Matias Korman, Iris Reinbacher, and
Wanbin Son.
Square and rectangle covering with outliers.
In Proc. of the 3rd Frontiers of Algorithmics Workshop
(FAW'09), 2009.
[ DOI |
http ]
|
|
[49]
|
Hee Kap Ahn, Sang Won Bae, Sang Sub Kim, Matias Korman, Iris Reinbacher, and
Wanbin Son.
Square and rectangle covering with outliers.
In Proc. of the 25th European Workshop on Computational
Geometry, 2009.
|
|
[50]
|
Matias Korman and Takeshi Tokuyama.
An improved algorithm for inserting a highway in a city metric based
on quasiconvex optimization techniques.
In Proc. of the 25th European Workshop on Computational
Geometry, 2009.
[ .pdf ]
|
|
[51]
|
M. Korman and T. Tokuyama.
An improved algorithm for inserting a highway in a city metric based
on quasiconvex optimization techniques.
In Proc. of the 2nd Asian Association for Algorithms and
Computation (AAAC'09), 2009.
|
|
[52]
|
Jinhee Chun, Kasai Ryosei, Matias Korman, and Takeshi Tokuyama.
Algorithms for computing the optimal image segmentation of
nonintersecting union of base monotone regions (in japanese).
In Proc. of the 8th Forum on Information Technology (FIT'09),
2009.
[ .pdf ]
|
|
[53]
|
Hee Kap Ahn, Sang Won Bae, Sang Sub Kim, Matias Korman, Iris Reinbacher, and
Wanbin Son.
Square and rectangle covering with outliers.
In Proc. of the Language Automaton Symposium, 2009.
|
|
[54]
|
M. Korman and T. Tokuyama.
An improved algorithm for inserting a highway in a city metric based
on quasiconvex optimization.
In IEICE technical report. Theoretical foundations of Computing
(compKEN), 2009.
|
|
[55]
|
Jinhee Chun, Kasai Ryosei, Matias Korman, and Takeshi Tokuyama.
Algorithms for optimal segmentation of regions decomposable into
basic shapes.
In IEICE technical report. Theoretical foundations of Computing
(compKEN), 2009.
|
|
[56]
|
David Bremner, Erik D. Demaine, Perouz Taslakian, and Godfried T. Toussaint.
Reconstructing points on a circle from labeled distances.
In Proceedings of the 25th European Workshop on Computational
Geometry (EuroCG 2009), pages 155-158, March 2009.
|
|
[57]
|
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.
|
|
[58]
|
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.
|
|
[59]
|
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 ]
|
|
[60]
|
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), volume 31 of Electronic Notes in
Discrete Mathematics, pages 213-218, 2008.
|
|
[61]
|
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 ]
|
|
[62]
|
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.
|
|
[63]
|
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.
|
|
[64]
|
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.
|
|
[65]
|
Matias Korman and Takeshi Tokuyama.
Optimal insertion of a segment highway in a city metric.
In Proc. of the 14th International Conference on Computing and
Combinatorics (COCOON'08), pages 611-620, 2008.
[ DOI |
.pdf ]
|
|
[66]
|
Jinhee Chun, Matias Korman, Martin Nöllenburg, and Takeshi Tokuyama.
Consistent digital rays.
In Proc. of the 24th Symposium on Computational geometry
(SoCG'08), pages 355-364, 2008.
[ DOI |
.pdf ]
|
|
[67]
|
Matias Korman and Takeshi Tokuyama.
Optimal insertion of a segment highway in a city metric.
In Proc. of the 24th European Workshop on Computational
Geometry, 2008.
[ DOI |
.pdf ]
|
|
[68]
|
Jinhee Chun, Matias Korman, Martin Nöllenburg, and Takeshi Tokuyama.
Consistent digital rays.
In Proc. of the 24th European Workshop on Computational
Geometry, 2008.
|
|
[69]
|
Matias Korman and Takeshi Tokuyama.
Subquadratic segment insertion.
In Proc. of the Language Automaton Symposium, 2008.
|
|
[70]
|
M. Korman and T. Tokuyama.
Optimal insertion of a segment highway in a city metric.
In Proc. of the 1st Asian Association for Algorithms and
Computation (AAAC'08), 2008.
|
|
[71]
|
Jinhee Chun, Matias Korman, Martin Nöllenburg, and Takeshi Tokuyama.
Consistent digital rays.
In Proc. of the 1st Asian Association for Algorithms and
Computation (AAAC'08), 2008.
|
|
[72]
|
S.-W. Bae and M. Korman.
All farthest neighbors under the city metric.
In Proc. of the 11th Japan-Korea Joint Workshop on Algorithms
and Computation (WAAC'08), 2008.
|
|
[73]
|
Jinhee Chun, Matias Korman, Martin Nöllenburg, and Takeshi Tokuyama.
Finding the maximum union of closures is np-hard, even for trees.
In Proc. of The 11th Japan-Korea Joint Workshop on Algorithms
and Computation (WAAC'08), 2008.
[ .pdf ]
|
|
[74]
|
Francisco Gomez-Martin, Perouz Taslakian, and Godfried T. Toussaint.
Evenness preserving operations on musical rhythms.
In Proceedings of the Canadian Conference on Computer Science
and Software Engineering (C3S2E '08), pages 121-123, New York, NY, USA,
2008. ACM.
|
|
[75]
|
Francisco Gomez-Martin, Perouz Taslakian, and Godfried T. Toussaint.
Convergence of the shadow sequence of inscribed polygons.
In Proceedings of the 18th Fall Workshop on Computational
Geometry (FWCG 2008), pages 10-11, October 2008.
|
|
[76]
|
Joseph O'Rourke, Perouz Taslakian, and Godfried T. Toussaint.
A pumping lemma for homometric rhythms.
In Proceedings of the 20th Canadian Conference on Computational
Geometry (CCCG 2008), pages 121-123, August 2008.
|
|
[77]
|
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.
|
|
[78]
|
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 ]
|
|
[79]
|
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.
|
|
[80]
|
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 ]
|
|
[81]
|
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 ]
|
|
[82]
|
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 ]
|
|
[83]
|
J. Cardinal, S. Langerman, and G. Louchard.
Randomized optimization : a probabilistic analysis.
In Proc. International Conference on Analysis of Algorithms
(AofA), 2007.
|
|
[84]
|
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 ]
|
|
[85]
|
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.
|
|
[86]
|
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.
|
|
[87]
|
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.
|
|
[88]
|
J. Chun, M. Korman, Y. Okada, and T. Tokuyama.
Distance trisector curves between a point and a line.
In Proc. of the International Conference on Computational
Geometry and Graph Theory (CGGT'07), 2007.
[ .pdf ]
|
|
[89]
|
M. Korman and T. Tokuyama.
Optimal highway location problem.
In Proc. of the International Conference on Computational
Geometry and Graph Theory (CGGT'07), 2007.
|
|
[90]
|
M. Korman and T. Tokuyama.
Optimal highway location problem.
In IEICE technical report. Theoretical foundations of Computing
(compKEN), pages 19-25, 2007.
|
|
[91]
|
Kevin Buchin, Maike Buchin, Erik D. Demaine, Martin L. Demaine, Dania
El-Khechen, Sándor Fekete, Christian Knauer, André Schulz, and Perouz
Taslakian.
On rolling cube puzzles.
In Proceedings of the 19th Canadian Conference on Computational
Geometry (CCCG 2007), pages 141-144, August 2007.
|
|
[92]
|
Erik D. Demaine, Martin L. Demaine, Diane L. Souvaine, and Perouz Taslakian.
Deflating the Pentagon.
In Proceedings of the 23rd European Workshop on Computational
Geometry (EuroCG 2007), pages 10-14, March 2007.
|
|
[93]
|
Erik D. Demaine, Martin L. Demaine, Thomas Fevens, Antonio Mesa, Michael Soss,
Diane L. Souvaine, Perouz Taslakian, and Godfried Toussaint.
Deflating the Pentagon.
In Revised Papers from the Kyoto International Conference on
Computational Geometry and Graph Theory (KytoCGGT 2007), pages 56-57,
Berlin, Germany, June 2007. Springer-Verlag.
Lecture Notes in Computer Science (LNCS), volume 4535.
|
|
[94]
|
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 ]
|
|
[95]
|
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.
|
|
[96]
|
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 ]
|
|
[97]
|
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 ]
|
 |
|
