Stefan Langerman

[[Bellairs Research Institute|Bellairs]], 2015 Stefan Langerman false Swarzberg is a Belgian computer scientist and mathematician whose research topics include computational geometry, data structures, and recreational mathematics. He is professor and co-head of the algorithms research group at the Université libre de Bruxelles (ULB) with Jean Cardinal. He is a director of research for the Belgian Fonds de la Recherche Scientifique (FRS–FNRS). Provided by Wikipedia
Showing 1 - 20 results of 23 for search 'Langerman, Stefan', query time: 0.25s Refine Results
  1. 1
    Bust-a-Move/Puzzle Bobble Is NP-complete

    Bust-a-Move/Puzzle Bobble Is NP-complete by Langerman, Stefan, Demaine, Erik D

    Published 2017
    Get full text
    Get full text
    Article
  2. 2
    Polyhedral Characterization of Reversible Hinged Dissections

    Polyhedral Characterization of Reversible Hinged Dissections by Akiyama, Jin, Demaine, Erik D, Langerman, Stefan

    Published 2021
    Get full text
    Article
  3. 3
    Polyhedral Characterization of Reversible Hinged Dissections

    Polyhedral Characterization of Reversible Hinged Dissections by Akiyama, Jin, Demaine, Erik D, Langerman, Stefan

    Published 2021
    Get full text
    Article
  4. 4
    Worst-Case Optimal Tree Layout in External Memory

    Worst-Case Optimal Tree Layout in External Memory by Demaine, Erik D., Iacono, John, Langerman, Stefan

    Published 2014
    Get full text
    Get full text
    Article
  5. 5
    Belga B-Trees

    Belga B-Trees by Demaine, Erik D, Iacono, John, Koumoutsos, Grigorios, Langerman, Stefan

    Published 2021
    Get full text
    Article
  6. 6
    Belga B-Trees

    Belga B-Trees by Demaine, Erik D, Iacono, John, Koumoutsos, Grigorios, Langerman, Stefan

    Published 2021
    Get full text
    Article
  7. 7
    Belga B-Trees

    Belga B-Trees by Demaine, Erik D., Iacono, John, Koumoutsos, Grigorios, Langerman, Stefan

    Published 2021
    Get full text
    Article
  8. 8
    Combining Binary Search Trees

    Combining Binary Search Trees by Demaine, Erik D., Iacono, John, Langerman, Stefan, Ozkan, Ozgur

    Published 2014
    Get full text
    Get full text
    Article
  9. 9
    Cookie Clicker

    Cookie Clicker by Demaine, Erik D, Ito, Hiro, Langerman, Stefan, Lynch, Jayson, Rudoy, Mikhail, Xiao, Kai

    Published 2021
    Get full text
    Article
  10. 10
    Algorithmic folding complexity

    Algorithmic folding complexity by Cardinal, Jean, Demaine, Erik D., Demaine, Martin L., Imahori, Shinji, Langerman, Stefan, Uehara, Ryuhei

    Published 2011
    Get full text
    Get full text
    Article
  11. 11
    Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams

    Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams by Aronov, Boris, Bose, Prosenjit, Gudmundsson, Joachim, Iacono, John, Langerman, Stefan, Smid, Michiel, Demaine, Erik D

    Published 2018
    Get full text
    Get full text
    Article
  12. 12
    The Stackelberg Minimum Spanning Tree Game

    The Stackelberg Minimum Spanning Tree Game by Cardinal, Jean, Demaine, Erik D, Fiorini, Samuel, Joret, Gwenaël, Langerman, Stefan, Newman, Ilan, Weimann, Oren

    Published 2019
    Get full text
    Article
  13. 13
    Cache-oblivious dynamic dictionaries with update/query tradeoffs

    Cache-oblivious dynamic dictionaries with update/query tradeoffs by Brodal, Gerth Stolting, Demaine, Erik D., Fineman, Jeremy T., Iacono, John, Langerman, Stefan, Munro, J. Ian

    Published 2011
    Get full text
    Get full text
    Article
  14. 14
    Continuous Blooming of Convex Polyhedra

    Continuous Blooming of Convex Polyhedra by Demaine, Erik D., Demaine, Martin L., Hart, Vi, Iacono, John, Langerman, Stefan, O'Rourke, Joseph

    Published 2011
    Get full text
    Get full text
    Article
  15. 15
    Computing Signed Permutations of Polygon

    Computing Signed Permutations of Polygon by Aloupis, Greg, Bose, Prosenjit, Demaine, Erik D., Langerman, Stefan, Meijer, Henk, Overmars, Mark, Toussaint, Godfried T.

    Published 2012
    Get full text
    Get full text
    Article
  16. 16
    Necklaces, Convolutions, and X+Y

    Necklaces, Convolutions, and X+Y by Bremner, David, Chan, Timothy M., Demaine, Erik D, Erickson, Jeff, Hurtado, Ferran, Iacono, John, Langerman, Stefan, Taslakian, Perouz

    Published 2019
    Get full text
    Article
  17. 17
    Linear reconfiguration of cube-style modular robots

    Linear reconfiguration of cube-style modular robots by Demaine, Erik D., Aloupis, Greg, Collette, Sebastien, Damian, Mirela, Langerman, Stefan, O'Rourke, Joseph, Ramaswami, Suneeta, Wuhrer, Stefanie

    Published 2011
    Get full text
    Get full text
    Article
  18. 18
    Locked and Unlocked Chains of Planar Shapes

    Locked and Unlocked Chains of Planar Shapes by Connelly, Robert, Demaine, Erik D., Demaine, Martin L., Fekete, Sandor P., Langerman, Stefan, Mitchell, Joseph S. B., Ribo, Ares, Rote, Gunter

    Published 2011
    Get full text
    Get full text
    Article
  19. 19
    Necklaces, Convolutions, and X+Y

    Necklaces, Convolutions, and X+Y by Bremner, David, Chan, Timothy M., Demaine, Erik D., Erickson, Jeff, Hurtado, Ferran, Iacono, John, Langerman, Stefan, Patrascu, Mihai, Taslakian, Perouz

    Published 2015
    Get full text
    Get full text
    Article
  20. 20
    Common unfoldings of polyominoes and polycubes

    Common unfoldings of polyominoes and polycubes by Aloupis, Greg, Bose, Prosenjit, Collette, Sebastien, Demaine, Erik D., Demaine, Martin L., Douieb, Karim, Dujmovic, Vida, Iacono, John, Langerman, Stefan, Morin, Pat

    Published 2012
    Get full text
    Get full text
    Article

Search Tools: