default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDEmo Welzl
Person information
- affiliation: ETH Zurich, Switzerland
- award (1995): Gottfried Wilhelm Leibniz Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j82]Stefan Langerman, Marcelo Mydlarz, Emo Welzl:
Deep Cliques in Point Sets. Discret. Comput. Geom. 72(2): 892-911 (2024)- 2023
- [j81]Xavier Goaoc
, Emo Welzl:
Convex Hulls of Random Order Types. J. ACM 70(1): 8:1-8:47 (2023) - [c97]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: 30:1-30:22 - 2022
- [j80]Uli Wagner, Emo Welzl:
Connectivity of Triangulation Flip Graphs in the Plane. Discret. Comput. Geom. 68(4): 1227-1284 (2022) - 2021
- [j79]Andrey Kupavskii, Emo Welzl:
Lower bounds for searching robots, some faulty. Distributed Comput. 34(4): 229-237 (2021) - 2020
- [j78]Jean Cardinal, Jerri Nummenpalo, Emo Welzl:
Solving and Sampling with Many Solutions. Algorithmica 82(5): 1474-1489 (2020) - [j77]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): 1067-1097 (2020) - [j76]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): 551-572 (2020) - [c96]Xavier Goaoc, Emo Welzl:
Convex Hulls of Random Order Types. SoCG 2020: 49:1-49:15 - [c95]Uli Wagner, Emo Welzl:
Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips). SoCG 2020: 67:1-67:16 - [c94]Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl:
An Optimal Decentralized (Δ + 1)-Coloring Algorithm. ESA 2020: 17:1-17:12 - [c93]Pankaj K. Agarwal, Hsien-Chih Chang, Kamesh Munagala, Erin Taylor, Emo Welzl:
Clustering Under Perturbation Stability in Near-Linear Time. FSTTCS 2020: 8:1-8:16 - [c92]Uli Wagner, Emo Welzl:
Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips). SODA 2020: 2823-2841 - [i13]Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl:
An Optimal Decentralized $(Δ+ 1)$-Coloring Algorithm. CoRR abs/2002.05121 (2020) - [i12]Xavier Goaoc, Emo Welzl:
Convex Hulls of Random Order Types. CoRR abs/2003.08456 (2020) - [i11]Uli Wagner, Emo Welzl:
Connectivity of Triangulation Flip Graphs in the Plane. CoRR abs/2003.13557 (2020) - [i10]Pankaj K. Agarwal, Hsien-Chih Chang, Kamesh Munagala, Erin Taylor, Emo Welzl:
Clustering under Perturbation Stability in Near-Linear Time. CoRR abs/2009.14358 (2020)
2010 – 2019
- 2019
- [c91]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. GD 2019: 101-113 - [i9]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 abs/1908.05124 (2019) - 2018
- [j75]Alexander Pilz, Emo Welzl:
Order on Order Types. Discret. Comput. Geom. 59(4): 886-922 (2018) - [c90]Andrey Kupavskii, Emo Welzl:
Lower Bounds for Searching Robots, some Faulty. PODC 2018: 447-453 - [i8]Alexander Pilz, Emo Welzl, Manuel Wettstein:
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices. CoRR abs/1812.01595 (2018) - 2017
- [j74]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: 35-41 (2017) - [c89]Alexander Pilz, Emo Welzl, Manuel Wettstein:
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices. SoCG 2017: 54:1-54:16 - [c88]Jean Cardinal, Jerri Nummenpalo, Emo Welzl:
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems. IPEC 2017: 11:1-11:12 - [i7]Andrey Kupavskii, Emo Welzl:
Lower Bounds for Searching Robots, some Faulty. CoRR abs/1707.05077 (2017) - [i6]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 abs/1707.05440 (2017) - [i5]Jean Cardinal, Jerri Nummenpalo, Emo Welzl:
Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems. CoRR abs/1708.01122 (2017) - 2016
- [i4]Jérôme Dohrau, Bernd Gärtner, Manuel Kohler, Jirí Matousek, Emo Welzl:
A zero-player graph game in NP $\cap$ coNP. CoRR abs/1605.03546 (2016) - 2015
- [c87]Alexander Pilz, Emo Welzl:
Order on Order Types. SoCG 2015: 285-299 - 2014
- [j73]Michael Hoffmann, Emo Welzl:
Editorial. Comput. Geom. 47(6): 643 (2014) - [j72]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): 317-332 (2014) - [j71]Fabrizio Frati, Joachim Gudmundsson, Emo Welzl:
On the number of upward planar orientations of maximal planar graphs. Theor. Comput. Sci. 544: 32-59 (2014) - [c86]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 - 2013
- [j70]Andreas Razen, Emo Welzl:
On the number of crossing-free partitions. Comput. Geom. 46(7): 879-893 (2013) - [j69]Micha Sharir, Adam Sheffer, Emo Welzl:
Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleyn's technique. J. Comb. Theory A 120(4): 777-794 (2013) - [c85]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 - 2012
- [c84]Micha Sharir, Adam Sheffer, Emo Welzl:
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique. SCG 2012: 189-198 - [c83]Fabrizio Frati, Joachim Gudmundsson, Emo Welzl:
On the Number of Upward Planar Orientations of Maximal Planar Graphs. ISAAC 2012: 413-422 - 2011
- [j68]Micha Sharir, Adam Sheffer, Emo Welzl:
On degrees in random triangulations of point sets. J. Comb. Theory A 118(7): 1979-1999 (2011) - [c82]Andreas Razen, Emo Welzl:
Counting Plane Graphs with Exponential Speed-Up. Rainbow of Computer Science 2011: 36-46 - [c81]Emo Welzl:
Counting Simple Polygonizations of Planar Point Sets. CCCG 2011 - [c80]Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl:
Counting Plane Graphs: Flippability and Its Applications. WADS 2011: 524-535 - [p3]Emo Welzl:
The Smallest Enclosing Circle - A Contribution to Democracy from Switzerland? Algorithms Unplugged 2011: 357-360 - [i3]Micha Sharir, Adam Sheffer, Emo Welzl:
Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique. CoRR abs/1109.5596 (2011) - 2010
- [c79]Micha Sharir, Adam Sheffer, Emo Welzl:
On degrees in random triangulations of point sets. SCG 2010: 297-306 - [c78]Emo Welzl:
When Conflicting Constraints Can Be Resolved - The Lovász Local Lemma and Satisfiability. ICALP (1) 2010: 18 - [i2]Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl:
Counting Plane Graphs: Flippability and its Applications. CoRR abs/1012.0591 (2010)
2000 – 2009
- 2009
- [j67]Lars Arge, Emo Welzl:
Foreword. Algorithmica 55(2): 269-270 (2009) - [j66]Sorabh Gandhi, Subhash Suri, Emo Welzl:
Catching elephants with mice: Sparse sampling for monitoring sensor networks. ACM Trans. Sens. Networks 6(1): 1:1-1:27 (2009) - [c77]Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl:
The Lovász Local Lemma and Satisfiability. Efficient Algorithms 2009: 30-54 - [c76]Olga Goussevskaia, Roger Wattenhofer, Magnús M. Halldórsson, Emo Welzl:
Capacity of Arbitrary Wireless Networks. INFOCOM 2009: 1872-1880 - [i1]Micha Sharir, Adam Sheffer, Emo Welzl:
Counting Triangulations of Planar Point Sets. CoRR abs/0911.3352 (2009) - 2008
- [j65]Andreas Razen, Jack Snoeyink, Emo Welzl:
Number of Crossing-Free Geometric Graphs vs. Triangulations. Electron. Notes Discret. Math. 31: 195-200 (2008) - [j64]Pankaj K. Agarwal, Micha Sharir, Emo Welzl:
Algorithms for center and Tverberg points. ACM Trans. Algorithms 5(1): 5:1-5:20 (2008) - [p2]Emo Welzl:
Kleinster umschließender Kreis. (Ein Demokratiebeitrag aus der Schweiz?). Taschenbuch der Algorithmen 2008: 385-388 - 2007
- [j63]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): 1342-1359 (2007) - [c75]Sorabh Gandhi, Subhash Suri, Emo Welzl:
Catching elephants with mice: sparse sampling for monitoring sensor networks. SenSys 2007: 261-274 - [e2]Lars Arge, Michael Hoffmann, Emo Welzl:
Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings. Lecture Notes in Computer Science 4698, Springer 2007, ISBN 978-3-540-75519-7 [contents] - 2006
- [j62]Micha Sharir, Emo Welzl:
On the Number of Crossing-Free Matchings, Cycles, and Partitions. SIAM J. Comput. 36(3): 695-720 (2006) - [c74]Micha Sharir, Emo Welzl:
Random triangulations of planar point sets. SCG 2006: 273-281 - [c73]Emo Welzl:
The Number of Crossing Free Configurations on Finite Point Sets in the Plane. FSTTCS 2006: 20 - [c72]Emo Welzl:
The Number of Triangulations on Planar Point Sets. GD 2006: 1-4 - [c71]Micha Sharir, Emo Welzl:
On the number of crossing-free matchings, (cycles, and partitions). SODA 2006: 860-869 - 2005
- [c70]Fabian Kuhn, Pascal von Rickenbach, Roger Wattenhofer, Emo Welzl, Aaron Zollinger:
Interference in Cellular Networks: The Minimum Membership Set Cover Problem. COCOON 2005: 188-198 - [c69]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: 545-554 - 2004
- [j61]Micha Sharir, Emo Welzl:
Point-Line Incidences in Space. Comb. Probab. Comput. 13(2): 203-220 (2004) - [j60]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): 27-46 (2004) - [c68]Pankaj K. Agarwal, Micha Sharir, Emo Welzl:
Algorithms for center and Tverberg points. SCG 2004: 61-67 - [c67]Emo Welzl:
Geometric Optimization and Unique Sink Orientations of Cubes p. MFCS 2004: 176 - [c66]Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl:
Off-line Admission Control for Advance Reservations in Star Networks. WAOA 2004: 211-224 - [r1]Martin E. Dyer, Nimrod Megiddo, Emo Welzl:
Linear programming. Handbook of Discrete and Computational Geometry, 2nd Ed. 2004: 999-1014 - 2003
- [j59]Artur Andrzejak, Emo Welzl:
In between k -Sets, j -Facets, and i -Faces: (i , j) - Partitions. Discret. Comput. Geom. 29(1): 105-131 (2003) - [j58]Jurriaan Hage, Tero Harju, Emo Welzl:
Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes. Fundam. Informaticae 58(1): 23-37 (2003) - 2002
- [c65]Micha Sharir, Emo Welzl:
Point-line incidences in space. SCG 2002: 107-115 - [c64]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: 42-53 - [c63]Jurriaan Hage, Tero Harju, Emo Welzl:
Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes. ICGT 2002: 148-160 - [c62]Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl:
Algorithmic Complexity of Protein Identification: Searching in Weighted Strings. IFIP TCS 2002: 143-156 - [c61]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: 44-53 - 2001
- [j57]Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl:
Enumerating triangulation paths. Comput. Geom. 20(1-2): 3-12 (2001) - [j56]Gyula Károlyi, Emo Welzl:
Crossing-free segments and triangles in point configurations. Discret. Appl. Math. 115(1-3): 77-88 (2001) - [j55]Emo Welzl:
Entering and Leaving j-Facets. Discret. Comput. Geom. 25(3): 351-364 (2001) - [j54]Bernd Gärtner, Emo Welzl:
A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization. Discret. Comput. Geom. 25(4): 569-590 (2001) - [j53]Uli Wagner, Emo Welzl:
A Continuous Analogue of the Upper Bound Theorem. Discret. Comput. Geom. 26(2): 205-219 (2001) - [c60]Bernd Gärtner, Emo Welzl:
Explicit and Implicit Enforcing - Randomized Optimization. Computational Discrete Mathematics 2001: 25-46 - [c59]Micha Sharir, Emo Welzl:
Balanced lines, halving triangles, and the generalized lower bound theorem. SCG 2001: 315-318 - [c58]Tibor Szabó, Emo Welzl:
Unique Sink Orientations of Cubes. FOCS 2001: 547-555 - [c57]Bernd Gärtner, József Solymosi, Falk Tschirschnitz, Emo Welzl, Pavel Valtr:
One line and n points. STOC 2001: 306-315 - 2000
- [j52]Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy, Emo Welzl:
A class of point-sets with few k-sets. Comput. Geom. 16(2): 95-101 (2000) - [c56]Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl:
Enumerating Triangulation Paths. CCCG 2000 - [c55]Uli Wagner, Emo Welzl:
Origin-embracing distributions or a continuous analogue of the upper bound theorem. SCG 2000: 50-56 - [c54]Bernd Gärtner, Emo Welzl:
Random sampling in geometric optimization: new insights and applications. SCG 2000: 91-99 - [c53]Emo Welzl:
n Points and One Line: Analysis of Randomized Games. WG 2000: 11-12 - [c52]Bernd Gärtner, Emo Welzl:
On a simple sampling lemma. CATS 2000: 160-169 - [e1]Ugo Montanari, José D. P. Rolim, Emo Welzl:
Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings. Lecture Notes in Computer Science 1853, Springer 2000, ISBN 3-540-67715-1 [contents]
1990 – 1999
- 1998
- [j51]Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl:
Approximation of convex figures by pairs of rectangles. Comput. Geom. 10(2): 77-87 (1998) - [j50]Pankaj K. Agarwal, Micha Sharir, Emo Welzl:
The Discrete 2-Center Problem. Discret. Comput. Geom. 20(3): 287-305 (1998) - [j49]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): 238-255 (1998) - [c51]Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, Emo Welzl:
Results on k-Sets and j-Facets via Continuous Motion. SCG 1998: 192-199 - [c50]Lutz Kettner, Emo Welzl:
One Sided Error Predicates in Geometric Computing. IFIP Congress: Fundamentals - Foundations of Computer Science 1998: 13-26 - 1997
- [j48]Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl:
Fast Greedy Triangulation Algorithms. Comput. Geom. 8: 67-86 (1997) - [j47]Herbert Edelsbrunner, Pavel Valtr, Emo Welzl:
Cutting Dense Point Sets in Half. Discret. Comput. Geom. 17(3): 243-255 (1997) - [j46]Johannes Blömer, Richard M. Karp, Emo Welzl:
The rank of sparse random matrices over finite fields. Random Struct. Algorithms 10(4): 407-419 (1997) - [j45]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): 3-15 (1997) - [c49]Pankaj K. Agarwal, Micha Sharir, Emo Welzl:
The Discrete 2-Center Problem. SCG 1997: 147-155 - [c48]Helmut Alt, Emo Welzl, Barbara Wolfers:
Piecewise Linear Approximation of Bézier-Curves. SCG 1997: 433-435 - [p1]Lutz Kettner, Emo Welzl:
Contour Edge Analysis for Polyhedron Projections. Geometric Modeling 1997: 379-394 - 1996
- [j44]Jirí Matousek, Micha Sharir, Emo Welzl:
A Subexponential Bound for Linear Programming. Algorithmica 16(4/5): 498-516 (1996) - [j43]Emo Welzl:
Guest Editor's Foreword. Discret. Comput. Geom. 16(4): 315 (1996) - [c47]Micha Sharir, Emo Welzl:
Rectilinear and Polygonal p-Piercing and p-Center Problems. SCG 1996: 122-132 - [c46]Bernd Gärtner, Emo Welzl:
Linear Programming - Randomization and Abstract Frameworks. STACS 1996: 669-687 - 1995
- [j42]Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl:
Improved Bounds on Weak epsilon-Nets for Convex Sets. Discret. Comput. Geom. 13: 1-15 (1995) - [c45]Christian Schwarz, Jürgen Teich, Alek Vainshtein, Emo Welzl, Brian L. Evans:
Minimal Enclosing Parallelogram with Application. SCG 1995: C34-C35 - [c44]Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer:
Space Filling Curves and Their Use in the Design of Geometric Data Structures. LATIN 1995: 36-48 - [c43]L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl:
Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. SODA 1995: 197-204 - 1994
- [j41]Bernd Gärtner, Emo Welzl:
Vapnik-Chervonenkis Dimension and (Pseudo-)Hyperplane Arrangements. Discret. Comput. Geom. 12: 399-432 (1994) - [j40]Emo Welzl, Barbara Wolfers:
Surface Reconstruction Between Simple Polygons via Angle Criteria. J. Symb. Comput. 17(4): 351-369 (1994) - [j39]Jirí Matousek, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl:
Fat Triangles Determine Linearly Many Holes. SIAM J. Comput. 23(1): 154-169 (1994) - [c42]Emo Welzl:
Gram's Equation - A Probabilistic Proof. Results and Trends in Theoretical Computer Science 1994: 422-424 - [c41]Herbert Edelsbrunner, Pavel Valtr, Emo Welzl:
Cutting Dense Point Sets in Half. SCG 1994: 203-209 - [c40]Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl:
Fast Greedy Triangulation Algorithms. SCG 1994: 211-220 - 1993
- [j38]János Pach, Richard Pollack, Emo Welzl:
Weaving Patterns of Lines and Line Segments in Space. Algorithmica 9(6): 561-571 (1993) - [j37]Christian Icking, Günter Rote, Emo Welzl, Chee-Keng Yap:
Shortest Paths for Line Segments. Algorithmica 10(2-4): 182-200 (1993) - [j36]Jirí Matousek, Emo Welzl, Lorenz Wernisch:
Discrepancy and approximations for bounded VC-dimension. Comb. 13(4): 455-466 (1993) - [j35]Kurt Mehlhorn, Micha Sharir, Emo Welzl:
Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection. Comput. Geom. 3: 235-246 (1993) - [j34]Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger:
Drawing Graphs in the Plane with High Resolution. SIAM J. Comput. 22(5): 1035-1052 (1993) - [c39]Emo Welzl, Barbara Wolfers:
Surface Reconstruction Between Simple Polygons via Angle Criteria. ESA 1993: 397-408 - [c38]Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl:
Improved bounds on weak epsilon-nets for convex sets. STOC 1993: 495-504 - 1992
- [j33]Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap:
Simultaneous Inner and Outer Approximation of Shapes. Algorithmica 8(5&6): 365-389 (1992) - [j32]Bernard Chazelle, Micha Sharir, Emo Welzl:
Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. Algorithmica 8(5&6): 407-429 (1992) - [j31]Wolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger:
Polynomial graph-colorings. Discret. Appl. Math. 35(1): 29-45 (1992) - [j30]Jirí Matousek, Emo Welzl:
Good Splitters for Counting Points in Triangles. J. Algorithms 13(2): 307-319 (1992) - [c37]Jirí Matousek, Micha Sharir, Emo Welzl:
A Subexponential Bound for Linear Programming. SCG 1992: 1-8 - [c36]Emo Welzl:
On Spanning Trees with Low Crossing Numbers. Data Structures and Efficient Algorithms 1992: 233-249 - [c35]Kurt Mehlhorn, Micha Sharir, Emo Welzl:
Tail Estimates for the Space Complexity of Randomized Incremental Algorithms. SODA 1992: 89-93 - [c34]Micha Sharir, Emo Welzl:
A Combinatorial Bound for Linear Programming and Related Problems. STACS 1992: 569-579 - [c33]Emo Welzl:
New Results on Linear Programming and Related Problems. SWAT 1992: 338-339 - 1991
- [c32]Emo Welzl:
Smallest enclosing disks (balls and ellipsoids). New Results and New Trends in Computer Science 1991: 359-370 - [c31]Franz Aurenhammer, Gerd Stöckl, Emo Welzl:
The Post Office Problem for Fuzzy Point Sets. Workshop on Computational Geometry 1991: 1-11 - [c30]Jirí Matousek, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl:
Fat Triangles Determine Linearly Many Holes. FOCS 1991: 49-58 - [c29]Jirí Matousek, Emo Welzl, Lorenz Wernisch:
Discrepancy and epsilon-approximations for bounded VC-dimension. FOCS 1991: 424-430 - 1990
- [j29]Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl:
Combinatorial Complexity Bounds for Arrangement of Curves and Spheres. Discret. Comput. Geom. 5: 99-160 (1990) - [j28]Herbert Edelsbrunner, Mark H. Overmars, Emo Welzl, Irith Ben-Arroyo Hartman, Jack A. Feldman:
Ranking intervals under visibility constraints. Int. J. Comput. Math. 34(3-4): 129-144 (1990) - [j27]Joost Engelfriet, George Leih, Emo Welzl:
Boundary Graph Grammars with Dynamic Edge Relabeling. J. Comput. Syst. Sci. 40(3): 307-345 (1990) - [c28]Jirí Matousek, Raimund Seidel, Emo Welzl:
How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces. SCG 1990: 16-22 - [c27]Bernard Chazelle, Micha Sharir, Emo Welzl:
Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. SCG 1990: 23-33 - [c26]Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl:
Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. SCG 1990: 203-210 - [c25]Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap:
On Simultaneous Inner and Outer Approximation of Shapes. SCG 1990: 216-224 - [c24]Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger:
Drawing Graphs in the Plane with High Resolution. FOCS 1990: 86-95 - [c23]János Pach, Richard Pollack, Emo Welzl:
Weaving Patterns of Lines and Segments in Space. SIGAL International Symposium on Algorithms 1990: 439-446 - [c22]Torben Hagerup, H. Jung, Emo Welzl:
Efficient Parallel Computation of Arrangements of Hyperplanes in d Dimensions. SPAA 1990: 290-297 - [c21]Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl:
Approximation of Convex Figures by Pairs of Rectangles. STACS 1990: 240-249
1980 – 1989
- 1989
- [j26]Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl:
Implicitly Representing Arrangements of Lines or Segments. Discret. Comput. Geom. 4: 433-466 (1989) - [j25]Bernard Chazelle, Emo Welzl:
Quasi-Optimal Range Searching in Space of Finite VC-Dimension. Discret. Comput. Geom. 4: 467-489 (1989) - [j24]Herbert Edelsbrunner, Günter Rote, Emo Welzl:
Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. Theor. Comput. Sci. 66(2): 157-180 (1989) - [c20]Jirí Matousek, Emo Welzl:
Good Splitters for Counting Points in Triangles. SCG 1989: 124-130 - [c19]Wolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger:
Polynomial Graph-Colorings. STACS 1989: 108-119 - 1988
- [j23]Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl:
Congruence, Similarity, and Symmetries of Geometric Objects. Discret. Comput. Geom. 3: 237-256 (1988) - [j22]Helmut Alt, Emo Welzl:
Visibility graphs and obstacle-avoiding shortest paths. ZOR Methods Model. Oper. Res. 32(3-4): 145-164 (1988) - [c18]Emo Welzl:
Partition Trees for Triangle Counting and Other Range Searching Problems. SCG 1988: 23-33 - [c17]Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl:
Implicitly Representing Arrangements of Lines or Segments. SCG 1988: 56-69 - [c16]Mark H. Overmars, Emo Welzl:
New Methods for Computing Visibility Graphs. SCG 1988: 164-171 - [c15]Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl:
Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces. FOCS 1988: 568-579 - 1987
- [j21]Klaus-Jörn Lange, Emo Welzl:
String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing. Discret. Appl. Math. 16(1): 17-30 (1987) - [j20]Grzegorz Rozenberg, Emo Welzl:
Combinatorial properties of boundary NLC graph languages. Discret. Appl. Math. 16(1): 59-73 (1987) - [j19]David Haussler, Emo Welzl:
epsilon-Nets and Simplex Range Queries. Discret. Comput. Geom. 2: 127-151 (1987) - [c14]Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl:
Congruence, Similarity, and Symmetries of Geometric Objects. SCG 1987: 308-315 - [c13]Noga Alon, David Haussler, Emo Welzl:
Partitioning and Geometric Embedding of Range Spaces of Finite Vapnik-Chervonenkis Dimension. SCG 1987: 331-340 - [c12]Herbert Edelsbrunner, Günter Rote, Emo Welzl:
Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. ICALP 1987: 364-375 - 1986
- [j18]Grzegorz Rozenberg, Emo Welzl:
Graph Theoretic Closure Properties of the Family of Boundary NLC Graph Languages. Acta Informatica 23(3): 289-309 (1986) - [j17]Emo Welzl:
More on k-Sets of Finite Sets in the Plane. Discret. Comput. Geom. 1: 95-100 (1986) - [j16]Grzegorz Rozenberg, Emo Welzl:
Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity. Inf. Control. 69(1-3): 136-167 (1986) - [j15]Herbert Edelsbrunner, Emo Welzl:
Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time. Inf. Process. Lett. 23(6): 289-293 (1986) - [j14]IJsbrand Jan Aalbersberg, Emo Welzl:
Trace Languages Defined by Regular String Languages. RAIRO Theor. Informatics Appl. 20(2): 103-119 (1986) - [j13]Dirk Janssens, Grzegorz Rozenberg, Emo Welzl:
The Bounded Degree Problem for NLC Grammars is Decidable. J. Comput. Syst. Sci. 33(3): 415-422 (1986) - [j12]Herbert Edelsbrunner, Emo Welzl:
On the maximal number of edges of many faces in an arrangement. J. Comb. Theory A 41(2): 159-166 (1986) - [j11]Herbert Edelsbrunner, Emo Welzl:
Constructing Belts in Two-Dimensional Arrangements with Applications. SIAM J. Comput. 15(1): 271-284 (1986) - [c11]David Haussler, Emo Welzl:
Epsilon-Nets and Simplex Range Queries. SCG 1986: 61-71 - [c10]Emo Welzl:
Boundary NlC and partition controlled graph grammars. Graph-Grammars and Their Application to Computer Science 1986: 593-609 - 1985
- [j10]Mark H. Overmars, Emo Welzl:
A simple method for solving 2-dimensional static range searching. Bull. EATCS 25: 31-33 (1985) - [j9]Emo Welzl:
Constructing the Visibility Graph for n-Line Segments in O(n²) Time. Inf. Process. Lett. 20(4): 167-171 (1985) - [j8]Herbert Edelsbrunner, Emo Welzl:
On the Number of Line Separations of a Finite Set in the Plane. J. Comb. Theory A 38(1): 15-29 (1985) - [j7]Klaus-Jörn Lange, Emo Welzl:
Recurrent Words and Simultaneous Growth in T0L Systems. Theor. Comput. Sci. 35: 1-15 (1985) - [j6]Ivan Hal Sudborough, Emo Welzl:
Complexity and Decidability for Chain Code Picture Languages. Theor. Comput. Sci. 36: 173-202 (1985) - [c9]Mark H. Overmars, Emo Welzl:
The complexity of cutting paper (extended abstract). SCG 1985: 316-321 - [c8]Klaus-Jörn Lange, Emo Welzl:
String grammars with disconnecting. FCT 1985: 249-256 - 1984
- [j5]Emo Welzl:
Symmetric graphs and interpretations. J. Comb. Theory B 37(3): 235-244 (1984) - [c7]Grzegorz Rozenberg, Emo Welzl:
Boundary NLC Grammars. CAAP 1984: 257-270 - [c6]Emo Welzl:
Encoding Graphs by Derivations and Implications for the Theory of Graph Grammars. ICALP 1984: 503-513 - [c5]Herbert Edelsbrunner, Emo Welzl:
Monotone Edge Sequences in Line Arrangements and Applications (Extended Abstract). MFCS 1984: 265-272 - 1983
- [c4]Karel Culík II, Emo Welzl:
Two Way Finite State Generators. FCT 1983: 106-114 - [c3]Herbert Edelsbrunner, Emo Welzl:
On the Number of Equal-Sized Semisapces of a Set of Points in the Plane (Extended Abstract). ICALP 1983: 182-187 - 1982
- [j4]Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood:
Stabbing Line Segments. BIT 22(3): 274-281 (1982) - [j3]Hermann A. Maurer, Grzegorz Rozenberg, Emo Welzl:
Using String Languages to Describe Picture Languages. Inf. Control. 54(3): 155-185 (1982) - [j2]Emo Welzl:
Color-Families are Dense. Theor. Comput. Sci. 17: 29-41 (1982) - [c2]Hermann A. Maurer, Grzegorz Rozenberg, Emo Welzl:
Chain code picture languages. Graph-Grammars and Their Application to Computer Science 1982: 232-244 - 1981
- [j1]Hermann A. Maurer, Ivan Hal Sudborough, Emo Welzl:
On the Complexity of the General Coloring Problem. Inf. Control. 51(2): 128-145 (1981) - [c1]Emo Welzl:
On the Density of Color-Families. ICALP 1981: 68-72
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
