Dr Thomas Kalinowski
Conjoint Senior Lecturer
School of Information and Physical Sciences
- Email:thomas.kalinowski@newcastle.edu.au
- Phone:(02) 4921 6558
Career Summary
Biography
Thomas Kalinowski received his PhD in mathematics in 2005 from the University of Rostock (Germany). His thesis under the supervision of Konrad Engel was on optimal treatment planning in radiation therapy. From 2005 to 2010 he worked as a lecturer of mathematics in Rostock, and from 2010 to 2012 as a research fellow in the group of Natashia Boland at the University of Newcastle (Australia). Since July 2013 he is a lecturer in mathematics in Newcastle.
Research ExpertiseI'm working in mathematical optimization in a variety of application contexts, such as the radiation therapy planning or supply chain logistics. This includes the development and analysis of algorithms using integer programming and combinatorial optimization, in particular network optimization. I am also interested in combinatorial and computational aspects of social choice theory.
Teaching Expertise
I have taught a wide range of mathematics courses, but I'm specializing in the interface between discrete and combinatorial optimization and Operations Research.
Administrative Expertise
I'm currently member of the school committee for marketing and outreach.
Collaborations
I am collaborating with Natashia Boland, Konrad Engel, Uwe Leck, Ian Roberts, Martin Savelsbergh, Toby Walsh.
Qualifications
- PhD, Universitat Rostock
Keywords
- Combinatorics
- Discrete Mathematics
- Extremal graph theory
- Operations Research
- Optimization
Languages
- German (Fluent)
Professional Experience
Academic appointment
Dates | Title | Organisation / Department |
---|---|---|
1/3/2012 - 1/6/2013 | Lecturer | University of Rostock Faculty of Science Australia |
Publications
For publications that are currently unpublished or in-press, details are shown in italics.
Chapter (3 outputs)
Year | Citation | Altmetrics | Link | |||||
---|---|---|---|---|---|---|---|---|
2010 | Kalinowski T, 'Multileaf collimator field segmentation', Optimization in Medicine and Biology, Auerbach Publishers Inc., Pennsauken 253-286 (2010) [B2] | |||||||
2008 |
Kalinowski T, 'Multileaf Collimator Shape Matrix Decomposition', Engineering and Management Innovation, Auerbach Publications (2008)
|
|||||||
2008 |
Kalinowski T, 'Multileaf collimator shape matrix decomposition', Optimization in Medicine and Biology 253-286 (2008) The most common approach in treatment planning is to divide the optimization into two phases. At first step, a set of beam angles and corresponding fluence matrices are determined... [more] The most common approach in treatment planning is to divide the optimization into two phases. At first step, a set of beam angles and corresponding fluence matrices are determined. In a second step, a sequence of leaf positions for the MLC for each of the angles is determined that yields the desired fluence distribution. Very recently, there have been attempts to combine both steps into one optimization routine [8, 20].
|
Journal article (40 outputs)
Year | Citation | Altmetrics | Link | ||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
2023 |
Griggs JR, Kalinowski T, Leck U, Roberts IT, Schmitz M, 'The Saturation Spectrum for Antichains of Subsets', Order, 40 537-574 (2023) [C1] Extending a classical theorem of Sperner, we characterize the integers m such that there exists a maximal antichain of size m in the Boolean lattice Bn, that is, the power set of ... [more] Extending a classical theorem of Sperner, we characterize the integers m such that there exists a maximal antichain of size m in the Boolean lattice Bn, that is, the power set of [n] : = { 1 , 2 , ¿ , n} , ordered by inclusion. As an important ingredient in the proof, we initiate the study of an extension of the Kruskal-Katona theorem which is of independent interest. For given positive integers t and k, we ask which integers s have the property that there exists a family F of k-sets with | F| = t such that the shadow of F has size s, where the shadow of F is the collection of (k - 1)-sets that are contained in at least one member of F. We provide a complete answer for t= k+ 1. Moreover, we prove that the largest integer which is not the shadow size of any family of k-sets is 2k3/2+84k5/4+O(k).
|
||||||||||
2021 |
Griggs JR, Hartmann S, Kalinowski T, Leck U, Roberts IT, 'Minimum Weight Flat Antichains of Subsets', ORDER-A JOURNAL ON THE THEORY OF ORDERED SETS AND ITS APPLICATIONS, 38 441-453 (2021) [C1]
|
||||||||||
2021 |
Kalinowski T, Mohammadian S, 'Feasible Bases for a Polytope Related to the Hamilton Cycle Problem', MATHEMATICS OF OPERATIONS RESEARCH, 46 1366-1389 (2021) [C1]
|
Nova | |||||||||
2020 |
Kalinowski T, Matthews J, Waterer H, 'Scheduling of maintenance windows in a mining supply chain rail network', COMPUTERS & OPERATIONS RESEARCH, 115 (2020) [C1]
|
Nova | |||||||||
2020 |
Sundara Rajan R, Kalinowski T, Klavzar S, Mokhtar H, Rajalaxmi TM, 'Lower bounds for dilation, wirelength, and edge congestion of embedding graphs into hypercubes', JOURNAL OF SUPERCOMPUTING, 77 4135-4150 (2020) [C1]
|
||||||||||
2020 |
Eshragh A, Filar JA, Kalinowski T, Mohammadian S, 'Hamiltonian Cycles and Subsets of Discounted Occupational Measures', Mathematics of Operations Research, 45 713-731 (2020) [C1]
|
Nova | |||||||||
2020 |
Gupte A, Kalinowski T, Rigterink F, Waterer H, 'Extended formulations for convex hulls of some bilinear functions', Discrete Optimization, 36 (2020) [C1]
|
Nova | |||||||||
2020 |
Kalinowski T, Ryan J, Wijaya RWN, 'CUBE-MAGIC LABELINGS OF GRIDS', ARS COMBINATORIA, 151 247-256 (2020) [C1]
|
Nova | |||||||||
2019 |
Ferrero D, Kalinowski T, Stephen S, 'Zero forcing in iterated line digraphs', DISCRETE APPLIED MATHEMATICS, 255 198-208 (2019) [C1]
|
Nova | |||||||||
2019 |
Ferrero D, Grigorious C, Kalinowski T, Ryan J, Stephen S, 'Minimum rank and zero forcing number for butterfly networks', JOURNAL OF COMBINATORIAL OPTIMIZATION, 37 970-988 (2019) [C1]
|
Nova | |||||||||
2018 |
Lidén T, Kalinowski T, Waterer H, 'Resource considerations for integrated planning of railway traffic and maintenance windows', Journal of Rail Transport Planning and Management, 8 1-15 (2018) [C1]
|
Nova | |||||||||
2018 |
Davila R, Kalinowski T, Stephen S, 'A lower bound on the zero forcing number', Discrete Applied Mathematics, 250 363-367 (2018) [C1]
|
Nova | |||||||||
2017 |
Boland N, Kalinowski T, Rigterink F, 'A polynomially solvable case of the pooling problem', Journal of Global Optimization, 67 621-630 (2017) [C1]
|
Nova | |||||||||
2017 |
Kalinowski T, Kapoor R, Savelsbergh MWP, 'Scheduling reclaimers serving a stock pad at a coal terminal', Journal of Scheduling, 20 85-101 (2017) [C1]
|
Nova | |||||||||
2017 |
Boland N, Dey S, Kalinowski T, Molinaro M, Rigterink F, 'Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions', Mathematical Programming, 162 523-535 (2017) [C1]
|
Nova | |||||||||
2017 |
Engel K, Kalinowski T, Savelsbergh MWP, 'Incremental Network Design with Minimum Spanning Trees', Journal of Graph Algorithms and Applications, 21 417-432 (2017) [C1]
|
Nova | |||||||||
2017 |
Grigorious C, Kalinowski T, Ryan J, Stephen S, 'The metric dimension of the circulant graph C(n,±1,2,3,4)', Australasian Journal of Combinatorics, 69 417-441 (2017) [C1]
|
Nova | |||||||||
2017 |
Wijaya RWN, Semanicová-Fenovcíková A, Ryan J, Kalinowski T, 'H-supermagic labelings for firecrackers, banana trees and flowers', Australasian Journal of Combinatorics, 69 442-451 (2017) [C1]
|
Nova | |||||||||
2016 |
Angelelli E, Kalinowski T, Kapoor R, Savelsbergh MWP, 'A reclaimer scheduling problem arising in coal stockyard management', Journal of Scheduling, 19 563-582 (2016) [C1] We study a number of variants of an abstract scheduling problem inspired by the scheduling of reclaimers in the stockyard of a coal export terminal. We analyze the complexity of e... [more] We study a number of variants of an abstract scheduling problem inspired by the scheduling of reclaimers in the stockyard of a coal export terminal. We analyze the complexity of each of the variants, providing complexity proofs for some and polynomial algorithms for others. For one, especially interesting variant, we also develop a constant factor approximation algorithm.
|
Nova | |||||||||
2016 |
Boland N, Kalinowski T, Rigterink F, 'New multi-commodity flow formulations for the pooling problem', Journal of Global Optimization, 66 669-710 (2016) [C1]
|
Nova | |||||||||
2016 |
Boland N, Kalinowski T, Kaur S, '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, 32 885-905 (2016) [C1]
|
Nova | |||||||||
2016 | Kalinowski T, Leck U, Reiher C, Roberts IT, 'Minimizing the regularity of maximal regular antichains of 2- and 3-sets', Australasian Journal of Combinatorics, 64 277-288 (2016) [C1] | Nova | |||||||||
2016 |
Boland N, Dumitrescu I, Froyland G, Kalinowski T, 'Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming', Mathematical Programming, 157 69-93 (2016) [C1] We consider multistage stochastic programs, in which decisions can adapt over time, (i.e., at each stage), in response to observation of one or more random variables (uncertain pa... [more] We consider multistage stochastic programs, in which decisions can adapt over time, (i.e., at each stage), in response to observation of one or more random variables (uncertain parameters). The case that the time at which each observation occurs is decision-dependent, known as stochastic programming with endogeneous observation of uncertainty, presents particular challenges in handling non-anticipativity. Although such stochastic programs can be tackled by using binary variables to model the time at which each endogenous uncertain parameter is observed, the consequent conditional non-anticipativity constraints form a very large class, with cardinality in the order of the square of the number of scenarios. However, depending on the properties of the set of scenarios considered, only very few of these constraints may be required for validity of the model. Here we characterize minimal sufficient sets of non-anticipativity constraints, and prove that their matroid structure enables sets of minimum cardinality to be found efficiently, under general conditions on the structure of the scenario set.
|
Nova | |||||||||
2015 |
Kalinowski T, Matsypura D, Savelsbergh MWP, 'Incremental network design with maximum flows', European Journal of Operational Research, 242 51-62 (2015) [C1] We study an incremental network design problem, where in each time period of the planning horizon an arc can be added to the network and a maximum flow problem is solved, and wher... [more] We study an incremental network design problem, where in each time period of the planning horizon an arc can be added to the network and a maximum flow problem is solved, and where the objective is to maximize the cumulative flow over the entire planning horizon. After presenting two mixed integer programming (MIP) formulations for this NP-complete problem, we describe several heuristics and prove performance bounds for some special cases. In a series of computational experiments, we compare the performance of the MIP formulations as well as the heuristics.
|
Nova | |||||||||
2015 |
Boland N, Kalinowski T, Kaur S, 'Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies', Computers and Operations Research, 64 113-129 (2015) [C1]
|
Nova | |||||||||
2014 |
Boland N, Kapoor R, Kaur S, Kalinowski T, 'Scheduling Unit Time Arc Shutdowns to Maximize Network Flow Over Time: Complexity Results', NETWORKS, 63 196-202 (2014) [C1]
|
Nova | |||||||||
2014 |
Boland N, Kalinowski T, Waterer H, Zheng L, 'Scheduling arc maintenance jobs in a network to maximize total flow over time', DISCRETE APPLIED MATHEMATICS, 163 34-52 (2014) [C1]
|
Nova | |||||||||
2014 |
Baxter M, Elgindy T, Ernst AT, Kalinowski T, Savelsbergh MWP, 'Incremental network design with shortest paths', European Journal of Operational Research, (2014) [C1] We introduce a class of incremental network design problems focused on investigating the optimal choice and timing of network expansions. We concentrate on an incremental network ... [more] We introduce a class of incremental network design problems focused on investigating the optimal choice and timing of network expansions. We concentrate on an incremental network design problem with shortest paths. We investigate structural properties of optimal solutions, show that the simplest variant is NP-hard, analyze the worst-case performance of natural greedy heuristics, derive a 4-approximation algorithm, and conduct a small computational study. © 2014 Elsevier B.V. All rights reserved.
|
Nova | |||||||||
2013 |
Kalinowski T, Leck U, Roberts IT, 'Maximal antichains of minimum size', Electronic Journal of Combinatorics, 20 1-14 (2013) [C1]
|
Nova | |||||||||
2013 |
Boland N, Kalinowski T, Waterer H, Zheng L, 'Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain', JOURNAL OF SCHEDULING, 16 649-659 (2013) [C1]
|
Nova | |||||||||
2005 |
Kalinowski T, 'A duality based algorithm for multileaf collimator field segmentation with interleaf collision constraint', DISCRETE APPLIED MATHEMATICS, 152 52-88 (2005)
|
||||||||||
2005 |
Kalinowski T, 'Reducing the number of monitor units in multileaf collimator field segmentation', PHYSICS IN MEDICINE AND BIOLOGY, 50 1147-1161 (2005)
|
||||||||||
2000 |
Kalinowski T, Schulz HJ, Briese M, 'Cooperation in the Minority Game with local information', PHYSICA A, 277 502-508 (2000)
|
||||||||||
Show 37 more journal articles |
Conference (21 outputs)
Year | Citation | Altmetrics | Link | |||||
---|---|---|---|---|---|---|---|---|
2019 |
Charkhgard P, Kalinowski T, Waterer H, 'The network maintenance problem on an arc with uncapacitated repair', MODSIM2019, 23rd International Congress on Modelling and Simulation., Canberra, ACT (2019) [E1]
|
Nova | ||||||
2019 | Eskandarzadeh S, Kalinowski T, Waterer H, 'Maintenance scheduling in a railway corricdor.', CoRR (2019) | |||||||
2018 |
Grigorious C, Kalinowski T, Stephen S, 'On the Power Domination Number of de Bruijn and Kautz Digraphs', Combinatorial Algorithms. 28th International Workshop, IWOCA 2017, Revised Selected Papers, Newcastle, NSW (2018) [E1]
|
Nova | ||||||
2017 |
Charkhgard P, Kalinowski T, Waterer HAR, 'The network maintenance problem', MODSIM2017, 22nd International Congress on Modelling and Simulation, Hobart, Tas (2017) [E1]
|
Nova | ||||||
2017 | Eskandarzadeh S, Kalinowski T, Waterer HAR, 'Maintenance scheduling in a railway corridor', MODSIM2017 22nd International Congress on Modelling and Simulation, Hobart, TAS (2017) [E1] | Nova | ||||||
2016 |
Aziz H, Kalinowski T, Walsh T, Xia L, 'Welfare of Sequential Allocation Mechanisms for Indivisible Goods', Frontiers in Artificial Intelligence and Applications, Th Hague, Netherlands (2016) [E1]
|
Nova | ||||||
2015 |
Boland N, Kalinowski T, Rigterink F, 'Discrete flow pooling problems in coal supply chains', Proceedings of MODSIM2015: 21st International Congress on Modelling and Simulation, Gold Coast, Qld (2015) [E1]
|
Nova | ||||||
2015 | Boland N, Kalinowski T, Rigterink F, Savelsbergh M, 'A special case of the generalized pooling problem arising in the mining industry', ASOR Recent Advances in Operations Research, The University of Newcastle, Australia (2015) [E3] | |||||||
2013 |
Kalinowski T, Narodytska N, Walsh T, Xia L, 'Strategic Behavior when Allocating Indivisible Goods Sequentially', Proceedings of the twenty-seventh AAAI conference on artificial intelligence, Bellevue, Washington, USA (2013) [E1]
|
Nova | ||||||
2013 | Boland NL, Kaur S, Kalinowski T, Kapoor R, 'Scheduling unit processing time arc shutdown jobs to maximize network flow over time', Proceedings of the 49th ANZIAM Conference, Newcastle, NSW (2013) [E3] | Nova | ||||||
2013 |
Boland N, Ernst A, Kalinowski T, Rocha de Paula M, Savelsbergh M, Singh G, 'Time Aggregation for Network Design to Meet Time-Constrained Demand', MODSIM2013, 20th International Congress on Modelling and Simulation, Adelaide, SA (2013) [E1]
|
Nova | ||||||
2013 |
Kalinowski T, Narodytska N, Walsh T, 'A Social Welfare Optimal Sequential Allocation Procedure.', Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence, Beijing, China (2013) [E1]
|
Nova | ||||||
2012 | Baxter M, Elgindy T, Ernst A, Kalinowski T, Savelsbergh MW, 'Incremental network design with shortest paths', 5th International Workshop on Freight Transportation and Logistics. Extended Abstracts, Mykonos, Greece (2012) [E3] | |||||||
2011 |
Boland NL, Kalinowski T, Waterer H, Zheng L, 'An optimisation approach to maintenance scheduling for capacity alignment in the Hunter Valley coal chain', Proceedings of the 35th Application of Computers and Operations Research in the Minerals Industry Symposium, Wollongong, NSW (2011) [E1]
|
|||||||
2006 |
Kalinowski T, 'Optimization of Multi-Threshold Circuits', Electronic Notes in Discrete Mathematics (2006)
|
|||||||
2006 |
Engel K, Kalinowski T, Labahn R, Sill F, Timmermann D, 'Algorithms for leakage reduction with dual threshold design techniques', 2006 INTERNATIONAL SYMPOSIUM ON SYSTEM-ON-CHIP PROCEEDINGS, Tampere, FINLAND (2006)
|
|||||||
2006 |
Kalinowski T, 'Realization of intensity modulated radiation fields using multileaf collimators', General Theory of Information Transfer and Combinatorics, Univ Bielefeld, Bielefeld, GERMANY (2006)
|
|||||||
Show 18 more conferences |
Other (1 outputs)
Year | Citation | Altmetrics | Link | |||||
---|---|---|---|---|---|---|---|---|
2005 |
Kalinowski T, 'Realization of intensity modulated radiation fields using multileaf collimator', ( pp.319-320) (2005)
|
Preprint (1 outputs)
Year | Citation | Altmetrics | Link |
---|---|---|---|
2019 | Kalinowski T, Mohammadian S, 'Feasible bases for a polytope related to the Hamilton cycle problem. (2019) |
Thesis / Dissertation (2 outputs)
Year | Citation | Altmetrics | Link |
---|---|---|---|
2014 | Kalinowski T, Kalinowski T, Applications of mathematical network theory, Universität Rostock (2014) | ||
2005 | Kalinowski T, Optimal multileaf collimator field segmentation, Universität Rostock (2005) |
Grants and Funding
Summary
Number of grants | 9 |
---|---|
Total funding | $2,092,608 |
Click on a grant title below to expand the full details for that specific grant.
20163 grants / $136,720
Pacific National Haulage Project$62,520
Funding body: Pacific National
Funding body | Pacific National |
---|---|
Project Team | Doctor Hamish Waterer, Professor Richard Bush, Doctor Thomas Kalinowski |
Scheme | Research Grant |
Role | Investigator |
Funding Start | 2016 |
Funding Finish | 2016 |
GNo | G1601141 |
Type Of Funding | C3100 – Aust For Profit |
Category | 3100 |
UON | Y |
Entrepreneurs Programme: Automated planning of the Koppers Inventory Routing Problem$37,100
Funding body: Department of Industry, Innovation and Science
Funding body | Department of Industry, Innovation and Science |
---|---|
Project Team | Doctor Hamish Waterer, Doctor Thomas Kalinowski |
Scheme | Entrepreneurs' Programme: Innovation Connections |
Role | Investigator |
Funding Start | 2016 |
Funding Finish | 2016 |
GNo | G1601320 |
Type Of Funding | C2100 - Aust Commonwealth – Own Purpose |
Category | 2100 |
UON | Y |
Entrepreneurs Programme: Automated planning of the Koppers Inventory Routing Problem$37,100
Funding body: Koppers Australia Pty Ltd
Funding body | Koppers Australia Pty Ltd |
---|---|
Project Team | Doctor Hamish Waterer, Doctor Thomas Kalinowski |
Scheme | Entrepreneurs' Programme: Innovation Connections |
Role | Investigator |
Funding Start | 2016 |
Funding Finish | 2016 |
GNo | G1700295 |
Type Of Funding | C3100 – Aust For Profit |
Category | 3100 |
UON | Y |
20143 grants / $1,005,888
Maintenance Optimisation in Rail Infrastructure Systems for Coal and Iron Ore Exports$592,729
Funding body: ARC (Australian Research Council)
Funding body | ARC (Australian Research Council) |
---|---|
Project Team | Doctor Thomas Kalinowski, Associate Professor Yangfeng Ouyang, Steve Straughan, Doctor Ali Eshragh, Mr Michael Backhouse, Professor Natashia Boland, Moffiet, Chad, Associate Professor Yangfeng Ouyang, Professor Mathieu Savelsbergh |
Scheme | Linkage Projects |
Role | Investigator |
Funding Start | 2014 |
Funding Finish | 2017 |
GNo | G1301225 |
Type Of Funding | Aust Competitive - Commonwealth |
Category | 1CS |
UON | Y |
Maintenance Optimisation in Rail Infrastructure Systems for Coal and Iron Ore Exports$408,159
Funding body: Aurizon Network Pty Ltd
Funding body | Aurizon Network Pty Ltd |
---|---|
Project Team | Doctor Thomas Kalinowski, Professor Mathieu Savelsbergh, Professor Natashia Boland, Professor Mathieu Savelsbergh, Professor Natashia Boland, Associate Professor Yangfeng Ouyang, Associate Professor Yangfeng Ouyang, Moffiet, Chad, Steve Straughan, Doctor Ali Eshragh, Ouyang, Yanfeng, Mr Chad Moffiet |
Scheme | Linkage Projects Partner Funding |
Role | Investigator |
Funding Start | 2014 |
Funding Finish | 2017 |
GNo | G1301276 |
Type Of Funding | C3100 – Aust For Profit |
Category | 3100 |
UON | Y |
Integrated network design and scheduling$5,000
Funding body: University of Newcastle
Funding body | University of Newcastle |
---|---|
Project Team | Doctor Thomas Kalinowski |
Scheme | New Staff Grant |
Role | Lead |
Funding Start | 2014 |
Funding Finish | 2014 |
GNo | G1400299 |
Type Of Funding | Internal |
Category | INTE |
UON | Y |
20113 grants / $950,000
Mathematics and Computing for Integrated Stockyard-centric Management of Mining Supply Chains$560,000
Funding body: ARC (Australian Research Council)
Funding body | ARC (Australian Research Council) |
---|---|
Project Team | Doctor Thomas Kalinowski, Conjoint Professor Natashia Boland, Professor Peter Stuckey, Doctor Alexandre Mendes, Doctor Faramroze Engineer, Professor Martin Savelsbergh, Dr Andreas Ernst |
Scheme | Linkage Projects |
Role | Lead |
Funding Start | 2011 |
Funding Finish | 2014 |
GNo | G1000957 |
Type Of Funding | Aust Competitive - Commonwealth |
Category | 1CS |
UON | Y |
Mathematics and Computing for Integrated Stockyard-centric Management of Mining Supply Chains$260,000
Funding body: Hunter Valley Coal Chain Coordinator Limited
Funding body | Hunter Valley Coal Chain Coordinator Limited |
---|---|
Project Team | Conjoint Professor Natashia Boland, Professor Peter Stuckey, Doctor Alexandre Mendes, Doctor Faramroze Engineer, Professor Martin Savelsbergh, Dr Andreas Ernst, Doctor Thomas Kalinowski |
Scheme | Linkage Projects Partner Funding |
Role | Lead |
Funding Start | 2011 |
Funding Finish | 2013 |
GNo | G1001065 |
Type Of Funding | Grant - Aust Non Government |
Category | 3AFG |
UON | Y |
Mathematics and Computing for Integrated Stockyard-centric Management of Mining Supply Chains$130,000
Funding body: Triple Point Australia
Funding body | Triple Point Australia |
---|---|
Project Team | Conjoint Professor Natashia Boland, Professor Peter Stuckey, Doctor Alexandre Mendes, Doctor Faramroze Engineer, Professor Martin Savelsbergh, Dr Andreas Ernst, Doctor Thomas Kalinowski |
Scheme | Linkage Projects Partner Funding |
Role | Lead |
Funding Start | 2011 |
Funding Finish | 2013 |
GNo | G1001080 |
Type Of Funding | C3100 – Aust For Profit |
Category | 3100 |
UON | Y |
Research Supervision
Number of supervisions
Past Supervision
Year | Level of Study | Research Title | Program | Supervisor Type |
---|---|---|---|---|
2020 | PhD | On the Structure of Polytopes Related to the Hamilton Cycle Problem | PhD (Statistics), College of Engineering, Science and Environment, The University of Newcastle | Principal Supervisor |
2020 | PhD | The Network Maintenance Problem | PhD (Mathematics), College of Engineering, Science and Environment, The University of Newcastle | Co-Supervisor |
2018 | Masters | Advances in Graph Labelings | M Philosophy (Mathematics), College of Engineering, Science and Environment, The University of Newcastle | Principal Supervisor |
2018 | PhD | Zero Forcing and Power Domination in Graphs | PhD (Mathematics), College of Engineering, Science and Environment, The University of Newcastle | Co-Supervisor |
2017 | PhD | Pooling Problems: Advances in Theory and Applications | PhD (Mathematics), College of Engineering, Science and Environment, The University of Newcastle | Principal Supervisor |
2017 | PhD | Graph Labeling Techniques | PhD (Mathematics), College of Engineering, Science and Environment, The University of Newcastle | Co-Supervisor |
2017 | PhD | Resolvability of Graphs | PhD (Mathematics), College of Engineering, Science and Environment, The University of Newcastle | Co-Supervisor |
2015 | PhD | Scheduling Problems Arising in Coal Export Supply Chains: Algorithms and Complexity | PhD (Mathematics), College of Engineering, Science and Environment, The University of Newcastle | Co-Supervisor |
2015 | PhD | Arc Shutdown Scheduling in a Capacitated Network to Maximize Flow Over Time | PhD (Mathematics), College of Engineering, Science and Environment, The University of Newcastle | Co-Supervisor |
Dr Thomas Kalinowski
Position
Conjoint Senior Lecturer
School of Information and Physical Sciences
College of Engineering, Science and Environment
Contact Details
thomas.kalinowski@newcastle.edu.au | |
Phone | (02) 4921 6558 |
Fax | (02) 4921 6898 |
Office
Room | V32 |
---|---|
Building | Mathematics Building |
Location | Callaghan University Drive Callaghan, NSW 2308 Australia |