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=17
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An out-of-kilter method for submodular flows
Satoru Fujishige
Discrete Applied Mathematics
17
, 1987, pp. 3-16
A very personal reminiscence on the problem of computational complexity
Masao Iri
Discrete Applied Mathematics
17
, 1987, pp. 17-27
Two machine mixed shop scheduling problem with controllable machine speeds
Hiroaki Ishii
,
Teruo Masuda
,
Toshio Nishida
Discrete Applied Mathematics
17
, 1987, pp. 29-38
A parametric characterization and an
\epsilon
-approximation scheme for the minimization of a quasiconcave program
Naoki Katoh
,
Toshihide Ibaraki
Discrete Applied Mathematics
17
, 1987, pp. 39-66
An optimal time algorithm for the
k
-vertex-connectivity unweighted augmentation problem for rooted directed trees
Toshimitsu Masuzawa
,
Ken'ichi Hagihara
,
Nobuki Tokura
Discrete Applied Mathematics
17
, 1987, pp. 67-105
Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations
Kazuo Murota
Discrete Applied Mathematics
17
, 1987, pp. 107-134
Homotopy base of acyclic graphs - A combinatorial analysis of commutative diagrams by means of preordered matroid
Kazuo Murota
Discrete Applied Mathematics
17
, 1987, pp. 135-155
Finding a homotopy base for directed paths in an acyclic graph
Kazuo Murota
,
Satoru Fujishige
Discrete Applied Mathematics
17
, 1987, pp. 157-162
The principal partition of a pair of graphs and its applications
Takao Ozawa
Discrete Applied Mathematics
17
, 1987, pp. 163-186
A decomposition theory based on a dominance relation and composite jobs
Yasuki Sekiguchi
Discrete Applied Mathematics
17
, 1987, pp. 187-211
Semi-independence number of a graph and the existence of Hamiltonian circuits
Ahmed Ainouche
,
Nicos Christofides
Discrete Applied Mathematics
17
, 1987, pp. 213-221
Representability in mixed integer programming, I: Characterization results
Robert G. Jeroslow
Discrete Applied Mathematics
17
, 1987, pp. 223-243
Ranking the vertices of an
r
-partite paired comparison digraph
Mikio Kano
Discrete Applied Mathematics
17
, 1987, pp. 245-253
Bounds for the solution set of linear complementarity problems
Panos M. Pardalos
,
J.B. Rosen
Discrete Applied Mathematics
17
, 1987, pp. 255-261
A heuristic for the
p
-center problem in graphs
J. PlesnÃk
Discrete Applied Mathematics
17
, 1987, pp. 263-268
The competition-common enemy graph of a digraph
Debra D. Scott
Discrete Applied Mathematics
17
, 1987, pp. 269-280
Steiner problem in Halin networks
Pawel Winter
Discrete Applied Mathematics
17
, 1987, pp. 281-294
Correction to probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem
John Franco
,
J.M. Plotkin
,
John W. Rosenthal
Discrete Applied Mathematics
17
, 1987, pp. 295-299
Cops and robbers in graphs with large girth and Cayley graphs
Peter Frankl
Discrete Applied Mathematics
17
, 1987, pp. 301-305
On a game of policemen and robber
M. Maamoun
,
H. Meyniel
Discrete Applied Mathematics
17
, 1987, pp. 307-309