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
[1]
Hilfe
Suche: Author="Mann, Matthias"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The power of reordering for online minimum makespan scheduling
Matthias Englert
,
Deniz Özmen
,
Matthias Westermann
SIAM Journal on Computing
43
(3), 2014, pp. 1220-1237
Considering suppressed packets improves buffer management in quality of service switches
Matthias Englert
,
Matthias Westermann
SIAM Journal on Computing
41
(5), 2012, pp. 1166-1192
Transitivity conditions in infinite graphs
Matthias Hamann
,
Julian Pott
Combinatorica
32
(6), 2012, pp. 649-688
Passenger flow-oriented train disposition
Annabell Berger
,
Christian Blaar
,
Andreas Gebhardt
,
Matthias Müller-Hannemann
,
Mathias Schnee
Lecture Notes in Computer Science
6942
, 2011, pp. 227-238
How to find good night train connections
Thorsten Gunkel
,
Mathias Schnee
,
Matthias Müller-Hannemann
Networks
57
(1), 2011, pp. 19-27
CMView: Interactive contact map visualization and analysis
Corinna Vehlow
,
Henning Stehr
,
Matthias Winkelmann
,
José M. Duarte
,
Lars Petzold
,
Juliane Dinse
,
Michael Lappe
Bioinformatics
27
(11), 2011, pp. 1573-1574
Uniform sampling of digraphs with a fixed degree sequence
Annabell Berger
,
Matthias Müller-Hannemann
Lecture Notes in Computer Science
6410
, 2010, pp. 220-231
Predicting post-translational lysine acetylation using support vector machines
Florian Gnad
,
Shubin Ren
,
Chunaram Choudhary
,
Jürgen Cox
,
Matthias Mann
Bioinformatics
26
(13), 2010, pp. 1666-1668
Similarity implies equivalence in a class of non-deterministic call-by-need lambda calculi
Matthias Mann
,
Manfred Schmidt-Schausś
Information and Computation
208
(3), 2010, pp. 276-291
Lower and upper bounds on FIFO buffer management in QoS switches
Matthias Englert
,
Matthias Westermann
Algorithmica
53
(4), 2009, pp. 523-548
A divide-and-conquer approach to analyze underdetermined biochemical models
Oliver Kotte
,
Matthias Heinemann
Bioinformatics
25
(4), 2009, pp. 519-525
Multi-spectra peptide sequencing and its applications to multistage mass spectrometry
Nuno Bandeira
,
Jesper V. Olsen
,
Matthias Mann
,
Pavel A. Pevzner
Bioinformatics
24
(13), 2008, pp. 416-423
A faster shortest-paths algorithm for minor-closed graph classes
Siamak Tazari
,
Matthias Müller-Hannemann
Lecture Notes in Computer Science
5344
, 2008, pp. 360-371
Reordering buffers for general metric spaces
Matthias Englert
,
Harald Räcke
,
Matthias Westermann
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, STOC'2007 (San Diego, CA, USA, June 11-13, 2007)
, 2007, pp. 556-564
A near linear time approximation scheme for Steiner tree among obstacles in the plane
Matthias Müller-Hannemann
,
Siamak Tazari
Lecture Notes in Computer Science
4619
, 2007, pp. 151-162
Lower and upper bounds on FIFO buffer management in QoS switches
Matthias Englert
,
Matthias Westermann
Lecture Notes in Computer Science
4168
, 2006, pp. 352-363
Synthetic biology - Putting engineering into biology
Matthias Heinemann
,
Sven Panke
Bioinformatics
22
(22), 2006, pp. 2790-2799
Approximation of octilinear Steiner trees constrained by hard and soft obstacles
Matthias Müller-Hannemann
,
Anna Schulze
Lecture Notes in Computer Science
4059
, 2006, pp. 242-254
Moving policies in cyclic assembly line scheduling
Matthias Müller-Hannemann
,
Karsten Weihe
Theoretical Computer Science
351
(3), 2006, pp. 425-436
Reordering buffer management for non-uniform cost models
Matthias Englert
,
Matthias Westermann
Lecture Notes in Computer Science
3580
, 2005, pp. 627-638
Hardness and approximation of octilinear Steiner trees
Matthias Müller-Hannemann
,
Anna Schulze
Lecture Notes in Computer Science
3827
, 2005, pp. 256-265
Optimal one-page tree embeddings in linear time
Robert A. Hochberg
,
Matthias F. Stallmann
Information Processing Letters
87
(2), 2003, pp. 59-66
Approximation algorithms for data management in networks
Christof Krick
,
Harald Räcke
,
Matthias Westermann
Theory of Computing Systems
36
(5), 2003, pp. 497-519
Approximation of rectilinear Steiner trees with length restrictions on obstacles
Matthias Müller-Hannemann
,
Sven Peyer
Lecture Notes in Computer Science
2748
, 2003, pp. 207-218
Slack optimization of timing-critical nets
Matthias Müller-Hannemann
,
Ute Zimmermann
Lecture Notes in Computer Science
2832
, 2003, pp. 727-739
Seiten 1
2
>