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: Journal=Discrete Appl.~Math. AND YEAR=1992
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Some results on visibility graphs
Thomas Andreae
Discrete Applied Mathematics
40
, 1992, pp. 5-17
The communication complexity of interval orders
Ulrich Faigle
,
Rainer Schrader
,
Gyŏrgy Turán
Discrete Applied Mathematics
40
, 1992, pp. 19-28
Integer programming in VLSI design
Prabhakar Raghavan
Discrete Applied Mathematics
40
, 1992, pp. 29-43
Steiner's problem in graphs: heuristic methods
Stefan Voß
Discrete Applied Mathematics
40
, 1992, pp. 45-72
An efficient parallel logarithmic time algorithm for the channel routing problem
Dorothea Wagner
,
Frank Wagner
Discrete Applied Mathematics
40
, 1992, pp. 73-81
A Manhattan channel router with good theoretical and practical performance
Charlotte Wieners-Lummer
Discrete Applied Mathematics
40
, 1992, pp. 83-104
The parallel complexity of single rule logic programs
Foto Afrati
Discrete Applied Mathematics
40
, 1992, pp. 107-126
Partial dependencies in relational databases and their realization
J. Demetrovics
,
Gyula O.H. Katona
,
D. Miklós
Discrete Applied Mathematics
40
, 1992, pp. 127-138
The characterization of branching dependencies
János Demetrovics
,
Gyula O.H. Katona
,
Attila Sali
Discrete Applied Mathematics
40
, 1992, pp. 139-153
Functional dependencies in relational databases: A lattice point of view
János Demetrovics
,
Leonid Libkin
,
Ilya B. Muchnik
Discrete Applied Mathematics
40
, 1992, pp. 155-185
Selective inheritance of attribute values in relational databases
G. Gottlob
,
M. Schrefl
,
M. Stumptner
Discrete Applied Mathematics
40
, 1992, pp. 187-216
Locking based on a pairwise decomposition of the transaction system
Georg Lausen
Discrete Applied Mathematics
40
, 1992, pp. 217-236
On the complexity of inferring functional dependencies
Heikki Mannila
,
Kari-Jouko Räihä
Discrete Applied Mathematics
40
, 1992, pp. 237-243
Minimizing restricted-fanout queries
Yehoshua Sagiv
,
Yatin Saraiya
Discrete Applied Mathematics
40
, 1992, pp. 245-264
The number of keys in relational and nested relational databases
B. Thalheim
Discrete Applied Mathematics
40
, 1992, pp. 265-282
Fractional arboricity, strength, and principal partitions in graphs and matroids
Paul A. Catlin
,
Jerrold W. Grossmann
,
Arthur M. Hobbs
,
Hong-Jian Lai
Discrete Applied Mathematics
40
, 1992, pp. 285-302
Balanced block spacing for VLSI layout
Israel Cederbaum
,
Israel Koren
,
Shmuel Wimer
Discrete Applied Mathematics
40
, 1992, pp. 303-318
Optimal multiple interval assignments in frequency assignment and traffic phasing
Arundhati Raychaudhuri
Discrete Applied Mathematics
40
, 1992, pp. 319-332
Processor interconnection networks from Cayley graphs
Stephen T. Schibell
,
Richard M. Stafford
Discrete Applied Mathematics
40
, 1992, pp. 333-357
Algorithms for routing around a rectangle
András Frank
,
Takao Nishizeki
,
Nobuji Saito
,
Hitoshi Suzuki
,
éva Tardos
Discrete Applied Mathematics
40
, 1992, pp. 363-378
A multiversion cautious scheduler with dynamic serialization constraints for database concurrency control
Naoki Katoh
,
Toshihide Ibaraki
,
Tiko Kameda
Discrete Applied Mathematics
40
, 1992, pp. 379-395
Linear time algorithms for the weighted tailored 2-partition problem and the weighted 2-center problem under
l_{\infty}
-distance
M.T. Ko
,
Y.T. Ching
Discrete Applied Mathematics
40
, 1992, pp. 397-410
Set to set broadcasting in communication networks
Hsun-Ming Lee
,
Gerard J. Chang
Discrete Applied Mathematics
40
, 1992, pp. 411-421
Matching parentheses in parallel
Christos Levcopoulos
,
Ola Petersson
Discrete Applied Mathematics
40
, 1992, pp. 423-431
Circular permutation graph family with applications
R.D. Lou
,
M. Sarrafzadeh
Discrete Applied Mathematics
40
, 1992, pp. 433-457
Seiten 1
2
3
4
5
6
>