Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Stefan Langerman
2010 – today
- 2013
[j58]Greg Aloupis, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Muriel Dulieu, Ruy Fabila Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, Perouz Taslakian: Non-crossing matchings of points with geometric objects. Comput. Geom. 46(1): 78-92 (2013)- [j57]Prosenjit Bose, Paz Carmi, Lilach Chaitman-Yerushalmi, Sébastien Collette, Matthew J. Katz, Stefan Langerman: Stable Roommates Spanner. Comput. Geom. 46(2): 120-130 (2013)
- [j56]Prosenjit Bose, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Vera Sacristan, Maria Saumell: Some properties of k-Delaunay and k-Gabriel graphs. Comput. Geom. 46(2): 131-139 (2013)
- [j55]Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin: Oja centers and centers of gravity. Comput. Geom. 46(2): 140-147 (2013)
- [j54]
- [j53]Vida Dujmovic, Stefan Langerman: A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing. Discrete & Computational Geometry 49(1): 74-88 (2013)
- [c84]Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira, Kunihiko Sadakane: Space-Time Trade-offs for Stack-Based Algorithms. STACS 2013: 281-292
- [i30]Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt: Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. CoRR abs/1302.2426 (2013)
- [i29]Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman: The Power and Limitations of Static Binary Search Trees with Lazy Finger. CoRR abs/1304.6897 (2013)
- [i28]Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan: Combining Binary Search Trees. CoRR abs/1304.7604 (2013)
- 2012
- [j52]Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Vera Sacristán Adinolfi, Maria Saumell, David R. Wood: PROXIMITY GRAPHS: E, δ, Δ, χ AND ω. Int. J. Comput. Geometry Appl. 22(5): 439-470 (2012)
- [j51]Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel H. M. Smid: Approximating the average stretch factor of geometric graphs. JoCG 3(1): 132-153 (2012)
- [j50]Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin: Entropy, triangulation, and point location in planar subdivisions. ACM Transactions on Algorithms 8(3): 29 (2012)
- [c83]Luis Felipe Barba Flores, Stefan Langerman, Greg Aloupis: Circle Separability Queries in Logarithmic Time. CCCG 2012: 113-118
- [c82]Sergio Cabello, Jean Cardinal, Stefan Langerman: The Clique Problem in Ray Intersection Graphs. ESA 2012: 241-252
- [c81]Hiro Ito, Stefan Langerman, Yuichi Yoshida: Algorithms and Complexity of Generalized River Crossing Problems. FUN 2012: 235-244
- [c80]Prosenjit Bose, Sébastien Collette, Rolf Fagerberg, Stefan Langerman: De-amortizing Binary Search Trees. ICALP (1) 2012: 121-132
- [c79]Sébastien Collette, John Iacono, Stefan Langerman: Confluent persistence revisited. SODA 2012: 593-601
- [i27]Greg Aloupis, Luis Barba, Stefan Langerman: Circle separability queries in logarithmic time. CoRR abs/1203.6266 (2012)
- [i26]Prosenjit Bose, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Perouz Taslakian: Coloring and Guarding Arrangements. CoRR abs/1205.5162 (2012)
- [i25]Greg Aloupis, Luis Barba, Stefan Langerman, Diane L. Souvaine: Bichromatic compatible matchings. CoRR abs/1207.2375 (2012)
- [i24]Luis Barba, Matias Korman, Stefan Langerman, Kunihiko Sadakane, Rodrigo I. Silveira: Space-Time Trade-offs for Stack-Based Algorithms. CoRR abs/1208.3663 (2012)
- [i23]David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Mihai Patrascu, Perouz Taslakian: Necklaces, Convolutions, and X+Y. CoRR abs/1212.4771 (2012)
- 2011
- [j49]Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann: The Stackelberg Minimum Spanning Tree Game. Algorithmica 59(2): 129-144 (2011)
- [j48]Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott Duke Kominers, Stefan Langerman, Attila Pór, David R. Wood: Every Large Point Set contains Many Collinear Points or an Empty Pentagon. Graphs and Combinatorics 27(1): 47-60 (2011)
- [j47]Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian: Colorful Strips. Graphs and Combinatorics 27(3): 327-339 (2011)
- [j46]Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi, Stefan Langerman, Ryuhei Uehara, Takeaki Uno: Algorithmic Folding Complexity. Graphs and Combinatorics 27(3): 341-351 (2011)
- [j45]Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, Joseph O'Rourke: Continuous Blooming of Convex Polyhedra. Graphs and Combinatorics 27(3): 363-376 (2011)
- [j44]Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint: Computing Signed Permutations of Polygons. Int. J. Comput. Geometry Appl. 21(1): 87-100 (2011)
- [j43]Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Stefan Langerman, Joseph O'Rourke, Val Pinciu, Suneeta Ramaswami, Vera Sacristan, Stefanie Wuhrer: Efficient constant-velocity reconfiguration of crystalline robots. Robotica 29(1): 59-71 (2011)
- [c78]
- [c77]Vida Dujmovic, Stefan Langerman: A center transversal theorem for hyperplanes and applications to graph drawing. Symposium on Computational Geometry 2011: 117-124
- [c76]Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira: Computing the Visibility Polygon Using Few Variables. ISAAC 2011: 70-79
- [i22]Sébastien Collette, John Iacono, Stefan Langerman: Confluent Persistence Revisited. CoRR abs/1104.3045 (2011)
- [i21]Prosenjit Bose, Sébastien Collette, Rolf Fagerberg, Stefan Langerman: De-amortizing Binary Search Trees. CoRR abs/1111.1665 (2011)
- [i20]Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira: Computing a visibility polygon using few variables. CoRR abs/1111.3584 (2011)
- [i19]Sergio Cabello, Jean Cardinal, Stefan Langerman: The Clique Problem in Ray Intersection Graphs. CoRR abs/1111.5986 (2011)
- 2010
- [j42]Erik D. Demaine, Stefan Langerman, Eric Price: Confluently Persistent Tries for Efficient Version Control. Algorithmica 57(3): 462-483 (2010)
- [j41]Karim Douïeb, Stefan Langerman: Near-Entropy Hotlink Assignments. Algorithmica 58(2): 221-244 (2010)
- [j40]Greg Aloupis, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Joseph O'Rourke, Belén Palop: Highway hull revisited. Comput. Geom. 43(2): 115-130 (2010)
- [j39]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. Discrete & Computational Geometry 44(2): 439-462 (2010)
- [j38]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, David Orden, Pedro Ramos: Decomposition of Multiple Coverings into More Parts. Discrete & Computational Geometry 44(3): 706-723 (2010)
- [j37]Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura: Facility location problems in the plane based on reverse nearest neighbor queries. European Journal of Operational Research 202(1): 99-106 (2010)
- [j36]Erik D. Demaine, John Iacono, Stefan Langerman: Grid Vertex-Unfolding Orthostacks. Int. J. Comput. Geometry Appl. 20(3): 245-254 (2010)
- [j35]Prosenjit Bose, Sébastien Collette, Stefan Langerman, Anil Maheshwari, Pat Morin, Michiel H. M. Smid: Sigma-local graphs. J. Discrete Algorithms 8(1): 15-23 (2010)
- [c75]Prosenjit Bose, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Vera Sacristan, Maria Saumell: Some properties of higher order delaunay and gabriel graphs. CCCG 2010: 13-16
- [c74]Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin: Oja medians and centers of gravity. CCCG 2010: 147-150
- [c73]Jin Akiyama, Takayasu Kuwata, Stefan Langerman, Kenji Okawa, Ikuro Sato, Geoffrey C. Shephard: Determination of All Tessellation Polyhedra with Regular Polygonal Faces. CGGA 2010: 1-11
- [c72]Greg Aloupis, Prosenjit Bose, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Karim Douïeb, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin: Common Unfoldings of Polyominoes and Polycubes. CGGA 2010: 44-54
- [c71]Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel H. M. Smid: Approximating the Average Stretch Factor of Geometric Graphs. ISAAC (1) 2010: 37-48
- [c70]Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian: Colorful Strips. LATIN 2010: 2-13
- [c69]Greg Aloupis, Jean Cardinal, Sébastien Collette, Erik D. Demaine, Martin L. Demaine, Muriel Dulieu, Ruy Fabila Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, Perouz Taslakian: Matching Points with Things. LATIN 2010: 456-467
- [c68]Gerth Stølting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, J. Ian Munro: Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. SODA 2010: 1448-1456
- [i18]Vida Dujmovic, Stefan Langerman: A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing. CoRR abs/1012.0548 (2010)
2000 – 2009
- 2009
- [j34]Jean Cardinal, Sébastien Collette, Stefan Langerman: Empty region graphs. Comput. Geom. 42(3): 183-195 (2009)
- [j33]Timothy G. Abbott, Michael Burr, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, John Hugg, Daniel M. Kane, Stefan Langerman, Jelani Nelson, Eynat Rafalin, Kathryn Seyboth, Vincent Yeung: Dynamic ham-sandwich cuts in the plane. Comput. Geom. 42(5): 419-428 (2009)
- [j32]Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Carlos Seara, Shakhar Smorodinsky: Small weak epsilon-nets. Comput. Geom. 42(5): 455-462 (2009)
- [j31]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. Comput. Geom. 42(6-7): 652-663 (2009)
- [j30]Erik D. Demaine, Martin L. Demaine, John Iacono, Stefan Langerman: Wrapping spheres with flat paper. Comput. Geom. 42(8): 748-757 (2009)
- [j29]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky: Coloring Geometric Range Spaces. Discrete & Computational Geometry 41(2): 348-362 (2009)
- [j28]Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood: A Polynomial Bound for Untangling Geometric Planar Graphs. Discrete & Computational Geometry 42(4): 570-585 (2009)
- [j27]Jean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop: Pricing Geometric Transportation Networks. Int. J. Comput. Geometry Appl. 19(6): 507-520 (2009)
- [j26]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)
- [c67]Zachary Abel, Brad Ballinger, Prosenjit Bose, Sébastien Collette, Vida Dujmovic, Ferran Hurtado, Scott D. Kominers, Stefan Langerman, Attila Pór, David R. Wood: Every Large Point Set contains Many Collinear Points or an Empty Pentagon. CCCG 2009: 99-102
- [c66]Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara: Algorithmic Folding Complexity. ISAAC 2009: 452-461
- [c65]Frédéric Pluquet, Stefan Langerman, Roel Wuyts: Executing code in the past: efficient in-memory object graph versioning. OOPSLA 2009: 391-408
- [c64]Frédéric Pluquet, Stefan Langerman, Roel Wuyts: Executing code in the past: efficient in-memory object graph versioning. OOPSLA Companion 2009: 771-772
- [c63]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, David Orden, Pedro Ramos: Decomposition of multiple coverings into more parts. SODA 2009: 302-310
- [i17]Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin: Entropy, Triangulation, and Point Location in Planar Subdivisions. CoRR abs/0901.1908 (2009)
- [i16]Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian: Colorful Strips. CoRR abs/0904.2115 (2009)
- [i15]Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman, Joseph O'Rourke: Continuous Blooming of Convex Polyhedra. CoRR abs/0906.2461 (2009)
- [i14]Greg Aloupis, Sébastien Collette, Erik D. Demaine, Stefan Langerman, Vera Sacristan, Stefanie Wuhrer: Reconfiguration of 3D Crystalline Robots Using O(log n) Parallel Moves. CoRR abs/0908.2440 (2009)
- [i13]Greg Aloupis, Jean Cardinal, Sébastien Collette, John Iacono, Stefan Langerman: Detecting all regular polygons in a point set. CoRR abs/0908.2442 (2009)
- 2008
- [j25]
- [j24]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)
- [j23]Jean Cardinal, Sébastien Collette, Stefan Langerman: Local properties of geometric graphs. Comput. Geom. 39(1): 55-64 (2008)
- [j22]Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Belén Palop: Optimal location of transportation devices. Comput. Geom. 41(3): 219-229 (2008)
- [j21]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)
- [j20]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)
- [j19]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)
- [j18]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)
- [c62]Frédéric Pluquet, Stefan Langerman, Antoine Marot, Roel Wuyts: Implementing Partial Persistence in Object-Oriented Languages. ALENEX 2008: 37-48
- [c61]Greg Aloupis, Prosenjit Bose, Vida Dujmovic, Chris Gray, Stefan Langerman, Bettina Speckmann: Triangulating and Guarding Realistic Polygons. CCCG 2008
- [c60]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
- [c59]Prosenjit Bose, Stefan Langerman, Sasanka Roy: Smallest enclosing circle centered on a query line segment. CCCG 2008
- [c58]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
- [c57]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman, Shakhar Smorodinsky: Coloring Geometric Range Spaces. LATIN 2008: 146-157
- [c56]Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin: Distribution-sensitive point location in convex subdivisions. SODA 2008: 912-921
- [c55]Prosenjit Bose, Karim Douïeb, Stefan Langerman: Dynamic optimality for skip lists and B-trees. SODA 2008: 1106-1114
- [c54]Erik D. Demaine, Stefan Langerman, Eric Price: Confluently Persistent Tries for Efficient Version Control. SWAT 2008: 160-172
- [c53]Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Dania El-Khechen, Robin Y. Flatland, Stefan Langerman, Joseph O'Rourke, Val Pinciu, Suneeta Ramaswami, Vera Sacristán Adinolfi, Stefanie Wuhrer: Realistic Reconfiguration of Crystalline (and Telecube) Robots. WAFR 2008: 433-447
- [i12]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)
- [i11]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)
- [i10]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)
- 2007
- [j17]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)
- [j16]Erik D. Demaine, John Iacono, Stefan Langerman: Retroactive data structures. ACM Transactions on Algorithms 3(2) (2007)
- [c52]Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer: A Characterization of the Degree Sequences of 2-trees. ANALCO 2007: 232-241
- [c51]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
- [c50]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
- [c49]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
- [i9]Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Belén Palop: Moving Walkways, Escalators, and Elevators. CoRR abs/0705.0635 (2007)
- [i8]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)
- [i7]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)
- 2006
- [j15]Erik D. Demaine, Stefan Langerman, Joseph O'Rourke: Geometric Restrictions on Producible Polygonal Protein Chains. Algorithmica 44(2): 167-181 (2006)
- [j14]Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez, David Rappaport, Godfried T. Toussaint: Algorithms for Computing Geometric Measures of Melodic Similarity. Computer Music Journal 30(3): 67-76 (2006)
- [j13]Jean Cardinal, Steve Kremer, Stefan Langerman: Juggling with Pattern Matching. Theory Comput. Syst. 39(3): 425-437 (2006)
- [j12]Erik D. Demaine, Martin L. Demaine, Arthur Langerman, Stefan Langerman: Morpion Solitaire. Theory Comput. Syst. 39(3): 439-453 (2006)
- [c48]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
- [c47]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman: LUMINESStrategies. Computers and Games 2006: 190-199
- [c46]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
- [c45]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
- [c44]
- [c43]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
- [c42]Jean Cardinal, Stefan Langerman, Eythan Levy: Improved Approximation Bounds for Edge Dominating Set in Dense Graphs. WAOA 2006: 108-120
- [i6]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)
- [i5]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)
- 2005
- [j11]
- [j10]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)
- [j9]Stefan Langerman, Pat Morin: Covering Things with Things. Discrete & Computational Geometry 33(4): 717-729 (2005)
- [j8]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)
- [j7]Jean Cardinal, Stefan Langerman: Designing small keyboards is hard. Theor. Comput. Sci. 332(1-3): 405-415 (2005)
- [c41]Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara: Small weak epsilon nets. CCCG 2005: 52-56
- [c40]Timothy G. Abbott, Erik D. Demaine, Martin L. Demaine, Daniel M. Kane, Stefan Langerman, Jelani Nelson, Vincent Yeung: Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane. CCCG 2005: 61-64
- [c39]Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura: Reverse facility location problems. CCCG 2005: 68-71
- [c38]Jean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop: Pricing of Geometric Transportation Networks. CCCG 2005: 92-96
- [c37]Jean Cardinal, Sébastien Collette, Stefan Langerman: Region Counting Distances and Region Counting Circles. CCCG 2005: 278-281
- [c36]Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot: A Tight Analysis of the Maximal Matching Heuristic. COCOON 2005: 701-709
- [c35]Erik D. Demaine, Stefan Langerman: Optimizing a 2D Function Satisfying Unimodality Properties. ESA 2005: 887-898
- [c34]
- [i4]
- [i3]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)
- 2004
- [j6]Erik D. Demaine, John Iacono, Stefan Langerman: Proximate point searching. Comput. Geom. 28(1): 29-40 (2004)
- [c33]Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint: Unfolding polyhedral bands. CCCG 2004: 60-63
- [c32]Jean Cardinal, Sébastien Collette, Stefan Langerman: Local properties of geometric graphs. CCCG 2004: 145-148
- [c31]Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin: Geodesic ham-sandwich cuts. Symposium on Computational Geometry 2004: 1-9
- [c30]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
- [c29]
- [c28]Erik D. Demaine, John Iacono, Stefan Langerman: Grid Vertex-Unfolding Orthostacks. JCDCG 2004: 76-82
- [c27]
- [c26]
- [i2]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)
- [i1]Erik D. Demaine, John Iacono, Stefan Langerman: Worst-Case Optimal Tree Layout in a Memory Hierarchy. CoRR cs.DS/0410048 (2004)
- 2003
- [j5]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)
- [j4]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)
- [j3]Stefan Langerman, William L. Steiger: The Complexity of Hyperplane Depth in the Plane. Discrete & Computational Geometry 30(2): 299-309 (2003)
- [j2]Stefan Langerman: On the Complexity of Halfspace Area Queries. Discrete & Computational Geometry 30(4): 639-648 (2003)
- [j1]Prosenjit Bose, Danny Krizanc, Stefan Langerman, Pat Morin: Asymmetric Communication Protocols via Hotlink Assignments. Theory Comput. Syst. 36(6): 655-661 (2003)
- [c25]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
- [c24]Erik D. Demaine, Jeff Erickson, Stefan Langerman: On the Complexity of Halfspace Volume Queries. CCCG 2003: 159-160
- [c23]John Iacono, Stefan Langerman: Proximate planar point location. Symposium on Computational Geometry 2003: 220-226
- [c22]Erik D. Demaine, Stefan Langerman, Joseph O'Rourke: Geometric Restrictions on Producible Polygonal Protein Chains. ISAAC 2003: 395-404
- [c21]
- [c20]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
- 2002
- [c19]
- [c18]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
- [c17]Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink: Interlocked open linkages with few joints. Symposium on Computational Geometry 2002: 189-198
- [c16]
- [c15]
- [c14]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
- [c13]Mordecai J. Golin, Stefan Langerman, William L. Steiger: The Convex Hull for Random Lines in the Plane. JCDCG 2002: 172-175
- [c12]Prosenjit Bose, Danny Krizanc, Stefan Langerman, Pat Morin: Asymmetric Communication Protocols via Hotlink Assignments. SIROCCO 2002: 33-39
- [c11]Stefan Langerman, Pat Morin, Michael A. Soss: Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles. STACS 2002: 250-261
- 2001
- [c10]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
- [c9]
- [c8]Stefan Langerman: On the complexity of halfspace area queries. Symposium on Computational Geometry 2001: 207-211
- [c7]Stefan Langerman, Sachin Lodha, Rahul Shah: Algorithms for Efficient Filtering in Content-Based Multicast. ESA 2001: 428-439
- 2000
- [c6]John Iacono, Stefan Langerman: Dynamic point location in fat hyperrectangles with integer coordinates. CCCG 2000
- [c5]
- [c4]
- [c3]Stefan Langerman, William L. Steiger: An optimal algorithm for hyperplane depth in the plane. SODA 2000: 54-59
1990 – 1999
- 1996
- [c2]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
- [c1]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
Coauthor Index
[j58] [i28] [i23] [j49] [j46] [j45] [j44] [j43] [j42] [j39] [j36] [c72] [c69] [c68] [j33] [j31] [j30] [c66] [i15] [i14] [j24] [c58] [c54] [c53] [i12] [j17] [j16] [c51] [c50] [c49] [i7] [j15] [j12] [c48] [c46] [c45] [c43] [i6] [j10] [j8] [c40] [c35] [i3] [j6] [c33] [c31] [c30] [c28] [c26] [i1] [j5] [c24] [c22] [c20] [c19] [c18] [c17] [c14] [c9]
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-06-06 20:13 CEST by the dblp team