Emo Welzl

According to our database, Emo Welzl authored at least 152 papers between 1981 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2024

Deep Cliques in Point Sets.

Stefan Langerman, Marcelo Mydlarz, Emo Welzl

Discret. Comput. Geom., September, 2024

2023

Convex Hulls of Random Order Types.

Xavier Goaoc, Emo Welzl

J. ACM, February, 2023

On Connectivity in Random Graph Models with Limited Dependencies.

Johannes Lengler, Anders Martinsson, Kalina Petrova, Patrick Schnider, Raphael Steiner, Simon Weber, Emo Welzl

Proceedings of the Approximation, 2023

2022

Connectivity of Triangulation Flip Graphs in the Plane.

Uli Wagner, Emo Welzl

Discret. Comput. Geom., 2022

2021

Lower bounds for searching robots, some faulty.

Andrey Kupavskii, Emo Welzl

Distributed Comput., 2021

2020

Minimal Representations of Order Types by Geometric Graphs.

Oswin Aichholzer, Martin Balko, Michael Hoffmann, Jan Kyncl, Wolfgang Mulzer, Irene Parada, Alexander Pilz, Manfred Scheucher, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl

J. Graph Algorithms Appl., 2020

From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices.

Alexander Pilz, Emo Welzl, Manuel Wettstein

Discret. Comput. Geom., 2020

Solving and Sampling with Many Solutions.

Jean Cardinal, Jerri Nummenpalo, Emo Welzl

Algorithmica, 2020

Connectivity of Triangulation Flip Graphs in the Plane (Part I: Edge Flips).

Uli Wagner, Emo Welzl

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

Clustering Under Perturbation Stability in Near-Linear Time.

Pankaj K. Agarwal, Hsien-Chih Chang, Kamesh Munagala, Erin Taylor, Emo Welzl

Proceedings of the 40th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2020

An Optimal Decentralized (Δ + 1)-Coloring Algorithm.

Daniel Bertschinger, Johannes Lengler, Anders Martinsson, Robert Meier, Angelika Steger, Milos Trujic, Emo Welzl

Proceedings of the 28th Annual European Symposium on Algorithms, 2020

Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips).

Uli Wagner, Emo Welzl

Proceedings of the 36th International Symposium on Computational Geometry, 2020

2018

Order on Order Types.

Alexander Pilz, Emo Welzl

Discret. Comput. Geom., 2018

2017

Packing plane spanning trees and paths in complete geometric graphs.

Oswin Aichholzer, Thomas Hackl, Matias Korman, Marc J. van Kreveld, Maarten Löffler, Alexander Pilz, Bettina Speckmann, Emo Welzl

Inf. Process. Lett., 2017

Solving and Sampling with Many Solutions: Satisfiability and Other Hard Problems.

Jean Cardinal, Jerri Nummenpalo, Emo Welzl

Proceedings of the 12th International Symposium on Parameterized and Exact Computation, 2017

2016

A zero-player graph game in NP $\cap$ coNP.

Jérôme Dohrau, Bernd Gärtner, Manuel Kohler, Jirí Matousek, Emo Welzl

CoRR, 2016

2014

On the number of upward planar orientations of maximal planar graphs.

Fabrizio Frati, Joachim Gudmundsson, Emo Welzl

Theor. Comput. Sci., 2014

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.

Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Pavel Valtr, Birgit Vogtenhuber, Emo Welzl

Discret. Math. Theor. Comput. Sci., 2014

Editorial.

Michael Hoffmann, Emo Welzl

Comput. Geom., 2014

2013

Counting plane graphs: Perfect matchings, spanning cycles, and Kasteleyn's technique.

Micha Sharir, Adam Sheffer, Emo Welzl

J. Comb. Theory A, 2013

On the number of crossing-free partitions.

Andreas Razen, Emo Welzl

Comput. Geom., 2013

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.

Oswin Aichholzer, Jean Cardinal, Thomas Hackl, Ferran Hurtado, Matias Korman, Alexander Pilz, Rodrigo I. Silveira, Ryuhei Uehara, Birgit Vogtenhuber, Emo Welzl

Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2011

On degrees in random triangulations of point sets.

Micha Sharir, Adam Sheffer, Emo Welzl

J. Comb. Theory A, 2011

Counting Plane Graphs: Flippability and Its Applications.

Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl

Proceedings of the Algorithms and Data Structures - 12th International Symposium, 2011

Counting Simple Polygonizations of Planar Point Sets.

Emo Welzl

Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Counting Plane Graphs with Exponential Speed-Up.

Andreas Razen, Emo Welzl

