Svante Linusson

According to our database1, Svante Linusson authored at least 30 papers between 1995 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
On the q-enumeration of barely set-valued tableaux and plane partitions.
Eur. J. Comb., October, 2023

Greedy Causal Discovery Is Geometric.
SIAM J. Discret. Math., March, 2023

2019
Reverse juggling processes.
Random Struct. Algorithms, 2019

Erratum to 'On Percolation and the Bunkbed Conjecture'.
Comb. Probab. Comput., 2019

The Cyclic Sieving Phenomenon on Circular Dyck Paths.
Electron. J. Comb., 2019

2018
Bumping sequences and multispecies juggling.
Adv. Appl. Math., 2018

2014
Dynamic adjustment: an electoral method for relaxed double proportionality.
Ann. Oper. Res., 2014

An inhomogeneous multispecies TASEP on a ring.
Adv. Appl. Math., 2014

2012
The Probability of the Alabama Paradox.
J. Appl. Probab., 2012

2011
Correlations for paths in random orientations of G(n, p) and G(n, m).
Random Struct. Algorithms, 2011

On Percolation and the Bunkbed Conjecture.
Comb. Probab. Comput., 2011

A Counter-Intuitive Correlation in a Random Tournament.
Comb. Probab. Comput., 2011

2010
Thomassen's Choosability Argument Revisited.
SIAM J. Discret. Math., 2010

2009
From Bruhat intervals to intersection lattices and a conjecture of Postnikov.
J. Comb. Theory, Ser. A, 2009

The k-assignment polytope.
Discret. Optim., 2009

2008
A regular decomposition of the edge-product space of phylogenetic trees.
Adv. Appl. Math., 2008

2007
Completing a (k - 1)-Assignment.
Comb. Probab. Comput., 2007

2003
Complexes of t-Colorable Graphs.
SIAM J. Discret. Math., 2003

2002
Extended pattern avoidance.
Discret. Math., 2002

Determining the Number of Solutions to Binary CSP Instances.
Proceedings of the Principles and Practice of Constraint Programming, 2002

2001
A Smaller Sleeping Bag for a Baby Snake.
Discret. Comput. Geom., 2001

2000
Doubly alternating Baxter permutations are Catalan.
Discret. Math., 2000

A Decomposition of Fl(<i>n</i>)<sup><i>d</i></sup> Indexed by Permutation Arrays.
Adv. Appl. Math., 2000

A Combinatorial Theory of Higher-Dimensional Permutation Arrays.
Adv. Appl. Math., 2000

1999
A Class of Lattices Whose Intervals are Spherical or Contractible.
Eur. J. Comb., 1999

A simple bijection for the regions of the Shi arrangement of hyperplanes.
Discret. Math., 1999

The Number of k -Faces of a Simple d -Polytope.
Discret. Comput. Geom., 1999

The Number of M-Sequences and f-Vectors.
Comb., 1999

1997
Partitions with Restricted Block Sizes, Möbius Functions, and the <i>k</i>-of-Each Problem.
SIAM J. Discret. Math., 1997

1995
The size of Fulton's essential set.
Electron. J. Comb., 1995


  Loading...