Stefan Langerman

ORCID

Publication Activity (10 Years)

Years Active: 1994-2023
Publications (10 Years): 79

Top Venues

Publications

Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
Competitive Online Search Trees on Trees. ACM Trans. Algorithms 19 (3) (2023)
Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
Fragile complexity of adaptive algorithms. Theor. Comput. Sci. 919 (2022)
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)
Stefan Langerman, Nicolas Potvin, Boris Zolotov
Enumerating All Convex Polyhedra Glued from Squares in Polynomial Time. CoRR (2021)
Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
Fragile Complexity of Adaptive Algorithms. CoRR (2021)
Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman
Belga B-Trees. Theory Comput. Syst. 65 (3) (2021)
Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman
Fragile Complexity of Adaptive Algorithms. CIAC (2021)
Elena Arseneva, Stefan Langerman
Which convex polyhedra can be made by gluing regular hexagons? CoRR (2020)
Prosenjit Bose, Irina Kostitsyna, Stefan Langerman
Self-approaching paths in simple polygons. Comput. Geom. 87 (2020)
Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao
Cookie Clicker. Graphs Comb. 36 (2) (2020)
Elena Arseneva, John Iacono, Grigorios Koumoutsos, Stefan Langerman, Boris Zolotov
Sublinear Explicit Incremental Planar Voronoi Diagrams. CoRR (2020)
Elena Arseneva, John Iacono, Grigorios Koumoutsos, Stefan Langerman, Boris Zolotov
Sublinear Explicit Incremental Planar Voronoi Diagrams. J. Inf. Process. 28 (2020)
Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
Competitive Online Search Trees on Trees. SODA (2020)
Jin Akiyama, Erik D. Demaine, Stefan Langerman
Polyhedral Characterization of Reversible Hinged Dissections. Graphs Comb. 36 (2) (2020)
Elena Arseneva, Stefan Langerman, Boris Zolotov
A Complete List of All Convex Polyhedra Made by Gluing Regular Pentagons. CoRR (2020)
Elena Arseneva, Stefan Langerman
Which Convex Polyhedra Can Be Made by Gluing Regular Hexagons? Graphs Comb. 36 (2) (2020)
Elena Arseneva, Stefan Langerman, Boris Zolotov
A Complete List of All Convex Polyhedra Made by Gluing Regular Pentagons. J. Inf. Process. 28 (2020)
Sergio Cabello, Jean Cardinal, John Iacono, Stefan Langerman, Pat Morin, Aurélien Ooms
Encoding 3SUM. CoRR (2019)
Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman
Competitive Online Search Trees on Trees. CoRR (2019)
Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman
Belga B-Trees. CSR (2019)
Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot
Dynamic Graph Coloring. Algorithmica 81 (4) (2019)
Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman
Belga B-trees. CoRR (2019)
Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms
Subquadratic encodings for point configurations. J. Comput. Geom. 10 (2) (2019)
Greg Aloupis, Paz Carmi, Lilach Chaitman-Yerushalmi, Matthew J. Katz, Stefan Langerman
Bottleneck detour tree of points on a path. Comput. Geom. 79 (2019)
Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon
Subquadratic Algorithms for Algebraic 3SUM. Discret. Comput. Geom. 61 (4) (2019)
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) (2019)
Jean Cardinal, Stefan Langerman, Pablo Pérez-Lantero
On the Diameter of Tree Associahedra. CoRR (2018)
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) (2018)
Jin Akiyama, Erik D. Demaine, Stefan Langerman
Polyhedral Characterization of Reversible Hinged Dissections. CoRR (2018)
Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich
Dynamic Trees with Almost-Optimal Access Cost. CoRR (2018)
John Iacono, Stefan Langerman
Weighted dynamic finger in binary search trees. CoRR (2018)
Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati, Stefan Langerman, Alessandra Tappini
Pole Dancing: 3D Morphs for Tree Drawings. Graph Drawing (2018)
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)
Jean Cardinal, Stefan Langerman, Pablo Pérez-Lantero
On the Diameter of Tree Associahedra. Electron. J. Comb. 25 (4) (2018)
Irina Kostitsyna, Bahram Kouhestani, Stefan Langerman, David Rappaport
An Optimal Algorithm to Compute the Inverse Beacon Attraction Region. CoRR (2018)
Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich
Dynamic Trees with Almost-Optimal Access Cost. ESA (2018)
Irina Kostitsyna, Bahram Kouhestani, Stefan Langerman, David Rappaport
An Optimal Algorithm to Compute the Inverse Beacon Attraction Region. SoCG (2018)
Matias Korman, Stefan Langerman, Wolfgang Mulzer, Alexander Pilz, Maria Saumell, Birgit Vogtenhuber
The dual diameter of triangulations. Comput. Geom. 68 (2018)
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 (2018)
Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms
Subquadratic Encodings for Point Configurations. CoRR (2018)
Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, Aurélien Ooms
Subquadratic Encodings for Point Configurations. SoCG (2018)
Erik D. Demaine, Hiro Ito, Stefan Langerman, Jayson Lynch, Mikhail Rudoy, Kai Xiao
Cookie Clicker. CoRR (2018)
Stefan Langerman, Yushi Uno
Threes!, Fives, 1024!, and 2048 are hard. Theor. Comput. Sci. 748 (2018)
John Iacono, Elena Khramtcova, Stefan Langerman
Searching Edges in the Overlap of Two Plane Graphs. WADS (2017)
Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot
Dynamic Graph Coloring. WADS (2017)
Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman
Incremental Voronoi Diagrams. Discret. Comput. Geom. 58 (4) (2017)
Martin Balko, Jan Kyncl, Stefan Langerman, Alexander Pilz
Induced Ramsey-type results and binary predicates for point sets. Electron. Notes Discret. Math. 61 (2017)
Prosenjit Bose, Irina Kostitsyna, Stefan Langerman
Self-approaching paths in simple polygons. CoRR (2017)
John Iacono, Elena Khramtcova, Stefan Langerman
Searching edges in the overlap of two plane graphs. CoRR (2017)
Prosenjit Bose, Irina Kostitsyna, Stefan Langerman
Self-Approaching Paths in Simple Polygons. SoCG (2017)
Jean Cardinal, Hiro Ito, Matias Korman, Stefan Langerman
Helly Numbers of Polyominoes. CoRR (2017)
Martin Balko, Jan Kyncl, Stefan Langerman, Alexander Pilz
Induced Ramsey-Type Results and Binary Predicates for Point Sets. Electron. J. Comb. 24 (4) (2017)
Stefan Langerman
Tilers, Tilemakers, Transformers! CCCG (2017)
Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, André van Renssen, Marcel Roeloffzen, Sander Verdonschot
Dynamic Graph Coloring. CoRR (2017)
Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon
Subquadratic Algorithms for Algebraic Generalizations of 3SUM. SoCG (2017)
Jin Akiyama, Stefan Langerman, Kiyoko Matsunaga
Reversible Nets of Polyhedra. CoRR (2016)
Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters. Algorithmica 76 (4) (2016)
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) (2016)
Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman
Incremental Voronoi diagrams. SoCG (2016)
Stefan Langerman, Andrew Winslow
A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino. SoCG (2016)
Sarah R. Allen, Luis Barba, John Iacono, Stefan Langerman
Incremental Voronoi Diagrams. CoRR (2016)
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) (2016)
Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman
The Power and Limitations of Static Binary Search Trees with Lazy Finger. Algorithmica 76 (4) (2016)
John Iacono, Stefan Langerman
Weighted dynamic finger in binary search trees. SODA (2016)
Stefan Langerman, Yushi Uno
Threes!, Fives, 1024!, and 2048 are Hard. FUN (2016)
Luis Barba, Jean Cardinal, John Iacono, Stefan Langerman, Aurélien Ooms, Noam Solomon
Subquadratic Algorithms for Algebraic Generalizations of 3SUM. CoRR (2016)
Jin Akiyama, Stefan Langerman, Kiyoko Matsunaga
Reversible Nets of Polyhedra. JCDCGG (2015)
Matias Korman, Stefan Langerman, Wolfgang Mulzer, Alexander Pilz, Maria Saumell, Birgit Vogtenhuber
The Dual Diameter of Triangulations. CoRR (2015)
Stefan Langerman, Andrew Winslow
A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino. CoRR (2015)
Stefan Langerman, Yushi Uno
Threes!, Fives, 1024!, and 2048 are Hard. CoRR (2015)
Erik D. Demaine, Stefan Langerman
Bust-a-Move/Puzzle Bobble is NP-Complete. CoRR (2015)
Greg Aloupis, Luis Barba, Jean-Lou De Carufel, Stefan Langerman, Diane L. Souvaine
Isoperimetric Enclosures. Graphs Comb. 31 (2) (2015)
Luis Barba, Stefan Langerman
Optimal detection of intersections between convex polyhedra. SODA (2015)
Hiro Ito, Stefan Langerman, Yuichi Yoshida
Generalized River Crossing Problems. Theory Comput. Syst. 56 (2) (2015)
Erik D. Demaine, John Iacono, Stefan Langerman
Worst-Case Optimal Tree Layout in External Memory. Algorithmica 72 (2) (2015)
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) (2015)
Greg Aloupis, Luis Barba, Stefan Langerman, Diane L. Souvaine
Bichromatic compatible matchings. Comput. Geom. 48 (8) (2015)
Erik D. Demaine, Stefan Langerman
Bust-a-Move/Puzzle Bobble Is NP-complete. JCDCGG (2015)
Luis Barba, Matias Korman, Stefan Langerman, Kunihiko Sadakane, Rodrigo I. Silveira
Space-Time Trade-offs for Stack-Based Algorithms. Algorithmica 72 (4) (2015)
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) (2014)
Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman, Pavel Valtr
Reconstructing Point Set Order Typesfrom Radial Orderings. ISAAC (2014)
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) (2014)
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) (2014)
Prosenjit Bose, Karim Douïeb, John Iacono, Stefan Langerman
The Power and Limitations of Static Binary Search Trees with Lazy Finger. ISAAC (2014)
Luis Barba, Prosenjit Bose, Stefan Langerman
Optimal Algorithms for Constrained 1-Center Problems. LATIN (2014)
Greg Aloupis, John Iacono, Stefan Langerman, Özgür Özkan, Stefanie Wuhrer
The Complexity of Order Type Isomorphism. SODA (2014)
Greg Aloupis, Prosenjit Bose, Vida Dujmovic, Chris Gray, Stefan Langerman, Bettina Speckmann
Triangulating and guarding realistic polygons. Comput. Geom. 47 (2) (2014)
Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira
Computing a visibility polygon using few variables. Comput. Geom. 47 (9) (2014)
Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters. LATIN (2014)
Luis Barba, Stefan Langerman
Detecting intersections between convex polyhedra. CoRR (2013)
Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira, Kunihiko Sadakane
Space-Time Trade-offs for Stack-Based Algorithms. STACS (2013)
Dan Chen, Olivier Devillers, John Iacono, Stefan Langerman, Pat Morin
Oja centers and centers of gravity. Comput. Geom. 46 (2) (2013)
Prosenjit Bose, Paz Carmi, Lilach Chaitman-Yerushalmi, Sébastien Collette, Matthew J. Katz, Stefan Langerman
Stable Roommates Spanner. Comput. Geom. 46 (2) (2013)
Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan
Combining Binary Search Trees. ICALP (1) (2013)
Sergio Cabello, Jean Cardinal, Stefan Langerman
The Clique Problem in Ray Intersection Graphs. Discret. Comput. Geom. 50 (3) (2013)
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) (2013)
Greg Aloupis, Luis Barba, Stefan Langerman, Diane L. Souvaine
Bichromatic compatible matchings. SoCG (2013)
Erik D. Demaine, John Iacono, Stefan Langerman, Özgür Özkan
Combining Binary Search Trees CoRR (2013)
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 (2013)
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 (2013)

Stefan Langerman.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Stefan Langerman