default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSvante Linusson
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j32]Sam Hopkins, Alexander Lazar
, Svante Linusson:
On the q-enumeration of barely set-valued tableaux and plane partitions. Eur. J. Comb. 113: 103760 (2023)- [j31]Svante Linusson, Petter Restadh, Liam Solus:
Greedy Causal Discovery Is Geometric. SIAM J. Discret. Math. 37(1): 233-252 (2023) - 2021
- [j30]Per Alexandersson, Svante Linusson, Samu Potka, Joakim Uhlin:
Refined Catalan and Narayana cyclic sieving. Comb. Theory 1(0) (2021)
2010 – 2019
- 2019
- [j29]Per Alexandersson, Svante Linusson, Samu Potka:
The Cyclic Sieving Phenomenon on Circular Dyck Paths. Electron. J. Comb. 26(4): 4 (2019) - [j28]Svante Linusson:
Erratum to 'On Percolation and the Bunkbed Conjecture'. Comb. Probab. Comput. 28(6): 917-918 (2019) - [j27]Arvind Ayyer, Svante Linusson:
Reverse juggling processes. Random Struct. Algorithms 55(1): 56-72 (2019) - 2018
- [j26]Arvind Ayyer, Jérémie Bouttier, Sylvie Corteel, Svante Linusson, François Nunzi:
Bumping sequences and multispecies juggling. Adv. Appl. Math. 98: 100-126 (2018) - 2014
- [j25]Arvind Ayyer, Svante Linusson:
An inhomogeneous multispecies TASEP on a ring. Adv. Appl. Math. 57: 21-43 (2014) - [j24]Svante Linusson, Gustav Ryd:
Dynamic adjustment: an electoral method for relaxed double proportionality. Ann. Oper. Res. 215(1): 183-199 (2014) - 2013
- [i2]Svante Linusson, Gustav Ryd:
Dynamic adjustment: an electoral method for relaxed double proportionality. CoRR abs/1310.8146 (2013) - 2012
- [j23]Svante Janson, Svante Linusson:
The Probability of the Alabama Paradox. J. Appl. Probab. 49(3): 773-794 (2012) - 2011
- [j22]Sven Erick Alm, Svante Linusson:
A Counter-Intuitive Correlation in a Random Tournament. Comb. Probab. Comput. 20(1): 1-9 (2011) - [j21]Svante Linusson:
On Percolation and the Bunkbed Conjecture. Comb. Probab. Comput. 20(1): 103-117 (2011) - [j20]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
- [j19]David R. Wood, Svante Linusson:
Thomassen's Choosability Argument Revisited. SIAM J. Discret. Math. 24(4): 1632-1637 (2010) - [i1]David R. Wood, Svante Linusson:
Thomassen's Choosability Argument Revisited. CoRR abs/1005.5194 (2010)
2000 – 2009
- 2009
- [j18]Jonna Gill, Svante Linusson:
The k-assignment polytope. Discret. Optim. 6(2): 148-161 (2009) - [j17]Axel Hultman, Svante Linusson, John Shareshian, Jonas Sjöstrand:
From Bruhat intervals to intersection lattices and a conjecture of Postnikov. J. Comb. Theory A 116(3): 564-580 (2009) - 2008
- [j16]Jonna Gill, Svante Linusson, Vincent Moulton, Mike A. Steel:
A regular decomposition of the edge-product space of phylogenetic trees. Adv. Appl. Math. 41(2): 158-176 (2008) - 2007
- [j15]Svante Linusson, Johan Wästlund:
Completing a (k - 1)-Assignment. Comb. Probab. Comput. 16(4): 621-629 (2007) - [j14]Johan Håstad, Svante Linusson, Johan Wästlund:
A Smaller Sleeping Bag for a Baby Snake. Discret. Comput. Geom. 38(1): 171 (2007) - [j13]Anders Björner, Svante Linusson:
The Number of k-Faces of a Simple d-Polytope. Discret. Comput. Geom. 38(1): 172 (2007) - 2003
- [j12]Svante Linusson, John Shareshian:
Complexes of t-Colorable Graphs. SIAM J. Discret. Math. 16(3): 371-389 (2003) - 2002
- [j11]Svante Linusson:
Extended pattern avoidance. Discret. Math. 246(1-3): 219-230 (2002) - [c1]Ola Angelsmark, Peter Jonsson, Svante Linusson, Johan Thapper:
Determining the Number of Solutions to Binary CSP Instances. CP 2002: 327-340 - 2001
- [j10]Johan Håstad, Svante Linusson, Johan Wästlund:
A Smaller Sleeping Bag for a Baby Snake. Discret. Comput. Geom. 26(1): 173-181 (2001) - 2000
- [j9]Kimmo Eriksson, Svante Linusson:
A Combinatorial Theory of Higher-Dimensional Permutation Arrays. Adv. Appl. Math. 25(2): 194-211 (2000) - [j8]Kimmo Eriksson, Svante Linusson:
A Decomposition of Fl(n)d Indexed by Permutation Arrays. Adv. Appl. Math. 25(2): 212-227 (2000) - [j7]Olivier Guibert, Svante Linusson:
Doubly alternating Baxter permutations are Catalan. Discret. Math. 217(1-3): 157-166 (2000)
1990 – 1999
- 1999
- [j6]Svante Linusson:
The Number of M-Sequences and f-Vectors. Comb. 19(2): 255-266 (1999) - [j5]Anders Björner, Svante Linusson:
The Number of k -Faces of a Simple d -Polytope. Discret. Comput. Geom. 21(1): 1-16 (1999) - [j4]Christos A. Athanasiadis, Svante Linusson:
A simple bijection for the regions of the Shi arrangement of hyperplanes. Discret. Math. 204(1-3): 27-39 (1999) - [j3]Svante Linusson:
A Class of Lattices Whose Intervals are Spherical or Contractible. Eur. J. Comb. 20(3): 239-257 (1999) - 1997
- [j2]Svante Linusson:
Partitions with Restricted Block Sizes, Möbius Functions, and the k-of-Each Problem. SIAM J. Discret. Math. 10(1): 18-29 (1997) - 1995
- [j1]Kimmo Eriksson, Svante Linusson:
The size of Fulton's essential set. Electron. J. Comb. 2 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-26 21:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
