Thomas Kalinowski

Publication Activity (10 Years)

Years Active: 2005-2024
Publications (10 Years): 43

Top Topics

Minimum Spanning Trees

Polynomially Solvable

Top Venues

Discret. Appl. Math.

J. Comb. Optim.

Comput. Oper. Res.

Publications

Thomas Kalinowski, Uwe Leck
Independent domination in the graph defined by two consecutive levels of the n-cube. Discret. Appl. Math. 357 (2024)
Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck, Ian T. Roberts, Michael Schmitz
Sizes of flat maximal antichains of subsets. CoRR (2023)
Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck, Ian T. Roberts, Michael Schmitz
The Saturation Spectrum for Antichains of Subsets. Order 40 (3) (2023)
Thomas Kalinowski, Sogol Mohammadian
Feasible Bases for a Polytope Related to the Hamilton Cycle Problem. Math. Oper. Res. 46 (4) (2021)
Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck, Ian T. Roberts, Michael Schmitz
Maximal antichains of subsets II: Constructions. CoRR (2021)
Jerrold R. Griggs, Sven Hartmann, Thomas Kalinowski, Uwe Leck, Ian T. Roberts
Minimum Weight Flat Antichains of Subsets. Order 38 (3) (2021)
Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck, Ian T. Roberts, Michael Schmitz
Maximal antichains of subsets I: The shadow spectrum. CoRR (2021)
R. Sundara Rajan, Thomas Kalinowski, Sandi Klavzar, Hamid Mokhtar, T. M. Rajalaxmi
Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes. J. Supercomput. 77 (4) (2021)
Akshay Gupte, Thomas Kalinowski, Fabian Rigterink, Hamish Waterer
Extended formulations for convex hulls of some bilinear functions. Discret. Optim. 36 (2020)
Mitchell Harris, Thomas Kalinowski
Convex Hulls for Graphs of Quadratic Functions With Unit Coefficients: Even Wheels and Complete Split Graphs. CoRR (2020)
Ali Eshragh, Jerzy A. Filar, Thomas Kalinowski, Sogol Mohammadian
Hamiltonian Cycles and Subsets of Discounted Occupational Measures. Math. Oper. Res. 45 (2) (2020)
Thomas Kalinowski, Jason Matthews, Hamish Waterer
Scheduling of maintenance windows in a mining supply chain rail network. Comput. Oper. Res. 115 (2020)
Daniela Ferrero, Cyriac Grigorious, Thomas Kalinowski, Joe Ryan, Sudeep Stephen
Minimum rank and zero forcing number for butterfly networks. J. Comb. Optim. 37 (3) (2019)
Saman Eskandarzadeh, Thomas Kalinowski, Hamish Waterer
Maintenance scheduling in a railway corricdor. CoRR (2019)
Thomas Kalinowski, Sogol Mohammadian
Feasible bases for a polytope related to the Hamilton cycle problem. CoRR (2019)
Daniela Ferrero, Thomas Kalinowski, Sudeep Stephen
Zero forcing in iterated line digraphs. Discret. Appl. Math. 255 (2019)
Thomas Kalinowski, Nina Kamcev, Benny Sudakov
The Zero Forcing Number of Graphs. SIAM J. Discret. Math. 33 (1) (2019)
Thomas Kalinowski, Tomas Lidén, Hamish Waterer
Tight MIP formulations for bounded length cyclic sequences. CoRR (2018)
Tomas Lidén, Thomas Kalinowski, Hamish Waterer
Resource considerations for integrated planning of railway traffic and maintenance windows. J. Rail Transp. Plan. Manag. 8 (1) (2018)
Randy Davila, Thomas Kalinowski, Sudeep Stephen
A lower bound on the zero forcing number. Discret. Appl. Math. 250 (2018)
R. Sundara Rajan, Thomas Kalinowski, Sandi Klavzar, Hamid Mokhtar, T. M. Rajalaxmi
Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes. CoRR (2018)
Konrad Engel, Thomas Kalinowski, Martin W. P. Savelsbergh
Incremental Network Design with Minimum Spanning Trees. J. Graph Algorithms Appl. 21 (4) (2017)
Thomas Kalinowski, Reena Kapoor, Martin W. P. Savelsbergh
Scheduling reclaimers serving a stock pad at a coal terminal. J. Sched. 20 (1) (2017)
Cyriac Grigorious, Thomas Kalinowski, Joe Ryan, Sudeep Stephen
The metric dimension of the circulant graph C(n, \pm\{1, 2, 3, 4\}). CoRR (2017)
Natashia Boland, Santanu S. Dey, Thomas Kalinowski, Marco Molinaro, Fabian Rigterink
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions. Math. Program. 162 (1-2) (2017)
Natashia Boland, Thomas Kalinowski, Fabian Rigterink
A polynomially solvable case of the pooling problem. J. Glob. Optim. 67 (3) (2017)
Rachel Wulan Nirmalasari Wijaya, Joe Ryan, Thomas Kalinowski
Cube-magic labelings of grids. CoRR (2017)
Cyriac Grigorious, Thomas Kalinowski, Sudeep Stephen
On the Power Domination Number of de Bruijn and Kautz Digraphs. IWOCA (2017)
Jerrold R. Griggs, Sven Hartmann, Thomas Kalinowski, Uwe Leck, Ian T. Roberts
Full and maximal squashed flat antichains of minimum weight. CoRR (2017)
Haris Aziz, Thomas Kalinowski, Toby Walsh, Lirong Xia
Welfare of Sequential Allocation Mechanisms for Indivisible Goods. ECAI (2016)
Thomas Kalinowski, Uwe Leck, Christian Reiher, Ian T. Roberts
Minimizing the regularity of maximal regular antichains of 2- and 3-sets. Australas. J Comb. 64 (2016)
Cyriac Grigorious, Thomas Kalinowski, Joe Ryan, Sudeep Stephen
On the power domination number of de Bruijn and Kautz digraphs. CoRR (2016)
Randy Davila, Thomas Kalinowski, Sudeep Stephen
Proof of a conjecture of Davila and Kenter regarding a lower bound for the forcing number in terms of girth and minimum degree. CoRR (2016)
Natashia Boland, Irina Dumitrescu, Gary Froyland, Thomas Kalinowski
Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming. Math. Program. 157 (1) (2016)
Enrico Angelelli, Thomas Kalinowski, Reena Kapoor, Martin W. P. Savelsbergh
A reclaimer scheduling problem arising in coal stockyard management. J. Sched. 19 (5) (2016)
Daniela Ferrero, Cyriac Grigorious, Thomas Kalinowski, Joe Ryan, Sudeep Stephen
Minimum rank and zero forcing number for butterfly networks. CoRR (2016)
Natashia Boland, Thomas Kalinowski, Simranjit Kaur
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period. J. Comb. Optim. 32 (3) (2016)
Natashia Boland, Thomas Kalinowski, Fabian Rigterink
New multi-commodity flow formulations for the pooling problem. J. Glob. Optim. 66 (4) (2016)
Rachel Wulan Nirmalasari Wijaya, Joe Ryan, Thomas Kalinowski
H-supermagic labelings for firecrackers, banana trees and flowers. CoRR (2016)
Natashia Boland, Thomas Kalinowski, Fabian Rigterink
A polynomially solvable case of the pooling problem. CoRR (2015)
Natashia Boland, Thomas Kalinowski, Simranjit Kaur
Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies. Comput. Oper. Res. 64 (2015)
Haris Aziz, Thomas Kalinowski, Toby Walsh, Lirong Xia
Welfare of Sequential Allocation Mechanisms for Indivisible Goods. CoRR (2015)
Thomas Kalinowski, Dmytro Matsypura, Martin W. P. Savelsbergh
Incremental network design with maximum flows. Eur. J. Oper. Res. 242 (1) (2015)
Natashia Boland, Reena Kapoor, Simranjit Kaur, Thomas Kalinowski
Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results. Networks 63 (2) (2014)
Matthew Baxter, Tarek Elgindy, Andreas T. Ernst, Thomas Kalinowski, Martin W. P. Savelsbergh
Incremental network design with shortest paths. Eur. J. Oper. Res. 238 (3) (2014)
Enrico Angelelli, Thomas Kalinowski, Reena Kapoor, Martin W. P. Savelsbergh
Reclaimer Scheduling: Complexity and Algorithms. CoRR (2014)
Natashia Boland, Thomas Kalinowski, Hamish Waterer, Lanbo Zheng
Scheduling arc maintenance jobs in a network to maximize total flow over time. Discret. Appl. Math. 163 (2014)
Thomas Kalinowski, Nina Narodytska, Toby Walsh
A Social Welfare Optimal Sequential Allocation Procedure CoRR (2013)
Thomas Kalinowski, Uwe Leck, Ian T. Roberts
Maximal Antichains of Minimum Size. Electron. J. Comb. 20 (2) (2013)
Thomas Kalinowski, Nina Narodytska, Toby Walsh
A Social Welfare Optimal Sequential Allocation Procedure. IJCAI (2013)
Serge Gaspers, Thomas Kalinowski, Nina Narodytska, Toby Walsh
Coalitional Manipulation for Schulze's Rule CoRR (2013)
Thomas Kalinowski, Nina Narodytska, Toby Walsh, Lirong Xia
Strategic Behavior when Allocating Indivisible Goods Sequentially. AAAI (2013)
Natashia Boland, Thomas Kalinowski, Reena Kapoor, Simranjit Kaur
Scheduling unit processing time arc shutdown jobs to maximize network flow over time: complexity results. CoRR (2013)
Serge Gaspers, Thomas Kalinowski, Nina Narodytska, Toby Walsh
Coalitional manipulation for Schulze's rule. AAMAS (2013)
Konrad Engel, Thomas Kalinowski, Martin W. P. Savelsbergh
Incremental Network Design with Minimum Spanning Trees. CoRR (2013)
Thomas Kalinowski, Dmytro Matsypura, Martin W. P. Savelsbergh
Incremental Network Design with Maximum Flows. CoRR (2013)
Natashia Boland, Thomas Kalinowski, Hamish Waterer, Lanbo Zheng
Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain. J. Sched. 16 (6) (2013)
Natashia Boland, Thomas Kalinowski, Simranjit Kaur
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period. CoRR (2013)
Thomas Kalinowski
A minimum cost flow formulation for approximated MLC segmentation. Networks 57 (2) (2011)
Martin Grüttmüller, Sven Hartmann, Thomas Kalinowski, Uwe Leck, Ian T. Roberts
Maximal Flat Antichains of Minimum Weight. Electron. J. Comb. 16 (1) (2009)
Thomas Kalinowski
A Dual of the Rectangle-Segmentation Problem for Binary Matrices. Electron. J. Comb. 16 (1) (2009)
Thomas Kalinowski
The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence. Discret. Appl. Math. 157 (9) (2009)
Thomas Kalinowski, Antje Kiesel
Approximated MLC shape matrix decomposition with interleaf collision constraint. Algorithmic Oper. Res. 4 (1) (2009)
Thomas Kalinowski
Reducing the tongue-and-groove underdosage in MLC shape matrix decomposition. Algorithmic Oper. Res. 3 (2) (2008)
Thomas Kalinowski
Realization of Intensity Modulated Radiation Fields Using Multileaf Collimators. GTIT-C (2006)
Konrad Engel, Thomas Kalinowski, Roger Labahn, Frank Sill, Dirk Timmermann
Algorithms for Leakage Reduction with Dual Threshold Design Techniques. SoC (2006)
Thomas Kalinowski
Optimization of Multi-Threshold Circuits. Electron. Notes Discret. Math. 27 (2006)
Thomas Kalinowski
A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint. Discret. Appl. Math. 152 (1-3) (2005)
Thomas Kalinowski
Realization of intensity modulated radiation fields using multileaf collimator. Electron. Notes Discret. Math. 21 (2005)