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=113
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A multi-scale algorithm for drawing graphs nicely
Ronny Hadany
,
David Harel
Discrete Applied Mathematics
113
(1), 2001, pp. 3-21
Optimal irreversible dynamos in chordal rings
P. Flocchini
,
F. Geurts
,
N. Santoro
Discrete Applied Mathematics
113
(1), 2001, pp. 23-42
Routing permutations and 2-1 routing requests in the hypercube
Olivier Baudon
,
Guillaume Fertin
,
Ivan Havel
Discrete Applied Mathematics
113
(1), 2001, pp. 43-58
Fixed-parameter complexity of
\lambda
-labelings
Jiȓí Fiala
,
Ton Kloks
,
Jan Kratochvíl
Discrete Applied Mathematics
113
(1), 2001, pp. 59-72
Reload cost problems: Minimum diameter spanning tree
Hans-Christoph Wirth
,
Jan Steffan
Discrete Applied Mathematics
113
(1), 2001, pp. 73-85
Euler is standing in line dial-a-ride problems with precedence-constraints
D. Hauptmeier
,
S.O. Krumke
,
J. Rambau
,
H.-C. Wirth
Discrete Applied Mathematics
113
(1), 2001, pp. 87-107
Complexity classification of some edge modification problems
Assaf Natanzon
,
Ron Shamir
,
Roded Sharan
Discrete Applied Mathematics
113
(1), 2001, pp. 109-128
Efficient line broadcasting in a
d
-dimensional grid
A. Averbuch
,
Y. Roditty
,
B. Shoham
Discrete Applied Mathematics
113
(2-3), 2001, pp. 129-141
Diameter determination on restricted graph families
Derek G. Corneil
,
Feodor F. Dragan
,
Michel Habib
,
Christoph Paul
Discrete Applied Mathematics
113
(2-3), 2001, pp. 143-166
On completing latin squares
T. Easton
,
R. Gary Parker
Discrete Applied Mathematics
113
(2-3), 2001, pp. 167-181
A strongly polynomial time algorithm for a constrained submodular optimization problem
David Hartvigsen
Discrete Applied Mathematics
113
(2-3), 2001, pp. 183-194
On the visibility graph of convex translates
Kiyoshi Hosono
,
Henk Meijer
,
David Rappaport
Discrete Applied Mathematics
113
(2-3), 2001, pp. 195-210
Deterministic inverse zero-patterns
Charles R. Johnson
,
Michael Lundquist
,
Thomas J. Lundy
,
John S. Maybee
Discrete Applied Mathematics
113
(2-3), 2001, pp. 211-236
Bounds for isoperimetric constants of infinite plane graphs
Serge Lawrencenko
,
Michael D. Plummer
,
Xiaoya Zha
Discrete Applied Mathematics
113
(2-3), 2001, pp. 237-241
Optimal arrangement of data in a tree directory
M.J. Luczak
,
S.D. Noble
Discrete Applied Mathematics
113
(2-3), 2001, pp. 243-253
Recognition of quasi-Meyniel graphs
Celina M.H. de Figueiredo
,
Kristina Vus̑ković
Discrete Applied Mathematics
113
(2-3), 2001, pp. 255-260
Cycle regular graphs need not be transitive
Jean-Luc Fouquet
,
Gen̑a Hahn
Discrete Applied Mathematics
113
(2-3), 2001, pp. 261-264
A note about games-composition dimension
J. Freixas
,
M.A. Puenta
Discrete Applied Mathematics
113
(2-3), 2001, pp. 265-273
The edge versus path incidence matrix of series-parallel graphs and greedy packing
Alan J. Hoffman
,
Baruch Schieber
Discrete Applied Mathematics
113
(2-3), 2001, pp. 275-284
Easy cases of the D0L sequence equivalence problem
Juha Honkala
Discrete Applied Mathematics
113
(2-3), 2001, pp. 285-290
On an estimate of the size of the maximum matching for a family of disjoint compact convex sets in the plane
Kiyoshi Hosono
Discrete Applied Mathematics
113
(2-3), 2001, pp. 291-298
Optimal quantitative group testing on cycles and paths
F.K. Hwang
,
J.S. Lee
Discrete Applied Mathematics
113
(2-3), 2001, pp. 299-302
Smallest independent dominating sets in Kronecker products of cycles
Pranava K. Jha
Discrete Applied Mathematics
113
(2-3), 2001, pp. 303-306
On the equitable chromatic number of complete
n
-partite graphs
Peter Che Bor Lam
,
Wai Chee Shiu
,
Chong Sze Tong
,
Zhong Fu Zhang
Discrete Applied Mathematics
113
(2-3), 2001, pp. 307-310
A degree condition of 2-factors in bipartite graphs
Xiangwen Li
,
Bing Wei
,
Fan Yang
Discrete Applied Mathematics
113
(2-3), 2001, pp. 311-318
Seiten 1
2
>