Emo Welzl

ORCID

Publication Activity (10 Years)

Years Active: 1981-2023
Publications (10 Years): 29

Top Venues

CoRR

SoCG

Discret. Comput. Geom.

CCCG

Publications

Xavier Goaoc, Emo Welzl
Convex Hulls of Random Order Types. J. ACM 70 (1) (2023)
Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber, Emo Welzl
On Connectivity in Random Graph Models with Limited Dependencies. APPROX/RANDOM (2023)
Uli Wagner, Emo Welzl
Connectivity of Triangulation Flip Graphs in the Plane. Discret. Comput. Geom. 68 (4) (2022)
Andrey Kupavskii, Emo Welzl
Lower bounds for searching robots, some faulty. Distributed Comput. 34 (4) (2021)
Uli Wagner, Emo Welzl
Connectivity of Triangulation Flip Graphs in the Plane. CoRR (2020)
Jean Cardinal, Jerri Nummenpalo, Emo Welzl
Solving and Sampling with Many Solutions. Algorithmica 82 (5) (2020)
Alexander Pilz, Emo Welzl, Manuel Wettstein
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices. Discret. Comput. Geom. 64 (3) (2020)
Uli Wagner, Emo Welzl
Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips). SoCG (2020)
Xavier Goaoc, Emo Welzl
Convex Hulls of Random Order Types. SoCG (2020)
Pankaj K. Agarwal, Hsien-Chih Chang, Kamesh Munagala, Erin Taylor, Emo Welzl
Clustering under Perturbation Stability in Near-Linear Time. CoRR (2020)
Uli Wagner, Emo Welzl
Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips). SODA (2020)
Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl
An Optimal Decentralized $(Δ+ 1)$-Coloring Algorithm. CoRR (2020)
Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
Minimal Representations of Order Types by Geometric Graphs. J. Graph Algorithms Appl. 24 (4) (2020)
Pankaj K. Agarwal, Hsien-Chih Chang, Kamesh Munagala, Erin Taylor, Emo Welzl
Clustering Under Perturbation Stability in Near-Linear Time. FSTTCS (2020)
Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl
An Optimal Decentralized (Δ + 1)-Coloring Algorithm. ESA (2020)
Xavier Goaoc, Emo Welzl
Convex Hulls of Random Order Types. CoRR (2020)
Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
Minimal Representations of Order Types by Geometric Graphs. CoRR (2019)
Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
Minimal Representations of Order Types by Geometric Graphs. Graph Drawing (2019)
Alexander Pilz, Emo Welzl, Manuel Wettstein
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices. CoRR (2018)
Andrey Kupavskii, Emo Welzl
Lower Bounds for Searching Robots, some Faulty. PODC (2018)
Alexander Pilz, Emo Welzl
Order on Order Types. Discret. Comput. Geom. 59 (4) (2018)
Jean Cardinal, Jerri Nummenpalo, Emo Welzl
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems. CoRR (2017)
Alexander Pilz, Emo Welzl, Manuel Wettstein
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices. SoCG (2017)
Andrey Kupavskii, Emo Welzl
Lower Bounds for Searching Robots, some Faulty. CoRR (2017)
Jean Cardinal, Jerri Nummenpalo, Emo Welzl
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems. IPEC (2017)
Oswin Aichholzer, Thomas Hackl, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Alexander Pilz, Bettina Speckmann, Emo Welzl
Packing Plane Spanning Trees and Paths in Complete Geometric Graphs. CoRR (2017)
Oswin Aichholzer, Thomas Hackl, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Alexander Pilz, Bettina Speckmann, Emo Welzl
Packing plane spanning trees and paths in complete geometric graphs. Inf. Process. Lett. 124 (2017)
Jérôme Dohrau, Bernd Gärtner, Manuel Kohler, Jirí Matousek, Emo Welzl
A zero-player graph game in NP $\cap$ coNP. CoRR (2016)
Alexander Pilz, Emo Welzl
Order on Order Types. SoCG (2015)
Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. Discret. Math. Theor. Comput. Sci. 16 (3) (2014)
Fabrizio Frati, Joachim Gudmundsson, Emo Welzl
On the number of upward planar orientations of maximal planar graphs. Theor. Comput. Sci. 544 (2014)
Michael Hoffmann, Emo Welzl
Editorial. Comput. Geom. 47 (6) (2014)
Oswin Aichholzer, Thomas Hackl, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Alexander Pilz, Bettina Speckmann, Emo Welzl
Packing Plane Spanning Trees and Paths in Complete Geometric Graphs. CCCG (2014)
Micha Sharir, Adam Sheffer, Emo Welzl
Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleyn's technique. J. Comb. Theory, Ser. A 120 (4) (2013)
Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Birgit Vogtenhuber, Emo Welzl
Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. CCCG (2013)
Andreas Razen, Emo Welzl
On the number of crossing-free partitions. Comput. Geom. 46 (7) (2013)
Micha Sharir, Adam Sheffer, Emo Welzl
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique. SCG (2012)
Fabrizio Frati, Joachim Gudmundsson, Emo Welzl
On the Number of Upward Planar Orientations of Maximal Planar Graphs. ISAAC (2012)
Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl
Counting Plane Graphs: Flippability and Its Applications. WADS (2011)
Micha Sharir, Adam Sheffer, Emo Welzl
On degrees in random triangulations of point sets. J. Comb. Theory, Ser. A 118 (7) (2011)
Andreas Razen, Emo Welzl
Counting Plane Graphs with Exponential Speed-Up. Rainbow of Computer Science (2011)
Micha Sharir, Adam Sheffer, Emo Welzl
Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique CoRR (2011)
Emo Welzl
Counting Simple Polygonizations of Planar Point Sets. CCCG (2011)
Micha Sharir, Adam Sheffer, Emo Welzl
On degrees in random triangulations of point sets. SCG (2010)
Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl
Counting Plane Graphs: Flippability and its Applications CoRR (2010)
Emo Welzl
When Conflicting Constraints Can Be Resolved - The Lovász Local Lemma and Satisfiability. ICALP (1) (2010)
Olga Goussevskaia, Roger Wattenhofer, Magnús M. Halldórsson, Emo Welzl
Capacity of Arbitrary Wireless Networks. INFOCOM (2009)
Sorabh Gandhi, Subhash Suri, Emo Welzl
Catching elephants with mice: Sparse sampling for monitoring sensor networks. ACM Trans. Sens. Networks 6 (1) (2009)
Lars Arge, Emo Welzl
Foreword. Algorithmica 55 (2) (2009)
Micha Sharir, Adam Sheffer, Emo Welzl
Counting Triangulations of Planar Point Sets CoRR (2009)
Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl
The Lovász Local Lemma and Satisfiability. Efficient Algorithms (2009)
Pankaj K. Agarwal, Micha Sharir, Emo Welzl
Algorithms for center and Tverberg points. ACM Trans. Algorithms 5 (1) (2008)
Andreas Razen, Jack Snoeyink, Emo Welzl
Number of Crossing-Free Geometric Graphs vs. Triangulations. Electron. Notes Discret. Math. 31 (2008)
Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
Online Conflict-Free Coloring for Intervals. SIAM J. Comput. 36 (5) (2007)
Sorabh Gandhi, Subhash Suri, Emo Welzl
Catching elephants with mice: sparse sampling for monitoring sensor networks. SenSys (2007)
Micha Sharir, Emo Welzl
On the number of crossing-free matchings, (cycles, and partitions). SODA (2006)
Emo Welzl
The Number of Crossing Free Configurations on Finite Point Sets in the Plane. FSTTCS (2006)
Emo Welzl
The Number of Triangulations on Planar Point Sets. Graph Drawing (2006)
Micha Sharir, Emo Welzl
Random triangulations of planar point sets. SCG (2006)
Micha Sharir, Emo Welzl
On the Number of Crossing-Free Matchings, Cycles, and Partitions. SIAM J. Comput. 36 (3) (2006)
Amos Fiat, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
Online conflict-free coloring for intervals. SODA (2005)
Fabian Kuhn, Pascal von Rickenbach, Roger Wattenhofer, Emo Welzl, Aaron Zollinger
Interference in Cellular Networks: The Minimum Membership Set Cover Problem. COCOON (2005)
Pankaj K. Agarwal, Micha Sharir, Emo Welzl
Algorithms for center and Tverberg points. SCG (2004)
Emo Welzl
Geometric Optimization and Unique Sink Orientations of Cubes p. MFCS (2004)
Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl
Algorithmic complexity of protein identification: combinatorics of weighted strings. Discret. Appl. Math. 137 (1) (2004)
Micha Sharir, Emo Welzl
Point-Line Incidences in Space. Comb. Probab. Comput. 13 (2) (2004)
Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl
Off-line Admission Control for Advance Reservations in Star Networks. WAOA (2004)
Artur Andrzejak, Emo Welzl
In between k -Sets, j -Facets, and i -Faces: (i , j) - Partitions. Discret. Comput. Geom. 29 (1) (2003)
Jurriaan Hage, Tero Harju, Emo Welzl
Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes. Fundam. Informaticae 58 (1) (2003)
Micha Sharir, Emo Welzl
Point-line incidences in space. SCG (2002)
Jurriaan Hage, Tero Harju, Emo Welzl
Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes. ICGT (2002)
Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl
Algorithmic Complexity of Protein Identification: Searching in Weighted Strings. IFIP TCS (2002)
Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl
Translating a Planar Object to Maximize Point Containment. ESA (2002)
Marco Laumanns, Lothar Thiele, Eckart Zitzler, Emo Welzl, Kalyanmoy Deb
Running Time Analysis of Multi-objective Evolutionary Algorithms on a Simple Discrete Optimization Problem. PPSN (2002)
Micha Sharir, Emo Welzl
Balanced lines, halving triangles, and the generalized lower bound theorem. SCG (2001)
Emo Welzl
-Facets. Discret. Comput. Geom. 25 (3) (2001)
Bernd Gärtner, Emo Welzl
Explicit and Implicit Enforcing - Randomized Optimization. Computational Discrete Mathematics (2001)
Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl
Enumerating triangulation paths. Comput. Geom. 20 (1-2) (2001)
Tibor Szabó, Emo Welzl
Unique Sink Orientations of Cubes. FOCS (2001)
Bernd Gärtner, József Solymosi, Falk Tschirschnitz, Emo Welzl, Pavel Valtr
One line and n points. STOC (2001)
Gyula Károlyi, Emo Welzl
Crossing-free segments and triangles in point configurations. Discret. Appl. Math. 115 (1-3) (2001)
Uli Wagner, Emo Welzl
A Continuous Analogue of the Upper Bound Theorem. Discret. Comput. Geom. 26 (2) (2001)
Bernd Gärtner, Emo Welzl
A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization. Discret. Comput. Geom. 25 (4) (2001)
Emo Welzl
Points and One Line: Analysis of Randomized Games. WG (2000)
Uli Wagner, Emo Welzl
Origin-embracing distributions or a continuous analogue of the upper bound theorem. SCG (2000)
Bernd Gärtner, Emo Welzl
On a simple sampling lemma. Electron. Notes Theor. Comput. Sci. 31 (2000)
Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl
Enumerating Triangulation Paths. CCCG (2000)
Bernd Gärtner, Emo Welzl
Random sampling in geometric optimization: new insights and applications. SCG (2000)
Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy, Emo Welzl
A class of point-sets with few k-sets. Comput. Geom. 16 (2) (2000)
L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl
Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. J. Algorithms 29 (2) (1998)
Lutz Kettner, Emo Welzl
One Sided Error Predicates in Geometric Computing. IFIP Congress: Fundamentals - Foundations of Computer Science (1998)
Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl
Approximation of convex figures by pairs of rectangles. Comput. Geom. 10 (2) (1998)
Pankaj K. Agarwal, Micha Sharir, Emo Welzl
The Discrete 2-Center Problem. Discret. Comput. Geom. 20 (3) (1998)
Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, Emo Welzl
-Facets via Continuous Motion. SCG (1998)
Pankaj K. Agarwal, Micha Sharir, Emo Welzl
The Discrete 2-Center Problem. SCG (1997)
Helmut Alt, Emo Welzl, Barbara Wolfers
Piecewise Linear Approximation of Bézier-Curves. SCG (1997)
Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl
Fast Greedy Triangulation Algorithms. Comput. Geom. 8 (1997)
Herbert Edelsbrunner, Pavel Valtr, Emo Welzl
Cutting Dense Point Sets in Half. Discret. Comput. Geom. 17 (3) (1997)
Johannes Blömer, Richard M. Karp, Emo Welzl
The rank of sparse random matrices over finite fields. Random Struct. Algorithms 10 (4) (1997)
Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer
Space-Filling Curves and Their Use in the Design of Geometric Data Structures. Theor. Comput. Sci. 181 (1) (1997)

Emo Welzl.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Emo Welzl