![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/img/search.dark.16x16.png)
default search action
Stefan Langerman
Person information
- affiliation: Université Libre de Bruxelles, Belgium
Refine list
![note](https://dblp.org/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j98]Prosenjit Bose
, Jean Cardinal
, John Iacono
, Grigorios Koumoutsos
, Stefan Langerman
:
Competitive Online Search Trees on Trees. ACM Trans. Algorithms 19(3): 25:1-25:19 (2023) - 2022
- [j97]Prosenjit Bose, Pilar Cano
, Rolf Fagerberg
, John Iacono, Riko Jacob
, Stefan Langerman:
Fragile complexity of adaptive algorithms. Theor. Comput. Sci. 919: 92-102 (2022) - [c113]Akira Baes, Erik D. Demaine, Martin L. Demaine, Elizabeth Hartung, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno, Aaron Williams:
Rolling Polyhedra on Tessellations. FUN 2022: 6:1-6:16 - 2021
- [j96]Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Belga B-Trees. Theory Comput. Syst. 65(3): 541-558 (2021) - [c112]Prosenjit Bose, Pilar Cano
, Rolf Fagerberg
, John Iacono
, Riko Jacob
, Stefan Langerman
:
Fragile Complexity of Adaptive Algorithms. CIAC 2021: 144-157 - [i62]Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman:
Fragile Complexity of Adaptive Algorithms. CoRR abs/2102.00338 (2021) - [i61]Stefan Langerman, Nicolas Potvin, Boris Zolotov:
Enumerating All Convex Polyhedra Glued from Squares in Polynomial Time. CoRR abs/2104.06787 (2021) - 2020
- [j95]Prosenjit Bose, Irina Kostitsyna, Stefan Langerman:
Self-approaching paths in simple polygons. Comput. Geom. 87: 101595 (2020) - [j94]Jin Akiyama, Erik D. Demaine, Stefan Langerman
:
Polyhedral Characterization of Reversible Hinged Dissections. Graphs Comb. 36(2): 221-229 (2020) - [j93]Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao
:
Cookie Clicker. Graphs Comb. 36(2): 269-302 (2020) - [j92]Elena Arseneva, Stefan Langerman:
Which Convex Polyhedra Can Be Made by Gluing Regular Hexagons? Graphs Comb. 36(2): 339-345 (2020) - [j91]Elena Arseneva, John Iacono, Grigorios Koumoutsos, Stefan Langerman, Boris Zolotov:
Sublinear Explicit Incremental Planar Voronoi Diagrams. J. Inf. Process. 28: 766-774 (2020) - [j90]Elena Arseneva, Stefan Langerman, Boris Zolotov:
A Complete List of All Convex Polyhedra Made by Gluing Regular Pentagons. J. Inf. Process. 28: 791-799 (2020) - [c111]Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Competitive Online Search Trees on Trees. SODA 2020: 1878-1891 - [i60]Elena Arseneva, Stefan Langerman:
Which convex polyhedra can be made by gluing regular hexagons? CoRR abs/2002.02052 (2020) - [i59]Elena Arseneva, John Iacono, Grigorios Koumoutsos, Stefan Langerman, Boris Zolotov:
Sublinear Explicit Incremental Planar Voronoi Diagrams. CoRR abs/2007.01686 (2020) - [i58]Elena Arseneva, Stefan Langerman, Boris Zolotov:
A Complete List of All Convex Polyhedra Made by Gluing Regular Pentagons. CoRR abs/2007.01753 (2020)
2010 – 2019
- 2019
- [j89]Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen
, Marcel Roeloffzen, Sander Verdonschot:
Dynamic Graph Coloring. Algorithmica 81(4): 1319-1341 (2019) - [j88]Greg Aloupis, Paz Carmi, Lilach Chaitman-Yerushalmi, Matthew J. Katz, Stefan Langerman:
Bottleneck detour tree of points on a path. Comput. Geom. 79: 30-36 (2019) - [j87]Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms
, Noam Solomon:
Subquadratic Algorithms for Algebraic 3SUM. Discret. Comput. Geom. 61(4): 698-734 (2019) - [j86]Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati
, Stefan Langerman, Alessandra Tappini
:
Pole Dancing: 3D Morphs for Tree Drawings. J. Graph Algorithms Appl. 23(3): 579-602 (2019) - [j85]Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms:
Subquadratic encodings for point configurations. J. Comput. Geom. 10(2): 99-126 (2019) - [c110]Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Belga B-Trees. CSR 2019: 93-105 - [i57]Sergio Cabello, Jean Cardinal, John Iacono, Stefan Langerman, Pat Morin, Aurélien Ooms:
Encoding 3SUM. CoRR abs/1903.02645 (2019) - [i56]Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Belga B-trees. CoRR abs/1903.03560 (2019) - [i55]Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman:
Competitive Online Search Trees on Trees. CoRR abs/1908.00848 (2019) - 2018
- [j84]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. Algorithmica 80(11): 3316-3334 (2018) - [j83]Jean Cardinal, Stefan Langerman
, Pablo Pérez-Lantero:
On the Diameter of Tree Associahedra. Electron. J. Comb. 25(4): 4 (2018) - [j82]Matias Korman, Stefan Langerman, Wolfgang Mulzer, Alexander Pilz, Maria Saumell
, Birgit Vogtenhuber:
The dual diameter of triangulations. Comput. Geom. 68: 243-252 (2018) - [j81]Stefan Langerman
, Yushi Uno:
Threes!, Fives, 1024!, and 2048 are hard. Theor. Comput. Sci. 748: 17-27 (2018) - [c109]Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms:
Subquadratic Encodings for Point Configurations. SoCG 2018: 20:1-20:14 - [c108]Irina Kostitsyna
, Bahram Kouhestani, Stefan Langerman, David Rappaport:
An Optimal Algorithm to Compute the Inverse Beacon Attraction Region. SoCG 2018: 55:1-55:14 - [c107]Mordecai J. Golin
, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich
:
Dynamic Trees with Almost-Optimal Access Cost. ESA 2018: 38:1-38:14 - [c106]Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati
, Stefan Langerman, Alessandra Tappini
:
Pole Dancing: 3D Morphs for Tree Drawings. GD 2018: 371-384 - [c105]Hugo A. Akitaya, Brad Ballinger, Mirela Damian, Erik D. Demaine, Martin L. Demaine, Robin Y. Flatland, Irina Kostitsyna, Jason S. Ku, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara:
Toward Unfolding Doubly Covered n-Stars. JCDCGGG 2018: 122-135 - [i54]Jean Cardinal, Timothy M. Chan, John Iacono
, Stefan Langerman, Aurélien Ooms:
Subquadratic Encodings for Point Configurations. CoRR abs/1801.01767 (2018) - [i53]Jin Akiyama, Erik D. Demaine, Stefan Langerman:
Polyhedral Characterization of Reversible Hinged Dissections. CoRR abs/1803.01172 (2018) - [i52]Irina Kostitsyna, Bahram Kouhestani, Stefan Langerman, David Rappaport:
An Optimal Algorithm to Compute the Inverse Beacon Attraction Region. CoRR abs/1803.05946 (2018) - [i51]Jean Cardinal, Stefan Langerman, Pablo Pérez-Lantero:
On the Diameter of Tree Associahedra. CoRR abs/1803.11427 (2018) - [i50]Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich:
Dynamic Trees with Almost-Optimal Access Cost. CoRR abs/1806.10498 (2018) - [i49]Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao:
Cookie Clicker. CoRR abs/1808.07540 (2018) - [i48]Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati, Stefan Langerman, Alessandra Tappini:
Pole Dancing: 3D Morphs for Tree Drawings. CoRR abs/1808.10738 (2018) - [i47]John Iacono, Stefan Langerman:
Weighted dynamic finger in binary search trees. CoRR abs/1810.01785 (2018) - 2017
- [j80]Martin Balko, Jan Kyncl, Stefan Langerman, Alexander Pilz:
Induced Ramsey-Type Results and Binary Predicates for Point Sets. Electron. J. Comb. 24(4): 4 (2017) - [j79]Sarah R. Allen, Luis Barba, John Iacono
, Stefan Langerman:
Incremental Voronoi Diagrams. Discret. Comput. Geom. 58(4): 822-848 (2017) - [j78]Martin Balko
, Jan Kyncl
, Stefan Langerman, Alexander Pilz:
Induced Ramsey-type results and binary predicates for point sets. Electron. Notes Discret. Math. 61: 77-83 (2017) - [c104]Stefan Langerman:
Tilers, Tilemakers, Transformers! CCCG 2017: 197 - [c103]Luis Barba, Jean Cardinal, John Iacono
, Stefan Langerman, Aurélien Ooms, Noam Solomon:
Subquadratic Algorithms for Algebraic Generalizations of 3SUM. SoCG 2017: 13:1-13:15 - [c102]Prosenjit Bose
, Irina Kostitsyna
, Stefan Langerman:
Self-Approaching Paths in Simple Polygons. SoCG 2017: 21:1-21:15 - [c101]Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen
, Marcel Roeloffzen, Sander Verdonschot:
Dynamic Graph Coloring. WADS 2017: 97-108 - [c100]John Iacono
, Elena Khramtcova, Stefan Langerman:
Searching Edges in the Overlap of Two Plane Graphs. WADS 2017: 473-484 - [i46]John Iacono
, Elena Khramtcova, Stefan Langerman:
Searching edges in the overlap of two plane graphs. CoRR abs/1701.02229 (2017) - [i45]Prosenjit Bose, Irina Kostitsyna, Stefan Langerman:
Self-approaching paths in simple polygons. CoRR abs/1703.06107 (2017) - [i44]Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman:
Helly Numbers of Polyominoes. CoRR abs/1708.06063 (2017) - [i43]Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot:
Dynamic Graph Coloring. CoRR abs/1708.09080 (2017) - 2016
- [j77]Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou
:
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters. Algorithmica 76(4): 935-960 (2016) - [j76]Prosenjit Bose
, Karim Douïeb, John Iacono
, Stefan Langerman:
The Power and Limitations of Static Binary Search Trees with Lazy Finger. Algorithmica 76(4): 1264-1275 (2016) - [j75]Oswin Aichholzer
, Jean Cardinal, Vincent Kusters, Stefan Langerman, Pavel Valtr:
Reconstructing Point Set Order Types from Radial Orderings. Int. J. Comput. Geom. Appl. 26(3-4): 167-184 (2016) - [j74]Sergey Bereg
, José Miguel Díaz-Báñez
, David Flores-Peñaloza, Stefan Langerman
, Pablo Pérez-Lantero, Jorge Urrutia:
Optimizing some constructions with bars: new geometric knapsack problems. J. Comb. Optim. 31(3): 1160-1173 (2016) - [c99]Sarah R. Allen, Luis Barba, John Iacono
, Stefan Langerman:
Incremental Voronoi diagrams. SoCG 2016: 15:1-15:16 - [c98]Stefan Langerman, Andrew Winslow:
A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino. SoCG 2016: 50:1-50:15 - [c97]Stefan Langerman, Yushi Uno:
Threes!, Fives, 1024!, and 2048 are Hard. FUN 2016: 22:1-22:14 - [c96]John Iacono
, Stefan Langerman:
Weighted dynamic finger in binary search trees. SODA 2016: 672-691 - [i42]Sarah R. Allen, Luis Barba, John Iacono
, Stefan Langerman:
Incremental Voronoi Diagrams. CoRR abs/1603.08485 (2016) - [i41]Jin Akiyama, Stefan Langerman, Kiyoko Matsunaga:
Reversible Nets of Polyhedra. CoRR abs/1607.00538 (2016) - [i40]Luis Barba, Jean Cardinal, John Iacono
, Stefan Langerman, Aurélien Ooms, Noam Solomon:
Subquadratic Algorithms for Algebraic Generalizations of 3SUM. CoRR abs/1612.02384 (2016) - 2015
- [j73]Erik D. Demaine, John Iacono
, Stefan Langerman
:
Worst-Case Optimal Tree Layout in External Memory. Algorithmica 72(2): 369-378 (2015) - [j72]Luis Barba, Matias Korman, Stefan Langerman
, Kunihiko Sadakane
, Rodrigo I. Silveira
:
Space-Time Trade-offs for Stack-Based Algorithms. Algorithmica 72(4): 1097-1129 (2015) - [j71]Greg Aloupis, Luis Barba, Stefan Langerman
, Diane L. Souvaine:
Bichromatic compatible matchings. Comput. Geom. 48(8): 622-633 (2015) - [j70]Greg Aloupis, Luis Barba, Jean-Lou De Carufel, Stefan Langerman
, Diane L. Souvaine:
Isoperimetric Enclosures. Graphs Comb. 31(2): 361-392 (2015) - [j69]Jean Cardinal, Sébastien Collette, Hiro Ito, Matias Korman, Stefan Langerman
, Hikaru Sakaidani, Perouz Taslakian:
Cannibal Animal Games: a new variant of Tic-Tac-Toe. J. Inf. Process. 23(3): 265-271 (2015) - [j68]Hiro Ito, Stefan Langerman
, Yuichi Yoshida:
Generalized River Crossing Problems. Theory Comput. Syst. 56(2): 418-435 (2015) - [c95]Jin Akiyama, Stefan Langerman, Kiyoko Matsunaga:
Reversible Nets of Polyhedra. JCDCGG 2015: 13-23 - [c94]Erik D. Demaine, Stefan Langerman:
Bust-a-Move/Puzzle Bobble Is NP-complete. JCDCGG 2015: 94-104 - [c93]Luis Barba, Stefan Langerman:
Optimal detection of intersections between convex polyhedra. SODA 2015: 1641-1654 - [i39]Matias Korman, Stefan Langerman, Wolfgang Mulzer, Alexander Pilz, Maria Saumell, Birgit Vogtenhuber:
The Dual Diameter of Triangulations. CoRR abs/1503.08518 (2015) - [i38]Stefan Langerman, Yushi Uno:
Threes!, Fives, 1024!, and 2048 are Hard. CoRR abs/1505.04274 (2015) - [i37]Erik D. Demaine, Stefan Langerman:
Bust-a-Move/Puzzle Bobble is NP-Complete. CoRR abs/1506.08409 (2015) - [i36]Stefan Langerman, Andrew Winslow:
A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino. CoRR abs/1507.02762 (2015) - 2014
- [j67]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. Algorithmica 69(2): 294-314 (2014) - [j66]Greg Aloupis, Prosenjit Bose
, Vida Dujmovic, Chris Gray, Stefan Langerman
, Bettina Speckmann
:
Triangulating and guarding realistic polygons. Comput. Geom. 47(2): 296-306 (2014) - [j65]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. Comput. Geom. 47(2): 316-328 (2014) - [j64]Luis Barba, Matias Korman, Stefan Langerman
, Rodrigo I. Silveira
:
Computing a visibility polygon using few variables. Comput. Geom. 47(9): 918-926 (2014) - [j63]Yuya Higashikawa, Naoki Katoh, Stefan Langerman
, Shin-ichi Tanigawa:
Online graph exploration algorithms for cycles and trees by multiple searchers. J. Comb. Optim. 28(2): 480-495 (2014) - [c92]Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman
, Pavel Valtr:
Reconstructing Point Set Order Typesfrom Radial Orderings. ISAAC 2014: 15-26 - [c91]Prosenjit Bose
, Karim Douïeb, John Iacono
, Stefan Langerman
:
The Power and Limitations of Static Binary Search Trees with Lazy Finger. ISAAC 2014: 181-192 - [c90]Luis Barba, Prosenjit Bose
, Stefan Langerman
:
Optimal Algorithms for Constrained 1-Center Problems. LATIN 2014: 84-95 - [c89]Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman
, Evanthia Papadopoulou
:
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters. LATIN 2014: 96-107 - [c88]Greg Aloupis, John Iacono
, Stefan Langerman, Özgür Özkan, Stefanie Wuhrer:
The Complexity of Order Type Isomorphism. SODA 2014: 405-415 - 2013
- [j62]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) - [j61]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) - [j60]Prosenjit Bose
, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman
, Vera Sacristán
, Maria Saumell
:
Some properties of k-Delaunay and k-Gabriel graphs. Comput. Geom. 46(2): 131-139 (2013) - [j59]Dan Chen, Olivier Devillers
, John Iacono, Stefan Langerman
, Pat Morin
:
Oja centers and centers of gravity. Comput. Geom. 46(2): 140-147 (2013) - [j58]Sébastien Collette, Stefan Langerman
:
Editorial. Comput. Geom. 46(7): 817 (2013) - [j57]Vida Dujmovic, Stefan Langerman
:
A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing. Discret. Comput. Geom. 49(1): 74-88 (2013) - [j56]Sergio Cabello
, Jean Cardinal, Stefan Langerman
:
The Clique Problem in Ray Intersection Graphs. Discret. Comput. Geom. 50(3): 771-783 (2013) - [j55]Prosenjit Bose
, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman
, Perouz Taslakian:
Coloring and Guarding Arrangements. Discret. Math. Theor. Comput. Sci. 15(3): 139-154 (2013) - [j54]Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman
:
Helly Numbers of Polyominoes. Graphs Comb. 29(5): 1221-1234 (2013) - [c87]Greg Aloupis, Luis Barba, Stefan Langerman, Diane L. Souvaine:
Bichromatic compatible matchings. SoCG 2013: 267-276 - [c86]Erik D. Demaine, John Iacono
, Stefan Langerman
, Özgür Özkan:
Combining Binary Search Trees. ICALP (1) 2013: 388-399 - [c85]Luis Barba, Matias Korman, Stefan Langerman
, Rodrigo I. Silveira
, Kunihiko Sadakane
:
Space-Time Trade-offs for Stack-Based Algorithms. STACS 2013: 281-292 - [c84]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. WADS 2013: 73-84 - [i35]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) - [i34]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) - [i33]Erik D. Demaine, John Iacono
, Stefan Langerman, Özgür Özkan:
Combining Binary Search Trees. CoRR abs/1304.7604 (2013) - [i32]Jean Cardinal, Sébastien Collette, Hiro Ito, Matias Korman, Stefan Langerman, Hikaru Sakaidani, Perouz Taslakian:
Cannibal Animal Games: a new variant of Tic-Tac-Toe. CoRR abs/1306.4884 (2013) - [i31]Greg Aloupis, John Iacono
, Stefan Langerman, Özgür Özkan:
The Complexity of Order Type Isomorphism. CoRR abs/1311.0928 (2013) - [i30]Luis Barba, Stefan Langerman:
Detecting intersections between convex polyhedra. CoRR abs/1312.1001 (2013) - [i29]Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou:
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters. CoRR abs/1312.3904 (2013) - 2012
- [j53]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. Geom. Appl. 22(5): 439-470 (2012) - [j52]Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel H. M. Smid:
Approximating the average stretch factor of geometric graphs. J. Comput. Geom. 3(1): 132-153 (2012) - [j51]Sébastien Collette, Vida Dujmovic, John Iacono
, Stefan Langerman
, Pat Morin
:
Entropy, triangulation, and point location in planar subdivisions. ACM Trans. Algorithms 8(3): 29:1-29:18 (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 - [i28]Greg Aloupis, Luis Barba, Stefan Langerman:
Circle separability queries in logarithmic time. CoRR abs/1203.6266 (2012) - [i27]Prosenjit Bose, Jean Cardinal, Sébastien Collette, Ferran Hurtado, Matias Korman, Stefan Langerman, Perouz Taslakian:
Coloring and Guarding Arrangements. CoRR abs/1205.5162 (2012) - [i26]Greg Aloupis, Luis Barba, Stefan Langerman, Diane L. Souvaine:
Bichromatic compatible matchings. CoRR abs/1207.2375 (2012) - [i25]Luis Barba, Matias Korman, Stefan Langerman, Kunihiko Sadakane, Rodrigo I. Silveira:
Space-Time Trade-offs for Stack-Based Algorithms. CoRR abs/1208.3663 (2012) - [i24]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
- [j50]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) - [j49]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 Comb. 27(1): 47-60 (2011) - [j48]Greg Aloupis, Jean Cardinal, Sébastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman
, Oded Schwartz, Shakhar Smorodinsky
, Perouz Taslakian:
Colorful Strips. Graphs Comb. 27(3): 327-339 (2011) - [j47]Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Tsuyoshi Ito, Masashi Kiyomi
, Stefan Langerman
, Ryuhei Uehara
, Takeaki Uno:
Algorithmic Folding Complexity. Graphs Comb. 27(3): 341-351 (2011) - [j46]Erik D. Demaine, Martin L. Demaine, Vi Hart, John Iacono, Stefan Langerman
, Joseph O'Rourke:
Continuous Blooming of Convex Polyhedra. Graphs Comb. 27(3): 363-376 (2011) - [j45]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. Geom. Appl. 21(1): 87-100 (2011) - [j44]Greg Aloupis, Sébastien Collette, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Stefan Langerman
, Joseph O'Rourke, Val Pinciu, Suneeta Ramaswami, Vera Sacristán
, Stefanie Wuhrer:
Efficient constant-velocity reconfiguration of crystalline robots. Robotica 29(1): 59-71 (2011) - [c78]Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman:
Helly Numbers of Polyominoes. CCCG 2011 - [c77]Vida Dujmovic, Stefan Langerman
:
A center transversal theorem for hyperplanes and applications to graph drawing. SCG 2011: 117-124 - [c76]Luis Barba, Matias Korman, Stefan Langerman
, Rodrigo I. Silveira
:
Computing the Visibility Polygon Using Few Variables. ISAAC 2011: 70-79 - [i23]Sébastien Collette, John Iacono
, Stefan Langerman:
Confluent Persistence Revisited. CoRR abs/1104.3045 (2011) - [i22]Prosenjit Bose, Sébastien Collette, Rolf Fagerberg, Stefan Langerman:
De-amortizing Binary Search Trees. CoRR abs/1111.1665 (2011) - [i21]Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira:
Computing a visibility polygon using few variables. CoRR abs/1111.3584 (2011) - [i20]Sergio Cabello, Jean Cardinal, Stefan Langerman:
The Clique Problem in Ray Intersection Graphs. CoRR abs/1111.5986 (2011) - 2010
- [j43]Erik D. Demaine, Stefan Langerman
, Eric Price:
Confluently Persistent Tries for Efficient Version Control. Algorithmica 57(3): 462-483 (2010) - [j42]Karim Douïeb, Stefan Langerman
:
Near-Entropy Hotlink Assignments. Algorithmica 58(2): 221-244 (2010) - [j41]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) - [j40]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. Discret. Comput. Geom. 44(2): 439-462 (2010) - [j39]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman
, David Orden
, Pedro Ramos
:
Decomposition of Multiple Coverings into More Parts. Discret. Comput. Geom. 44(3): 706-723 (2010) - [j38]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. Eur. J. Oper. Res. 202(1): 99-106 (2010) - [j37]Erik D. Demaine, John Iacono
, Stefan Langerman
:
Grid Vertex-Unfolding Orthostacks. Int. J. Comput. Geom. Appl. 20(3): 245-254 (2010) - [j36]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 Sacristán, 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 - [i19]Vida Dujmovic, Stefan Langerman:
A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing. CoRR abs/1012.0548 (2010)
2000 – 2009
- 2009
- [j35]Jean Cardinal, Sébastien Collette, Stefan Langerman
:
Empty region graphs. Comput. Geom. 42(3): 183-195 (2009) - [j34]Timothy G. Abbott, Michael A. Burr
, Timothy M. Chan, Erik D. Demaine, Martin L. Demaine, John Hugg, Daniel 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) - [j33]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) - [j32]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) - [j31]Erik D. Demaine, Martin L. Demaine, John Iacono, Stefan Langerman
:
Wrapping spheres with flat paper. Comput. Geom. 42(8): 748-757 (2009) - [j30]Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman
, Shakhar Smorodinsky
:
Coloring Geometric Range Spaces. Discret. Comput. Geom. 41(2): 348-362 (2009) - [j29]Prosenjit Bose
, Vida Dujmovic, Ferran Hurtado, Stefan Langerman
, Pat Morin
, David R. Wood
:
A Polynomial Bound for Untangling Geometric Planar Graphs. Discret. Comput. Geom. 42(4): 570-585 (2009) - [j28]Jean Cardinal, Martine Labbé
, Stefan Langerman
, Belén Palop
:
Pricing Geometric Transportation Networks. Int. J. Comput. Geom. Appl. 19(6): 507-520 (2009) - [j27]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 Duke 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 - [i18]Sébastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin:
Entropy, Triangulation, and Point Location in Planar Subdivisions. CoRR abs/0901.1908 (2009) - [i17]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. CoRR abs/0904.0262 (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 Sacristán, 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
- [j26]Karim Douïeb, Stefan Langerman
:
Dynamic Hotlinks. Algorithmica 50(2): 208-222 (2008) - [j25]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) - [j24]Jean Cardinal, Sébastien Collette, Stefan Langerman
:
Local properties of geometric graphs. Comput. Geom. 39(1): 55-64 (2008) - [j23]Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman
, Belén Palop
:
Optimal location of transportation devices. Comput. Geom. 41(3): 219-229 (2008) - [j22]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. Discret. Comput. Geom. 39(1-3): 17-37 (2008) - [j21]Prosenjit Bose
, Vida Dujmovic, Ferran Hurtado, Pat Morin
, Stefan Langerman
, David R. Wood
:
A Polynomial Bound for Untangling Geometric Planar Graphs. Electron. Notes Discret. Math. 31: 213-218 (2008) - [j20]Prosenjit Bose
, Vida Dujmovic, Danny Krizanc, Stefan Langerman
, Pat Morin
, David R. Wood
, Stefanie Wuhrer:
A Characterization of the degree sequences of 2-trees. J. Graph Theory 58(3): 191-209 (2008) - [j19]David Bremner, Dan Chen, John Iacono, Stefan Langerman
, Pat Morin
:
Output-sensitive algorithms for Tukey depth and related problems. Stat. Comput. 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
- [j18]Prosenjit Bose
, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman
, Pat Morin
:
Geodesic Ham-Sandwich Cuts. Discret. Comput. Geom. 37(3): 325-339 (2007) - [j17]Justin Colannino, Mirela Damian, Ferran Hurtado, Stefan Langerman
, Henk Meijer, Suneeta Ramaswami, Diane L. Souvaine, Godfried Toussaint:
Efficient Many-To-Many Point Matching in One Dimension. Graphs Comb. 23(Supplement-1): 169-178 (2007) - [j16]Erik D. Demaine, John Iacono, Stefan Langerman
:
Retroactive data structures. ACM Trans. Algorithms 3(2): 13 (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. Comput. Music. J. 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. SCG 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]Karim Douïeb, Stefan Langerman:
Near-Entropy Hotlink Assignments. ESA 2006: 292-303 - [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]John Iacono, Stefan Langerman
:
Queaps. Algorithmica 42(1): 49-56 (2005) - [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. Discret. Comput. Geom. 33(4): 593-604 (2005) - [j9]Stefan Langerman
, Pat Morin
:
Covering Things with Things. Discret. Comput. Geom. 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. Geom. 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 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]Karim Douïeb, Stefan Langerman:
Dynamic Hotlinks. WADS 2005: 182-194 - [i4]Jean Cardinal, Sébastien Collette, Stefan Langerman:
Region counting graphs. EuroCG 2005: 21-24 - [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. SCG 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. SCG 2004: 10-16 - [c29]Prosenjit Bose
, Stefan Langerman
:
Weighted Ham-Sandwich Cuts. JCDCG 2004: 48-53 - [c28]Erik D. Demaine, John Iacono, Stefan Langerman
:
Grid Vertex-Unfolding Orthostacks. JCDCG 2004: 76-82 - [c27]Jean Cardinal, Stefan Langerman:
Designing Small Keyboards Is Hard. LATIN 2004: 391-400 - [c26]Erik D. Demaine, John Iacono, Stefan Langerman:
Retroactive data structures. SODA 2004: 281-290 - [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. Discret. Comput. Geom. 30(2): 299-309 (2003) - [j2]Stefan Langerman
:
On the Complexity of Halfspace Area Queries. Discret. Comput. Geom. 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, Yurai Núñez Rodríguez, 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. SCG 2003: 220-226 - [c22]Erik D. Demaine, Stefan Langerman, Joseph O'Rourke:
Geometric Restrictions on Producible Polygonal Protein Chains. ISAAC 2003: 395-404 - [c21]Stefan Langerman, William L. Steiger:
Optimization in Arrangements. STACS 2003: 50-61 - [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]Erik D. Demaine, John Iacono, Stefan Langerman:
Proximate point searching. CCCG 2002: 1-4 - [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. SCG 2002: 189-198 - [c16]Stefan Langerman, Pat Morin
:
Covering Things with Things. ESA 2002: 662-673 - [c15]John Iacono, Stefan Langerman
:
Queaps. ISAAC 2002: 211-218 - [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]Erik D. Demaine, Stefan Langerman, Joseph O'Rourke:
Short interlocked linkages. CCCG 2001: 69-72 - [c8]Stefan Langerman:
On the complexity of halfspace area queries. SCG 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]Stefan Langerman:
On the Shooter Location Problem. CCCG 2000 - [c4]John Iacono, Stefan Langerman:
Volume Queries in Polyhedra. JCDCG 2000: 156-159 - [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
aka: Elena Khramtcova
aka: Luis Felipe Barba Flores
aka: Godfried Toussaint
![](https://dblp.org/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-03 20:42 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint