Thomas Kalinowski

发表

Minimum rank and zero forcing number for butterfly networks

Joseph F. Ryan, Sudeep Stephen, Cyriac Grigorious, 2019, J. Comb. Optim..

Approximated MLC shape matrix decomposition with interleaf collision constraint

Antje Kiesel, Thomas Kalinowski, T. Kalinowski, 2009, Algorithmic Oper. Res..

Reclaimer Scheduling: Complexity and Algorithms pdf

Martin W. P. Savelsbergh, Enrico Angelelli, Thomas Kalinowski, 2014, ArXiv.

A reclaimer scheduling problem arising in coal stockyard management

Martin W. P. Savelsbergh, Enrico Angelelli, Thomas Kalinowski, 2016, J. Sched..

Coalitional manipulation for Schulze's rule

Toby Walsh, Nina Narodytska, Serge Gaspers, 2013, AAMAS.

The algorithmic complexity of the minimization of the number of segments in multileaf collimator eld segmentation

Thomas Kalinowski, T. Kalinowski, 2004 .

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

Thomas Kalinowski, Mitchell Harris, 2020, ArXiv.

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

Natashia Boland, Lanbo Zheng, Thomas Kalinowski, 2014, Discret. Appl. Math..

A lower bound on the zero forcing number

Sudeep Stephen, Thomas Kalinowski, Randy Davila, 2018, Discret. Appl. Math..

Cooperation in the Minority Game with local information

Hans-Jörg Schulz, Michael Briese, Thomas Kalinowski, 2000 .

Full and maximal squashed flat antichains of minimum weight pdf

Sven Hartmann, Jerrold R. Griggs, Uwe Leck, 2017, ArXiv.

Tight MIP formulations for bounded length cyclic sequences pdf

Tomas Lidén, Thomas Kalinowski, Hamish Waterer, 2018, ArXiv.

Resource considerations for integrated planning of railway traffic and maintenance windows

Tomas Lidén, Thomas Kalinowski, Hamish Waterer, 2018, J. Rail Transp. Plan. Manag..

Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period

Natashia Boland, Simranjit Kaur, Thomas Kalinowski, 2013, J. Comb. Optim..

Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies

Natashia Boland, Simranjit Kaur, Thomas Kalinowski, 2014, Comput. Oper. Res..

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

Natashia Boland, Lanbo Zheng, Thomas Kalinowski, 2013, J. Sched..

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

Thomas Kalinowski, 2008, Algorithmic Oper. Res..

Welfare of Sequential Allocation Mechanisms for Indivisible Goods

Toby Walsh, Lirong Xia, Haris Aziz, 2015, ECAI.

Optimization of Multi-Threshold Circuits

Thomas Kalinowski, 2006, Electron. Notes Discret. Math..

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

Thomas Kalinowski, T. Kalinowski, 2005, Discret. Appl. Math..

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

Marco Molinaro, Natashia Boland, Thomas Kalinowski, 2015, Math. Program..

Realization of Intensity Modulated Radiation Fields Using Multileaf Collimators

Thomas Kalinowski, T. Kalinowski, 2006, GTIT-C.

The Zero Forcing Number of Graphs

Benny Sudakov, Thomas Kalinowski, Nina Kamcev, 2017, SIAM J. Discret. Math..

Incremental Network Design with Minimum Spanning Trees pdf

Konrad Engel, Martin W. P. Savelsbergh, Thomas Kalinowski, 2017, J. Graph Algorithms Appl..

Incremental network design with shortest paths

Andreas T. Ernst, Martin W. P. Savelsbergh, Thomas Kalinowski, 2014, Eur. J. Oper. Res..

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

Joseph F. Ryan, Sudeep Stephen, Cyriac Grigorious, 2017, ArXiv.

Minimum Weight Flat Antichains of Subsets

Jerrold R. Griggs, Uwe Leck, Thomas Kalinowski, 2017 .

Incremental Network Design with Maximum Flows

Martin W. P. Savelsbergh, Thomas Kalinowski, Dmytro Matsypura, 2015, Eur. J. Oper. Res..

A Social Welfare Optimal Sequential Allocation Procedure pdf

Toby Walsh, Nina Narodytska, Thomas Kalinowski, 2013, IJCAI.

