The following pages link to Markus Bläser (Q172539):
Displaying 28 items.
- An -approximation algorithm for the asymmetric maximum TSP (Q4819692) (← links)
- (Q4828916) (← links)
- Weighted Counting of k-Matchings Is #W[1]-Hard (Q4899251) (← links)
- On the Complexity of the Interlace Polynomial (Q4910711) (← links)
- A new approximation algorithm for the asymmetric TSP with triangle inequality (Q4962752) (← links)
- (Q5089178) (← links)
- (Q5090425) (← links)
- (Q5090953) (← links)
- (Q5092471) (← links)
- (Q5111164) (← links)
- Smoothed Analysis of Partitioning Algorithms for Euclidean Functionals (Q5199235) (← links)
- Generalized matrix completion and algebraic natural proofs (Q5230373) (← links)
- A Deterministic PTAS for the Algebraic Rank of Bounded Degree Polynomials (Q5236222) (← links)
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Q5313047) (← links)
- Noncommutativity Makes Determinants Hard (Q5326559) (← links)
- Algorithms and Data Structures (Q5394263) (← links)
- Complexity of the Cover Polynomial (Q5428860) (← links)
- Distributed Algorithmic Mechanism Design and Algebraic Communication Complexity (Q5459985) (← links)
- Privacy in Non-private Environments (Q5465808) (← links)
- Fundamentals of Computation Theory (Q5492955) (← links)
- (Q5501317) (← links)
- (Q5875535) (← links)
- Smoothed complexity theory (Q5890963) (← links)
- Approximation and Online Algorithms (Q5898465) (← links)
- Lower bounds for the bilinear complexity of associative algebras (Q5930150) (← links)
- (Q6084351) (← links)
- (Q6115392) (← links)
- On the multilinear complexity of associative algebras (Q6615112) (← links)
