default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 7
Volume 7, Number 1, 1987
- Noga Alon, Ravi B. Boppana:
The monotone circuit complexity of Boolean functions. 1-22 - Anders Björner, Peter Frankl, Richard P. Stanley:
The number of faces of balanced Cohen-Macaulay complexes and a generalized Macaulay theorem. 23-34 - Béla Bollobás, Andrew Thomason:
Threshold functions. 35-38 - Andreas W. M. Dress, László Lovász:
On some combinatorial properties of algebraic matroids. 39-48 - András Frank
, Éva Tardos:
An application of simultaneous Diophantine approximation in combinatorial optimization. 49-65 - Peter Frankl:
On a pursuit game on Cazley graphs. 67-70 - Joel Friedman, Nicholas Pippenger:
Expanding graphs contain all small trees. 71-76 - J. I. Hall:
A local characterization of the Johnson scheme. 77-85 - Eugene M. Luks:
Computing the composition factors of a permutation group in polynomial time. 87-99 - Ketan Mulmuley:
A fast parallel algorithm to compute the rank of a matrix over an arbitrary field. 101-104 - Ketan Mulmuley, Umesh V. Vazirani, Vijay V. Vazirani:
Matching is as easy as matrix inversion. 105-113 - Hans Jürgen Prömel, B. L. Rothschild:
A canonical restricted version of van der Waerden's theorem. 115-119 - Eli Shamir, Joel Spencer:
Sharp concentration of the chromatic number on random graphs Gn, p. 121-129 - Micha Sharir:
Almost linear upper bounds on the length of general Davenport-Schinzel sequences. 131-143 - Carsten Thomassen:
On digraphs with no two disjoint directed cycles. 145-150
Volume 7, Number 2, 1987
- Noga Alon, Daniel J. Kleitman, Carl Pomerance, Michael E. Saks, Paul D. Seymour:
The smallets n-uniform hypergraph with positive discrepancy. 151-160 - Imre Bárány:
An extension of the Erdös - Szekeres theorem on large angles. 161-169 - Thang Nguyen Bui, Soma Chaudhuri, Frank Thomson Leighton, Michael Sipser:
Graph bisection algorithms with good average case behavior. 171-191 - Heinz Gröflin:
On switching path polyhedra. 193-204 - Mikio Kano:
Maximum and k-th maximal spanning trees of a weighted graph. 205-214
Volume 7, Number 3, 1987
- H. L. Abbott, A. Liu:
On a problem of P. Erdös concerning Property K. 215-219 - Marshall W. Bern, Maria M. Klawe, Alice Wong:
Bounds on the convex label number of trees. 221-230 - Robert E. Bixby, Collette R. Coullard:
Finding a small 3-connected minor maintaining a fixed minor and a fixed element. 231-242 - André Bouchet:
Reducing prime graphs and recognizing circle graphs. 243-254 - Paulo Feofiloff, D. H. Younger:
Directed cut transversal packing for source-sink connected graphs. 255-263 - Alan M. Frieze, Bill Jackson:
Large holes in sparse random graphs. 265-274 - David W. Matula:
Expose-and-merge exploration and the chromatic number of random graph. 275-284 - John E. Olson:
A problem of Erdös on Abelian groups. 285-289 - Sharad S. Sane, Mohan S. Shrikhande:
Quasi-symmetric 2, 3. 4-designs. 291-301 - Michael Stiebitz:
Subgraphs of color-critical graphs. 303-312
Volume 7, Number 4, 1987
- Richard Anderson:
A Parallel algorithm for the maximal path problem. 315-326 - Béla Bollobás, Trevor I. Fenner, Alan M. Frieze:
An algorithm for finding Hamilton cycles in a random graph. 327-341 - Shuji Jimbo, Akira Maruoka:
Expanders obtained from affine transformations. 343-355 - Leonid A. Levin:
One-way functions and pseudorandom generators. 357-363 - Prabhakar Raghavan, Clark D. Thompson:
Randomized rounding: a technique for provably good algorithms and algorithmic proofs. 365-374 - Umesh V. Vazirani:
Strong communication complexity or generating quasirandom sequences form two communicating semi-random sources. 375-392
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-11-22 19:45 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:
