366 citations · 1.4k across the 75 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
math.CO2009★ 1 cited
Some Probabilistic Results on Width Measures of Graphs
Jakub Marecek
Fixed parameter tractable (FPT) algorithms run in time f(p(x)) poly(|x|), where f is an arbitrary function of some parameter p of the input x and poly is some polynomial function.…
cs.DS2009★ 81 cited
Decomposition, Reformulation, and Diving in University Course Timetabling
Edmund K. Burke, Jakub Marecek, Andrew J. Parkes +1
In many real-life optimisation problems, there are multiple interacting components in a solution. For example, different components might specify assignments to different kinds of…