Proceedings of the Rainbow of Computer Science, 2011

The Smallest Enclosing Circle - A Contribution to Democracy from Switzerland?

Emo Welzl

Proceedings of the Algorithms Unplugged, 2011

2010

When Conflicting Constraints Can Be Resolved - The Lovász Local Lemma and Satisfiability.

Emo Welzl

Proceedings of the Automata, Languages and Programming, 37th International Colloquium, 2010

2009

Catching elephants with mice: Sparse sampling for monitoring sensor networks.

Sorabh Gandhi, Subhash Suri, Emo Welzl

ACM Trans. Sens. Networks, 2009

Counting Triangulations of Planar Point Sets

Micha Sharir, Adam Sheffer, Emo Welzl

CoRR, 2009

Foreword.

Lars Arge, Emo Welzl

Algorithmica, 2009

Capacity of Arbitrary Wireless Networks.

Olga Goussevskaia, Roger Wattenhofer, Magnús M. Halldórsson, Emo Welzl

Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

The Lovász Local Lemma and Satisfiability.

Heidi Gebauer, Robin A. Moser, Dominik Scheder, Emo Welzl

Proceedings of the Efficient Algorithms, 2009

2008

Kleinster umschließender Kreis. (Ein Demokratiebeitrag aus der Schweiz?)

Emo Welzl

Proceedings of the Taschenbuch der Algorithmen, 2008

Algorithms for center and Tverberg points.

Pankaj K. Agarwal, Micha Sharir, Emo Welzl

ACM Trans. Algorithms, 2008

Number of Crossing-Free Geometric Graphs vs. Triangulations.

Andreas Razen, Jack Snoeyink, Emo Welzl

Electron. Notes Discret. Math., 2008

2007

Online Conflict-Free Coloring for Intervals.

Ke Chen, Amos Fiat, Haim Kaplan, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl

SIAM J. Comput., 2007

2006

On the Number of Crossing-Free Matchings, Cycles, and Partitions.

Micha Sharir, Emo Welzl

SIAM J. Comput., 2006

The Number of Triangulations on Planar Point Sets.

Emo Welzl

Proceedings of the Graph Drawing, 14th International Symposium, 2006

The Number of Crossing Free Configurations on Finite Point Sets in the Plane.

Emo Welzl

Proceedings of the FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science, 2006

Random triangulations of planar point sets.

Micha Sharir, Emo Welzl

Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005

Online conflict-free coloring for intervals.

Amos Fiat, Meital Levy, Jirí Matousek, Elchanan Mossel, János Pach, Micha Sharir, Shakhar Smorodinsky, Uli Wagner, Emo Welzl

Proceedings of the Sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2005

Interference in Cellular Networks: The Minimum Membership Set Cover Problem.

Fabian Kuhn, Pascal von Rickenbach, Roger Wattenhofer, Emo Welzl, Aaron Zollinger

Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004

Linear programming.

Martin E. Dyer, Nimrod Megiddo, Emo Welzl

Proceedings of the Handbook of Discrete and Computational Geometry, Second Edition., 2004

Algorithmic complexity of protein identification: combinatorics of weighted strings.

Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl

Discret. Appl. Math., 2004

Point-Line Incidences in Space.

Micha Sharir, Emo Welzl

Comb. Probab. Comput., 2004

Off-line Admission Control for Advance Reservations in Star Networks.

Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Geometric Optimization and Unique Sink Orientations of Cubes p.

Emo Welzl

Proceedings of the Mathematical Foundations of Computer Science 2004, 2004

2003

Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes.

Jurriaan Hage, Tero Harju, Emo Welzl

Fundam. Informaticae, 2003

In between k -Sets, j -Facets, and i -Faces: (i , j) - Partitions.

Artur Andrzejak, Emo Welzl

Discret. Comput. Geom., 2003

2002

Running Time Analysis of Multi-objective Evolutionary Algorithms on a Simple Discrete Optimization Problem.

Marco Laumanns, Lothar Thiele, Eckart Zitzler, Emo Welzl, Kalyanmoy Deb

Proceedings of the Parallel Problem Solving from Nature, 2002

Algorithmic Complexity of Protein Identification: Searching in Weighted Strings.

Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl

Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

Translating a Planar Object to Maximize Point Containment.

Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl

Proceedings of the Algorithms, 2002

2001

Entering and Leaving <i>j</i>-Facets.

Emo Welzl

Discret. Comput. Geom., 2001

A Continuous Analogue of the Upper Bound Theorem.

Uli Wagner, Emo Welzl

Discret. Comput. Geom., 2001

A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization.

