default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 17
Volume 17, Numbers 1-2, May 1987
- Toshihide Ibaraki, Masao Iri:
Preface. 1-2 - Satoru Fujishige
:
An out-of-kilter method for submodular flows. 3-16 - Masao Iri:
A very personal reminiscence on the problem of computational complexity. 17-27 - Hiroaki Ishii, Teruo Masuda, Toshio Nishida:
Two machine mixed shop scheduling problem with controllable machine speeds. 29-38 - Naoki Katoh, Toshihide Ibaraki:
A parametric characterization and an ɛ-approximation scheme for the minimization of a quasiconcave program. 39-66 - Toshimitsu Masuzawa, Kenichi Hagihara, Nobuki Tokura:
An optimal time algorithm for the k-vertex-connectivity unweighted augmentation problem for rooted directed trees. 67-105 - Kazuo Murota:
Menger-decomposition of a graph and its application to the structural analysis of a large-scale system of equations. 107-134 - Kazuo Murota:
Homotopy base of acyclic graphs - a combinatorial analysis of commutative diagrams by means of preordered matroid. 135-155 - Kazuo Murota, Satoru Fujishige:
Finding a homotopy base for directed paths in an acyclic graph. 157-162 - Takao Ozawa:
The principal partition of a pair of graphs and its applications. 163-186 - Yasuki Sekiguchi:
A decomposition theory based on a dominance relation and composite jobs. 187-211
Volume 17, Number 3, June 1987
- Ahmed Ainouche, Nicos Christofides:
Semi-independence number of a graph and the existence of Hamiltonian circuits. 213-221 - Robert G. Jeroslow:
Representability in mixed integer programmiing, I: Characterization results. 223-243 - Mikio Kano:
Ranking the vertices of an r-partite paired comparison digraph. 245-253 - Panos M. Pardalos, J. Ben Rosen:
Bounds for the solution set of linear complementarity problems. 255-261 - Ján Plesník:
A heuristic for the p-center problems in graphs. 263-268 - Debra D. Scott:
The competition-common enemy graph of a digraph. 269-280 - Pawel Winter:
Steiner problem in Halin networks. 281-294 - John Franco, Jacob Manuel Plotkin, John W. Rosenthal:
Correction to probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem. 295-299 - Peter Frankl:
Cops and robbers in graphs with large girth and Cayley graphs. 301-305 - Malaz Maamoun, Henry Meyniel:
On a game of policemen and robber. 307-309
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-03-08 00:38 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
