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=42
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Right invariant metrics and measures of presortedness
Vladimir Estivill-Castro
,
Heikki Mannila
,
Derick Wood
Discrete Applied Mathematics
42
, 1993, pp. 1-16
Solving makespan minimization problems with Lagrangean decomposition
Monique Guignard
Discrete Applied Mathematics
42
(1), 1993, pp. 17-29
A prospect for a general method of constructing
t
-designs
A.S. Hedayat
,
G.B. Khosrovshahi
,
D. Majumdar
Discrete Applied Mathematics
42
(1), 1993, pp. 31-50
The complexity of domination problems in circle graphs
Mark J. Keil
Discrete Applied Mathematics
42
(1), 1993, pp. 51-63
Bounding sample size with the Vapnik-Chervonenkis dimension
John Shawe-Taylor
,
Martin Anthony
,
N.L. Biggs
Discrete Applied Mathematics
42
(1), 1993, pp. 65-73
Fast information sharing in a complete network
V.S. Sunderam
,
Peter Winkler
Discrete Applied Mathematics
42
(1), 1993, pp. 75-86
A note on subtrees rooted along the primary path of a binary tree
Brent M. Troutman
,
Michael R. Karlinger
Discrete Applied Mathematics
42
(1), 1993, pp. 87-93
Studies on hypergraphs I: hyperforests
Lianwen Zhang
Discrete Applied Mathematics
42
(1), 1993, pp. 95-112
On pseudounimodular matrices
Mario Martelli
,
Mario Pedrazzoli
Discrete Applied Mathematics
42
(1), 1993, pp. 113-117
Algorithms for minimizing maximum lateness with unit length tasks and resource constraints
J. BĘazewicz
,
W. Kubiak
,
S. Martello
Discrete Applied Mathematics
42
(2-3), 1993, pp. 123-138
Note on combinatorial optimization with max-linear objective functions
Sung-Jin Chung
,
Horst W. Hamacher
,
Francesco Maffioli
,
Katta G. Murty
Discrete Applied Mathematics
42
(2-3), 1993, pp. 139-145
Efficient reformulation for 0-1 programs - methods and computational results
B.L. Dietrich
,
L.F. Escudero
,
F. Chance
Discrete Applied Mathematics
42
(2-3), 1993, pp. 147-175
Directed hypergraphs and applications
Giorgio Gallo
,
Giustino Longo
,
Stefano Pallottino
,
Sang Nguyen
Discrete Applied Mathematics
42
(2-3), 1993, pp. 177-201
Why should biconnected components be identified first
Dorit S. Hochbaum
Discrete Applied Mathematics
42
(2-3), 1993, pp. 203-210
Sequential and parallel local search for the time-constrained traveling salesman problem
Gerard Kindervater
,
Jan Karel Lenstra
,
Martin Savelsbergh
Discrete Applied Mathematics
42
(2-3), 1993, pp. 211-225
Most uniform path partitioning and its use in image processing
Mario Lucertini
,
Yehoshua Perl
,
Bruno Simeone
Discrete Applied Mathematics
42
(2-3), 1993, pp. 227-256
Lagrangean methods for 0-1 quadratic problems
Philippe Michelon
,
Nelson Maculan
Discrete Applied Mathematics
42
(2-3), 1993, pp. 257-269
Computing the throughput of a network with dedicated lines
Christos H. Papadimitriou
,
Paolo Serafini
,
Mihalis Yannakakis
Discrete Applied Mathematics
42
(2-3), 1993, pp. 271-278
A class of generalized greedy algorithms for the multi-knapsack problem
A.H.G. Rinnooy Kan
,
L. Stougie
,
C. Vercellis
Discrete Applied Mathematics
42
(2-3), 1993, pp. 279-290
A fast randomized algorithm for partitioning a graph into paths of fixed length
Leen Stougie
Discrete Applied Mathematics
42
(2-3), 1993, pp. 291-303