dblp.uni-trier.dewww.uni-trier.de

Emo Welzl

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2008
139EEEmo Welzl: Kleinster umschließender Kreis (Ein Demokratiebeitrag aus der Schweiz?). Taschenbuch der Algorithmen 2008: 385-388
138EEPankaj K. Agarwal, Micha Sharir, Emo Welzl: Algorithms for center and Tverberg points. ACM Transactions on Algorithms 5(1): (2008)
137EEAndreas Razen, Jack Snoeyink, Emo Welzl: Number of Crossing-Free Geometric Graphs vs. Triangulations. Electronic Notes in Discrete Mathematics 31: 195-200 (2008)
2007
136 Lars Arge, Michael Hoffmann, Emo Welzl: Algorithms - ESA 2007, 15th Annual European Symposium, Eilat, Israel, October 8-10, 2007, Proceedings Springer 2007
135EESorabh Gandhi, Subhash Suri, Emo Welzl: Catching elephants with mice: sparse sampling for monitoring sensor networks. SenSys 2007: 261-274
134EEKe 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)
2006
133EEEmo Welzl: The Number of Crossing Free Configurations on Finite Point Sets in the Plane. FSTTCS 2006: 20
132EEEmo Welzl: The Number of Triangulations on Planar Point Sets. Graph Drawing 2006: 1-4
131EEMicha Sharir, Emo Welzl: On the number of crossing-free matchings, (cycles, and partitions). SODA 2006: 860-869
130EEMicha Sharir, Emo Welzl: Random triangulations of planar point sets. Symposium on Computational Geometry 2006: 273-281
129EEMicha Sharir, Emo Welzl: On the Number of Crossing-Free Matchings, Cycles, and Partitions. SIAM J. Comput. 36(3): 695-720 (2006)
2005
128EEFabian Kuhn, Pascal von Rickenbach, Roger Wattenhofer, Emo Welzl, Aaron Zollinger: Interference in Cellular Networks: The Minimum Membership Set Cover Problem. COCOON 2005: 188-198
127EEAmos 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
126EEEmo Welzl: Geometric Optimization and Unique Sink Orientations of Cubes p. MFCS 2004: 176
125EEPankaj K. Agarwal, Micha Sharir, Emo Welzl: Algorithms for center and Tverberg points. Symposium on Computational Geometry 2004: 61-67
124EEUdo 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
123 Micha Sharir, Emo Welzl: Point-Line Incidences in Space. Combinatorics, Probability & Computing 13(2): 203-220 (2004)
122EEMark 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)
2003
121EEArtur Andrzejak, Emo Welzl: In between k -Sets, j -Facets, and i -Faces: (i , j) - Partitions. Discrete & Computational Geometry 29(1): 105-131 (2003)
120EEJurriaan Hage, Tero Harju, Emo Welzl: Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes. Fundam. Inform. 58(1): 23-37 (2003)
2002
119EEPankaj 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
118EEJurriaan Hage, Tero Harju, Emo Welzl: Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes. ICGT 2002: 148-160
117 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
116EEMarco 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
115EEMicha Sharir, Emo Welzl: Point-line incidences in space. Symposium on Computational Geometry 2002: 107-115
2001
114EEBernd Gärtner, Emo Welzl: Explicit and Implicit Enforcing - Randomized Optimization. Computational Discrete Mathematics 2001: 25-46
113 Tibor Szabó, Emo Welzl: Unique Sink Orientations of Cubes. FOCS 2001: 547-555
112EEBernd Gärtner, József Solymosi, Falk Tschirschnitz, Emo Welzl, Pavel Valtr: One line and n points. STOC 2001: 306-315
111EEMicha Sharir, Emo Welzl: Balanced lines, halving triangles, and the generalized lower bound theorem. Symposium on Computational Geometry 2001: 315-318
110 Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl: Enumerating triangulation paths. Comput. Geom. 20(1-2): 3-12 (2001)
109EEEmo Welzl: Entering and Leaving j-Facets. Discrete & Computational Geometry 25(3): 351-364 (2001)
108EEBernd Gärtner, Emo Welzl: A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization. Discrete & Computational Geometry 25(4): 569-590 (2001)
107EEUli Wagner, Emo Welzl: A Continuous Analogue of the Upper Bound Theorem. Discrete & Computational Geometry 26(2): 205-219 (2001)
106 Gyula Károlyi, Emo Welzl: Crossing-free segments and triangles in point configurations. Discrete Applied Mathematics 115(1-3): 77-88 (2001)
2000
105 Ugo Montanari, José D. P. Rolim, Emo Welzl: Automata, Languages and Programming, 27th International Colloquium, ICALP 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings Springer 2000
104EEAdrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl: Enumerating Triangulation Paths. CCCG 2000
103EEUli Wagner, Emo Welzl: Origin-embracing distributions or a continuous analogue of the upper bound theorem. Symposium on Computational Geometry 2000: 50-56
102EEBernd Gärtner, Emo Welzl: Random sampling in geometric optimization: new insights and applications. Symposium on Computational Geometry 2000: 91-99
101EEEmo Welzl: n Points and One Line: Analysis of Randomized Games. WG 2000: 11-12
100 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)
99EEBernd Gärtner, Emo Welzl: On a simple sampling lemma. Electr. Notes Theor. Comput. Sci. 31: (2000)
1998
98 Lutz Kettner, Emo Welzl: One Sided Error Predicates in Geometric Computing. IFIP Congress: Fundamentals - Foundations of Computer Science 1998: 13-26
97EEArtur 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
96 Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl: Approximation of convex figures by pairs of rectangles. Comput. Geom. 10(2): 77-87 (1998)
95EEPankaj K. Agarwal, Micha Sharir, Emo Welzl: The Discrete 2-Center Problem. Discrete & Computational Geometry 20(3): 287-305 (1998)
94 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)
1997
93EEPankaj K. Agarwal, Micha Sharir, Emo Welzl: The Discrete 2-Center Problem. Symposium on Computational Geometry 1997: 147-155
92EEHelmut Alt, Emo Welzl, Barbara Wolfers: Piecewise Linear Approximation of Bézier-Curves. Symposium on Computational Geometry 1997: 433-435
91 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)
90 Emo Welzl, Herbert Edelsbrunner, Roman Waupotitsch: A Combinatorial Approach to Cartograms. Comput. Geom. 7: 343-360 (1997)
89 Emo Welzl, Peter Su, Robert L. (Scot) Drysdale III: A Comparison of Sequential Delaunay Triangulation Algorithms. Comput. Geom. 7: 361-385 (1997)
88 Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl: Fast Greedy Triangulation Algorithms. Comput. Geom. 8: 67-86 (1997)
87EEHerbert Edelsbrunner, Pavel Valtr, Emo Welzl: Cutting Dense Point Sets in Half. Discrete & Computational Geometry 17(3): 243-255 (1997)
86 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)
85EETetsuo 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)
1996
84 Bernd Gärtner, Emo Welzl: Linear Programming - Randomization and Abstract Frameworks. STACS 1996: 669-687
83EEMicha Sharir, Emo Welzl: Rectilinear and Polygonal p-Piercing and p-Center Problems. Symposium on Computational Geometry 1996: 122-132
82 Jirí Matousek, Micha Sharir, Emo Welzl: A Subexponential Bound for Linear Programming. Algorithmica 16(4/5): 498-516 (1996)
81EEEmo Welzl: Guest Editor's Foreword. Discrete & Computational Geometry 16(4): 315-315 (1996)
1995
80 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
79 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
78EEChristian Schwarz, Jürgen Teich, Alek Vainshtein, Emo Welzl, Brian L. Evans: Minimal Enclosing Parallelogram with Application. Symposium on Computational Geometry 1995: C34-C35
77 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)
1994
76 Emo Welzl: Gram's Equation - A Probabilistic Proof. Results and Trends in Theoretical Computer Science 1994: 422-424
75EEHerbert Edelsbrunner, Pavel Valtr, Emo Welzl: Cutting Dense Point Sets in Half. Symposium on Computational Geometry 1994: 203-209
74EEMatthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl: Fast Greedy Triangulation Algorithms. Symposium on Computational Geometry 1994: 211-220
73 Bernd Gärtner, Emo Welzl: Vapnik-Chervonenkis Dimension and (Pseudo-)Hyperplane Arrangements. Discrete & Computational Geometry 12: 399-432 (1994)
72 Emo Welzl, Barbara Wolfers: Surface Reconstruction Between Simple Polygons via Angle Criteria. J. Symb. Comput. 17(4): 351-369 (1994)
71 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)
1993
70 Emo Welzl, Barbara Wolfers: Surface Reconstruction Between Simple Polygons via Angle Criteria. ESA 1993: 397-408
69EEBernard 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
68 Christian Icking, Günter Rote, Emo Welzl, Chee-Keng Yap: Shortest Paths for Line Segments. Algorithmica 10(2-4): 182-200 (1993)
67 János Pach, Richard Pollack, Emo Welzl: Weaving Patterns of Lines and Line Segments in Space. Algorithmica 9(6): 561-571 (1993)
66 Jirí Matousek, Emo Welzl, Lorenz Wernisch: Discrepancy and approximations for bounded VC-dimension. Combinatorica 13(4): 455-466 (1993)
65 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)
64 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)
1992
63 Emo Welzl: On Spanning Trees with Low Crossing Numbers. Data Structures and Efficient Algorithms 1992: 233-249
62EEKurt Mehlhorn, Micha Sharir, Emo Welzl: Tail Estimates for the Space Complexity of Randomized Incremental Algorithms. SODA 1992: 89-93
61 Micha Sharir, Emo Welzl: A Combinatorial Bound for Linear Programming and Related Problems. STACS 1992: 569-579
60 Emo Welzl: New Results on Linear Programming and Related Problems. SWAT 1992: 338-339
59EEJirí Matousek, Micha Sharir, Emo Welzl: A Subexponential Bound for Linear Programming. Symposium on Computational Geometry 1992: 1-8
58 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)
57 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)
56EEWolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger: Polynomial graph-colorings. Discrete Applied Mathematics 35(1): 29-45 (1992)
55 Jirí Matousek, Emo Welzl: Good Splitters for Counting Points in Triangles. J. Algorithms 13(2): 307-319 (1992)
1991
54 Jirí Matousek, Emo Welzl, Lorenz Wernisch: Discrepancy and epsilon-approximations for bounded VC-dimension FOCS 1991: 424-430
53 Jirí Matousek, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl: Fat Triangles Determine Linearly Many Holes FOCS 1991: 49-58
52 Franz Aurenhammer, Gerd Stöckl, Emo Welzl: The Post Office Problem for Fuzzy Point Sets. Workshop on Computational Geometry 1991: 1-11
1990
51 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
50 János Pach, Richard Pollack, Emo Welzl: Weaving Patterns of Lines and Segments in Space. SIGAL International Symposium on Algorithms 1990: 439-446
49EETorben Hagerup, H. Jung, Emo Welzl: Efficient Parallel Computation of Arrangements of Hyperplanes in d Dimensions. SPAA 1990: 290-297
48 Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl: Approximation of Convex Figures by Pairs of Rectangles. STACS 1990: 240-249
47EEPankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl: Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. Symposium on Computational Geometry 1990: 203-210
46EERudolf 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
45EEBernard Chazelle, Micha Sharir, Emo Welzl: Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. Symposium on Computational Geometry 1990: 23-33
44 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)
43 Joost Engelfriet, George Leih, Emo Welzl: Boundary Graph Grammars with Dynamic Edge Relabeling. J. Comput. Syst. Sci. 40(3): 307-345 (1990)
1989
42 Wolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger: Polynomial Graph-Colorings. STACS 1989: 108-119
41EEJirí Matousek, Emo Welzl: Good Splitters for Counting Points in Triangles. Symposium on Computational Geometry 1989: 124-130
40 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)
39 Bernard Chazelle, Emo Welzl: Quasi-Optimal Range Searching in Space of Finite VC-Dimension. Discrete & Computational Geometry 4: 467-489 (1989)
38 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)
1988
37 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
36EEMark H. Overmars, Emo Welzl: New Methods for Computing Visibility Graphs. Symposium on Computational Geometry 1988: 164-171
35EEEmo Welzl: Partition Trees for Triangle Counting and Other Range Searching Problems. Symposium on Computational Geometry 1988: 23-33
34EEHerbert 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
33 Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl: Congruence, Similarity, and Symmetries of Geometric Objects. Discrete & Computational Geometry 3: 237-256 (1988)
1987
32 Herbert Edelsbrunner, Günter Rote, Emo Welzl: Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. ICALP 1987: 364-375
31EEHelmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl: Congruence, Similarity, and Symmetries of Geometric Objects. Symposium on Computational Geometry 1987: 308-315
30EENoga Alon, David Haussler, Emo Welzl: Partitioning and Geometric Embedding of Range Spaces of Finite Vapnik-Chervonenkis Dimension. Symposium on Computational Geometry 1987: 331-340
29 David Haussler, Emo Welzl: epsilon-Nets and Simplex Range Queries. Discrete & Computational Geometry 2: 127-151 (1987)
1986
28 Emo Welzl: Boundary NlC and partition controlled graph grammars. Graph-Grammars and Their Application to Computer Science 1986: 593-609
27EEDavid Haussler, Emo Welzl: Epsilon-Nets and Simplex Range Queries. Symposium on Computational Geometry 1986: 61-71
26 Grzegorz Rozenberg, Emo Welzl: Graph Theoretic Closure Properties of the Family of Boundary NLC Graph Languages. Acta Inf. 23(3): 289-309 (1986)
25 Emo Welzl: More on k-Sets of Finite Sets in the Plane. Discrete & Computational Geometry 1: 95-100 (1986)
24 IJsbrand Jan Aalbersberg, Emo Welzl: Trace Languages Defined by Regular String Languages. ITA 20(2): 103-119 (1986)
23 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)
22 Grzegorz Rozenberg, Emo Welzl: Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity Information and Control 69(1-3): 136-167 (1986)
21EEHerbert 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)
20 Dirk Janssens, Grzegorz Rozenberg, Emo Welzl: The Bounded Degree Problem for NLC Grammars is Decidable. J. Comput. Syst. Sci. 33(3): 415-422 (1986)
19 Herbert Edelsbrunner, Emo Welzl: Constructing Belts in Two-Dimensional Arrangements with Applications. SIAM J. Comput. 15(1): 271-284 (1986)
1985
18 Klaus-Jörn Lange, Emo Welzl: String grammars with disconnecting. FCT 1985: 249-256
17 Mark H. Overmars, Emo Welzl: A simple method for solving 2-dimensional static range searching. Bulletin of the EATCS 25: 31-33 (1985)
16 Emo Welzl: Constructing the Visibility Graph for n-Line Segments in O(n²) Time. Inf. Process. Lett. 20(4): 167-171 (1985)
15 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)
14 Klaus-Jörn Lange, Emo Welzl: Recurrent Words and Simultaneous Growth in T0L Systems. Theor. Comput. Sci. 35: 1-15 (1985)
13 Ivan Hal Sudborough, Emo Welzl: Complexity and Decidability for Chain Code Picture Languages. Theor. Comput. Sci. 36: 173-202 (1985)
1984
12 Grzegorz Rozenberg, Emo Welzl: Boundary NLC Grammars. CAAP 1984: 257-270
11 Emo Welzl: Encoding Graphs by Derivations and Implications for the Theory of Graph Grammars. ICALP 1984: 503-513
10 Herbert Edelsbrunner, Emo Welzl: Monotone Edge Sequences in Line Arrangements and Applications (Extended Abstract). MFCS 1984: 265-272
9EEEmo Welzl: Symmetric graphs and interpretations. J. Comb. Theory, Ser. B 37(3): 235-244 (1984)
1983
8 Karel Culik II, Emo Welzl: Two Way Finite State Generators. FCT 1983: 106-114
7 Herbert Edelsbrunner, Emo Welzl: On the Number of Equal-Sized Semisapces of a Set of Points in the Plane (Extended Abstract). ICALP 1983: 182-187
1982
6 Hermann A. Maurer, Grzegorz Rozenberg, Emo Welzl: Chain code picture languages. Graph-Grammars and Their Application to Computer Science 1982: 232-244
5 Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood: Stabbing Line Segments. BIT 22(3): 274-281 (1982)
4 Hermann A. Maurer, Grzegorz Rozenberg, Emo Welzl: Using String Languages to Describe Picture Languages Information and Control 54(3): 155-185 (1982)
3 Emo Welzl: Color-Families are Dense. Theor. Comput. Sci. 17: 29-41 (1982)
1981
2 Emo Welzl: On the Density of Color-Families. ICALP 1981: 68-72
1 Hermann A. Maurer, Ivan Hal Sudborough, Emo Welzl: On the Complexity of the General Coloring Problem Information and Control 51(2): 128-145 (1981)

