| |
| 2009 | ||
|---|---|---|
| 6 | EE | Mark H. Siggers: Dichotomy for bounded degree H-colouring. Discrete Applied Mathematics 157(2): 201-210 (2009) |
| 2008 | ||
| 5 | EE | Mark H. Siggers: On highly ramsey infinite graphs. Journal of Graph Theory 59(2): 97-114 (2008) |
| 4 | EE | Vojtech Rödl, Mark H. Siggers: On Ramsey Minimal Graphs. SIAM J. Discrete Math. 22(2): 467-488 (2008) |
| 2007 | ||
| 3 | EE | Jaroslav Nesetril, Mark H. Siggers: Combinatorial Proof that Subprojective Constraint Satisfaction Problems are NP-Complete. MFCS 2007: 159-170 |
| 2 | EE | Vojtech Rödl, Mathias Schacht, Mark H. Siggers, Norihide Tokushige: Integer and fractional packings of hypergraphs. J. Comb. Theory, Ser. B 97(2): 245-268 (2007) |
| 2006 | ||
| 1 | EE | Vojtech Rödl, Mark H. Siggers: Color critical hypergraphs with many edges. Journal of Graph Theory 53(1): 56-74 (2006) |
| 1 | Jaroslav Nesetril (Jarik Nesetril) | [3] |
| 2 | Vojtech Rödl | [1] [2] [4] |
| 3 | Mathias Schacht | [2] |
| 4 | Norihide Tokushige | [2] |