Bernd Gärtner, Emo Welzl

Discret. Comput. Geom., 2001

Crossing-free segments and triangles in point configurations.

Gyula Károlyi, Emo Welzl

Discret. Appl. Math., 2001

Enumerating triangulation paths.

Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl

Comput. Geom., 2001

One line and n points.

Bernd Gärtner, József Solymosi, Falk Tschirschnitz, Emo Welzl, Pavel Valtr

Proceedings of the Proceedings on 33rd Annual ACM Symposium on Theory of Computing, 2001

Unique Sink Orientations of Cubes.

Tibor Szabó, Emo Welzl

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

Balanced lines, halving triangles, and the generalized lower bound theorem.

Micha Sharir, Emo Welzl

Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

Explicit and Implicit Enforcing - Randomized Optimization.

Bernd Gärtner, Emo Welzl

Proceedings of the Computational Discrete Mathematics, Advanced Lectures, 2001

2000

On a simple sampling lemma.

Bernd Gärtner, Emo Welzl

Proceedings of the Computing: the Australasian Theory Symposium, 2000

A class of point-sets with few k-sets.

Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy, Emo Welzl

Comput. Geom., 2000

<i>n</i> Points and One Line: Analysis of Randomized Games.

Emo Welzl

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2000

Origin-embracing distributions or a continuous analogue of the upper bound theorem.

Uli Wagner, Emo Welzl

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

Random sampling in geometric optimization: new insights and applications.

Bernd Gärtner, Emo Welzl

Proceedings of the Sixteenth Annual Symposium on Computational Geometry, 2000

1998

Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions.

L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl

J. Algorithms, 1998

The Discrete 2-Center Problem.

Pankaj K. Agarwal, Micha Sharir, Emo Welzl

Discret. Comput. Geom., 1998

Approximation of convex figures by pairs of rectangles.

Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl

Comput. Geom., 1998

One Sided Error Predicates in Geometric Computing.

Lutz Kettner, Emo Welzl

Proceedings of the Fundamentals - Foundations of Computer Science, 1998

Results on <i>k</i>-Sets and <i>j</i>-Facets via Continuous Motion.

Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, Emo Welzl

Proceedings of the Fourteenth Annual Symposium on Computational Geometry, 1998

1997

Space-Filling Curves and Their Use in the Design of Geometric Data Structures.

Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer

Theor. Comput. Sci., 1997

The rank of sparse random matrices over finite fields.

Johannes Blömer, Richard M. Karp, Emo Welzl

Random Struct. Algorithms, 1997

Cutting Dense Point Sets in Half.

Herbert Edelsbrunner, Pavel Valtr, Emo Welzl

Discret. Comput. Geom., 1997

Fast Greedy Triangulation Algorithms.

Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl

Comput. Geom., 1997

Piecewise Linear Approximation of Bézier-Curves.

Helmut Alt, Emo Welzl, Barbara Wolfers

Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

Contour Edge Analysis for Polyhedron Projections.

Lutz Kettner, Emo Welzl

Proceedings of the Geometric Modeling: Theory and Practice, 1997

1996

Guest Editor's Foreword.

Emo Welzl

Discret. Comput. Geom., 1996

A Subexponential Bound for Linear Programming.

Jirí Matousek, Micha Sharir, Emo Welzl

Algorithmica, 1996

Linear Programming - Randomization and Abstract Frameworks.

Bernd Gärtner, Emo Welzl

Proceedings of the STACS 96, 1996

Rectilinear and Polygonal <i>p</i>-Piercing and <i>p</i>-Center Problems.

Micha Sharir, Emo Welzl

Proceedings of the Twelfth Annual Symposium on Computational Geometry, 1996

1995

Improved Bounds on Weak epsilon-Nets for Convex Sets.

Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl

Discret. Comput. Geom., 1995

Minimal Enclosing Parallelogram with Application.

Christian Schwarz, Jürgen Teich, Alek Vainshtein, Emo Welzl, Brian L. Evans

Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994

Fat Triangles Determine Linearly Many Holes.

Jirí Matousek, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl

SIAM J. Comput., 1994

Surface Reconstruction Between Simple Polygons via Angle Criteria.

Emo Welzl, Barbara Wolfers

J. Symb. Comput., 1994

Vapnik-Chervonenkis Dimension and (Pseudo-)Hyperplane Arrangements.

Bernd Gärtner, Emo Welzl

Discret. Comput. Geom., 1994

Gram's Equation - A Probabilistic Proof.

Emo Welzl

Proceedings of the Results and Trends in Theoretical Computer Science, 1994

1993

