 | 2007 |
| 13 |  | Tomasz Schoen:
Difference Covers.
Combinatorics, Probability & Computing 16(5): 775-787 (2007) |
| 2005 |
| 12 |  | Andreas Baltz,
Peter Hegarty,
Jonas Knape,
Urban Larsson,
Tomasz Schoen:
The Structure of Maximum Subsets of {1, ..., n} with No Solutions to a+b = kc.
Electr. J. Comb. 12: (2005) |
| 2002 |
| 11 |  | Noga Alon,
Benjamin Doerr,
Tomasz Luczak,
Tomasz Schoen:
On the discrepancy of combinatorial rectangles.
Random Struct. Algorithms 21(3-4): 205-215 (2002) |
| 2001 |
| 10 |  | Andreas Baltz,
Tomasz Schoen,
Anand Srivastav:
On the b-Partite Random Asymmetric Traveling Salesman Problem and Its Assignment Relaxation.
RANDOM-APPROX 2001: 192-201 |
| 9 |  | Geir Agnarsson,
Benjamin Doerr,
Tomasz Schoen:
Coloring t-dimensional m-Boxes.
Discrete Mathematics 226(1-3): 21-33 (2001) |
| 8 |  | Andreas Baltz,
Tomasz Schoen,
Anand Srivastav:
Pobabilistic Analysis of Bipartite Traveling Salesman Problems (Extended Abstract).
Electronic Notes in Discrete Mathematics 7: 42-45 (2001) |
| 7 |  | Tomasz Luczak,
Tomasz Schoen:
Sum-Free Subsets of Right Cancellative Semigroups.
Eur. J. Comb. 22(7): 999-1002 (2001) |
| 6 |  | Tomasz Schoen:
On a Problem of Erds and Sárközy.
J. Comb. Theory, Ser. A 94(1): 191-195 (2001) |
| 2000 |
| 5 |  | Tomasz Schoen:
A Note on the Number of (k, l)-Sum-Free Sets.
Electr. J. Comb. 7: (2000) |
| 1999 |
| 4 |  | Andreas Baltz,
Tomasz Schoen,
Anand Srivastav:
Probabilistic Construction of Small Strongly Sum-Free Sets via Large Sidon Sets.
RANDOM-APPROX 1999: 138-143 |
| 3 |  | Tomasz Schoen:
The Number of Monochromatic Schur Triples.
Eur. J. Comb. 20(8): 855-866 (1999) |
| 2 |  | Tomasz Schoen:
On Sets of Natural Numbers Whose Sumset is Free of Squares.
J. Comb. Theory, Ser. A 88(2): 385-388 (1999) |
| 1998 |
| 1 |  | Tomasz Luczak,
Vojtech Rödl,
Tomasz Schoen:
Independent finite sums in graphs defined on the natural numbers.
Discrete Mathematics 181(1-3): 289-294 (1998) |