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="Stallmann, Matthias"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal one-page tree embeddings in linear time
Robert A. Hochberg
,
Matthias F. Stallmann
Information Processing Letters
87
(2), 2003, pp. 59-66
New bounds on the barycenter heuristic for bipartite graph drawing
Xiao Yu Li
,
Matthias F. Stallmann
Information Processing Letters
82
, 2002, pp. 293-298
Minimizing the complexity of an activity network
Jerzy Kamburowski
,
David J. Michael
,
Matthias F.M. Stallmann
Networks
36
(1), 2000, pp. 47-52
On embedding binary trees into hypercubes
Woei-Kae Chen
,
Matthias F.M. Stallmann
Journal Parallel Distributed Computing
24
(2), 1995, pp. 132-138
Fast algorithms for one-dimensional compaction with jog insertion
Matthias F.M. Stallmann
,
Thomas A. Hughes
Proceedings of the 3rd Workshop on Algorithms and Data Structures. WADS '93 (Montréal, Canada, August 1993)
LNCS 709
, 1993, pp. 589-600
Optimal reduction of two-terminal directed acyclic graphs
Wolfgang W. Bein
,
Jerzy Kamburowski
,
Matthias F.M. Stallmann
SIAM Journal on Computing
21
(6), 1992, December, pp. 1112-1129
A one-way array algorithm for matroid scheduling
Matthias F.M. Stallmann
Proceedings of the 3rd Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA'91 (Hilton Head, South Carolina, July 21-24, 1991)
, 1991, pp. 349-356
Solving some combinatorial problems on arrays with one-way dataflow
Carla D. Savage
,
Matthias Stallmann
,
Jo Ellen Perry
Algorithmica
5
, 1990, pp. 179-199