Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 36
Volume 36, Number 1, March 1992
- Alberto Apostolico, Mikhail J. Atallah, Susanne E. Hambrusch:
New clique and independent set algorithms for circle graphs. 1-24 - J. Mark Keil, Doug Schaefer:
An optimal algorithm for finding dominating cycles in circular-arc graphs. 25-34 - Marek Kubale
:
Some results concerning the complexity of restricted colorings of graphs. 35-46 - Giri Narasimhan, Rachel Manber:
Stability number and chromatic number of tolerance graphs. 47-56 - Dominique Roelants van Baronaigien, Frank Ruskey:
Generating permutations with given ups and downs. 57-65 - Fuji Zhang, Maolin Zheng:
Generalized hexagonal systems with each hexagon being resonant. 67-73 - Leizhen Cai, John A. Ellis:
Edge colouring line graphs of unicyclic graphs. 75-82 - Reinhard Franzkeit:
A binary search problem on graphs. 83-86 - András Kornai, Zsolt Tuza:
Narrowness, pathwidth, and their application in natural language processing. 87-92
Volume 36, Number 2, April 1992
- Jean-Claude Bermond, Pavol Hell, Arthur L. Liestman, Joseph G. Peters:
Sparse broadcast graphs. 97-130 - Keith Edwards:
The complexity of some graph colouring problems. 131-140 - Yijie Han, Yoshihide Igarashi, Miroslaw Truszczynski:
Indexing functions and time lower bounds for sorting on a mesh-connected computer. 141-152 - Martin Juvan, Bojan Mohar:
Optimal linear labelings and eigenvalues of graphs. 153-168 - Bojan Mohar:
A domain monotonicity theorem for graphs and Hamiltonicity. 169-177 - Uwe T. Zimmermann:
Negative circuits for flows and submodular flows. 179-189 - Luisa Gargano, János Körner, Ugo Vaccaro:
Search problems for two irregular coins with incomplete feedback: the underweight model. 191-197 - Yannis Manoussakis:
A linear-time algorithm for finding Hamiltonian cycles in tournaments. 199-201 - C. Pandu Rangan, Ramesh Govindan:
An O(n log n) algorithm for a maxmin location problem. 203-205 - Chi Wang, A. C. Williams:
Addendum to the threshold order of a Boolean function. 207
Volume 36, Number 3, May 1992
- Hocine Belouadah, Marc E. Posner, Chris N. Potts:
Scheduling with release dates on a single machine to minimize total weighted completion time. 213-231 - Srimat T. Chakradhar, Michael L. Bushnell:
A solvable class of quadratic 0-1 programming. 233-251 - Jan Kratochvíl, Svatopluk Poljak:
Compatible 2-factors. 253-266 - Chung-Lun Li, S. Thomas McCormick, David Simchi-Levi:
The point-to-point delivery and connection problems: complexity and algorithms. 267-292 - Walter D. Morris Jr.:
The maximum number of complementary facets of a simplicial polytope. 293-298 - Luisa Gargano, V. Montouri, G. Setaro, Ugo Vaccaro:
An improved algorithm for quantitative group testing. 299-306 - Ferenc Gécseg, Balázs Imreh:
Finite isomorphically complete systems. 307-311 - Xuding Zhu:
A simple proof of the multiplicativity of directed cycles of prime power length. 313-316
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-22 20:03 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:
