#### Filter Results:

- Full text PDF available (26)

#### Publication Year

1994

2019

- This year (4)
- Last 5 years (20)
- Last 10 years (43)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Markus Bläser
- Inf. Process. Lett.
- 2003

We study the generalization of covering problems such as the set cover problem to partial covering problems. Here we only want to cover a given number k of elements rather than all elements. For… (More)

- Markus Bläser
- APPROX-RANDOM
- 2004

We present a polynomial time 3/4-approximation algorithm for the maximum asymmetric TSP with weights zero and one.

- Markus Bläser, Bodo Manthey
- ESA
- 2001

A cycle cover of a graph is a spanning subgraph where each node is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. We call the decision… (More)

- Markus Bläser, Radu Curticapean
- IPEC
- 2012

In the seminal paper for parameterized counting complexity [1], the following problem is conjectured to be #W[1]-hard: Given a bipartite graph G and a number k∈ℕ, which is considered as a parameter,… (More)

- Markus Bläser
- SODA
- 2002

We present a polynomial time approximation algorithm for the asymmetric maximum traveling salesperson problem that achieves performance ratio 8/13(1 - 1/<i>n</i>). The running time of our algorithm… (More)

- Markus Bläser, Moritz Hardt, Richard J. Lipton, Nisheeth K. Vishnoi
- Inf. Process. Lett.
- 2009

We present two deterministic algorithms for the arithmetic circuit identity testing problem. The running time of our algorithms is polynomially bounded in s and m, where s is the size of the circuit… (More)

- Markus Bläser, Bodo Manthey
- Algorithmica
- 2004

Abstract
A cycle cover of a graph is a spanning subgraph, each node of which is part of exactly one simple cycle. A k-cycle cover is a cycle cover where each cycle has length at least k. Given a… (More)

- Markus Bläser
- J. Complexity
- 2003

We prove a lower bound of 2mn + 2n - m - 2 for the bilinear complexity of the multiplication of n × m-matrices with m × n-matrices using the substitution method (m ≥ n ≥ 3). In particular, we obtain… (More)

- Markus Bläser
- computational complexity
- 1999

Abstract. We prove a lower bound of km + mn + k—m + n— 3 for the multiplicative complexity of the multiplication of
$ k \times m $-matrices with
$ m \times n $-matrices using the substitution… (More)

- Markus Bläser, Christian Hoffmann
- STACS
- 2007

We consider the two-variable interlace polynomial introduced by
Arratia, Bollob`as and Sorkin (2004). We develop two graph
transformations which allow us to derive point-to-point reductions
for… (More)