| 2009 |
|---|
| 101 | EE | Greg Aloupis,
Jean Cardinal,
Sébastien Collette,
Stefan Langerman,
David Orden,
Pedro Ramos:
Decomposition of multiple coverings into more parts.
SODA 2009: 302-310 |
| 100 | EE | Sébastien Collette,
Vida Dujmovic,
John Iacono,
Stefan Langerman,
Pat Morin:
Entropy, Triangulation, and Point Location in Planar Subdivisions
CoRR abs/0901.1908: (2009) |
| 99 | EE | Greg Aloupis,
Jean Cardinal,
Sébastien Collette,
S. Imahori,
M. Korman,
Stefan Langerman,
O. Schwartz,
Shakhar Smorodinsky,
Perouz Taslakian:
Colorful Strips
CoRR abs/0904.2115: (2009) |
| 98 | EE | Jean Cardinal,
Sébastien Collette,
Stefan Langerman:
Empty region graphs.
Comput. Geom. 42(3): 183-195 (2009) |
| 97 | EE | Greg Aloupis,
Jean Cardinal,
Sébastien Collette,
Stefan Langerman,
Shakhar Smorodinsky:
Coloring Geometric Range Spaces.
Discrete & Computational Geometry 41(2): 348-362 (2009) |
| 96 | EE | Jean Cardinal,
Stefan Langerman,
Eythan Levy:
Improved approximation bounds for edge dominating set in dense graphs.
Theor. Comput. Sci. 410(8-10): 949-957 (2009) |
| 2008 |
|---|
| 95 | EE | Frédéric Pluquet,
Stefan Langerman,
Antoine Marot,
Roel Wuyts:
Implementing Partial Persistence in Object-Oriented Languages.
ALENEX 2008: 37-48 |
| 94 | | Greg Aloupis,
Jean Cardinal,
Sébastien Collette,
Ferran Hurtado,
Stefan Langerman,
Joseph O'Rourke:
Draining a Polygon - or - Rolling a Ball out of a Polygon.
CCCG 2008 |
| 93 | | Prosenjit Bose,
Stefan Langerman,
Sasanka Roy:
Smallest enclosing circle centered on a query line segment.
CCCG 2008 |
| 92 | | Greg Aloupis,
Prosenjit Bose,
Vida Dujmovic,
Chris Gray,
Stefan Langerman,
Bettina Speckmann:
Triangulating and Guarding Realistic Polygons.
CCCG 2008 |
| 91 | EE | Greg Aloupis,
Sébastien Collette,
Erik D. Demaine,
Stefan Langerman,
Vera Sacristán Adinolfi,
Stefanie Wuhrer:
Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves.
ISAAC 2008: 342-353 |
| 90 | EE | Greg Aloupis,
Jean Cardinal,
Sébastien Collette,
Stefan Langerman,
Shakhar Smorodinsky:
Coloring Geometric Range Spaces.
LATIN 2008: 146-157 |
| 89 | EE | Prosenjit Bose,
Karim Douïeb,
Stefan Langerman:
Dynamic optimality for skip lists and B-trees.
SODA 2008: 1106-1114 |
| 88 | EE | Sébastien Collette,
Vida Dujmovic,
John Iacono,
Stefan Langerman,
Pat Morin:
Distribution-sensitive point location in convex subdivisions.
SODA 2008: 912-921 |
| 87 | EE | Erik D. Demaine,
Stefan Langerman,
Eric Price:
Confluently Persistent Tries for Efficient Version Control.
SWAT 2008: 160-172 |
| 86 | EE | Karim Douïeb,
Stefan Langerman:
Dynamic Hotlinks.
Algorithmica 50(2): 208-222 (2008) |
| 85 | EE | Zachary Abel,
David Charlton,
Sébastien Collette,
Erik D. Demaine,
Martin L. Demaine,
Stefan Langerman,
Joseph O'Rourke,
Val Pinciu,
Godfried T. Toussaint:
Cauchy's Arm Lemma on a Growing Sphere
CoRR abs/0804.0986: (2008) |
| 84 | EE | Greg Aloupis,
Jean Cardinal,
Sébastien Collette,
Ferran Hurtado,
Stefan Langerman,
Joseph O'Rourke,
Belén Palop:
Highway Hull Revisited
CoRR abs/0806.1416: (2008) |
| 83 | EE | Greg Aloupis,
Jean Cardinal,
Sébastien Collette,
Stefan Langerman,
David Orden,
Pedro Ramos:
Decomposition of Multiple Coverings into More Parts
CoRR abs/0807.0552: (2008) |
| 82 | EE | Greg Aloupis,
Erik D. Demaine,
Stefan Langerman,
Pat Morin,
Joseph O'Rourke,
Ileana Streinu,
Godfried T. Toussaint:
Edge-unfolding nested polyhedral bands.
Comput. Geom. 39(1): 30-42 (2008) |
| 81 | EE | Jean Cardinal,
Sébastien Collette,
Stefan Langerman:
Local properties of geometric graphs.
Comput. Geom. 39(1): 55-64 (2008) |
| 80 | EE | Jean Cardinal,
Sébastien Collette,
Ferran Hurtado,
Stefan Langerman,
Belén Palop:
Optimal location of transportation devices.
Comput. Geom. 41(3): 219-229 (2008) |
| 79 | EE | Pankaj K. Agarwal,
Rolf Klein,
Christian Knauer,
Stefan Langerman,
Pat Morin,
Micha Sharir,
Michael A. Soss:
Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D.
Discrete & Computational Geometry 39(1-3): 17-37 (2008) |
| 78 | EE | Prosenjit Bose,
Vida Dujmovic,
Ferran Hurtado,
Pat Morin,
Stefan Langerman,
David R. Wood:
A Polynomial Bound for Untangling Geometric Planar Graphs.
Electronic Notes in Discrete Mathematics 31: 213-218 (2008) |
| 77 | EE | Prosenjit Bose,
Vida Dujmovic,
Danny Krizanc,
Stefan Langerman,
Pat Morin,
David R. Wood,
Stefanie Wuhrer:
A Characterization of the degree sequences of 2-trees.
Journal of Graph Theory 58(3): 191-209 (2008) |
| 76 | EE | David Bremner,
Dan Chen,
John Iacono,
Stefan Langerman,
Pat Morin:
Output-sensitive algorithms for Tukey depth and related problems.
Statistics and Computing 18(3): 259-266 (2008) |
| 2007 |
|---|
| 75 | | Greg Aloupis,
Brad Ballinger,
Prosenjit Bose,
Mirela Damian,
Erik D. Demaine,
Martin L. Demaine,
Robin Y. Flatland,
Ferran Hurtado,
Stefan Langerman,
Joseph O'Rourke,
Perouz Taslakian,
Godfried T. Toussaint:
Vertex Pops and Popturns.
CCCG 2007: 137-140 |
| 74 | EE | Greg Aloupis,
Sébastien Collette,
Mirela Damian,
Erik D. Demaine,
Robin Y. Flatland,
Stefan Langerman,
Joseph O'Rourke,
Suneeta Ramaswami,
Vera Sacristán Adinolfi,
Stefanie Wuhrer:
Linear Reconfiguration of Cube-Style Modular Robots.
ISAAC 2007: 208-219 |
| 73 | EE | Jean Cardinal,
Erik D. Demaine,
Samuel Fiorini,
Gwenaël Joret,
Stefan Langerman,
Ilan Newman,
Oren Weimann:
The Stackelberg Minimum Spanning Tree Game.
WADS 2007: 64-76 |
| 72 | EE | Erik D. Demaine,
John Iacono,
Stefan Langerman:
Retroactive data structures.
ACM Transactions on Algorithms 3(2): (2007) |
| 71 | EE | Jean Cardinal,
Sébastien Collette,
Ferran Hurtado,
Stefan Langerman,
Belén Palop:
Moving Walkways, Escalators, and Elevators
CoRR abs/0705.0635: (2007) |
| 70 | EE | Prosenjit Bose,
Vida Dujmovic,
Ferran Hurtado,
Stefan Langerman,
Pat Morin,
David R. Wood:
A polynomial bound for untangling geometric planar graphs
CoRR abs/0710.1641: (2007) |
| 69 | EE | Jean Cardinal,
Erik D. Demaine,
Samuel Fiorini,
Gwenaël Joret,
Stefan Langerman,
Ilan Newman,
Oren Weimann:
The Stackelberg Minimum Spanning Tree Game
CoRR abs/cs/0703019: (2007) |
| 68 | EE | Prosenjit Bose,
Erik D. Demaine,
Ferran Hurtado,
John Iacono,
Stefan Langerman,
Pat Morin:
Geodesic Ham-Sandwich Cuts.
Discrete & Computational Geometry 37(3): 325-339 (2007) |
| 2006 |
|---|
| 67 | EE | Mirela Damian,
Erik D. Demaine,
Martin L. Demaine,
Vida Dujmovic,
Dania El-Khechen,
Robin Y. Flatland,
John Iacono,
Stefan Langerman,
Henk Meijer,
Suneeta Ramaswami,
Diane L. Souvaine,
Perouz Taslakian,
Godfried T. Toussaint:
Curves in the Sand: Algorithmic Drawing.
CCCG 2006 |
| 66 | EE | Greg Aloupis,
Jean Cardinal,
Sébastien Collette,
Stefan Langerman:
LUMINESStrategies.
Computers and Games 2006: 190-199 |
| 65 | EE | David Bremner,
Timothy M. Chan,
Erik D. Demaine,
Jeff Erickson,
Ferran Hurtado,
John Iacono,
Stefan Langerman,
Perouz Taslakian:
Necklaces, Convolutions, and X + Y.
ESA 2006: 160-171 |
| 64 | EE | Karim Douïeb,
Stefan Langerman:
Near-Entropy Hotlink Assignments.
ESA 2006: 292-303 |
| 63 | EE | Boris Aronov,
Prosenjit Bose,
Erik D. Demaine,
Joachim Gudmundsson,
John Iacono,
Stefan Langerman,
Michiel H. M. Smid:
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.
LATIN 2006: 80-92 |
| 62 | EE | Robert Connelly,
Erik D. Demaine,
Martin L. Demaine,
Sándor P. Fekete,
Stefan Langerman,
Joseph S. B. Mitchell,
Ares Ribó,
Günter Rote:
Locked and unlocked chains of planar shapes.
Symposium on Computational Geometry 2006: 61-70 |
| 61 | EE | Jean Cardinal,
Stefan Langerman,
Eythan Levy:
Improved Approximation Bounds for Edge Dominating Set in Dense Graphs.
WAOA 2006: 108-120 |
| 60 | EE | Erik D. Demaine,
Stefan Langerman,
Joseph O'Rourke:
Geometric Restrictions on Producible Polygonal Protein Chains.
Algorithmica 44(2): 167-181 (2006) |
| 59 | EE | Robert Connelly,
Erik D. Demaine,
Martin L. Demaine,
Sándor P. Fekete,
Stefan Langerman,
Joseph S. B. Mitchell,
Ares Ribó,
Günter Rote:
Locked and Unlocked Chains of Planar Shapes
CoRR abs/cs/0604022: (2006) |
| 58 | EE | Prosenjit Bose,
Vida Dujmovic,
Danny Krizanc,
Stefan Langerman,
Pat Morin,
David R. Wood,
Stefanie Wuhrer:
A Characterization of the Degree Sequences of 2-Trees
CoRR abs/cs/0605011: (2006) |
| 57 | EE | Jean Cardinal,
Steve Kremer,
Stefan Langerman:
Juggling with Pattern Matching.
Theory Comput. Syst. 39(3): 425-437 (2006) |
| 56 | EE | Erik D. Demaine,
Martin L. Demaine,
Arthur Langerman,
Stefan Langerman:
Morpion Solitaire.
Theory Comput. Syst. 39(3): 439-453 (2006) |
| 2005 |
|---|
| 55 | EE | Jean Cardinal,
Sébastien Collette,
Stefan Langerman:
Region Counting Distances and Region Counting Circles.
CCCG 2005: 278-281 |
| 54 | EE | Boris Aronov,
Franz Aurenhammer,
Ferran Hurtado,
Stefan Langerman,
David Rappaport,
Shakhar Smorodinsky,
Carlos Seara:
Small weak epsilon nets.
CCCG 2005: 52-56 |
| 53 | EE | Timothy G. Abbott,
Erik D. Demaine,
Martin L. Demaine,
Daniel Kane,
Stefan Langerman,
Jelani Nelson,
Vincent Yeung:
Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane.
CCCG 2005: 61-64 |
| 52 | EE | Sergio Cabello,
José Miguel Díaz-Báñez,
Stefan Langerman,
Carlos Seara,
Inmaculada Ventura:
Reverse facility location problems.
CCCG 2005: 68-71 |
| 51 | EE | Jean Cardinal,
Martine Labbé,
Stefan Langerman,
Belén Palop:
Pricing of Geometric Transportation Networks.
CCCG 2005: 92-96 |
| 50 | EE | Jean Cardinal,
Martine Labbé,
Stefan Langerman,
Eythan Levy,
Hadrien Mélot:
A Tight Analysis of the Maximal Matching Heuristic.
COCOON 2005: 701-709 |
| 49 | EE | Erik D. Demaine,
Stefan Langerman:
Optimizing a 2D Function Satisfying Unimodality Properties.
ESA 2005: 887-898 |
| 48 | EE | Karim Douïeb,
Stefan Langerman:
Dynamic Hotlinks.
WADS 2005: 182-194 |
| 47 | EE | John Iacono,
Stefan Langerman:
Queaps.
Algorithmica 42(1): 49-56 (2005) |
| 46 | EE | Boris Aronov,
Prosenjit Bose,
Erik D. Demaine,
Joachim Gudmundsson,
John Iacono,
Stefan Langerman,
Michiel H. M. Smid:
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
CoRR abs/cs/0512091: (2005) |
| 45 | EE | David Bremner,
Erik D. Demaine,
Jeff Erickson,
John Iacono,
Stefan Langerman,
Pat Morin,
Godfried T. Toussaint:
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.
Discrete & Computational Geometry 33(4): 593-604 (2005) |
| 44 | EE | Stefan Langerman,
Pat Morin:
Covering Things with Things.
Discrete & Computational Geometry 33(4): 717-729 (2005) |
| 43 | EE | Erik D. Demaine,
Jeff Erickson,
Ferran Hurtado,
John Iacono,
Stefan Langerman,
Henk Meijer,
Mark H. Overmars,
Sue Whitesides:
Separating Point Sets in Polygonal Environments.
Int. J. Comput. Geometry Appl. 15(4): 403-420 (2005) |
| 42 | EE | Jean Cardinal,
Stefan Langerman:
Designing small keyboards is hard.
Theor. Comput. Sci. 332(1-3): 405-415 (2005) |
| 2004 |
|---|
| 41 | EE | Jean Cardinal,
Sébastien Collette,
Stefan Langerman:
Local properties of geometric graphs.
CCCG 2004: 145-148 |
| 40 | EE | Greg Aloupis,
Erik D. Demaine,
Stefan Langerman,
Pat Morin,
Joseph O'Rourke,
Ileana Streinu,
Godfried T. Toussaint:
Unfolding polyhedral bands.
CCCG 2004: 60-63 |
| 39 | EE | Prosenjit Bose,
Stefan Langerman:
Weighted Ham-Sandwich Cuts.
JCDCG 2004: 48-53 |
| 38 | EE | Erik D. Demaine,
John Iacono,
Stefan Langerman:
Grid Vertex-Unfolding Orthostacks.
JCDCG 2004: 76-82 |
| 37 | EE | Jean Cardinal,
Stefan Langerman:
Designing Small Keyboards Is Hard.
LATIN 2004: 391-400 |
| 36 | EE | Erik D. Demaine,
John Iacono,
Stefan Langerman:
Retroactive data structures.
SODA 2004: 281-290 |
| 35 | EE | Prosenjit Bose,
Erik D. Demaine,
Ferran Hurtado,
John Iacono,
Stefan Langerman,
Pat Morin:
Geodesic ham-sandwich cuts.
Symposium on Computational Geometry 2004: 1-9 |
| 34 | EE | Erik D. Demaine,
Jeff Erickson,
Ferran Hurtado,
John Iacono,
Stefan Langerman,
Henk Meijer,
Mark H. Overmars,
Sue Whitesides:
Separating point sets in polygonal environments.
Symposium on Computational Geometry 2004: 10-16 |
| 33 | EE | Julie Glass,
Stefan Langerman,
Joseph O'Rourke,
Jack Snoeyink,
Jianyuan K. Zhong:
A 2-chain can interlock with a k-chain
CoRR cs.CG/0410052: (2004) |
| 32 | EE | Erik D. Demaine,
John Iacono,
Stefan Langerman:
Worst-Case Optimal Tree Layout in a Memory Hierarchy
CoRR cs.DS/0410048: (2004) |
| 31 | EE | Erik D. Demaine,
John Iacono,
Stefan Langerman:
Proximate point searching.
Comput. Geom. 28(1): 29-40 (2004) |
| 2003 |
|---|
| 30 | | Erik D. Demaine,
Jeff Erickson,
Stefan Langerman:
On the Complexity of Halfspace Volume Queries.
CCCG 2003: 159-160 |
| 29 | | Greg Aloupis,
Thomas Fevens,
Stefan Langerman,
Tomomi Matsui,
Antonio Mesa,
David Rappaport,
Godfried T. Toussaint:
Computing the Similarity of two Melodies.
CCCG 2003: 81-84 |
| 28 | EE | Erik D. Demaine,
Stefan Langerman,
Joseph O'Rourke:
Geometric Restrictions on Producible Polygonal Protein Chains.
ISAAC 2003: 395-404 |
| 27 | EE | Stefan Langerman,
William L. Steiger:
Optimization in Arrangements.
STACS 2003: 50-61 |
| 26 | EE | John Iacono,
Stefan Langerman:
Proximate planar point location.
Symposium on Computational Geometry 2003: 220-226 |
| 25 | EE | David Bremner,
Erik D. Demaine,
Jeff Erickson,
John Iacono,
Stefan Langerman,
Pat Morin,
Godfried T. Toussaint:
Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries.
WADS 2003: 451-461 |
| 24 | EE | Erik D. Demaine,
Stefan Langerman,
Joseph O'Rourke,
Jack Snoeyink:
Interlocked open and closed linkages with few joints.
Comput. Geom. 26(1): 37-45 (2003) |
| 23 | EE | Greg Aloupis,
Stefan Langerman,
Michael A. Soss,
Godfried T. Toussaint:
Algorithms for bivariate medians and a Fermat-Torricelli problem for lines.
Comput. Geom. 26(1): 69-79 (2003) |
| 22 | EE | Stefan Langerman,
William L. Steiger:
The Complexity of Hyperplane Depth in the Plane.
Discrete & Computational Geometry 30(2): 299-309 (2003) |
| 21 | EE | Stefan Langerman:
On the Complexity of Halfspace Area Queries.
Discrete & Computational Geometry 30(4): 639-648 (2003) |
| 20 | EE | Prosenjit Bose,
Danny Krizanc,
Stefan Langerman,
Pat Morin:
Asymmetric Communication Protocols via Hotlink Assignments.
Theory Comput. Syst. 36(6): 655-661 (2003) |
| 2002 |
|---|
| 19 | EE | Erik D. Demaine,
John Iacono,
Stefan Langerman:
Proximate point searching.
CCCG 2002: 1-4 |
| 18 | EE | Greg Aloupis,
Prosenjit Bose,
Erik D. Demaine,
Stefan Langerman,
Henk Meijer,
Mark H. Overmars,
Godfried T. Toussaint:
Computing signed permutations of polygons.
CCCG 2002: 68-71 |
| 17 | EE | Stefan Langerman,
Pat Morin:
Covering Things with Things.
ESA 2002: 662-673 |
| 16 | EE | John Iacono,
Stefan Langerman:
Queaps.
ISAAC 2002: 211-218 |
| 15 | EE | Greg Aloupis,
Erik D. Demaine,
Vida Dujmovic,
Jeff Erickson,
Stefan Langerman,
Henk Meijer,
Joseph O'Rourke,
Mark H. Overmars,
Michael A. Soss,
Ileana Streinu,
Godfried T. Toussaint:
Flat-State Connectivity of Linkages under Dihedral Motions.
ISAAC 2002: 369-380 |
| 14 | EE | Mordecai J. Golin,
Stefan Langerman,
William L. Steiger:
The Convex Hull for Random Lines in the Plane.
JCDCG 2002: 172-175 |
| 13 | | Prosenjit Bose,
Danny Krizanc,
Stefan Langerman,
Pat Morin:
Asymmetric Communication Protocols via Hotlink Assignments.
SIROCCO 2002: 33-39 |
| 12 | EE | Stefan Langerman,
Pat Morin,
Michael A. Soss:
Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles.
STACS 2002: 250-261 |
| 11 | EE | Erik D. Demaine,
Stefan Langerman,
Joseph O'Rourke,
Jack Snoeyink:
Interlocked open linkages with few joints.
Symposium on Computational Geometry 2002: 189-198 |
| 2001 |
|---|
| 10 | EE | Greg Aloupis,
Stefan Langerman,
Michael A. Soss,
Godfried T. Toussaint:
Algorithms for bivariate medians and a fermat-torricelli problem for lines.
CCCG 2001: 21-24 |
| 9 | EE | Erik D. Demaine,
Stefan Langerman,
Joseph O'Rourke:
Short interlocked linkages.
CCCG 2001: 69-72 |
| 8 | EE | Stefan Langerman,
Sachin Lodha,
Rahul Shah:
Algorithms for Efficient Filtering in Content-Based Multicast.
ESA 2001: 428-439 |
| 7 | EE | Stefan Langerman:
On the complexity of halfspace area queries.
Symposium on Computational Geometry 2001: 207-211 |
| 2000 |
|---|
| 6 | EE | John Iacono,
Stefan Langerman:
Dynamic point location in fat hyperrectangles with integer coordinates.
CCCG 2000 |
| 5 | EE | Stefan Langerman:
On the Shooter Location Problem.
CCCG 2000 |
| 4 | EE | John Iacono,
Stefan Langerman:
Volume Queries in Polyhedra.
JCDCG 2000: 156-159 |
| 3 | EE | Stefan Langerman,
William L. Steiger:
An optimal algorithm for hyperplane depth in the plane.
SODA 2000: 54-59 |
| 1996 |
|---|
| 2 | | Hugues Bersini,
Marco Dorigo,
Stefan Langerman,
Gregory Seront,
Luca Maria Gambardella:
Results of the First International Contest on Evolutionary Optimisation (1st ICEO).
International Conference on Evolutionary Computation 1996: 611-615 |
| 1994 |
|---|
| 1 | | Stefan Langerman,
Gregory Seront,
Hugues Bersini:
S.T.E.P.: The Easiest Way to Optimize a Function.
International Conference on Evolutionary Computation 1994: 519-524 |
