The following pages link to Karl Bringmann (Q295633):
Displaying 50 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Efficient optimization of many objectives by approximation-guided evolution (Q319124) (← links)
- Approximation quality of the hypervolume indicator (Q360122) (← links)
- Approximating the least hypervolume contributor: NP-hard in general, but fast in practice (Q418034) (← links)
- An improved algorithm for Klee's measure problem on fat boxes (Q419375) (← links)
- Speeding up many-objective optimization by Monte Carlo approximations (Q490427) (← links)
- Random shortest paths: non-Euclidean instances for metric optimization problems (Q494931) (← links)
- Multivariate analysis of orthogonal range searching and graph distances (Q786041) (← links)
- Approximating the volume of unions and intersections of high-dimensional geometric objects (Q982950) (← links)
- A note on hardness of diameter approximation (Q1705693) (← links)
- Geometric inhomogeneous random graphs (Q1713405) (← links)
- De-anonymization of heterogeneous random graphs in quasilinear time (Q1755750) (← links)
- Greedy routing and the algorithmic small-world phenomenon (Q2071825) (← links)
- Fine-grained complexity theory: conditional lower bounds for computational geometry (Q2117766) (← links)
- Scheduling lower bounds via AND subset sum (Q2121467) (← links)
- Faster minimization of tardy processing time on a single machine (Q2134746) (← links)
- Counting triangulations and other crossing-free structures approximately (Q2341692) (← links)
- Counting triangulations and other crossing-free structures via onion layers (Q2351010) (← links)
- Efficient sampling methods for discrete distributions (Q2408923) (← links)
- Efficient Sampling Methods for Discrete Distributions (Q2843242) (← links)
- Bringing Order to Special Cases of Klee’s Measure Problem (Q2849910) (← links)
- Counting crossing-free structures (Q2874565) (← links)
- De-anonymization of Heterogeneous Random Graphs in Quasilinear Time (Q2921405) (← links)
- (Q2954992) (← links)
- Balls into bins via local search: cover time and maximum load (Q2965483) (← links)
- Approximability of the discrete Fréchet distance (Q2970465) (← links)
- Tight Bounds for the Approximation Ratio of the Hypervolume Indicator (Q3163417) (← links)
- Ultra-Fast Load Balancing on Scale-Free Networks (Q3449501) (← links)
- Online Checkpointing with Improved Worst-Case Guarantees (Q3458748) (← links)
- Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds (Q3459889) (← links)
- Approximating the Volume of Unions and Intersections of High-Dimensional Geometric Objects (Q3596739) (← links)
- A Near-Linear Pseudopolynomial Time Algorithm for Subset Sum (Q4575810) (← links)
- (Q4580096) (← links)
- Hitting Set for hypergraphs of low VC-dimension (Q4606292) (← links)
- (Q4607965) (← links)
- (Q4607967) (← links)
- On Algebraic Branching Programs of Small Width (Q4625653) (← links)
- Truly Subcubic Algorithms for Language Edit Distance and RNA Folding via Fast Bounded-Difference Min-Plus Product (Q4634027) (← links)
- Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance (Q4958385) (← links)
- (Q5002674) (← links)
- (Q5009466) (← links)
- Discrete Fréchet Distance under Translation (Q5032034) (← links)
- (Q5044450) (← links)
- On Geometric Set Cover for Orthants (Q5075763) (← links)
- Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance (Q5088944) (← links)
- (Q5088945) (← links)
- Fine-Grained Complexity Theory (Tutorial) (Q5090450) (← links)
- (Q5090981) (← links)
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
- (Q5110876) (← links)
