default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch dblp for Publications
export results for "toc:db/journals/combinatorica/combinatorica7.bht:"
download as .bib file
@article{DBLP:journals/combinatorica/AbbottL87,
author = {H. L. Abbott and
A. Liu},
title = {On a problem of P. Erd{\"{o}}s concerning Property {K}},
journal = {Comb.},
volume = {7},
number = {3},
pages = {215--219},
year = {1987},
url = {https://doi.org/10.1007/BF02579298},
doi = {10.1007/BF02579298},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/AbbottL87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/AlonB87,
author = {Noga Alon and
Ravi B. Boppana},
title = {The monotone circuit complexity of Boolean functions},
journal = {Comb.},
volume = {7},
number = {1},
pages = {1--22},
year = {1987},
url = {https://doi.org/10.1007/BF02579196},
doi = {10.1007/BF02579196},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/AlonB87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/AlonKPSS87,
author = {Noga Alon and
Daniel J. Kleitman and
Carl Pomerance and
Michael E. Saks and
Paul D. Seymour},
title = {The smallets n-uniform hypergraph with positive discrepancy},
journal = {Comb.},
volume = {7},
number = {2},
pages = {151--160},
year = {1987},
url = {https://doi.org/10.1007/BF02579446},
doi = {10.1007/BF02579446},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/AlonKPSS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Anderson87,
author = {Richard Anderson},
title = {A Parallel algorithm for the maximal path problem},
journal = {Comb.},
volume = {7},
number = {4},
pages = {315--326},
year = {1987},
url = {https://doi.org/10.1007/BF02579320},
doi = {10.1007/BF02579320},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Anderson87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Barany87,
author = {Imre B{\'{a}}r{\'{a}}ny},
title = {An extension of the Erd{\"{o}}s - Szekeres theorem on large angles},
journal = {Comb.},
volume = {7},
number = {2},
pages = {161--169},
year = {1987},
url = {https://doi.org/10.1007/BF02579447},
doi = {10.1007/BF02579447},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Barany87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BernKW87,
author = {Marshall W. Bern and
Maria M. Klawe and
Alice Wong},
title = {Bounds on the convex label number of trees},
journal = {Comb.},
volume = {7},
number = {3},
pages = {221--230},
year = {1987},
url = {https://doi.org/10.1007/BF02579299},
doi = {10.1007/BF02579299},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BernKW87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BixbyC87,
author = {Robert E. Bixby and
Collette R. Coullard},
title = {Finding a small 3-connected minor maintaining a fixed minor and a
fixed element},
journal = {Comb.},
volume = {7},
number = {3},
pages = {231--242},
year = {1987},
url = {https://doi.org/10.1007/BF02579300},
doi = {10.1007/BF02579300},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BixbyC87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BjornerFS87,
author = {Anders Bj{\"{o}}rner and
Peter Frankl and
Richard P. Stanley},
title = {The number of faces of balanced Cohen-Macaulay complexes and a generalized
Macaulay theorem},
journal = {Comb.},
volume = {7},
number = {1},
pages = {23--34},
year = {1987},
url = {https://doi.org/10.1007/BF02579197},
doi = {10.1007/BF02579197},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BjornerFS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BollobasFF87,
author = {B{\'{e}}la Bollob{\'{a}}s and
Trevor I. Fenner and
Alan M. Frieze},
title = {An algorithm for finding Hamilton cycles in a random graph},
journal = {Comb.},
volume = {7},
number = {4},
pages = {327--341},
year = {1987},
url = {https://doi.org/10.1007/BF02579321},
doi = {10.1007/BF02579321},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BollobasFF87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BollobasT87,
author = {B{\'{e}}la Bollob{\'{a}}s and
Andrew Thomason},
title = {Threshold functions},
journal = {Comb.},
volume = {7},
number = {1},
pages = {35--38},
year = {1987},
url = {https://doi.org/10.1007/BF02579198},
doi = {10.1007/BF02579198},
timestamp = {Wed, 03 Aug 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BollobasT87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Bouchet87,
author = {Andr{\'{e}} Bouchet},
title = {Reducing prime graphs and recognizing circle graphs},
journal = {Comb.},
volume = {7},
number = {3},
pages = {243--254},
year = {1987},
url = {https://doi.org/10.1007/BF02579301},
doi = {10.1007/BF02579301},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Bouchet87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/BuiCLS87,
author = {Thang Nguyen Bui and
Soma Chaudhuri and
Frank Thomson Leighton and
Michael Sipser},
title = {Graph bisection algorithms with good average case behavior},
journal = {Comb.},
volume = {7},
number = {2},
pages = {171--191},
year = {1987},
url = {https://doi.org/10.1007/BF02579448},
doi = {10.1007/BF02579448},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/BuiCLS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/DressL87,
author = {Andreas W. M. Dress and
L{\'{a}}szl{\'{o}} Lov{\'{a}}sz},
title = {On some combinatorial properties of algebraic matroids},
journal = {Comb.},
volume = {7},
number = {1},
pages = {39--48},
year = {1987},
url = {https://doi.org/10.1007/BF02579199},
doi = {10.1007/BF02579199},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/DressL87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FeofiloffY87,
author = {Paulo Feofiloff and
D. H. Younger},
title = {Directed cut transversal packing for source-sink connected graphs},
journal = {Comb.},
volume = {7},
number = {3},
pages = {255--263},
year = {1987},
url = {https://doi.org/10.1007/BF02579302},
doi = {10.1007/BF02579302},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FeofiloffY87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FrankT87,
author = {Andr{\'{a}}s Frank and
{\'{E}}va Tardos},
title = {An application of simultaneous Diophantine approximation in combinatorial
optimization},
journal = {Comb.},
volume = {7},
number = {1},
pages = {49--65},
year = {1987},
url = {https://doi.org/10.1007/BF02579200},
doi = {10.1007/BF02579200},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FrankT87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Frankl87,
author = {Peter Frankl},
title = {On a pursuit game on Cazley graphs},
journal = {Comb.},
volume = {7},
number = {1},
pages = {67--70},
year = {1987},
url = {https://doi.org/10.1007/BF02579201},
doi = {10.1007/BF02579201},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Frankl87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FriedmanP87,
author = {Joel Friedman and
Nicholas Pippenger},
title = {Expanding graphs contain all small trees},
journal = {Comb.},
volume = {7},
number = {1},
pages = {71--76},
year = {1987},
url = {https://doi.org/10.1007/BF02579202},
doi = {10.1007/BF02579202},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FriedmanP87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/FriezeJ87,
author = {Alan M. Frieze and
Bill Jackson},
title = {Large holes in sparse random graphs},
journal = {Comb.},
volume = {7},
number = {3},
pages = {265--274},
year = {1987},
url = {https://doi.org/10.1007/BF02579303},
doi = {10.1007/BF02579303},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/FriezeJ87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Groflin87,
author = {Heinz Gr{\"{o}}flin},
title = {On switching path polyhedra},
journal = {Comb.},
volume = {7},
number = {2},
pages = {193--204},
year = {1987},
url = {https://doi.org/10.1007/BF02579449},
doi = {10.1007/BF02579449},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Groflin87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Hall87,
author = {J. I. Hall},
title = {A local characterization of the Johnson scheme},
journal = {Comb.},
volume = {7},
number = {1},
pages = {77--85},
year = {1987},
url = {https://doi.org/10.1007/BF02579203},
doi = {10.1007/BF02579203},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Hall87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/JimboM87,
author = {Shuji Jimbo and
Akira Maruoka},
title = {Expanders obtained from affine transformations},
journal = {Comb.},
volume = {7},
number = {4},
pages = {343--355},
year = {1987},
url = {https://doi.org/10.1007/BF02579322},
doi = {10.1007/BF02579322},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/JimboM87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Kano87,
author = {Mikio Kano},
title = {Maximum and k-th maximal spanning trees of a weighted graph},
journal = {Comb.},
volume = {7},
number = {2},
pages = {205--214},
year = {1987},
url = {https://doi.org/10.1007/BF02579450},
doi = {10.1007/BF02579450},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Kano87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Levin87,
author = {Leonid A. Levin},
title = {One-way functions and pseudorandom generators},
journal = {Comb.},
volume = {7},
number = {4},
pages = {357--363},
year = {1987},
url = {https://doi.org/10.1007/BF02579323},
doi = {10.1007/BF02579323},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Levin87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Luks87,
author = {Eugene M. Luks},
title = {Computing the composition factors of a permutation group in polynomial
time},
journal = {Comb.},
volume = {7},
number = {1},
pages = {87--99},
year = {1987},
url = {https://doi.org/10.1007/BF02579204},
doi = {10.1007/BF02579204},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Luks87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Matula87,
author = {David W. Matula},
title = {Expose-and-merge exploration and the chromatic number of random graph},
journal = {Comb.},
volume = {7},
number = {3},
pages = {275--284},
year = {1987},
url = {https://doi.org/10.1007/BF02579304},
doi = {10.1007/BF02579304},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Matula87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Mulmuley87,
author = {Ketan Mulmuley},
title = {A fast parallel algorithm to compute the rank of a matrix over an
arbitrary field},
journal = {Comb.},
volume = {7},
number = {1},
pages = {101--104},
year = {1987},
url = {https://doi.org/10.1007/BF02579205},
doi = {10.1007/BF02579205},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Mulmuley87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/MulmuleyVV87,
author = {Ketan Mulmuley and
Umesh V. Vazirani and
Vijay V. Vazirani},
title = {Matching is as easy as matrix inversion},
journal = {Comb.},
volume = {7},
number = {1},
pages = {105--113},
year = {1987},
url = {https://doi.org/10.1007/BF02579206},
doi = {10.1007/BF02579206},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/MulmuleyVV87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Olson87,
author = {John E. Olson},
title = {A problem of Erd{\"{o}}s on Abelian groups},
journal = {Comb.},
volume = {7},
number = {3},
pages = {285--289},
year = {1987},
url = {https://doi.org/10.1007/BF02579305},
doi = {10.1007/BF02579305},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Olson87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/PromelR87,
author = {Hans J{\"{u}}rgen Pr{\"{o}}mel and
B. L. Rothschild},
title = {A canonical restricted version of van der Waerden's theorem},
journal = {Comb.},
volume = {7},
number = {1},
pages = {115--119},
year = {1987},
url = {https://doi.org/10.1007/BF02579207},
doi = {10.1007/BF02579207},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/PromelR87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/RaghavanT87,
author = {Prabhakar Raghavan and
Clark D. Thompson},
title = {Randomized rounding: a technique for provably good algorithms and
algorithmic proofs},
journal = {Comb.},
volume = {7},
number = {4},
pages = {365--374},
year = {1987},
url = {https://doi.org/10.1007/BF02579324},
doi = {10.1007/BF02579324},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/RaghavanT87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/SaneS87,
author = {Sharad S. Sane and
Mohan S. Shrikhande},
title = {Quasi-symmetric 2, 3. 4-designs},
journal = {Comb.},
volume = {7},
number = {3},
pages = {291--301},
year = {1987},
url = {https://doi.org/10.1007/BF02579306},
doi = {10.1007/BF02579306},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/SaneS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/ShamirS87,
author = {Eli Shamir and
Joel Spencer},
title = {Sharp concentration of the chromatic number on random graphs G\({}_{\mbox{n,
p}}\)},
journal = {Comb.},
volume = {7},
number = {1},
pages = {121--129},
year = {1987},
url = {https://doi.org/10.1007/BF02579208},
doi = {10.1007/BF02579208},
timestamp = {Tue, 01 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/ShamirS87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Sharir87,
author = {Micha Sharir},
title = {Almost linear upper bounds on the length of general Davenport-Schinzel
sequences},
journal = {Comb.},
volume = {7},
number = {1},
pages = {131--143},
year = {1987},
url = {https://doi.org/10.1007/BF02579209},
doi = {10.1007/BF02579209},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Sharir87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Stiebitz87,
author = {Michael Stiebitz},
title = {Subgraphs of color-critical graphs},
journal = {Comb.},
volume = {7},
number = {3},
pages = {303--312},
year = {1987},
url = {https://doi.org/10.1007/BF02579307},
doi = {10.1007/BF02579307},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Stiebitz87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Thomassen87,
author = {Carsten Thomassen},
title = {On digraphs with no two disjoint directed cycles},
journal = {Comb.},
volume = {7},
number = {1},
pages = {145--150},
year = {1987},
url = {https://doi.org/10.1007/BF02579210},
doi = {10.1007/BF02579210},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Thomassen87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/combinatorica/Vazirani87,
author = {Umesh V. Vazirani},
title = {Strong communication complexity or generating quasirandom sequences
form two communicating semi-random sources},
journal = {Comb.},
volume = {7},
number = {4},
pages = {375--392},
year = {1987},
url = {https://doi.org/10.1007/BF02579325},
doi = {10.1007/BF02579325},
timestamp = {Wed, 22 Jul 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/combinatorica/Vazirani87.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
retrieved on 2025-02-20 14:07 CET from data curated 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:
