default search action
Thomas Kalinowski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j38]Thomas Kalinowski
, Uwe Leck:
Independent domination in the graph defined by two consecutive levels of the n-cube. Discret. Appl. Math. 357: 161-172 (2024) - 2023
- [j37]Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck, Ian T. Roberts, Michael Schmitz
The Saturation Spectrum for Antichains of Subsets. Order 40(3): 537-574 (2023) - [i23]Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck, Ian T. Roberts, Michael Schmitz:
Sizes of flat maximal antichains of subsets. CoRR abs/2302.07062 (2023) - 2021
- [j36]Thomas Kalinowski
Feasible Bases for a Polytope Related to the Hamilton Cycle Problem. Math. Oper. Res. 46(4): 1366-1389 (2021) - [j35]Jerrold R. Griggs, Sven Hartmann, Thomas Kalinowski, Uwe Leck, Ian T. Roberts:
Minimum Weight Flat Antichains of Subsets. Order 38(3): 441-453 (2021) - [j34]R. Sundara Rajan
Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes. J. Supercomput. 77(4): 4135-4150 (2021) - [i22]Jerrold R. Griggs, Thomas Kalinowski, Uwe Leck, Ian T. Roberts, Michael Schmitz:
Maximal antichains of subsets I: The shadow spectrum. CoRR abs/2106.02226 (2021) - 2020
- [j33]Thomas Kalinowski
Scheduling of maintenance windows in a mining supply chain rail network. Comput. Oper. Res. 115: 104670 (2020) - [j32]Akshay Gupte
Extended formulations for convex hulls of some bilinear functions. Discret. Optim. 36: 100569 (2020) - [j31]Ali Eshragh
Hamiltonian Cycles and Subsets of Discounted Occupational Measures. Math. Oper. Res. 45(2): 713-731 (2020) - [i21]Mitchell Harris, Thomas Kalinowski:
Convex Hulls for Graphs of Quadratic Functions With Unit Coefficients: Even Wheels and Complete Split Graphs. CoRR abs/2007.05656 (2020)
2010 – 2019
- 2019
- [j30]Daniela Ferrero
Zero forcing in iterated line digraphs. Discret. Appl. Math. 255: 198-208 (2019) - [j29]Daniela Ferrero
Minimum rank and zero forcing number for butterfly networks. J. Comb. Optim. 37(3): 970-988 (2019) - [j28]Thomas Kalinowski
The Zero Forcing Number of Graphs. SIAM J. Discret. Math. 33(1): 95-115 (2019) - [i20]Thomas Kalinowski, Sogol Mohammadian:
Feasible bases for a polytope related to the Hamilton cycle problem. CoRR abs/1907.12691 (2019) - [i19]Saman Eskandarzadeh, Thomas Kalinowski, Hamish Waterer:
Maintenance scheduling in a railway corricdor. CoRR abs/1910.10348 (2019) - 2018
- [j27]Randy Davila
A lower bound on the zero forcing number. Discret. Appl. Math. 250: 363-367 (2018) - [j26]Tomas Lidén
Resource considerations for integrated planning of railway traffic and maintenance windows. J. Rail Transp. Plan. Manag. 8(1): 1-15 (2018) - [i18]R. Sundara Rajan, Thomas Kalinowski, Sandi Klavzar, Hamid Mokhtar, T. M. Rajalaxmi:
Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes. CoRR abs/1807.06787 (2018) - [i17]Thomas Kalinowski, Tomas Lidén, Hamish Waterer:
Tight MIP formulations for bounded length cyclic sequences. CoRR abs/1809.01773 (2018) - 2017
- [j25]Konrad Engel, Thomas Kalinowski
Incremental Network Design with Minimum Spanning Trees. J. Graph Algorithms Appl. 21(4): 417-432 (2017) - [j24]Natashia Boland
A polynomially solvable case of the pooling problem. J. Glob. Optim. 67(3): 621-630 (2017) - [j23]Natashia Boland
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions. Math. Program. 162(1-2): 523-535 (2017) - [j22]Thomas Kalinowski
Scheduling reclaimers serving a stock pad at a coal terminal. J. Sched. 20(1): 85-101 (2017) - [c7]Cyriac Grigorious, Thomas Kalinowski
On the Power Domination Number of de Bruijn and Kautz Digraphs. IWOCA 2017: 264-272 - [i16]Rachel Wulan Nirmalasari Wijaya, Joe Ryan, Thomas Kalinowski:
Cube-magic labelings of grids. CoRR abs/1702.02639 (2017) - [i15]Cyriac Grigorious, Thomas Kalinowski, Joe Ryan, Sudeep Stephen:
The metric dimension of the circulant graph C(n, \pm\{1, 2, 3, 4\}). CoRR abs/1702.08178 (2017) - [i14]Jerrold R. Griggs, Sven Hartmann, Thomas Kalinowski, Uwe Leck, Ian T. Roberts:
Full and maximal squashed flat antichains of minimum weight. CoRR abs/1704.00067 (2017) - 2016
- [j21]Thomas Kalinowski, Uwe Leck, Christian Reiher, Ian T. Roberts:
Minimizing the regularity of maximal regular antichains of 2- and 3-sets. Australas. J Comb. 64: 277-288 (2016) - [j20]Natashia Boland
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period. J. Comb. Optim. 32(3): 885-905 (2016) - [j19]Natashia Boland
New multi-commodity flow formulations for the pooling problem. J. Glob. Optim. 66(4): 669-710 (2016) - [j18]Natashia Boland
Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming. Math. Program. 157(1): 69-93 (2016) - [j17]Enrico Angelelli
A reclaimer scheduling problem arising in coal stockyard management. J. Sched. 19(5): 563-582 (2016) - [c6]Haris Aziz
Welfare of Sequential Allocation Mechanisms for Indivisible Goods. ECAI 2016: 787-794 - [i13]Daniela Ferrero, Cyriac Grigorious, Thomas Kalinowski, Joe Ryan, Sudeep Stephen:
Minimum rank and zero forcing number for butterfly networks. CoRR abs/1607.07522 (2016) - [i12]Rachel Wulan Nirmalasari Wijaya, Joe Ryan, Thomas Kalinowski:
H-supermagic labelings for firecrackers, banana trees and flowers. CoRR abs/1607.07911 (2016) - [i11]Randy Davila, Thomas Kalinowski, Sudeep Stephen:
Proof of a conjecture of Davila and Kenter regarding a lower bound for the forcing number in terms of girth and minimum degree. CoRR abs/1611.06557 (2016) - [i10]Cyriac Grigorious, Thomas Kalinowski, Joe Ryan, Sudeep Stephen:
On the power domination number of de Bruijn and Kautz digraphs. CoRR abs/1612.01721 (2016) - 2015
- [j16]Natashia Boland
Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies. Comput. Oper. Res. 64: 113-129 (2015) - [j15]Thomas Kalinowski
Incremental network design with maximum flows. Eur. J. Oper. Res. 242(1): 51-62 (2015) - [i9]Natashia Boland, Thomas Kalinowski, Fabian Rigterink:
A polynomially solvable case of the pooling problem. CoRR abs/1508.03181 (2015) - [i8]Haris Aziz, Thomas Kalinowski, Toby Walsh, Lirong Xia:
Welfare of Sequential Allocation Mechanisms for Indivisible Goods. CoRR abs/1511.08280 (2015) - 2014
- [j14]Natashia Boland
Scheduling arc maintenance jobs in a network to maximize total flow over time. Discret. Appl. Math. 163: 34-52 (2014) - [j13]Matthew Baxter, Tarek Elgindy
Incremental network design with shortest paths. Eur. J. Oper. Res. 238(3): 675-684 (2014) - [j12]Natashia Boland
Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results. Networks 63(2): 196-202 (2014) - [i7]Enrico Angelelli, Thomas Kalinowski, Reena Kapoor, Martin W. P. Savelsbergh:
Reclaimer Scheduling: Complexity and Algorithms. CoRR abs/1402.4178 (2014) - 2013
- [j11]Thomas Kalinowski, Uwe Leck, Ian T. Roberts:
Maximal Antichains of Minimum Size. Electron. J. Comb. 20(2): 3 (2013) - [j10]Natashia Boland
Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain. J. Sched. 16(6): 649-659 (2013) - [c5]Thomas Kalinowski, Nina Narodytska, Toby Walsh, Lirong Xia:
Strategic Behavior when Allocating Indivisible Goods Sequentially. AAAI 2013: 452-458 - [c4]Serge Gaspers, Thomas Kalinowski, Nina Narodytska, Toby Walsh:
Coalitional manipulation for Schulze's rule. AAMAS 2013: 431-438 - [c3]Thomas Kalinowski, Nina Narodytska, Toby Walsh:
A Social Welfare Optimal Sequential Allocation Procedure. IJCAI 2013: 227-233 - [i6]Serge Gaspers, Thomas Kalinowski, Nina Narodytska, Toby Walsh:
Coalitional Manipulation for Schulze's Rule. CoRR abs/1304.0844 (2013) - [i5]Thomas Kalinowski, Nina Narodytska, Toby Walsh:
A Social Welfare Optimal Sequential Allocation Procedure. CoRR abs/1304.5892 (2013) - [i4]Konrad Engel, Thomas Kalinowski, Martin W. P. Savelsbergh:
Incremental Network Design with Minimum Spanning Trees. CoRR abs/1306.1926 (2013) - [i3]Natashia Boland, Thomas Kalinowski, Reena Kapoor, Simranjit Kaur:
Scheduling unit processing time arc shutdown jobs to maximize network flow over time: complexity results. CoRR abs/1306.4917 (2013) - [i2]Natashia Boland, Thomas Kalinowski, Simranjit Kaur:
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period. CoRR abs/1307.3650 (2013) - [i1]Thomas Kalinowski, Dmytro Matsypura, Martin W. P. Savelsbergh:
Incremental Network Design with Maximum Flows. CoRR abs/1312.6447 (2013) - 2011
- [j9]Thomas Kalinowski
A minimum cost flow formulation for approximated MLC segmentation. Networks 57(2): 135-140 (2011)
2000 – 2009
- 2009
- [j8]Thomas Kalinowski, Antje Kiesel:
Approximated MLC shape matrix decomposition with interleaf collision constraint. Algorithmic Oper. Res. 4(1): 49-57 (2009) - [j7]Martin Grüttmüller, Sven Hartmann, Thomas Kalinowski, Uwe Leck, Ian T. Roberts:
Maximal Flat Antichains of Minimum Weight. Electron. J. Comb. 16(1) (2009) - [j6]Thomas Kalinowski:
A Dual of the Rectangle-Segmentation Problem for Binary Matrices. Electron. J. Comb. 16(1) (2009) - [j5]Thomas Kalinowski
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. 157(9): 2089-2104 (2009) - 2008
- [j4]Thomas Kalinowski:
Reducing the tongue-and-groove underdosage in MLC shape matrix decomposition. Algorithmic Oper. Res. 3(2) (2008) - 2006
- [j3]Thomas Kalinowski
Optimization of Multi-Threshold Circuits. Electron. Notes Discret. Math. 27: 53-54 (2006) - [c2]Thomas Kalinowski
Realization of Intensity Modulated Radiation Fields Using Multileaf Collimators. GTIT-C 2006: 1010-1055 - [c1]Konrad Engel, Thomas Kalinowski
Algorithms for Leakage Reduction with Dual Threshold Design Techniques. SoC 2006: 1-4 - 2005
- [j2]Thomas Kalinowski
A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint. Discret. Appl. Math. 152(1-3): 52-88 (2005) - [j1]Thomas Kalinowski
Realization of intensity modulated radiation fields using multileaf collimator. Electron. Notes Discret. Math. 21: 319-320 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: