Thomas Kalinowski

According to our database, Thomas Kalinowski authored at least 57 papers between 2005 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

The Saturation Spectrum for Antichains of Subsets.

Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck, Ian T. Roberts, Michael Schmitz

Order, October, 2023

Sizes of flat maximal antichains of subsets.

Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck, Ian T. Roberts, Michael Schmitz

CoRR, 2023

2021

Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes.

R. Sundara Rajan, Thomas Kalinowski, Sandi Klavzar, Hamid Mokhtar, T. M. Rajalaxmi

J. Supercomput., 2021

Minimum Weight Flat Antichains of Subsets.

Jerrold R. Griggs, Sven Hartmann, Thomas Kalinowski, Uwe Leck, Ian T. Roberts

Order, 2021

Feasible Bases for a Polytope Related to the Hamilton Cycle Problem.

Thomas Kalinowski, Sogol Mohammadian

Math. Oper. Res., 2021

Maximal antichains of subsets I: The shadow spectrum.

Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck, Ian T. Roberts, Michael Schmitz

CoRR, 2021

2020

Hamiltonian Cycles and Subsets of Discounted Occupational Measures.

Ali Eshragh, Jerzy A. Filar, Thomas Kalinowski, Sogol Mohammadian

Math. Oper. Res., 2020

Extended formulations for convex hulls of some bilinear functions.

Akshay Gupte, Thomas Kalinowski, Fabian Rigterink, Hamish Waterer

Discret. Optim., 2020

Convex Hulls for Graphs of Quadratic Functions With Unit Coefficients: Even Wheels and Complete Split Graphs.

Mitchell Harris, Thomas Kalinowski

CoRR, 2020

Scheduling of maintenance windows in a mining supply chain rail network.

Thomas Kalinowski, Jason Matthews, Hamish Waterer

Comput. Oper. Res., 2020

2019

The Zero Forcing Number of Graphs.

Thomas Kalinowski, Nina Kamcev, Benny Sudakov

SIAM J. Discret. Math., 2019

Minimum rank and zero forcing number for butterfly networks.

Daniela Ferrero, Cyriac Grigorious, Thomas Kalinowski, Joe Ryan, Sudeep Stephen

J. Comb. Optim., 2019

Zero forcing in iterated line digraphs.

Daniela Ferrero, Thomas Kalinowski, Sudeep Stephen

Discret. Appl. Math., 2019

Maintenance scheduling in a railway corricdor.

Saman Eskandarzadeh, Thomas Kalinowski, Hamish Waterer

CoRR, 2019

2018

Resource considerations for integrated planning of railway traffic and maintenance windows.

Tomas Lidén, Thomas Kalinowski, Hamish Waterer

J. Rail Transp. Plan. Manag., 2018

A lower bound on the zero forcing number.

Randy Davila, Thomas Kalinowski, Sudeep Stephen

Discret. Appl. Math., 2018

Tight MIP formulations for bounded length cyclic sequences.

Thomas Kalinowski, Tomas Lidén, Hamish Waterer

CoRR, 2018

2017

Scheduling reclaimers serving a stock pad at a coal terminal.

Thomas Kalinowski, Reena Kapoor, Martin W. P. Savelsbergh

J. Sched., 2017

Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions.

Natashia Boland, Santanu S. Dey, Thomas Kalinowski, Marco Molinaro, Fabian Rigterink

Math. Program., 2017

A polynomially solvable case of the pooling problem.

Natashia Boland, Thomas Kalinowski, Fabian Rigterink

J. Glob. Optim., 2017

Incremental Network Design with Minimum Spanning Trees.

Konrad Engel, Thomas Kalinowski, Martin W. P. Savelsbergh

J. Graph Algorithms Appl., 2017

Cube-magic labelings of grids.

Rachel Wulan Nirmalasari Wijaya, Joe Ryan, Thomas Kalinowski

CoRR, 2017

The metric dimension of the circulant graph C(n, \pm\{1, 2, 3, 4\}).

Cyriac Grigorious, Thomas Kalinowski, Joe Ryan, Sudeep Stephen

CoRR, 2017

Full and maximal squashed flat antichains of minimum weight.

Jerrold R. Griggs, Sven Hartmann, Thomas Kalinowski, Uwe Leck, Ian T. Roberts

CoRR, 2017

On the Power Domination Number of de Bruijn and Kautz Digraphs.

Cyriac Grigorious, Thomas Kalinowski, Sudeep Stephen

Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

2016

A reclaimer scheduling problem arising in coal stockyard management.

Enrico Angelelli, Thomas Kalinowski, Reena Kapoor, Martin W. P. Savelsbergh

J. Sched., 2016

Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming.

Natashia Boland, Irina Dumitrescu, Gary Froyland, Thomas Kalinowski