Coauthor Index

1IJsbrand Jan Aalbersberg [24]
2Udo Adamy [124]
3Pankaj K. Agarwal [47] [93] [95] [119] [125] [138]
4Noga Alon [30]
5Helmut Alt [31] [33] [92] [100]
6Artur Andrzejak [97] [121]
7Lars Arge [136]
8Boris Aronov [97]
9Tetsuo Asano [80] [85]
10Franz Aurenhammer [52]
11Giuseppe Di Battista [91]
12Johannes Blömer [86]
13Bernard Chazelle [39] [45] [57] [69] [77]
14Ke Chen [134]
15Otfried Cheong (Otfried Schwarzkopf) [47] [48] [96]
16L. Paul Chew [79] [94]
17Mark Cieliebak [117] [122]
18Kenneth L. Clarkson [37] [44]
19Karel Culik II [8]
20Kalyanmoy Deb [116]
21Matthew Dickerson (Matthew T. Dickerson) [74] [88]
22Robert L. Scot Drysdale (Robert L. (Scot) Drysdale III) [74] [88] [89]
23Adrian Dumitrescu [104] [110]
24Herbert Edelsbrunner [5] [7] [10] [15] [19] [21] [23] [32] [34] [37] [38] [40] [44] [47] [69] [75] [77] [87] [90]
25Joost Engelfriet [43]
26Thomas Erlebach [117] [122] [124]
27Brian L. Evans [78]
28Stefan Felsner [100]
29Amos Fiat [127] [134]
30Rudolf Fleischer [46] [58]
31Michael Formann [51] [64]
32Ulrich Fuchs [48] [96]
33Sorabh Gandhi [135]
34Ashim Garg [91]
35Bernd Gärtner [73] [84] [99] [102] [104] [108] [110] [112] [114]
36Michelangelo Grigni [69] [77]
37Leonidas J. Guibas [34] [37] [40] [44] [69] [77]
38Wolfgang Gutjahr [42] [56]
39Jurriaan Hage [118] [120]
40Torben Hagerup [49] [51] [64] [119]
41Sariel Har-Peled [97]
42James Haralambides [51] [64]
43Tero Harju [118] [120]
44David Haussler [27] [29] [30]
45John Hershberger [34] [40]
46Michael Hoffmann [136]
47Ferran Hurtado [100]
48Christian Icking [68]
49Dirk Janssens [20]
50H. Jung [49]
51Haim Kaplan [134]
52Gyula Károlyi [106]
53Richard M. Karp [86]
54Michael Kaufmann [51] [64]
55Klara Kedem [79] [94]
56Lutz Kettner [98]
57Fabian Kuhn [128]
58Klaus-Jörn Lange [14] [18]
59Marco Laumanns [116]
60Frank Thomson Leighton (Tom Leighton) [51] [64]
61George Leih [43]
62Meital Levy [127] [134]
63Giuseppe Liotta [91]
64Zsuzsanna Lipták [117] [122]
65Jirí Matousek [41] [53] [54] [55] [59] [66] [71] [82] [127] [134]
66Hermann A. Maurer [1] [4] [5] [6]
67Scott A. McElfresh [74] [88]
68Kurt Mehlhorn [31] [33] [46] [58] [62] [65]
69Nathaly Miller [53]
70Dieter Mitsche [124]
71Ugo Montanari [105]
72Elchanan Mossel [127] [134]
73Marc Noy [100]
74Mark H. Overmars [17] [36]
75János Pach [50] [53] [67] [71] [127] [134]
76Samuele Pedroni [104] [110]
77Richard Pollack [50] [67]
78Franco P. Preparata [5]
79Desh Ranjan [80] [85]
80Rahul Ray [119]
81Andreas Razen [137]
82Pascal von Rickenbach [128]
83José D. P. Rolim [105]
84Thomas Roos [80] [85]
85Arnold L. Rosenberg [5]
86Günter Rote [32] [38] [46] [48] [58] [68] [96]
87Grzegorz Rozenberg [4] [6] [12] [20] [22] [26]
88Ingo Schurr [124]
89Christian Schwarz [78]
90Raimund Seidel [34] [40] [97]
91Micha Sharir [34] [37] [40] [44] [45] [53] [57] [59] [61] [62] [65] [69] [71] [77] [79] [82] [83] [93] [94] [95] [111] [115] [119] [123] [125] [127] [129] [130] [131] [134] [138]
92Shmuel Sifrony [53] [71]
93Michiel H. M. Smid [119]
94Shakhar Smorodinsky [127] [134]
95Jack Snoeyink [34] [40] [137]
96József Solymosi [112]
97Bettina Speckmann [124]
98Gerd Stöckl [52]
99Jens Stoye [117] [122]
100Peter Su [89]
101Ivan Hal Sudborough [1] [13]
102Subhash Suri [135]
103Antonios Symvonis [51] [64]
104Tibor Szabó [113]
105Boaz Tagansky [79] [94]
106Roberto Tamassia [91]
107Emanuele Tassinari [91]
108Jürgen Teich [78]
109Lothar Thiele [116]
110Falk Tschirschnitz [112]
111Alek Vainshtein (Alexander Vainshtein) [78]
112Pavel Valtr [75] [87] [112]
113Francesco Vargiu [91]
114Hubert Wagener [31] [33]
115Uli Wagner [103] [107] [127] [134]
116Roger Wattenhofer [128]
117Roman Waupotitsch [90]
118Lorenz Wernisch [54] [66]
119Peter Widmayer [80] [85]
120Gerhard J. Woeginger [42] [51] [56] [64]
121Barbara Wolfers [70] [72] [92]
122Derick Wood [5]
123Chee-Keng Yap (Chee Yap) [46] [58] [68]
124Eckart Zitzler [116]
125Aaron Zollinger [128]

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)