default search action
Discrete Applied Mathematics, Volume 12
Volume 12, Number 1, September 1985
- Alain Billionnet, Michel Minoux:
Maximizing a supermodular pseudoboolean function: A polynomial algorithm for supermodular cubic functions. 1-11 - Ronald V. Book:
The base of the intersection of two free submonoids. 13-20 - Rainer E. Burkard, Ulrich Fincke:
Probabilistic asymptotic properties of some combinatorial optimization problems. 21-29 - J. S. Frame, Dennis Crippen Gilliland:
Votes and a half-binomial. 31-40 - Friedrich Otto:
Classes of regular and context-free languages over countably infinite alphabets. 41-56 - Uri N. Peled, Bruno Simeone:
Polynomial-time algorithms for regular set-covering and threshold synthesis. 57-69 - Yehoshua Perl, Uzi Vishkin:
Efficient implementation of a shifting algorithm. 71-80 - Richard P. Stanley:
On dimer coverings of rectangles of fixed width. 81-87 - Jeremy P. Spinrad, Gopalakrishnan Vijayan:
Worst case analysis of a graph coloring algorithm. 89-92
Volume 12, Number 2, October 1985
- Christian Choffrut, Juhani Karhumäki:
Test sets for morphisms with bounded delay. 93-101 - Stefan M. Dodunekov, Nikolai L. Manev:
An improvement of the Griesmer bound for some small minimum distances. 103-114 - Andrzej Ehrenfeucht, Grzegorz Rozenberg, Keijo Ruohonen:
A morphic representation of EOL languages and other ETOL languages. 115-122 - Joan Feigenbaum, John Hershberger, Alejandro A. Schäffer:
A polynomial time algorithm for finding the prime factors of cartesian-product graphs. 123-138 - Richard A. Games:
Crosscorrelation of M-sequences and GMW-sequences with the same primitive polynomial. 139-146 - Pierre Hansen, Brigitte Jaumard:
Uniquely solvable quadratic boolean equations. 147-154 - Frank Harary, J. Richard Lundgren, John S. Maybee:
On signed digraphs with all cycles negative. 155-164 - Ales Pultr
, J. Úlehla:
Remarks on strategies in combinatorial games. 165-173 - Grzegorz Rozenberg, R. Verraedt:
On erasing in EOL forms. 175-189 - Peter C. Fishburn:
A characterization of uniquely representable interval graphs. 191-194
Volume 12, Number 3, November 1985
- Alan A. Bertossi, Maurizio A. Bonuccelli:
A polynomial feasibility test for preemptive periodic scheduling of unrelated processors. 195-201 - Maurizio A. Bonuccelli:
Dominating sets and domatic number of circular arc graphs. 203-213 - Jean Paul Bordat:
Parcours dans les graphes: Un outil pour l'algorithmique des ensembles ordonnes. 215-231 - Derek G. Corneil:
The complexity of generalized clique packing. 233-239 - A. A. Elimam, Salah E. Elmaghraby:
On the reduction method for integer linear programs, II. 241-260 - Eric Goles Chacc, Françoise Fogelman-Soulié, Didier Pellegrin:
Decreasing energy functions as a tool for studying threshold networks. 261-277 - Michel Habib, Roland Jégou:
N-free posets as generalizations of series-parallel posets. 279-291 - R. E. Krichevsky, B. Ya. Ryabko:
Universal retrieval trees. 293-302 - Ten-Hwang Lai, Alan P. Sprague:
On the complexity of a family of generalized matching problems. 303-318
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-12-19 22:04 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: