 | 2011 |
| 20 |  | Sven Erick Alm,
Svante Linusson:
A Counter-Intuitive Correlation in a Random Tournament.
Combinatorics, Probability & Computing 20(1): 1-9 (2011) |
| 19 |  | Svante Linusson:
On Percolation and the Bunkbed Conjecture.
Combinatorics, Probability & Computing 20(1): 103-117 (2011) |
| 18 |  | Sven Erick Alm,
Svante Janson,
Svante Linusson:
Correlations for paths in random orientations of G(n, p) and G(n, m).
Random Struct. Algorithms 39(4): 486-506 (2011) |
| 2010 |
| 17 |  | David R. Wood,
Svante Linusson:
Thomassen's Choosability Argument Revisited.
SIAM J. Discrete Math. 24(4): 1632-1637 (2010) |
| 2009 |
| 16 |  | Jonna Gill,
Svante Linusson:
The k-assignment polytope.
Discrete Optimization 6(2): 148-161 (2009) |
| 15 |  | Axel Hultman,
Svante Linusson,
John Shareshian,
Jonas Sjöstrand:
From Bruhat intervals to intersection lattices and a conjecture of Postnikov.
J. Comb. Theory, Ser. A 116(3): 564-580 (2009) |
| 2007 |
| 14 |  | Svante Linusson,
Johan Wästlund:
Completing a (k - 1)-Assignment.
Combinatorics, Probability & Computing 16(4): 621-629 (2007) |
| 13 |  | Johan Håstad,
Svante Linusson,
Johan Wästlund:
A Smaller Sleeping Bag for a Baby Snake.
Discrete & Computational Geometry 38(1): 171 (2007) |
| 12 |  | Anders Björner,
Svante Linusson:
The Number of k-Faces of a Simple d-Polytope.
Discrete & Computational Geometry 38(1): 172 (2007) |
| 2003 |
| 11 |  | Svante Linusson,
John Shareshian:
Complexes of t-Colorable Graphs.
SIAM J. Discrete Math. 16(3): 371-389 (2003) |
| 2002 |
| 10 |  | Ola Angelsmark,
Peter Jonsson,
Svante Linusson,
Johan Thapper:
Determining the Number of Solutions to Binary CSP Instances.
CP 2002: 327-340 |
| 9 |  | Svante Linusson:
Extended pattern avoidance.
Discrete Mathematics 246(1-3): 219-230 (2002) |
| 2001 |
| 8 |  | Johan Håstad,
Svante Linusson,
Johan Wästlund:
A Smaller Sleeping Bag for a Baby Snake.
Discrete & Computational Geometry 26(1): 173-181 (2001) |
| 2000 |
| 7 |  | Olivier Guibert,
Svante Linusson:
Doubly alternating Baxter permutations are Catalan.
Discrete Mathematics 217(1-3): 157-166 (2000) |
| 1999 |
| 6 |  | Svante Linusson:
The Number of M-Sequences and f-Vectors.
Combinatorica 19(2): 255-266 (1999) |
| 5 |  | Anders Björner,
Svante Linusson:
The Number of k -Faces of a Simple d -Polytope.
Discrete & Computational Geometry 21(1): 1-16 (1999) |
| 4 |  | Christos A. Athanasiadis,
Svante Linusson:
A simple bijection for the regions of the Shi arrangement of hyperplanes.
Discrete Mathematics 204(1-3): 27-39 (1999) |
| 3 |  | Svante Linusson:
A Class of Lattices Whose Intervals are Spherical or Contractible.
Eur. J. Comb. 20(3): 239-257 (1999) |
| 1997 |
| 2 |  | Svante Linusson:
Partitions with Restricted Block Sizes, Möbius Functions, and the k-of-Each Problem.
SIAM J. Discrete Math. 10(1): 18-29 (1997) |
| 1995 |
| 1 |  | Kimmo Eriksson,
Svante Linusson:
The size of Fulton's essential set.
Electr. J. Comb. 2: (1995) |