World's Best Scientists 2026 revealed!
Award Badge
Mathematics
Switzerland
2026
Award Badge
Computer Science
Switzerland
2025

D-Index & Metrics

Computer Science

D-Index
60
Citations
10841
World Ranking
3302
National Ranking
75

Mathematics

D-Index
59
Citations
10739
World Ranking
604
National Ranking
10

Research.com Recognitions

  • 2026 - Research.com Mathematics in Switzerland Leader Award
  • 2025 - Research.com Computer Science in Switzerland Leader Award
  • 2025 - Research.com Mathematics in Switzerland Leader Award
  • 2022 - Research.com Computer Science in Switzerland Leader Award
  • 2022 - Research.com Mathematics in Switzerland Leader Award
  • 2006 - Member of Academia Europaea
  • 2005 - German National Academy of Sciences Leopoldina - Deutsche Akademie der Naturforscher Leopoldina – Nationale Akademie der Wissenschaften Informatics
  • 1998 - ACM Fellow For orignial contributions in geometric and combinatorial algorithms and for bringing together discrete mathematics and algorithmics.

Overview

Emo Welzl is affiliated with ETH Zurich in Switzerland and has contributed extensively to the fields of computer science and mathematics. Their research predominantly spans computational theory and mathematics, computer graphics and computer-aided design, mathematical physics, computer networks and communications, and applied mathematics.

The scientist's work covers a range of topics including computational geometry and mesh generation, advanced graph theory research, stochastic processes and statistical mechanics, point processes and geometric inequalities, digital image processing techniques, cooperative communication and network coding, as well as optimization and search problems.

Welzl's recent papers include:

  • Convex Hulls of Random Order Types (2022) in Journal of the ACM
  • Connectivity of Triangulation Flip Graphs in the Plane (2022) in Discrete & Computational Geometry
  • Convex Hulls of Random Order Types (2020) in Leibniz-Zentrum für Informatik (Schloss Dagstuhl)
  • Minimal Representations of Order Types by Geometric Graphs (2020) in Journal of Graph Algorithms and Applications
  • Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips) (2020) in Leibniz-Zentrum für Informatik (Schloss Dagstuhl)

Frequent co-authors collaborating with Welzl include Johannes Lengler, Anders Martinsson, Xavier Goaoc, Uli Wagner, and Daniel Bertschinger.

Published work by Welzl is often found in venues such as the Leibniz-Zentrum für Informatik (Schloss Dagstuhl), arXiv (Cornell University), Discrete & Computational Geometry, Journal of the ACM, and Journal of Graph Algorithms and Applications.

In recognition of their contributions, Welzl has been named a Member of Academia Europaea (2006), was inducted into the German National Academy of Sciences Leopoldina in Informatics (2005), and was honored as an ACM Fellow in 1998 for original contributions in geometric and combinatorial algorithms and for bridging discrete mathematics and algorithmics.

Best Publications

  • ź-nets and simplex range queries

    David Haussler;Emo Welzl

  • A subexponential bound for linear programming

    Jirí Matousek;Micha Sharir;Micha Sharir;Emo Welzl

  • Combinatorial complexity bounds for arrangements of curves and spheres

    Kenneth L. Clarkson;Herbert Edelsbrunner;Leonidas J. Guibas;Micha Sharir

  • Constructing the visibility graph for n-line segments in O(n2) time

    Emo Welzl

  • Congruence, similarity, and symmetries of geometric objects

    H. Alt;K. Mehlhorn;H. Wagener;E. Welzl

  • Space-filling curves and their use in the design of geometric data structures

    Tetsuo Asano;Desh Ranjan;Thomas Roos;Emo Welzl

  • Capacity of Arbitrary Wireless Networks

    O. Goussevskaia;R. Wattenhofer;M. M. Halldorsson;E. Welzl

  • Euclidean minimum spanning trees and bichromatic closest pairs

    Pankaj K. Agarwal;Herbert Edelsbrunner;Otfried Schwarzkopf;Emo Welzl

  • A Combinatorial Bound for Linear Programming and Related Problems

    Micha Sharir;Micha Sharir;Emo Welzl

  • Quasi-optimal range searching in spaces of finite VC-dimension

    Bernard Chazelle;Emo Welzl

  • Boundary NLC graph grammars--basic definitions, normal forms, and complexity

    Grzegorz Rozenberg;Emo Welzl

  • New methods for computing visibility graphs

    M. H. Overmars;E. Welzl

  • Fat Triangles Determine Linearly Many Holes

    Jiri Matousek;Janos Pach;Micha Sharir;Shmuel Sifrony

  • How to net a lot with little: small ε-nets for disks and halfspaces

    Jiří Matoušek;Raimund Seidel;E. Welzl

  • Epsilon-nets and simplex range queries

    D Haussler;E Welzl

  • Constructing Belts in Two-Dimensional Arrangements with Applications

    Herbert Edelsbrunner;Emo Welzl

  • Running Time Analysis of Multi-objective Evolutionary Algorithms on a Simple Discrete Optimization Problem

    Marco Laumanns;Lothar Thiele;Eckart Zitzler;Emo Welzl

  • Partition trees for triangle counting and other range searching problems

    E. Welzl

  • A subexponential bound for linear programming

    Jiří Matoušek;Micha Sharir;Emo Welzl

  • Quasi-optimal upper bounds for simplex range searching and new zone theorems

    Bernard Chazelle;Micha Sharir;Emo Welzl

  • Combinatorial and Computational Geometry

    Jacob E. Goodman;Janos Pach;Emo Welzl

  • Convergence, Similarity and Symmetries of Geometric Objects

    Helmut Alt;Kurt Mehlhorn;Hubert Wagener;Emo Welzl

Frequent Co-Authors

Micha Sharir
Micha Sharir Tel Aviv University
Herbert Edelsbrunner
Herbert Edelsbrunner Institute of Science and Technology Austria
Jiří Matoušek
Jiří Matoušek Charles University
János Pach
János Pach Alfréd Rényi Institute of Mathematics
Kurt Mehlhorn
Kurt Mehlhorn Max Planck Institute for Informatics
Günter Rote
Günter Rote Freie Universität Berlin
Pankaj K. Agarwal
Pankaj K. Agarwal Duke University
Grzegorz Rozenberg
Grzegorz Rozenberg Leiden University
Bernard Chazelle
Bernard Chazelle Princeton University
Thomas Erlebach
Thomas Erlebach Durham University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

For students interested in Mathematics, exploring related online degrees can open diverse career opportunities. Beyond pure mathematics, programs like the most affordable online dba programs offer a pathway into data-driven decision-making and business analytics, blending quantitative skills with leadership.

Financial mathematics enthusiasts may find value in pursuing a master of finance online. This degree sharpens financial modeling and risk management skills, essential for roles in banking, investment, and financial technology.

For those leaning towards management roles, enrolling in one of the fastest mba online can accelerate career advancement while equipping students with strategic thinking and leadership capabilities.

Additionally, students with an interest in market analysis and consumer data can consider pursuing an online marketing degree, which combines creativity with analytics and can lead to high-paying roles in digital marketing and brand management.

Best Scientists Citing Emo Welzl

Trending Scientists