Publications (22)
Coalitional Manipulation for Schulze's Rule
Serge Gaspers, Thomas Kalinowski, Nina Narodytska +1
Minimum rank and zero forcing number for butterfly networks
Daniela Ferrero, Cyriac Grigorious, Thomas Kalinowski +2
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions
Natashia Boland, Santanu S. Dey, Thomas Kalinowski +2
$H$-supermagic labelings for firecrackers, banana trees and flowers
Rachel Wulan Nirmalasari Wijaya, Andrea SemaniÄová-FeÅovÄÃková, Joe Ryan +1
Incremental Network Design with Minimum Spanning Trees
Konrad Engel, Thomas Kalinowski, Martin W. P. Savelsbergh
Scheduling Network Maintenance Jobs with Release Dates and Deadlines to Maximize Total Flow Over Time: Bounds and Solution Strategies
Natashia Boland, Thomas Kalinowski, Simranjit Kaur
The metric dimension of the circulant graph $C(n,\pm\{1,2,3,4\})$
Cyriac Grigorious, Thomas Kalinowski, Joe Ryan +1
Maximal antichains of minimum size
Thomas Kalinowski, Uwe Leck, Ian T. Roberts
A polynomially solvable case of the pooling problem
Natashia Boland, Thomas Kalinowski, Fabian Rigterink
Minimizing the regularity of maximal regular antichains of 2- and 3-sets
Thomas Kalinowski, Uwe Leck, Christian Reiher +1
A reclaimer scheduling problem arising in coal stockyard management
Enrico Angelelli, Thomas Kalinowski, Reena Kapoor +1
A Social Welfare Optimal Sequential Allocation Procedure
Thomas Kalinowski, Nina Nardoytska, Toby Walsh
A lower bound on the zero forcing number
Randy Davila, Thomas Kalinowski, Sudeep Stephen
Cube-magic labelings of grids
Rachel Wulan Nirmalasari Wijaya, Joe Ryan, Thomas Kalinowski
Tight MIP formulations for bounded length cyclic sequences
Thomas Kalinowski, Tomas Lidén, Hamish Waterer
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period
Natashia Boland, Thomas Kalinowski, Simranjit Kaur
Zero forcing number of graphs
Thomas Kalinowski, Nina KamÄev, Benny Sudakov
Incremental Network Design with Maximum Flows
Thomas Kalinowski, Dmytro Matsypura, Martin W. P. Savelsbergh
Scheduling unit processing time arc shutdown jobs to maximize network flow over time: complexity results
Natashia Boland, Thomas Kalinowski, Reena Kapoor +1
On the power domination number of de Bruijn and Kautz digraphs
Cyriac Grigorious, Thomas Kalinowski, Joe Ryan +1
Zero forcing in iterated line digraphs
Daniela Ferrero, Thomas Kalinowski, Sudeep Stephen
Welfare of Sequential Allocation Mechanisms for Indivisible Goods
Haris Aziz, Thomas Kalinowski, Toby Walsh +1