Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorica, Volume 35
Volume 35, Number 1, February 2015
- Bartlomiej Bosek
, Tomasz Krawczyk:
A subexponential upper bound for the on-line chain partitioning problem. 1-38 - Adrian Dumitrescu, Csaba D. Tóth:
Packing anchored rectangles. 39-61 - Gábor Korchmáros, Gábor Péter Nagy, Nicola Pace:
k-nets embedded in a projective plane over a field. 63-74 - Asaf Shapira, Benny Sudakov:
Small complete minors above the extremal edge density. 75-94 - Csaba D. Tóth:
The Szemerédi-Trotter theorem in the complex plane. 95-126
Volume 35, Number 2, April 2015
- Miklós Abért, Tamás Hubai:
Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs. 127-151 - Nathan J. Bowler, Johannes Carmesin:
Matroid intersection, base packing and base covering for infinite matroids. 153-180 - Bart De Bruyn, Frédéric Vanhove:
On Q-polynomial regular near 2d-gons. 181-208 - Jim Geelen, Peter Nelson:
An analogue of the Erdős-Stone theorem for finite geometries. 209-214 - Assaf Rinot:
Chromatic numbers of graphs - large gaps. 215-233 - Pablo Soberón:
Equal coefficients and tolerance in coloured Tverberg partitions. 235-252
Volume 35, Number 3, April 2015
- Nikhil Bansal, Rudi Pendavingh, Jorn G. van der Pol:
On the number of matroids. 253-277 - Geoffrey R. Grimmett, Zhongyang Li:
Bounds on connective constants of regular graphs. 279-294 - Alex Iosevich, Misha Rudnev, Yujia Zhai:
Areas of triangles and Beck's theorem in planes over finite fields. 295-308 - Richard J. Martin, Michael J. Kearney:
Integral representation of certain combinatorial recurrences. 309-315 - Elchanan Mossel, Miklós Z. Rácz:
A quantitative Gibbard-Satterthwaite theorem without neutrality. 317-387
Volume 35, Number 4, August 2015
- Maria Chudnovsky, Paul D. Seymour:
Excluding paths and antipaths. 389-412 - Tao Feng, Koji Momihara, Qing Xiang:
Constructions of strongly regular Cayley graphs and skew Hadamard difference sets from cyclotomic classes. 413-434 - Jacob Fox, Po-Shen Loh, Yufei Zhao:
The critical window for the classical Ramsey-Turán problem. 435-476 - Ken-ichi Kawarabayashi, Yusuke Kobayashi:
The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs. 477-495 - Hal A. Kierstead, Alexandr V. Kostochka:
A refinement of a result of Corrádi and Hajnal. 497-512
Volume 35, Number 5, October 2015
- Cesar Ceballos, Francisco Santos, Günter M. Ziegler:
Many non-equivalent realizations of the associahedron. 513-551 - Matt DeVos, Bojan Mohar, Robert Sámal:
Highly arc-transitive digraphs - Structure and counterexamples. 553-571 - David Ellis, Yuval Filmus, Ehud Friedgut:
A quasi-stability result for dictatorships in S n. 573-618 - Richard Hoshino, Ken-ichi Kawarabayashi:
The edge density of critical digraphs. 619-631 - Eckhard Steffen:
Intersecting 1-factors and nowhere-zero 5-flows. 633-640
Volume 35, Number 6, December 2015
- Funda Ergün, Hossein Jowhari:
On the monotonicity of a data stream. 641-653 - Ebrahim Ghorbani, Ali Mohammadian, Behruz Tayfeh-Rezaie:
On order and rank of graphs. 655-668 - R. Bruce Richter, Brendan Rooney:
Embedding a graph-like continuum in a surface. 669-694 - Tomasz Schoen:
New bounds in Balog-Szemerédi-Gowers theorem. 695-701 - Emanuele Viola:
The communication complexity of addition. 703-747
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-05-10 00:42 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:
