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=2000
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On complexity, representation and approximation of integral multicommodity flows
Anand Srivastav
,
Peter Stangier
Discrete Applied Mathematics
99
(1-3), 2000, pp. 183-208
Uncolorable mixed hypergraphs
Zsolt Tuza
,
Vitaly Voloshin
Discrete Applied Mathematics
99
(1-3), 2000, pp. 209-227
Recognition of tractable satisfiability problems through balanced polynomial representations
Joost P. Warners
,
Hans van Maaren
Discrete Applied Mathematics
99
(1-3), 2000, pp. 229-244
Pancyclic out-arcs of a vertex in tournaments
Tianxing Yao
,
Yubao Guo
,
Kemin Zhang
Discrete Applied Mathematics
99
(1-3), 2000, pp. 245-249
Subtrees of bipartite digraphs - The minimum degree condition
Irmina A. Zioƚo
Discrete Applied Mathematics
99
(1-3), 2000, pp. 251-259
On the classification of
NP
-complete problems in terms of their correlation coefficient
Eric Angel
,
Vassilis Zissimopoulos
Discrete Applied Mathematics
99
(1-3), 2000, pp. 261-277
How to survive while visiting a graph
Claudio Arbib
,
Michele Flammini
,
Enrico Nardelli
Discrete Applied Mathematics
99
(1-3), 2000, pp. 279-293
Recognition and isomorphism of tree-like
P_4
-connected graphs
Luitpold Babel
Discrete Applied Mathematics
99
(1-3), 2000, pp. 295-315
Not every 2-tough graph is Hamiltonian
D. Bauer
,
H.J. Broersma
,
H.J. Veldman
Discrete Applied Mathematics
99
(1-3), 2000, pp. 317-321
Chordality and 2-factors in tough graphs
D. Bauer
,
G.Y. Katona
,
D. Kratsch
,
H.J. Veldman
Discrete Applied Mathematics
99
(1-3), 2000, pp. 323-329
Counting symmetric configurations
v_3
Anton Betten
,
Gunnar Brinkmann
,
Tomaz̑ Pisanski
Discrete Applied Mathematics
99
(1-3), 2000, pp. 331-338
Optimal paths in network games with
p
players
R. Boliac
,
Lozovanu
,
D. Solomon
Discrete Applied Mathematics
99
(1-3), 2000, pp. 339-348
Recognizing the
P_4
-structure of block graphs
Andreas Brandstädt
,
Van Bang Le
Discrete Applied Mathematics
99
(1-3), 2000, pp. 349-366
A linear time algorith for minimum fill-in and treewidth for distance hereditary graphs
H.J. Broersma
,
E. Dahlhaus
,
T. Kloks
Discrete Applied Mathematics
99
(1-3), 2000, pp. 367-400
Reduction of symmetric configurations
n_3
H.G. Carstens
,
T. Dinski
,
E. Steffen
Discrete Applied Mathematics
99
(1-3), 2000, pp. 401-411
The maximum Travelling Salesman problem on symmetric Demidenko matrices
Vladimir G. Deĭneko
,
Gerhard J. Woeginger
Discrete Applied Mathematics
99
(1-3), 2000, pp. 413-425
Strongly orderable graphs - A common generalization of strongly chordal and chordal bipartite graphs
Feodor F. Dragan
Discrete Applied Mathematics
99
(1-3), 2000, pp. 427-442
Two results on the bit extraction problem
Katalin Friedl
,
Shi-Chun Tsai
Discrete Applied Mathematics
99
(1-3), 2000, pp. 443-454
Seiten
<
1
2
3
4
5
6