2 citations · 2 across the 2 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2010★ 2 cited
Bandwidth and Distortion Revisited
Marek Cygan, Marcin Pilipczuk
In this paper we merge recent developments on exact algorithms for finding an ordering of vertices of a given graph that minimizes bandwidth (the BANDWIDTH problem) and for finding…
cs.DS2010
The stubborn problem is stubborn no more (a polynomial algorithm for 3-compatible colouring and the stubborn list partition problem)
Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk +1
One of the driving problems in the CSP area is the Dichotomy Conjecture, formulated in 1993 by Feder and Vardi [STOC'93], stating that for any fixed relational structure G the Cons…