Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 15
Volume 15, Number 1, September 1986
- Frank D. Anger, J. Sarmiento, Rita V. Rodríguez:
Representative graphs of r-regular partial planes and representation of orthomodular posets. 1-10 - Darko Babic, Ante Graovac, Bojan Mohar, Tomaz Pisanski:
The matching polynomial of a polygraph. 11-24 - Ivan Gutman, Fuji Zhang:
On the ordering of graphs with respect to their matching numbers. 25-33 - Nicholas G. Hall
, Dorit S. Hochbaum:
A fast approximation algorithm for the multicovering problem. 35-40 - Horst W. Hamacher:
Maximal dynamic polymatroid flows and applications. 41-54 - Tero Harju, Juhani Karhumäki, H. C. M. Kleijn:
On morphic generation of regular languages. 55-60 - Bruce Hedman:
A polynomial algorithm for constructing the clique graph of a line graph. 61-66 - William F. McColl, K. Noshita:
On the number of edges in the transitive closure of a graph. 67-73 - Zbigniew Palka, Andrzej Rucinski:
On the order of the largest induced tree in a random graph. 75-83 - Uwe Zimmermann:
Linear and combinatorial sharing problems. 85-104 - Joan Feigenbaum:
Directed cartesian-product graphs have unique factorizations that can be computed in polynomial time. 105-110 - Dan A. Simovici, Corina Reischer:
Iterative characterizations of Boolean algebras. 111-116 - Sheng Yu:
A property of real-time trellis automata. 117-119
Volume 15, Numbers 2-3, November 1986
- Egon Balas:
A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring. 123-134 - Wolfgang W. Bein, Peter Brucker:
Greedy concepts for network flow problems. 135-144 - Claude Berge:
New classes of perfect graphs. 145-154 - Robert E. Bixby, Collette R. Coullard:
On chains of 3-connected matroids. 155-166 - Rainer E. Burkard:
Optimal schedules for periodically recurring events. 167-180 - Paolo M. Camerini, Francesco Maffioli, Silvano Martello, Paolo Toth:
Most and least uniform spanning trees. 181-197 - Sung-Jin Chung, Katta G. Murty, Soo Y. Chang:
On KΔ. 199-211 - Maurice Cochand, Dominique de Werra:
Generalized neighbourhoods and a class of perfectly orderable graphs. 213-220 - Yves Crama, Peter L. Hammer, Toshihide Ibaraki:
Strong unimodularity for matrices and hypergraphs. 221-239 - Ulrich Derigs, Oskar Goecke, Rainer Schrader:
Monge sequences and a simple assignment algorithm. 241-248 - Ulrich Faigle:
Exchange properties of combinatorial closure spaces. 249-260 - Ulrich Faigle, Rainer Schrader:
On the computational complexity of the order polynomial. 261-269 - Les R. Foulds:
Testing the theory of evolution: A novel application of comibinatorial optimization. 271-282 - Bernhard Korte, László Lovász:
Homomorphisms and Ramsey properties of antimatroids. 283-290 - Eugene L. Lawler, Charles U. Martel:
Polymatroidal flows with lower bounds. 291-313 - Kurt Mehlhorn, Bernd H. Schmidt:
On BF-orderable graphs. 315-327 - Fan T. Tseng, Klaus Truemper:
A decomposition of the matroids with the max-flow min-cut property. 329-364 - Uwe Zimmermann:
Duality for balanced submodular flows. 365-376
a service of 
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 2024-04-19 19:20 CEST 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:
