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=101
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Many-to-many matching: Stable polyandrous polygamy (or polygamous polyandry)
Mourad Baïou
,
Michel Balinski
Discrete Applied Mathematics
101
(1-3), 2000, pp. 1-12
A polyhedral approach to an integer multicommodity flow problem
Lorenzo Brunetta
,
Michele Conforti
,
Matteo Fischetti
Discrete Applied Mathematics
101
(1-3), 2000, pp. 13-36
Solving the feedback vertex set problem on undirected graphs
Lorenzo Brunetta
,
Francesco Maffioli
,
Marco Trubian
Discrete Applied Mathematics
101
(1-3), 2000, pp. 37-51
Maximal cubic graphs with diameter 4
Dominique Buset
Discrete Applied Mathematics
101
(1-3), 2000, pp. 53-61
Sparse orthogonal matrices and the Haar wavelet
Gi-Sang Cheon
,
Bryan L. Shader
Discrete Applied Mathematics
101
(1-3), 2000, pp. 63-76
Upper bounds to the clique width of graphs
Bruno Courcelle
,
Stephan Olariu
Discrete Applied Mathematics
101
(1-3), 2000, pp. 77-114
Some new
Z
-cyclic whist tournaments
Norman J. Finizio
,
Adele J. Merritt
Discrete Applied Mathematics
101
(1-3), 2000, pp. 115-130
Generic rigidity of molecular graphs via ear decomposition
D.S. Franzblau
Discrete Applied Mathematics
101
(1-3), 2000, pp. 131-155
New results on induced matchings
Martin Charles Golumbic
,
Moshe Lewenstein
Discrete Applied Mathematics
101
(1-3), 2000, pp. 157-165
Straight line embeddings of rooted star forests in the plane
Atsushi Kaneko
,
M. Kano
Discrete Applied Mathematics
101
(1-3), 2000, pp. 167-175
Envelopes and clutters
Kenji Kashiwabara
,
Bunpei Nakano
Discrete Applied Mathematics
101
(1-3), 2000, pp. 177-185
Selecting the
k
largest elements with parity tests
Tak Wah Lam
,
Hing Fung Ting
Discrete Applied Mathematics
101
(1-3), 2000, pp. 187-196
On the computational complexity of edge concentration
Xuemin Lin
Discrete Applied Mathematics
101
(1-3), 2000, pp. 197-205
Existence of whist tournaments with the three-person property
3PWh(v)
Y. Lu
,
Zhang Shengyuan
Discrete Applied Mathematics
101
(1-3), 2000, pp. 207-219
The median function on median graphs and semilattices
F.R. McMorris
,
H.M. Mulder
,
R.C. Powers
Discrete Applied Mathematics
101
(1-3), 2000, pp. 221-230
A scheme for the synchronization of variable length codes
S. Perkins
,
D.H. Smith
Discrete Applied Mathematics
101
(1-3), 2000, pp. 231-245
Reduced first-level representations via the reformulation-linearization technique: Results, counterexamples, and computations
Hanif D. Sherali
,
Jonathan C. Smith
,
Warren P. Adams
Discrete Applied Mathematics
101
(1-3), 2000, pp. 247-267
Scheduling tree-like task systems with non-uniform deadlines subject to unit-length communication delays
Jacques Verriet
Discrete Applied Mathematics
101
(1-3), 2000, pp. 269-289