Raziskovalni matematični seminar - Arhiv
| 2025 | 2024 | 2023 | 2022 | 2021 | 2020 | 2019 | 2018 | 2017 | 2016 | 2015 | 2014 | 2013 | 2012 | 2011 | 2010 |
| 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12 |
Datum in ura / Date and time: 24.7.25
(15:00-- 16:00)
Predavalnica / Location: FAMNIT-MP1
Predavatelj / Lecturer: Hans Bodlaender (Utrecht University)
Naslov / Title: Concurrency Constrained Scheduling with Tree-Like Constraints
Vsebina / Abstract:
In this talk, Prof. Bodlaender will present versions of graph coloring inspired by scheduling problems. Each vertex of a conflict graph represents a job, and edges indicate conflicts requiring jobs to be scheduled at different times. Starting from classical graph coloring (unit-length jobs), the talk will explore several generalizations involving variable job lengths, release times, deadlines, and weighted completion times. The focus will be on the computational complexity of these problems, particularly when the conflict graph has bounded pathwidth or treewidth. This is joint work with Danny Hermelin and Erik Jan van Leeuwen.
Everyone is warmly welcome!
