Result 1 to 20 from 756 total
Token graphs. (English)
Graphs Comb. 28, No. 3, 365-380 (2012).
1
On the connectivity of visibility graphs. (English)
Discrete Comput. Geom. 48, No. 3, 669-681 (2012).
2
Small minors in dense graphs. (English)
Eur. J. Comb. 33, No. 6, 1226-1245 (2012).
3
Nordhaus-Gaddum for treewidth. (English)
Eur. J. Comb. 33, No. 4, 488-490 (2012).
4
Polynomial treewidth forces a large grid-like-minor. (English)
Eur. J. Comb. 33, No. 3, 374-379 (2012).
5
Characterisations and examples of graph classes with bounded expansion. (English)
Eur. J. Comb. 33, No. 3, 350-373 (2012).
6
Clique minors in Cartesian products of graphs. (English)
New York J. Math. 17, 627-682 (2011).
7
Disproof of the list Hadwiger conjecture. (English)
Electron. J. Comb. 18, No. 1, Research Paper P232, 7 p., electronic only (2011).
8
io-port 05999816 Abel, Zachary;
Ballinger, Brad;
Bose, Prosenjit;
Collette, Sébastien;
Dujmović, Vida;
Hurtado, Ferran;
Kominers, Scott Duke;
Langerman, Stefan;
Pór, Attila;
Wood, David R.
Every large point set contains many collinear points or an empty pentagon. (English)
Graphs Comb. 27, No. 1, 47-60 (2011).
9
On the maximum number of cliques in a graph embedded in a surface. (English)
Eur. J. Comb. 32, No. 8, 1244-1252 (2011).
10
The chromatic number of the convex segment disjointness graph. (English)
Comput. Res. Repos. 2011, Article No. 1105.4931 (2011).
11
Treewidth of Cartesian products of highly connected graphs. (English)
Comput. Res. Repos. 2011, Article No. 1105.1586 (2011).
12
On the number of maximal independent sets in a graph. (English)
Comput. Res. Repos. 2011, Article No. 1104.1243 (2011).
13
Arachnoserver 2.0, an updated online resource for spider toxin sequences and structures. (English)
Nucleic Acids Res. 39, No. Database-Issue, 653-657 (2011).
14
X-MATE: a flexible system for mapping short read data. (English)
Bioinformatics 27, No. 4, 580-581 (2011).
15
On the book thickness of k-trees (English)
Discrete Mathematics & Theoretical Computer Science 13, No. 3, 39-44 (2011).
16
Colouring the square of the Cartesian product of trees (English)
Discrete Mathematics & Theoretical Computer Science 13, No. 2, 109-112 (2011).
17
On the number of maximal independent sets in a graph (English)
Discrete Mathematics & Theoretical Computer Science 13, No. 3, 17-20 (2011).
18
io-port 50125267 Binkert, Nathan L.;
Beckmann, Bradford M.;
Black, Gabriel;
Reinhardt, Steven K.;
Saidi, Ali G.;
Basu, Arkaprava;
Hestness, Joel;
Hower, Derek;
Krishna, Tushar;
Sardashti, Somayeh;
Sen, Rathijit;
Sewell, Korey;
Shoaib, Muhammad;
Vaish, Nilay;
Hill, Mark D.;
Wood, David A.
The gem5 simulator (English)
SIGARCH Computer Architecture News 39, No. 2, 1-7 (2011).
19
On the maximum number of cliques in a graph embedded in a surface (English)
Eur. J. Comb. 32, No. 8, 1244-1252 (2011).
20
Result 1 to 20 from 756 total
Start
Contact
Print
General Help
