default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCombinatorics, Probability & Computing, Volume 14, 2005
Volume 14, Number 1-2, Januar 2005
- Hans Jürgen Prömel:
Special Issue in Memory of Walter Deuber. 1 - Hans Jürgen Prömel:
Complete Disorder is Impossible: The Mathematical Work of Walter Deuber. 3-16 - Martin Aigner:
The $k$-Equal Problem. 17-24 - Jens-P. Bode, Hans-Dietrich O. F. Gronau, Heiko Harborth:
Some Ramsey Schur Numbers. 25-30 - Michel Deza, Mathieu Dutour:
Zigzag Structures of Simple Two-Faced Polyhedra. 31-57 - Reinhard Diestel:
The Cycle Space of an Infinite Graph. 59-79 - Gábor Elek, Vera T. Sós:
Paradoxical Decompositions and Growth Conditions. 81-105 - Mike Ferrara, Yoshiharu Kohayakawa
, Vojtech Rödl:
Distance Graphs on the Integers. 107-131 - Matthias Kriesell:
Triangle Density and Contractibility. 133-146 - Hanno Lefmann:
Sparse Parity-Check Matrices over ${GF(q)}$. 147-169 - Jaroslav Nesetril:
Ramsey Classes and Homogeneous Structures. 171-189 - Jens Schlaghoff, Eberhard Triesch:
Improved Results for Competitive Group Testing. 191-202 - Ernst Specker:
Modular Counting and Substitution of Structures. 203-210 - Angelika Steger:
On the Evolution of Triangle-Free Graphs. 211-224 - Ingo Wegener, Carsten Witt:
On the Optimization of Monotone Polynomials by Simple Randomized Search Heuristics. 225-247
Volume 14, Number 3, Mai 2005
- Mindaugas Bloznelis:
Orthogonal Decomposition of Symmetric Functions Defined on Random Permutations. 249-268 - Onn Chan, Tao-Kai Lam:
Lifting Markov Chains to Random Walks on Groups. 269-273 - Keith Edwards:
Detachments of Complete Graphs. 275-310 - Peter L. Hammer, Igor E. Zverovich:
Construction of a Maximum Stable Set with $k$-Extensions. 311-318 - Norbert Hegyvári:
On Intersecting Properties of Partitions of Integers. 319-323 - Daniela Kühn, Deryk Osthus:
Packings in Dense Regular Graphs. 325-337 - Tamás F. Móri:
The Maximum Degree of the Barabasi-Albert Random Tree. 339-348 - Vladimir Nikiforov:
The Cycle-Complete Graph Ramsey Numbers. 349-370 - Yuejian Peng, Vojtech Rödl, Jozef Skokan:
Counting Small Cliques in 3-uniform Hypergraphs. 371-413 - Wolfgang Woess:
Lamplighters, Diestel-Leader Graphs, Random Walks, and Harmonic Functions. 415-433
- Zoltán Füredi, András Gyárfás, Gábor Simonyi:
Connected matchings and Hadwiger's conjecture. 435-438
Volume 14, Number 4, Juli 2005
- Amin Coja-Oghlan:
The Lovász Number of Random Graphs. 439-465 - Zoltán Füredi, Miklós Simonovits:
Triple Systems Not Containing a Fano Configuration. 467-484 - Yahya Ould Hamidoune, Domingo Quiroz:
On Subsequence Weighted Products. 485-489 - Russell Lyons:
Asymptotic Enumeration of Spanning Trees. 491-522 - Neal Madras, C. Chris Wu:
Self-Avoiding Walks on Hyperbolic Graphs. 523-548 - William D. May, John C. Wierman:
Using Symmetry to Improve Percolation Threshold Bounds. 549-566 - Dillon Mayhew:
Inequivalent Representations of Bias Matroids. 567-583 - Vojtech Rödl, Lubos Thoma:
On Cover Graphs and Dependent Arcs in Acyclic Orientations. 585-617
- Jeffrey E. Steif:
Probability on Discrete Structures, edited by H. Kesten. 619-623 - Peter McMullen:
Convex Polytopes, by Branko Grunbaum, second edition (first edition (1967) written with the cooperation of V. L. Klee, M. Perles and G. C. Shephard. 623-626
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-12-23 19:37 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:
