Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDKarl Bringmann
Person information
- affiliation: Max Planck Institute for Informatics, Saarbrücken, Germany
- affiliation: Saarland University, Department of Computer Science, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2021
[i52]Karl Bringmann, André Nusser:
Translating Hausdorff is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation. CoRR abs/2101.07696 (2021)- 2020
- [j26]Karl Bringmann, Thore Husfeldt
, Måns Magnusson:
Multivariate Analysis of Orthogonal Range Searching and Graph Distances. Algorithmica 82(8): 2292-2315 (2020) - [j25]Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can). ACM Trans. Algorithms 16(4): 48:1-48:22 (2020) - [c70]Karl Bringmann, Marvin Künnemann, André Nusser:
When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance Under Translation. ESA 2020: 25:1-25:17 - [c69]Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay:
Scheduling Lower Bounds via AND Subset Sum. ICALP 2020: 4:1-4:15 - [c68]Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz:
Faster Minimization of Tardy Processing Time on a Single Machine. ICALP 2020: 19:1-19:12 - [c67]Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann:
Impossibility Results for Grammar-Compressed Linear Algebra. NeurIPS 2020 - [c66]Karl Bringmann, Vasileios Nakos:
Top-k-convolution and the quest for near-linear output-sensitive subset sum. STOC 2020: 982-995 - [i51]Karl Bringmann, Nick Fischer, Danny Hermelin, Dvir Shabtay, Philip Wellnitz:
Faster Minimization of Tardy Processing\newline Time on a Single Machine. CoRR abs/2003.07104 (2020) - [i50]Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay:
Scheduling Lower Bounds via AND Subset Sum. CoRR abs/2003.07113 (2020) - [i49]Karl Bringmann, Marvin Künnemann, André Nusser:
When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation. CoRR abs/2008.07510 (2020) - [i48]Kyriakos Axiotis, Arturs Backurs, Karl Bringmann, Ce Jin, Vasileios Nakos, Christos Tzamos, Hongxun Wu:
Fast and Simple Modular Subset Sum. CoRR abs/2008.10577 (2020) - [i47]Karl Bringmann, Philip Wellnitz:
On Near-Linear-Time Algorithms for Dense Subset Sum. CoRR abs/2010.09096 (2020) - [i46]Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann:
Impossibility Results for Grammar-Compressed Linear Algebra. CoRR abs/2010.14181 (2020)
2010 – 2019
- 2019
- [j24]Karl Bringmann, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams:
Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. SIAM J. Comput. 48(2): 481-512 (2019) - [j23]Karl Bringmann, Ralph Keusch, Johannes Lengler:
Geometric inhomogeneous random graphs. Theor. Comput. Sci. 760: 35-54 (2019) - [c65]Karl Bringmann, Nick Fischer, Marvin Künnemann:
A Fine-Grained Analogue of Schaefer's Theorem in P: Dichotomy of Exists^k-Forall-Quantified First-Order Graph Properties. Computational Complexity Conference 2019: 31:1-31:27 - [c64]Karl Bringmann, Marvin Künnemann, André Nusser:
Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance. Symposium on Computational Geometry 2019: 17:1-17:21 - [c63]Karl Bringmann, Bhaskar Ray Chaudhury:
Polyline Simplification has Cubic Complexity. Symposium on Computational Geometry 2019: 18:1-18:16 - [c62]Karl Bringmann, Sándor Kisfaludi-Bak, Michal Pilipczuk, Erik Jan van Leeuwen:
On Geometric Set Cover for Orthants. ESA 2019: 26:1-26:18 - [c61]Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay:
SETH-Based Lower Bounds for Subset Sum and Bicriteria Path. SODA 2019: 41-57 - [c60]Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P. Woodruff:
A PTAS for ℓp-Low Rank Approximation. SODA 2019: 747-766 - [c59]Karl Bringmann, Philip Wellnitz, Marvin Künnemann:
Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts. SODA 2019: 1126-1145 - [c58]Karl Bringmann, Marvin Künnemann, André Nusser:
Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability. SODA 2019: 2902-2921 - [c57]Karl Bringmann:
Fine-Grained Complexity Theory (Tutorial). STACS 2019: 4:1-4:7 - [c56]Karl Bringmann, Marvin Künnemann, Karol Wegrzycki:
Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max. STOC 2019: 943-954 - [i45]Karl Bringmann, Marvin Künnemann, André Nusser:
Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance. CoRR abs/1901.01504 (2019) - [i44]Karl Bringmann, Marvin Künnemann, Karol Wegrzycki:
Approximating APSP without Scaling: Equivalence of Approximate Min-Plus and Exact Min-Max. CoRR abs/1907.11078 (2019) - [i43]Karl Bringmann:
Approximating Subset Sum is equivalent to Min-Plus-Convolution. CoRR abs/1912.12529 (2019) - 2018
- [j22]Karl Bringmann, Tobias Friedrich, Anton Krohmer:
De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. Algorithmica 80(11): 3397-3427 (2018) - [j21]Karl Bringmann, Sebastian Krinninger:
A note on hardness of diameter approximation. Inf. Process. Lett. 133: 10-15 (2018) - [j20]Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam:
On Algebraic Branching Programs of Small Width. J. ACM 65(5): 32:1-32:29 (2018) - [c55]Karl Bringmann, Bhaskar Ray Chaudhury:
Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS. FSTTCS 2018: 40:1-40:16 - [c54]Amir Abboud, Karl Bringmann:
Tighter Connections Between Formula-SAT and Shaving Logs. ICALP 2018: 8:1-8:18 - [c53]Karl Bringmann, Thore Husfeldt, Måns Magnusson:
Multivariate Analysis of Orthogonal Range Searching and Graph Distances. IPEC 2018: 4:1-4:13 - [c52]Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). SODA 2018: 1190-1206 - [c51]Karl Bringmann, Marvin Künnemann:
Multivariate Fine-Grained Complexity of Longest Common Subsequence. SODA 2018: 1216-1235 - [c50]Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof:
More consequences of falsifying SETH and the orthogonal vectors conjecture. STOC 2018: 253-266 - [c49]Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup:
Fast fencing. STOC 2018: 564-573 - [i42]Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann:
Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-And-Solve. CoRR abs/1803.00796 (2018) - [i41]Karl Bringmann, Philip Wellnitz:
Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. CoRR abs/1803.00804 (2018) - [i40]Julian Baldus, Karl Bringmann:
A fast implementation of near neighbors queries for Fréchet distance (GIS Cup). CoRR abs/1803.00806 (2018) - [i39]Karl Bringmann, Sergio Cabello, Michael T. M. Emmerich:
Maximum Volume Subset Selection for Anchored Boxes. CoRR abs/1803.00849 (2018) - [i38]Karl Bringmann, Marvin Künnemann:
Multivariate Fine-Grained Complexity of Longest Common Subsequence. CoRR abs/1803.00938 (2018) - [i37]Mikkel Abrahamsen, Anna Adamaszek, Karl Bringmann, Vincent Cohen-Addad, Mehran Mehr, Eva Rotenberg, Alan Roytman, Mikkel Thorup:
Fast Fencing. CoRR abs/1804.00101 (2018) - [i36]Amir Abboud, Karl Bringmann:
Tighter Connections Between Formula-SAT and Shaving Logs. CoRR abs/1804.08978 (2018) - [i35]Karl Bringmann, Thore Husfeldt, Måns Magnusson:
Multivariate Analysis of Orthogonal Range Searching and Graph Distances Parameterized by Treewidth. CoRR abs/1805.07135 (2018) - [i34]Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof:
More Consequences of Falsifying SETH and the Orthogonal Vectors Conjecture. CoRR abs/1805.08554 (2018) - [i33]Frank Ban, Vijay Bhattiprolu, Karl Bringmann, Pavel Kolev, Euiwoong Lee, David P. Woodruff:
A PTAS for 𝓁p-Low Rank Approximation. CoRR abs/1807.06101 (2018) - [i32]Karl Bringmann, Bhaskar Ray Chaudhury:
Polyline Simplification has Cubic Complexity. CoRR abs/1810.00621 (2018) - [i31]Karl Bringmann, Bhaskar Ray Chaudhury:
Sketching, Streaming, and Fine-Grained Complexity of (Weighted) LCS. CoRR abs/1810.01238 (2018) - [i30]Karl Bringmann, Marvin Künnemann, André Nusser:
Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability. CoRR abs/1810.10982 (2018) - 2017
- [j19]S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar:
Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. Algorithmica 77(2): 515-536 (2017) - [j18]Karl Bringmann, Konstantinos Panagiotou:
Efficient Sampling Methods for Discrete Distributions. Algorithmica 79(2): 484-508 (2017) - [j17]Karl Bringmann, Marvin Künnemann:
Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds. Int. J. Comput. Geom. Appl. 27(1-2): 85-120 (2017) - [c48]Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam:
On Algebraic Branching Programs of Small Width. Computational Complexity Conference 2017: 20:1-20:31 - [c47]Karl Bringmann, Sergio Cabello, Michael T. M. Emmerich:
Maximum Volume Subset Selection for Anchored Boxes. Symposium on Computational Geometry 2017: 22:1-22:15 - [c46]Karl Bringmann, Philip Wellnitz:
Clique-Based Lower Bounds for Parsing Tree-Adjoining Grammars. CPM 2017: 12:1-12:14 - [c45]Karl Bringmann, Ralph Keusch, Johannes Lengler:
Sampling Geometric Inhomogeneous Random Graphs in Linear Time. ESA 2017: 20:1-20:15 - [c44]Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Künnemann:
Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve. FOCS 2017: 192-203 - [c43]Karl Bringmann, Allan Grønlund, Kasper Green Larsen:
A Dichotomy for Regular Expression Membership Testing. FOCS 2017: 307-318 - [c42]Julian Baldus, Karl Bringmann:
A fast implementation of near neighbors queries for Fréchet distance (GIS Cup). SIGSPATIAL/GIS 2017: 99:1-99:4 - [c41]Karl Bringmann, Thomas Dueholm Hansen, Sebastian Krinninger:
Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. ICALP 2017: 124:1-124:16 - [c40]Karl Bringmann, Pavel Kolev, David P. Woodruff:
Approximation Algorithms for l0-Low Rank Approximation. NIPS 2017: 6648-6659 - [c39]Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, Anisur Rahaman Molla:
Greedy Routing and the Algorithmic Small-World Phenomenon. PODC 2017: 371-380 - [c38]Karl Bringmann:
A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum. SODA 2017: 1073-1084 - [c37]Karl Bringmann, Sebastian Krinninger:
Brief Announcement: A Note on Hardness of Diameter Approximation. DISC 2017: 44:1-44:3 - [i29]Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam:
On algebraic branching programs of small width. CoRR abs/1702.05328 (2017) - [i28]Karl Bringmann, Pawel Gawrychowski, Shay Mozes, Oren Weimann:
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (unless APSP can). CoRR abs/1703.08940 (2017) - [i27]Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay:
SETH-Based Lower Bounds for Subset Sum and Bicriteria Path. CoRR abs/1704.04546 (2017) - [i26]Karl Bringmann, Thomas Dueholm Hansen, Sebastian Krinninger:
Improved Algorithms for Computing the Cycle of Minimum Cost-to-Time Ratio in Directed Graphs. CoRR abs/1704.08122 (2017) - [i25]Karl Bringmann, Sebastian Krinninger:
A Note on Hardness of Diameter Approximation. CoRR abs/1705.02127 (2017) - [i24]Karl Bringmann, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams:
Truly Sub-cubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product. CoRR abs/1707.05095 (2017) - [i23]Karl Bringmann, Pavel Kolev, David P. Woodruff:
Approximation Algorithms for ࡁ0-Low Rank Approximation. CoRR abs/1710.11253 (2017) - [i22]Karl Bringmann, Christian Ikenmeyer, Jeroen Zuiddam:
On algebraic branching programs of small width. Electron. Colloquium Comput. Complex. 24: 34 (2017) - 2016
- [j16]Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen:
Parameterized complexity dichotomy for Steiner Multicut. J. Comput. Syst. Sci. 82(6): 1020-1043 (2016) - [j15]Karl Bringmann, Wolfgang Mulzer:
Approximability of the discrete Fréchet distance. J. Comput. Geom. 7(2): 46-76 (2016) - [j14]Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into bins via local search: Cover time and maximum load. Random Struct. Algorithms 48(4): 681-702 (2016) - [c36]Karl Bringmann, László Kozma, Shay Moran, N. S. Narayanaswamy:
Hitting Set for Hypergraphs of Low VC-dimension. ESA 2016: 23:1-23:18 - [c35]Karl Bringmann, Fabrizio Grandoni, Barna Saha, Virginia Vassilevska Williams:
Truly Sub-cubic Algorithms for Language Edit Distance and RNA-Folding via Fast Bounded-Difference Min-Plus Product. FOCS 2016: 375-384 - [i21]Karl Bringmann, Ralph Keusch, Johannes Lengler:
Average Distance in a General Class of Scale-Free Networks with Underlying Geometry. CoRR abs/1602.05712 (2016) - [i20]Karl Bringmann:
A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum. CoRR abs/1610.04712 (2016) - [i19]Karl Bringmann, Allan Grønlund, Kasper Green Larsen:
A Dichotomy for Regular Expression Membership Testing. CoRR abs/1611.00918 (2016) - [i18]Karl Bringmann, Ralph Keusch, Johannes Lengler, Yannic Maus, Anisur Rahaman Molla:
Greedy Routing and the Algorithmic Small-World Phenomenom. CoRR abs/1612.05539 (2016) - 2015
- [b1]Karl Bringmann:
Sampling from discrete distributions and computing Fréchet distances. Saarland University, 2015 - [j13]Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao:
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems. Algorithmica 73(1): 42-62 (2015) - [j12]Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel:
Counting triangulations and other crossing-free structures approximately. Comput. Geom. 48(5): 386-397 (2015) - [j11]Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray:
Counting Triangulations and Other Crossing-Free Structures via Onion Layers. Discret. Comput. Geom. 53(4): 675-690 (2015) - [j10]Karl Bringmann:
Sampling from Discrete Distributions and Computing Frechet Distances. Bull. EATCS 116 (2015) - [j9]Markus Wagner, Karl Bringmann, Tobias Friedrich, Frank Neumann:
Efficient optimization of many objectives by approximation-guided evolution. Eur. J. Oper. Res. 243(2): 465-479 (2015) - [j8]Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan:
Online Checkpointing with Improved Worst-Case Guarantees. INFORMS J. Comput. 27(3): 478-490 (2015) - [c34]Karl Bringmann, Tobias Friedrich, Patrick Klitzke:
Efficient computation of two-dimensional solution sets maximizing the epsilon-indicator. CEC 2015: 970-977 - [c33]Karl Bringmann, Wolfgang Mulzer:
Approximability of the Discrete Fréchet Distance. Symposium on Computational Geometry 2015: 739-753 - [c32]Karl Bringmann, Marvin Künnemann:
Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping. FOCS 2015: 79-97 - [c31]Karl Bringmann, Tobias Friedrich, Martin Hoefer, Ralf Rothenberger, Thomas Sauerwald:
Ultra-Fast Load Balancing on Scale-Free Networks. ICALP (2) 2015: 516-527 - [c30]Karl Bringmann, Marvin Künnemann:
Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds. ISAAC 2015: 517-528 - [c29]Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen:
Parameterized Complexity Dichotomy for Steiner Multicut. STACS 2015: 157-170 - [i17]Karl Bringmann, Marvin Künnemann:
Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping. CoRR abs/1502.01063 (2015) - [i16]Karl Bringmann, Ralph Keusch, Johannes Lengler:
Geometric Inhomogeneous Random Graphs. CoRR abs/1511.00576 (2015) - [i15]Karl Bringmann, László Kozma, Shay Moran, N. S. Narayanaswamy:
Hitting Set in hypergraphs of low VC-dimension. CoRR abs/1512.00481 (2015) - 2014
- [j7]Karl Bringmann, Tobias Friedrich:
Convergence of Hypervolume-Based Archiving Algorithms. IEEE Trans. Evol. Comput. 18(5): 643-657 (2014) - [c28]Karl Bringmann, Tobias Friedrich, Anton Krohmer:
De-anonymization of Heterogeneous Random Graphs in Quasilinear Time. ESA 2014: 197-208 - [c27]Karl Bringmann:
Why Walking the Dog Takes Time: Frechet Distance Has No Strongly Subquadratic Algorithms Unless SETH Fails. FOCS 2014: 661-670 - [c26]Karl Bringmann, Tobias Friedrich, Patrick Klitzke:
Two-dimensional subset selection for hypervolume and epsilon-indicator. GECCO 2014: 589-596 - [c25]Karl Bringmann:
Generierung diskreter Zufallsvariablen und Berechnung der Fréchetdistanz. Ausgezeichnete Informatikdissertationen 2014: 51-60 - [c24]Karl Bringmann, Fabian Kuhn, Konstantinos Panagiotou, Ueli Peter, Henning Thomas:
Internal DLA: Efficient Simulation of a Physical Growth Model - (Extended Abstract). ICALP (1) 2014: 247-258 - [c23]Karl Bringmann, Tobias Friedrich, Patrick Klitzke:
Generic Postprocessing via Subset Selection for Hypervolume and Epsilon-Indicator. PPSN 2014: 518-527 - [c22]Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into bins via local search: cover time and maximum load. STACS 2014: 187-198 - [i14]Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel:
Counting Triangulations and other Crossing-Free Structures Approximately. CoRR abs/1404.0261 (2014) - [i13]Karl Bringmann:
Why walking the dog takes time: Frechet distance has no strongly subquadratic algorithms unless SETH fails. CoRR abs/1404.1448 (2014) - [i12]Karl Bringmann, Danny Hermelin, Matthias Mnich, Erik Jan van Leeuwen:
Parameterized Complexity Dichotomy for Steiner Multicut. CoRR abs/1404.7006 (2014) - [i11]Karl Bringmann, Marvin Künnemann:
Improved approximation for Fréchet distance on c-packed curves matching conditional lower bounds. CoRR abs/1408.1340 (2014) - 2013
- [j6]Karl Bringmann, Tobias Friedrich:
Approximation quality of the hypervolume indicator. Artif. Intell. 195: 265-290 (2013) - [j5]Karl Bringmann, Tobias Friedrich, Christian Igel, Thomas Voß:
Speeding up many-objective optimization by Monte Carlo approximations. Artif. Intell. 204: 22-29 (2013) - [c21]Victor Alvarez, Karl Bringmann, Saurabh Ray, Raimund Seidel:
Counting Triangulations Approximately. CCCG 2013 - [c20]Karl Bringmann, Tobias Friedrich:
Parameterized average-case complexity of the hypervolume indicator. GECCO 2013: 575-582 - [c19]S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar:
Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. ICALP (1) 2013: 13-24 - [c18]Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan:
Online Checkpointing with Improved Worst-Case Guarantees. ICALP (1) 2013: 255-266 - [c17]Karl Bringmann, Tobias Friedrich:
Exact and Efficient Generation of Geometric Random Variates and Random Graphs. ICALP (1) 2013: 267-278 - [c16]Karl Bringmann:
Bringing Order to Special Cases of Klee's Measure Problem. MFCS 2013: 207-218 - [c15]Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao:
Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems. MFCS 2013: 219-230 - [c14]Karl Bringmann, Kasper Green Larsen:
Succinct sampling from discrete distributions. STOC 2013: 775-782 - [i10]Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan:
Online checkpointing with improved worst-case guarantees. CTW 2013: 23-26 - [i9]Karl Bringmann:
Bringing Order to Special Cases of Klee's Measure Problem. CoRR abs/1301.7154 (2013) - [i8]Karl Bringmann, Benjamin Doerr, Adrian Neumann, Jakub Sliacan:
Online Checkpointing with Improved Worst-Case Guarantees. CoRR abs/1302.4216 (2013) - [i7]Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao:
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems. CoRR abs/1306.3030 (2013) - [i6]Karl Bringmann, Thomas Sauerwald, Alexandre Stauffer, He Sun:
Balls into bins via local search: cover time and maximum load. CoRR abs/1310.0801 (2013) - [i5]Victor Alvarez, Karl Bringmann, Saurabh Ray:
A Simple Sweep Line Algorithm for Counting Triangulations and Pseudo-triangulations. CoRR abs/1312.3188 (2013) - [i4]Victor Alvarez, Karl Bringmann, Radu Curticapean, Saurabh Ray:
Counting Triangulations and other Crossing-free Structures via Onion Layers. CoRR abs/1312.4628 (2013) - 2012
- [j4]