Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Langerman
Person information
- affiliation: Université Libre de Bruxelles, Belgium
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
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]