Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 59
Volume 59, Number 1, 1995
- Francis T. Boesch, Xiaoming Li, José Rodríguez:
Graphs with Most Number of Three Point Induced Connected Subgraphs. 1-10 - Heidemarie Bräsel, David Kluge, Frank Werner
:
A Polynomial Algorithm for an open Shop Problem with Unit Processing Times and Tree Constraints. 11-21 - Thomas Eiter, Pekka Kilpeläinen, Heikki Mannila:
Recognizing Renamable Generalized Propositional Horn Formulas Is NP-complete. 23-31 - Xin He, David B. Sher:
on Determining Non-isotopic Configurations of Points on a Circle. 33-50 - Johan Karlander:
Matrices Generated By Semilattices. 51-56 - Yves Pochet, Laurence A. Wolsey:
Integer Knapsack and Flow Covers with Divisible Coefficients: Polyhedra, optimization and Separation. 57-74 - Vitaly A. Strusevich:
Two Machine Flow Shop Scheduling Problem with No Wait in Process: Controllable Machine Speeds. 75-86 - Jimmy J. M. Tan, Yuang-Cheh Hsueh:
A Generalization of the Stable Matching Problem. 87-102
Volume 59, Number 2, 1995
- José Gómez, Paz Morillo, Carles Padró:
Large (d, D, D', s) - bipartite Digraphs. 103-114 - Scott W. Hadley:
Approximation Techniques for Hypergraph Partitioning Problems. 115-127 - Sandi Klavzar, Norbert Seifter:
Dominating Cartesian Products of Cycles. 129-136 - Weiguo Liu, Anthony Vannelli:
Generating Lower Bounds for the Linear Arrangement Problem. 137-151 - Ola Petersson, Alistair Moffat:
A Framework for Adaptive Sorting. 153-179 - Jeremy P. Spinrad, R. Sritharan:
Algorithms for Weakly Triangulated Graphs. 181-191 - Jared Wunsch:
The Shields-Harary Number for Wheel and Broken Wheel Graphs. 193-199
Volume 59, Number 3, 1995
- Lars Døvling Andersen, Herbert Fleischner:
The NP-completeness of Finding A-trails in Eulerian Graphs and of Finding Spanning Trees in Hypergraphs. 203-214 - Michal Benelli, Refael Hassin:
optimal Separable Partitioning in the Plane. 215-224 - Martin C. Carlisle, Errol L. Lloyd:
on the K-coloring of Intervals. 225-235 - Yuri N. Sotskov, Natalia V. Shakhlevich:
NP-hardness of Shop-scheduling Problems with Three Jobs. 237-266 - Ramjee P. Swaminathan, Donald K. Wagner:
The Arborescence-realization Problem. 267-283 - Arthur T. Benjamin, Cherlyn Converse, Henry A. Krieger:
How Do I Marry Thee? Let Me Count the Ways!. 285-292 - Marco Carpentieri:
Some Democratic Secret Sharing Schemes. 293-298
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-05-10 18:48 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:
