Your search returned the following 27 documents:

27. Balls into bins via local search: cover time and maximum load
    Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, and He Sun
    In: 31st Symposium on Theoretical Aspects of Computer Science (STACS-14), Lyon, France, 2014
    
26. Approximation Quality of the Hypervolume Indicator
    Karl Bringmann and Tobias Friedrich
    Artificial Intelligence 195: 265–290 p., 2013
    
25. Bringing Order to Special Cases of Klee’s Measure Problem
    Karl Bringmann
    In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), Klosterneuburg, Austria, 2013, 207-218
    
24. Counting Triangulations Approximately
    Victor Alvarez, Karl Bringmann, Saurabh Ray, and Raimund Seidel
    In: 25th Canadian Conference on Computational Geometry (CCCG-13), Waterloo, Ontario, Canada, 2013, 85-89
    
23. Exact and Efficient Generation of Geometric Random Variates and Random Graphs
    Karl Bringmann and Tobias Friedrich
    In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), Riga, Latvia, 2013, 267-278
    
22. Minimizing maximum (weighted) flow-time on related and unrelated machines
    S Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, and Amit Kumar
    In: Automata, Languages, and Programming - 40th International Colloquium (ICALP-13), Riga, Latvia, 2013, 13-24
    
21. Online Checkpointing with Improved Worst-Case Guarantees
    Karl Bringmann, Benjamin Doerr, Adrian Neumann, and Jakub Sliacan
    In: Automata, Languages, and Programming - 40th International Colloquium (ICALP 2013), Riga, Latvia, 2013, 255-266
    
20. Parameterized Average-Case Complexity of the Hypervolume Indicator
    Karl Bringmann and Tobias Friedrich
    In: 15th Annual Conference on Genetic and Evolutionary Computation (GECCO-13), Amsterdam, The Netherlands, 2013, 575-582
    
19. Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems
    Karl Bringmann, Christian Engels, Bodo Manthey, and B. V. Raghavendra Rao
    In: 38th International Symposium on Mathematical Foundations of Computer Science (MFCS-13), Klosterneuburg, Austria, 2013, 219-230
    
18. Speeding Up Many-Objective Optimization by Monte Carlo Approximations
    Karl Bringmann, Tobias Friedrich, Christian Igel, and Thomas Voß
    Artificial Intelligence 204: 22–29 p., 2013
    
17. Succinct Sampling from Discrete Distributions
    Karl Bringmann and Kasper Green Larsen
    In: 45th ACM Symposium on Theory of Computing (STOC-13), Palo Alto, USA, 2013, 775-782
    
16. An improved algorithm for Klee's measure problem on fat boxes
    Karl Bringmann
    Computational Geometry: Theory and Applications 45 (5-6): 225-233, 2012
    
    
15. Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
    Karl Bringmann and Tobias Friedrich
    Theoretical Computer Science 425: 104-116, 2012
    
14. Convergence of Hypervolume-Based Archiving Algorithms II: Competitiveness
    Karl Bringmann and Tobias Friedrich
    In: GECCO'12 : Proceedings of the Fourteenth International Conference on Genetic and Evolutionary Computation, Philadelphia, USA, 2012, 457-464
    
    
13. Counting Crossing Free Structures
    Victor Alvarez, Karl Bringmann, Radu Curticapean, and Saurabh Ray
    In: Proceedings of the Twenty-Eight Annual Symposium on Computational Geometry (SCG'12), Chapel Hill, NC, USA, 2012, 61-68
    
    
12. Efficient Sampling Methods for Discrete Distributions
    Karl Bringmann and Konstantinos Panagiotou
    In: Automata, Languages, and Programming : 39th International Colloquium, ICALP 2012, Warwick, UK, 2012, 133-144
    
    
11. Remarks on Category-Based Routing in Social Networks
    Karl Bringmann, Kurt Mehlhorn, and Adrian Neumann
    
    
    
10. Approximation-guided evolutionary multi-objective optimization
    Karl Bringmann, Tobias Friedrich, Frank Neumann, and Markus Wagner
    In: Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), Barcelona, Spain, 2011, 1198-1203
    
9. Convergence of Hypervolume-Based Archiving Algorithms I: Effectiveness
   Karl Bringmann and Tobias Friedrich
   In: GECCO 2011 : Genetic and Evolutionary Computation Conference, Dublin, Ireland, 2011, 745-752
   
8. The Logarithmic Hypervolume Indicator
   Tobias Friedrich, Karl Bringmann, Thomas Voss, and Christian Igel
   In: FOGA'11 : Proceedings of the 2011 ACM/SIGEVO Foundations of Genetic Algorithms XI, Schwarzenberg, Austria, 2011, 81-92
   
7. An Efficient Algorithm for Computing Hypervolume Contributions
   Karl Bringmann and Tobias Friedrich
   Evolutionary Computation 18 (3): 383-402, 2010
   
6. Approximating the volume of unions and intersections of high-dimensional geometric objects
   Karl Bringmann and Tobias Friedrich
   Computational Geometry 43 (6-7): 601-610, 2010
   
5. The Maximum Hypervolume Set Yields Near-optimal Approximation
   Karl Bringmann and Tobias Friedrich
   In: 12th annual conference on Genetic and evolutionary computation (GECCO 2010), Portland, USA, 2010, 511-518
   
4. Tight Bounds for the Approximation Ratio of the Hypervolume Indicator
   Karl Bringmann and Tobias Friedrich
   In: Parallel Problem Solving from Nature - PPSN XI. - Pt. 1, Krakow, Poland, 2010, 607-616
   
3. Approximating the volume of unions and intersections of high-dimensional geometric objects.
   Karl Bringmann and Tobias Friedrich
   In: Proceedings of the 19th International Symposium on Algorithms and Computation (ISAAC 2008), Gold Coast, Australia, 2008, 436-447
   
2. Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
   Karl Bringmann and Tobias Friedrich
   In: Evolutionary Multi-Criterion Optimization : 5th International Conference, EMO 2009, Nantes, France, 2009, 6-20
   
1. Don't be greedy when calculating hypervolume contributions
   Karl Bringmann and Tobias Friedrich
   In: FOGA'09 : revised selected papers from ACM SIGEVO Foundations of Genetic Algorithms X, Orlando, USA, 2009, 103-112