Thomas Kalinowski

Orcid: 0000-0002-8444-6848

According to our database1, Thomas Kalinowski authored at least 58 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Independent domination in the graph defined by two consecutive levels of the n-cube.
Discret. Appl. Math., 2024

2023
The Saturation Spectrum for Antichains of Subsets.
Order, October, 2023

Sizes of flat maximal antichains of subsets.
CoRR, 2023

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

Minimum Weight Flat Antichains of Subsets.
Order, 2021

Feasible Bases for a Polytope Related to the Hamilton Cycle Problem.
Math. Oper. Res., 2021

Maximal antichains of subsets I: The shadow spectrum.
CoRR, 2021

2020
Hamiltonian Cycles and Subsets of Discounted Occupational Measures.
Math. Oper. Res., 2020

Extended formulations for convex hulls of some bilinear functions.
Discret. Optim., 2020

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

Scheduling of maintenance windows in a mining supply chain rail network.
Comput. Oper. Res., 2020

2019
The Zero Forcing Number of Graphs.
SIAM J. Discret. Math., 2019

Minimum rank and zero forcing number for butterfly networks.
J. Comb. Optim., 2019

Zero forcing in iterated line digraphs.
Discret. Appl. Math., 2019

Maintenance scheduling in a railway corricdor.
CoRR, 2019

2018
Resource considerations for integrated planning of railway traffic and maintenance windows.
J. Rail Transp. Plan. Manag., 2018

A lower bound on the zero forcing number.
Discret. Appl. Math., 2018

Tight MIP formulations for bounded length cyclic sequences.
CoRR, 2018

2017
Scheduling reclaimers serving a stock pad at a coal terminal.
J. Sched., 2017

Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions.
Math. Program., 2017

A polynomially solvable case of the pooling problem.
J. Glob. Optim., 2017

Incremental Network Design with Minimum Spanning Trees.
J. Graph Algorithms Appl., 2017

Cube-magic labelings of grids.
CoRR, 2017

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

Full and maximal squashed flat antichains of minimum weight.
CoRR, 2017

On the Power Domination Number of de Bruijn and Kautz Digraphs.
Proceedings of the Combinatorial Algorithms - 28th International Workshop, 2017

2016
A reclaimer scheduling problem arising in coal stockyard management.
J. Sched., 2016

Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming.
Math. Program., 2016

New multi-commodity flow formulations for the pooling problem.
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.
J. Comb. Optim., 2016

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

On the power domination number of de Bruijn and Kautz digraphs.
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.
CoRR, 2016

Minimizing the regularity of maximal regular antichains of 2- and 3-sets.
Australas. J Comb., 2016

Welfare of Sequential Allocation Mechanisms for Indivisible Goods.
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.
Eur. J. Oper. Res., 2015

Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies.
Comput. Oper. Res., 2015

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

Incremental network design with shortest paths.
Eur. J. Oper. Res., 2014

Scheduling arc maintenance jobs in a network to maximize total flow over time.
Discret. Appl. Math., 2014

Reclaimer Scheduling: Complexity and Algorithms.
CoRR, 2014

2013
Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain.
J. Sched., 2013

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

Maximal Antichains of Minimum Size.
Electron. J. Comb., 2013

A Social Welfare Optimal Sequential Allocation Procedure.
Proceedings of the IJCAI 2013, 2013

Coalitional manipulation for Schulze's rule.
Proceedings of the International conference on Autonomous Agents and Multi-Agent Systems, 2013

Strategic Behavior when Allocating Indivisible Goods Sequentially.
Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence, 2013

2011
A minimum cost flow formulation for approximated MLC segmentation.
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.
Discret. Appl. Math., 2009

A Dual of the Rectangle-Segmentation Problem for Binary Matrices.
Electron. J. Comb., 2009

Maximal Flat Antichains of Minimum Weight.
Electron. J. Comb., 2009

Approximated MLC shape matrix decomposition with interleaf collision constraint.
Algorithmic Oper. Res., 2009

2008
Reducing the tongue-and-groove underdosage in MLC shape matrix decomposition.
Algorithmic Oper. Res., 2008

2006
Optimization of Multi-Threshold Circuits.
Electron. Notes Discret. Math., 2006

Algorithms for Leakage Reduction with Dual Threshold Design Techniques.
Proceedings of the International Symposium on System-on-Chip, 2006

Realization of Intensity Modulated Radiation Fields Using Multileaf Collimators.
Proceedings of the General Theory of Information Transfer and Combinatorics, 2006

2005
Realization of intensity modulated radiation fields using multileaf collimator.
Electron. Notes Discret. Math., 2005

A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint.
Discret. Appl. Math., 2005


  Loading...