6 citations · 8 across the 7 of their papers we have counts for
7 papers
Moment generating functions in combinatorial optimization: Bipartite matching
Johan Wästlund
In a random model of minimum cost bipartite matching based on exponentially distributed edge costs, we show that the distribution of the cost of the optimal solution can be compute…
Minimal matchings of point processes
Alexander E. Holroyd, Svante Janson, Johan Wästlund
Suppose that red and blue points form independent homogeneous Poisson processes of equal intensity in . For a positive (respectively, negative) parameter we consider red-b…
Maharaja Nim, Wythoff's Queen meets the Knight
Urban Larsson, Johan Wästlund
New combinatorial games are introduced, of which the most pertinent is Maharaja Nim. The rules extend those of the well-known impartial game of Wythoff Nim in which two players tak…
When only the last one will do
Johan Wästlund
An unknown positive number of items arrive at independent uniformly distributed times in the interval [0,1] to a selector, whose task is to pick online the last one. We show that u…
Enumeration of derangements with descents in prescribed positions
Niklas Eriksen, Ragnar Freij, Johan Wastlund
We enumerate derangements with descents in prescribed positions. A generating function was given by Guo-Niu Han and Guoce Xin in 2007. We give a combinatorial proof of this result,…
Completing a k-1 assignment
Svante Linusson, Johan Waestlund
We consider the distribution of the value of the optimal k-assignment in an m x n-matrix, where the entries are independent exponential random variables with arbitrary rates. We gi…