Emo Welzl

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)

Micha Sharir, Adam Sheffer, Emo Welzl: Counting plane graphs: perfect matchings, spanning cycles, and Kasteleyn's technique. Symposium on Computational Geometry 2012: 189-198

Fabrizio Frati, Joachim Gudmundsson, Emo Welzl: On the Number of Upward Planar Orientations of Maximal Planar Graphs. ISAAC 2012: 413-422

Micha Sharir, Adam Sheffer, Emo Welzl: On degrees in random triangulations of point sets. J. Comb. Theory, Ser. A 118(7): 1979-1999 (2011)

Emo Welzl: The Smallest Enclosing Circle - A Contribution to Democracy from Switzerland? Algorithms Unplugged 2011: 357-360

Andreas Razen, Emo Welzl: Counting Plane Graphs with Exponential Speed-Up. Rainbow of Computer Science 2011: 36-46

Emo Welzl: Counting Simple Polygonizations of Planar Point Sets. CCCG 2011

Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl: Counting Plane Graphs: Flippability and Its Applications. WADS 2011: 524-535

Micha Sharir, Adam Sheffer, Emo Welzl: Counting Plane Graphs: Perfect Matchings, Spanning Cycles, and Kasteleyn's Technique. CoRR abs/1109.5596 (2011)

Micha Sharir, Adam Sheffer, Emo Welzl: On degrees in random triangulations of point sets. Symposium on Computational Geometry 2010: 297-306

Emo Welzl: When Conflicting Constraints Can Be Resolved - The Lovász Local Lemma and Satisfiability. ICALP (1) 2010: 18

Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl: Counting Plane Graphs: Flippability and its Applications. CoRR abs/1012.0591 (2010)

Lars Arge, Emo Welzl: Foreword. Algorithmica 55(2): 269-270 (2009)

Sorabh Gandhi, Subhash Suri, Emo Welzl: Catching elephants with mice: Sparse sampling for monitoring sensor networks. TOSN 6(1) (2009)

Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl: The Lovász Local Lemma and Satisfiability. Efficient Algorithms 2009: 30-54

Olga Goussevskaia, Roger Wattenhofer, Magnús M. Halldórsson, Emo Welzl: Capacity of Arbitrary Wireless Networks. INFOCOM 2009: 1872-1880

Micha Sharir, Adam Sheffer, Emo Welzl: Counting Triangulations of Planar Point Sets. CoRR abs/0911.3352 (2009)

Andreas Razen, Jack Snoeyink, Emo Welzl: Number of Crossing-Free Geometric Graphs vs. Triangulations. Electronic Notes in Discrete Mathematics 31: 195-200 (2008)

Pankaj K. Agarwal, Micha Sharir, Emo Welzl: Algorithms for center and Tverberg points. ACM Transactions on Algorithms 5(1) (2008)

Emo Welzl: Kleinster umschließender Kreis. (Ein Demokratiebeitrag aus der Schweiz?). Taschenbuch der Algorithmen 2008: 385-388

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)

Sorabh Gandhi, Subhash Suri, Emo Welzl: Catching elephants with mice: sparse sampling for monitoring sensor networks. SenSys 2007: 261-274

Lars Arge, Michael Hoffmann, Emo Welzl (Eds.): 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

Micha Sharir, Emo Welzl: On the Number of Crossing-Free Matchings, Cycles, and Partitions. SIAM J. Comput. 36(3): 695-720 (2006)

Micha Sharir, Emo Welzl: Random triangulations of planar point sets. Symposium on Computational Geometry 2006: 273-281

Emo Welzl: The Number of Crossing Free Configurations on Finite Point Sets in the Plane. FSTTCS 2006: 20

Emo Welzl: The Number of Triangulations on Planar Point Sets. Graph Drawing 2006: 1-4

Micha Sharir, Emo Welzl: On the number of crossing-free matchings, (cycles, and partitions). SODA 2006: 860-869

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

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

Micha Sharir, Emo Welzl: Point-Line Incidences in Space. Combinatorics, Probability & Computing 13(2): 203-220 (2004)

Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl: Algorithmic complexity of protein identification: combinatorics of weighted strings. Discrete Applied Mathematics 137(1): 27-46 (2004)

Pankaj K. Agarwal, Micha Sharir, Emo Welzl: Algorithms for center and Tverberg points. Symposium on Computational Geometry 2004: 61-67

Emo Welzl: Geometric Optimization and Unique Sink Orientations of Cubes p. MFCS 2004: 176

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

Artur Andrzejak, Emo Welzl: In between k -Sets, j -Facets, and i -Faces: (i , j) - Partitions. Discrete & Computational Geometry 29(1): 105-131 (2003)

Jurriaan Hage, Tero Harju, Emo Welzl: Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes. Fundam. Inform. 58(1): 23-37 (2003)

