Raziskovalni matematični seminar
Raziskovalni matematični seminar poteka v organizaciji oddelkov za matematiko dveh članic Univerze na Primorskem - UP FAMNIT in Inštituta Andrej Marušič (UP IAM), in sicer vsak ponedeljek od oktobra do junija.
Vljudno vabljeni k udeležbi na prihodnjih seminarjih!
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!
