Kalinowski, Thomas

Prof. Dr. rer. nat. habil.

Positionen

Professor, Fachgruppe Mathematik, Fakultät Angewandte Computer- und Biowissenschaften

Forschungsgebiete

- Kombinatorik von partiell geordneten Mengen
- Extremale Graphentheorie
- Kombinatorische Optimierung
- Netzwerkoptimierung

Forschungsschwerpunkt

Angewandte Informatik Forschungsschwerpunkt

ausgewählte Publikationen

Journalartikel
- The Saturation Spectrum for Antichains of Subsets. Order. 2023
- Total Edge Irregularity Strength of the Cartesian Product of Bipartite Graphs and Paths. Journal of the Indonesian Mathematical Society. 156-165. 2023
- Feasible Bases for a Polytope Related to the Hamilton Cycle Problem. Mathematics of Operations Research. 1366-1389. 2021
- Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes. The Journal of Supercomputing. 4135-4150. 2021
- Minimum Weight Flat Antichains of Subsets. Order. 441-453. 2021
- Extended formulations for convex hulls of some bilinear functions. Discrete Optimization. 100569. 2020
- Hamiltonian Cycles and Subsets of Discounted Occupational Measures. Mathematics of Operations Research. 713-731. 2020
- Scheduling of maintenance windows in a mining supply chain rail network. Computers & Operations Research. 104670. 2020
- Minimum rank and zero forcing number for butterfly networks. Journal of Combinatorial Optimization. 970-988. 2019
- The Zero Forcing Number of Graphs. SIAM Journal on Discrete Mathematics. 95-115. 2019
- Zero forcing in iterated line digraphs. Discrete Applied Mathematics. 198-208. 2019
- A lower bound on the zero forcing number. Discrete Applied Mathematics. 363-367. 2018
- Resource considerations for integrated planning of railway traffic and maintenance windows. Journal of Rail Transport Planning & Management. 1-15. 2018
- A polynomially solvable case of the pooling problem. Journal of Global Optimization. 621-630. 2017
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions. Mathematical Programming. 523-535. 2017
- H-supermagic labelings for firecrackers, banana trees and flowers . Australasian Journal of Combinatorics. 442-451. 2017
- Incremental Network Design with Minimum Spanning Trees. Journal of Graph Algorithms and Applications. 417-432. 2017
- Scheduling reclaimers serving a stock pad at a coal terminal. Journal of Scheduling. 85-101. 2017
- The metric dimension of the circulant graph c(n, ±{1, 2, 3, 4}). Australasian Journal of Combinatorics. 417-441. 2017
- A reclaimer scheduling problem arising in coal stockyard management. Journal of Scheduling. 563-582. 2016
- Minimizing the regularity of maximal regular antichains of 2-sets and 3-sets . Australasian Journal of Combinatorics. 277-288. 2016
- Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming. Mathematical Programming. 69-93. 2016
- New multi-commodity flow formulations for the pooling problem. Journal of Global Optimization. 669-710. 2016
- Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period. Journal of Combinatorial Optimization. 885-905. 2016
- Incremental network design with maximum flows. European Journal of Operational Research. 51-62. 2015
- Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies. Computers & Operations Research. 113-129. 2015
- Incremental network design with shortest paths. European Journal of Operational Research. 675-684. 2014
- Scheduling arc maintenance jobs in a network to maximize total flow over time. Discrete Applied Mathematics. 34-52. 2014
- Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results. Networks. 196-202. 2014
- Maximal Antichains of Minimum Size. The Electronic Journal of Combinatorics. 2013
- Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain. Journal of Scheduling. 649-659. 2013
- A minimum cost flow formulation for approximated MLC segmentation. Networks. 135-140. 2011
- A Dual of the Rectangle-Segmentation Problem for Binary Matrices. The Electronic Journal of Combinatorics. 2009
- Maximal Flat Antichains of Minimum Weight. The Electronic Journal of Combinatorics. 2009
- The complexity of minimizing the number of shape matrices subject to minimal beam-on time in multileaf collimator field decomposition with bounded fluence. Discrete Applied Mathematics. 2089-2104. 2009
- A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint. Discrete Applied Mathematics. 52-88. 2005
- Reducing the number of monitor units in multileaf collimator field segmentation. Physics in Medicine and Biology. 1147-1161. 2005
- Cooperation in the Minority Game with local information. Physica A: Statistical Mechanics and its Applications. 502-508. 2000
Konferenzpaper
- The network maintenance problem on an arc with uncapacitated repair 2019
- On the Power Domination Number of de Bruijn and Kautz Digraphs. Lecture Notes in Computer Science. 264-272. 2018

ORCID iD

https://orcid.org/0000-0002-8444-6848 (bestätigt)

vollständiger Name

Thomas Kalinowski

KoautorInnen-Netzwerk

Kontaktdaten

kalinows@hs-mittweida.de

+49 3727 582255

Webseiten

https://www.staff.hs-mittweida.de/~kalinows/