Result 1 to 20 of 122 total
Graph bootstrap percolation. (English)
Random Struct. Algorithms 41, No. 4, 413-440 (2012).
1
Some exact Ramsey-Turán numbers. (English)
Bull. Lond. Math. Soc. 44, No. 6, 1251-1258 (2012).
2
Almost all triangle-free triple systems are tripartite. (English)
Combinatorica 32, No. 2, 143-169 (2012).
3
On a multidimensional semi-on-line bin packing problem. (English)
Egri-Nagy, Attila (ed.) et al., Proceedings of the 8th international conference on applied informatics (ICAI 2010), Eger, Hungary, January 27‒30, 2010. 2 Volumes. Eger: BVB Nyomda és Kiadó Kft. (ISBN 978-963-9894-72-3/pbk). 191-197 (2012).
4
A flexible system for optimizing public transportation. (English)
Egri-Nagy, Attila (ed.) et al., Proceedings of the 8th international conference on applied informatics (ICAI 2010), Eger, Hungary, January 27‒30, 2010. 2 Volumes. Eger: BVB Nyomda és Kiadó Kft. (ISBN 978-963-9894-72-3/pbk). 181-190 (2012).
5
New lower bounds for certain classes of bin packing algorithms. (English)
Theor. Comput. Sci. 440-441, 1-13 (2012).
6
The positive minimum degree game on sparse graphs. (English)
Electron. J. Comb. 19, No. 1, Research Paper P22, 7 p., electronic only (2012).
7
Linear algebra and bootstrap percolation. (English)
J. Comb. Theory, Ser. A 119, No. 6, 1328-1335 (2012).
8
Corrádi and Hajnal’s theorem for sparse random graphs. (English)
Comb. Probab. Comput. 21, No. 1-2, 23-55 (2012).
9
Complete minors, independent sets, and chordal graphs. (English)
Discuss. Math., Graph Theory 31, No. 4, 639-674 (2011).
10
The number of $K_{m,m}$-free graphs. (English)
Combinatorica 31, No. 2, 131-150 (2011).
11
Large minors in graphs with given independence number. (English)
Discrete Math. 311, No. 20, 2203-2215 (2011).
12
Hamilton cycles in random geometric graphs. (English)
Ann. Appl. Probab. 21, No. 3, 1053-1072 (2011).
13
On the Chvàtal-Erdős triangle game. (English)
Electron. J. Comb. 18, No. 1, Research Paper P72, 15 p., electronic only (2011).
14
Almost all triple systems with independent neighborhoods are semi-bipartite. (English)
J. Comb. Theory, Ser. A 118, No. 4, 1494-1518 (2011).
15
The number of $K_{s,t}$-free graphs. (English)
J. Lond. Math. Soc., II. Ser. 83, No. 2, 368-388 (2011).
16
The structure of almost all graphs in a hereditary property. (English)
J. Comb. Theory, Ser. B 101, No. 2, 85-110 (2011).
17
The fine structure of octahedron-free graphs. (English)
J. Comb. Theory, Ser. B 101, No. 2, 67-84 (2011).
18
New lower bounds for certain classes of bin packing algorithms. (English)
Jansen, Klaus (ed.) et al., Approximation and online algorithms. 8th international workshop, WAOA 2010, Liverpool, UK, September 9‒10, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-18317-1/pbk). Lecture Notes in Computer Science 6534, 25-36 (2011).
19
Local resilience of almost spanning trees in random graphs. (English)
Random Struct. Algorithms 38, No. 1-2, 121-139 (2011).
20
Result 1 to 20 of 122 total
Start
Contact
Print
General Help
