Thomas Kalinowski

69 papers A* 2A 2C 1Journal 62Unranked 2

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