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=82
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
T
-choosability in graphs
Noga Alon
,
Ayal Zaks
Discrete Applied Mathematics
82
(1-3), 1998, pp. 1-13
On the quality of local search for the quadratic assignment problem
Eric Angel
,
Vassilis Zissimopoulos
Discrete Applied Mathematics
82
(1-3), 1998, pp. 15-25
The scheduling of maintenance service
Shoshana Anily
,
Celia A. Glass
,
Refael Hassin
Discrete Applied Mathematics
82
(1-3), 1998, pp. 27-42
Polyhedral analysis and decompositions for capacitated plant location-type problems
Bintong Chen
,
Monique Guignard
Discrete Applied Mathematics
82
(1-3), 1998, pp. 79-91
An approximation scheme for strip packing of rectangles with bounded dimensions
W. Fernandez de la Vega
,
V. Zissimopoulos
Discrete Applied Mathematics
82
(1-3), 1998, pp. 93-101
The Gergonne
p
-pile problem and the dynamics of the function
x\rightarrow\lfloor(x+r)/p\rfloor
John Harrison
,
Thomas Brennan
,
Steven Gapinski
Discrete Applied Mathematics
82
(1-3), 1998, pp. 103-113
Some general aspects of the framing number of a digraph
Michael A. Henning
,
Hiren Maharaj
Discrete Applied Mathematics
82
(1-3), 1998, pp. 115-133
A strongly polynomial algorithm for the inverse shortest arborescence problem
Zhiquan Hu
,
Zhenhong Liu
Discrete Applied Mathematics
82
(1-3), 1998, pp. 135-154
The Metropolis algorithm for graph bisection
Mark Jerrum
,
Gregory B. Sorkin
Discrete Applied Mathematics
82
(1-3), 1998, pp. 155-175
On the covering radius of an unrestricted code as a function of the rate and dual distance
Simon Litsyn
,
Patrick Solé
,
René Struik
Discrete Applied Mathematics
82
(1-3), 1998, pp. 177-191
Fast equi-partitioning of rectangular domains using stripe decomposition
Wayne Martin
Discrete Applied Mathematics
82
(1-3), 1998, pp. 193-207
Characterizing and edge-colouring split-indifference graphs
Carmen Z. Ortiz
,
Nelson Maculan
,
Jayme L. Szwarcfiter
Discrete Applied Mathematics
82
(1-3), 1998, pp. 209-217
The single loop representations of regular languages
H.J. Shyr
,
S.S. Yu
Discrete Applied Mathematics
82
(1-3), 1998, pp. 219-229
On aggregating two linear diophantine equations
Nan Zhu
,
Kevin Broughan
Discrete Applied Mathematics
82
(1-3), 1998, pp. 231-246
Properly coloured Hamiltonian paths in edge-coloured complete graphs
J. Bang-Jensen
,
G. Gutin
,
A. Yeo
Discrete Applied Mathematics
82
(1-3), 1998, pp. 247-250
On the double competition number
Zoltán Füredi
Discrete Applied Mathematics
82
(1-3), 1998, pp. 251-255
A graph-theoretic result for a model of neural computation
Alexandros V. Gerbessiotis
Discrete Applied Mathematics
82
(1-3), 1998, pp. 257-262
On trees and noncrossing partitions
Martin Klazar
Discrete Applied Mathematics
82
(1-3), 1998, pp. 263-269
A constructive proof for the induction of
M
-convex functions through networks
A. Shioura
Discrete Applied Mathematics
82
(1-3), 1998, pp. 271-278