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="d'Atri, A."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
The Steiner tree problem and homogeneous sets
A. d'Atri
,
M. Moscarini
,
A. Sassano
Lecture Notes in Computer Science
324
, 1988, pp. 249-261
Chordality properties on graphs and minimal conceptual connections in semantic data models
G. Ausiello
,
A. d'Atri
,
M. Moscarini
Journal of Computer and System Sciences
33
(2), 1986, October, pp. 179-202
Minimal representation of directed hypergraphs
G. Ausiello
,
A. d'Atri
,
D. Saccá
SIAM Journal on Computing
15
(2), 1986, May, pp. 418-431
On the existence of acyclic views in a database scheme
G. Ausiello
,
A. d'Atri
,
M. Moscarini
Theoretical Computer Science
35
(2,3), 1985, pp. 165-177
Graph algorithms for functional dependency manipulation
G. Ausiello
,
A. d'Atri
,
D. Saccá
Journal of the ACM
30
(4), 1983, pp. 752-766
Formal tools for top-down and bottom-up generation of acyclic relational schemata
C. Batyini
,
A. D'Atri
,
M. Moscarini
Applied Computer Science
, 1982, pp. 219-229
Graph algorithms for the synthesis and manipulation of data base schemes
G. Ausiello
,
A. D'Atri
,
D. Saccà
Lecture Notes in Computer Science
100
, 1981, pp. 212-233
Structure preserving reductions among convex optimization problems
G. Ausiello
,
A. d'Atri
,
M. Protasi
Journal of Computer and System Sciences
21
(1), 1980, August, pp. 136-153