The Clique Problem in Ray Intersection Graphs
2013 · Discrete & Computational Geometry · 32 citations
https://doi.org/10.1007/s00454-013-9538-5
S
Stefan Langerman
Claim or correct this author profile
Claim this profile or suggest corrections to the name, affiliation, bio, photo, or paper titles. Approved changes appear as verified CitedEvidence overlays.
301
Papers
2.4K
Citations
25
h-index
84
i10-index
Stefan Langerman is an academic researcher from Université Libre de Bruxelles. The author has contributed to research in topics: Computational Geometry and Mesh Generation & Algorithms and Data Compression & Data Management and Algorithms. The author has an h-index of 25, co-authored 256 publications.
ORCID: 0000-0001-6999-3088Papers by this author
worksTriangulating and Guarding Realistic Polygons.
2008 · TU/e Research Portal · 5 citations
Dynamic Ham-Sandwich Cuts in the Plane
2005 · 3 citations
Computing a visibility polygon using few variables
2011 · RECERCAT (Consorci de Serveis Universitaris de Catalunya) · 3 citations
https://doi.org/10.48550/arxiv.1111.3584
Dynamic Graph Coloring
2017 · Lecture notes in computer science · 2 citations
https://doi.org/10.1007/978-3-319-62127-2_9
Polyhedral Characterization of Reversible Hinged Dissections
2019 · Graphs and Combinatorics · 1 citations
https://doi.org/10.1007/s00373-019-02041-2
Research topics
topicsChat about Author
Papers
Chat
Click to start Chat