Stefan Langerman
Impact in
-
- Computational Geometry and Mesh Generation
- Signal Processing top 2%
- Data Management and Algorithms
Papers in
-
- Computational Geometry and Mesh Generation 117
-
- Advanced Graph Theory Research 39
- Complexity and Algorithms in Graphs 22
- Co-authors
- John Iacono (53 shared papers)Erik D. Demaine (52 shared papers)Pat Morin (24 shared papers)Jean Cardinal (46 shared papers)Sébastien Collette (41 shared papers)Greg Aloupis (37 shared papers)Godfried Toussaint (9 shared papers)Prosenjit K. Bose (29 shared papers)
- Journals
- Computational Geometry (20 papers)Discrete & Computational Geometry (12 papers)Algorithmica (11 papers)Graphs and Combinatorics (8 papers)Lecture notes in computer science (48 papers)
- Partner nations
- BelgiumUnited StatesCanada
In The Last Decade
Stefan Langerman
181 papers receiving 1.6k citations
Peers
Comparison fields: 5 of 105
- Computer Graphics and Computer-Aided Design 621
- Signal Processing 346
- Computational Theory and Mathematics 450
- Computer Vision and Pattern Recognition 351
- Computer Networks and Communications 347
Countries citing papers authored by Stefan Langerman
This map shows the geographic impact of Stefan Langerman's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Stefan Langerman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Stefan Langerman more than expected).
Fields of papers citing papers by Stefan Langerman
This network shows the impact of papers produced by Stefan Langerman. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Stefan Langerman. The network helps show where Stefan Langerman may publish in the future.
Co-authors
The 25 scholars most cited alongside Stefan Langerman, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 200 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | 2005 | 126 | |
| 2 | 2002 | 69 | |
| 3 | 2004 | 45 | |
| 4 | Reverse facility location problems | 2005 | 42 |
| 5 | 2009 | 36 | |
| 6 | 2006 | 35 | |
| 7 | Results of the First International Contest on Evolutionary Optimisation | 1996 | 30 |
| 8 | 2006 | 30 | |
| 9 | 2003 | 30 | |
| 10 | 2012 | 29 | |
| 11 | 2012 | 26 | |
| 12 | 2008 | 25 | |
| 13 | Min-max-min Geometric Facility Location Problems | 2006 | 24 |
| 14 | 2007 | 24 | |
| 15 | 2008 | 23 | |
| 16 | Dynamic optimality for skip lists and B-trees | 2008 | 23 |
| 17 | 2008 | 23 | |
| 18 | 2013 | 23 | |
| 19 | 2008 | 22 | |
| 20 | 2008 | 21 |
About Stefan Langerman
Stefan Langerman is a scholar working on Computer Graphics and Computer-Aided Design, Computational Theory and Mathematics, Signal Processing, Computer Vision and Pattern Recognition and Computer Networks and Communications, having authored 200 papers that have together received 1.6k indexed citations. Recurring topics across this work include Computational Geometry and Mesh Generation (117 papers), Advanced Graph Theory Research (39 papers), Data Management and Algorithms (38 papers), Algorithms and Data Compression (32 papers), Digital Image Processing Techniques (28 papers), Optimization and Search Problems (24 papers), Complexity and Algorithms in Graphs (22 papers) and Optimization and Packing Problems (15 papers). The work is most often cited by research in Computer Graphics and Computer-Aided Design (621 citations), Signal Processing (346 citations), Computational Theory and Mathematics (450 citations), Computer Vision and Pattern Recognition (351 citations) and Computer Networks and Communications (347 citations). Stefan Langerman has collaborated with scholars based in Belgium, United States and Canada. Frequent co-authors include John Iacono, Erik D. Demaine, Pat Morin, Jean Cardinal, Sébastien Collette, Greg Aloupis, Godfried Toussaint, Prosenjit K. Bose, Jeff Erickson and Ferrán Hurtado. Their work appears in journals such as Computational Geometry, Discrete & Computational Geometry, Algorithmica, Graphs and Combinatorics and Lecture notes in computer science.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.