Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Bringmann, Karl"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Parameterized complexity dichotomy for Steiner multicut
Karl Bringmann
,
Danny Hermelin
,
Matthias Mnich
,
Erik Jan van Leeuwen
Leibniz International Proceedings in Informatics (LIPIcs)
30
, 2015, pp. 157-170
De-anonymization of heterogeneous random graphs in quasilinear time
Karl Bringmann
,
Tobias Friedrich
,
Anton Krohmer
Lecture Notes in Computer Science
8737
, 2014, pp. 197-208
Internal DLA: Efficient simulation of a physical growth model
Karl Bringmann
,
Fabian Kuhn
,
Konstantinos Panagiotou
,
Ueli Peter
,
Henning Thomas
Lecture Notes in Computer Science
8572
, 2014, pp. 247-258
Balls into bins via local search: Cover time and maximum load
Karl Bringmann
,
Thomas Sauerwald
,
Alexandre Stauffer
,
He Sun
Leibniz International Proceedings in Informatics (LIPIcs)
25
, 2014, pp. 187-198
Minimizing maximum (weighted) flow-time on related and unrelated machines
S. Anand
,
Karl Bringmann
,
Tobias Friedrich
,
Naveen Garg
,
Amit Kumar
Lecture Notes in Computer Science
7965
, 2013, pp. 13-24
Online checkpointing with improved worst-case guarantees
Karl Bringmann
,
Benjamin Doerr
,
Adrian Neumann
,
Jakub Sliacan
Lecture Notes in Computer Science
7965
, 2013, pp. 255-266
Random shortest paths: Non-Euclidean instances for metric optimization problems
Karl Bringmann
,
Christian Engels
,
Bodo Manthey
,
B.V. Raghavendra Rao
Lecture Notes in Computer Science
8087
, 2013, pp. 219-230
Exact and efficient generation of geometric random variates and random graphs
Karl Bringmann
,
Tobias Friedrich
Lecture Notes in Computer Science
7965
, 2013, pp. 267-278
Succinct sampling from discrete distributions
Karl Bringmann
,
Kasper Green Larsen
Proceedings of the 45th ACM Symposium on Theory of Computing, STOC'2013 (Palo Alto, California, USA, June 1-4, 2013)
, 2013, pp. 775-782
Bringing order to special cases of Klee's measure problem
Karl Bringmann
Lecture Notes in Computer Science
8087
, 2013, pp. 207-218
Counting crossing-free structures
Victor Alvarez
,
Karl Bringmann
,
Radu Curticapean
,
Saurabh Ray
Proceedings of the 28th Annual Symposium on Computational Geometry, SCG'2012 (Chapel Hill, NC, USA, June 17-20, 2012)
, 2012, pp. 61-68
Approximating the least hypervolume contributor: NP-hard in general, but fast in practice
Karl Bringmann
,
Tobias Friedrich
Theoretical Computer Science
425
, 2012, pp. 104-116
Efficient sampling methods for discrete distributions
Karl Bringmann
,
Konstantinos Panagiotou
Lecture Notes in Computer Science
7391
, 2012, pp. 133-144
Approximating the volume of unions and intersections of high-dimensional geometric objects
Karl Bringmann
,
Tobias Friedrich
Lecture Notes in Computer Science
5369
, 2008, pp. 436-447