Graph-Theoretic Concepts in Computer Science

This survey reviews the basic notions of parameterized complexity, and describes some new approaches to designing FPT algorithms and problem reductions for graph problems.

[1]  M. Golumbic.  Algorithmic graph theory and perfect graphs , 1980 .

[2]  W. K. Hale.  Frequency assignment: Theory and applications , 1980, Proceedings of the IEEE.

[3]  Paul G. Spirakis,et al.  Hardness Results and Efficient Appromixations for Frequency Assignment Problems and the Radio Coloring Problem , 2001, Bull. EATCS.

[4]  Mohammad R. Salavatipour,et al.  A bound on the chromatic number of the square of a planar graph , 2005, J. Comb. Theory, Ser. B.

[5]  Jerrold R. Griggs,et al.  Labelling Graphs with a Condition at Distance 2 , 1992, SIAM J. Discret. Math..

[6]  Hajo Broersma,et al.  Stars and bunches in planar graphs. Part II: General planar graphs and colourings , 2002 .

[7]  Hajo Broersma,et al.  Stars and bunches in planar graphs. Part I: Triangulations , 2002 .

[8]  Gerard J. Chang,et al.  The L(2, 1)-Labeling Problem on Graphs , 1996, SIAM J. Discret. Math..

[9]  Eli Upfal,et al.  Efficient routing in all-optical networks , 1994, STOC '94.

[10]  Kumar N. Sivarajan,et al.  Routing and wavelength assignment in all-optical networks , 1995, TNET.

[11]  Aris Pagourtzis,et al.  Routing and Path Multi-Coloring , 2001, Inf. Process. Lett..

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Peng-Jun Wan,et al.  Maximal throughput in wavelength-routed optical networks , 1998, Multichannel Optical Networks: Theory and Practice.

[14]  J. V. D. Heuvel,et al.  Graph labeling and radio channel assignment , 1998 .

[15]  Magnús M. Halldórsson,et al.  Coloring powers of planar graphs , 2000, SODA '00.

[16]  Jan van den Heuvel,et al.  Coloring the square of a planar graph , 2003 .