Thomas Kalinowski

Available identifiers

zbMath Open kalinowski.thomasMaRDI QIDQ291042

List of research outcomes

Publication	Date of Publication	Type
Total Edge Irregularity Strength of the Cartesian Product of Bipartite Graphs and Paths	2024-02-14	Paper
Cube-magic labelings of grids	2022-02-22	Paper
Feasible Bases for a Polytope Related to the Hamilton Cycle Problem	2022-02-08	Paper
Minimum weight flat antichains of subsets	2021-11-19	Paper
Hamiltonian Cycles and Subsets of Discounted Occupational Measures	2020-09-01	Paper
Extended formulations for convex hulls of some bilinear functions	2020-07-30	Paper
Scheduling of maintenance windows in a mining supply chain rail network	2020-01-27	Paper
Minimum rank and zero forcing number for butterfly networks	2019-06-25	Paper
Zero forcing in iterated line digraphs	2019-02-20	Paper
The Zero Forcing Number of Graphs	2019-01-16	Paper
A lower bound on the zero forcing number	2018-10-26	Paper
https://portal.mardi4nfdi.de/entity/Q4576211	2018-07-12	Paper
On the power domination number of de Bruijn and Kautz digraphs	2018-06-15	Paper
Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results	2018-05-11	Paper
Scheduling reclaimers serving a stock pad at a coal terminal	2018-04-03	Paper
The metric dimension of the circulant graph $C(n,\pm\{1,2,3,4\})$	2017-12-06	Paper
$H$-supermagic labelings for firecrackers, banana trees and flowers	2017-12-06	Paper
New multi-commodity flow formulations for the pooling problem	2017-04-27	Paper
Incremental Network Design with Minimum Spanning Trees	2017-04-05	Paper
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions	2017-03-23	Paper
A polynomially solvable case of the pooling problem	2017-03-03	Paper
Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies	2016-11-17	Paper
A reclaimer scheduling problem arising in coal stockyard management	2016-11-16	Paper
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period	2016-10-12	Paper
Incremental network design with maximum flows	2016-07-08	Paper
Incremental network design with shortest paths	2016-06-23	Paper
Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming	2016-06-06	Paper
Minimizing the regularity of maximal regular antichains of 2- and 3-sets	2016-04-18	Paper
Scheduling arc maintenance jobs in a network to maximize total flow over time	2014-09-08	Paper
https://portal.mardi4nfdi.de/entity/Q2867352	2013-12-11	Paper
https://portal.mardi4nfdi.de/entity/Q2867361	2013-12-11	Paper
Maximal antichains of minimum size	2013-06-07	Paper
A minimum cost flow formulation for approximated MLC segmentation	2011-03-16	Paper
A dual of the rectangle-segmentation problem for binary matrices	2010-03-26	Paper
Maximal flat antichains of minimum weight	2009-07-08	Paper
The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence	2009-06-24	Paper
Realization of Intensity Modulated Radiation Fields Using Multileaf Collimators	2009-01-22	Paper
Realization of intensity modulated radiation fields using multileaf collimator	2007-05-29	Paper
Optimization of Multi-Threshold Circuits	2007-05-29	Paper
https://portal.mardi4nfdi.de/entity/Q5483561	2006-08-15	Paper
A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint	2005-12-27	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Thomas Kalinowski