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 Volume=69
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Periodic network optimization with different arc frequencies
K. Nachtigall
Discrete Applied Mathematics
69
(1-2), 1996, pp. 1-17
Reconstruction of rooted trees from subtrees
Meei Pyng Ng
,
Nicholas C. Wormald
Discrete Applied Mathematics
69
(1-2), 1996, pp. 19-31
Representation theory and invariant neural networks
Jeffrey Wood
,
John Shawe-Taylor
Discrete Applied Mathematics
69
(1-2), 1996, pp. 33-60
Some results about normal forms for functional dependency in the relational datamodel
János Demetrovics
,
Vu Duc Thi
Discrete Applied Mathematics
69
(1-2), 1996, pp. 61-74
Ranking the vertices of a complete multipartite paired comparison digraph
Gregory Gutin
,
Anders Yeo
Discrete Applied Mathematics
69
(1-2), 1996, pp. 75-82
Embedding trees in recursive curculants
Hyeong-Seok Lim
,
Jung-Heum Park
,
Kyung-Yong Chwa
Discrete Applied Mathematics
69
(1-2), 1996, pp. 83-99
Regularity of splicing languages
Dennis Pixton
Discrete Applied Mathematics
69
(1-2), 1996, pp. 101-124
Gap strings and spanning forests for bridge graphs of biconnected graphs
Peter W. Stephens
Discrete Applied Mathematics
69
(1-2), 1996, pp. 125-145
The Clar covering polynomial of hexagonal systems I
Heping Zhang
,
Fuji Zhang
Discrete Applied Mathematics
69
(1-2), 1996, pp. 147-167
All-pairs-shortest-length on strongly chordal graphs
V. Balachandhran
,
C. Pandu Rangan
Discrete Applied Mathematics
69
(1-2), 1996, pp. 169-182
Parallel complexity of partitioning a planar graph into vertex-induced forests
Zhi-Zhong Chen
,
Xin He
Discrete Applied Mathematics
69
(1-2), 1996, pp. 183-198
On powers of circular arc graphs and proper circular arc graphs
Carsten Flotow
Discrete Applied Mathematics
69
(3), 1996, pp. 199-207
Interior and exterior functions of Boolean functions
Kazuhisa Makino
,
Toshihide Ibaraki
Discrete Applied Mathematics
69
(3), 1996, pp. 209-231
The number of clone orderings
Lee Aaron Newberg
Discrete Applied Mathematics
69
(3), 1996, pp. 233-245
Quasi-threshold graphs
Jing-Ho Yan
,
Jer-Jeong Chen
,
Gerard J. Chang
Discrete Applied Mathematics
69
(3), 1996, pp. 247-255
The complexity of generalized graph colorings
Jason I. Brown
Discrete Applied Mathematics
69
(3), 1996, pp. 257-270
Bipartite graphs and digraphs with maximum connectivity
J. Fàbrega
,
M.A. Fiol
Discrete Applied Mathematics
69
(3), 1996, pp. 271-279
On strongly connected digraphs with bounded cycle length
Samir Khuller
,
Balaji Raghavachari
,
Neal Young
Discrete Applied Mathematics
69
(3), 1996, pp. 281-289