Stefan Langerman

Stefan Langerman

Université Libre de Bruxelles

H-index: 32

Europe-Belgium

About Stefan Langerman

Stefan Langerman, With an exceptional h-index of 32 and a recent h-index of 17 (since 2020), a distinguished researcher at Université Libre de Bruxelles, specializes in the field of Algorithms, Data Structures, Computational Geometry, Discrete Geometry.

His recent articles reflect a diverse array of research interests and contributions to the field:

Deep Cliques in Point Sets

Competitive online search trees on trees

ACM Transactions on

Multifold Tiles of Polyominoes and Convex Lattice Polygons: Discrete and Computational Geometry, Graphs, and Games

Fragile complexity of adaptive algorithms

Rolling Polyhedra on Tessellations

Enumerating All Convex Polyhedra Glued from Squares in Polynomial Time

Belga b-trees

Stefan Langerman Information

University

Position

Département d'Informatique

Citations(all)

3636

Citations(since 2020)

1080

Cited By

3112

hIndex(all)

32

hIndex(since 2020)

17

i10Index(all)

104

i10Index(since 2020)

35

Email

University Profile Page

Université Libre de Bruxelles

Google Scholar

View Google Scholar Profile

Stefan Langerman Skills & Research Interests

Algorithms

Data Structures

Computational Geometry

Discrete Geometry

Top articles of Stefan Langerman

Title

Journal

Author(s)

Publication Date

Deep Cliques in Point Sets

Discrete & Computational Geometry

Stefan Langerman

Marcelo Mydlarz

Emo Welzl

2023/12/18

Competitive online search trees on trees

ACM Transactions on Algorithms

Prosenjit Bose

Jean Cardinal

John Iacono

Grigorios Koumoutsos

Stefan Langerman

2023/6/24

ACM Transactions on

ACM Transactions on

Edith Cohen

Susanne Albers

Glencora Borradaile

Andrei A Bulatov

Keren Censor-Hillel

...

2023

Multifold Tiles of Polyominoes and Convex Lattice Polygons: Discrete and Computational Geometry, Graphs, and Games

Thai Journal of Mathematics

Kota Chida

Erik D Demaine

Martin L Demaine

David Eppstein

Adam Hesterberg

...

2023/12/31

Fragile complexity of adaptive algorithms

Theoretical computer science

Prosenjit Bose

Pilar Cano

Rolf Fagerberg

John Iacono

Riko Jacob

...

2022/6/5

Rolling Polyhedra on Tessellations

Akira Baes

Erik D Demaine

Martin L Demaine

Elizabeth Hartung

Stefan Langerman

...

2022

Enumerating All Convex Polyhedra Glued from Squares in Polynomial Time

arXiv preprint arXiv:2104.06787

Stefan Langerman

Nicolas Potvin

Boris Zolotov

2021/4/14

Belga b-trees

Theory of Computing Systems

Erik D Demaine

John Iacono

Grigorios Koumoutsos

Stefan Langerman

2021/4

Toward Unfolding Doubly Covered n-Stars

Hugo A Akitaya

Brad Ballinger

Mirela Damian

Erik D Demaine

Martin L Demaine

...

2021

Polyhedral Characterization of Reversible Hinged Dissections

Graphs and Combinatorics

Jin Akiyama

Erik D Demaine

Stefan Langerman

2020/3

Sublinear explicit incremental planar voronoi diagrams

Journal of Information Processing

Elena Arseneva

John Iacono

Grigorios Koumoutsos

Stefan Langerman

Boris Zolotov

2020

A complete list of all convex polyhedra made by gluing regular pentagons

Journal of Information Processing

Elena Arseneva

Stefan Langerman

Boris Zolotov

2020

Which convex polyhedra can be made by gluing regular hexagons?

Graphs and Combinatorics

Elena Arseneva

Stefan Langerman

2020/3

Cookie Clicker

Graphs and Combinatorics

Erik D Demaine

Hiro Ito

Stefan Langerman

Jayson Lynch

Mikhail Rudoy

...

2020/3

See List of Professors in Stefan Langerman University(Université Libre de Bruxelles)

Co-Authors

H-index: 78
Erik Demaine

Erik Demaine

Massachusetts Institute of Technology

H-index: 49
Joseph O'Rourke

Joseph O'Rourke

Smith College

H-index: 46
Prosenjit Bose

Prosenjit Bose

Carleton University

H-index: 43
David R. Wood

David R. Wood

Monash University

H-index: 41
Jeff Erickson

Jeff Erickson

University of Illinois at Urbana-Champaign

H-index: 36
Pat Morin

Pat Morin

Carleton University

academic-engine