Emo Welzl

Q: What Schools Are Affiliated With Emo Welzl

Emo Welzl is affiliated with the following schools: ETH Zurich, Graz University of Technology, Free University of Berlin, University of Graz

Emo Welzl's AcademicInfluence.com Rankings

Emo Welzl

Computer Science

#1267

World Rank

#1308

Historical Rank

Database

#4684

World Rank

#4867

Historical Rank

computer-science Degrees

Download Badge

Computer Science

Why Is Emo Welzl Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Emmerich Welzl is a computer scientist known for his research in computational geometry. He is a professor in the Institute for Theoretical Computer Science at ETH Zurich in Switzerland. Biography Welzl was born on 4 August 1958 in Linz, Austria. He studied at the Graz University of Technology receiving a Diplom in Applied Mathematics in 1981 and a doctorate in 1983 under the supervision of Hermann Maurer. Following postdoctoral studies at Leiden University, he became a professor at the Free University of Berlin in 1987 at age 28 and was the youngest professor in Germany. Since 1996 he has been professor of Computer Science at the ETH Zurich.

(See a Problem?)

Emo Welzl'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

ɛ-nets and simplex range queries (1987) (698)
Smallest enclosing disks (balls and ellipsoids) (1991) (665)
Epsilon-nets and simplex range queries (1986) (454)
A subexponential bound for linear programming (1992) (439)
Combinatorial complexity bounds for arrangements of curves and spheres (1990) (351)
Constructing the Visibility Graph for n-Line Segments in O(n²) Time (1985) (306)
Congruence, similarity, and symmetries of geometric objects (1987) (293)
Capacity of Arbitrary Wireless Networks (2009) (267)
Space-Filling Curves and Their Use in the Design of Geometric Data Structures (1997) (223)
A Combinatorial Bound for Linear Programming and Related Problems (1992) (221)
Euclidean minimum spanning trees and bichromatic closest pairs (1990) (191)
Quasi-optimal range searching in spaces of finite VC-dimension (1989) (190)
New methods for computing visibility graphs (1988) (160)
Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity (1986) (158)
Fat Triangles Determine Linearly Many Holes (1994) (149)
Quasi-optimal upper bounds for simplex range searching and new zone theorems (1990) (149)
Discrepancy and approximations for bounded VC-dimension (1991) (130)
How to net a lot with little: small ε-nets for disks and halfspaces (1990) (125)
Running Time Analysis of Multi-objective Evolutionary Algorithms on a Simple Discrete Optimization Problem (2002) (124)
Constructing Belts in Two-Dimensional Arrangements with Applications (1986) (112)
Partition trees for triangle counting and other range searching problems (1988) (109)
Using String Languages to Describe Picture Languages (1982) (108)
Stabbing line segments (1982) (101)
The rank of sparse random matrices over finite fields (1997) (101)
On the Number of Line Separations of a Finite Set in the Plane (1985) (94)
On the number of crossing-free matchings, (cycles, and partitions) (2006) (92)
Drawing graphs in the plane with high resolution (1990) (92)
Convex Quadrilaterals and k-Sets (2003) (91)
Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time (1986) (88)
Online conflict-free coloring for intervals (2005) (88)
Catching elephants with mice: Sparse sampling for monitoring sensor networks (2009) (88)
Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings (2007) (85)
Unique sink orientations of cubes (2001) (80)
Improved bounds on weak ε-nets for convex sets (1993) (79)
Polynomial Graph-Colorings (1989) (79)
The Discrete 2-Center Problem (1997) (74)
Rectilinear and polygonal p-piercing and p-center problems (1996) (73)
Color-Families are Dense (1982) (70)
Linear Programming - Randomization and Abstract Frameworks (1996) (66)
On Spanning Trees with Low Crossing Numbers (1992) (66)
Cutting dense point sets in half (1994) (62)
Combinatorial and Computational Geometry (2011) (62)
On the Complexity of the General Coloring Problem (1981) (61)
Drawing Planar Graphs Using the Canonical Ordering (1996) (60)
More onk-sets of finite sets in the plane (1986) (58)
Visibility graphs and obstacle-avoiding shortest paths (1988) (54)
Symmetric graphs and interpretations (1984) (53)
Partitioning and geometric embedding of range spaces of finite Vapnik-Chervonenkis dimension (1987) (53)
Implicitly representing arrangements of lines or segments (2011) (51)
Boundary Graph Grammars with Dynamic Edge Relabeling (1990) (48)
A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization (2001) (48)
Space Filling Curves and Their Use in the Design of Geometric Data Structures (1995) (47)
Results on k-sets and j-facets via continuous motion (1998) (47)
Fast greedy triangulation algorithms (1994) (45)
Voronoi diagrams of lines in 3-space under polyhedral convex distance functions (1995) (45)
Random triangulations of planar point sets (2006) (45)
Interference in Cellular Networks: The Minimum Membership Set Cover Problem (2005) (45)
Complexity and Decidability for Chain Code Picture Languages (1985) (43)
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique (2011) (43)
String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing (1987) (40)
Counting Plane Graphs: Flippability and Its Applications (2010) (40)
Minimal enclosing parallelogram with application (1995) (35)
Quantum technology: from research to application (2016) (35)
Entering and leaving j-facets (2001) (35)
Trace Languages Defined by Regular String Languages (1986) (34)
Vapnik-Chervonenkis dimension and (pseudo-)hyperplane arrangements (1994) (33)
A Continuous Analogue of the Upper Bound Theorem (2001) (32)
Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane (1987) (31)
Contour Edge Analysis for Polyhedron Projections (1997) (31)
On simultaneous inner and outer approximation of shapes (1990) (31)
Good splitters for counting points in triangles (1989) (30)
Exact Minkowski sums of polyhedra and exact and efficient decomposition of polyhedra in convex pieces (2007) (30)
On the maximal number of edges of many faces in an arrangement (1986) (29)
Surface Reconstruction Between Simple Polygons via Angle Criteria (1993) (28)
Approximation of Convex Figures by Pairs of Rectangles (1990) (27)
One line and n points (2003) (27)
Algorithms for center and Tverberg points (2004) (26)
In between k -Sets, j -Facets, and i -Faces: (i ,j) - Partitions (2002) (26)
Combinatorial properties of boundary NLC graph languages (1987) (26)
Chain code picture languages (1982) (25)
Algorithmic complexity of protein identification: combinatorics of weighted strings (2004) (25)
Point-line incidences in space (2002) (24)
The Number of Triangulations on Planar Point Sets (2006) (24)
The Lovász Local Lemma and Satisfiability (2009) (24)
On degrees in random triangulations of point sets (2010) (24)
The Bounded Degree Problem for NLC Grammars is Decidable (1986) (24)
Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes (2003) (23)
Translating a Planar Object to Maximize Point Containment (2002) (21)
Improved Bounds on Weak epsilon-Nets for Convex Sets (1995) (21)
Weaving patterns of lines and line segments in space (1993) (20)
Packing Plane Spanning Trees and Paths in Complete Geometric Graphs (2017) (20)
Random sampling in geometric optimization: new insights and applications (2000) (15)
Simultaneous inner and outer approximation of shapes (2005) (15)
Counting Plane Graphs with Exponential Speed-Up (2011) (15)
Shortest paths for line segments (2015) (15)
Enumerating Triangulation Paths (2001) (14)
Fat triangles determine linearly many holes (computational geometry) (1991) (14)
ARRIVAL: A Zero-Player Graph Game in NP ∩ coNP (2016) (14)
The complexity of cutting paper (extended abstract) (1985) (14)
Number of Crossing-Free Geometric Graphs vs. Triangulations (2008) (13)
One Sided Error Predicates in Geometric Computing (1998) (12)
Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection (1993) (12)
Automata, Languages and Programming (2002) (11)
Off-line Admission Control for Advance Reservations in Star Networks (2004) (11)
Order on Order Types (2018) (11)
Explicit and Implicit Enforcing - Randomized Optimization (2001) (11)
Efficient parallel computation of arrangements of hyperplanes in d dimensions (1990) (11)
Two Way Finite State Generators (1983) (10)
Balanced lines, halving triangles, and the generalized lower bound theorem (2001) (10)
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices (2018) (10)
K-sets and j-facets - A tour of discrete geometry (1997) (10)
Gram's Equation - A Probabilistic Proof (1994) (10)
Lower bounds for searching robots, some faulty (2017) (10)
Encoding Graphs by Derivations and Implications for the Theory of Graph Grammars (1984) (9)
Weaving Patterns of Lines and Segments in Space (1990) (9)
Boundary NlC and partition controlled graph grammars (1986) (8)
On the Set of all Subgraphs of the Graphs in a Boundary NLC Graph Language (1986) (8)
New nomogram for foetal weight estimation based on Hadlock's two-parameter formula. (2004) (8)
Graph theoretic closure properties of the family of boundary NLC graph languages (1986) (7)
Point–Line Incidences in Space (2004) (7)
Algorithms for center and Tverberg points (2008) (7)
A quasi-PTAS for profit-maximizing pricing on line graphs (2007) (7)
On the Number of Upward Planar Orientations of Maximal Planar Graphs (2012) (6)
Catching elephants with mice: sparse sampling for monitoring sensor networks (2007) (6)
The Post Office Problem for Fuzzy Point Sets (1991) (6)
Computing the girth of a planar graph (2000) (6)
Connectivity of Triangulation Flip Graphs in the Plane (2020) (5)
Tail estimates for the space complexity of randomized incremental algorithms (1992) (5)
Recurrent Words and Simultaneous Growth in T0L Systems (1985) (5)
A class of point-sets with few k-sets (2000) (4)
Denseness, maximality, and decidability of grammatical families (1986) (4)
One line and <italic>ε</italic> (2001) (4)
Crossing-free segments and triangles in point configurations (2001) (4)
Crossing-Free Perfect Matchings in Wheel Point Sets (2017) (4)
Minimal Representations of Order Types by Geometric Graphs (2019) (4)
Boundary NLC Grammars (1984) (3)
String grammars with disconnecting (1985) (3)
On a simple sampling lemma (2000) (3)
Minimal Geometric Graph Representations of Order Types (2018) (3)
Proceedings of the 27th International Colloquium on Automata, Languages and Programming (2000) (3)
On the number of crossing-free partitions (2013) (3)
Algorithmic Complexity of Protein Identification: Searching in Weighted Strings (2002) (3)
Counting Simple Polygonizations of Planar Point Sets (2011) (2)
Piecewise linear approximation of Be´zier-curves (1997) (2)
Convex Hulls of Random Order Types (2020) (2)
Results on -Sets and -Facets via Continuous Motion (1997) (2)
An Optimal Decentralized $(Δ+ 1)$-Coloring Algorithm (2020) (2)
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane (2014) (2)
On the Number of Equal-Sized Semisapces of a Set of Points in the Plane (Extended Abstract) (1983) (2)
A simple method for solving 2-dimensional static range searching (1985) (1)
Ranking intervals under visibility constraints (1990) (1)
The Smallest Enclosing Circle - A Contribution to Democracy from Switzerland? (2011) (1)
Discrete and Computational Geometry (Mathematical Sciences Research Institute Publications) (2005) (1)
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems (2017) (1)
Clustering under Perturbation Stability in Near-Linear Time (2020) (1)
Linear programming (2018) (1)
Editorial (2017) (1)
Automata, languages and programming : 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000 : proceedings (2000) (1)
Origin-embracing distributions or a continuous analogue of the upper bound theorem (2000) (1)
Order on Order Types (2017) (1)
New Results on Linear Programming and Related Problems (1992) (1)
A zero-player graph game in NP $\cap$ coNP (2016) (0)
Probability , and Computing Fall 2012 Exercise Sheet 3-Master Solution Exercise 1-Comparisons in Quicksort (2013) (0)
Combinatorics and Probability (2009) (0)
Geometric Optimization and Unique Sink Orientations of Cubes p (2004) (0)
Approximate Methods in Geometry Lecture Notes (2005) (0)
49 LINEAR PROGRAMMING (2017) (0)
Probability , and Computing Solutions KW 42 HS 16 Solution of in-class exercise 1 : Number of Cells in Arrangements (2016) (0)
Quantum technology: from research to application (2016) (0)
SERIE B INFORMATIK Voronoi Diagrams of Lines in Space Under Polyhedral Convex Distance Functions (2009) (0)
Probability , and Computing Solutions KW 45 HS 16 Solution 1 : Randomized Algebraic Algorithms (2016) (0)
SERIE B INFORMATIK Fast Greedy Triangulation Algorithms (2009) (0)
Contour Edge Analysis for PolyhedronProjectionsLutz Kettner and Emo Welzl ? (1997) (0)
When Conflicting Constraints Can Be Resolved - The Lovász Local Lemma and Satisfiability (2010) (0)
Probability , and Computing Solutions for SPA 1 HS 18 Solution (2018) (0)
Results on -facets via continuous motion (1998) (0)
Reading Assignment for PreDoc Course on Randomized Algorithms (2000) (0)
n Points and One Line: Analysis of Randomized Games (2000) (0)
On Connectivity in Random Graph Models with Limited Dependencies (2023) (0)
An Optimal Decentralized $(\Delta + 1)$-Coloring Algorithm (2020) (0)
Probability , and Computing Solutions for SPA 1 HS 17 Solution 1 : From Ancestors to Parents (2017) (0)
Guest editor’s foreword (1996) (0)
Algorithms, Probability, and Computing Special Assignment 1 Hs14 (2014) (0)
Solution of in-class exercise 1 : Bounding a sequence (2016) (0)
Computational Geometry (Dagstuhl Seminar 9312) (2021) (0)
50 LINEAR PROGRAMMING (2016) (0)
Algorithmic complexity of protein identification (2001) (0)
On the Density of Color-Families (1981) (0)
Proceedings of the 15th annual European conference on Algorithms (2007) (0)
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices (2019) (0)
On the Number of Lattice Triangulations (2006) (0)
Solving and Sampling with Many Solutions (2019) (0)
38 LINEAR PROGRAMMING (1997) (0)
Computational Geometry (Dagstuhl Seminar 9141) (2021) (0)
Bistellar and Edge Flip Graphs of Triangulations in the Plane - Geometry and Connectivity. (2019) (0)
Solving and Sampling with Many Solutions (2019) (0)
The Number of Crossing Free Configurations on Finite Point Sets in the Plane (2006) (0)
Algorithmi Complexity of Protein Identi ation : Combinatori s of Weighted StringsTECHNICAL (2004) (0)
Monotone Edge Sequences in Line Arrangements and Applications (Extended Abstract) (1984) (0)
Basics of Probabilistic Analysis for the APC-Lecture Emo Welzl (2007) (0)
Probability , and Computing Solutions KW 40 HS 15 General rules for solving exercises (2014) (0)
Foreword (2008) (0)

This paper list is powered by the following services:

Other Resources About Emo Welzl

en.wikipedia.org

What Schools Are Affiliated With Emo Welzl?

Emo Welzl is affiliated with the following schools: