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=100
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Optimal multiple message broadcasting in telephone-like communication systems
Amotz Bar-Noy
,
Shlomo Kipnis
,
Baruch Schieber
Discrete Applied Mathematics
100
(1-2), 2000, pp. 1-15
Algorithms and codes for dense assignment problems: The state of the art
Mauro Dell'Amico
,
Paolo Toth
Discrete Applied Mathematics
100
(1-2), 2000, pp. 17-48
Computing orbit period in max-min algebra
Martin Gavalec
Discrete Applied Mathematics
100
(1-2), 2000, pp. 49-65
Naturally submodular digraphs and forbidden digraph configurations
D. Granot
,
F. Granot
,
W.R. Zhu
Discrete Applied Mathematics
100
(1-2), 2000, pp. 67-84
Maximum packing for biconnected outerplanar graphs
Tomas Kovacs
,
Andrzej Lingas
Discrete Applied Mathematics
100
(1-2), 2000, pp. 85-94
Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
Mauricio G.C. Resende
,
Leonidas S. Pitsoulis
,
Panos M. Pardalos
Discrete Applied Mathematics
100
(1-2), 2000, pp. 95-113
Local symmetries in the period-doubling sequence
David Damanik
Discrete Applied Mathematics
100
(1-2), 2000, pp. 115-121
A laminarity property of the polyhedron described by a weakly posi-modular set function
Satoru Fujishige
Discrete Applied Mathematics
100
(1-2), 2000, pp. 123-126
On the complexity of minimizing the number of late jobs in unit time open shop
Svetlana A. Kravchenko
Discrete Applied Mathematics
100
(1-2), 2000, pp. 127-132
A note on ``parallel machine scheduling with non-simultaneous machine available time''
Chung-Yee Lee
,
Yong He
,
Guochun Tang
Discrete Applied Mathematics
100
(1-2), 2000, pp. 133-135
A note on the generalized Steiner tree polytope
Juan José Salazar
Discrete Applied Mathematics
100
(1-2), 2000, pp. 137-144
Pseudo-Hamiltonian-connected graphs
Gerard J. Chang
,
Xuding Zhu
Discrete Applied Mathematics
100
(3), 2000, pp. 145-153
The complexity of irredundant sets parameterized by size
Rodney G. Downey
,
Michael R. Fellows
,
Venkatesh Raman
Discrete Applied Mathematics
100
(3), 2000, pp. 155-167
Multicolor routing in the undirected hypercube
Qian-Ping Gu
,
Hisao Tamaki
Discrete Applied Mathematics
100
(3), 2000, pp. 169-181
Algorithmic aspects of clique-transversal and clique-independent sets
Venkatesan Guruswami
,
C. Pandu Rangan
Discrete Applied Mathematics
100
(3), 2000, pp. 183-202
Dynamic storage allocation with known durations
Joseph (Seffi) Naor
,
Ariel Orda
,
Yael Petruschka
Discrete Applied Mathematics
100
(3), 2000, pp. 203-213
On the
P_4
-components of graphs
Thomas Raschle
,
Klaus Simon
Discrete Applied Mathematics
100
(3), 2000, pp. 215-235