Skip to search formSkip to main contentSkip to account menu

Emo Welzl

Known as: Emmerich Welzl, Welzl 
Emmerich (Emo) Welzl (born 4 August 1958 in Linz, Austria) is a computer scientist known for his research in computational geometry. He is a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

17 relations
Bounding sphereComputational geometryComputational learning theoryData structure

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
New Lower Bounds for epsilon-Nets
Following groundbreaking work by Haussler and Welzl (1987), the use of small epsilon-nets has become a standard technique for… 
Review
2007
Review
2007
Emotion and Emotion Regulation: A Map for Psychotherapy Researchers
Never before has the pace of research on emotion and emotion regulation been as vigorous as it is today. This news is welcomed by… 
2004
2004
Cutting out Polygons with Lines and Rays
We present approximation algorithms for cutting out polygons with line cuts and ray cuts Our results answer a number of open… 
2003
2003
Multicolour Discrepancies
In this article we introduce combinatorial multicolour discrepancies and generalize several classical results from $2$-colour… 
Review
2002
Review
2002
The Random‐Facet simplex algorithm on combinatorial cubes
  • B. Gärtner
  • Random Struct. Algorithms
  • 2002
  • Corpus ID: 14010641
The RANDOM‐FACET algorithm is a randomized variant of the simplex method which is known to solve any linear program with n… 
Highly Cited
2001
Highly Cited
2001
Effect of crop-specific field management and N fertilization on N2O emissions from a fine-loamy soil
Agricultural soils are a major source of atmospheric N2O. This study was conducted to determine the effect of different crop… 
1999
1999
Remarks on k-Level Algorithms in the Plane
In light of recent developments, this paper reexamines the fundamental geometric problem of how to construct the k-level in an… 
Review
1995
Review
1995
A survey of linear programming in randomized subexponential time
Three papers were published in 1992, each providing a combinatorial, randomized algorithm solving linear programming in… 
Highly Cited
1989
Highly Cited
1989
An optimal visibility graph algorithm for triangulated simple polygons
LetP be a triangulated simple polygon withn sides. The visibility graph ofP has an edge between every pair of polygon vertices… 
1988
1988
Two solvable cases of the Traveling Salesman Problem
In the Euclidean Traveling Salesman Problem, a set of points in the plane is given, and we look for a shortest closed curve… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)