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=62
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Path covering problems and testing of printed circuits
Giovanni Andreatta
,
Francesco Mason
Discrete Applied Mathematics
62
, 1995, pp. 5-13
The shifting algorithm technique for the partitioning of trees
Ronald I. Becker
,
Yahoshua Perl
Discrete Applied Mathematics
62
, 1995, pp. 15-34
Scheduling independent tasks with multiple modes
L. Bianco
,
P. Dell'Olmo
,
M. Grazia Speranza
Discrete Applied Mathematics
62
, 1995, pp. 35-50
Decomposability of partially defined Boolean functions
Endre Boros
,
Vladimir Gurvich
,
Peter L. Hammer
,
Toshihide Ibaraki
,
Alexander Kogan
Discrete Applied Mathematics
62
, 1995, pp. 51-75
Efficient algorithms for some path partitioning problems
Peter Brucker
Discrete Applied Mathematics
62
, 1995, pp. 77-85
Compositions for matroids with the Fulkerson property
Sunil Chopra
Discrete Applied Mathematics
62
, 1995, pp. 87-101
Decomposition of wheel-and-parachute-free balanced bipartite graphs
Michele Conforti
,
Gérard Cornuéjols
,
M.R. Rao
Discrete Applied Mathematics
62
, 1995, pp. 103-117
On some algorithmic investigations of star partitions of graphs
Dragos̑ Cvetković
,
Peter Rowlinson Slobodan Simić
Discrete Applied Mathematics
62
, 1995, pp. 119-130
Graph partitioning applied to the logic testing of combinational circuits
Madlaine Davis-Moradkhan
,
Catherine Roucairol
Discrete Applied Mathematics
62
, 1995, pp. 131-165
Some new classes of facets for the equicut polytope
C.C. de Souza
,
M. Laurent
Discrete Applied Mathematics
62
, 1995, pp. 167-191
Complete linear descriptions of small asymmmetric traveling salesman polytopes
R. Euler
,
H. Le Verge
Discrete Applied Mathematics
62
, 1995, pp. 193-208
A min-max relation for
K_3
-covers in graphs noncontractible to
K_5\backslash e
Ali Ridha Mahjoub
Discrete Applied Mathematics
62
, 1995, pp. 209-219
Partitioning a matrix to minimize the maximum cost
Aristide Mingozzi
,
Salvatore Ricciardelli
,
Massimo Spadoni
Discrete Applied Mathematics
62
, 1995, pp. 221-248
Solving the max-cut problem using eigenvalues
Svatopluk Poljak
,
Franz Rendl
Discrete Applied Mathematics
62
, 1995, pp. 249-278
Bin-packing and matchings in threshold graphs
G. Tinhofer
Discrete Applied Mathematics
62
, 1995, pp. 279-289