The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Bernd Gärtner: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Bernd Gärtner, Emo Welzl
    Explicit and Implicit Enforcing - Randomized Optimization. [Citation Graph (0, 0)][DBLP]
    Computational Discrete Mathematics, 2001, pp:25-46 [Conf]
  2. Adrian Dumitrescu, Bernd Gärtner, Samuele Pedroni, Emo Welzl
    Enumerating Triangulation Paths. [Citation Graph (0, 0)][DBLP]
    CCCG, 2000, pp:- [Conf]
  3. Bernd Gärtner, Thomas Herrmann
    Computing the width of a point set in 3-space. [Citation Graph (0, 0)][DBLP]
    CCCG, 2001, pp:101-103 [Conf]
  4. Kaspar Fischer, Bernd Gärtner
    The smallest enclosing ball of balls: combinatorial structure and algorithms. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2003, pp:292-301 [Conf]
  5. Bernd Gärtner
    Pitfalls in computing with pseudorandom determinants. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:148-155 [Conf]
  6. Bernd Gärtner, Sven Schönherr
    An efficient, exact, and generic quadratic programming solver for geometric optimization. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2000, pp:110-118 [Conf]
  7. Bernd Gärtner, Sven Schönherr
    Exact Primitives for Smallest Enclosing Ellipses. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1997, pp:430-432 [Conf]
  8. 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]
  9. Christoph Ambühl, Samarjit Chakraborty, Bernd Gärtner
    Computing Largest Common Point Sets under Approximate Congruence. [Citation Graph (0, 0)][DBLP]
    ESA, 2000, pp:52-63 [Conf]
  10. Kaspar Fischer, Bernd Gärtner, Martin Kutz
    Fast Smallest-Enclosing-Ball Computation in High Dimensions. [Citation Graph (0, 0)][DBLP]
    ESA, 2003, pp:630-641 [Conf]
  11. Bernd Gärtner
    Fast and Robust Smallest Enclosing Balls. [Citation Graph (0, 0)][DBLP]
    ESA, 1999, pp:325-338 [Conf]
  12. Bernd Gärtner, Jirí Matousek, Leo Rüst, Petr Skovron
    Violator Spaces: Structure and Algorithms. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:387-398 [Conf]
  13. Bernd Gärtner, Leo Rüst
    Simple Stochastic Games and P-Matrix Generalized Linear Complementarity Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:209-220 [Conf]
  14. Bernd Gärtner
    A Subexponential Algorithm for Abstract Optimization Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1992, pp:464-472 [Conf]
  15. Bernd Gärtner, Günter M. Ziegler
    Randomized Simplex Algorithms on Klee-Mintny Cubes [Citation Graph (0, 0)][DBLP]
    FOCS, 1994, pp:502-510 [Conf]
  16. Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel
    Optimal Projective Algorithms for the List Update Problem. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:305-316 [Conf]
  17. Bernd Gärtner, Walter D. Morris, Leo Rüst
    Unique Sink Orientations of Grids. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:210-224 [Conf]
  18. Bernd Gärtner
    Combinatorial Linear Programming: Geometry Can Help. [Citation Graph (0, 0)][DBLP]
    RANDOM, 1998, pp:82-96 [Conf]
  19. Bernd Gärtner
    Exact Arithmetic at Low Cost - A Case Study in Linear Programming. [Citation Graph (0, 0)][DBLP]
    SODA, 1998, pp:157-166 [Conf]
  20. Bernd Gärtner, Ingo Schurr
    Linear programming and unique sink orientations. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:749-757 [Conf]
  21. Bernd Gärtner, Emo Welzl
    Linear Programming - Randomization and Abstract Frameworks. [Citation Graph (0, 0)][DBLP]
    STACS, 1996, pp:669-687 [Conf]
  22. 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]
  23. Bernd Gärtner, Martin Henk, Günter M. Ziegler
    Randomized Simplex Algorithms on Klee-Minty Cubes. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1998, v:18, n:3, pp:349-372 [Journal]
  24. 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]
  25. Bernd Gärtner
    Exact arithmetic at low cost - A case study in linear programming. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1999, v:13, n:2, pp:121-139 [Journal]
  26. Stefan Felsner, Bernd Gärtner, Falk Tschirschnitz
    Grid Orientations, (d, d+2)-Polytopes, and Arrangements of Pseudolines. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2005, v:34, n:3, pp:411-437 [Journal]
  27. 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]
  28. 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]
  29. Kaspar Fischer, Bernd Gärtner
    The smallest enclosing ball of balls: combinatorial structure and algorithms. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2004, v:14, n:4-5, pp:341-378 [Journal]
  30. Bernd Gärtner, Sven Schönherr
    Exact Primitives for Smallest Enclosing Ellipses. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:68, n:1, pp:33-38 [Journal]
  31. Oswin Aichholzer, Franz Aurenhammer, David Alberts, Bernd Gärtner
    A Novel Type of Skeleton for Polygons. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1995, v:1, n:12, pp:752-761 [Journal]
  32. Bernd Gärtner
    The Random-Facet simplex algorithm on combinatorial cubes. [Citation Graph (0, 0)][DBLP]
    Random Struct. Algorithms, 2002, v:20, n:3, pp:353-381 [Journal]
  33. Bernd Gärtner
    A Subexponential Algorithm for Abstract Optimization Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:5, pp:1018-1035 [Journal]
  34. Christoph Ambühl, Bernd Gärtner, Bernhard von Stengel
    A new lower bound for the list update problem in the partial cost model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:268, n:1, pp:3-16 [Journal]
  35. 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]
  36. Bernd Gärtner, Remco C. Veltkamp
    A decade of CGAL. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:38, n:1-2, pp:1-3 [Journal]
  37. Bernd Gärtner, Jirka Matousek, Leo Rüst, Petr Skovron
    Violator Spaces: Structure and Algorithms [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  38. The Domination Heuristic for LP-type Problems. [Citation Graph (, )][DBLP]


  39. Clarkson's Algorithm for Violator Spaces. [Citation Graph (, )][DBLP]


  40. Coresets for polytope distance. [Citation Graph (, )][DBLP]


  41. Unique Sink Orientations of Grids. [Citation Graph (, )][DBLP]


  42. Ranking Unit Squares with Few Visibilities [Citation Graph (, )][DBLP]


  43. An Exponential Lower Bound on the Complexity of Regularization Paths [Citation Graph (, )][DBLP]


  44. A Combinatorial Algorithm to Compute Regularization Paths [Citation Graph (, )][DBLP]


  45. Clarksons Algorithm for Violator Spaces [Citation Graph (, )][DBLP]


  46. Optimal Projective Algorithms for the List Update Problem [Citation Graph (, )][DBLP]


  47. Violator spaces: Structure and algorithms. [Citation Graph (, )][DBLP]


  48. Pivoting in Linear Complementarity: Two Polynomial-Time Cases. [Citation Graph (, )][DBLP]


Search in 0.013secs, Finished in 0.015secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002