Emo Welzl - RankMe

198 papers A* 24A 12B 11Misc 2Journal 96Unranked 49

Year	Rank	Type	Title / Venue / Authors
2024	J	`jnl`	Deep Cliques in Point Sets. Discret. Comput. Geom. Stefan Langerman, Marcelo Mydlarz, Emo Welzl
2024	J	`jnl`	On connectivity in random graph models with limited dependencies. Random Struct. Algorithms Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber, Emo Welzl
2023	J	`jnl`	Convex Hulls of Random Order Types. J. ACM Xavier Goaoc, Emo Welzl
2023	A	`conf`	On Connectivity in Random Graph Models with Limited Dependencies. APPROX/RANDOM Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber, Emo Welzl
2022	J	`jnl`	Connectivity of Triangulation Flip Graphs in the Plane. Discret. Comput. Geom. Uli Wagner, Emo Welzl
2021	J	`jnl`	Lower bounds for searching robots, some faulty. Distributed Comput. Andrey Kupavskii, Emo Welzl
2020	J	`jnl`	An Optimal Decentralized $(Δ+ 1)$-Coloring Algorithm. CoRR Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl
2020	A	`conf`	An Optimal Decentralized (Δ + 1)-Coloring Algorithm. ESA Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl
2020	—	`conf`	Clustering Under Perturbation Stability in Near-Linear Time. FSTTCS Pankaj K. Agarwal, Hsien-Chih Chang, Kamesh Munagala, Erin Taylor, Emo Welzl
2020	J	`jnl`	Clustering under Perturbation Stability in Near-Linear Time. CoRR Pankaj K. Agarwal, Hsien-Chih Chang, Kamesh Munagala, Erin Taylor, Emo Welzl
2020	A*	`conf`	Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips). SODA Uli Wagner, Emo Welzl
2020	A*	`conf`	Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips). SoCG Uli Wagner, Emo Welzl
2020	J	`jnl`	Connectivity of Triangulation Flip Graphs in the Plane. CoRR Uli Wagner, Emo Welzl
2020	A*	`conf`	Convex Hulls of Random Order Types. SoCG Xavier Goaoc, Emo Welzl
2020	J	`jnl`	Convex Hulls of Random Order Types. CoRR Xavier Goaoc, Emo Welzl
2020	J	`jnl`	From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices. Discret. Comput. Geom. Alexander Pilz, Emo Welzl, Manuel Wettstein
2020	J	`jnl`	Minimal Representations of Order Types by Geometric Graphs. J. Graph Algorithms Appl. Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
2020	J	`jnl`	Solving and Sampling with Many Solutions. Algorithmica Jean Cardinal, Jerri Nummenpalo, Emo Welzl
2019	A	`conf`	Minimal Representations of Order Types by Geometric Graphs. GD Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
2019	J	`jnl`	Minimal Representations of Order Types by Geometric Graphs. CoRR Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
2018	J	`jnl`	From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices. CoRR Alexander Pilz, Emo Welzl, Manuel Wettstein
2018	A*	`conf`	Lower Bounds for Searching Robots, some Faulty. PODC Andrey Kupavskii, Emo Welzl
2018	J	`jnl`	Order on Order Types. Discret. Comput. Geom. Alexander Pilz, Emo Welzl
2017	A*	`conf`	From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices. SoCG Alexander Pilz, Emo Welzl, Manuel Wettstein
2017	J	`jnl`	Lower Bounds for Searching Robots, some Faulty. CoRR Andrey Kupavskii, Emo Welzl
2017	J	`jnl`	Packing Plane Spanning Trees and Paths in Complete Geometric Graphs. CoRR Oswin Aichholzer, Thomas Hackl, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Alexander Pilz, Bettina Speckmann, Emo Welzl
2017	J	`jnl`	Packing plane spanning trees and paths in complete geometric graphs. Inf. Process. Lett. Oswin Aichholzer, Thomas Hackl, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Alexander Pilz, Bettina Speckmann, Emo Welzl
2017	B	`conf`	Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems. IPEC Jean Cardinal, Jerri Nummenpalo, Emo Welzl
2017	J	`jnl`	Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems. CoRR Jean Cardinal, Jerri Nummenpalo, Emo Welzl
2016	J	`jnl`	A zero-player graph game in NP $\cap$ coNP. CoRR Jérôme Dohrau, Bernd Gärtner, Manuel Kohler, Jirí Matousek, Emo Welzl
2015	A*	`conf`	Order on Order Types. SoCG Alexander Pilz, Emo Welzl
2014	J	`jnl`	Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. Discret. Math. Theor. Comput. Sci. Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl
2014	J	`jnl`	Editorial. Comput. Geom. Michael Hoffmann, Emo Welzl
2014	J	`jnl`	On the number of upward planar orientations of maximal planar graphs. Theor. Comput. Sci. Fabrizio Frati, Joachim Gudmundsson, Emo Welzl
2014	—	`conf`	Packing Plane Spanning Trees and Paths in Complete Geometric Graphs. CCCG Oswin Aichholzer, Thomas Hackl, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Alexander Pilz, Bettina Speckmann, Emo Welzl
2013	—	`conf`	Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane. CCCG Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Birgit Vogtenhuber, Emo Welzl
2013	J	`jnl`	Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleyn's technique. J. Comb. Theory A Micha Sharir, Adam Sheffer, Emo Welzl
2013	J	`jnl`	On the number of crossing-free partitions. Comput. Geom. Andreas Razen, Emo Welzl
2012	—	`conf`	Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique. SCG Micha Sharir, Adam Sheffer, Emo Welzl
2012	B	`conf`	On the Number of Upward Planar Orientations of Maximal Planar Graphs. ISAAC Fabrizio Frati, Joachim Gudmundsson, Emo Welzl
2011	—	`conf`	Counting Plane Graphs with Exponential Speed-Up. Rainbow of Computer Science Andreas Razen, Emo Welzl
2011	B	`conf`	Counting Plane Graphs: Flippability and Its Applications. WADS Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl
2011	J	`jnl`	Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique CoRR Micha Sharir, Adam Sheffer, Emo Welzl
2011	—	`conf`	Counting Simple Polygonizations of Planar Point Sets. CCCG Emo Welzl
2011	J	`jnl`	On degrees in random triangulations of point sets. J. Comb. Theory A Micha Sharir, Adam Sheffer, Emo Welzl
2011	—	`ch.`	The Smallest Enclosing Circle - A Contribution to Democracy from Switzerland? Algorithms Unplugged Emo Welzl
2010	J	`jnl`	Counting Plane Graphs: Flippability and its Applications CoRR Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl
2010	—	`conf`	On degrees in random triangulations of point sets. SCG Micha Sharir, Adam Sheffer, Emo Welzl
2010	—	`conf`	When Conflicting Constraints Can Be Resolved - The Lovász Local Lemma and Satisfiability. ICALP (1) Emo Welzl
2009	A*	`conf`	Capacity of Arbitrary Wireless Networks. INFOCOM Olga Goussevskaia, Roger Wattenhofer, Magnús M. Halldórsson, Emo Welzl
2009	J	`jnl`	Catching elephants with mice: Sparse sampling for monitoring sensor networks. ACM Trans. Sens. Networks Sorabh Gandhi, Subhash Suri, Emo Welzl
2009	J	`jnl`	Counting Triangulations of Planar Point Sets CoRR Micha Sharir, Adam Sheffer, Emo Welzl
2009	J	`jnl`	Foreword. Algorithmica Lars Arge, Emo Welzl
2009	—	`conf`	The Lovász Local Lemma and Satisfiability. Efficient Algorithms Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl
2008	J	`jnl`	Algorithms for center and Tverberg points. ACM Trans. Algorithms Pankaj K. Agarwal, Micha Sharir, Emo Welzl
2008	—	`ch.`	Kleinster umschließender Kreis. (Ein Demokratiebeitrag aus der Schweiz?) Taschenbuch der Algorithmen Emo Welzl
2008	J	`jnl`	Number of Crossing-Free Geometric Graphs vs. Triangulations. Electron. Notes Discret. Math. Andreas Razen, Jack Snoeyink, Emo Welzl
2007	A	`ed.`	Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings ESA Lars Arge, Michael Hoffmann, Emo Welzl
2007	Misc	`conf`	Catching elephants with mice: sparse sampling for monitoring sensor networks. SenSys Sorabh Gandhi, Subhash Suri, Emo Welzl
2007	J	`jnl`	Online Conflict-Free Coloring for Intervals. SIAM J. Comput. Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
2006	J	`jnl`	On the Number of Crossing-Free Matchings, Cycles, and Partitions. SIAM J. Comput. Micha Sharir, Emo Welzl
2006	A*	`conf`	On the number of crossing-free matchings, (cycles, and partitions). SODA Micha Sharir, Emo Welzl
2006	—	`conf`	Random triangulations of planar point sets. SCG Micha Sharir, Emo Welzl
2006	—	`conf`	The Number of Crossing Free Configurations on Finite Point Sets in the Plane. FSTTCS Emo Welzl
2006	A	`conf`	The Number of Triangulations on Planar Point Sets. GD Emo Welzl
2005	Misc	`conf`	Interference in Cellular Networks: The Minimum Membership Set Cover Problem. COCOON Fabian Kuhn, Pascal von Rickenbach, Roger Wattenhofer, Emo Welzl, Aaron Zollinger
2005	A*	`conf`	Online conflict-free coloring for intervals. SODA Amos Fiat, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl
2004	J	`jnl`	Algorithmic complexity of protein identification: combinatorics of weighted strings. Discret. Appl. Math. Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl
2004	—	`conf`	Algorithms for center and Tverberg points. SCG Pankaj K. Agarwal, Micha Sharir, Emo Welzl
2004	B	`conf`	Geometric Optimization and Unique Sink Orientations of Cubes p. MFCS Emo Welzl
2004	—	`ch.`	Linear programming. Handbook of Discrete and Computational Geometry, 2nd Ed. Martin E. Dyer, Nimrod Megiddo, Emo Welzl
2004	B	`conf`	Off-line Admission Control for Advance Reservations in Star Networks. WAOA Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl
2004	J	`jnl`	Point-Line Incidences in Space. Comb. Probab. Comput. Micha Sharir, Emo Welzl
2003	J	`jnl`	Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes. Fundam. Informaticae Jurriaan Hage, Tero Harju, Emo Welzl
2003	J	`jnl`	In between k -Sets, j -Facets, and i -Faces: (i , j) - Partitions. Discret. Comput. Geom. Artur Andrzejak, Emo Welzl
2002	—	`conf`	Algorithmic Complexity of Protein Identification: Searching in Weighted Strings. IFIP TCS Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl
2002	B	`conf`	Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes. ICGT Jurriaan Hage, Tero Harju, Emo Welzl
2002	—	`conf`	Point-line incidences in space. SCG Micha Sharir, Emo Welzl
2002	A	`conf`	Running Time Analysis of Multi-objective Evolutionary Algorithms on a Simple Discrete Optimization Problem. PPSN Marco Laumanns, Lothar Thiele, Eckart Zitzler, Emo Welzl, Kalyanmoy Deb
2002	A	`conf`	Translating a Planar Object to Maximize Point Containment. ESA Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl
2001	J	`jnl`	A Continuous Analogue of the Upper Bound Theorem. Discret. Comput. Geom. Uli Wagner, Emo Welzl
2001	J	`jnl`	A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization. Discret. Comput. Geom. Bernd Gärtner, Emo Welzl
2001	—	`conf`	Balanced lines, halving triangles, and the generalized lower bound theorem. SCG Micha Sharir, Emo Welzl
2001	J	`jnl`	Crossing-free segments and triangles in point configurations. Discret. Appl. Math. Gyula Károlyi, Emo Welzl
2001	J	`jnl`	Entering and Leaving Discret. Comput. Geom. Emo Welzl
2001	J	`jnl`	Enumerating triangulation paths. Comput. Geom. Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl
2001	—	`conf`	Explicit and Implicit Enforcing - Randomized Optimization. Computational Discrete Mathematics Bernd Gärtner, Emo Welzl
2001	A*	`conf`	One line and n points. STOC Bernd Gärtner, József Solymosi, Falk Tschirschnitz, Emo Welzl, Pavel Valtr
2001	A*	`conf`	Unique Sink Orientations of Cubes. FOCS Tibor Szabó, Emo Welzl
2000	J	`jnl`	A class of point-sets with few k-sets. Comput. Geom. Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy, Emo Welzl
2000	A*	`ed.`	Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings ICALP Ugo Montanari, José D. P. Rolim, Emo Welzl
2000	—	`conf`	Enumerating Triangulation Paths. CCCG Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl
2000	—	`conf`	On a simple sampling lemma. CATS Bernd Gärtner, Emo Welzl
2000	—	`conf`	Origin-embracing distributions or a continuous analogue of the upper bound theorem. SCG Uli Wagner, Emo Welzl
2000	—	`conf`	Random sampling in geometric optimization: new insights and applications. SCG Bernd Gärtner, Emo Welzl
1998	J	`jnl`	Approximation of convex figures by pairs of rectangles. Comput. Geom. Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl
1998	—	`conf`	One Sided Error Predicates in Geometric Computing. IFIP Congress: Fundamentals - Foundations of Computer Science Lutz Kettner, Emo Welzl
1998	—	`conf`	Results on SCG Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, Emo Welzl
1998	J	`jnl`	The Discrete 2-Center Problem. Discret. Comput. Geom. Pankaj K. Agarwal, Micha Sharir, Emo Welzl
1998	J	`jnl`	Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. J. Algorithms L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl
1997	—	`ch.`	Contour Edge Analysis for Polyhedron Projections. Geometric Modeling Lutz Kettner, Emo Welzl
1997	J	`jnl`	Cutting Dense Point Sets in Half. Discret. Comput. Geom. Herbert Edelsbrunner, Pavel Valtr, Emo Welzl
1997	J	`jnl`	Fast Greedy Triangulation Algorithms. Comput. Geom. Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl
1997	—	`conf`	Piecewise Linear Approximation of Bézier-Curves. SCG Helmut Alt, Emo Welzl, Barbara Wolfers
1997	J	`jnl`	Space-Filling Curves and Their Use in the Design of Geometric Data Structures. Theor. Comput. Sci. Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer
1997	—	`conf`	The Discrete 2-Center Problem. SCG Pankaj K. Agarwal, Micha Sharir, Emo Welzl
1997	J	`jnl`	The rank of sparse random matrices over finite fields. Random Struct. Algorithms Johannes Blömer, Richard M. Karp, Emo Welzl
1996	J	`jnl`	A Subexponential Bound for Linear Programming. Algorithmica Jirí Matousek, Micha Sharir, Emo Welzl
1996	J	`jnl`	Guest Editor's Foreword. Discret. Comput. Geom. Emo Welzl
1996	A	`conf`	Linear Programming - Randomization and Abstract Frameworks. STACS Bernd Gärtner, Emo Welzl
1996	—	`conf`	Rectilinear and Polygonal SCG Micha Sharir, Emo Welzl
1995	J	`jnl`	Improved Bounds on Weak epsilon-Nets for Convex Sets. Discret. Comput. Geom. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl
1995	—	`conf`	Minimal Enclosing Parallelogram with Application. SCG Christian Schwarz, Jürgen Teich, Alek Vainshtein, Emo Welzl, Brian L. Evans
1995	B	`conf`	Space Filling Curves and Their Use in the Design of Geometric Data Structures. LATIN Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer
1995	A*	`conf`	Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. SODA L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl
1994	—	`conf`	Cutting Dense Point Sets in Half. SCG Herbert Edelsbrunner, Pavel Valtr, Emo Welzl
1994	—	`conf`	Fast Greedy Triangulation Algorithms. SCG Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl
1994	J	`jnl`	Fat Triangles Determine Linearly Many Holes. SIAM J. Comput. Jirí Matousek, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl
1994	—	`conf`	Gram's Equation - A Probabilistic Proof. Results and Trends in Theoretical Computer Science Emo Welzl
1994	J	`jnl`	Surface Reconstruction Between Simple Polygons via Angle Criteria. J. Symb. Comput. Emo Welzl, Barbara Wolfers
1994	J	`jnl`	Vapnik-Chervonenkis Dimension and (Pseudo-)Hyperplane Arrangements. Discret. Comput. Geom. Bernd Gärtner, Emo Welzl
1993	J	`jnl`	Discrepancy and approximations for bounded VC-dimension. Comb. Jirí Matousek, Emo Welzl, Lorenz Wernisch
1993	J	`jnl`	Drawing Graphs in the Plane with High Resolution. SIAM J. Comput. Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger
1993	A*	`conf`	Improved bounds on weak epsilon-nets for convex sets. STOC Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl
1993	J	`jnl`	Shortest Paths for Line Segments. Algorithmica Christian Icking, Günter Rote, Emo Welzl, Chee-Keng Yap
1993	A	`conf`	Surface Reconstruction Between Simple Polygons via Angle Criteria. ESA Emo Welzl, Barbara Wolfers
1993	J	`jnl`	Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection. Comput. Geom. Kurt Mehlhorn, Micha Sharir, Emo Welzl
1993	J	`jnl`	Weaving Patterns of Lines and Line Segments in Space. Algorithmica János Pach, Richard Pollack, Emo Welzl
1992	A	`conf`	A Combinatorial Bound for Linear Programming and Related Problems. STACS Micha Sharir, Emo Welzl
1992	—	`conf`	A Subexponential Bound for Linear Programming. SCG Jirí Matousek, Micha Sharir, Emo Welzl
1992	J	`jnl`	Good Splitters for Counting Points in Triangles. J. Algorithms Jirí Matousek, Emo Welzl
1992	—	`conf`	New Results on Linear Programming and Related Problems. SWAT Emo Welzl
1992	—	`conf`	On Spanning Trees with Low Crossing Numbers. Data Structures and Efficient Algorithms Emo Welzl
1992	J	`jnl`	Polynomial graph-colorings. Discret. Appl. Math. Wolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger
1992	J	`jnl`	Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. Algorithmica Bernard Chazelle, Micha Sharir, Emo Welzl
1992	J	`jnl`	Simultaneous Inner and Outer Approximation of Shapes. Algorithmica Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
1992	A*	`conf`	Tail Estimates for the Space Complexity of Randomized Incremental Algorithms. SODA Kurt Mehlhorn, Micha Sharir, Emo Welzl
1991	A*	`conf`	Discrepancy and epsilon-approximations for bounded VC-dimension FOCS Jirí Matousek, Emo Welzl, Lorenz Wernisch
1991	A*	`conf`	Fat Triangles Determine Linearly Many Holes FOCS Jirí Matousek, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl
1991	—	`conf`	Smallest enclosing disks (balls and ellipsoids). New Results and New Trends in Computer Science Emo Welzl
1991	A*	`conf`	The Post Office Problem for Fuzzy Point Sets. Workshop on Computational Geometry Franz Aurenhammer, Gerd Stöckl, Emo Welzl
1990	A	`conf`	Approximation of Convex Figures by Pairs of Rectangles. STACS Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl
1990	J	`jnl`	Boundary Graph Grammars with Dynamic Edge Relabeling. J. Comput. Syst. Sci. Joost Engelfriet, George Leih, Emo Welzl
1990	J	`jnl`	Combinatorial Complexity Bounds for Arrangement of Curves and Spheres. Discret. Comput. Geom. Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl
1990	A*	`conf`	Drawing Graphs in the Plane with High Resolution FOCS Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger
1990	B	`conf`	Efficient Parallel Computation of Arrangements of Hyperplanes in d Dimensions. SPAA Torben Hagerup, H. Jung, Emo Welzl
1990	—	`conf`	Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. SCG Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl
1990	—	`conf`	How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces. SCG Jirí Matousek, Raimund Seidel, Emo Welzl
1990	—	`conf`	On Simultaneous Inner and Outer Approximation of Shapes. SCG Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
1990	—	`conf`	Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. SCG Bernard Chazelle, Micha Sharir, Emo Welzl
1990	J	`jnl`	Ranking intervals under visibility constraints. Int. J. Comput. Math. Herbert Edelsbrunner, Mark H. Overmars, Emo Welzl, Irith Ben-Arroyo Hartman, Jack A. Feldman
1990	—	`conf`	Weaving Patterns of Lines and Segments in Space. SIGAL International Symposium on Algorithms János Pach, Richard Pollack, Emo Welzl
1989	—	`conf`	Good Splitters for Counting Points in Triangles. SCG Jirí Matousek, Emo Welzl
1989	J	`jnl`	Implicitly Representing Arrangements of Lines or Segments. Discret. Comput. Geom. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl
1989	A	`conf`	Polynomial Graph-Colorings. STACS Wolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger
1989	J	`jnl`	Quasi-Optimal Range Searching in Space of Finite VC-Dimension. Discret. Comput. Geom. Bernard Chazelle, Emo Welzl
1989	J	`jnl`	Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. Theor. Comput. Sci. Herbert Edelsbrunner, Günter Rote, Emo Welzl
1988	A*	`conf`	Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces FOCS Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl
1988	J	`jnl`	Congruence, Similarity, and Symmetries of Geometric Objects. Discret. Comput. Geom. Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl
1988	—	`conf`	Implicitly Representing Arrangements of Lines or Segments. SCG Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl
1988	—	`conf`	New Methods for Computing Visibility Graphs. SCG Mark H. Overmars, Emo Welzl
1988	—	`conf`	Partition Trees for Triangle Counting and Other Range Searching Problems. SCG Emo Welzl
1988	J	`jnl`	Visibility graphs and obstacle-avoiding shortest paths. ZOR Methods Model. Oper. Res. Helmut Alt, Emo Welzl
1987	J	`jnl`	Combinatorial properties of boundary NLC graph languages. Discret. Appl. Math. Grzegorz Rozenberg, Emo Welzl
1987	—	`conf`	Congruence, Similarity, and Symmetries of Geometric Objects. SCG Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl
1987	—	`conf`	Partitioning and Geometric Embedding of Range Spaces of Finite Vapnik-Chervonenkis Dimension. SCG Noga Alon, David Haussler, Emo Welzl
1987	J	`jnl`	String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing. Discret. Appl. Math. Klaus-Jörn Lange, Emo Welzl
1987	A*	`conf`	Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. ICALP Herbert Edelsbrunner, Günter Rote, Emo Welzl
1987	J	`jnl`	epsilon-Nets and Simplex Range Queries. Discret. Comput. Geom. David Haussler, Emo Welzl
1986	J	`jnl`	Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity Inf. Control. Grzegorz Rozenberg, Emo Welzl
1986	—	`conf`	Boundary NlC and partition controlled graph grammars. Graph-Grammars and Their Application to Computer Science Emo Welzl
1986	J	`jnl`	Constructing Belts in Two-Dimensional Arrangements with Applications. SIAM J. Comput. Herbert Edelsbrunner, Emo Welzl
1986	—	`conf`	Epsilon-Nets and Simplex Range Queries. SCG David Haussler, Emo Welzl
1986	J	`jnl`	Graph Theoretic Closure Properties of the Family of Boundary NLC Graph Languages. Acta Informatica Grzegorz Rozenberg, Emo Welzl
1986	J	`jnl`	Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time. Inf. Process. Lett. Herbert Edelsbrunner, Emo Welzl
1986	J	`jnl`	More on k-Sets of Finite Sets in the Plane. Discret. Comput. Geom. Emo Welzl
1986	J	`jnl`	On the maximal number of edges of many faces in an arrangement. J. Comb. Theory A Herbert Edelsbrunner, Emo Welzl
1986	J	`jnl`	The Bounded Degree Problem for NLC Grammars is Decidable. J. Comput. Syst. Sci. Dirk Janssens, Grzegorz Rozenberg, Emo Welzl
1986	J	`jnl`	Trace Languages Defined by Regular String Languages. RAIRO Theor. Informatics Appl. IJsbrand Jan Aalbersberg, Emo Welzl
1985	J	`jnl`	A simple method for solving 2-dimensional static range searching. Bull. EATCS Mark H. Overmars, Emo Welzl
1985	J	`jnl`	Complexity and Decidability for Chain Code Picture Languages. Theor. Comput. Sci. Ivan Hal Sudborough, Emo Welzl
1985	J	`jnl`	Constructing the Visibility Graph for n-Line Segments in O(n²) Time. Inf. Process. Lett. Emo Welzl
1985	J	`jnl`	On the Number of Line Separations of a Finite Set in the Plane. J. Comb. Theory A Herbert Edelsbrunner, Emo Welzl
1985	J	`jnl`	Recurrent Words and Simultaneous Growth in T0L Systems. Theor. Comput. Sci. Klaus-Jörn Lange, Emo Welzl
1985	B	`conf`	String grammars with disconnecting. FCT Klaus-Jörn Lange, Emo Welzl
1985	—	`conf`	The complexity of cutting paper (extended abstract). SCG Mark H. Overmars, Emo Welzl
1984	—	`conf`	Boundary NLC Grammars. CAAP Grzegorz Rozenberg, Emo Welzl
1984	A*	`conf`	Encoding Graphs by Derivations and Implications for the Theory of Graph Grammars. ICALP Emo Welzl
1984	B	`conf`	Monotone Edge Sequences in Line Arrangements and Applications (Extended Abstract). MFCS Herbert Edelsbrunner, Emo Welzl
1984	J	`jnl`	Symmetric graphs and interpretations. J. Comb. Theory B Emo Welzl
1983	A*	`conf`	On the Number of Equal-Sized Semisapces of a Set of Points in the Plane (Extended Abstract). ICALP Herbert Edelsbrunner, Emo Welzl
1983	B	`conf`	Two Way Finite State Generators. FCT Karel Culík II, Emo Welzl
1982	—	`conf`	Chain code picture languages. Graph-Grammars and Their Application to Computer Science Hermann A. Maurer, Grzegorz Rozenberg, Emo Welzl
1982	J	`jnl`	Color-Families are Dense. Theor. Comput. Sci. Emo Welzl
1982	J	`jnl`	Stabbing Line Segments. BIT Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood
1982	J	`jnl`	Using String Languages to Describe Picture Languages Inf. Control. Hermann A. Maurer, Grzegorz Rozenberg, Emo Welzl
1981	J	`jnl`	On the Complexity of the General Coloring Problem Inf. Control. Hermann A. Maurer, Ivan Hal Sudborough, Emo Welzl
1981	A*	`conf`	On the Density of Color-Families. ICALP Emo Welzl