Thomas Kalinowski

From MaRDI portal
Person:291042

Available identifiers

zbMath Open kalinowski.thomasDBLP60/6727WikidataQ57430105 ScholiaQ57430105MaRDI QIDQ291042

List of research outcomes





PublicationDate of PublicationType
Independent domination in the graph defined by two consecutive levels of the \(n\)-cube2024-09-26Paper
Total Edge Irregularity Strength of the Cartesian Product of Bipartite Graphs and Paths2024-02-14Paper
Independent domination in the graph defined by two consecutive levels of the $n$-cube2023-11-09Paper
Sizes of flat maximal antichains of subsets2023-02-14Paper
Cube-magic labelings of grids2022-02-22Paper
Feasible Bases for a Polytope Related to the Hamilton Cycle Problem2022-02-08Paper
Minimum weight flat antichains of subsets2021-11-19Paper
Maximal antichains of subsets II: Constructions2021-06-03Paper
Hamiltonian Cycles and Subsets of Discounted Occupational Measures2020-09-01Paper
Extended formulations for convex hulls of some bilinear functions2020-07-30Paper
Scheduling of maintenance windows in a mining supply chain rail network2020-01-27Paper
Minimum rank and zero forcing number for butterfly networks2019-06-25Paper
Zero forcing in iterated line digraphs2019-02-20Paper
The Zero Forcing Number of Graphs2019-01-16Paper
A lower bound on the zero forcing number2018-10-26Paper
Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes2018-07-18Paper
https://portal.mardi4nfdi.de/entity/Q45762112018-07-12Paper
On the power domination number of de Bruijn and Kautz digraphs2018-06-15Paper
Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results2018-05-11Paper
Scheduling reclaimers serving a stock pad at a coal terminal2018-04-03Paper
The metric dimension of the circulant graph $C(n,\pm\{1,2,3,4\})$2017-12-06Paper
$H$-supermagic labelings for firecrackers, banana trees and flowers2017-12-06Paper
New multi-commodity flow formulations for the pooling problem2017-04-27Paper
Incremental Network Design with Minimum Spanning Trees2017-04-05Paper
Minimum Weight Flat Antichains of Subsets2017-03-31Paper
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions2017-03-23Paper
A polynomially solvable case of the pooling problem2017-03-03Paper
On the power domination number of de Bruijn and Kautz digraphs2016-12-06Paper
Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies2016-11-17Paper
A reclaimer scheduling problem arising in coal stockyard management2016-11-16Paper
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period2016-10-12Paper
Incremental network design with maximum flows2016-07-08Paper
Incremental network design with shortest paths2016-06-23Paper
Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming2016-06-06Paper
Minimizing the regularity of maximal regular antichains of 2- and 3-sets2016-04-18Paper
Scheduling arc maintenance jobs in a network to maximize total flow over time2014-09-08Paper
Reducing the tongue-and-groove underdosage in MLC shape matrix decomposition2013-12-11Paper
Approximated MLC shape matrix decomposition with interleaf collision constraint2013-12-11Paper
Maximal antichains of minimum size2013-06-07Paper
A minimum cost flow formulation for approximated MLC segmentation2011-03-16Paper
A dual of the rectangle-segmentation problem for binary matrices2010-03-26Paper
Maximal flat antichains of minimum weight2009-07-08Paper
The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence2009-06-24Paper
Realization of Intensity Modulated Radiation Fields Using Multileaf Collimators2009-01-22Paper
Realization of intensity modulated radiation fields using multileaf collimator2007-05-29Paper
Optimization of Multi-Threshold Circuits2007-05-29Paper
A recolouring problem on undirected graphs2006-08-15Paper
A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint2005-12-27Paper

Research outcomes over time

This page was built for person: Thomas Kalinowski