Math. Program., 2016

New multi-commodity flow formulations for the pooling problem.

Natashia Boland, Thomas Kalinowski, Fabian Rigterink

J. Glob. Optim., 2016

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

J. Comb. Optim., 2016

H-supermagic labelings for firecrackers, banana trees and flowers.

Rachel Wulan Nirmalasari Wijaya, Joe Ryan, Thomas Kalinowski

CoRR, 2016

On the power domination number of de Bruijn and Kautz digraphs.

Cyriac Grigorious, Thomas Kalinowski, Joe Ryan, Sudeep Stephen

CoRR, 2016

Proof of a conjecture of Davila and Kenter regarding a lower bound for the forcing number in terms of girth and minimum degree.

Randy Davila, Thomas Kalinowski, Sudeep Stephen

CoRR, 2016

Minimizing the regularity of maximal regular antichains of 2- and 3-sets.

Thomas Kalinowski, Uwe Leck, Christian Reiher, Ian T. Roberts

Australas. J Comb., 2016

Welfare of Sequential Allocation Mechanisms for Indivisible Goods.

Haris Aziz, Thomas Kalinowski, Toby Walsh, Lirong Xia

Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016

2015

Incremental network design with maximum flows.

Thomas Kalinowski, Dmytro Matsypura, Martin W. P. Savelsbergh

Eur. J. Oper. Res., 2015

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

Comput. Oper. Res., 2015

2014

Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results.

Natashia Boland, Reena Kapoor, Simranjit Kaur, Thomas Kalinowski

Networks, 2014

Incremental network design with shortest paths.

Matthew Baxter, Tarek Elgindy, Andreas T. Ernst, Thomas Kalinowski, Martin W. P. Savelsbergh

Eur. J. Oper. Res., 2014

Scheduling arc maintenance jobs in a network to maximize total flow over time.

Natashia Boland, Thomas Kalinowski, Hamish Waterer, Lanbo Zheng

Discret. Appl. Math., 2014

Reclaimer Scheduling: Complexity and Algorithms.

Enrico Angelelli, Thomas Kalinowski, Reena Kapoor, Martin W. P. Savelsbergh

CoRR, 2014

2013

Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain.

Natashia Boland, Thomas Kalinowski, Hamish Waterer, Lanbo Zheng

J. Sched., 2013

Scheduling unit processing time arc shutdown jobs to maximize network flow over time: complexity results.

Natashia Boland, Thomas Kalinowski, Reena Kapoor, Simranjit Kaur

CoRR, 2013

Maximal Antichains of Minimum Size.

Thomas Kalinowski, Uwe Leck, Ian T. Roberts

Electron. J. Comb., 2013

A Social Welfare Optimal Sequential Allocation Procedure.

Thomas Kalinowski, Nina Narodytska, Toby Walsh

Proceedings of the IJCAI 2013, 2013

Coalitional manipulation for Schulze's rule.

Serge Gaspers, Thomas Kalinowski, Nina Narodytska, Toby Walsh

Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Strategic Behavior when Allocating Indivisible Goods Sequentially.

Thomas Kalinowski, Nina Narodytska, Toby Walsh, Lirong Xia

Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2011

A minimum cost flow formulation for approximated MLC segmentation.

Thomas Kalinowski

Networks, 2011

2009

The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence.

Thomas Kalinowski

Discret. Appl. Math., 2009

A Dual of the Rectangle-Segmentation Problem for Binary Matrices.

Thomas Kalinowski

Electron. J. Comb., 2009

Maximal Flat Antichains of Minimum Weight.

Martin Grüttmüller, Sven Hartmann, Thomas Kalinowski, Uwe Leck, Ian T. Roberts

Electron. J. Comb., 2009

Approximated MLC shape matrix decomposition with interleaf collision constraint.

Thomas Kalinowski, Antje Kiesel

Algorithmic Oper. Res., 2009

2008

Reducing the tongue-and-groove underdosage in MLC shape matrix decomposition.

Thomas Kalinowski

Algorithmic Oper. Res., 2008

2006

Optimization of Multi-Threshold Circuits.

Thomas Kalinowski

Electron. Notes Discret. Math., 2006

Algorithms for Leakage Reduction with Dual Threshold Design Techniques.

Konrad Engel, Thomas Kalinowski, Roger Labahn, Frank Sill, Dirk Timmermann

Proceedings of the International Symposium on System-on-Chip, 2006

Realization of Intensity Modulated Radiation Fields Using Multileaf Collimators.

Thomas Kalinowski

Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

2005

Realization of intensity modulated radiation fields using multileaf collimator.

Thomas Kalinowski

Electron. Notes Discret. Math., 2005

A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint.

Thomas Kalinowski

Discret. Appl. Math., 2005