Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Bl{\"a}ser, Markus"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Smoothed analysis of partitioning algorithms for Euclidean functionals
Markus Bläser
,
Bodo Manthey
,
B.V. Raghavendra Rao
Algorithmica
66
(2), 2013, pp. 397-418
Noncommutativity makes determinants hard
Markus Bläser
Lecture Notes in Computer Science
7965
, 2013, pp. 172-183
Smoothed complexity theory
Markus Bläser
,
Bodo Manthey
Lecture Notes in Computer Science
7464
, 2012, pp. 198-209
A probabilistic analysis of Christofides' algorithm
Markus Bläser
,
Konstatinos Panagiotou
,
Raghavendra Rao
Lecture Notes in Computer Science
7357
, 2012, pp. 225-236
The complexity of the cover polynomials for planar graphs of bounded degree
Markus Bläser
,
Radu Curticapean
Lecture Notes in Computer Science
6907
, 2011, pp. 96-107
Randomness efficient testing of sparse black box identities of unbounded degree over the reals
Markus Bläser
,
Christian Engels
Leibniz International Proceedings in Informatics (LIPIcs)
9
, 2011, pp. 555-566
Fast evaluation of interlace polynomials on graphs of bounded treewidth
Markus Bläser
,
Christian Hoffmann
Algorithmica
61
(1), 2011, pp. 3-35
Privacy in non-private environments
Markus Bläser
,
Andreas Jakoby
,
Maciej Liśkiewicz
,
Bodo Manthey
Theory of Computing Systems
48
(1), 2011, pp. 211-245
Smoothed analysis of partitioning algorithms for Euclidean functionals
Markus Bläser
,
Bodo Manthey
,
B.V. Raghavendra Rao
Lecture Notes in Computer Science
6844
, 2011, pp. 110-121
Complexity of the Bollobás-Riordan polynomial. Exceptional points and uniform reuctions
Markus Bläser
,
Holger Dell
,
Johann A. Makowsky
Theory of Computing Systems
44
(4), 2009, pp. 690-706
Fast evaluation of interlace polynomials on graphs of bounded treewidth
Markus Bläser
,
Christian Hoffmann
Lecture Notes in Computer Science
5757
, 2009, pp. 623-634
Semisimple algebras of almost minimal rank over the reals
Markus Bläser
,
Andreas Meyer de Voltaire
Theoretical Computer Science
410
(50), 2009, pp. 5202-5214
Asymptotically optimal hitting sets against polynomials
Markus Bläser
,
Moritz Hardt
,
David Steurer
Lecture Notes in Computer Science
5125
, 2008, pp. 345-356
On the complexity of the interlace polynomial
Markus Bläser
,
Christian Hoffmann
Leibniz International Proceedings in Informatics (LIPIcs)
1
, 2008, pp. 97-108
Approximating multi-criteria MAX-TSP
Markus Bläser
,
Bodo Manthey
,
Oliver Putz
Lecture Notes in Computer Science
5193
, 2008, pp. 185-197
Complexity of the cover polynomial
Markus Bläser
,
Holger Dell
Lecture Notes in Computer Science
4596
, 2007, pp. 801-812
Adding cardinality constraints to integer programs with applications to maximum satisfiability
Markus Bläser
,
Thomas Heynen
,
Bodo Manthey
Information Processing Letters
105
(5), 2007, pp. 194-198
Semisimple algebras of almost minimal rank over the reals
Markus Bläser
,
Andreas Meyer de Voltaire
Lecture Notes in Computer Science
4708
, 2007, pp. 669-680
Approximating maximum weight cycle covers in directed graphs with weights zero and one
Markus Bläser
,
Bodo Manthey
Algorithmica
42
(2), 2005, pp. 121-139
Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
Markus Bläser
,
L. Shankar Ram
,
Maxim Sviridenko
Lecture Notes in Computer Science
3608
, 2005, pp. 350-359
On the number of multiplications needed to invert a monic power series over fields of characteristic two
Markus Bläser
Journal of Complexity
21
(4), 2005, pp. 413-419
Beyond the Alder-Strassen bound
Markus Bläser
Theoretical Computer Science
331
(1), 2005, pp. 3-21
An
\frac {8}{13}
-approximation algorithm for the asymmetric maximum TSP
Markus Bläser
Journal of Algorithms
50
(1), 2004, pp. 23-48
Computing small partial coverings
Markus Bläser
Information Processing Letters
85
(6), 2003, pp. 327-331
On the complexity of the multiplication of matrices of small formats
Markus Bläser
Journal of Complexity
19
(1), 2003, pp. 43-60
Seiten 1
2
>