The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Stefan Langerman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Timothy 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:61-64 [Conf]
  2. Greg Aloupis, Prosenjit Bose, Erik D. Demaine, Stefan Langerman, Henk Meijer, Mark H. Overmars, Godfried T. Toussaint
    Computing signed permutations of polygons. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:68-71 [Conf]
  3. Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint
    Unfolding polyhedral bands. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:60-63 [Conf]
  4. Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, David Rappaport, Godfried T. Toussaint
    Computing the Similarity of two Melodies. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:81-84 [Conf]
  5. Greg Aloupis, Stefan Langerman, Michael A. Soss, Godfried T. Toussaint
    Algorithms for bivariate medians and a fermat-torricelli problem for lines. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:21-24 [Conf]
  6. Boris Aronov, Franz Aurenhammer, Ferran Hurtado, Stefan Langerman, David Rappaport, Shakhar Smorodinsky, Carlos Seara
    Small weak epsilon nets. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:52-56 [Conf]
  7. Erik D. Demaine, Jeff Erickson, Stefan Langerman
    On the Complexity of Halfspace Volume Queries. [Citation Graph (0, 0)][DBLP]
    CCCG, 2003, pp:159-160 [Conf]
  8. Erik D. Demaine, John Iacono, Stefan Langerman
    Proximate point searching. [Citation Graph (0, 0)][DBLP]
    CCCG, 2002, pp:1-4 [Conf]
  9. Sergio Cabello, José Miguel Díaz-Báñez, Stefan Langerman, Carlos Seara, Inmaculada Ventura
    Reverse facility location problems. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:68-71 [Conf]
  10. Erik D. Demaine, Stefan Langerman, Joseph O'Rourke
    Short interlocked linkages. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:69-72 [Conf]
  11. Jean Cardinal, Sébastien Collette, Stefan Langerman
    Local properties of geometric graphs. [Citation Graph (0, 0)][DBLP]
    CCCG, 2004, pp:145-148 [Conf]
  12. Jean Cardinal, Sébastien Collette, Stefan Langerman
    Region Counting Distances and Region Counting Circles. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:278-281 [Conf]
  13. Jean Cardinal, Martine Labbé, Stefan Langerman, Belén Palop
    Pricing of Geometric Transportation Networks. [Citation Graph (0, 0)][DBLP]
    CCCG, 2005, pp:92-96 [Conf]
  14. John Iacono, Stefan Langerman
    Dynamic point location in fat hyperrectangles with integer coordinates. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  15. Stefan Langerman
    On the Shooter Location Problem. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  16. Jean Cardinal, Martine Labbé, Stefan Langerman, Eythan Levy, Hadrien Mélot
    A Tight Analysis of the Maximal Matching Heuristic. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:701-709 [Conf]
  17. Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin
    Geodesic ham-sandwich cuts. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:1-9 [Conf]
  18. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:61-70 [Conf]
  19. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
    Separating point sets in polygonal environments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:10-16 [Conf]
  20. Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink
    Interlocked open linkages with few joints. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:189-198 [Conf]
  21. John Iacono, Stefan Langerman
    Proximate planar point location. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:220-226 [Conf]
  22. Stefan Langerman
    On the complexity of halfspace area queries. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:207-211 [Conf]
  23. David Bremner, Timothy M. Chan, Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Perouz Taslakian
    Necklaces, Convolutions, and X + Y. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:160-171 [Conf]
  24. Erik D. Demaine, Stefan Langerman
    Optimizing a 2D Function Satisfying Unimodality Properties. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:887-898 [Conf]
  25. Karim Douïeb, Stefan Langerman
    Near-Entropy Hotlink Assignments. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:292-303 [Conf]
  26. Stefan Langerman, Sachin Lodha, Rahul Shah
    Algorithms for Efficient Filtering in Content-Based Multicast. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:428-439 [Conf]
  27. Stefan Langerman, Pat Morin
    Covering Things with Things. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:662-673 [Conf]
  28. Hugues Bersini, Marco Dorigo, Stefan Langerman, Gregory Seront, Luca Maria Gambardella
    Results of the First International Contest on Evolutionary Optimisation (1st ICEO). [Citation Graph (0, 0)][DBLP]
    International Conference on Evolutionary Computation, 1996, pp:611-615 [Conf]
  29. Stefan Langerman, Gregory Seront, Hugues Bersini
    S.T.E.P.: The Easiest Way to Optimize a Function. [Citation Graph (0, 0)][DBLP]
    International Conference on Evolutionary Computation, 1994, pp:519-524 [Conf]
  30. 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. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:369-380 [Conf]
  31. Erik D. Demaine, Stefan Langerman, Joseph O'Rourke
    Geometric Restrictions on Producible Polygonal Protein Chains. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:395-404 [Conf]
  32. John Iacono, Stefan Langerman
    Queaps. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:211-218 [Conf]
  33. Prosenjit Bose, Stefan Langerman
    Weighted Ham-Sandwich Cuts. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:48-53 [Conf]
  34. Erik D. Demaine, John Iacono, Stefan Langerman
    Grid Vertex-Unfolding Orthostacks. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2004, pp:76-82 [Conf]
  35. Mordecai J. Golin, Stefan Langerman, William L. Steiger
    The Convex Hull for Random Lines in the Plane. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2002, pp:172-175 [Conf]
  36. John Iacono, Stefan Langerman
    Volume Queries in Polyhedra. [Citation Graph (0, 0)][DBLP]
    JCDCG, 2000, pp:156-159 [Conf]
  37. 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. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:80-92 [Conf]
  38. Jean Cardinal, Stefan Langerman
    Designing Small Keyboards Is Hard. [Citation Graph (0, 0)][DBLP]
    LATIN, 2004, pp:391-400 [Conf]
  39. Prosenjit Bose, Danny Krizanc, Stefan Langerman, Pat Morin
    Asymmetric Communication Protocols via Hotlink Assignments. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2002, pp:33-39 [Conf]
  40. Erik D. Demaine, John Iacono, Stefan Langerman
    Retroactive data structures. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:281-290 [Conf]
  41. Stefan Langerman, William L. Steiger
    An optimal algorithm for hyperplane depth in the plane. [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:54-59 [Conf]
  42. Stefan Langerman, Pat Morin, Michael A. Soss
    Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles. [Citation Graph (0, 0)][DBLP]
    STACS, 2002, pp:250-261 [Conf]
  43. Stefan Langerman, William L. Steiger
    Optimization in Arrangements. [Citation Graph (0, 0)][DBLP]
    STACS, 2003, pp:50-61 [Conf]
  44. 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. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:451-461 [Conf]
  45. Karim Douïeb, Stefan Langerman
    Dynamic Hotlinks. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:182-194 [Conf]
  46. Jean Cardinal, Stefan Langerman, Eythan Levy
    Improved Approximation Bounds for Edge Dominating Set in Dense Graphs. [Citation Graph (0, 0)][DBLP]
    WAOA, 2006, pp:108-120 [Conf]
  47. Erik D. Demaine, Stefan Langerman, Joseph O'Rourke
    Geometric Restrictions on Producible Polygonal Protein Chains. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:2, pp:167-181 [Journal]
  48. John Iacono, Stefan Langerman
    Queaps. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:42, n:1, pp:49-56 [Journal]
  49. Greg Aloupis, Stefan Langerman, Michael A. Soss, Godfried T. Toussaint
    Algorithms for bivariate medians and a Fermat-Torricelli problem for lines. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:1, pp:69-79 [Journal]
  50. Erik D. Demaine, John Iacono, Stefan Langerman
    Proximate point searching. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:28, n:1, pp:29-40 [Journal]
  51. Erik D. Demaine, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink
    Interlocked open and closed linkages with few joints. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2003, v:26, n:1, pp:37-45 [Journal]
  52. Julie Glass, Stefan Langerman, Joseph O'Rourke, Jack Snoeyink, Jianyuan K. Zhong
    A 2-chain can interlock with a k-chain [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  53. Erik D. Demaine, John Iacono, Stefan Langerman
    Worst-Case Optimal Tree Layout in a Memory Hierarchy [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  54. 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. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:4, pp:593-604 [Journal]
  55. Stefan Langerman
    On the Complexity of Halfspace Area Queries. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:4, pp:639-648 [Journal]
  56. Stefan Langerman, Pat Morin
    Covering Things with Things. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:33, n:4, pp:717-729 [Journal]
  57. Stefan Langerman, William L. Steiger
    The Complexity of Hyperplane Depth in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:30, n:2, pp:299-309 [Journal]
  58. Erik D. Demaine, Jeff Erickson, Ferran Hurtado, John Iacono, Stefan Langerman, Henk Meijer, Mark H. Overmars, Sue Whitesides
    Separating Point Sets in Polygonal Environments. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:4, pp:403-420 [Journal]
  59. Prosenjit Bose, Danny Krizanc, Stefan Langerman, Pat Morin
    Asymmetric Communication Protocols via Hotlink Assignments. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:6, pp:655-661 [Journal]
  60. Jean Cardinal, Steve Kremer, Stefan Langerman
    Juggling with Pattern Matching. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:3, pp:425-437 [Journal]
  61. Erik D. Demaine, Martin L. Demaine, Arthur Langerman, Stefan Langerman
    Morpion Solitaire. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:3, pp:439-453 [Journal]
  62. Jean Cardinal, Stefan Langerman
    Designing small keyboards is hard. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:405-415 [Journal]
  63. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2007, pp:137-140 [Conf]
  64. 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. [Citation Graph (0, 0)][DBLP]
    CCCG, 2006, pp:- [Conf]
  65. Greg Aloupis, Jean Cardinal, Sébastien Collette, Stefan Langerman
    LUMINESStrategies. [Citation Graph (0, 0)][DBLP]
    Computers and Games, 2006, pp:190-199 [Conf]
  66. Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
    The Stackelberg Minimum Spanning Tree Game. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:64-76 [Conf]
  67. Jean Cardinal, Sébastien Collette, Stefan Langerman
    Local properties of geometric graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2008, v:39, n:1, pp:55-64 [Journal]
  68. Greg Aloupis, Erik D. Demaine, Stefan Langerman, Pat Morin, Joseph O'Rourke, Ileana Streinu, Godfried T. Toussaint
    Edge-unfolding nested polyhedral bands. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2008, v:39, n:1, pp:30-42 [Journal]
  69. Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
    The Stackelberg Minimum Spanning Tree Game [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  70. Jean Cardinal, Sébastien Collette, Ferran Hurtado, Stefan Langerman, Belén Palop
    Moving Walkways, Escalators, and Elevators [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  71. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  72. Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer
    A Characterization of the Degree Sequences of 2-Trees [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  73. Prosenjit Bose, Vida Dujmovic, Ferran Hurtado, Stefan Langerman, Pat Morin, David R. Wood
    A polynomial bound for untangling geometric planar graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  74. Prosenjit Bose, Erik D. Demaine, Ferran Hurtado, John Iacono, Stefan Langerman, Pat Morin
    Geodesic Ham-Sandwich Cuts. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2007, v:37, n:3, pp:325-339 [Journal]
  75. Erik D. Demaine, John Iacono, Stefan Langerman
    Retroactive data structures. [Citation Graph (0, 0)][DBLP]
    ACM Transactions on Algorithms, 2007, v:3, n:2, pp:- [Journal]

  76. Implementing Partial Persistence in Object-Oriented Languages. [Citation Graph (, )][DBLP]


  77. Triangulating and Guarding Realistic Polygons. [Citation Graph (, )][DBLP]


  78. Draining a Polygon - or - Rolling a Ball out of a Polygon. [Citation Graph (, )][DBLP]


  79. Smallest enclosing circle centered on a query line segment. [Citation Graph (, )][DBLP]


  80. Some properties of higher order delaunay and gabriel graphs. [Citation Graph (, )][DBLP]


  81. Oja medians and centers of gravity. [Citation Graph (, )][DBLP]


  82. Every Large Point Set contains Many Collinear Points or an Empty Pentagon. [Citation Graph (, )][DBLP]


  83. Region counting graphs. [Citation Graph (, )][DBLP]


  84. Linear Reconfiguration of Cube-Style Modular Robots. [Citation Graph (, )][DBLP]


  85. Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves. [Citation Graph (, )][DBLP]


  86. Colorful Strips. [Citation Graph (, )][DBLP]


  87. Matching Points with Things. [Citation Graph (, )][DBLP]


  88. Coloring Geometric Range Spaces. [Citation Graph (, )][DBLP]


  89. Executing code in the past: efficient in-memory object graph versioning. [Citation Graph (, )][DBLP]


  90. Executing code in the past: efficient in-memory object graph versioning. [Citation Graph (, )][DBLP]


  91. Distribution-sensitive point location in convex subdivisions. [Citation Graph (, )][DBLP]


  92. Dynamic optimality for skip lists and B-trees. [Citation Graph (, )][DBLP]


  93. Decomposition of multiple coverings into more parts. [Citation Graph (, )][DBLP]


  94. Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs. [Citation Graph (, )][DBLP]


  95. Confluently Persistent Tries for Efficient Version Control. [Citation Graph (, )][DBLP]


  96. Realistic Reconfiguration of Crystalline (and Telecube) Robots. [Citation Graph (, )][DBLP]


  97. Dynamic Hotlinks. [Citation Graph (, )][DBLP]


  98. Optimal location of transportation devices. [Citation Graph (, )][DBLP]


  99. Empty region graphs. [Citation Graph (, )][DBLP]


  100. Wrapping spheres with flat paper. [Citation Graph (, )][DBLP]


  101. Small weak epsilon-nets. [Citation Graph (, )][DBLP]


  102. Linear reconfiguration of cube-style modular robots. [Citation Graph (, )][DBLP]


  103. Dynamic ham-sandwich cuts in the plane. [Citation Graph (, )][DBLP]


  104. Highway hull revisited. [Citation Graph (, )][DBLP]


  105. Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams [Citation Graph (, )][DBLP]


  106. Cauchy's Arm Lemma on a Growing Sphere [Citation Graph (, )][DBLP]


  107. Highway Hull Revisited [Citation Graph (, )][DBLP]


  108. Decomposition of Multiple Coverings into More Parts [Citation Graph (, )][DBLP]


  109. Entropy, Triangulation, and Point Location in Planar Subdivisions [Citation Graph (, )][DBLP]


  110. Colorful Strips [Citation Graph (, )][DBLP]


  111. Continuous Blooming of Convex Polyhedra [Citation Graph (, )][DBLP]


  112. Reconfiguration of 3D Crystalline Robots Using O(log n) Parallel Moves [Citation Graph (, )][DBLP]


  113. Detecting all regular polygons in a point set [Citation Graph (, )][DBLP]


  114. Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. [Citation Graph (, )][DBLP]


  115. Coloring Geometric Range Spaces. [Citation Graph (, )][DBLP]


  116. A Polynomial Bound for Untangling Geometric Planar Graphs. [Citation Graph (, )][DBLP]


  117. Decomposition of Multiple Coverings into More Parts. [Citation Graph (, )][DBLP]


  118. Locked and Unlocked Chains of Planar Shapes. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.014secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002