D-Index & Metrics Best Publications
Mathematics
Switzerland
2022

D-Index & Metrics D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines.

Discipline name D-index D-index (Discipline H-index) only includes papers and citation values for an examined discipline in contrast to General H-index which accounts for publications across all disciplines. Citations Publications World Ranking National Ranking
Mathematics D-index 55 Citations 9,726 173 World Ranking 586 National Ranking 11
Computer Science D-index 55 Citations 9,737 173 World Ranking 2913 National Ranking 73

Research.com Recognitions

Awards & Achievements

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

What is he best known for?

The fields of study he is best known for:

  • Geometry
  • Combinatorics
  • Discrete mathematics

His main research concerns Combinatorics, Discrete mathematics, Computational geometry, Set and Data structure. He is interested in Binary logarithm, which is a field of Combinatorics. His Discrete mathematics study integrates concerns from other disciplines, such as Simplex, Range searching and Combinatorial complexity.

His work carried out in the field of Computational geometry brings together such families of science as Range and Plane. His Set research is multidisciplinary, relying on both Space and Structure. While the research belongs to areas of Data structure, Emo Welzl spends his time largely on the problem of Time complexity, intersecting his research to questions surrounding Range, Linear space, Hypersphere and VC dimension.

His most cited work include:

  • ź-nets and simplex range queries (662 citations)
  • Combinatorial complexity bounds for arrangements of curves and spheres (303 citations)
  • A subexponential bound for linear programming (286 citations)

What are the main themes of his work throughout his whole career to date?

Combinatorics, Discrete mathematics, Plane, Upper and lower bounds and General position are his primary areas of study. Emo Welzl is studying Binary logarithm, which is a component of Combinatorics. The various areas that he examines in his Discrete mathematics study include Computational geometry and Point set.

His studies in Plane integrate themes in fields like Line and Finite set. His General position research also works with subjects such as

  • Order type which is related to area like Characterization,
  • Polytope which connect with Linear programming, Dimension and Simplex algorithm. His research investigates the connection between Set and topics such as Space that intersect with issues in Structure.

He most often published in these fields:

  • Combinatorics (75.12%)
  • Discrete mathematics (41.31%)
  • Plane (14.55%)

What were the highlights of his more recent work (between 2011-2020)?

  • Combinatorics (75.12%)
  • Discrete mathematics (41.31%)
  • General position (11.27%)

In recent papers he was focusing on the following fields of study:

Emo Welzl mainly focuses on Combinatorics, Discrete mathematics, General position, Order type and Planar graph. He interconnects Point and Plane in the investigation of issues within Combinatorics. His work on Satisfiability as part of general Discrete mathematics study is frequently linked to Sampling, therefore connecting diverse disciplines of science.

His biological study spans a wide range of topics, including Extreme point and Convex hull, Regular polygon. Emo Welzl usually deals with Convex hull and limits it to topics linked to Polytope and Binary logarithm. His study in Order type is interdisciplinary in nature, drawing from both Characterization and Spatial network.

Between 2011 and 2020, his most popular works were:

  • Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces (86 citations)
  • Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleyn's technique (32 citations)
  • Quantum technology: from research to application (19 citations)

In his most recent research, the most cited papers focused on:

  • Geometry
  • Combinatorics
  • Algebra

His primary areas of investigation include Combinatorics, Discrete mathematics, General position, Upper and lower bounds and Spanning tree. His study in the field of Euclidean shortest path is also linked to topics like Yen's algorithm. Emo Welzl specializes in Discrete mathematics, namely Planar graph.

His research in General position tackles topics such as Order type which are related to areas like Antipodal point, Extreme point, Regular polygon and Distribution. The study incorporates disciplines such as Minimum degree spanning tree, Plane, Point set and Linear algebra in addition to Upper and lower bounds. His research in Spanning tree intersects with topics in 1-planar graph, Spatial network, Dual graph and Graph.

This overview was generated by a machine learning system which analysed the scientist’s body of work. If you have any feedback, you can contact us here.

Best Publications

ź-nets and simplex range queries

David Haussler;Emo Welzl.
Discrete and Computational Geometry (1987)

877 Citations

ź-nets and simplex range queries

