Result 1 to 20 of 302 total
Connectivity for Bridge-addable monotone graph classes. (English)
Comb. Probab. Comput. 21, No. 6, 803-815 (2012).
1
Griggs and Yeh’s conjecture and $L(p,1)$-labelings. (English)
SIAM J. Discrete Math. 26, No. 1, 145-168 (2012).
2
Polynomial-time recognition of clique-width $\leq 3$ graphs. (English)
Discrete Appl. Math. 160, No. 6, 834-865 (2012).
3
The disjoint paths problem in quadratic time. (English)
J. Comb. Theory, Ser. B 102, No. 2, 424-435 (2012).
4
Polynomial treewidth forces a large grid-like-minor. (English)
Eur. J. Comb. 33, No. 3, 374-379 (2012).
5
Asymptotics of the chromatic number for quasi-line graphs. (English)
Comput. Res. Repos. 2011, Article No. 1102.0805 (2011).
6
The edge-density for $K_{2,t}$ minors. (English)
J. Comb. Theory, Ser. B 101, No. 1, 18-46 (2011).
7
The edge-density for $K_{2, t}$ minors (English)
J. Comb. Theory, Ser. B 101, No. 1, 18-46 (2011).
8
Inspector gadget: A framework for custom monitoring and debugging of distributed dataflows (English)
PVLDB 4, No. 12, 1237-1248 (2011).
9
Graph coloring via the probabilistic method (English)
SODA, 184-184 (2011).
10
Zab: high-performance broadcast for primary-backup systems (English)
DSN, 245-256 (2011).
11
Vertical glider robots for subsea equipment delivery (English)
ICRA, 2356-2361 (2011).
12
Inspector gadget: a framework for custom monitoring and debugging of distributed dataflows (English)
SIGMOD Conference, 1221-1224 (2011).
13
Chaotic scrambling for wireless analog video. (English)
Commun. Nonlinear Sci. Numer. Simul. 15, No. 9, 2504-2513 (2010).
14
Almost all $H$-free graphs have the Erdős-Hajnal property. (English)
Bárány, Imre (ed.) et al., An irregular mind. Szemerédi is 70. Dedicated to Endre Szemerédi on the occasion of his seventieth birthday. Berlin: Springer (ISBN 978-3-642-14443-1/pbk). Bolyai Society Mathematical Studies 21, 405-414 (2010).
15
Finding a maximum-weight induced $k$-partite subgraph of an $i$-triangulated graph. (English)
Discrete Appl. Math. 158, No. 7, 765-770 (2010).
16
Corrigendum to “Asymptotically optimal frugal colouring” [J. Comb. Theory, Ser. B 100, No. 2, 226‒246 (2010)]. (English)
J. Comb. Theory, Ser. B 100, No. 2, 247-249 (2010).
17
Asymptotically optimal frugal colouring. (English)
J. Comb. Theory, Ser. B 100, No. 2, 226-246 (2010).
18
Asymptotically optimal frugal colouring (English)
J. Comb. Theory, Ser. B 100, No. 2, 226-246 (2010).
19
Corrigendum to "asymptotically optimal frugal colouring" [J. Combin. theory ser. B 100 (2) (2010) 226-246] (English)
J. Comb. Theory, Ser. B 100, No. 2, 247-249 (2010).
20
Result 1 to 20 of 302 total
Start
Contact
Print
General Help
