Emo Welzl

According to our database1, Emo Welzl
  • authored at least 172 papers between 1981 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
Packing plane spanning trees and paths in complete geometric graphs.
Inf. Process. Lett., 2017

Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems.
CoRR, 2017

Lower Bounds for Searching Robots, some Faulty.
CoRR, 2017

Packing Plane Spanning Trees and Paths in Complete Geometric Graphs.
CoRR, 2017

From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
A zero-player graph game in NP $\cap$ coNP.
CoRR, 2016

2015
Order on Order Types.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
On the number of upward planar orientations of maximal planar graphs.
Theor. Comput. Sci., 2014

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Discrete Mathematics & Theoretical Computer Science, 2014

Editorial.
Comput. Geom., 2014

Packing Plane Spanning Trees and Paths in Complete Geometric Graphs.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleyn's technique.
J. Comb. Theory, Ser. A, 2013

On the number of crossing-free partitions.
Comput. Geom., 2013

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
On the Number of Upward Planar Orientations of Maximal Planar Graphs.
Proceedings of the Algorithms and Computation - 23rd International Symposium, 2012

Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique.
Proceedings of the Symposuim on Computational Geometry 2012, 2012

2011
On degrees in random triangulations of point sets.
J. Comb. Theory, Ser. A, 2011

Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique
CoRR, 2011

Counting Plane Graphs: Flippability and Its Applications.
Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Counting Simple Polygonizations of Planar Point Sets.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Counting Plane Graphs with Exponential Speed-Up.
Proceedings of the Rainbow of Computer Science, 2011

The Smallest Enclosing Circle - A Contribution to Democracy from Switzerland?
Proceedings of the Algorithms Unplugged, 2011

2010
Counting Plane Graphs: Flippability and its Applications
CoRR, 2010

When Conflicting Constraints Can Be Resolved - The Lovász Local Lemma and Satisfiability.
Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

On degrees in random triangulations of point sets.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009
Catching elephants with mice: Sparse sampling for monitoring sensor networks.
TOSN, 2009

Counting Triangulations of Planar Point Sets
CoRR, 2009

Foreword.
Algorithmica, 2009

Capacity of Arbitrary Wireless Networks.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

The Lovász Local Lemma and Satisfiability.
Proceedings of the Efficient Algorithms, 2009

2008
Kleinster umschließender Kreis. (Ein Demokratiebeitrag aus der Schweiz?)
Proceedings of the Taschenbuch der Algorithmen, 2008

Algorithms for center and Tverberg points.
ACM Trans. Algorithms, 2008

Number of Crossing-Free Geometric Graphs vs. Triangulations.
Electronic Notes in Discrete Mathematics, 2008

2007
Online Conflict-Free Coloring for Intervals.
SIAM J. Comput., 2007

Catching elephants with mice: sparse sampling for monitoring sensor networks.
Proceedings of the 5th International Conference on Embedded Networked Sensor Systems, 2007

2006
On the Number of Crossing-Free Matchings, Cycles, and Partitions.
SIAM J. Comput., 2006

On the number of crossing-free matchings, (cycles, and partitions).
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

The Number of Triangulations on Planar Point Sets.
Proceedings of the Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, 2006

The Number of Crossing Free Configurations on Finite Point Sets in the Plane.
Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Random triangulations of planar point sets.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
Online conflict-free coloring for intervals.
Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Interference in Cellular Networks: The Minimum Membership Set Cover Problem.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
Linear programming.
Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Algorithmic complexity of protein identification: combinatorics of weighted strings.
Discrete Applied Mathematics, 2004

Point-Line Incidences in Space.
Combinatorics, Probability & Computing, 2004

Off-line Admission Control for Advance Reservations in Star Networks.
Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Geometric Optimization and Unique Sink Orientations of Cubes p.
Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

Algorithms for center and Tverberg points.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003
Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes.
Fundam. Inform., 2003

In between k -Sets, j -Facets, and i -Faces: (i , j) - Partitions.
Discrete & Computational Geometry, 2003

2002
Running Time Analysis of Multi-objective Evolutionary Algorithms on a Simple Discrete Optimization Problem.
Proceedings of the Parallel Problem Solving from Nature, 2002

Algorithmic Complexity of Protein Identification: Searching in Weighted Strings.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes.
Proceedings of the Graph Transformation, First International Conference, 2002

Translating a Planar Object to Maximize Point Containment.
Proceedings of the Algorithms, 2002

Point-line incidences in space.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

2001
Entering and Leaving j-Facets.
Discrete & Computational Geometry, 2001

A Continuous Analogue of the Upper Bound Theorem.
Discrete & Computational Geometry, 2001

A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization.
Discrete & Computational Geometry, 2001

