Stefan Langerman
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
61
Venues
18
Active years
1994–2022
Best venue rank
A*
Where they publish
Papers
61 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2022 | FUN | Rolling Polyhedra on Tessellations. | Akira Baes, Erik D. Demaine, Martin L. Demaine, Elizabeth J. Hartung, Stefan Langerman, Joseph O'Rourke, Ryuhei Uehara, Yushi Uno, Aaron Williams |
| 2021 | CIAC | Fragile Complexity of Adaptive Algorithms. | Prosenjit Bose, Pilar Cano, Rolf Fagerberg, John Iacono, Riko Jacob, Stefan Langerman |
| 2020 | SODA | Competitive Online Search Trees on Trees. | Prosenjit Bose, Jean Cardinal, John Iacono, Grigorios Koumoutsos, Stefan Langerman |
| 2019 | CSR | Belga B-Trees. | Erik D. Demaine, John Iacono, Grigorios Koumoutsos, Stefan Langerman |
| 2018 | ESA | Dynamic Trees with Almost-Optimal Access Cost. | Mordecai J. Golin, John Iacono, Stefan Langerman, J. Ian Munro, Yakov Nekrich |
| 2018 | GD | Pole Dancing: 3D Morphs for Tree Drawings. | Elena Arseneva, Prosenjit Bose, Pilar Cano, Anthony D'Angelo, Vida Dujmovic, Fabrizio Frati, Stefan Langerman, Alessandra Tappini |
| 2017 | WADS | Dynamic Graph Coloring. | Luis Barba, Jean Cardinal, Matias Korman, Stefan Langerman, Andr van Renssen, Marcel Roeloffzen, Sander Verdonschot |
| 2017 | WADS | Searching Edges in the Overlap of Two Plane Graphs. | John Iacono, Elena Khramtcova, Stefan Langerman |
| 2016 | FUN | Threes!, Fives, 1024!, and 2048 are Hard. | Stefan Langerman, Yushi Uno |
| 2016 | SODA | Weighted dynamic finger in binary search trees. | John Iacono, Stefan Langerman |
| 2015 | SODA | Optimal detection of intersections between convex polyhedra. | Luis Barba, Stefan Langerman |
| 2014 | ISAAC | Reconstructing Point Set Order Typesfrom Radial Orderings. | Oswin Aichholzer, Jean Cardinal, Vincent Kusters, Stefan Langerman, Pavel Valtr |
| 2014 | ISAAC | The Power and Limitations of Static Binary Search Trees with Lazy Finger. | Prosenjit Bose, Karim Doueb, John Iacono, Stefan Langerman |
| 2014 | LATIN | Optimal Algorithms for Constrained 1-Center Problems. | Luis Barba, Prosenjit Bose, Stefan Langerman |
| 2014 | LATIN | A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters. | Panagiotis Cheilaris, Elena Khramtcova, Stefan Langerman, Evanthia Papadopoulou |
| 2014 | SODA | The Complexity of Order Type Isomorphism. | Greg Aloupis, John Iacono, Stefan Langerman, zgr zkan, Stefanie Wuhrer |
| 2013 | ICALP | Combining Binary Search Trees. | Erik D. Demaine, John Iacono, Stefan Langerman, zgr zkan |
| 2013 | STACS | Space-Time Trade-offs for Stack-Based Algorithms. | Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira, Kunihiko Sadakane |
| 2013 | WADS | Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. | Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sbastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Gnter Rote, Torsten Ueckerdt |
| 2012 | ESA | The Clique Problem in Ray Intersection Graphs. | Sergio Cabello, Jean Cardinal, Stefan Langerman |
| 2012 | FUN | Algorithms and Complexity of Generalized River Crossing Problems. | Hiro Ito, Stefan Langerman, Yuichi Yoshida |
| 2012 | ICALP | De-amortizing Binary Search Trees. | Prosenjit Bose, Sbastien Collette, Rolf Fagerberg, Stefan Langerman |
| 2012 | SODA | Confluent persistence revisited. | Sbastien Collette, John Iacono, Stefan Langerman |
| 2011 | ISAAC | Computing the Visibility Polygon Using Few Variables. | Luis Barba, Matias Korman, Stefan Langerman, Rodrigo I. Silveira |
| 2010 | ISAAC | Approximating the Average Stretch Factor of Geometric Graphs. | Siu-Wing Cheng, Christian Knauer, Stefan Langerman, Michiel H. M. Smid |
| 2010 | LATIN | Matching Points with Things. | Greg Aloupis, Jean Cardinal, Sbastien Collette, Erik D. Demaine, Martin L. Demaine, Muriel Dulieu, Ruy Fabila-Monroy, Vi Hart, Ferran Hurtado, Stefan Langerman, Maria Saumell, Carlos Seara, Perouz Taslakian |
| 2010 | LATIN | Colorful Strips. | Greg Aloupis, Jean Cardinal, Sbastien Collette, Shinji Imahori, Matias Korman, Stefan Langerman, Oded Schwartz, Shakhar Smorodinsky, Perouz Taslakian |
| 2010 | SODA | Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. | Gerth Stlting Brodal, Erik D. Demaine, Jeremy T. Fineman, John Iacono, Stefan Langerman, J. Ian Munro |
| 2009 | ISAAC | Algorithmic Folding Complexity. | Jean Cardinal, Erik D. Demaine, Martin L. Demaine, Shinji Imahori, Stefan Langerman, Ryuhei Uehara |
| 2009 | OOPSLA | Executing code in the past: efficient in-memory object graph versioning. | Frdric Pluquet, Stefan Langerman, Roel Wuyts |
| 2009 | OOPSLA | Executing code in the past: efficient in-memory object graph versioning. | Frdric Pluquet, Stefan Langerman, Roel Wuyts |
| 2009 | SODA | Decomposition of multiple coverings into more parts. | Greg Aloupis, Jean Cardinal, Sbastien Collette, Stefan Langerman, David Orden, Pedro Ramos |
| 2008 | ALENEX | Implementing Partial Persistence in Object-Oriented Languages. | Frdric Pluquet, Stefan Langerman, Antoine Marot, Roel Wuyts |
| 2008 | ISAAC | Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves. | Greg Aloupis, Sbastien Collette, Erik D. Demaine, Stefan Langerman, Vera Sacristn Adinolfi, Stefanie Wuhrer |
| 2008 | LATIN | Coloring Geometric Range Spaces. | Greg Aloupis, Jean Cardinal, Sbastien Collette, Stefan Langerman, Shakhar Smorodinsky |
| 2008 | SODA | Dynamic optimality for skip lists and B-trees. | Prosenjit Bose, Karim Doueb, Stefan Langerman |
| 2008 | SODA | Distribution-sensitive point location in convex subdivisions. | Sbastien Collette, Vida Dujmovic, John Iacono, Stefan Langerman, Pat Morin |
| 2008 | WAFR | Realistic Reconfiguration of Crystalline (and Telecube) Robots. | Greg Aloupis, Sbastien Collette, Mirela Damian, Erik D. Demaine, Dania El-Khechen, Robin Y. Flatland, Stefan Langerman, Joseph O'Rourke, Val Pinciu, Suneeta Ramaswami, Vera Sacristn Adinolfi, Stefanie Wuhrer |
| 2007 | ISAAC | Linear Reconfiguration of Cube-Style Modular Robots. | Greg Aloupis, Sbastien Collette, Mirela Damian, Erik D. Demaine, Robin Y. Flatland, Stefan Langerman, Joseph O'Rourke, Suneeta Ramaswami, Vera Sacristn Adinolfi, Stefanie Wuhrer |
| 2007 | WADS | The Stackelberg Minimum Spanning Tree Game. | Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenal Joret, Stefan Langerman, Ilan Newman, Oren Weimann |
| 2006 | ESA | Necklaces, Convolutions, and | David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian |
| 2006 | ESA | Near-Entropy Hotlink Assignments. | Karim Doueb, Stefan Langerman |
| 2006 | LATIN | Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams. | Boris Aronov, Prosenjit Bose, Erik D. Demaine, Joachim Gudmundsson, John Iacono, Stefan Langerman, Michiel H. M. Smid |
| 2006 | WAOA | Improved Approximation Bounds for Edge Dominating Set in Dense Graphs. | Jean Cardinal, Stefan Langerman, Eythan Levy |
| 2005 | COCOON | A Tight Analysis of the Maximal Matching Heuristic. | Jean Cardinal, Martine Labb, Stefan Langerman, Eythan Levy, Hadrien Mlot |
| 2005 | ESA | Optimizing a 2D Function Satisfying Unimodality Properties. | Erik D. Demaine, Stefan Langerman |
| 2005 | WADS | Dynamic Hotlinks. | Karim Doueb, Stefan Langerman |
| 2004 | LATIN | Designing Small Keyboards Is Hard. | Jean Cardinal, Stefan Langerman |
| 2004 | SODA | Retroactive data structures. | Erik D. Demaine, John Iacono, Stefan Langerman |
| 2003 | ISAAC | Geometric Restrictions on Producible Polygonal Protein Chains. | Erik D. Demaine, Stefan Langerman, Joseph O'Rourke |
| 2003 | STACS | Optimization in Arrangements. | Stefan Langerman, William L. Steiger |
| 2003 | WADS | Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries. | David Bremner, Erik D. Demaine, Jeff Erickson, John Iacono, Stefan Langerman, Pat Morin, Godfried T. Toussaint |
| 2002 | ESA | Covering Things with Things. | Stefan Langerman, Pat Morin |
| 2002 | ISAAC | Flat-State Connectivity of Linkages under Dihedral Motions. | 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 |
| 2002 | ISAAC | Queaps. | John Iacono, Stefan Langerman |
| 2002 | STACS | Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles. | Stefan Langerman, Pat Morin, Michael A. Soss |
| 2002 | SIROCCO | Asymmetric Communication Protocols via Hotlink Assignments. | Prosenjit Bose, Danny Krizanc, Stefan Langerman, Pat Morin |
| 2001 | ESA | Algorithms for Efficient Filtering in Content-Based Multicast. | Stefan Langerman, Sachin Lodha, Rahul Shah |
| 2000 | SODA | An optimal algorithm for hyperplane depth in the plane. | Stefan Langerman, William L. Steiger |
| 1996 | ICEC | Results of the First International Contest on Evolutionary Optimisation (1st ICEO). | Hugues Bersini, Marco Dorigo, Stefan Langerman, Gregory Seront, Luca Maria Gambardella |
| 1994 | ICEC | S.T.E.P.: The Easiest Way to Optimize a Function. | Stefan Langerman, Gregory Seront, Hugues Bersini |