Stefan Langerman | Academic Influence

Stefan Langerman's AcademicInfluence.com Rankings

Stefan Langerman

Computer Science

#7477

World Rank

#7874

Historical Rank

computer-science Degrees

Stefan Langerman

Mathematics

#6895

World Rank

#9467

Historical Rank

Geometry

#167

World Rank

#240

Historical Rank

Measure Theory

#3955

World Rank

#4663

Historical Rank

mathematics Degrees

Download Badge

Computer Science
Mathematics

Stefan Langerman's Degrees

PhD Computer Science Université libre de Bruxelles
Masters Computer Science Université libre de Bruxelles
Bachelors Mathematics Université libre de Bruxelles

Similar Degrees You Can Earn

Why Is Stefan Langerman Influential?

(Suggest an Edit or Addition)

According to Wikipedia, 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 with Jean Cardinal. He is a director of research for the Belgian Fonds de la Recherche Scientifique .

(See a Problem?)

Stefan Langerman's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Output-Sensitive Algorithms for Computing Nearest-Neighbour Decision Boundaries (2003) (207)
Results of the first international contest on evolutionary optimisation (1st ICEO) (1996) (136)
Covering Things with Things (2002) (75)
Necklaces, Convolutions, and X+Y (2006) (73)
Optimization in Arrangements (2003) (53)
Algorithms for bivariate medians and a fermat-torricelli problem for lines (2003) (53)
Space–Time Trade-offs for Stack-Based Algorithms (2012) (51)
Reverse facility location problems (2005) (50)
Algorithms for Computing Geometric Measures of Melodic Similarity (2006) (47)
The Stackelberg Minimum Spanning Tree Game (2007) (46)
Retroactive data structures (2004) (46)
Facility location problems in the plane based on reverse nearest neighbor queries (2010) (43)
Linear Reconfiguration of Cube-Style Modular Robots (2007) (42)
Output-sensitive algorithms for Tukey depth and related problems (2008) (41)
The Clique Problem in Ray Intersection Graphs (2011) (41)
Dynamic optimality for skip lists and B-trees (2008) (40)
Computing a visibility polygon using few variables (2011) (39)
Dynamic Graph Coloring (2017) (38)
Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D (2008) (38)
Empty region graphs (2009) (37)
Online graph exploration algorithms for cycles and trees by multiple searchers (2014) (35)
Decomposition of Multiple Coverings into More Parts (2008) (35)
Cache-oblivious dynamic dictionaries with update/query tradeoffs (2010) (32)
Min-max-min Geometric Facility Location Problems (2006) (32)
Computing the Maximum Detour and Spanning Ratio of Planar Paths, Trees, and Cycles (2002) (31)
Reconfiguration of Cube-Style Modular Robots Using O(logn) Parallel Moves (2008) (31)
Improved Approximation Bounds for Edge Dominating Set in Dense Graphs (2006) (28)
Coloring Geometric Range Spaces (2009) (28)
Efficient Many-To-Many Point Matching in One Dimension (2007) (27)
Non-crossing matchings of points with geometric objects (2013) (27)
Geodesic Ham-Sandwich Cuts (2004) (27)
A Polynomial Bound for Untangling Geometric Planar Graphs (2007) (26)
PROXIMITY GRAPHS: E, δ, Δ, χ AND ω (2012) (26)
The Complexity of Hyperplane Depth in the Plane (2003) (25)
Locked and Unlocked Chains of Planar Shapes (2006) (24)
Separating point sets in polygonal environments (2004) (23)
Wrapping spheres with flat paper (2009) (22)
Weighted dynamic finger in binary search trees (2016) (22)
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles (2013) (21)
S.T.E.P.: the easiest way to optimize a function (1994) (20)
Every Large Point Set contains Many Collinear Points or an Empty Pentagon (2009) (20)
Proximate point searching (2004) (20)
Morpion Solitaire (2006) (19)
Bichromatic compatible matchings (2012) (19)
Asymmetric Communication Protocols via Hotlink Assignments (2003) (19)
Small weak epsilon nets (2009) (19)
A Tight Analysis of the Maximal Matching Heuristic (2005) (18)
Coloring and Guarding Arrangements (2012) (17)
Common Unfoldings of Polyominoes and Polycubes (2010) (17)
Pricing of Geometric Transportation Networks (2009) (17)
Efficient constant-velocity reconfiguration of crystalline robots** (2011) (17)
Proximate planar point location (2003) (17)
Interlocked open linkages with few joints (2002) (17)
Edge-unfolding nested polyhedral bands (2008) (16)
Competitive Online Search Trees on Trees (2019) (16)
A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing (2010) (15)
Executing code in the past: efficient in-memory object graph versioning (2009) (15)
Combining Binary Search Trees (2013) (14)
Dynamic point location in fat hyperrectangles with integer coordinates (2000) (14)
Dynamic Hotlinks (2005) (14)
Some properties of k-Delaunay and k-Gabriel graphs (2013) (14)
The Power and Limitations of Static Binary Search Trees with Lazy Finger (2013) (14)
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams (2005) (14)
Algorithms for Efficient Filtering in Content-Based Multicast (2001) (14)
Continuous Blooming of Convex Polyhedra (2009) (14)
An optimal algorithm for hyperplane depth in the plane (2000) (14)
Optimal location of transportation devices (2008) (14)
Geometric Restrictions on Producible Polygonal Protein Chains (2003) (13)
Weighted Ham-Sandwich Cuts (2004) (13)
Flat-State Connectivity of Linkages under Dihedral Motions (2002) (13)
Computing a maximal depth point in the plane (2000) (13)
Computing a Geometric Measure of the Similarity Between two Melodies (2003) (13)
Optimal detection of intersections between convex polyhedra (2013) (12)
A Characterization of the degree sequences of 2‐trees (2006) (12)
Threes!, Fives, 1024!, and 2048 are Hard (2015) (12)
Smallest enclosing circle centered on a query line segment (2008) (12)
Determination of All Tessellation Polyhedra with Regular Polygonal Faces (2010) (12)
Near-Entropy Hotlink Assignments (2006) (12)
Interlocked open and closed linkages with few joints (2003) (12)
Subquadratic Algorithms for Algebraic 3SUM (2018) (11)
On the Diameter of Tree Associahedra (2018) (11)
The Complexity of Order Type Isomorphism (2013) (11)
Highway hull revisited (2008) (11)
Subquadratic Encodings for Point Configurations (2018) (10)
Optimizing a 2D Function Satisfying Unimodality Properties (2005) (10)
On the Complexity of Halfspace Area Queries (2001) (10)
Distribution-sensitive point location in convex subdivisions (2008) (10)
Pole Dancing: 3D Morphs for Tree Drawings (2018) (10)
Grid Vertex-Unfolding Orthostacks (2004) (10)
Worst-Case Optimal Tree Layout in a Memory Hierarchy (2004) (10)
Confluently Persistent Tries for Efficient Version Control (2008) (10)
Entropy, triangulation, and point location in planar subdivisions (2009) (9)
Reversible Nets of Polyhedra (2015) (9)
Vertex Pops and Popturns (2007) (9)
The Convex Hull for Random Lines in the Plane (2002) (9)
Realistic Reconfiguration of Crystalline (and Telecube) Robots (2008) (9)
Juggling with Pattern Matching (2006) (9)
Designing Small Keyboards Is Hard (2004) (9)
Executing code in the past: efficient in-memory object graph versioning (2009) (8)
Worst-Case Optimal Tree Layout in External Memory (2004) (8)
Incremental Voronoi Diagrams (2016) (8)
Algorithmic Folding Complexity (2009) (8)
Draining a Polygon - or - Rolling a Ball out of a Polygon (2014) (8)
Implementing Partial Persistence in Object-Oriented Languages (2008) (8)
Blocking coloured point sets (2010) (7)
An Optimal Algorithm to Compute the Inverse Beacon Attraction Region (2018) (7)
Optimal Algorithms for Constrained 1-Center Problems (2014) (7)
Subquadratic Algorithms for Algebraic Generalizations of 3SUM (2016) (7)
Stable Roommates Spanner (2013) (7)
Unfolding polyhedral bands (2004) (7)
Colorful Strips (2009) (7)
A Randomized Incremental Approach for the Hausdorff Voronoi Diagram of Non-crossing Clusters (2013) (7)
Volume Queries in Polyhedra (2000) (7)
Triangulating and Guarding Realistic Polygons (2014) (7)
Moving Walkways, Escalators, and Elevators (2007) (6)
Dynamic Ham-Sandwich Cuts of Convex Polygons in the Plane (2005) (6)
Region counting graphs (2005) (6)
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters (2013) (6)
Matching Points with Things (2010) (6)
Approximating the average stretch factor of geometric graphs (2010) (6)
Computing signed permutations of polygons (2011) (6)
Oja centers and centers of gravity (2013) (6)
Proximate point location (2003) (5)
Computing the Similarity of two Melodies (2003) (5)
Some properties of higher order delaunay and gabriel graphs (2010) (5)
Sigma-local graphs (2010) (5)
Curves in the Sand: Algorithmic Drawing (2006) (5)
Self-Approaching Paths in Simple Polygons (2017) (4)
Which Convex Polyhedra Can Be Made by Gluing Regular Hexagons? (2019) (4)
Polyhedral Characterization of Reversible Hinged Dissections (2018) (4)
De-amortizing Binary Search Trees (2011) (4)
Algorithms and Complexity of Generalized River Crossing Problems (2012) (4)
The dual diameter of triangulations (2015) (4)
Guarding Fat Polygons and Triangulating Guarded Polygons (2007) (4)
Local properties of geometric graphs (2004) (4)
Confluent persistence revisited (2011) (4)
Circle Separability Queries in Logarithmic Time (2012) (4)
Cauchy's Arm Lemma on a Growing Sphere (2008) (4)
Narrow misère Dots-and-Boxes (2012) (3)
Where to build a temple, and where to dig to find one (2006) (3)
Cookie Clicker (2018) (3)
Dynamic Trees with Almost-Optimal Access Cost (2018) (3)
A Center Transversal Theorem for Hyperplanes and Applications to Graph Drawing (2012) (3)
Bust-a-Move/Puzzle Bobble Is NP-complete (2015) (3)
Dynamic ham-sandwich cuts in the plane (2009) (3)
A Complete Classification of Tile-makers (2015) (3)
Searching Edges in the Overlap of Two Plane Graphs (2017) (3)
On the shooter location problem: maintaining dynamic circular-arc graphs (2000) (3)
A Polynomial Bound for Untangling Geometric Planar Graphs (2008) (2)
Belga B-Trees (2019) (2)
Generalized River Crossing Problems (2015) (2)
A 2-chain can interlock with a k-chain (2004) (2)
Region Counting Circles (2005) (2)
Helly Numbers of Polyominoes (2011) (2)
Reconfiguration of 3D Crystalline Robots Using O(log n) Parallel Moves (2009) (2)
Polycube Unfoldings Satisfying Conway ’ s Criterion (2016) (2)
Detecting all regular polygons in a point set (2009) (2)
Space–Time Trade-offs for Stack-Based Algorithms (2014) (1)
Helly Numbers of Polyominoes (2012) (1)
Order type invariant labeling and comparison of point sets (2012) (1)
The four bars problem (2015) (1)
Dynamic Graph Coloring (2018) (1)
LUMINESStrategies (2006) (1)
Computing a high depth point in the plane (2003) (1)
Oja Medians and Centers of Mass (2010) (1)
Short interlocked linkages (2001) (1)
Wrapping the mozartkugel (2007) (1)
A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino (2015) (1)
Encoding 3SUM (2019) (1)
On the Complexity of Halfspace Volume Queries (2003) (1)
Cannibal Animal Games: a new variant of Tic-Tac-Toe (2013) (1)
Ham-sandwich cuts and other tasks in arrangements (2001) (1)
Randomized Optimization: a Probabilistic Analysis (2007) (1)
Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams (2017) (1)
Optimizing some constructions with bars: new geometric knapsack problems (2016) (1)
A Randomized Incremental Algorithm for the Hausdorff Voronoi Diagram of Non-crossing Clusters (2016) (1)
Covering points with lines (2001) (1)
Coloring Dynamic Point Sets on a Line (2012) (1)
LUMINES strategies (2006) (1)
Induced Ramsey-type results and binary predicates for point sets (2017) (1)
Necklaces , Convolutions , and X + Y Citation (2012) (0)
Hotlinks and dictionaries (2008) (0)
Tilers, Tilemakers, Transformers! (2017) (0)
Necklaces, Convolutions, and X+Y (2012) (0)
The Power and Limitations of Static Binary Search Trees with Lazy Finger (2016) (0)
Unfolding Polyhedral (2007) (0)
Covering Points with Disjoint Translates of a Triangle (2018) (0)
Detecting intersections between convex polyhedra (2013) (0)
A Complete List of All Convex Polyhedra Made by Gluing Regular Pentagons (2020) (0)
Belga B-Trees (2020) (0)
Region Counting Distances and Region Counting Circles (2005) (0)
Enumerating All Convex Polyhedra Glued from Squares in Polynomial Time (2021) (0)
Rolling Polyhedra on Tessellations (2022) (0)
Optimizing some constructions with bars: new geometric knapsack problems (2014) (0)
Polyhedral Characterization of Reversible Hinged Dissections (2019) (0)
Editorial (2013) (0)
Dynamic ham-sandwich cuts in the plane Citation (2009) (0)
Online graph exploration algorithms for cycles and trees by multiple searchers (2012) (0)
A Lower Bound for Deterministic Asynchronous Rendez-Vous on the Line (2016) (0)
Computational Geometry: Theory and Applications Dynamic ham-sandwich cuts in the plane ✩ (2009) (0)
C G ] 1 3 Ju n 20 09 Continuous Blooming of Convex Polyhedra (2019) (0)
Oja medians and centers of gravity (2010) (0)
The Four Bars Problem: a Dynamical Systems Perspective (2015) (0)
Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017, July 26-28, 2017, Carleton University, Ottawa, Ontario, Canada (2017) (0)
Quartering a square optimally (2002) (0)
A Characterization of the Degree Sequences of 2-trees (2007) (0)
Efficient object versioning for object-oriented languages from model to language integration (2012) (0)
Subquadratic Algorithms for Algebraic 3SUM (2018) (0)
Sublinear Explicit Incremental Planar Voronoi Diagrams (2020) (0)
Mexican Conference on Discrete Mathematics and Computational Geometry Isoperimetric Enclosures (2014) (0)
Âóóò Áá Blockinóòó (2002) (0)
Computing Signed Permutations of Polygon (2011) (0)
Locked Thick Chains (2009) (0)
Isoperimetric Enclosures (2015) (0)
An Optimal Algorithm for the Hyperplane Depth in R2 (1999) (0)
The Clique Problem in Ray Intersection Graphs (2013) (0)
Isoperimetric Enclosures (2015) (0)
Workshop Committee (2021) (0)
Worst-Case Optimal Tree Layout in External Memory (2014) (0)
Incremental Voronoi Diagrams (2017) (0)
Subquadratic-Space Query-Efficient Data Structures for Realizable Order Types (2017) (0)
On proximity problems in Euclidean spaces (2016) (0)
Randomized Optimization : a Probabilistic Analysis 57 Optimal Prefix and Suffix Queries on Texts (2008) (0)
Cookie Clicker (2019) (0)
Generalized River Crossing Problems (2014) (0)
Fragile Complexity of Adaptive Algorithms (2021) (0)
Which Convex Polyhedra Can Be Made by Gluing Regular Hexagons? (2019) (0)
On the Shooter Location Problem (2000) (0)
Bottleneck detour tree of points on a path (2019) (0)
D ec 2 01 2 Necklaces , Convolutions , and X + (2014) (0)
Toward Unfolding Doubly Covered n-Stars (2018) (0)

This paper list is powered by the following services:

Other Resources About Stefan Langerman

What Schools Are Affiliated With Stefan Langerman?

Stefan Langerman is affiliated with the following schools:

Université libre de Bruxelles