Drawing Graphs in the Plane with High Resolution.

Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger

SIAM J. Comput., 1993

Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection.

Kurt Mehlhorn, Micha Sharir, Emo Welzl

Comput. Geom., 1993

Discrepancy and approximations for bounded VC-dimension.

Jirí Matousek, Emo Welzl, Lorenz Wernisch

Comb., 1993

Weaving Patterns of Lines and Line Segments in Space.

János Pach, Richard Pollack, Emo Welzl

Algorithmica, 1993

Shortest Paths for Line Segments.

Christian Icking, Günter Rote, Emo Welzl, Chee-Keng Yap

Algorithmica, 1993

1992

Good Splitters for Counting Points in Triangles.

Jirí Matousek, Emo Welzl

J. Algorithms, 1992

Polynomial graph-colorings.

Wolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger

Discret. Appl. Math., 1992

Simultaneous Inner and Outer Approximation of Shapes.

Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap

Algorithmica, 1992

Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems.

Bernard Chazelle, Micha Sharir, Emo Welzl

Algorithmica, 1992

New Results on Linear Programming and Related Problems.

Emo Welzl

Proceedings of the Algorithm Theory, 1992

A Combinatorial Bound for Linear Programming and Related Problems.

Micha Sharir, Emo Welzl

Proceedings of the STACS 92, 1992

Tail Estimates for the Space Complexity of Randomized Incremental Algorithms.

Kurt Mehlhorn, Micha Sharir, Emo Welzl

Proceedings of the Third Annual ACM/SIGACT-SIAM Symposium on Discrete Algorithms, 1992

On Spanning Trees with Low Crossing Numbers.

Emo Welzl

Proceedings of the Data Structures and Efficient Algorithms, 1992

1991

Discrepancy and epsilon-approximations for bounded VC-dimension

Jirí Matousek, Emo Welzl, Lorenz Wernisch

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

Fat Triangles Determine Linearly Many Holes

Jirí Matousek, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl

Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

The Post Office Problem for Fuzzy Point Sets.

Franz Aurenhammer, Gerd Stöckl, Emo Welzl

Proceedings of the Computational Geometry, 1991

Smallest enclosing disks (balls and ellipsoids).

Emo Welzl

Proceedings of the New Results and New Trends in Computer Science, 1991

1990

Boundary Graph Grammars with Dynamic Edge Relabeling.

Joost Engelfriet, George Leih, Emo Welzl

J. Comput. Syst. Sci., 1990

Ranking intervals under visibility constraints.

Herbert Edelsbrunner, Mark H. Overmars, Emo Welzl, Irith Ben-Arroyo Hartman, Jack A. Feldman

Int. J. Comput. Math., 1990

Combinatorial Complexity Bounds for Arrangement of Curves and Spheres.

Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl

Discret. Comput. Geom., 1990

Efficient Parallel Computation of Arrangements of Hyperplanes in d Dimensions.

Torben Hagerup, H. Jung, Emo Welzl

Proceedings of the 2nd Annual ACM Symposium on Parallel Algorithms and Architectures, 1990

Weaving Patterns of Lines and Segments in Space.

János Pach, Richard Pollack, Emo Welzl

Proceedings of the Algorithms, 1990

How to Net a Lot with Little: Small epsilon-Nets for Disks and Halfspaces.

Jirí Matousek, Raimund Seidel, Emo Welzl

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs.

Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl

Proceedings of the Sixth Annual Symposium on Computational Geometry, 1990

1989

Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane.

Herbert Edelsbrunner, Günter Rote, Emo Welzl

Theor. Comput. Sci., 1989

Implicitly Representing Arrangements of Lines or Segments.

Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl

Discret. Comput. Geom., 1989

Quasi-Optimal Range Searching in Space of Finite VC-Dimension.

Bernard Chazelle, Emo Welzl

Discret. Comput. Geom., 1989

1988

Visibility graphs and obstacle-avoiding shortest paths.

Helmut Alt, Emo Welzl

ZOR Methods Model. Oper. Res., 1988

Congruence, Similarity, and Symmetries of Geometric Objects.

Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl

Discret. Comput. Geom., 1988

Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces

Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl

Proceedings of the 29th Annual Symposium on Foundations of Computer Science, 1988

Partition Trees for Triangle Counting and Other Range Searching Problems.

Emo Welzl

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

New Methods for Computing Visibility Graphs.

Mark H. Overmars, Emo Welzl

Proceedings of the Fourth Annual Symposium on Computational Geometry, 1988

1987

epsilon-Nets and Simplex Range Queries.

David Haussler, Emo Welzl

