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=2001
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the binary solitaire cone
David Avis
,
Antoine Deza
Discrete Applied Mathematics
115
(1-3), 2001, pp. 3-14
Combinatorial problems related to origin-destination matrices
Endre Boros
,
Peter L. Hammer
,
Federica Ricca
,
Bruno Simeone
Discrete Applied Mathematics
115
(1-3), 2001, pp. 15-36
An orientation theorem with parity conditions
András Frank
,
Tibor Jordán
,
Zoltán Szigeti
Discrete Applied Mathematics
115
(1-3), 2001, pp. 37-47
Bipartition constrained edge-splitting in directed graphs
Harold N. Gabow
,
Tibor Jordán
Discrete Applied Mathematics
115
(1-3), 2001, pp. 49-62
Lengths of tours and permutations on a vertex set of a convex polygon
Ito Hiro
,
Uehara Hideyuki
,
Yokoyama Mitsuo
Discrete Applied Mathematics
115
(1-3), 2001, pp. 63-71
Spanning trees with constraints on the leaf degree
Atsushi Kaneko
Discrete Applied Mathematics
115
(1-3), 2001, pp. 73-76
Crossing-free segments and triangles in point configurations
Gyula Károlyi
,
Emo Welzl
Discrete Applied Mathematics
115
(1-3), 2001, pp. 77-88
Subdivisions of integral base polytopes
Kenji Kashiwabara
Discrete Applied Mathematics
115
(1-3), 2001, pp. 89-97
A large set of non-Hamiltonian graphs
Gyula Y. Katona
Discrete Applied Mathematics
115
(1-3), 2001, pp. 99-115
Bandwidth and topological bandwidth of graphs with few
P_4
's
Ton Kloks
,
Richard B. Tan
Discrete Applied Mathematics
115
(1-3), 2001, pp. 117-133
Topological optimization with a network reliability constraint
T. Koide
,
S. Shinmori
,
H. Ishii
Discrete Applied Mathematics
115
(1-3), 2001, pp. 135-149
Relationship of
M
-/
L
-convex functions with discrete convex functions by Miller and Favati-Tardella
Kazuo Murota
,
Akiyoshi Shioura
Discrete Applied Mathematics
115
(1-3), 2001, pp. 151-176
The edge-disjoint paths problem is
NP
-complete for series-parallel graphs
Takao Nishizeki
,
Jens Vygen
,
Xiao Zhou
Discrete Applied Mathematics
115
(1-3), 2001, pp. 177-186
Rigidity of multi-story buildings
Norbert Radics
Discrete Applied Mathematics
115
(1-3), 2001, pp. 187-198
Some polynomially solvable subcases of the detailed routing problem in VLSI design
András Recski
Discrete Applied Mathematics
115
(1-3), 2001, pp. 199-208
On kernel-less clique-acyclic orientations of minimally imperfect graphs
Tadashi Sakuma
Discrete Applied Mathematics
115
(1-3), 2001, pp. 209-219
Complexity of finding a join of maximum weight
A.A. Ageev
Discrete Applied Mathematics
114
(1-3), 2001, pp. 3-7
Perfect binary
(n,3)
codes: The structure of graphs of minimum distances
S.V. Avgustinovich
Discrete Applied Mathematics
114
(1-3), 2001, pp. 9-11
An efficient algorithm for the uncapacitated facility location problem with totally balanced matrix
V.L. Beresnev
Discrete Applied Mathematics
114
(1-3), 2001, pp. 13-22
Edge and total coloring of interval graphs
V.A. Bojarshinov
Discrete Applied Mathematics
114
(1-3), 2001, pp. 23-28
Acyclic colouring of 1-planar graphs
O.V. Borodin
,
A.V. Kostochka
,
A. Raspaud
,
E. Sopena
Discrete Applied Mathematics
114
(1-3), 2001, pp. 29-41
Average case complexity for finite Boolean functions
A.V. Chashkin
Discrete Applied Mathematics
114
(1-3), 2001, pp. 43-59
Lower bounds for the complexity of restrictions of Boolean functions
A.V. Chashkin
Discrete Applied Mathematics
114
(1-3), 2001, pp. 61-93
On an infinite sequence of improving Boolean bases
D.U. Cherukhin
Discrete Applied Mathematics
114
(1-3), 2001, pp. 95-108
Minimal enumerations of subsets of a finite set and the middle level problem
A.A. Evdokimov
,
A.L. Perezhogin
Discrete Applied Mathematics
114
(1-3), 2001, pp. 109-114
Seiten 1
2
3
4
5
6
7
>