The following pages link to Marvin Künnemann (Q477077):
Displaying 40 items.
- Optimizing linear functions with the \((1 + \lambda)\) evolutionary algorithm -- different asymptotic runtimes for different instances (Q477078) (← links)
- A quantization framework for smoothed analysis of Euclidean optimization problems (Q893320) (← links)
- Secretary markets with local information (Q2010597) (← links)
- The fine-grained complexity of multi-dimensional ordering properties (Q2093566) (← links)
- Subquadratic algorithms for succinct stable matching (Q2415371) (← links)
- A Quantization Framework for Smoothed Analysis of Euclidean Optimization Problems (Q2849327) (← links)
- Towards Understanding the Smoothed Approximation Ratio of the 2-Opt Heuristic (Q3448843) (← links)
- Secretary Markets with Local Information (Q3449504) (← links)
- Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds (Q3459889) (← links)
- Randomized Rounding for Routing and Covering Problems: Experiments and Improvements (Q3558348) (← links)
- Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem (Q4598294) (← links)
- (Q4607967) (← links)
- Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance (Q4958385) (← links)
- (Q5009621) (← links)
- Discrete Fréchet Distance under Translation (Q5032034) (← links)
- Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance (Q5088944) (← links)
- A fine-grained analogue of schaefer's Theorem in P: dichotomy of ∃k∀-quantified first-order graph properties (Q5091783) (← links)
- Finding small satisfying assignments faster than brute force: a fine-grained perspective into boolean constraint satisfaction (Q5092478) (← links)
- (Q5111351) (← links)
- Improved Protocols and Hardness Results for the Two-Player Cryptogenography Problem (Q5124537) (← links)
- Tight Analysis of Randomized Rumor Spreading in Complete Graphs (Q5194760) (← links)
- Approximating APSP without scaling: equivalence of approximate min-plus and exact min-max (Q5212835) (← links)
- Quasirandom Rumor Spreading: An Experimental Analysis (Q5233573) (← links)
- Dependent Randomized Rounding: The Bipartite Case (Q5233703) (← links)
- Few Matches or Almost Periodicity: Faster Pattern Matching with Mismatches in Compressed Texts (Q5236253) (← links)
- Fréchet Distance Under Translation: Conditional Hardness and an Algorithm via Offline Dynamic Grid Reachability (Q5236372) (← links)
- Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds (Q5370572) (← links)
- Quasirandom rumor spreading (Q5406249) (← links)
- When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation (Q5874493) (← links)
- (Q6090879) (← links)
- (Q6152159) (← links)
- Dynamic time warping under translation: approximation guided by space-filling curves (Q6539533) (← links)
- Towards sub-quadratic diameter computation in geometric intersection graphs (Q6539535) (← links)
- A structural investigation of the approximability of polynomial-time problems (Q6560816) (← links)
- Polygon placement revisited: (degree of freedom \(+ 1\))-SUM hardness and an improvement via offline dynamic rectangle union (Q6575204) (← links)
- Combinatorial designs meet hypercliques: higher lower bounds for Klee's measure problem and related problems in dimensions \(d\geq 4\) (Q6620527) (← links)
- The NFA acceptance hypothesis: non-combinatorial and dynamic lower bounds (Q6633271) (← links)
- Coverability in VASS revisited: improving Rackoff's bound to obtain conditional optimality (Q6638141) (← links)
- The time complexity of fully sparse matrix multiplication (Q6645537) (← links)
- The effect of sparsity on \(k\)-Dominating Set and related first-order graph properties (Q6645538) (← links)
