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 Math. AND Volume=114
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bisection of trees and sequences
N. Alon
,
Y. Caro
,
I. Krasikov
Discrete Mathematics
114
(1-3), 1993, pp. 3-7
Irregularity strength of regular graphs of large degree
D. Amar
Discrete Mathematics
114
(1-3), 1993, pp. 9-17
The sequential generation of random
f
-graphs. Distributions of predominant types of edge maximal
f
-graphs with
f > 4
Krystyna Balińska
,
Louis V. Quintas
Discrete Mathematics
114
(1-3), 1993, pp. 19-22
Counting endpoint sequences for interval orders and interval graphs
Alexander Belfer
,
Martin C. Golumbic
Discrete Mathematics
114
(1-3), 1993, pp. 23-39
Grid intersection graphs and boxicity
S. Bellantoni
,
I. Ben-Arroyo Hartman
,
T. Przytycka
,
S. Whitesides
Discrete Mathematics
114
(1-3), 1993, pp. 41-49
Connectivity of Kautz networks
J.-C. Bermond
,
N. Homobono
,
C. Peyrat
Discrete Mathematics
114
(1-3), 1993, pp. 51-62
A note on partial Cayley graphs
J. Bond
,
C. Delorme
Discrete Mathematics
114
(1-3), 1993, pp. 63-74
Recognizing locally equivalent graphs
André Bouchet
Discrete Mathematics
114
(1-3), 1993, pp. 75-86
Fast exact and approximate algorithms for
k
-partition and scheduling independent tasks
Mark Chaimovich
Discrete Mathematics
114
(1-3), 1993, pp. 87-103
Write-isolated memories (WIMs)
Gérard D. Cohen
,
G. Zemor
Discrete Mathematics
114
(1-3), 1993, pp. 105-113
Reliable assignments of processors to tasks and factoring on matroids
Charles J. Colbourn
,
Ehab S. Elmallah
Discrete Mathematics
114
(1-3), 1993, pp. 115-129
A note on Frucht diagrams, Boolean graphs and Hamilton cycles
I.J. Dejter
,
W. Dedeño
,
V. Jauregui
Discrete Mathematics
114
(1-3), 1993, pp. 131-135
Eigenvalues of finite graphs
C. Delorme
Discrete Mathematics
114
(1-3), 1993, pp. 137-146
Double commutative-step digraphs with minimum diameters
P. Esqué
,
F. Aguiló
,
M.A. Fiol
Discrete Mathematics
114
(1-3), 1993, pp. 147-157
General combinatorial schemas: Gaussian limit distributions and exponential tails
Philippe Flajolet
,
Michèle Soria
Discrete Mathematics
114
(1-3), 1993, pp. 159-180
Decomposition of 3-connected cubic graphs
J.L. Fouquet
,
H. Thuillier
Discrete Mathematics
114
(1-3), 1993, pp. 181-198
2-Colorings of complete graphs with a small number of monochromatic
K _4
subgraphs
F. Franek
,
V. Rödl
Discrete Mathematics
114
(1-3), 1993, pp. 199-203
New analytical results in subset-sum problem
Gregory A. Freiman
Discrete Mathematics
114
(1-3), 1993, pp. 205-218
On large
(\Delta, D)
-graphs
J. Gómez
,
M.A. Fiol
,
O. Serra
Discrete Mathematics
114
(1-3), 1993, pp. 219-235
(s, r; \mu)
-nets and alternating forms graphs
Tayuan Huang
,
Monique Laurent
Discrete Mathematics
114
(1-3), 1993, pp. 237-252
Plane graphs and link invariants
François Jaeger
Discrete Mathematics
114
(1-3), 1993, pp. 253-264
Nonexistence of certain cubic graphs with small diameters
Leif K. Jorgensen
Discrete Mathematics
114
(1-3), 1993, pp. 265-273
Combinatorial characterization of read-once formulae
M. Karchmer
,
N. Linial
,
I. Newman
,
M. Saks
,
A. Wigderson
Discrete Mathematics
114
(1-3), 1993, pp. 275-282
The super towers of Hanoi problem: Large rings on small rings
Carole S. Klein
,
Steven Minsker
Discrete Mathematics
114
(1-3), 1993, pp. 283-295
Characterization of completely positive graphs
Natalia Kogan
,
Abraham Berman
Discrete Mathematics
114
(1-3), 1993, pp. 297-304
Seiten 1
2
>