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=110
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An approximation algorithm for the maximum cut problem and its experimental analysis
A. Bertoni
,
P. Campadelli
,
G. Grossi
Discrete Applied Mathematics
110
(1), 2001, pp. 3-12
Experimenting an approximation algorithm for the LCS
Paola Bonizzoni
,
Gianluca Della Vedova
,
Giancarlo Mauri
Discrete Applied Mathematics
110
(1), 2001, pp. 13-24
Efficient algorithms and codes for
k
-cardinality assignment problems
Mauro Dell'Amico
,
Andrea Lodi
,
Silvano Martello
Discrete Applied Mathematics
110
(1), 2001, pp. 25-40
Tetris-hashing or optimal table compression
Nicola Galli
,
Bernhard Seybold
,
Klaus Simon
Discrete Applied Mathematics
110
(1), 2001, pp. 41-58
Designing algorithms by sampling
M.K. Goldberg
,
D.L. Hollinger
Discrete Applied Mathematics
110
(1), 2001, pp. 59-75
Transitive closure algorithm MEMTC and its performance analysis
Vesa Hirvisalo
,
Esko Nuutila
,
Eljas Soisalon-Soininen
Discrete Applied Mathematics
110
(1), 2001, pp. 77-84
Scheduling with unexpected machine breakdowns
Susanne Albers
,
Günter Schmidt
Discrete Applied Mathematics
110
(2-3), 2001, pp. 85-99
Embedding complete trees into the hypercube
Sergei L. Bezrukov
Discrete Applied Mathematics
110
(2-3), 2001, pp. 101-119
Persistency in combinatorial optimization problems on matroids
Katarína Cechlárová
,
Vladimír Lacko
Discrete Applied Mathematics
110
(2-3), 2001, pp. 121-132
On-line scheduling of small open shops
Bo Chen
,
Donglei Du
,
Jiye Han
,
Jianjun Wen
Discrete Applied Mathematics
110
(2-3), 2001, pp. 133-150
Lower bounds for computing geometric spanners and approximate shortest paths
Danny Z. Chen
,
Gautam Das
,
Michiel Smid
Discrete Applied Mathematics
110
(2-3), 2001, pp. 151-167
Efficient algorithms on distributive lattices
Michel Habib
,
Raoul Medina
,
Lhouari Nourine
,
George Steiner
Discrete Applied Mathematics
110
(2-3), 2001, pp. 169-187
Independent spanning trees with small depths in iterated line digraphs
Toru Hasunuma
,
Hiroshi Nagamochi
Discrete Applied Mathematics
110
(2-3), 2001, pp. 189-211
Searching for a minimal solution subgraph in explicit AND/OR graphs
Dus̑an Hvalica
Discrete Applied Mathematics
110
(2-3), 2001, pp. 213-225
Computational analysis of counter based schemes for VLSI test pattern generation
Dimitri Kagaris
,
Spyros Tragoudas
Discrete Applied Mathematics
110
(2-3), 2001, pp. 227-250
On mixing of certain random walks, cutoff phenomenon and sharp threshold of random matroid processes
Igor Pak
,
Van H. Vu
Discrete Applied Mathematics
110
(2-3), 2001, pp. 251-272
Enumerating near-4-regular maps on the sphere and the torus
Han Ren
,
Yanpei Liu
Discrete Applied Mathematics
110
(2-3), 2001, pp. 273-288
Domination graphs: Examples and counterexemples
Irena Rusu
,
Jeremy Spinrad
Discrete Applied Mathematics
110
(2-3), 2001, pp. 289-300
A cycle augmentation algorithm for minimum cost multicommodity flows on a ring
Bruce Shepherd
,
Lisa Zhang
Discrete Applied Mathematics
110
(2-3), 2001, pp. 301-315
On approximation intractability of the path-distance-width problem
Koichi Yamazaki
Discrete Applied Mathematics
110
(2-3), 2001, pp. 317-325