Crossing-free segments and triangles in point configurations.
Discrete Applied Mathematics, 2001

Enumerating triangulation paths.
Comput. Geom., 2001

One line and n points.
Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Unique Sink Orientations of Cubes.
Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

Balanced lines, halving triangles, and the generalized lower bound theorem.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

Explicit and Implicit Enforcing - Randomized Optimization.
Proceedings of the Computational Discrete Mathematics, Advanced Lectures, 2001

2000
On a simple sampling lemma.
Electr. Notes Theor. Comput. Sci., 2000

A class of point-sets with few k-sets.
Comput. Geom., 2000

n Points and One Line: Analysis of Randomized Games.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Origin-embracing distributions or a continuous analogue of the upper bound theorem.
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

Random sampling in geometric optimization: new insights and applications.
Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

Enumerating Triangulation Paths.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1998
Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions.
J. Algorithms, 1998

The Discrete 2-Center Problem.
Discrete & Computational Geometry, 1998

Approximation of convex figures by pairs of rectangles.
Comput. Geom., 1998

One Sided Error Predicates in Geometric Computing.
Proceedings of the Fundamentals - Foundations of Computer Science, 1998

Results on k-Sets and j-Facets via Continuous Motion.
Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997
Space-Filling Curves and Their Use in the Design of Geometric Data Structures.
Theor. Comput. Sci., 1997

The rank of sparse random matrices over finite fields.
Random Struct. Algorithms, 1997

Cutting Dense Point Sets in Half.
Discrete & Computational Geometry, 1997

A Comparison of Sequential Delaunay Triangulation Algorithms.
Comput. Geom., 1997

An Experimental Comparison of Four Graph Drawing Algorithms.
Comput. Geom., 1997

Fast Greedy Triangulation Algorithms.
Comput. Geom., 1997

Piecewise Linear Approximation of Bézier-Curves.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

The Discrete 2-Center Problem.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Guest Editor's Foreword.
Discrete & Computational Geometry, 1996

A Subexponential Bound for Linear Programming.
Algorithmica, 1996

Linear Programming - Randomization and Abstract Frameworks.
Proceedings of the STACS 96, 1996

Rectilinear and Polygonal p-Piercing and p-Center Problems.
Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995
Improved Bounds on Weak epsilon-Nets for Convex Sets.
Discrete & Computational Geometry, 1995

Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions.
Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, 1995

Space Filling Curves and Their Use in the Design of Geometric Data Structures.
Proceedings of the LATIN '95: Theoretical Informatics, 1995

Minimal Enclosing Parallelogram with Application.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
Fat Triangles Determine Linearly Many Holes.
SIAM J. Comput., 1994

Surface Reconstruction Between Simple Polygons via Angle Criteria.
J. Symb. Comput., 1994

Vapnik-Chervonenkis Dimension and (Pseudo-)Hyperplane Arrangements.
Discrete & Computational Geometry, 1994

Cutting Dense Point Sets in Half.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Fast Greedy Triangulation Algorithms.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994

Gram's Equation - A Probabilistic Proof.
Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993
Drawing Graphs in the Plane with High Resolution.
SIAM J. Comput., 1993

Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection.
Comput. Geom., 1993

Discrepancy and approximations for bounded VC-dimension.
Combinatorica, 1993

Weaving Patterns of Lines and Line Segments in Space.
Algorithmica, 1993

Shortest Paths for Line Segments.
Algorithmica, 1993

Improved bounds on weak epsilon-nets for convex sets.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Theory of Computing, 1993

Surface Reconstruction Between Simple Polygons via Angle Criteria.
Proceedings of the Algorithms - ESA '93, First Annual European Symposium, Bad Honnef, Germany, September 30, 1993

1992
Good Splitters for Counting Points in Triangles.
J. Algorithms, 1992

Polynomial graph-colorings.
Discrete Applied Mathematics, 1992

Simultaneous Inner and Outer Approximation of Shapes.
Algorithmica, 1992

Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems.
Algorithmica, 1992

New Results on Linear Programming and Related Problems.
Proceedings of the Algorithm Theory, 1992

A Combinatorial Bound for Linear Programming and Related Problems.
Proceedings of the STACS 92, 1992

Tail Estimates for the Space Complexity of Randomized Incremental Algorithms.
Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

On Spanning Trees with Low Crossing Numbers.
Proceedings of the Data Structures and Efficient Algorithms, 1992

A Subexponential Bound for Linear Programming.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991
Discrepancy and epsilon-approximations for bounded VC-dimension
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Fat Triangles Determine Linearly Many Holes
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

The Post Office Problem for Fuzzy Point Sets.
Proceedings of the Computational Geometry, 1991

