Google
Google Scholar
Semantic Scholar
MS Academic
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
- 2020
[j79]Jean Cardinal, Jerri Nummenpalo
, Emo Welzl:
Solving and Sampling with Many Solutions. Algorithmica 82(5): 1474-1489 (2020)- [j78]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) - [j77]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) - [c95]Xavier Goaoc, Emo Welzl:
Convex Hulls of Random Order Types. Symposium on Computational Geometry 2020: 49:1-49:15 - [c94]Uli Wagner, Emo Welzl:
Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips). Symposium on Computational Geometry 2020: 67:1-67:16 - [c93]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 - [c92]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 - [c91]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
- [c90]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: 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
- [j76]Alexander Pilz, Emo Welzl:
Order on Order Types. Discret. Comput. Geom. 59(4): 886-922 (2018) - [c89]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
- [j75]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) - [c88]Alexander Pilz, Emo Welzl, Manuel Wettstein:
From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices. Symposium on Computational Geometry 2017: 54:1-54:16 - [c87]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
- [c86]Alexander Pilz, Emo Welzl:
Order on Order Types. Symposium on Computational Geometry 2015: 285-299 - 2014
- [j74]Michael Hoffmann, Emo Welzl:
Editorial. Comput. Geom. 47(6): 643 (2014) - [j73]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) - [j72]Fabrizio Frati, Joachim Gudmundsson, Emo Welzl:
On the number of upward planar orientations of maximal planar graphs. Theor. Comput. Sci. 544: 32-59 (2014) - [c85]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
- [j71]Andreas Razen, Emo Welzl:
On the number of crossing-free partitions. Comput. Geom. 46(7): 879-893 (2013) - [j70]Micha Sharir, Adam Sheffer, Emo Welzl:
Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleyn's technique. J. Comb. Theory, Ser. A 120(4): 777-794 (2013) - [c84]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
- [c83]Micha Sharir, Adam Sheffer, Emo Welzl:
Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique. Symposium on Computational Geometry 2012: 189-198 - [c82]Fabrizio Frati, Joachim Gudmundsson, Emo Welzl:
On the Number of Upward Planar Orientations of Maximal Planar Graphs. ISAAC 2012: 413-422 - 2011
- [j69]Micha Sharir, Adam Sheffer, Emo Welzl:
On degrees in random triangulations of point sets. J. Comb. Theory, Ser. A 118(7): 1979-1999 (2011) - [c81]Andreas Razen, Emo Welzl:
Counting Plane Graphs with Exponential Speed-Up. Rainbow of Computer Science 2011: 36-46 - [c80]Emo Welzl:
Counting Simple Polygonizations of Planar Point Sets. CCCG 2011 - [c79]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
- [c78]Micha Sharir, Adam Sheffer, Emo Welzl:
On degrees in random triangulations of point sets. Symposium on Computational Geometry 2010: 297-306 - [c77]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
- [j68]Lars Arge, Emo Welzl:
Foreword. Algorithmica 55(2): 269-270 (2009) - [j67]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) - [c76]Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl:
The Lovász Local Lemma and Satisfiability. Efficient Algorithms 2009: 30-54 - [c75]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
- [j66]Andreas Razen, Jack Snoeyink, Emo Welzl:
Number of Crossing-Free Geometric Graphs vs. Triangulations. Electron. Notes Discret. Math. 31: 195-200 (2008) - [j65]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
- [j64]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) - [c74]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
- [j63]Micha Sharir, Emo Welzl:
On the Number of Crossing-Free Matchings, Cycles, and Partitions. SIAM J. Comput. 36(3): 695-720 (2006) - [c73]Micha Sharir, Emo Welzl:
Random triangulations of planar point sets. Symposium on Computational Geometry 2006: 273-281 - [c72]Emo Welzl:
The Number of Crossing Free Configurations on Finite Point Sets in the Plane. FSTTCS 2006: 20 - [c71]Emo Welzl:
The Number of Triangulations on Planar Point Sets. Graph Drawing 2006: 1-4 - [c70]Micha Sharir, Emo Welzl:
On the number of crossing-free matchings, (cycles, and partitions). SODA 2006: 860-869 - 2005
- [c69]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 - [c68]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
- [j62]Micha Sharir, Emo Welzl:
Point-Line Incidences in Space. Comb. Probab. Comput. 13(2): 203-220 (2004) - [j61]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) - [c67]Pankaj K. Agarwal, Micha Sharir, Emo Welzl:
Algorithms for center and Tverberg points. Symposium on Computational Geometry 2004: 61-67 - [c66]Emo Welzl:
Geometric Optimization and Unique Sink Orientations of Cubes p. MFCS 2004: 176 - [c65]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
- [j60]Artur Andrzejak, Emo Welzl:
In between k -Sets, j -Facets, and i -Faces: (i , j) - Partitions. Discret. Comput. Geom. 29(1): 105-131 (2003) - [j59]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
- [c64]Micha Sharir, Emo Welzl:
Point-line incidences in space. Symposium on Computational Geometry 2002: 107-115 - [c63]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 - [c62]Jurriaan Hage, Tero Harju, Emo Welzl:
Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes. ICGT 2002: 148-160 - [c61]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 - [c60]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
- [j58]Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl:
Enumerating triangulation paths. Comput. Geom. 20(1-2): 3-12 (2001) - [j57]Gyula Károlyi, Emo Welzl:
Crossing-free segments and triangles in point configurations. Discret. Appl. Math. 115(1-3): 77-88 (2001) - [j56]Emo Welzl:
Entering and Leaving j-Facets. Discret. Comput. Geom. 25(3): 351-364 (2001) - [j55]Bernd Gärtner, Emo Welzl:
A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization. Discret. Comput. Geom. 25(4): 569-590 (2001) - [j54]Uli Wagner, Emo Welzl:
A Continuous Analogue of the Upper Bound Theorem. Discret. Comput. Geom. 26(2): 205-219 (2001) - [c59]Bernd Gärtner, Emo Welzl:
Explicit and Implicit Enforcing - Randomized Optimization. Computational Discrete Mathematics 2001: 25-46 - [c58]Micha Sharir, Emo Welzl:
Balanced lines, halving triangles, and the generalized lower bound theorem. Symposium on Computational Geometry 2001: 315-318 - [c57]Tibor Szabó, Emo Welzl:
Unique Sink Orientations of Cubes. FOCS 2001: 547-555 - [c56]Bernd Gärtner, József Solymosi, Falk Tschirschnitz, Emo Welzl, Pavel Valtr:
One line and n points. STOC 2001: 306-315 - 2000
- [j53]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) - [j52]Bernd Gärtner, Emo Welzl:
On a simple sampling lemma. Electron. Notes Theor. Comput. Sci. 31: 160-169 (2000) - [c55]Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl:
Enumerating Triangulation Paths. CCCG 2000 - [c54]Uli Wagner, Emo Welzl:
Origin-embracing distributions or a continuous analogue of the upper bound theorem. Symposium on Computational Geometry 2000: 50-56 - [c53]Bernd Gärtner, Emo Welzl:
Random sampling in geometric optimization: new insights and applications. Symposium on Computational Geometry 2000: 91-99 - [c52]Emo Welzl:
n Points and One Line: Analysis of Randomized Games. WG 2000: 11-12 - [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. Symposium on Computational Geometry 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. Symposium on Computational Geometry 1997: 147-155 - [c48]Helmut Alt, Emo Welzl, Barbara Wolfers:
Piecewise Linear Approximation of Bézier-Curves. Symposium on Computational Geometry 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. Symposium on Computational Geometry 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. Symposium on Computational Geometry 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. Symposium on Computational Geometry 1994: 203-209 - [c40]Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl:
Fast Greedy Triangulation Algorithms. Symposium on Computational Geometry 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]