Maximal Flat Antichains of Minimum Weight

Sven Hartmann, Uwe Leck, Thomas Kalinowski, 2009, Electron. J. Comb..

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

Christian Reiher, Uwe Leck, Thomas Kalinowski, 2012, Australas. J Comb..

The network maintenance problem

Thomas Kalinowski, Hamish Waterer, Parisa Charkhgard, 2017 .

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

Natashia Boland, Simranjit Kaur, Thomas Kalinowski, 2012, ArXiv.

Zero forcing in iterated line digraphs

Sudeep Stephen, Daniela Ferrero, Thomas Kalinowski, 2017, Discret. Appl. Math..

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

Natashia Boland, Simranjit Kaur, Thomas Kalinowski, 2013, Networks.

New multi-commodity flow formulations for the pooling problem

Natashia Boland, Thomas Kalinowski, Fabian Rigterink, 2016, J. Glob. Optim..

Maximal Antichains of Minimum Size

Uwe Leck, Thomas Kalinowski, Ian T. Roberts, 2012, Electron. J. Comb..

A Dual of the Rectangle-Segmentation Problem for Binary Matrices

Thomas Kalinowski, 2009, Electron. J. Comb..

Realization of intensity modulated radiation fields using multileaf collimator

Thomas Kalinowski, T. Kalinowski, 2005, Electron. Notes Discret. Math..

On the power domination number of de Bruijn and Kautz digraphs

Cyriac Grigorious, Thomas Kalinowski, Joe Ryan, 2017, IWOCA.

Lower bounds for embeddings into hypercubes]{Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes pdf

Sandi Klavzar, R. Sundara Rajan, T. M. Rajalaxmi, 2018, ArXiv.

A polynomially solvable case of the pooling problem

Natashia Boland, Thomas Kalinowski, Fabian Rigterink, 2017, J. Glob. Optim..

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, 2009, Discret. Appl. Math..

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

Joseph F. Ryan, Thomas Kalinowski, Rachel Wulan Nirmalasari Wijaya, 2016, ArXiv.

Cube-magic labelings of grids pdf

Joseph F. Ryan, Thomas Kalinowski, Rachel Wulan Nirmalasari Wijaya, 2017, ArXiv.

Feasible bases for a polytope related to the Hamilton cycle problem pdf

Thomas Kalinowski, Sogol Mohammadian, 2019, ArXiv.

Hamiltonian Cycles and Subsets of Discounted Occupational Measures

Jerzy A. Filar, Ali Eshragh, Thomas Kalinowski, 2018, Math. Oper. Res..

Strategic Behavior when Allocating Indivisible Goods Sequentially

Toby Walsh, Nina Narodytska, Lirong Xia, 2013, AAAI.

Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming

Natashia Boland, Gary Froyland, Thomas Kalinowski, 2016, Mathematical Programming.

The network maintenance problem on an arc with uncapacitated repair

Thomas Kalinowski, Hamish Waterer, P Charkhgard, 2019 .

A minimum cost flow formulation for approximated MLC segmentation

Thomas Kalinowski, T. Kalinowski, 2011, Networks.

Scheduling reclaimers serving a stock pad at a coal terminal

Martin W. P. Savelsbergh, Thomas Kalinowski, Reena Kapoor, 2017, J. Sched..

Maximal antichains of subsets I: The shadow spectrum pdf

Jerrold R. Griggs, Uwe Leck, Thomas Kalinowski, 2021, ArXiv.

Maximal antichains of subsets II: Constructions pdf

Jerrold R. Griggs, Uwe Leck, Thomas Kalinowski, 2021, ArXiv.

Capacity Alignment Planning for a Coal Chain: A Case Study

Thomas Kalinowski, Hamish Waterer, Saman Eskandarzadeh, 2021 .

Minimum Weight Flat Antichains of Subsets

Sven Hartmann, Jerrold R. Griggs, Uwe Leck, 2017, Order.

Strategic Behavior in a Decentralized Protocol for Allocating Indivisible Good

Toby Walsh, Nina Narodytska, Lirong Xia, 2012 .

Korea's Search for a Global Role between Hard Economic Interests and Soft Power

Hyekyung Cho, Thomas Kalinowski, T. Kalinowski, 2012 .