Micha Sharir, Emo Welzl: Point-line incidences in space. Symposium on Computational Geometry 2002: 107-115

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

Jurriaan Hage, Tero Harju, Emo Welzl: Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes. ICGT 2002: 148-160

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

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

Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl: Enumerating triangulation paths. Comput. Geom. 20(1-2): 3-12 (2001)

Gyula Károlyi, Emo Welzl: Crossing-free segments and triangles in point configurations. Discrete Applied Mathematics 115(1-3): 77-88 (2001)

Emo Welzl: Entering and Leaving j-Facets. Discrete & Computational Geometry 25(3): 351-364 (2001)

Bernd Gärtner, Emo Welzl: A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization. Discrete & Computational Geometry 25(4): 569-590 (2001)

Uli Wagner, Emo Welzl: A Continuous Analogue of the Upper Bound Theorem. Discrete & Computational Geometry 26(2): 205-219 (2001)

Bernd Gärtner, Emo Welzl: Explicit and Implicit Enforcing - Randomized Optimization. Computational Discrete Mathematics 2001: 25-46

Micha Sharir, Emo Welzl: Balanced lines, halving triangles, and the generalized lower bound theorem. Symposium on Computational Geometry 2001: 315-318

Tibor Szabó, Emo Welzl: Unique Sink Orientations of Cubes. FOCS 2001: 547-555

Bernd Gärtner, József Solymosi, Falk Tschirschnitz, Emo Welzl, Pavel Valtr: One line and n points. STOC 2001: 306-315

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)

Bernd Gärtner, Emo Welzl: On a simple sampling lemma. Electr. Notes Theor. Comput. Sci. 31: 160-169 (2000)

Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl: Enumerating Triangulation Paths. CCCG 2000

Uli Wagner, Emo Welzl: Origin-embracing distributions or a continuous analogue of the upper bound theorem. Symposium on Computational Geometry 2000: 50-56

Bernd Gärtner, Emo Welzl: Random sampling in geometric optimization: new insights and applications. Symposium on Computational Geometry 2000: 91-99

Emo Welzl: n Points and One Line: Analysis of Randomized Games. WG 2000: 11-12

Ugo Montanari, José D. P. Rolim, Emo Welzl (Eds.): 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

Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl: Approximation of convex figures by pairs of rectangles. Comput. Geom. 10(2): 77-87 (1998)

Pankaj K. Agarwal, Micha Sharir, Emo Welzl: The Discrete 2-Center Problem. Discrete & Computational Geometry 20(3): 287-305 (1998)

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)

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

Lutz Kettner, Emo Welzl: One Sided Error Predicates in Geometric Computing. IFIP Congress: Fundamentals - Foundations of Computer Science 1998: 13-26

Emo Welzl, Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu: An Experimental Comparison of Four Graph Drawing Algorithms. Comput. Geom. 7: 303-325 (1997)

Emo Welzl, Herbert Edelsbrunner, Roman Waupotitsch: A Combinatorial Approach to Cartograms. Comput. Geom. 7: 343-360 (1997)

Emo Welzl, Peter Su, Robert L. (Scot) Drysdale III: A Comparison of Sequential Delaunay Triangulation Algorithms. Comput. Geom. 7: 361-385 (1997)

Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl: Fast Greedy Triangulation Algorithms. Comput. Geom. 8: 67-86 (1997)

Herbert Edelsbrunner, Pavel Valtr, Emo Welzl: Cutting Dense Point Sets in Half. Discrete & Computational Geometry 17(3): 243-255 (1997)

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)

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)

Pankaj K. Agarwal, Micha Sharir, Emo Welzl: The Discrete 2-Center Problem. Symposium on Computational Geometry 1997: 147-155

Helmut Alt, Emo Welzl, Barbara Wolfers: Piecewise Linear Approximation of Bézier-Curves. Symposium on Computational Geometry 1997: 433-435

Jirí Matousek, Micha Sharir, Emo Welzl: A Subexponential Bound for Linear Programming. Algorithmica 16(4/5): 498-516 (1996)

Emo Welzl: Guest Editor's Foreword. Discrete & Computational Geometry 16(4): 315 (1996)

Micha Sharir, Emo Welzl: Rectilinear and Polygonal p-Piercing and p-Center Problems. Symposium on Computational Geometry 1996: 122-132

Bernd Gärtner, Emo Welzl: Linear Programming - Randomization and Abstract Frameworks. STACS 1996: 669-687

Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl: Improved Bounds on Weak epsilon-Nets for Convex Sets. Discrete & Computational Geometry 13: 1-15 (1995)

Christian Schwarz, Jürgen Teich, Alek Vainshtein, Emo Welzl, Brian L. Evans: Minimal Enclosing Parallelogram with Application. Symposium on Computational Geometry 1995: C34-C35

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

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