Discret. Comput. Geom., 1987

Combinatorial properties of boundary NLC graph languages.

Grzegorz Rozenberg, Emo Welzl

Discret. Appl. Math., 1987

String grammars with disconnecting or a basic root of the difficulty in graph grammar parsing.

Klaus-Jörn Lange, Emo Welzl

Discret. Appl. Math., 1987

Partitioning and Geometric Embedding of Range Spaces of Finite Vapnik-Chervonenkis Dimension.

Noga Alon, David Haussler, Emo Welzl

Proceedings of the Third Annual Symposium on Computational Geometry, 1987

1986

Constructing Belts in Two-Dimensional Arrangements with Applications.

Herbert Edelsbrunner, Emo Welzl

SIAM J. Comput., 1986

On the maximal number of edges of many faces in an arrangement.

Herbert Edelsbrunner, Emo Welzl

J. Comb. Theory A, 1986

The Bounded Degree Problem for NLC Grammars is Decidable.

Dirk Janssens, Grzegorz Rozenberg, Emo Welzl

J. Comput. Syst. Sci., 1986

Trace Languages Defined by Regular String Languages.

IJsbrand Jan Aalbersberg, Emo Welzl

RAIRO Theor. Informatics Appl., 1986

Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time.

Herbert Edelsbrunner, Emo Welzl

Inf. Process. Lett., 1986

Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity

Grzegorz Rozenberg, Emo Welzl

Inf. Control., 1986

More on k-Sets of Finite Sets in the Plane.

Emo Welzl

Discret. Comput. Geom., 1986

Graph Theoretic Closure Properties of the Family of Boundary NLC Graph Languages.

Grzegorz Rozenberg, Emo Welzl

Acta Informatica, 1986

Boundary NlC and partition controlled graph grammars.

Emo Welzl

Proceedings of the Graph-Grammars and Their Application to Computer Science, 1986

1985

Complexity and Decidability for Chain Code Picture Languages.

Ivan Hal Sudborough, Emo Welzl

Theor. Comput. Sci., 1985

Recurrent Words and Simultaneous Growth in T0L Systems.

Klaus-Jörn Lange, Emo Welzl

Theor. Comput. Sci., 1985

On the Number of Line Separations of a Finite Set in the Plane.

Herbert Edelsbrunner, Emo Welzl

J. Comb. Theory A, 1985

Constructing the Visibility Graph for n-Line Segments in O(n²) Time.

Emo Welzl

Inf. Process. Lett., 1985

A simple method for solving 2-dimensional static range searching.

Mark H. Overmars, Emo Welzl

Bull. EATCS, 1985

String grammars with disconnecting.

Klaus-Jörn Lange, Emo Welzl

Proceedings of the Fundamentals of Computation Theory, 1985

The complexity of cutting paper (extended abstract).

Mark H. Overmars, Emo Welzl

Proceedings of the First Annual Symposium on Computational Geometry, 1985

1984

Symmetric graphs and interpretations.

Emo Welzl

J. Comb. Theory B, 1984

Monotone Edge Sequences in Line Arrangements and Applications (Extended Abstract).

Herbert Edelsbrunner, Emo Welzl

Proceedings of the Mathematical Foundations of Computer Science 1984, 1984

Encoding Graphs by Derivations and Implications for the Theory of Graph Grammars.

Emo Welzl

Proceedings of the Automata, 1984

Boundary NLC Grammars.

Grzegorz Rozenberg, Emo Welzl

Proceedings of the CAAP'84, 1984

1983

On the Number of Equal-Sized Semisapces of a Set of Points in the Plane (Extended Abstract).

Herbert Edelsbrunner, Emo Welzl

Proceedings of the Automata, 1983

Two Way Finite State Generators.

Karel Culík II, Emo Welzl

Proceedings of the Fundamentals of Computation Theory, 1983

1982

Using String Languages to Describe Picture Languages

Hermann A. Maurer, Grzegorz Rozenberg, Emo Welzl

Inf. Control., September, 1982

Color-Families are Dense.

Emo Welzl

Theor. Comput. Sci., 1982

Stabbing Line Segments.

Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood

BIT, 1982

Chain code picture languages.

Hermann A. Maurer, Grzegorz Rozenberg, Emo Welzl

Proceedings of the Graph-Grammars and Their Application to Computer Science, 1982

1981

On the Complexity of the General Coloring Problem

Hermann A. Maurer, Ivan Hal Sudborough, Emo Welzl

Inf. Control., November, 1981

On the Density of Color-Families.

Emo Welzl

Proceedings of the Automata, 1981