Marek Karpinski Approximating Bounded Degree Instances of NP-Hard Problems. 24-34 2001 conf/fct/2001 FCT http://link.springer.de/link/service/series/0558/bibs/2138/21380024.htm db/conf/fct/fct2001.html#Karpinski01