Bernd Gärtner, Emo Welzl: Vapnik-Chervonenkis Dimension and (Pseudo-)Hyperplane Arrangements. Discrete & Computational Geometry 12: 399-432 (1994)

Emo Welzl, Barbara Wolfers: Surface Reconstruction Between Simple Polygons via Angle Criteria. J. Symb. Comput. 17(4): 351-369 (1994)

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)

Emo Welzl: Gram's Equation - A Probabilistic Proof. Results and Trends in Theoretical Computer Science 1994: 422-424

Herbert Edelsbrunner, Pavel Valtr, Emo Welzl: Cutting Dense Point Sets in Half. Symposium on Computational Geometry 1994: 203-209

Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl: Fast Greedy Triangulation Algorithms. Symposium on Computational Geometry 1994: 211-220

János Pach, Richard Pollack, Emo Welzl: Weaving Patterns of Lines and Line Segments in Space. Algorithmica 9(6): 561-571 (1993)

Christian Icking, Günter Rote, Emo Welzl, Chee-Keng Yap: Shortest Paths for Line Segments. Algorithmica 10(2-4): 182-200 (1993)

Jirí Matousek, Emo Welzl, Lorenz Wernisch: Discrepancy and approximations for bounded VC-dimension. Combinatorica 13(4): 455-466 (1993)

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)

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)

Emo Welzl, Barbara Wolfers: Surface Reconstruction Between Simple Polygons via Angle Criteria. ESA 1993: 397-408

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

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)

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)

Wolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger: Polynomial graph-colorings. Discrete Applied Mathematics 35(1): 29-45 (1992)

Jirí Matousek, Emo Welzl: Good Splitters for Counting Points in Triangles. J. Algorithms 13(2): 307-319 (1992)

Jirí Matousek, Micha Sharir, Emo Welzl: A Subexponential Bound for Linear Programming. Symposium on Computational Geometry 1992: 1-8

Emo Welzl: On Spanning Trees with Low Crossing Numbers. Data Structures and Efficient Algorithms 1992: 233-249

Kurt Mehlhorn, Micha Sharir, Emo Welzl: Tail Estimates for the Space Complexity of Randomized Incremental Algorithms. SODA 1992: 89-93

Micha Sharir, Emo Welzl: A Combinatorial Bound for Linear Programming and Related Problems. STACS 1992: 569-579

Emo Welzl: New Results on Linear Programming and Related Problems. SWAT 1992: 338-339

Franz Aurenhammer, Gerd Stöckl, Emo Welzl: The Post Office Problem for Fuzzy Point Sets. Workshop on Computational Geometry 1991: 1-11

Jirí Matousek, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl: Fat Triangles Determine Linearly Many Holes. FOCS 1991: 49-58

Jirí Matousek, Emo Welzl, Lorenz Wernisch: Discrepancy and epsilon-approximations for bounded VC-dimension. FOCS 1991: 424-430

Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl: Combinatorial Complexity Bounds for Arrangement of Curves and Spheres. Discrete & Computational Geometry 5: 99-160 (1990)

Joost Engelfriet, George Leih, Emo Welzl: Boundary Graph Grammars with Dynamic Edge Relabeling. J. Comput. Syst. Sci. 40(3): 307-345 (1990)

Bernard Chazelle, Micha Sharir, Emo Welzl: Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. Symposium on Computational Geometry 1990: 23-33

Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl: Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. Symposium on Computational Geometry 1990: 203-210

Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap: On Simultaneous Inner and Outer Approximation of Shapes. Symposium on Computational Geometry 1990: 216-224

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

János Pach, Richard Pollack, Emo Welzl: Weaving Patterns of Lines and Segments in Space. SIGAL International Symposium on Algorithms 1990: 439-446

Torben Hagerup, H. Jung, Emo Welzl: Efficient Parallel Computation of Arrangements of Hyperplanes in d Dimensions. SPAA 1990: 290-297

Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl: Approximation of Convex Figures by Pairs of Rectangles. STACS 1990: 240-249

Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl: Implicitly Representing Arrangements of Lines or Segments. Discrete & Computational Geometry 4: 433-466 (1989)

Bernard Chazelle, Emo Welzl: Quasi-Optimal Range Searching in Space of Finite VC-Dimension. Discrete & Computational Geometry 4: 467-489 (1989)

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)

Jirí Matousek, Emo Welzl: Good Splitters for Counting Points in Triangles. Symposium on Computational Geometry 1989: 124-130

Wolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger: Polynomial Graph-Colorings. STACS 1989: 108-119

Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl: Congruence, Similarity, and Symmetries of Geometric Objects. Discrete & Computational Geometry 3: 237-256 (1988)

Emo Welzl: Partition Trees for Triangle Counting and Other Range Searching Problems. Symposium on Computational Geometry 1988: 23-33

Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl: Implicitly Representing Arrangements of Lines or Segments. Symposium on Computational Geometry 1988: 56-69