David Haussler;Emo Welzl.
Discrete and Computational Geometry (1987)

877 Citations

A subexponential bound for linear programming

Jirí Matousek;Micha Sharir;Micha Sharir;Emo Welzl.
Algorithmica (1996)

475 Citations

A subexponential bound for linear programming

Jirí Matousek;Micha Sharir;Micha Sharir;Emo Welzl.
Algorithmica (1996)

475 Citations

Combinatorial complexity bounds for arrangements of curves and spheres

Kenneth L. Clarkson;Herbert Edelsbrunner;Leonidas J. Guibas;Micha Sharir.
Discrete and Computational Geometry (1990)

430 Citations

Combinatorial complexity bounds for arrangements of curves and spheres

Kenneth L. Clarkson;Herbert Edelsbrunner;Leonidas J. Guibas;Micha Sharir.
Discrete and Computational Geometry (1990)

430 Citations

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

Emo Welzl.
Information Processing Letters (1985)

392 Citations

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

Emo Welzl.
Information Processing Letters (1985)

392 Citations

Congruence, similarity, and symmetries of geometric objects

H. Alt;K. Mehlhorn;H. Wagener;E. Welzl.
symposium on computational geometry (1987)

351 Citations

Congruence, similarity, and symmetries of geometric objects

H. Alt;K. Mehlhorn;H. Wagener;E. Welzl.
symposium on computational geometry (1987)

351 Citations

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

Contact us

Best Scientists Citing Emo Welzl

Micha Sharir

Micha Sharir

Tel Aviv University

Publications: 248

Pankaj K. Agarwal

Pankaj K. Agarwal

Duke University

Publications: 111

János Pach

János Pach

Alfréd Rényi Institute of Mathematics

Publications: 84

Boris Aronov

Boris Aronov

New York University

Publications: 59

Sariel Har-Peled

Sariel Har-Peled

University of Illinois at Urbana-Champaign

Publications: 52

Leonidas J. Guibas

Leonidas J. Guibas

Stanford University

Publications: 51

Mark de Berg

Mark de Berg

Eindhoven University of Technology

Publications: 48

Jiří Matoušek

Jiří Matoušek

Charles University

Publications: 47

Bernard Chazelle

Bernard Chazelle

Princeton University

Publications: 46

Michael T. Goodrich

Michael T. Goodrich

University of California, Irvine

Publications: 45

David Eppstein

David Eppstein

University of California, Irvine

Publications: 44

Herbert Edelsbrunner

Herbert Edelsbrunner

Institute of Science and Technology Austria

Publications: 44

Joseph S. B. Mitchell

Joseph S. B. Mitchell

Stony Brook University

Publications: 38

Timothy M. Chan

Timothy M. Chan

University of Illinois at Urbana-Champaign

Publications: 37

Marc van Kreveld

Marc van Kreveld

Utrecht University

Publications: 36

Magnús M. Halldórsson

Magnús M. Halldórsson

Reykjavík University

Publications: 35

Trending Scientists

Timothy D. Wilkinson

Timothy D. Wilkinson

University of Cambridge

Dor Ben-Amotz

Dor Ben-Amotz

Purdue University West Lafayette

Menny Shalom

Menny Shalom

Ben-Gurion University of the Negev

Milan Gelnar

Milan Gelnar

Masaryk University

Paramu L. Mafongoya

Paramu L. Mafongoya

University of KwaZulu-Natal

Janet Braam

Janet Braam

Rice University

Isao Koike

Isao Koike

University of the Ryukyus

Thierry Bal

Thierry Bal

Centre national de la recherche scientifique, CNRS

Srikantan S. Nagarajan

Srikantan S. Nagarajan

University of California, San Francisco

Dirceu Solé

Dirceu Solé

Federal University of Sao Paulo

P. Michiel Westenberg

P. Michiel Westenberg

Leiden University

Robert Reid

Robert Reid

University of Queensland

David DiLillo

David DiLillo

University of Nebraska–Lincoln

Michael Torbenson

Michael Torbenson

Mayo Clinic

Lisa Jones

Lisa Jones

University of Worcester

Fernando G. Benavides

Fernando G. Benavides

Pompeu Fabra University

Something went wrong. Please try again later.