The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Emo Welzl: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David Haussler, Emo Welzl
    Epsilon-Nets and Simplex Range Queries. [Citation Graph (1, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:61-71 [Conf]
  2. Emo Welzl
    Partition Trees for Triangle Counting and Other Range Searching Problems. [Citation Graph (1, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:23-33 [Conf]
  3. Herbert Edelsbrunner, Emo Welzl
    Constructing Belts in Two-Dimensional Arrangements with Applications. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:1, pp:271-284 [Journal]
  4. Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer
    Space-Filling Curves and Their Use in the Design of Geometric Data Structures. [Citation Graph (1, 0)][DBLP]
    Theor. Comput. Sci., 1997, v:181, n:1, pp:3-15 [Journal]
  5. Bernd Gärtner, Emo Welzl
    Explicit and Implicit Enforcing - Randomized Optimization. [Citation Graph (0, 0)][DBLP]
    Computational Discrete Mathematics, 2001, pp:25-46 [Conf]
  6. Emo Welzl
    Gram's Equation - A Probabilistic Proof. [Citation Graph (0, 0)][DBLP]
    Results and Trends in Theoretical Computer Science, 1994, pp:422-424 [Conf]
  7. Grzegorz Rozenberg, Emo Welzl
    Boundary NLC Grammars. [Citation Graph (0, 0)][DBLP]
    CAAP, 1984, pp:257-270 [Conf]
  8. Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl
    Enumerating Triangulation Paths. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  9. Franz Aurenhammer, Gerd Stöckl, Emo Welzl
    The Post Office Problem for Fuzzy Point Sets. [Citation Graph (0, 0)][DBLP]
    Workshop on Computational Geometry, 1991, pp:1-11 [Conf]
  10. Fabian Kuhn, Pascal von Rickenbach, Roger Wattenhofer, Emo Welzl, Aaron Zollinger
    Interference in Cellular Networks: The Minimum Membership Set Cover Problem. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:188-198 [Conf]
  11. Artur Andrzejak, Boris Aronov, Sariel Har-Peled, Raimund Seidel, Emo Welzl
    Results on k-Sets and j-Facets via Continuous Motion. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1998, pp:192-199 [Conf]
  12. Pankaj K. Agarwal, Herbert Edelsbrunner, Otfried Schwarzkopf, Emo Welzl
    Euclidean Minimum Spanning Trees and Bichromatic Closest Pairs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:203-210 [Conf]
  13. Pankaj K. Agarwal, Micha Sharir, Emo Welzl
    Algorithms for center and Tverberg points. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:61-67 [Conf]
  14. Pankaj K. Agarwal, Micha Sharir, Emo Welzl
    The Discrete 2-Center Problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:147-155 [Conf]
  15. Noga Alon, David Haussler, Emo Welzl
    Partitioning and Geometric Embedding of Range Spaces of Finite Vapnik-Chervonenkis Dimension. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:331-340 [Conf]
  16. Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl
    Congruence, Similarity, and Symmetries of Geometric Objects. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1987, pp:308-315 [Conf]
  17. Helmut Alt, Emo Welzl, Barbara Wolfers
    Piecewise Linear Approximation of Bézier-Curves. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:433-435 [Conf]
  18. Bernard Chazelle, Micha Sharir, Emo Welzl
    Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:23-33 [Conf]
  19. Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl
    Fast Greedy Triangulation Algorithms. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:211-220 [Conf]
  20. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl
    Implicitly Representing Arrangements of Lines or Segments. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:56-69 [Conf]
  21. Herbert Edelsbrunner, Pavel Valtr, Emo Welzl
    Cutting Dense Point Sets in Half. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1994, pp:203-209 [Conf]
  22. Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
    On Simultaneous Inner and Outer Approximation of Shapes. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1990, pp:216-224 [Conf]
  23. Bernd Gärtner, Emo Welzl
    Random sampling in geometric optimization: new insights and applications. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:91-99 [Conf]
  24. Jirí Matousek, Micha Sharir, Emo Welzl
    A Subexponential Bound for Linear Programming. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:1-8 [Conf]
  25. Jirí Matousek, Emo Welzl
    Good Splitters for Counting Points in Triangles. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1989, pp:124-130 [Conf]
  26. Mark H. Overmars, Emo Welzl
    New Methods for Computing Visibility Graphs. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1988, pp:164-171 [Conf]
  27. Christian Schwarz, Jürgen Teich, Alek Vainshtein, Emo Welzl, Brian L. Evans
    Minimal Enclosing Parallelogram with Application. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:0-0 [Conf]
  28. Micha Sharir, Emo Welzl
    Balanced lines, halving triangles, and the generalized lower bound theorem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:315-318 [Conf]
  29. Micha Sharir, Emo Welzl
    Point-line incidences in space. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:107-115 [Conf]
  30. Micha Sharir, Emo Welzl
    Random triangulations of planar point sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:273-281 [Conf]
  31. Micha Sharir, Emo Welzl
    Rectilinear and Polygonal p-Piercing and p-Center Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1996, pp:122-132 [Conf]
  32. Uli Wagner, Emo Welzl
    Origin-embracing distributions or a continuous analogue of the upper bound theorem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:50-56 [Conf]
  33. Emo Welzl
    On Spanning Trees with Low Crossing Numbers. [Citation Graph (0, 0)][DBLP]
    Data Structures and Efficient Algorithms, 1992, pp:233-249 [Conf]
  34. Pankaj K. Agarwal, Torben Hagerup, Rahul Ray, Micha Sharir, Michiel H. M. Smid, Emo Welzl
    Translating a Planar Object to Maximize Point Containment. [Citation Graph (0, 0)][DBLP]
    ESA, 2002, pp:42-53 [Conf]
  35. Emo Welzl, Barbara Wolfers
    Surface Reconstruction Between Simple Polygons via Angle Criteria. [Citation Graph (0, 0)][DBLP]
    ESA, 1993, pp:397-408 [Conf]
  36. Karel Culik II, Emo Welzl
    Two Way Finite State Generators. [Citation Graph (0, 0)][DBLP]
    FCT, 1983, pp:106-114 [Conf]
  37. Klaus-Jörn Lange, Emo Welzl
    String grammars with disconnecting. [Citation Graph (0, 0)][DBLP]
    FCT, 1985, pp:249-256 [Conf]
  38. Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl
    Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:568-579 [Conf]
  39. 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 [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:86-95 [Conf]
  40. Jirí Matousek, Emo Welzl, Lorenz Wernisch
    Discrepancy and epsilon-approximations for bounded VC-dimension [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:424-430 [Conf]
  41. Jirí Matousek, Nathaly Miller, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl
    Fat Triangles Determine Linearly Many Holes [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:49-58 [Conf]
  42. Tibor Szabó, Emo Welzl
    Unique Sink Orientations of Cubes. [Citation Graph (0, 0)][DBLP]
    FOCS, 2001, pp:547-555 [Conf]
  43. Emo Welzl
    The Number of Crossing Free Configurations on Finite Point Sets in the Plane. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2006, pp:20- [Conf]
  44. Emo Welzl
    The Number of Triangulations on Planar Point Sets. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:1-4 [Conf]
  45. Jurriaan Hage, Tero Harju, Emo Welzl
    Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes. [Citation Graph (0, 0)][DBLP]
    ICGT, 2002, pp:148-160 [Conf]
  46. Hermann A. Maurer, Grzegorz Rozenberg, Emo Welzl
    Chain code picture languages. [Citation Graph (0, 0)][DBLP]
    Graph-Grammars and Their Application to Computer Science, 1982, pp:232-244 [Conf]
  47. Emo Welzl
    Boundary NlC and partition controlled graph grammars. [Citation Graph (0, 0)][DBLP]
    Graph-Grammars and Their Application to Computer Science, 1986, pp:593-609 [Conf]
  48. Herbert Edelsbrunner, Günter Rote, Emo Welzl
    Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. [Citation Graph (0, 0)][DBLP]
    ICALP, 1987, pp:364-375 [Conf]
  49. Herbert Edelsbrunner, Emo Welzl
    On the Number of Equal-Sized Semisapces of a Set of Points in the Plane (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:182-187 [Conf]
  50. Emo Welzl
    On the Density of Color-Families. [Citation Graph (0, 0)][DBLP]
    ICALP, 1981, pp:68-72 [Conf]
  51. Emo Welzl
    Encoding Graphs by Derivations and Implications for the Theory of Graph Grammars. [Citation Graph (0, 0)][DBLP]
    ICALP, 1984, pp:503-513 [Conf]
  52. Lutz Kettner, Emo Welzl
    One Sided Error Predicates in Geometric Computing. [Citation Graph (0, 0)][DBLP]
    IFIP Congress: Fundamentals - Foundations of Computer Science, 1998, pp:13-26 [Conf]
  53. Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl
    Algorithmic Complexity of Protein Identification: Searching in Weighted Strings. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:143-156 [Conf]
  54. Tetsuo Asano, Desh Ranjan, Thomas Roos, Emo Welzl, Peter Widmayer
    Space Filling Curves and Their Use in the Design of Geometric Data Structures. [Citation Graph (0, 0)][DBLP]
    LATIN, 1995, pp:36-48 [Conf]
  55. Herbert Edelsbrunner, Emo Welzl
    Monotone Edge Sequences in Line Arrangements and Applications (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 1984, pp:265-272 [Conf]
  56. Emo Welzl
    Geometric Optimization and Unique Sink Orientations of Cubes p. [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:176- [Conf]
  57. Marco Laumanns, Lothar Thiele, Eckart Zitzler, Emo Welzl, Kalyanmoy Deb
    Running Time Analysis of Multi-objective Evolutionary Algorithms on a Simple Discrete Optimization Problem. [Citation Graph (0, 0)][DBLP]
    PPSN, 2002, pp:44-53 [Conf]
  58. János Pach, Richard Pollack, Emo Welzl
    Weaving Patterns of Lines and Segments in Space. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:439-446 [Conf]
  59. L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl
    Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:197-204 [Conf]
  60. 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. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:545-554 [Conf]
  61. Kurt Mehlhorn, Micha Sharir, Emo Welzl
    Tail Estimates for the Space Complexity of Randomized Incremental Algorithms. [Citation Graph (0, 0)][DBLP]
    SODA, 1992, pp:89-93 [Conf]
  62. Micha Sharir, Emo Welzl
    On the number of crossing-free matchings, (cycles, and partitions). [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:860-869 [Conf]
  63. Torben Hagerup, H. Jung, Emo Welzl
    Efficient Parallel Computation of Arrangements of Hyperplanes in d Dimensions. [Citation Graph (0, 0)][DBLP]
    SPAA, 1990, pp:290-297 [Conf]
  64. Bernd Gärtner, Emo Welzl
    Linear Programming - Randomization and Abstract Frameworks. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:669-687 [Conf]
  65. Wolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger
    Polynomial Graph-Colorings. [Citation Graph (0, 0)][DBLP]
    STACS, 1989, pp:108-119 [Conf]
  66. Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl
    Approximation of Convex Figures by Pairs of Rectangles. [Citation Graph (0, 0)][DBLP]
    STACS, 1990, pp:240-249 [Conf]
  67. Micha Sharir, Emo Welzl
    A Combinatorial Bound for Linear Programming and Related Problems. [Citation Graph (0, 0)][DBLP]
    STACS, 1992, pp:569-579 [Conf]
  68. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl
    Improved bounds on weak epsilon-nets for convex sets. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:495-504 [Conf]
  69. Bernd Gärtner, József Solymosi, Falk Tschirschnitz, Emo Welzl, Pavel Valtr
    One line and n points. [Citation Graph (0, 0)][DBLP]
    STOC, 2001, pp:306-315 [Conf]
  70. Emo Welzl
    New Results on Linear Programming and Related Problems. [Citation Graph (0, 0)][DBLP]
    SWAT, 1992, pp:338-339 [Conf]
  71. Udo Adamy, Thomas Erlebach, Dieter Mitsche, Ingo Schurr, Bettina Speckmann, Emo Welzl
    Off-line Admission Control for Advance Reservations in Star Networks. [Citation Graph (0, 0)][DBLP]
    WAOA, 2004, pp:211-224 [Conf]
  72. Emo Welzl
    n Points and One Line: Analysis of Randomized Games. [Citation Graph (0, 0)][DBLP]
    WG, 2000, pp:11-12 [Conf]
  73. Grzegorz Rozenberg, Emo Welzl
    Graph Theoretic Closure Properties of the Family of Boundary NLC Graph Languages. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1986, v:23, n:3, pp:289-309 [Journal]
  74. Bernard Chazelle, Micha Sharir, Emo Welzl
    Quasi-Optimal Upper Bounds for Simplex Range Searching and New Zone Theorems. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:5&6, pp:407-429 [Journal]
  75. Rudolf Fleischer, Kurt Mehlhorn, Günter Rote, Emo Welzl, Chee-Keng Yap
    Simultaneous Inner and Outer Approximation of Shapes. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1992, v:8, n:5&6, pp:365-389 [Journal]
  76. Christian Icking, Günter Rote, Emo Welzl, Chee-Keng Yap
    Shortest Paths for Line Segments. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:10, n:2-4, pp:182-200 [Journal]
  77. Jirí Matousek, Micha Sharir, Emo Welzl
    A Subexponential Bound for Linear Programming. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1996, v:16, n:4/5, pp:498-516 [Journal]
  78. János Pach, Richard Pollack, Emo Welzl
    Weaving Patterns of Lines and Line Segments in Space. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1993, v:9, n:6, pp:561-571 [Journal]
  79. Herbert Edelsbrunner, Hermann A. Maurer, Franco P. Preparata, Arnold L. Rosenberg, Emo Welzl, Derick Wood
    Stabbing Line Segments. [Citation Graph (0, 0)][DBLP]
    BIT, 1982, v:22, n:3, pp:274-281 [Journal]
  80. Jirí Matousek, Emo Welzl, Lorenz Wernisch
    Discrepancy and approximations for bounded VC-dimension. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1993, v:13, n:4, pp:455-466 [Journal]
  81. Helmut Alt, Stefan Felsner, Ferran Hurtado, Marc Noy, Emo Welzl
    A class of point-sets with few k-sets. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2000, v:16, n:2, pp:95-101 [Journal]
  82. Matthew Dickerson, Robert L. (Scot) Drysdale III, Scott A. McElfresh, Emo Welzl
    Fast Greedy Triangulation Algorithms. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:8, n:, pp:67-86 [Journal]
  83. Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl
    Enumerating triangulation paths. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2001, v:20, n:1-2, pp:3-12 [Journal]
  84. Kurt Mehlhorn, Micha Sharir, Emo Welzl
    Tail Estimates for the Efficiency of Randomized Incremental Algorithms for Line Segment Intersection. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:235-246 [Journal]
  85. Emo Welzl, Giuseppe Di Battista, Ashim Garg, Giuseppe Liotta, Roberto Tamassia, Emanuele Tassinari, Francesco Vargiu
    An Experimental Comparison of Four Graph Drawing Algorithms. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:303-325 [Journal]
  86. Emo Welzl, Herbert Edelsbrunner, Roman Waupotitsch
    A Combinatorial Approach to Cartograms. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:343-360 [Journal]
  87. Emo Welzl, Peter Su, Robert L. (Scot) Drysdale III
    A Comparison of Sequential Delaunay Triangulation Algorithms. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1997, v:7, n:, pp:361-385 [Journal]
  88. Otfried Schwarzkopf, Ulrich Fuchs, Günter Rote, Emo Welzl
    Approximation of convex figures by pairs of rectangles. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1998, v:10, n:2, pp:77-87 [Journal]
  89. Micha Sharir, Emo Welzl
    Point-Line Incidences in Space. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 2004, v:13, n:2, pp:203-220 [Journal]
  90. Mark Cieliebak, Thomas Erlebach, Zsuzsanna Lipták, Jens Stoye, Emo Welzl
    Algorithmic complexity of protein identification: combinatorics of weighted strings. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:137, n:1, pp:27-46 [Journal]
  91. Gyula Károlyi, Emo Welzl
    Crossing-free segments and triangles in point configurations. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:115, n:1-3, pp:77-88 [Journal]
  92. Helmut Alt, Kurt Mehlhorn, Hubert Wagener, Emo Welzl
    Congruence, Similarity, and Symmetries of Geometric Objects. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1988, v:3, n:, pp:237-256 [Journal]
  93. Artur Andrzejak, Emo Welzl
    In between k -Sets, j -Facets, and i -Faces: (i , j) - Partitions. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2003, v:29, n:1, pp:105-131 [Journal]
  94. Pankaj K. Agarwal, Micha Sharir, Emo Welzl
    The Discrete 2-Center Problem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1998, v:20, n:3, pp:287-305 [Journal]
  95. Bernard Chazelle, Herbert Edelsbrunner, Michelangelo Grigni, Leonidas J. Guibas, Micha Sharir, Emo Welzl
    Improved Bounds on Weak epsilon-Nets for Convex Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1995, v:13, n:, pp:1-15 [Journal]
  96. Bernard Chazelle, Emo Welzl
    Quasi-Optimal Range Searching in Space of Finite VC-Dimension. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:467-489 [Journal]
  97. Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl
    Combinatorial Complexity Bounds for Arrangement of Curves and Spheres. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1990, v:5, n:, pp:99-160 [Journal]
  98. Herbert Edelsbrunner, Leonidas J. Guibas, John Hershberger, Raimund Seidel, Micha Sharir, Jack Snoeyink, Emo Welzl
    Implicitly Representing Arrangements of Lines or Segments. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1989, v:4, n:, pp:433-466 [Journal]
  99. Herbert Edelsbrunner, Pavel Valtr, Emo Welzl
    Cutting Dense Point Sets in Half. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:17, n:3, pp:243-255 [Journal]
  100. Bernd Gärtner, Emo Welzl
    A Simple Sampling Lemma: Analysis and Applications in Geometric Optimization. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:4, pp:569-590 [Journal]
  101. Bernd Gärtner, Emo Welzl
    Vapnik-Chervonenkis Dimension and (Pseudo-)Hyperplane Arrangements. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1994, v:12, n:, pp:399-432 [Journal]
  102. David Haussler, Emo Welzl
    epsilon-Nets and Simplex Range Queries. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1987, v:2, n:, pp:127-151 [Journal]
  103. Uli Wagner, Emo Welzl
    A Continuous Analogue of the Upper Bound Theorem. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:26, n:2, pp:205-219 [Journal]
  104. Emo Welzl
    Entering and Leaving j-Facets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2001, v:25, n:3, pp:351-364 [Journal]
  105. Emo Welzl
    More on k-Sets of Finite Sets in the Plane. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1986, v:1, n:, pp:95-100 [Journal]
  106. Emo Welzl
    Guest Editor's Foreword. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1996, v:16, n:4, pp:315-315 [Journal]
  107. Mark H. Overmars, Emo Welzl
    A simple method for solving 2-dimensional static range searching. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1985, v:25, n:, pp:31-33 [Journal]
  108. Jurriaan Hage, Tero Harju, Emo Welzl
    Euler Graphs, Triangle-Free Graphs and Bipartite Graphs in Switching Classes. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:58, n:1, pp:23-37 [Journal]
  109. Hermann A. Maurer, Grzegorz Rozenberg, Emo Welzl
    Using String Languages to Describe Picture Languages [Citation Graph (0, 0)][DBLP]
    Information and Control, 1982, v:54, n:3, pp:155-185 [Journal]
  110. Hermann A. Maurer, Ivan Hal Sudborough, Emo Welzl
    On the Complexity of the General Coloring Problem [Citation Graph (0, 0)][DBLP]
    Information and Control, 1981, v:51, n:2, pp:128-145 [Journal]
  111. Grzegorz Rozenberg, Emo Welzl
    Boundary NLC Graph Grammars-Basic Definitions, Normal Forms, and Complexity [Citation Graph (0, 0)][DBLP]
    Information and Control, 1986, v:69, n:1-3, pp:136-167 [Journal]
  112. Herbert Edelsbrunner, Emo Welzl
    Halfplanar Range Search in Linear Space and O(n^(0.695)) Query Time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1986, v:23, n:6, pp:289-293 [Journal]
  113. Emo Welzl
    Constructing the Visibility Graph for n-Line Segments in O(n²) Time. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:20, n:4, pp:167-171 [Journal]
  114. IJsbrand Jan Aalbersberg, Emo Welzl
    Trace Languages Defined by Regular String Languages. [Citation Graph (0, 0)][DBLP]
    ITA, 1986, v:20, n:2, pp:103-119 [Journal]
  115. L. Paul Chew, Klara Kedem, Micha Sharir, Boaz Tagansky, Emo Welzl
    Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:29, n:2, pp:238-255 [Journal]
  116. Jirí Matousek, Emo Welzl
    Good Splitters for Counting Points in Triangles. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1992, v:13, n:2, pp:307-319 [Journal]
  117. Joost Engelfriet, George Leih, Emo Welzl
    Boundary Graph Grammars with Dynamic Edge Relabeling. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1990, v:40, n:3, pp:307-345 [Journal]
  118. Dirk Janssens, Grzegorz Rozenberg, Emo Welzl
    The Bounded Degree Problem for NLC Grammars is Decidable. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1986, v:33, n:3, pp:415-422 [Journal]
  119. Herbert Edelsbrunner, Emo Welzl
    On the Number of Line Separations of a Finite Set in the Plane. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1985, v:38, n:1, pp:15-29 [Journal]
  120. Herbert Edelsbrunner, Emo Welzl
    On the maximal number of edges of many faces in an arrangement. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 1986, v:41, n:2, pp:159-166 [Journal]
  121. Emo Welzl
    Symmetric graphs and interpretations. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:37, n:3, pp:235-244 [Journal]
  122. Emo Welzl, Barbara Wolfers
    Surface Reconstruction Between Simple Polygons via Angle Criteria. [Citation Graph (0, 0)][DBLP]
    J. Symb. Comput., 1994, v:17, n:4, pp:351-369 [Journal]
  123. Johannes Blömer, Richard M. Karp, Emo Welzl
    The rank of sparse random matrices over finite fields. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 1997, v:10, n:4, pp:407-419 [Journal]
  124. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:5, pp:1035-1052 [Journal]
  125. Jirí Matousek, János Pach, Micha Sharir, Shmuel Sifrony, Emo Welzl
    Fat Triangles Determine Linearly Many Holes. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:1, pp:154-169 [Journal]
  126. Micha Sharir, Emo Welzl
    On the Number of Crossing-Free Matchings, Cycles, and Partitions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2006, v:36, n:3, pp:695-720 [Journal]
  127. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2007, v:36, n:5, pp:1342-1359 [Journal]
  128. Herbert Edelsbrunner, Günter Rote, Emo Welzl
    Testing the Necklace Condition for Shortest Tours and Optimal Factors in the Plane. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1989, v:66, n:2, pp:157-180 [Journal]
  129. Bernd Gärtner, Emo Welzl
    On a simple sampling lemma. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2000, v:31, n:, pp:- [Journal]
  130. Klaus-Jörn Lange, Emo Welzl
    Recurrent Words and Simultaneous Growth in T0L Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:35, n:, pp:1-15 [Journal]
  131. Ivan Hal Sudborough, Emo Welzl
    Complexity and Decidability for Chain Code Picture Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:36, n:, pp:173-202 [Journal]
  132. Emo Welzl
    Color-Families are Dense. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:17, n:, pp:29-41 [Journal]

  133. The Lovász Local Lemma and Satisfiability. [Citation Graph (, )][DBLP]


  134. On degrees in random triangulations of point sets. [Citation Graph (, )][DBLP]


  135. The complexity of cutting paper (extended abstract). [Citation Graph (, )][DBLP]


  136. When Conflicting Constraints Can Be Resolved - The Lovász Local Lemma and Satisfiability. [Citation Graph (, )][DBLP]


  137. Capacity of Arbitrary Wireless Networks. [Citation Graph (, )][DBLP]


  138. Catching elephants with mice: sparse sampling for monitoring sensor networks. [Citation Graph (, )][DBLP]


  139. Foreword. [Citation Graph (, )][DBLP]


  140. Counting Triangulations of Planar Point Sets [Citation Graph (, )][DBLP]


  141. Polynomial graph-colorings. [Citation Graph (, )][DBLP]


Search in 0.010secs, Finished in 0.018secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002