Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 35
Volume 35, Number 1, January 1992
- Vladimír Baláz, Vladimir Kvasnicka, Jiri Pospichal
:
Two metrics in a graph theory modeling of organic chemistry. 1-19 - D. Bankovic:
Certain Boolean equations. 21-27 - Wolfgang Gutjahr, Emo Welzl, Gerhard J. Woeginger:
Polynomial graph-colorings. 29-45 - Stephen J. Willson:
Calculating growth rates and moments for additive cellular automata. 47-65 - Peter Damaschke:
Distances in cocomparability graphs and their powers. 67-72 - Ulrich Faigle, Rainer Schrader:
A greedy reduction algorithm for setup optimization. 73-79 - Charles T. Ryan:
Linear sections of the general linear group: A geometric approach. 81-86
Volume 35, Number 2, January 1992
- Wenjie He, Wenchen He, Suling Xie:
Algebraic expressions for Kekulé structure counts of nonbranched cata-condensed benzenoid. 91-106 - Tor Helleseth:
Legendre sums and codes related to QR codes. 107-113 - Beverly Jamison, Stephan Olariu:
A tree representation for P4-sparse graphs. 115-129 - Naoki Katoh:
An e-approximation scheme for combinatorial optimization problems with minimum variance criterion. 131-141 - Naoki Katoh:
A fully polynomial time approximation scheme for minimum cost-reliability ratio problems. 143-155 - Peter Butkovic, Raymond A. Cuninghame-Green:
An O(n2) algorithm for the maximum cycle mean of an n×n bivalent matrix. 157-162 - Shigeru Masuyama:
On the tree packing problem. 163-166 - Owen J. Murphy:
Computing independent sets in graphs with large girth. 167-170
Volume 35, Number 3, March 1992
- Dominique de Werra, Alain Hertz:
Foreword. 175-176 - Mirjana Cangalovic, Jan A. M. Schreuder:
Modelling and solving an acyclic multi-period timetabling problem. 177-195 - J. Csima, László Lovász:
A matching algorithm for regular bipartite graphs. 197-203 - Dominique de Werra, Jacek Blazewicz:
Some preemptive open shop scheduling problems with a renewable or a nonrenewable resource. 205-219 - R. Fahrion, G. Dollansky:
Construction of university faculty timetables using logic programming techniques. 221-236 - Jacques A. Ferland, Alain Lavoie:
Exchanges procedures for timetabling problems. 237-253 - Alain Hertz:
Finding a feasible course schedule using Tabu search. 255-270 - Anthony J. W. Hilton:
Alternating Hamiltonian circuits in edge-coloured bipartite graphs. 271-273 - Naoki Katoh, Junji Koyanagi, Masamitsu Ohnishi, Toshihide Ibaraki:
Optimal strategies for some team games. 275-291 - Alexander Rosa:
On a class of completable partial edge-colourings. 293-299 - Jan A. M. Schreuder:
Combinatorial aspects of construction of competition Dutch Professional Football Leagues. 301-312 - Arabinda Tripathy:
Computerised decision aid for timetabling - a case analysis. 313-323
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-09-05 01:04 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:
