# Discrete Applied Mathematics

Discrete Applied Mathematics > 1996 > 66 > 3 > 255-270

Discrete Applied Mathematics > 1996 > 70 > 1 > 1-21

Discrete Applied Mathematics > 1997 > 73 > 2 > 175-189

Discrete Applied Mathematics > 1997 > 75 > 3 > 277-284

Discrete Applied Mathematics > 1998 > 83 > 1-3 > 263-278

Discrete Applied Mathematics > 2000 > 104 > 1-3 > 3-44

Discrete Applied Mathematics > 2001 > 115 > 1-3 > 187-198

Discrete Applied Mathematics > 2002 > 121 > 1-3 > 155-180

^{2}

^{.}

^{3}

^{7}

^{6}) algorithm for recognizing claw-free AT-free graphs and a linear-time algorithm for computing the set of all central vertices of a claw-free AT-free graph. In addition, we give efficient algorithms that solve the problems INDEPENDENT SET, DOMINATING SET, and COLORING. We argue that all running times achieved are optimal unless better algorithms...

Discrete Applied Mathematics > 2002 > 123 > 1-3 > 447-472

Discrete Applied Mathematics > 2003 > 126 > 1 > 83-113

Discrete Applied Mathematics > 2004 > 145 > 1 > 117-125

Discrete Applied Mathematics > 2005 > 145 > 2 > 183-197

Discrete Applied Mathematics > 2006 > 154 > 3 > 525-536

Discrete Applied Mathematics > 2007 > 155 > 3 > 337-355

Discrete Applied Mathematics > 2009 > 157 > 14 > 3069-3085

Discrete Applied Mathematics > 2010 > 158 > 2 > 123-135

Discrete Applied Mathematics > 2010 > 158 > 7 > 809-819

Discrete Applied Mathematics > 2012 > 160 > 13-14 > 1901-1913

Discrete Applied Mathematics > 2013 > 161 > 6 > 847-852