Mark H. Overmars, Emo Welzl: New Methods for Computing Visibility Graphs. Symposium on Computational Geometry 1988: 164-171

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

David Haussler, Emo Welzl: epsilon-Nets and Simplex Range Queries. Discrete & Computational Geometry 2: 127-151 (1987)

Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl: Congruence, Similarity, and Symmetries of Geometric Objects. Symposium on Computational Geometry 1987: 308-315

Noga Alon, David Haussler, Emo Welzl: Partitioning and Geometric Embedding of Range Spaces of Finite Vapnik-Chervonenkis Dimension. Symposium on Computational Geometry 1987: 331-340

Herbert Edelsbrunner, Günter Rote, Emo Welzl: Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. ICALP 1987: 364-375

Grzegorz Rozenberg, Emo Welzl: Graph Theoretic Closure Properties of the Family of Boundary NLC Graph Languages. Acta Inf. 23(3): 289-309 (1986)

Emo Welzl: More on k-Sets of Finite Sets in the Plane. Discrete & Computational Geometry 1: 95-100 (1986)

Grzegorz Rozenberg, Emo Welzl: Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity. Information and Control 69(1-3): 136-167 (1986)

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)

IJsbrand Jan Aalbersberg, Emo Welzl: Trace Languages Defined by Regular String Languages. ITA 20(2): 103-119 (1986)

Dirk Janssens, Grzegorz Rozenberg, Emo Welzl: The Bounded Degree Problem for NLC Grammars is Decidable. J. Comput. Syst. Sci. 33(3): 415-422 (1986)

Herbert Edelsbrunner, Emo Welzl: On the maximal number of edges of many faces in an arrangement. J. Comb. Theory, Ser. A 41(2): 159-166 (1986)

Herbert Edelsbrunner, Emo Welzl: Constructing Belts in Two-Dimensional Arrangements with Applications. SIAM J. Comput. 15(1): 271-284 (1986)

David Haussler, Emo Welzl: Epsilon-Nets and Simplex Range Queries. Symposium on Computational Geometry 1986: 61-71

Emo Welzl: Boundary NlC and partition controlled graph grammars. Graph-Grammars and Their Application to Computer Science 1986: 593-609

Mark H. Overmars, Emo Welzl: A simple method for solving 2-dimensional static range searching. Bulletin of the EATCS 25: 31-33 (1985)

Emo Welzl: Constructing the Visibility Graph for n-Line Segments in O(n²) Time. Inf. Process. Lett. 20(4): 167-171 (1985)

Herbert Edelsbrunner, Emo Welzl: On the Number of Line Separations of a Finite Set in the Plane. J. Comb. Theory, Ser. A 38(1): 15-29 (1985)

Klaus-Jörn Lange, Emo Welzl: Recurrent Words and Simultaneous Growth in T0L Systems. Theor. Comput. Sci. 35: 1-15 (1985)

Ivan Hal Sudborough, Emo Welzl: Complexity and Decidability for Chain Code Picture Languages. Theor. Comput. Sci. 36: 173-202 (1985)

Mark H. Overmars, Emo Welzl: The complexity of cutting paper (extended abstract). Symposium on Computational Geometry 1985: 316-321

Klaus-Jörn Lange, Emo Welzl: String grammars with disconnecting. FCT 1985: 249-256

Emo Welzl: Symmetric graphs and interpretations. J. Comb. Theory, Ser. B 37(3): 235-244 (1984)

Grzegorz Rozenberg, Emo Welzl: Boundary NLC Grammars. CAAP 1984: 257-270

Emo Welzl: Encoding Graphs by Derivations and Implications for the Theory of Graph Grammars. ICALP 1984: 503-513

Herbert Edelsbrunner, Emo Welzl: Monotone Edge Sequences in Line Arrangements and Applications (Extended Abstract). MFCS 1984: 265-272

Karel Culik II, Emo Welzl: Two Way Finite State Generators. FCT 1983: 106-114

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

Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood: Stabbing Line Segments. BIT 22(3): 274-281 (1982)

Hermann A. Maurer, Grzegorz Rozenberg, Emo Welzl: Using String Languages to Describe Picture Languages. Information and Control 54(3): 155-185 (1982)

Emo Welzl: Color-Families are Dense. Theor. Comput. Sci. 17: 29-41 (1982)

Hermann A. Maurer, Grzegorz Rozenberg, Emo Welzl: Chain code picture languages. Graph-Grammars and Their Application to Computer Science 1982: 232-244

Hermann A. Maurer, Ivan Hal Sudborough, Emo Welzl: On the Complexity of the General Coloring Problem. Information and Control 51(2): 128-145 (1981)

Emo Welzl: On the Density of Color-Families. ICALP 1981: 68-72