1990
Boundary Graph Grammars with Dynamic Edge Relabeling.
J. Comput. Syst. Sci., 1990

Combinatorial Complexity Bounds for Arrangement of Curves and Spheres.
Discrete & Computational Geometry, 1990

Approximation of Convex Figures by Pairs of Rectangles.
Proceedings of the STACS 90, 1990

Efficient Parallel Computation of Arrangements of Hyperplanes in d Dimensions.
SPAA, 1990

Weaving Patterns of Lines and Segments in Space.
Proceedings of the Algorithms, 1990

Drawing Graphs in the Plane with High Resolution
Proceedings of the 31st Annual Symposium on Foundations of Computer Science, 1990

How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

On Simultaneous Inner and Outer Approximation of Shapes.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.
Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989
Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.
Theor. Comput. Sci., 1989

Implicitly Representing Arrangements of Lines or Segments.
Discrete & Computational Geometry, 1989

Quasi-Optimal Range Searching in Space of Finite VC-Dimension.
Discrete & Computational Geometry, 1989

Polynomial Graph-Colorings.
Proceedings of the STACS 89, 1989

Good Splitters for Counting Points in Triangles.
Proceedings of the Fifth Annual Symposium on Computational Geometry, 1989

1988
Visibility graphs and obstacle-avoiding shortest paths.
ZOR - Meth. & Mod. of OR, 1988

Congruence, Similarity, and Symmetries of Geometric Objects.
Discrete & Computational Geometry, 1988

Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces
Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Partition Trees for Triangle Counting and Other Range Searching Problems.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

New Methods for Computing Visibility Graphs.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

Implicitly Representing Arrangements of Lines or Segments.
Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987
epsilon-Nets and Simplex Range Queries.
Discrete & Computational Geometry, 1987

Combinatorial properties of boundary NLC graph languages.
Discrete Applied Mathematics, 1987

String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing.
Discrete Applied Mathematics, 1987

Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

Congruence, Similarity, and Symmetries of Geometric Objects.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987

Partitioning and Geometric Embedding of Range Spaces of Finite Vapnik-Chervonenkis Dimension.
Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986
Constructing Belts in Two-Dimensional Arrangements with Applications.
SIAM J. Comput., 1986

On the maximal number of edges of many faces in an arrangement.
J. Comb. Theory, Ser. A, 1986

The Bounded Degree Problem for NLC Grammars is Decidable.
J. Comput. Syst. Sci., 1986

Trace Languages Defined by Regular String Languages.
ITA, 1986

Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time.
Inf. Process. Lett., 1986

Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity
Information and Control, 1986

More on k-Sets of Finite Sets in the Plane.
Discrete & Computational Geometry, 1986

Graph Theoretic Closure Properties of the Family of Boundary NLC Graph Languages.
Acta Inf., 1986

Boundary NlC and partition controlled graph grammars.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1986

Epsilon-Nets and Simplex Range Queries.
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986

1985
Complexity and Decidability for Chain Code Picture Languages.
Theor. Comput. Sci., 1985

Recurrent Words and Simultaneous Growth in T0L Systems.
Theor. Comput. Sci., 1985

On the Number of Line Separations of a Finite Set in the Plane.
J. Comb. Theory, Ser. A, 1985

Constructing the Visibility Graph for n-Line Segments in O(n²) Time.
Inf. Process. Lett., 1985

A simple method for solving 2-dimensional static range searching.
Bulletin of the EATCS, 1985

String grammars with disconnecting.
Proceedings of the Fundamentals of Computation Theory, 1985

The complexity of cutting paper (extended abstract).
Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984
Symmetric graphs and interpretations.
J. Comb. Theory, Ser. B, 1984

Monotone Edge Sequences in Line Arrangements and Applications (Extended Abstract).
Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

Encoding Graphs by Derivations and Implications for the Theory of Graph Grammars.
Proceedings of the Automata, 1984

Boundary NLC Grammars.
Proceedings of the CAAP'84, 1984

1983
On the Number of Equal-Sized Semisapces of a Set of Points in the Plane (Extended Abstract).
Proceedings of the Automata, 1983

Two Way Finite State Generators.
Proceedings of the Fundamentals of Computation Theory, 1983

1982
Using String Languages to Describe Picture Languages
Information and Control, September, 1982

Color-Families are Dense.
Theor. Comput. Sci., 1982

Stabbing Line Segments.
BIT, 1982

Chain code picture languages.
Proceedings of the Graph-Grammars and Their Application to Computer Science, 1982

1981
On the Complexity of the General Coloring Problem
Information and Control, November, 1981

On the Density of Color-Families.
Proceedings of the Automata, 1981


  Loading...