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
[4]
Hilfe
Suche: Author="Camerini, P.M."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Random pseudo-polynomial algorithms for exact matroid problems
P.M. Camerini
,
G. Galbiati
,
F. Maffioli
Journal of Algorithms
13
, 1992, pp. 258-273
Random pseudo-polynomial algorithms and exact problems
P.M. Camerini
,
G. Galbiati
,
F. Maffioli
misc, 1988
Unlabelled partition systems: Optimization and complexity
P.M. Camerini
,
F. Maffioli
SIAM Journal on Algebraic Discrete Methods
5
, 1984, pp. 426-441
On the complexity of finding multi-constrained spanning trees
P.M. Camerini
,
G. Galbiati
,
F. Maffioli
Discrete Applied Mathematics
5
, 1983, pp. 39-50
A note on finding optimum branchings
P.M. Camerini
,
L. Fratta
,
F. Maffioli
Networks
9
, 1979, pp. 309-312
The min-max spanning tree problem and some extensions
P.M. Camerini
Information Processing Letters
7
(1), 1978, January, pp. 10-14
Bounds for 3-matroid intersection problems
P.M. Camerini
,
F. Maffioli
Information Processing Letters
3
, 1974, pp. 81-83