44 citations · 50 across the 3 of their papers we have counts for
4 papers
Zero forcing number of graphs
Thomas Kalinowski, Nina Kamčev, Benny Sudakov
A subset of initially infected vertices of a graph is called forcing if we can infect the entire graph by iteratively applying the following process. At each step, any infe…
Cube-magic labelings of grids
Rachel Wulan Nirmalasari Wijaya, Joe Ryan, Thomas Kalinowski
We show that the vertices and edges of a -dimensional grid graph () can be labeled with the integers from and $\{1,\ldots,\…
A Social Welfare Optimal Sequential Allocation Procedure
Thomas Kalinowski, Nina Nardoytska, Toby Walsh
We consider a simple sequential allocation procedure for sharing indivisible items between agents in which agents take turns to pick items. Supposing additive utilities and indepen…
Coalitional Manipulation for Schulze's Rule
Serge Gaspers, Thomas Kalinowski, Nina Narodytska +1
Schulze's rule is used in the elections of a large number of organizations including Wikimedia and Debian. Part of the reason for its popularity is the large number of axiomatic pr…