%
%         THE PAPERS
%
%
%

%A

%Aa

@article{AardalHLT02,
author = {K. I. Aardal and C. A. J. Hurkens and J. K. Lenstra and S. R. Tiourine},
title = {Algorithms for radio link frequency assignment: The {CALMA} project},
journal = or, volume = 50, year = 2003, number = 6, pages = {968 - 980}}

@article{AardalHKMS03,
author = {K. Aardal and C. van Hoesel and A. Koster and C. Mannino and A.  Sassano},
title = {Models and solution techniques for the frequency assignment problem},
journal = {4OR}, volume = 1, year = 2003, pages = {261-317}}

%Ab

%Abd

@article{AbdelbarH98,
author = {A.M. Abdelbar and S.M. Hedetniemi},
title = {Approximating {MAP}s for belief networks is {NP}-hard and other theorems}, 
journal = artint, volume = 102, year = 1998, pages = {21-38}}

%Abr

%Abrahamson89

@article{AbrahamsonDKP89,
author = {Karl R. Abrahamson and N. Dadoun and D. G. Kirkpatrick and T. Przytycka},
title = {A simple parallel tree contraction algorithm},
journal = ja, volume = 10, year = 1989, pages = {287-302}}

@inproceedings{AbrahamsonEFM89,
author = {Karl R. Abrahamson and John A. Ellis and Michael R. Fellows and Manuel E. Mata},
title = {On the Complexity of Fixed-Parameter Problems},
booktitle = focs89, year = 1989, pages = {210-215}}

@inproceedings{AbrahamsonFLM89,
author = {Karl R. Abrahamson and Michael R. Fellows and Michael A. Langston and B. M. E. Moret},
title = {Constructive Complexity},
year = 1989,
booktitle = {Proceedings of the Capital City Conference on Combinatorics and Theoretical Computer Science}}

%Abrahamson90

@techreport{AbrahamsonEFM90,
author = {Karl R. Abrahamson and John A. Ellis and Michael R. Fellows and Manuel E. Mata},
title = {Completeness for Families of Fixed Parameter Problems},
institution = {University of Victoria},
address = {Victoria, B.C., Canada},
number = {DCS-141-IR},
year = 1990,
note = {Extended abstract in Proc. 30th ACM Foundations of Computer Science, 1989, p. 210-215}}

%Abrahamson93

@inproceedings{AbrahamsonDF93,
author = {Karl R. Abrahamson and Rodney G. Downey and Michael R. Fellows},
title = {Fixed-parameter intractability {II}},
editor = {Patrice Enjalbert and Alain Finkel and Klaus W. Wagner},
booktitle = stacs93, year = 1993, publisher = lncs665, pages = {374-385}}

@inproceedings{AbrahamsonF93,
author = {Karl R. Abrahamson and Michael R. Fellows},
title = {Finite Automata, Bounded Treewidth and Well-Quasiordering},
year = 1993,
editor = {N. Robertson and P. Seymour},
booktitle = {Proceedings of the AMS Summer Workshop on Graph Minors, Graph Structure Theory, Contemporary Mathematics vol. 147},
publisher = {American Mathematical Society}, pages = {539-564}}

%Abrahamson95

@article{AbrahamsonDF95,
author = {Karl A. Abrahamson and Rodney G. Downey and Michael R. Fellows},
title = {Fixed-Parameter Tractability and Completeness {IV}: On Completeness for {$W[P]$} and {PSPACE} Analogues},
journal = apal, volume = 73, year = 1995, pages = {235-276}}

@article{Abramson89,
author = {Bruce Abramson},
title = {Control strategies for two-player games},
journal = acmcs, volume = 21, year = 1989, pages = {137-162}}

%Abu

@article{AbuKhzamL07,
author = {Faisal N. Abu-Khzam and Michael A. Langston},
title = {Linear-time algorithms for problems on planar graphs with fixed disk dimension},
journal = ipl, volume = 101, year = 2007, pages = {36-40}}

@inproceedings{AbuKhzamCFLSS04,
author = {Faisal N. Abu-Khzam and R. L. Collins and Michael R. Fellows and Michael A. Langston and
W. Henry Suters and C. T. Symons},
title = {Kernelization algorithms for the Vertex Cover problem: Theory and experiments},
booktitle = alenex04, pages = {62-69}, publisher = {ACM-SIAM}, year = 2004}

@inproceedings{AbuKhzamLS05,
author = {Faisal N. Abu-Khzam and Michael A. Langston and W. Henry Suters},
title = {Fast, effective vertex cover kernelization: a tal of two algorithms},
booktitle = {Proceedings of the IEEE International Conference on Computer Systems and Applications, AICCSA 2005},
year = 2005, pages = 16}

@article{AbuKhzamFLS07,
author = {Faisal N. Abu-Khzam and Michael R. Fellows and Michael A. Langston and W. Henry Suters},
title = {Crown structures for vertex cover kernelization},
journal = tocs, volume = 41, year = 2007, pages = {411-430}}

%Ad

%Ada

@inproceedings{AdachiIK81,
author = {A. Adachi and S. Iwata and T. Kasai},
title = {Low level complexity for combinatorial games},
booktitle = stoc81, year = 1981, pages = {228-237}, publisher = {Assoc. Comp. Mach.},
address = {New York}}

@article{AdachiIK84,
author = {A. Adachi and S. Iwata and T. Kasai},
title = {Some combinatorial game problems require {$\Omega (n^k) $} time},
journal = jacm, volume = 31, year = 1984, pages = {361-376}}

@article{AdachiIK87,
author = {A. Adachi and S. Iwata and T. Kasai},
title = {Shogi on $n \times n$ board is complete in exponential time ({I}n {J}apanese)},
journal = {Trans. IEICE}, volume = {J70-D}, year = 1987, pages = {1843-1852}}

%Adh

@article{AdharP90,
author = {Gur Saran Adhar and Shietung Peng},
title = {Parallel algorithms for cographs and parity graphs with applications},
journal = ja, volume = 11, year = 1990, pages = {252-284}}

%Adl

@article{Adler04,
author = {Isolde Adler},
title = {Marshals, monotone marshals, and hypertree-width},
journal = jgt, volume = 47, year = 2004, pages = {275-296}}

@article{Adler07,
author = {Isolde Adler},
title = {Directed tree-width examples},
journal = jctb, volume = 97, year = 2007, pages = {718-725}}

%Ag

%Aga

@article{AgarwalKS98,
author = {P. K. Agarwal and M. {van Kreveld} and S. Suri},
title = {Label placement by maximum independent set in rectangles},
journal = cg, volume = 11, year = 1998, pages = {209-218}}

@inproceedings{AgarwalaF93,
author = {Richa Agarwala and David Fern{\'a}ndez-Baca},
title = {A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed},
booktitle = focs93, year = 1993, pages = {140-147}}

@inproceedings{AgarwalaFS92,
author = {Richa Agarwala and David Fern{\'a}ndez-Baca and G. Slutzki},
title = {Fast algorithms for inferring evolutionary trees},
booktitle = {Proceedings of the 30th Alllerton Conference on Comm., Control, and Comput.},
year = 1992, pages = {594-603}}

%Age

@unpublished{Ageev99,
author = {A. A. Ageev},
title = {Approximation schemes for the planar graph cases of feedback vertex set and uncapacitated facility location},
year = 1999,
note = {Unpublished manuscript}}

%Agg

@article{AggarwalKLLW91,
author = {A. Aggarwal and M. Klawe and D. Lichtenstein and N. Linial and A. Wigderson},
title = {A lower bound on the area of permutation layents},
journal = alg, volume = 6, year = 1991, pages = {241-255}}

@article{AggarwalKS91,
author = {A. Aggarwal and M. Klawe and P. Shor},
title = {Multilayer grid embeddings in {VLSI}},
journal = alg, volume = 6, year = 1991, pages = {129-151}}

%Agr

@incollection{AgrawalKR93,
author = {Ajir Agrawal and Philip N. Klein and R. Ravi},
title = {Cutting down on fill using nested dissection: provably good elimination orderings},
booktitle = {Graph Theory and Sparse Matrix Computation},
editor = {A. George and J. Gilbert and J. W. H. Liu},
series = {IMA Volumes in Mathematics and its Applicatins},
publisher = {Springer-Verlag}, year = 1993, volume = 56, pages = {31-55}}

%Ah

%Aho

@book{AhoHU74,
author = {A. V. Aho and J. E. Hopcroft and J. D. Ullman},
title = {The Design and Analysis of Computer Algorithms},
year = 1974, publisher = {Addison-Wesley}}

%Ahu

@book{AhujaMO93,
author = {R. K. Ahuja and T. L. Magnanti and J. B. Orlin},
title = {Network Flows: Theory, Algorithms, and Applications},
address = {Upper Saddle River, NJ, USA},
publisher = {Prentice Hall}, year = 1993}

%Ai

@article{AignerF84,
author = {M. Aigner and M. Fromme},
title = {A game of cops and robbers},
journal = dam, volume = 8, year = 1984, pages = {1-12}}

%Ak

@article{AkiyamaNS80,
author = {T. Akiyama and Takao Nishizeki and N. Saito},
title = {{NP}-completeness of the {H}amiltonian cycle problem for bipartite graphs},
journal = jip, volume = 3, year = 1980, pages = {73-76}}

@article{AkiyamaEH83,
author = {Jin Akiyama and Hiroski Era and Frank Harary},
title = {Regular graphs containing a given graph},
journal = elemmath, volume = 83, year = 1983, pages = {15-17}}

%Al

%Alb

%Alber 2001

@article{AlberFN01,
author = {Jochen Alber and Henning Fernau and Rolf Niedermeier},
title = {Parameterized complexity: {E}xponential speed-up for planar graph problems},
journal = {Electronic Colloquium on Computational Complexity (ECCC)},
year = 2001}

@inproceedings{AlberFN01a,
author = {Jochen Alber and Henning Fernau and Rolf Niedermeier},
title = {Parameterized complexity: exponential speed-up for planar graph problems}, 
editor = {Fernando Orejas and Paul G. Spirakis and Jan van Leeuwen},
booktitle = icalp01, publisher = lncs2076, year = 2001, pages = {261-272}}

@article{AlberGN01,
author = {Jochen Alber and J. Gramm and Rolf Niedermeier},
title = {Faster exact algorithms for hard problems: {A} parameterized point of view},
journal = dm, volume = 229, year = 2001, pages = {3-27}}

%Alber 2002

@phdthesis{Alber02,
author = {Jochen Alber},
title = {Exact Algorithms for {NP}-hard Problems on Networks: Design, Analysis, and Implementation},
year = 2002, school = {Universit\"at T\"ubingen},
address = {T\"ubingen, Germany}}

@article{AlberBFKN02,
author = {Jochen Alber and Hans L. Bodlaender and Henning Fernau and Ton Kloks and Rolf Niedermeier},
title = {Fixed parameter algorithms for dominating set and related problems on planar graphs},
journal = alg, volume = 33, year = 2002, pages = {461-493}}

@inproceedings{AlberN02,
author = {Jochen Alber and Rolf Niedermeier},
title = {Improved tree decomposition based algorithms for domination-like problems},
editor = {Sergio Rajsbaum},
booktitle = latin02, publisher = lncs2286, year = 2002, pages = {613-627}}

%Alber 2003

@article{AlberFN03,
author = {Jochen Alber and Henning Fernau and Rolf Niedermeier},
title = {Graph separators: A parameterized view},
journal = jcss, volume = 67, year = 2003, pages = {808-832}}

%Alber 2004

@article{AlberDN04,
author = {Jochen Alber and F. Dorn and Rolf Niedermeier},
title = {Experimental evaluation of a tree decomposition based algorithm for vertex cover on planar graphs},
journal = dam, volume = 145, pages = {210-219}, year = 2005}

@article{AlberFN04,
author = {Jochen Alber and Michael R. Fellows and Rolf Niedermeier},
title = {Polynomial-time data reduction for dominating sets},
journal = jacm, volume = 51, year = 2004, pages = {363-384}}

@article{AlberFN04a,
author = {Jochen Alber and Henning Fernau and Rolf Niedermeier},
title = {Parameterized complexity: Exponential speed-up for planar graph problems},
journal = ja, volume = 52, year = 2004, pages = {26-56}}

%Alber 2005

@article{AlberFFFNRS05,
author = {J. Alber and H. Fan and M. R. Fellows and H. Fernau and R. Niedermeier and F. A. Rosamond and U. Stege},
title = {A refined search tree technique for dominating set on planar graphs},
journal = jcss, volume = 71, year = 2005, pages = {385-405}}

%Alber 2006

@article{AlberBN06,
author = {J. Alber and N. Betzler and R. Niedermeier},
title = {Experiments in data reduction for optimal domination in networks},
journal = aor, volume = 146, year = 2006, pages = {105-117}}

@inproceedings{AlberDN06,
author = {Jochen Alber and Britta Dorn and Rolf Niedermeier},
title = {A general data reduction scheme for domination in graphs},
editor = {Jir\'{\i} Wiedermann and Gerard Tel and Jaroslav Pokorn{\'y} and M{\'a}ria Bielikov{\'a} and Julius Stuller},
booktitle = sofsem06, year = 2006, publisher = lncs3831, pages = {137-147}}

%All

@article{AllanL78,
author = {R. B. Allan and R. C. Laskar},
title = {On domination and independent domination number of graphs},
journal = dm, volume = 23, year = 1978, pages = {73-76}}

%Als

@article{AlspachDHY08,
author = {Brian Alspach and Danny Dyer and Denis Hanson and Boting Yang},
title = {Time constrained graph searching},
journal = tcs, volume = 399, year = 2008, pages = {158-168}}

@article{AlstrupLT00,
author = {S. Alstrup and P. W. Lauridsen and M. Thorup},
title = {Generalized dominators for structured programs},
journal = alg, volume = 27, pages = {244-253}, year = 2000}

%Alt

@inproceedings{AltBKRT07,
author = {Helmut Alt and Hans L. Bodlaender and Marc van Kreveld and G\"{u}nther Rote and Gerard Tel},
title = {Wooden Geometric Puzzles: {D}esign and Hardness Proofs},
editor = {Pierluigi Crescenzi and Giuseppe Prencipe and Geppino Pucci},
booktitle = {Proceedings 4th International Conference on Fun with Algorithms, FUN 2007},
publisher = lncs4475, year = 2007, pages = {16 - 29}}


%Alo

%Alon 1986

@article{AlonBI86,
author = {Noga Alon and L. Babai and A. Itai},
title = {A fast and simple randomized parallel algorithm for the maximal independent set problem},
journal = ja, volume = 7, year = 1986, pages = {567-583}}

%Alon 1989

@techreport{AlonST89,
author = {Noga Alon and Paul D. Seymour and Robin Thomas},
title = {A separator theorem for non-planar graphs},
year = 1989, institution = {DIMACS}, type = {Technical Report},
number = {89-18}, pages = {1-9}, month = {Nov.}}

%Alon 1990

@inproceedings{AlonST90,
author = {Noga Alon and Paul D. Seymour and Robin Thomas},
title = {A separator theorem for graphs with an excluded minor and applications},
booktitle = stoc90, publisher = {ACM Press}, year = 1990,
address = {New York}}

@article{AlonST90a,
author = {Noga Alon and Paul D. Seymour and Robin Thomas},
title = {A separator theorem for non-planar graphs},
journal = jacm, volume = 3, year = 1990, pages = {801-808}}

%Alon 1994

@article{AlonST94,
author = {Noga Alon and Paul D. Seymour and Robin Thomas},
title = {Planar separators},
journal = sjdm, volume = 7, year = 1994, pages = {184-193}}

%Alon 2002

@article{AlonHL02,
author = {N. Alon and S. Hoory and N. Linial},
title = {The {M}oore bound for irregular  graphs},
journal = gc, volume = 18, year = 2002, pages = {53-57}}

%Alon 2009

@article{AlonG09,
author = {Noga Alon and Shai Gutner},
title = {Linear time algorithms for finding a dominating set of fixed size in degenerate graphs},
journal = alg, volume = 54, year = 2009, pages = {544-556}}

@article{AlonS09,
author = {Noga Alon and Uri Stav},
title = {Hardness of edge-modification problems},
journal = tcs, volume = 410, year = 2009, pages = {4920-4927}}

%Am

%Ame

@article{AmestoyDD96,
author = {Patrick R. Amestoy and Timothy A. Davis and Iain S. Duff},
title = {An Approximate Minimum Degree Ordering Algorithm},
journal = sjmaa, volume = 17, year = 1996, pages = {886-905}}

%Ami

@inproceedings{Amir01,
author = {E. Amir},
title = {Efficient approximation for triangulation of minimum treewidth},
editor = {Jack S. Breese and Daphne Koller},
booktitle = uai01, pages = {7-15}, year = 2001, publisher = {Morgan Kaufmann}}

@article{Amir10,
author = {E. Amir},
title = {Approximation algorithms for treewidth},
journal = alg, volume = 56, year = 2010, pages = {448-479}}

%An

%And

@article{Andrea84,
author = {T. Andrea},
title = {Note on a pursuit game played on graphs},
year = 1984, journal = dam, volume = 9, pages = {111-115}}

@article{Andrea86,
author = {T. Andrea},
title = {On a pursuit game played on graphs for which a minor is excluded},
year = 1986, journal = jctb, volume = 41, pages = {37-47}}

@article{Andres06,
author = {Stephan Dominique Andres},
title = {The game chromatic index of forests of maximum degree},
journal = dam, volume = 154, year = 2006, pages = {1317-1323}}

@article{Andrzejak98,
author = {A. Andrzejak},
title = {An algorithm for the {T}utte polynomials of graphs of bounded treewidth},
journal = dm, volume = 190, year = 1998, pages = {39-54}}

%Ans

@article{Anstee85,
author = {R. P. Anstee},
title = {An algorithmic proof of {T}utte's $f$-factor theorem},
journal = ja, volume = 6, year = 1985, pages = {112-131}}

%Ap

%Apo

@article{ApostolicoH87,
author = {Alberto Apostolico and Susanne E. Hambrusch},
title = {Finding maximum cliques on circular-arc graphs},
journal = ipl, volume = 26, year = 1987, pages = {209-215}}

%App

@article{AppelH77,
author = {K. Appel and W. Haken},
title = {Every planar map is 4-colorable},
journal = {Illinois Journal of Mathematics}, volume = 21, year = 1977, pages = {429-567}}

@inproceedings{AppelgateBCC98,
author = {D. Appelgate and B. Bixby and V. CHv{\'{a}}tal and W. Cook},
title = {On the solution of travelling salesman problems},
booktitle = {Proceedings of the International Congress of Mathematicians},
volume = {III}, address = {Berlin}, year = 1998, pages = {645-656}}

%Ar

%Ara

@article{Araki09,
author = {Toru Araki},
title = {Labeling bipartite permutation graphs with a condition at distance two},
journal = dam, volume = 157, year = 2009, pages = {1677-1686}}

%Arc

@article{Archdeacon83,
author = {D. Archdeacon},
title = {A {K}uratowski theorem for the projective plane},
journal = jgt, volume = 7, year = 1983, pages = {325-334}}

@unpublished{ArchdeaconFL88,
author = {D. Archdeacon and Michael R. Fellows and Michael A. Langston},
title = {Fixed Genus Embedding in {$O(n^4)$} Time},
note = {In preparation},
year = 1988
}

%Ari

@article{ArikatiCZ98,
author = {Srinivasa R. Arikati and Shiva Chaudhuri and Christos D.  Zaroliagis},
title = {All-pairs min-cut in sparse networks},
journal = ja, volume = 29, year = 1998, pages = {82-110}}

%Arn

%Arnborg 1978

@article{Arnborg78,
author = {Stefan Arnborg},
title = {Reduced State Enumeration --- Another Algorithm for Reliability Evaluation},
journal = {IEEE Transactions on Reliability}, volume = {R-27}, year = 1978, pages = {101-105}}

%Arnborg 1985

@article{Arnborg85,
author = {Stefan Arnborg},
title = {Efficient algorithms for combinatorial problems on graphs with bounded decomposability -- {A} Survey},
journal = bit, volume = 25, year = 1985, pages = {2-23}}

@article{ArnborgP85,
author = {Stefan Arnborg and Andrzej Proskurowski},
title = {Recognition of partial $k$-trees},
journal = cn, volume = 47, year = 1985, pages = {69-75}}

%Arnborg 1986

@article{ArnborgP86,
author = {Stefan Arnborg and Andrzej Proskurowski},
title = {Characterization and recognition of partial 3-trees},
journal = sjadm, volume = 7, year = 1986, pages = {305-314}}

%Arnborg 1987

@article{ArnborgCP87,
author = {Stefan Arnborg and Derek G. Corneil and Andrzej Proskurowski},
title = {Complexity of finding embeddings in a $k$-tree},
journal = sjadm, volume = 8, year = 1987, pages = {277-284}}

%Arnborg 1989

@article{ArnborgP89,
author = {Stefan Arnborg and Andrzej Proskurowski},
title = {Linear time algorithms for {NP}-hard problems restricted to
partial $k$-trees},
journal = dam, volume = 23, year = 1989, pages = {11-24}}

%Arnborg 1990

@article{ArnborgPC90,
author = {Stefan Arnborg and Andrzej Proskurowski and Derek G. Corneil},
title = {Forbidden minors characterization of partial 3-trees},
journal = dm, volume = 80, year = 1990, pages = {1-19}}

@inproceedings{ArnborgPS90,
author = {S. Arnborg and A. Proskurowski and D. Seese},
title = {Monadic second order logic, tree automata and forbidden minors},
editor = {E. B\"{o}rger and H. {Kleine B\"{u}ning} and M. M. Richter and W.  Sch\"{o}nfeld},
booktitle = {Proceedings 4th Workshop on Computer Science Logic, CSL'90},
publisher = lncs533, year = 1991, pages = {1-16}}

%Arnborg 1991

@unpublished{Arnborg91a,
author = {Stefan Arnborg},
title = {Some {PSPACE}-Complete Logic Decision Problems that become
Linear Time Solvable on Formula Graphs of Bounded Treewidth},
year = 1991, note = {Manuscript}}

@article{ArnborgLS91,
author = {Stefan Arnborg and Jens Lagergren and Detlef Seese},
title = {Easy problems for tree-decomposable graphs},
journal = ja, year = 1991, volume = 12, pages = {308-340}}

%Arnborg 1992

@unpublished{Arnborg92,
author = {Stefan Arnborg},
title = {Decomposability helps for deciding logics of knowledge and belief},
year = 1992, note = {Manuscript}}

@article{ArnborgP92,
author = {S. Arnborg and A. Proskurowski},
title = {Canonical representations of partial 2- and 3-trees},
journal = bit, volume = 32, year = 1992, pages = {197-214}}

%Arnborg 1993

@article{Arnborg93,
author = {Stefan Arnborg},
title = {Graph Decompositions and Tree Automata in Reasoning with Uncertainty},
journal = {Journal of Experimental \& Theoretical Artificial Intelligence},
volume = 5, year = 1993, pages = {335-357}}

@article{ArnborgCPS93,
author = {Stefan Arnborg and Bruno Courcelle and Andrzej Proskurowski and Detlef Seese},
title = {An algebraic theory of graph reduction},
journal = jacm, volume = 40, year = 1993, pages = {1134-1164}}

%Aro

@inproceedings{AroraKM95,
author = {S. Arora and D. Karger and M. Karpinski},
title = {Polynomial time approximation schemes for dense instances of {NP}-hard problems},
year = 1995, booktitle = stoc95, pages = {284-293}}

@article{Arora03,
author = {S. Arora},
title = {Approximation schemes for {NP}-hard geometric optimization problems: A survey},
journal = mp, volume = 97, year = 2003, pages = {43-69}}

%As

%Asa

@article{Asano85,
author = {T. Asano},
title = {An approach to the subgraph homeomorphism problem},
journal = tcs, volume = 38, year = 1985, pages = {249-267}}

%Asp

@article{AspvallH94,
author = {Bengt Aspvall and P. Heggernes},
title = {Finding minimum height elimination trees for interval graphs in polynomial time},
journal = bit, volume = 34, year = 1994, pages = {484-509}}

@article{Aspvall95,
author = {Bengt Aspvall},
title = {Minimizing elimination tree height can increase fill more than linearly},
journal = ipl, volume = 56, year = 1995, pages = {115-120}}

@article{AspvallPT00,
author = {B. Aspvall and A. Proskurowski and J. A. Telle},
title = {Memory requirements for table computations in partial $k$-tree algorithms},
journal = alg, volume = 27, year = 2000, pages = {382-394}}

%Ass

@article{AssmanPSZ81,
author = {S. F. Assman and G. W. Peck and Maciej M. Sys{\l}o and J. Zak},
title = {The bandwidth of caterpillars with hairs of length 1 and 2},
year = 1981, journal = sjadm, volume = 2, pages = {387-392}}

%At

%Ata

@article{AtallahMJ88,
author = {M. J. Atallah and G. K. Manacher and J. Urrutia},
title = {Finding a maximum independent dominating set in a permutation graph},
journal = dam, volume = 21, year = 1988, pages = {177-183}}

@inproceedings{AtallahCL93,
author = {M. J. Atallah and D. Z. Chen and D. T. Lee},
title = {An optimal algorithm for shortest paths on weighted interval and
circular-arc graphs, with applications},
editor = {Thomas Lengauer},
year = 1993, booktitle = esa93, pages = {13-24}, publisher = lncs726}

%Au

%Aus

@book{AusielloCGKMP99,
author = {Giorgio Ausiello and Pierluigi Crescenzi and Giorgio Gambosi and
Viggo Kann and Alberto {Marchetti-Spaccamela} and Marco Protasi},
title = {Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties},
publisher = {Springer},
address = {Berlin},
year = 1999}

%B

%Ba

%Bab

@article{Babel98,
author = {Luitpold Babel},
title = {Triangulating graphs with few {$P_4$}'s},
journal = dam, volume = 89, year = 1998, pages = {45-57}}

@article{BabelO98,
author = {Luitpold Babel and S. Olariu},
title = {On the structure of graphs with few {$P_4$}'s},
journal = dam, volume = 84, year = 1998, pages = {1-13}}

@article{Babel00,
author = {Luitpold Babel},
title = {Recognition and isomorphism of tree-like {$P_4$}-connected graphs},
journal = dam, volume = 99, year = 2000, pages = {295-315}}

%Bac

%Bachoore 2004

@misc{Bachoore04,
author = {Emgad Bachoore},
note = {Work in progress},
year = 2004}

@techreport{BachooreB04,
author = {Emgad Bachoore and Hans L. Bodlaender},
title = {New upper bound heuristics for treewidth},
number = {UU-CS-2004-036},
institution = {Institute for Information and Computing Sciences, Utrecht University},
year = 2004, address = {Utrecht, The Netherlands}}

%Bachoore 2005

@inproceedings{BachooreB05,
author = {Emgad H. Bachoore and Hans L. Bodlaender},
title = {New upper bound heuristics for treewidth},
editor = {Sotiris E. Nikoletseas},
booktitle = wea05, publisher = lncs3503, year = 2005, pages = {217-227}}

%Bachoore 2006

@inproceedings{BachooreB06,
author = {Emgad H. Bachoore and Hans L. Bodlaender},
title = {A branch and bound algorithm for exact, upper, and lower bounds on treewidth},
editor = {Siu-Wing Cheng and Chung Keung Poon},
booktitle = {Proceedings of the 2nd International Conference on Algorithmic Aspects
in Information and Management, AAIM 2006},
publisher = lncs4041, year = 2006, pages = {255-266}}

@techreport{BachooreB06a,
author = {Emgad H. Bachoore and Hans L. Bodlaender},
title = {Weighted Treewidth. Algorithmic Techniques and Results},
number = {UU-CS-2006-012},
institution = {Department of Information and Computing Sciences, Utrecht
University},
year = 2006, address = {Utrecht, The Netherlands},
note = {Available at http://www.cs.uu.nl/people/bachoore}}

@techreport{BachooreB06b,
author = {Emgad H. Bachoore and Hans L. Bodlaender},
title = {Convex recoloring of leaf-colored trees},
number = {UU-CS-2006-010},
institution = {Department of Information and Computing Sciences, Utrecht
University},
year = 2006, address = {Utrecht, The Netherlands}}

%Bad

@inproceedings{BaderW97,
author = {M. Bader and R. Weibel},
title = {Detecting and resolving size and proximity conflicts in the generalization of polygonal maps},
booktitle = {Proceedings of the 18th International Cartographic Conference},
address = {Stockholm},
year = 1997}

%Baf

@article{BafnaBF99,
author = {V. Bafna and P. Berman and T. Fujito},
title = {A 2-approximation algorithm for the undirected feedback vertex set problem},
journal = sjdm, volume = 12, year = 1999, pages = {289-297}}

%Bak

@article{Baker94,
author = {B. S. Baker},
title = {Approximation algorithms for {NP}-complete problems on planar graphs},
journal = jacm, volume = 41, year = 1994, pages = {153-180}}

@techreport{BakkerLT90,
author = {Erwin M. Bakker and Jan {van Leeuwen} and Richard B. Tan},
title = {Perfect Colorings},
number = {RUU-CS-90-35},
year = 1990,
institution = {Department of Computer Science, Utrecht University},
address = {Utrecht},
type = {Technical Report}}

@article{BakkerLT91,
author = {Erwin M. Bakker and Jan {van Leeuwen} and Richard B. Tan},
title = {Linear Interval Routing Schemes},
journal = {Algorithms Review}, volume = 2, year = 1991, pages = {45-61}}

@misc{BakkerLT94,
author = {Erwin M. Bakker and Jan {van Leeuwen} and Richard B. Tan},
note = {Work in progress}}

@article{BalakrishnanD03,
author = {Hemant Balakrishnan and Narsingh Deo},
title = {Parallel algorithm for radiocoloring a graph},
journal = cn, volume = 160, year = 2003, pages = {193-204}}

%Ban

@article{BandeltM86,
author = {Hans-J{\"{u}}rgen Bandelt and Henry Martijn Mulder},
title = {Distance-Hereditary Graphs},
journal = jctb, volume = 41, year = 1986, pages = {182-208}}

@techreport{BandeltDMMS88,
author = {Hans-J\"{u}rgen Bandelt and Allessandro D'Atri and Marina Moscarini
and Henry Martijn Mulder and Anselm Schultze},
title = {Operations on Distance-Hereditary Graphs},
year = 1988, number = {R.226},
institution = {Istitutio di Analisi dei Sistemi ed Informatica},
address = {Rome}}

%Bar

@article{BarYehudaE85,
author = {Reuven Bar-Yehuda and Simon Even},
title = {A local-ratio theorem for approximating the weighted vertex cover problem},
journal = adm, volume = 25, year = 1985, pages = {27-46}}

@inproceedings{BarYehudaFR05,
author = {Reuven Bar-Yehuda and Ido Feldman and Dror Rawitz},
title = {Improved approximation algorithm for convex recoloring of trees},
editor = {Thomas Erlebach and Giuseppe Persiano},
booktitle = waoa05, publisher = lncs3879, pages = {55-68}, year = 2006}

@article{BarYehudaFR08,
author = {Reuven Bar-Yehuda and Ido Feldman and Dror Rawitz},
title = {Improved approximation algorithm for convex recoloring of trees},
journal = tocs, volume = 43, year = 2008, pages = {3-18}}

@inproceedings{BarYehudaGNR94,
author = {Reuven Bar-Yehuda and D. Geiger and J. Naor and R. M. Roth},
title = {Approximation algorithms for the vertex feedback set problem with
applications to constraint satisfaction and {B}ayesian inference},
booktitle = soda94, year = 1994, pages = {344-354}}

@article{BarrettJM00,
author = {Christopher L. Barrett and Riko Jacob and Madhav V. Marathe},
title = {Formal-language-constrained path problems},
journal = siamjc, volume = 30, year = 2000, pages = {809-837}}

@article{BarrettHMRRS06,
author = {Christopher L. Barrett and Harry B. {Hunt III} and Madhav V. Marathe
and S. S.  Ravi and Daniel J. Rosenkrantz and Richard E. Stearns},
title = {Complexity of reachability problems for finite discrete dynamical systems},
journal = jcss, year = 2006, volume = 72, pages = {1317-1345}}

@article{BarthFH02,
author = {D. Barth and P. Fragopoulou and M.-C. Heydemann},
title = {Uniform emulations of {C}artesian-product and {C}ayley graphs},
journal = dam, volume = 116, year = 2002, pages = {37-54}}

%Bat

@inproceedings{BattistaN86,
author = {Di Battista, G. and E. Nardelli},
title = {An Algorithm for Testing Planarity of Hierarchical Graphs},
booktitle = wg86, publisher = lncs246, year = 1986, pages = {277-289}}

@techreport{BattistaT89,
author = {Di Battista, Giuseppe and Roberto Tamassia},
title = {On-Line Planarity Testing},
number = {CS-89-31},
institution = {???},
year = 1989}

@book{BattistaETT99,
author = {Di Battista, Giuseppe and Peter Eades and Roberto Tamassia and
Ioannis G. Tollis},
title = {Graph Drawing. Algorithms for the Visualization of Graphs},
publisher = {Prentice Hall},
address = {Upper Saddle River, New Jersey, USA},
year = 1999}

%Bau

@article{BauderonC87,
author = {M. Bauderon and Bruno Courcelle},
title = {Graph expressions and graph rewritings},
journal = mst, volume = 20, year = 1987, pages = {83-127}}

%Bax

@article{Bax93,
author = {E. T. Bax},
title = {Inclusion and exclusion algorithm for the {H}amiltonian path problem},
journal = ipl, volume = 47, year = 1993, pages = {203-207}}

%Baz

@article{BazganTV06,
author = {Christina Bazgan and Zsolt Tuza and Daniel Vanderpooten},
title = {Degree-constrained decompositions of graphs: Bounded treewidth and planarity},
journal = tcs, volume = 355, year = 2006, pages = {389-395}}

%Be

%Bec

@inproceedings{BeckerG96,
author = {A. Becker and D. Geiger},
title = {A sufficiently fast algorithm for finding close to optimal junction trees},
editor = {Dan Geiger and Prakash P. Shenoy},
booktitle = uai96, publisher = {Morgan Kaufmann}, year = 1996, pages = {81-96}}

@article{BeckerG96a,
author = {A. Becker and D. Geiger},
title = {Optimization of {P}earl's method of conditioning and greedy-like
approximation algorithms for the vertex feedback set problem},
journal = artint, volume = 83, year = 1996, pages = {167-188}}

@article{BeckerBG00,
author = {Ann Becker and Reuven Bar-Yehuda and Dan Geiger},
title = {Randomized algorithms for the loop cutset problem},
journal = jair, volume = 12, year = 2000, pages = {219-234}}

@article{BeckerG01,
author = {Ann Becker and Dan Geiger},
title = {A sufficiently fast algorithm for finding close to optimal clique trees},
journal = artint, volume = 125, year = 2001, pages = {3-17}}

%Beh

@book{BehzadCL79,
author = {M. Behzad and G. Chartrand and L. Lesniak-Foster},
title = {Graphs and Digraphs},
year = 1979, 
publisher = {Pindle, Weber \& Schmidt},
address = {Boston}}

%Bei

@article{BeigelE05,
author = {R. Beigel and D. Eppstein},
title = {3-coloring in {$O(1.3289^n)$} time},
journal = ja, volume = 54, year = 2005, pages = {168-204}}

@article{BeinBT85,
author = {W. W. Bein and P. Bruckner and A. Tamir},
title = {Minimum cost flow algorithms for series-parallel networks},
journal = dam, volume = 10, year = 1985, pages = {117-124}}

@article{BeinekeP71,
author = {L. W. Beineke and R. E. Pippert},
title = {Properties and characterizations of $k$-trees},
journal = math, volume = 18, year = 1971, pages = {141-151}}

@inproceedings{BeinlichSCC89,
author = {I. Beinlich and G. Suermondt and R. Chavez and G. Cooper},
title = {The {ALARM} monitoring system: A case study with two probabilistic inference techniques for belief networks},
booktitle = {Proceedings of the 2nd European Conference on AI and Medicine},
publisher = {Springer-Verlag},
year = 1989, pages = {247-256}}

%Bel

@article{BellenbaumD02,
author = {P. Bellenbaum and R. Diestel},
title = {Two short proofs concerning tree-decompositions},
journal = cpc, volume = 11, year = 2002, pages = {541-547}}

@book{BellmanD62,
author = {R. E. Bellman and S. E. Dreyfus},
title = {Applied Dynamic Programming},
publisher = {Princeton University Press},
address = {Princeton, N.J., USA},
year = 1962}

%Ben

@article{Bentz08,
author = {C\'{e}dric Bentz},
title = {On the complexity of the multicut problem in bounded tree-width graphs and digraphs},
journal = dam, volume = 156, year = 2008, pages = {1908-1917}}

%Ber

%Berg

@techreport{BergOK89,
author = {Mark de Berg and Mark Overmars and Marc van Kreveld},
title = {Finding Complete Bipartite Subgraphs in Bipartite Graphs},
institution = {Department of Computer Science, Utrecht University},
number = {RUU-CS-89-30}, year = 1989, address = {Utrecht, The Netherlands}}

@book{Berge73,
author = {C. Berge},
title = {Graphs and Hypergraphs},
publisher = {North-Holland}, address = {Amsterdam},
year = 1973 }

@book{Berge85,
author = {C. Berge},
title = {Graphs},
publisher = {North-Holland}, address = {Amsterdam},
year = 1985 }

@article{BergerFNP07,
author = {A. Berger and Takuro Fukunaga and Hiroshi Nagamochi and Ojas Parekh},
title = {Approximability of the capacitated $b$-edge dominating set problem},
journal = tcs, volume = 385, year = 2007, pages = {202-213}}

%Berl

@book{BerlekampCG82a,
author = {E. R. Berlekamp and J. H. Conway and R. K. Guy},
title = {Winning Ways for your mathematical plays, Volume 1: Games in
General},
publisher = {Academic Press},
address = {New York},
year = 1982 }

@book{BerlekampCG82b,
author = {E. R. Berlekamp and J. H. Conway and R. K. Guy},
title = {Winning Ways for your mathematical plays, Volume 2: Games in
Particular},
publisher = {Academic Press},
address = {New York},
year = 1982 }

%Berm

@article{BermanJLSS90,
author = {Fran Berman and David Johnson and Tom Leighton and Peter W.  Shor and Larry Snyder},
title = {Generalized planar matching},
journal = ja, volume = 11, year = 1990, pages = {153-185}}

%Bern

@article{BernLW87,
author = {M. W. Bern and Eugene L. Lawler and A. L. Wong},
title = {Linear time computation of optimal subgraphs of decomposable graphs},
journal = ja, volume = 8, year = 1987, pages = {216-235}}

@article{BernP90,
author = {Marshall Bern and Paul Plassmann},
title = {The {S}teiner problem with edge lengths 1 and 2},
journal = ipl, volume = 32, year = 1989, pages = {171-176}}

@inproceedings{BernH96,
author = {Marshall W. Bern and Barry Hayes},
title = {The Complexity of Flat Origami},
year = 1996, pages = {175-183},
booktitle = soda96}

@article{BernhartK79,
author = {F. Bernhart and B. Kainen},
title = {The book thickness of a graph},
journal = jctb, volume = 27, year = 1979, pages = {320-331}}

%Berr

%Berry 1997

@techreport{BerryB97,
author = {A. Bery and J.-P. Bordat},
title = {Decomposition by clique minimal separators},
type = {Research Report},
institution = {LIM}, address = {Marseille}, year = 1997}

%Berry 1998

@phdthesis{Berry98,
author = {A. Berry},
title = {D\'{e}sarticulation d'un graphe},
school = {Universit\'{e} Montpellier II},
year = 1998}

@article{BerryB98,
author = {A. Berry and J.-P. Bordat},
title = {Separability generalizes {D}irac's theorem},
journal = dam, volume = 84, year = 1998, pages = {43-53}}

%Berry 1999

@inproceedings{Berry99,
author = {A. Berry},
title = {A Wide-Range Efficient Algorithm for Minimal Triangulation},
booktitle = "{SODA}'99: {ACM}-{SIAM} Symposium on Discrete Algorithms",
year = "1999", pages ={860-861}}

@inproceedings{BerryBC99,
author = {A. Berry and J.-P. Bordat and O. Cogis},
title = {Generating all the minimal separators of a graph},
editor = {Peter Widmayer and Gabriele Neyer and Sephan Eidenbenz},
booktitle = wg99, publsiher = lncs1665, year = 1999, pages = {167-172}}

%Berry 2000

@article{BerryBC00,
author = {Anne Berry and Jean-Paul Bordat and Olivier Cogis},
title = {Generating all the minimal separators of a graph},
journal = ijfcs, volume = 11, year = 2000, pages = {397-404}}

@article{BerryBH00,
author = {Anne Berry and Jean-Paul Bordat and Pinar Heggernes},
title = {Recognizing weakly triangulated graphs by edge separability},
journal = nordicjc, volume = 7, year = 2000, pages = {164-177}}

%Berry 2001

@inproceedings{BerryB01,
author = {Anne Berry and Jean-Paul Bordat},
title = {Moplex elimination orderings},
editor = {Johann Hurink and Stefan Pickl and Hajo Broersma and Ulrich Faigle},
booktitle = {Proceedings of the 1st Cologne-Twente Workshop on Graphs and Combinatorial
Optimization, Electronic Notes in Discrete Mathematics 8},
year = 2001, pages = {6 -- 9}}

%Berry 2002

@inproceedings{BerryBH02,
author = {Anne Berry and Jean R. S. Blair and Pinar Heggernes},
title = {Maximum cardinality search for computing minimal triangulations},
editor = {Lud\u{e}k Ku\u{c}era},
booktitle = wg02, publisher = lncs2573, year = 2002, pages = {1-12}}

%Berry 2003

@inproceedings{BerryHS03,
author = {Anne Berry and Pinar Heggernes and Genevi\`{e}ve Simonet},
title = {The minimum degree heuristic and the minimal triangulation process},
editor = {Hans L. Bodlaender},
booktitle = wg03, publisher = lncs2880, year = 2003, pages = {58-70}}

@inproceedings{BerryJV03,
author = {Anne Berry and Pinar Heggernes and Yngve Villanger},
title = {A vertex incremental approach for dynamically maintaining chordal graphs},
editor = {Toshihide Ibaraki and Naoki Katoh and Hirotaka Ono},
booktitle = isaac03, publisher = lncs2906, pages = {47-57}, year = 2003}

%Berry 2004

@article{BerryBHP04,
author = {Anne Berry and Jean Blair and Pinar Heggernes and Barry Peyton},
title = {Maximum cardinality search for computing minimal triangulations of graphs},
journal = alg, volume = 39, year = 2004, pages = {287-298}}

%Berry 2005

@inproceedings{BerryKS05,
author = {Anne Berry and Richard Krueger and Genevi\`{e}ve Simonet},
title = {Ultimate generalizations of {LexBFS} and {LEX M}},
editor = {Dieter Kratsch},
booktitle = wg05, year = 2005, publisher = lncs3787, pages = {199-213}}

%Berry 2006

@article{BerryBHSV06,
author = {Anne Berry and Jean-Paul Bordat and Pinar Heggernes and Genevi\`{e}ve Simonet and Yngve Villanger},
title = {A wide-range algorithm for minimal triangulation from an arbitrary ordering},
journal = ja, volume = 58, year = 2006, pages = {33-66}}

@article{BerryHV06,
author = {Anne Berry and Pinar Heggernes and Yngve Villanger},
title = {A vertex incremental approach for maintaining chordality},
journal = dm, volume = 306, year = 2006, pages = {318-336}}

%Berry 2008

@article{BerryDHS08,
author = {Anne Berry and Elias Dahlhaus and Pinar Heggernes and Genevi\`{e}ve Simonet},
title ={Sequential and parallel triangulating algorithms for {E}limination {G}ame and
new insights on {M}inimum {D}egree},
journal = tcs, volume = 409, year = 2008, pages = {601-616}}

%Bert

@book{BerteleB72,
author = {U. Bertele and F. Brioschi},
title = {Nonserial Dynamic Programming},
publisher = {Academic Press}, address = {New York},
year = 1972 }

@inproceedings{BertolazziCDTT92,
author = {P. Bertolazzi and Robert F. Cohen and G. {Di Battista} and Roberto Tamassia and I. G. Tollis},
title = {How to draw a series-parallel digraph},
editor = {O. Nurmi and E. Ukkonen},
booktitle = swat92, publisher = lncs621, year = 1992, pages = {272-283}}

%Bertossi 1981

@article{Bertossi81,
author = {Alan A. Bertossi},
title = {The edge {H}amiltonian path problem is {NP}-complete},
journal = ipl, volume = 13, year = 1981, pages = {157-159}}

%Bertossi 1983

@article{Bertossi83,
author = {Alan A. Bertossi},
title = {Finding {H}amiltonian Circuits in Proper Interval Graphs},
journal = ipl, volume = 17, year = 1983, pages = {97-102}}

%Bertossi 1984

@article{Bertossi84,
author = {Alan A. Bertossi},
title = {Dominating set for split and bipartite graphs},
journal = ipl, volume = 19, year = 1984, pages = {37-40}}

%Bertossi 1986

@article{Bertossi86,
author = {Alan A. Bertossi},
title = {Total domination in interval graphs},
journal = ipl, volume = 23, year = 1986, pages = {131-134}}

@article{BertossiB86,
author = {Alan A. Bertossi and M. A. Bonucelli},
title = {Hamiltonian circuits in interval graph generalizations},
journal = ipl, volume = 23, year = 1986, pages = {195-200}}

%Bertossi 1987

@article{BertossiB87,
author = {Alan A. Bertossi and M. A. Bonuccelli},
title = {Some parallel algorithms on interval graphs},
journal = dam, volume = 16, year = 1987, pages = {101-111}}

%Bertossi 1988

@article{Bertossi88,
author = {Alan A. Bertossi},
title = {On the domatic number of interval graphs},
journal = ipl, volume = 28, year = 1988, pages = {275-280}}

%Bes

@unpublished{BessyFGPST09,
author = {St{\'e}phane Bessy and Fedor V. Fomin and Serge Gaspers and Christophe Paul and
Anthony Perez and Saket Saurabh and St{\'e}phan Thomass{\'e}},
title = {Kernels for feedback arc set in tournaments},
year = 2009, note = {The Computing Research Repository, abs/0907.2165. To appear in proceedings FSTTCS 2009.}}

%Bet

%Betzler 2006

@article{BetzlerNU06,
author = {Nadja Betzler and Rolf Niedermeier and Johannes Uhlmann},
title = {Tree decompositions of graphs: Saving memory in dynamic programming},
journal = do, volume = 3, year = 2006, pages = {220-229}}

%Betzler 2009

@article{BetzlerFGNR09,
author = {Nadja Betzler and Michael R. Fellows and Jiong Guo and Rolf Niedermeier and Frances A. Rosamond},
title = {Fixed-parameter algorithms for {K}emeny rankings},
journal = tcs, volume = 410, year = 2009, pages = {4554-4570}}

@article{BetzlerU09,
author = {Nadja Betzler and Johannes Uhlmann},
title = {Parameterized complexity of candidate control in elections and related digraph problems},
journal = tcs, volume = 410, year = 2009, pages = {5425-5442}}

%Betzler 2010

@article{BetzlerGN10,
author = {Nadja Betzler and Jiong Guo and Rolf Niedermeier},
title = {Parameterized computational complexity of {D}odgson and {Y}oung elections},
journal = ic2, volume = 208, year = 2010, pages = {165-177}}

%Bey

@inproceedings{BeyerPHM77,
author = {T. Beyer and Andrzej Proskurowski and S. Hedetniemi and S. Mitchell},
title = {Independent domination in trees},
booktitle = {Proceedings of the 8th S. E. Conf. on Combinatorics, Graph Theory, and Computing},
pages = {321-328}, publisher = {Utilitas Mathematica}, address = {Winnipeg},
year = 1977 }

@article{BeyerJM79,
author = {T. Beyer and W. Jones and S. Mitchell},
title = {Linear algorithms for isomorphism of maximal outerplanar graphs},
journal = jacm, volume = 26, year = 1979, pages = {603-610}}

%Bi

%Bia

@inproceedings{BianG08,
author = {Zhengbing Bian and Qian-Ping Gu},
title = {Computing branch decompositions of large planar graphs},
editor = {Catherine C. McGeoch},
booktitle = wea08, publisher = lncs5038, pages = {87-100}, year = 2008}

%Bie

@article{BiedlK98,
author = {Therese C. Biedl and Goos Kant},
title = {A better heuristic for orthogonal graph drawings},
journal = cg, volume = 9, year = 1998, pages = {159-180}}

@article{BiedlCGHW05,
author = {Therese Biedl and Timothy Chan and Yashar Ganjali and Mohammad Taghi Hajiaghayi and David R. Wood},
title = {Balanced vertex-orderings of graphs},
journal = dam, volume = 148, year = 2005, pages = {27-48}}

%Bienstock 1988

@article{BienstockM88,
author = {Daniel Bienstock and Clyde L. Monma},
title = {On the complexity of covering vertices by faces in a planar graph},
journal = siamjc, volume = 17, year = 1988, pages = {53-76}}

%Bienstock 1989

@article{BienstockM89,
author = {Daniel Bienstock and Clyde L. Monma},
title = {Optimal enclosing regions in planar graphs},
journal = netw, volume = 19, year = 1989, pages = {79-94}}

%Bienstock 1990

@article{Bienstock90,
author = {Daniel Bienstock},
title = {Embedding graphs in trees},
journal = jctb, volume = 49, year = 1990, pages = {103-136}}

@article{BienstockM90,
author = {Daniel Bienstock and Clyde L. Monma},
title = {On the complexity of embedding planar graphs to minimize certain distance measures},
journal = alg, volume = 5, year = 1990, pages = {93-109}}

%Bienstock 1991

@article{Bienstock91,
author = {Daniel Bienstock},
title = {Graph searching, Path-width, Tree-width and Related Problems (A Survey)},
journal = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
volume = 5, year = 1991, pages = {33-49}}

@article{BienstockRST91,
author = {Daniel Bienstock and Neil Robertson and Paul D. Seymour and Robin Thomas},
title = {Quickly excluding a forest},
journal = jctb, volume = 52, year = 1991, pages = {274-283}}

@article{BienstockS91,
author = {Daniel Bienstock and Paul Seymour},
title = {Monotonicity in Graph Searching},
journal = ja, volume = 12, year = 1991, pages = {239 - 245}}

%Bienstock 1992

@article{BienstockD92,
author = {Daniel Bienstock and N. Dean},
title = {On obstructions to small face covers in planar graphs},
journal = jctb, volume = 55, year = 1992, pages = {163-189}}

%Bienstock 1995

@incollection{BienstockL95,
author = {Daniel Bienstock and Michael A. Langston},
title = {Algorithmic implications of the graph minor theorem},
booktitle = {Handbook of Operations Research and Management Science: Network Models},
editor = {M. O. Ball and T. L. Magnanti and C. L. Monma and G. L. Nemhauser},
year = 1995, pages = {481-502},
publisher = {North-Holland},
address = {Amsterdam, the Netherlands}}

%Bienstock 2006

@article{BienstockO06,
author = {Daniel Bienstock and Nuri \"{O}zbay},
title = {Tree-width and the {S}herali-{A}dams operator},
journal = do, volume = 1, year = 2004, pages = {13-21}}

%Bir

@article{Birmele03,
author = {Etienne Birmele},
title = {Tree-width and circumference of graphs},
journal = jgt, volume = 43, year = 2003, pages = {24-25}}

@article{BirmeleBR09,
author = {E. Birmel\'{e} and J. A. Bondy and B. A. Reed},
title = {Tree-width of graphs without a 3$\times$3 grid minor},
journal = dam, volume = 157, year = 2009, pages = {2577-2596}}

%Bj

@inproceedings{BjorklundHKK07,
author = {Andreas Bj\"orklund and Thore Husfeldt and Petteri Kaski and Mikko Koivisto},
title = {Fourier meets {M}\"obius: {F}ast subset convolution},
booktitle = stoc07, pages = {67-74}, year = 2007, punlisher = {ACM}}

@article{BjorklundHK09,
author = {Andreas Bj{\"o}rklund and Thore Husfeldt and Mikko Koivisto},
title = {Set Partitioning via Inclusion-Exclusion},
journal = siamjc, volume = 39, year = 2009, pages = {546-563}}

%Bl

%Bla

%Blair 1993

@inproceedings{BlairP93,
author = {Jean R. S. Blair and B. Peyton},
title = {An introduction to chordal graphs and clique trees},
booktitle = {Graph Theory and Sparse Matrix Computations},
editor = {A. George and J. R. Gilbert and J. H. U. Liu},
publisher = {Springer-Verlag}, address = {New York}, year = 1993,
pages = {1-29}}

%Blair 1994

@article{BlairP94,
author = {J. R. S. Blair and B. W. Peyton},
title = {On finding minimum-diameter clique trees},
journal = nordicjc, volume = 1, year = 1994, pages = {173-201}}

%Blair 2001

@article{BlairHT01,
author = {Jean R. S. Blair and Pinar Heggernes and {Jan Arne} Telle},
title = {A practical algorithm for making filled graphs minimal},
journal = tcs, volume = 250, year = 2001, pages = {125-141}}

%Blair 2008

@article{BlairGHHJK08,
author = {Jean R. S. Blair and Wayne Goddard and Stephen T. Hedetniemi and
Steve Horton and Patrick Jones and Grzegorz Kubicki},
title = {On domination and reinforcement numbers in trees},
journal = dm, volume = 308, year = 2008, pages = {1165-1175}}

%Bli

@article{BlinFHV08,
author = {G. Blin and G. Fertin and D. Hermelin and S. Vialette},
title = {Fixed-parameter algorithms for protein similarity search under {mRNA} structure constraints},
journal = jda, volume = 6, year = 2008, pages = {618-626}}

%Blo

@article{BlokhuisK95,
author = {A. Blokhuis and T. Kloks},
title = {On the equivalence covering number of splitgraphs},
journal = ipl, volume = 54, year = 1995, pages = {301-304}}

%Bo

%Boc

@article{BockerBBT09,
author = {S. B\"{o}cker and S. Briesemeister and Q. B. A. Bui and A. Truss},
title = {Going weighted: parameterized algorithms for cluster editing},
journal = tcs, volume = 410, year = 2009, pages = {5467-5480}}

@unpublished{BockerBK09,
author = {Sebastian B\"{o}cker and Sebastian Briesemeister and Gunnar W. Klau},
title = {Exact algorithms for cluster editing: Evaluation and experiments},
note = {To appear in Algorithmica. Online publication: doi 10.1007/s00453-009-9339-7},
year = 2009}

%Bod

%Bodlaender 1985

@article{Bodlaender85,
author = {Hans L. Bodlaender},
title = {The complexity of finding uniform emulations on paths and ring networks},
journal = ic2, volume = 86, year = 1990, pages = {87 - 106}}

%Bodlaender 1986

@techreport{Bodlaender86,
author = {Hans L. Bodlaender},
title = {Classes of Graphs with Bounded Treewidth},
institution = {Dept. of Computer Science, Utrecht University},
year = 1986, number = {RUU-CS-86-22}, address = {Utrecht, The Netherlands}}

%Bodlaender 1987

@techreport{Bodlaender87-,
author = {Hans L. Bodlaender},
title = {Dynamic Programming Algorithms on Graphs with Bounded Tree-width},
institution = {Lab. for Computer Science, M.I.T.},
type = {Tech. Rep.}, year = 1987}

@inproceedings{Bodlaender87,
author = {Hans L. Bodlaender},
title = {Dynamic programming algorithms on graphs with bounded tree-width},
editor = {Timo Lepist\"{o} and Arto Salomaa},
booktitle = icalp88, publisher = lncs317, year = 1988, pages = {105-119}}

@techreport{Bodlaender87b,
author = {Hans L. Bodlaender},
title = {The Maximum Cut and Minimum Cut Into Bounded Sets Problems on Cographs},
institution = {Dept. of Computer Science, Utrecht University},
year = 1987, address = {Utrecht, The Netherlands}, number = {RUU-CS-87-12}}

%Bodlaender 1988

@inproceedings{Bodlaender88,
author = {Hans L. Bodlaender},
title = {{NC}-algorithms for graphs with small treewidth},
editor = {J. van Leeuwen},
booktitle = wg88, publisher = lncs344, year = 1988, pages = {1-10}}

@techreport{Bodlaender88a,
author = {Hans L. Bodlaender},
title = {Planar Graphs with Bounded Treewidth},
type = {Technical Report},
number = {RUU-CS-88-14},
institution = {Dept. of Computer Science, Utrecht University},
address = {Utrecht, The Netherlands},
year = 1988 }

@article{Bodlaender88c,
author = {Hans L. Bodlaender},
title = {Some classes of graphs with bounded treewidth},
journal = beatcs, volume = 36, year = 1988, pages = {116-126}}

@article{Bodlaender88d,
author = {Hans L. Bodlaender},
title = {Improved self-reduction algorithms for graphs with bounded treewidth},
journal = dam, volume = 54, year = 1994, pages = {101-115}}

%Bodlaender 1989

@article{Bodlaender89,
author = {Hans L. Bodlaender},
title = {On linear time minor tests with depth first search},
journal = ja, volume = 14, year = 1993, pages = {1-23}}

@article{Bodlaender89z,
author = {Hans L. Bodlaender},
title = {On the complexity of some coloring games},
journal = ijfcs, volume = 2, number = 2, year = 1991, pages = {133-147}}

%Bodlaender 1990

@article{Bodlaender90b,
author = {Hans L. Bodlaender},
title = {Polynomial algorithms for Graph Isomorphism and Chromatic Index on partial $k$-trees},
journal = ja, volume = 11, year = 1990, pages = {631-643}}

@techreport{BodlaenderK90,
author = {Hans L. Bodlaender and Ton Kloks},
title = {Fast Algorithms for the {\sc Tron} Game on Trees},
type = {Technical Report},
institution = {Department of Computer Science, University of Utrecht},
number = {RUU-CS-90-11},
year = 1990 }

%Bodlaender 1991

@inproceedings{BodlaenderK91,
author = {Hans L. Bodlaender and Ton Kloks},
title = {Better algorithms for the pathwidth and treewidth of graphs},
editor = {Javier Leach Albert and Burkhard Monien and Mario Rodr\'{\i}guez-Artalejo},
booktitle = icalp91, publisher = lncs510, year = 1991, pages = {544-555}}

%Bodlaender 1992

@inproceedings{Bodlaender92b,
author = {Hans L. Bodlaender},
title = {Dynamic algorithms for graphs with treewidth 2},
editor = {Jan van Leeuwen},
booktitle = wg93, publisher = lncs790, year = 1994, pages = {112-124}}

@article{Bodlaender92c,
author = {Hans L. Bodlaender},
title = {A Tourist Guide through Treewidth},
journal = actacybernetica, volume = 11, pages = {1-23}, year = 1993}

@inproceedings{BodlaenderFW92,
author ={Hans L. Bodlaender and Michael R. Fellows and Tandy J. Warnow},
title = {Two Strikes Against Perfect Phylogeny},
editor = {W. Kuich},
booktitle = icalp92, year = 1992, pages = {273-283}, publisher = lncs623}

@misc{BodlaenderKKM92,
author = {Hans L. Bodlaender and Ton Kloks and Dieter Kratsch and Haiko M{\"u}ller},
year = 1993,
note = {Unpublished results}}

%Bodlaender 1993

@article{Bodlaender93,
author = {Hans L. Bodlaender},
title = {Complexity of path-forming games},
journal = tcs, volume = 110, year = 1993, pages = {215-245}}

@inproceedings{Bodlaender93b,
author = {Hans L. Bodlaender},
title = {On reduction algorithms for graphs with small treewidth},
editor = {Jan van Leeuwen},
booktitle = wg93, publisher = lncs790, year = 1994, pages = {45-56}}

@inproceedings{Bodlaender93c,
author = {Hans L. Bodlaender},
title = {Kayles on special classes of graphs --- {An} application of {S}prague-{G}rundy theory},
editor = {Ernst W. Mayr},
booktitle = wg92, publisher = lncs657, year = 1993, pages = {90-102}}

@article{BodlaenderDFW93,
author = {Hans L. Bodlaender and Rodney G. Downey and Michael R. Fellows and Harold T. Wareham},
title = {The parameterized complexity of sequence alignment and consensus },
journal = tcs, volume = 147, year = 1995, pages = {31-54}}

@inproceedings{BodlaenderG93,
author = {Hans L. Bodlaender and Jens Gustedt},
title = {A Conjecture on the Pathwidth of $k$-Trees},
booktitle = {Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference, Seattle WA, June 1991},
publisher = {American Math. Soc.},
address = {Providence, RI},
editor = {Neil Robertson and Paul Seymour},
note = {Contemp. Math. 147. In section ``Open Problems'', editor N. Dean},
pages = {678-679},
year = 1993}

@article{BodlaenderK93,
author = {Hans L. Bodlaender and Ton Kloks},
title = {A simple linear time algorithm for triangulating three-colored graphs},
journal = ja, volume = 15, year = 1993, pages = {160-172}}

@article{BodlaenderM93,
author = {Hans L. Bodlaender and Rolf H. M{\"{o}}hring},
title = {The pathwidth and treewidth of cographs},
journal = sjdm, volume = 6, year = 1993, pages = {181-188}}

%Bodlaender 1994

@article{Bodlaender94,
author = {Hans L. Bodlaender},
title = {Improved self-reduction algorithms for graphs with bounded treewidth},
journal = dam, volume = 54, year = 1994, pages = {101-115}}

@article{Bodlaender94c,
author = {Hans L. Bodlaender},
title = {On disjoint cycles},
journal = ijfcs, volume = 5, number = 1, year = 1994, pages = {59-68}}

@inproceedings{BodlaenderFH94,
author = {Hans L. Bodlaender and Michael R. Fellows and Michael Hallett},
title = {Beyond {{\it NP}}-Completeness for Problems of Bounded Width: Hardness for the {$W$} Hierarchy},
year = 1994,
booktitle = stoc94,
address = {New York},
pages = {449-458},
publisher = {ACM Press}}

@article{BodlaenderJW94,
author = {Hans L. Bodlaender and Klaus Jansen and Gerhard J. Woeginger},
title = {Scheduling with incompatible jobs},
journal = dam, volume = 55, year = 1994, pages = {219-232}}

%Bodlaender 1995

@article{BodlaenderDFHW95,
author = {Hans L. Bodlaender and Rodney G.  Downey and Michael R. Fellows and Michael T. Hallett and H. Todd Wareham},
title = {Parameterized complexity analysis in computational biology},
journal = {Computer Applications in the Biosciences}, volume = 11, year = 1995, pages = {49-57}}

@article{BodlaenderDFW95,
author = {Hans L. Bodlaender and Rodney G. Downey and Michael R. Fellows and Harold T. Wareham},
title = {The parameterized complexity of sequence alignment and consensus},
journal = tcs, volume = 147, year = 1995, pages = {31-54}}

@article{BodlaenderGHK95,
author = {Hans L. Bodlaender and John R. Gilbert and H. Hafsteinsson and Ton Kloks},
title = {Approximating Treewidth, Pathwidth, Frontsize, and Minimum Elimination Tree Height},
journal = ja, volume = 18, year = 1995, pages = {238-255}}

@inproceedings{BodlaenderF95,
author = {Hans L. Bodlaender and Babette de Fluiter},
title = {Intervalizing $k$-Colored Graphs},
editor = {Zolt\'{a}n F\"{u}l\"{o}p and Ferenc G\'{e}cseg},
booktitle = icalp95, publisher = lncs944, year = 1995, pages = {87-98}}

@techreport{BodlaenderF95a,
author = {Hans L. Bodlaender and Babette de Fluiter},
title = {Reduction Algorithms for Graphs with Small Treewidth},
number = {UU-CS-1995-37},
year = 1995,
institution = {Department of Computer Science, Utrecht University},
address = {Utrecht},
type = {Technical Report}}

@article{BodlaenderF95b,
author = {Hans L. Bodlaender and Michael R. Fellows},
title = {{$W[2]$}-hardness of precedence constrained {$K$}-processor scheduling},
journal = orl, volume = 18, year = 1995, pages = {93-97}}

@techreport{BodlaenderFHWW95,
author = {Hans L. Bodlaender and Michael R. Fellows and Michael T. Hallett and H. Todd Wareham and Tandy J. Warnow},
title = {The hardness of problems on thin colored graphs},
institution = vi,
address = {Utrecht},
type = tr,
number = {UU-CS-1995-36},
year = 1995
}

@article{BodlaenderKK95,
author = {Hans L. Bodlaender and Ton Kloks and Dieter Kratsch},
title = {Treewidth and pathwidth of permutation graphs},
journal = sjdm, volume = 8, number = 4, year = 1995, pages = {606-616}}

%Bodlaender 1996

@article{Bodlaender96,
author = {Hans L. Bodlaender},
title = {A linear time algorithm for finding tree-decompositions of small treewidth},
journal = siamjc, year = 1996, volume = 25, pages = {1305-1317}}

@inproceedings{BodlaenderF96,
author = {Hans L. Bodlaender and Babette de Fluiter},
title = {Parallel Algorithms for Series Parallel Graphs},
editor = {Joseph Diaz and Maria Serna},
booktitle = esa96, year = 1996, publisher = lncs1136, pages = {277-289}}

@inproceedings{BodlaenderF96a,
author = {Hans L. Bodlaender and Babette de Fluiter},
title = {Reduction algorithms for constructing solutions in graphs with small treewidth},
editor = {Jin-Yi Cai and Chak Kuen Wong},
booktitle = cocoon96, publisher = lncs1090, year = 1996, pages = {199-208}}

@article{BodlaenderF96b,
author = {Hans L. Bodlaender and Babette de Fluiter},
title = {On intervalizing $k$-colored graphs for {DNA} physical mapping},
journal = dam, volume = 71, year = 1996, pages = {55-77}}

@inproceedings{BodlaenderFE96,
author = {Hans L. Bodlaender and Michael R. Fellows and Patricia A. Evans},
title = {Finite-State Computability of Annotations of Strings and Trees},
editor = {Daniel S. Hirshberg and Eugene W. Myers},
booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching, CPM'96},
publisher = lncs1075, year = 1996, pages = {384-391}}

@article{BodlaenderK96,
author = {Hans L. Bodlaender and Ton Kloks},
title = {Efficient and constructive algorithms for the pathwidth and treewidth of graphs},
journal = ja, volume = 21, year = 1996, pages = {358-402}}

%Bodlaender 1997

@inproceedings{Bodlaender97,
author = {Hans L. Bodlaender},
title = {Treewidth: Algorithmic Techniques and Results},
editor = {Igor Privara and Peter Ruzicka},
booktitle = mfcs97, publisher = lncs1295, year = 1997, pages = {19-36}}

@article{BodlaenderE97,
author = {Hans L. Bodlaender and Joost Engelfriet},
title = {Domino treewidth},
journal = ja, volume = 24, pages = {94-123}, year = 1997}

@techreport{BodlaenderF97,
author = {Hans L. Bodlaender and Babette de Fluiter},
title = {Parallel Algorithms for Series Parallel Graphs},
institution = {Dept. of Computer Science, Utrecht University},
year = 1997, number = {UU-CS-1997-21}, address = {Utrecht, The Netherlands}}

@techreport{BodlaenderF97a,
author = {Babette de Fluiter and Hans L. Bodlaender},
title = {Parallel algorithms for graphs of treewidth two},
institution = {Dept. of Computer Science, Utrecht University},
year = 1997, number = {UU-CS-1997-23}, address = {Utrecht, The Netherlands}}

@inproceedings{BodlaenderT97,
author = {Hans L. Bodlaender and Dimitrios M. Thilikos},
title = {Constructive Linear Time Algorithms for Branchwidth},
editor = {Pierpaolo Degano and Roberto Gorrieri and Alberto Marchetti-Spaccamela},
booktitle = icalp97, publisher = lncs1256, year = 1997, pages = {627-637}}

@article{BodlaenderT97a,
author = {Hans L. Bodlaender and Dimitrios M. Thilikos},
title = {Treewidth for graphs with small chordality},
journal = dam, volume = 79, year = 1997, pages = {45-61}}

@article{BodlaenderTTL97,
author = {Hans L. Bodlaender and Jan van Leeuwen and Richard Tan and Dimitrios Thilikos},
title = {On interval routing schemes and treewidth},
journal = ic2, volume = 139, number = 1, year = 1997, pages={92-109}}

%Bodlaender 1998

@article{Bodlaender98,
author = {Hans L. Bodlaender},
title = {A partial $k$-arboretum of graphs with bounded treewidth},
journal = tcs, volume = 209, year = 1998, pages = {1-45}}

@article{BodlaenderDJKKMT98,
author = {Hans L. Bodlaender and J. S. Deogun and K. Kansen and Ton Kloks and Dieter Kratsch and Haiko M{\"u}ller and Z. Tuza},
title = {Rankings of graphs},
journal = sjdm, volume = 11, year = 1998, pages = {168-181}}

@inproceedings{BodlaenderGT98,
author = {Hans Bodlaender and Jens Gustedt and Telle, Jan Arne},
title = {Linear-time register allocation for a fixed number of registers},
booktitle = soda98, pages = {574--583},
publisher = {ACM},
year = {1998}}

@article{BodlaenderH98,
author = {Hans L. Bodlaender and Torben Hagerup},
title = {Parallel algorithms with optimal speedup for bounded treewidth},
journal = sicomp, volume = 27, year = 1998, pages = {1725-1746}}

@article{BodlaenderKKM98,
author = {Hans L. Bodlaender and Ton Kloks and Dieter Kratsch and Haiko Mueller},
title = {Treewidth and minimum fill-in on $d$-trapezoid graphs},
journal = jgaa, volume = 2, number = 5, year = 1998, pages = {1-23}}

%Bodlaender 1999

@article{BodlaenderT99,
author = {Hans L. Bodlaender and Dimitrios M. Thilikos},
title = {Graphs with branchwidth at most three},
journal = ja, volume = 32, year = 1999, pages = {167-194}}

%Bodlaender 2000

@article{BodlaenderFHWW00,
author = {Hans L. Bodlaender and Michael R. Fellows and Michael T. Hallett and H. Todd Wareham and Tandy J. Warnow},
title = {The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs},
journal = tcs, volume = 244, year = 2000, pages = {167-188}}

%Bodlaender 2001

@article{BodlaendervA01,
author = {Hans L. Bodlaender and Babette van Antwerpen-de Fluiter},
title = {Parallel algorithms for series parallel graphs and graphs with treewidth two},
journal = alg, volume = 29, year = 2001, pages = {543-559}}

@article{BodlaendervA01a,
author = {Hans L. Bodlaender and Babette van Antwerpen-de Fluiter},
title = {Reduction algorithms for graphs of small treewidth},
journal = ic2, volume = 167, year = 2001, pages = {86-119}}

@inproceedings{BodlaenderEG01,
author = {Hans L. Bodlaender and Eijkhof, Frank {v}an {d}en and Linda C. van der Gaag},
title = {On the complexity of the {MPA} problem in probabilistic networks},
editor = {Frank van Harmelen},
booktitle = {Proceedings of the 15th European Conference on Artificial Intelligence, ECAI 2001},
publisher = {IOS Press}, address = {Amsterdam}, pages = {675-679},
year = 2002}

@inproceedings{BodlaenderKEG01,
author = {Hans L. Bodlaender and Arie M. C. A. Koster and Eijkhof, Frank {v}an {d}en and Linda C. van der Gaag},
title = {Pre-processing for triangulation of probabilistic networks},
editor = {Jack S. Breese and Daphne Koller},
booktitle = uai01, publisher = {Morgan Kaufmann}, year = 2001, pages = {32-39}}

%Bodlaender 2002

@inproceedings{BodlaenderEG02,
author = {Hans L. Bodlaender and Frank van den Eijkhof and Linda C. van der Gaag},
title = {On the complexity of the {MPA} problem in probabilistic networks},
editor = {Frank van Harmelen},
booktitle = ecai2002, publisher = {IOS Press}, year = 2002, pages = {675-679}}

@techreport{BodlaenderFT02,
author = {Hans L. Bodlaender and Michael R. Fellows and Dimitrios M.  Thilikos},
title = {Derivation of algorithms for cutwidth and related graph layout problems},
type= {Technical Report},
year = 2002, number = {UU-CS-2002-032},
institution = {Institute of Information and Computing Sciences, Utrecht University},
address = {Utrecht, The Netherlands}}

@article{BodlaenderF02,
author = {Hans L. Bodlaender and Fedor V. Fomin},
title = {Approximation of pathwidth of outerplanar graphs},
journal = ja, volume = 43, year = 2002, pages = {190-200}}

%Bodlaender 2003

@article{Bodlaender2003,
author = {Hans L. Bodlaender},
title = {Necessary edges in $k$-chordalizations of graphs},
journal = jco, volume = 7, year = 2003, pages = {283-290}}

@article{BodlaenderR03,
author = {Hans L. Bodlaender and Udi Rotics},
title = {Computing the treewidth and the minimum fill-in with the modular decomposition},
journal = alg, volume = 36, year = 2003, pages = {375-408}}

%Bodlaender 2004

@inproceedings{BodlaenderK04,
author = {Hans L. Bodlaender and Arie M. C. A. Koster},
title = {On the {M}aximum {C}ardinality {S}earch lower bound for treewidth},
editor = {J. Hromkovi\u{c} and M. Nagl and B. Westfechtel},
booktitle = wg04, year = 2004, pages = {81-92}, publisher = lncs3353}

@misc{BodlaenderK04a,
author = {Hans L. Bodlaender and Arie M. C. A. Koster},
note = {Work in progress},
year = 2004}

@inproceedings{BodlaenderKW04,
author = {Hans L. Bodlaender and Arie M. C. A. Koster and Thomas Wolle},
title = {Contraction and treewidth lower bounds},
editor = {Susanne Albers and Tomasz Radzik},
booktitle = esa04, year = 2004, pages = {628-639}, publisher = lncs3221}

@article{BodlaenderKTvL04,
author = {Hans L. Bodlaender and Ton Kloks and Richard Tan and Jan {van Leeuwen}},
title = {Approximations for $\lambda$-colorings of graphs},
journal = tcj, volume = 47, year = 2004, pages = {193-204}}

@techreport{BodlaenderKW2004vol,
author = {Hans L. Bodlaender and Arie M. C. A. Koster and Thomas Wolle},
title = {Contraction and Treewidth Lower Bounds},
institution = {Dept. of Computer Science, Utrecht University},
year = 2004,
address = {Utrecht, The Netherlands}, 
number = {UU-CS-2004-34} 
}

@techreport{BodlaenderW04,
author = {Hans L. Bodlaender and Thomas Wolle},
title = {Contraction Degeneracy on Cographs},
institution = {Institute for Information and Computing Sciences, Utrecht University},
address = {Utrecht, The Netherlands},
year = 2004,
number = {UU-CS-2004-031}}

%Bodlaender 2005

@inproceedings{Bodlaender05,
author = {Hans L. Bodlaender},
title = {Discovering treewidth},
editor = {Peter Vojt\'{a}\u{s} and M\'{a}ria Bielikov\'{a} and Bernadette Charron-Bost},
booktitle = sofsem05, year = 2005, publisher = lncs3381, pages = {1-16}}

@misc{Bodlaender05a,
author = {Hans L. Bodlaender},
year = 2005,
note = {Work in progress}}

@article{BodlaenderF05,
author = {Hans L. Bodlaender and Fedor V. Fomin},
title = {Tree decompositions with small cost},
journal = dam, volume = 145, year = 2004, pages = {143-154}}

@article{BodlaenderF05a,
author = {Hans L. Bodlaender and Fedor V. Fomin},
title = {Equitable colorings of bounded treewidth graphs},
journal = tcs, volume = 349, year = 2005, pages = {22-30}}

@inproceedings{BodlaenderGK05,
author = {Hans L. Bodlaender and Alexander Grigoriev and Arie M. C. A. Koster},
title = {Treewidth Lower Bounds with Brambles},
editor = {G. S. Brodal and S. Leonardi},
booktitle = esa05, year = 2005, pages = {391--402}, publisher = lncs3669}

@article{BodlaenderKE05,
author = {Hans L. Bodlaender and Arie M. C. A. Koster and Eijkhof, Frank {v}an {d}en},
title = {Pre-processing rules for triangulation of probabilistic networks},
journal = {Computational Intelligence}, year = 2005, volume = 21, number = 3, pages = {286-305}}

@unpublished{BodlaenderW05,
author = {Hans L. Bodlaender and Mark Weyer},
title = {Convex and connected recolourings of trees and graphs of small treewidth},
note = {Unpublished manuscript}, year = 2005}

@article{BodlaenderKW05,
author = {Hans L. Bodlaender and Arie M. C. A. Koster and Thomas Wolle},
title = {Contraction and treewidth lower bounds},
journal = jgaa, volume = 10, year = 2006, pages = {5-49}}

%Bodlaender 2006

@techreport{Bodlaender06,
author = {Hans L. Bodlaender},
title = {A cubic kernel for Feedback Vertex Set},
institution = {Department of Information and Computing Sciences, Utrecht University},
address = {Utrecht, The Netherlands},
year = 2006,
number = {UU-CS-2006-042}}

@inproceedings{Bodlaender06a,
author = {Hans L. Bodlaender},
title = {Treewidth: Characterizations, Applications, and Computations},
editor = {Fedor V. Fomin},
booktitle = wg06, year = 2006, pages = {1 - 14}, publisher = lncs4271}

@techreport{BodlaenderCCFTM06,
author = {Hans L. Bodlaender and Leizhen Cai and Jianer Chen and Michael R. Fellows and Jan Arne Telle and D\'{a}niel Marx},
title = {Open Problems in Parameterized and Exact Computation - {IWPEC} 2006},
institution = {Department of Information and Computing Sciences, Utrecht University},
address = {Utrecht, The Netherlands},
year = 2006,
number = {UU-CS-2006-052}}

@inproceedings{BodlaenderFKKT06,
author = {Hans L. Bodlaender and Fedor V. Fomin and Arie M. C. A. Koster and Dieter Kratsch and Dimitrios M. Thilikos},
title = {On exact algorithms for treewidth},
editor = {Y. Azar and T. Erlebach},
booktitle = esa06, publisher = lncs4168, year = 2006, pages = {672-683}}

@techreport{BodlaenderFKKT06a,
author = {Hans L. Bodlaender and Fedor V. Fomin and Arie M. C. A. Koster and
Dieter Kratsch and Dimitrios M. Thilikos},
title = {On exact algorithms for treewidth},
type = {Technical Report},
institution = {Department of Information and Computing Sciences, Utrecht University},
address = {Utrecht, the Netherlands},
year = 2006,
number = {UU-CS-2006-032}}

@unpublished{BodlaenderK06,
author = {Hans L. Bodlaender and Arie M. C. A. Koster},
title = {Treewidth Computations {I}. {U}pper Bounds},
year = 2008,
note = {http://www.cs.uu.nl/research/techreps/UU-CS-2008-032.html. To appear in Information and Computation}}

@unpublished{BodlaenderK06a,
author = {Hans L. Bodlaender and Arie M. C. A. Koster},
title = {Treewidth Computations {II}. {L}ower Bounds},
year = 2009,
note = {Paper in preparation}}

@unpublished{BodlaenderK06b,
author = {Hans L. Bodlaender and Arie M. C. A. Koster},
title = {Treewidth Computations {III}. {E}xact Algorithms and Preprocessing},
note = {Paper in preparation},
year = 2010}

@article{BodlaenderK06c,
author = {Hans L. Bodlaender and Arie M. C. A. Koster},
title = {Safe separators for treewidth},
journal = dm, volume = 306, year = 2006, pages = {337-350}}

@article{BodlaenderWK06,
author = {Hans L. Bodlaender and Thomas Wolle and Arie M. C. A. Koster},
title = {Contraction and treewidth lower bounds},
journal = jgaa, volume = 10, year = 2006, pages = {5-49}}

%Bodlaender 2007

@inproceedings{Bodlaender07,
author = {Hans L. Bodlaender},
title = {A cubic kernel for feedback vertex set},
editor = {W. Thomas and P. Well},
booktitle = stacs07, publisher = lncs4393, year = 2007, pages = {320-331}}

inproceedings{Bodlaender07a,
author = {Hans L. Bodlaender},
title = {Treewidth: {S}tructure and Algorithms},
editor = {Giuseppe Prencipe and Shmuel Zaks},
booktitle = {Proceedings of the 14th International Colloquium on Structural Information and
Communication Complexity, SIROCCO 2007},
publisher = lncs4474, year = 2007, pages = {11-25}}

@inproceedings{BodlaenderFLRRW07,
author = {Hans L. Bodlaender and Michael R. Fellows and Michael Langston and Mark Ragan and Frances Rosamond and Mark Weyer},
title = {Quadratic kernelization for convex recoloring of trees},
editor = {G. Lin},
booktitle = cocoon07, publisher = lncs4598, year = 2007, pages = {86-96}}

@article{BodlaenderK07,
author = {Hans L. Bodlaender and Arie M. C. A. Koster},
title = {On the {M}aximum {C}ardinality {S}earch lower bound for treewidth},
journal = dam, volume = 155, year = 2007, number = 11, pages = {1348-1372}}

%Bodlaender 2008

@inproceedings{BodlaenderDFH08,
author = {Hans L. Bodlaender and Rodney G. Downey and Michael R. Fellows and Danny Hermelin},
editor = {Luca Aceto and Ivan Damg{\aa}rd and Leslie Ann Goldberg and
Magn\'{u}s M. Halld\'{o}rsson and Anna Ing\'{o}lfsd\'{o}ttir and Igor Walukuewics},
title = {On Problems Without Polynomial Kernels (Extended Abstract)},
booktitle = icalp08-1, pages = {563-574}, year = 2008, publisher = lncs5125}

@inproceedings{BodlaenderFHMPR08,
author = {Hans L. Bodlaender and Michael R. Fellows and Pinar Heggernes
and Federico Mancini and Charis Papadopoulos and Frances A. Rosamond},
title = {Clustering with partial information},
editor = {Edward Ochmanski and Jerzy Tyszkiewicz},
booktitle = mfcs08, publisher = lncs5162, pages = {144-155}, year = 2008}

@inproceedings{BodlaenderGGH08,
author = {Hans L. Bodlaender and Alexander Grigoriev and Nadejda V. Grigorieva and Albert Hendriks},
title = {The Valve Location Problem in Simple Network Topologies},
editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani\"{e}l Paulusma},
booktitle = wg08, publisher = lncs5344, year = 2008, pages = {55-65}}

@article{BodlaenderGK08,
author = {Hans L. Bodlaender and Alexander Grigoriev and Arie M. C. A. Koster},
title = {Treewidth lower bounds with brambles},
journal = alg, volume = 51, year = 2008, pages = {81-98}}

@inproceedings{BodlaenderHV08,
author = {Hans L. Bodlaender and Pinar Heggernes and Yngve Villanger},
title = {Faster parameterized algorithms for minimum fill-in},
editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga},
booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {282-293}}

@article{BodlaenderK08,
author = {Hans L. Bodlaender and Arie M. C. A. Koster},
title = {Combinatorial optimization on graphs of bounded treewidth},
journal = tcj, volume = 51, number = 3, year = 2008, pages = {255-269}}

@inproceedings{BodlaenderP08,
author = {Hans L. Bodlaender and Eelko Penninkx},
title = {A linear kernel for planar feedback vertex set},
editor = {Martin Grohe and Rolf Niedermeier},
booktitle = iwpec08, year = 2008, pages = {160-171}, publisher = lncs5018}

@inproceedings{BodlaenderPT08,
author = {Hans L. Bodlaender and Eelko Penninkx and Richard B. Tan},
title = {A linear kernel for the $k$-disjoint cycle problem on planar graphs},
editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga},
booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {294-305}}

@techreport{BodlaenderTDL08,
author = {Hans L. Bodlaender and Richard B. Tan and Thomas C. van Dijk and Jan van Leeuwen},
title = {Integer Maximum Flow in Wireless Networks with Energy Constraint},
number = {UU-CS-2008-005},
institution = {Department of Information and Computing Sciences, Utrecht University},
year = 2008, address = {Utrecht, The Netherlands}}

@techreport{BodlaenderTY08,
author = {Hans L. Bodlaender and St\'{e}phan Thomass\'{e} and Anders Yeo},
title = {Analysis of Data Reduction: Transformations give evidence for non-existence of polynomial kernels},
institution = {Department of Information and Computer Sciences, Utrecht University},
address = {Utrecht, the Netherlands},
year = 2008,
number = {UU-CS-2008-030}}

%Bodlaender 2009

@unpublished{Bodlaender09,
author = {Hans L. Bodlaender},
title = {Kernelization: New upper and lower bound techniques},
year = 2009,
note = {To appear in Proceedings IWPEC 2009}}

@article{BodlaenderDFH09,
author = {Hans L. Bodlaender and Rodney G. Downey and Michael R. Fellows and Danny Hermelin},
title = {On problems without polynomial kernels},
journal = jcss, volume = 75, year = 2009, pages = {423-434}}

@unpublished{BodlaenderFLPST09,
author = {Hans L. Bodlaender and Fedor V. Fomin and Daniel Lokshtanov and Eelko Penninkx and Saket Saurabh and Dimitrios M. Thilikos},
title = {({M}eta) Kernelization},
year = 2009,
note = {To appear in Proceedings FOCS 2009}}

@techreport{BodlaenderFLPST09a,
author = {Hans L. Bodlaender and Fedor V. Fomin and Daniel Lokshtanov and Eelko Penninkx and Saket Saurabh and Dimitrios M. Thilikos},
title = {({M}eta) Kernelization},
institution = {Department of Information and Computer Sciences, Utrecht University},
address = {Utrecht, the Netherlands},
year = 2009,
number = {UU-CS-2009-012}}

@techreport{BodlaenderKKTV09,
author = {Hans L. Bodlaender and Fedor V. Fomin and Arie M. C. A. Koster and Dieter Kratsch and Dimitrios M. Thilikos},
title = {A note on exact algorithms for vertex ordering problems on graphs},
institution = {Department of Information and Computer Sciences, Utrecht University},
address = {Utrecht, the Netherlands},
year = 2009,
number = {UU-CS-2009-???}}

@unpublished{BodlaenderLP09,
author = {Hans L. Bodlaender and Daniel Lokshtanov and Eelko Penninkx},
title = {Planar Capacitated Dominating Set is {$W[1]$}-hard},
year = 2009,
note = {In Proceedings IWPEC 2009}}

@inproceedings{BodlaenderTY09,
author = {Hans L. Bodlaender and St\'{e}phan Thomass\'{e} and Anders Yeo},
title = {Kernel bounds for Disjoint Cycles and Disjoint Paths},
editor = {Amos Fiat and Peter Sanders},
booktitle = esa09, publisher = lncs5757, year = 2009, pages = {635-646}}

%Bodlaender 2010

@article{BodlaendervD10,
author = {Hans L. Bodlaender and Thomas C. van Dijk},
title = {A cubic kernel for feedback vertex set and loop cutset},
journal = tocs, volume = 46, year = 2010, pages = {566-597}}

@article{BodlaenderK10,
author = {Hans L. Bodlaender and Arie M. C. A. Koster},
title = {Treewidth Computations {I}. {U}pper Bounds},
journal = ic2, volume = 208, year = 2010, pages = {259-275}}

@article{BodlaenderFHMPR10,
author = {Hans L. Bodlaender and Michael R. Fellows and Pinar Heggernes and Federico Mancini and Charis Papadopoulos and Frances Rosamond},
title = {Clustering with partial information},
journal = tcs, volume = 411, year = 2010, pages = {1202-1211}}

%Boh

@article{BohmeKMM09,
author = {Thomas B\"{o}hme and Ken-ichi Kawarabayashi and John Maharry and Bojan Mohar},
title = {Linear connectivity forces large complete bipartite minors},
journal = jctb, volume = 99, year = 2009, pages = {557-582}}

@article{BohraCR06,
author = {Ankur Bohra and L. Sunil Chandran and J. Krishnam Raju},
title = {Boxicity of series-parallel graphs},
journal = dm, volume = 306, year = 2006, pages = {2219-2221}}

%Bol

@book{Bollobas78,
author = {B. Bollob\'{a}s},
title = {Extremal Graph Theory},
publisher = {Academic Press},
address = {London},
year = 1978
}

@book{Bollobas85,
author = {B. Bollob\'{a}s},
title = {Random Graphs},
address = {London},
publisher = {Academic Press},
year = 1985
}

@book{Bollobas98,
author = {B\'{e}la Bollob\'{a}s},
title = {Modern Graph Theory},
publisher = {Graduate Texts in Mathematics, Springer},
address = {New York},
year = 1998}

%Bon

%Bond

@book{BondyM76,
author = {J. A. Bondy and U. S. R. Murty},
title = {Graph Theory with Applications},
publisher = {American Elsevier, MacMillan},
address = {New York, London},
year = 1976 }

%Bone

@unpublished{BonetB93,
author = {Maria Luisa Bonet and Samuel R. Buss},
title = {The Serial Transitive Closure Problem for Trees},
note = {Manuscript},
year = 1993}

%Bons

@inproceedings{BonsmaBW03,
author = {P. Bonsma and T. Brueggemann and G. Woeginger},
title = {A faster {FPT} algorithm for finding spanning trees with many leaves},
booktitle = mfcs03, publisher = lncs2747, year = 2003, pages = {259-268}}

@inproceedings{BonsmaZ08,
author = {Paul S. Bonsma and Florian Zickfeld},
title = {Spanning trees with many leaves in graphs without diamonds and blossoms},
editor = {Eduardo Sany Laber and Claudson F. Bornstein and Loana Tito Nogueira and Luerbio Faria},
booktitle = latin08, year = 2008, publisher = lncs4957, pages = {531-543}}

%Bonu

@article{BonucelliB79,
author = {M. A. Bonucelli and D. P. Bovet},
title = {Minimum node disjoint path covering for circular-arc graphs},
journal = ipl, volume = 8, year = 1979, pages = {159-161}}

@article{Bonuccelli85,
author = {M. A. Bonuccelli},
title = {Dominating sets and domatic number of circular-arc graphs},
journal = dam, volume = 12, year = 1985, pages = {203-213}}

%Boo

%Booth 1976

@article{BoothL76,
author = {Kellogg S. Booth and George S. Lueker},
title = {Testing for the consecutive ones property, interval graphs, and graph planarity using {PQ}-tree algorithms},
journal = jcss, volume = 13, year = 1976, pages = {335-379}}

%Booth 1982

@article{BoothJ82,
author = {Kellogg S. Booth and J. H. Johnson},
title = {Dominating sets in chordal graphs},
journal = siamjc, volume = 11, year = 1982, pages = {191-199}}

%Booth 1993

@article{BoothT93,
author = {H. Booth and R. E. Tarjan},
title = {Finding the minimum-cost maximum flow in a series parallel network},
journal = ja, volume = 15, year = 1993, pages = {416-446}}

%Booth 1994

@techreport{BoothGLR94,
author = {H. Booth and R. Govindran and M. Langston and S. Ramachandramurthi},
title = {Sequential and Parallel Algorithms for {$K_4$} Immersion Testing},
institution = {Department of Computer Science, University of Tennessee},
address = {Knoxville, Tennessee, USA},
month = {February}, year = 1994}

%Booth 1999

@article{BoothGLR99,
author = {Heather Booth and Rajeev Govindran and Michael A. Langston and Siddharthan Ramachandramurthi},
title = {Fast algorithms for {$K_4$} immersion testing},
journal = ja, volume = 30, year = 1999, pages = {344-378}}

%Bor

%Borg

@book{Borger85,
author = {E. B\"{o}rger},
title = {Berechenbarkeit, Komplexit\"{a}t, Logik},
publisher = {Vieweg-Verlag},
address = {Wiesbaden},
year = 1985}

%Bori

%Borie 1988

@phdthesis{Borie88,
author = {Richard B. Borie},
title = {Recursively Constructed Graph Families},
school = {School of Information and Computer Science, Georgia Institute of Technology},
year = 1988 }

@unpublished{BoriePT88,
author = {Richard B. Borie and R. Gary Parker and Craig A. Tovey},
title = {Unambiguous Factorization of Recursive Graph Classes},
year = 1988, note = {Manuscript}}

%Borie 1991

@article{BoriePT91,
author = {Richard B. Borie and R. Gary Parker and Craig A. Tovey},
title = {Deterministic decomposition of recursive graph classes},
journal = sjdm, volume = 4, year = 1991, pages = {481 - 501}}

%Borie 1992

@article{BoriePT92,
author = {Richard B. Borie and R. Gary Parker and Craig A. Tovey},
title = {Automatic generation of linear-time algorithms from predicate
calculus descriptions of problems on recursively constructed graph families},
journal = alg, volume = 7, year = 1992, pages = {555-581}}

%Borie 1993

@article{BorieG93,
author = {Richard Borie and Arobinda Gupta},
title = {Balanced decompositions for partial $k$-trees},
journal = cn, volume = 98, year = 1993, pages = {33-38}}

@unpublished{BorieG93a,
author = {Richard Borie and Arobinda Gupta},
title = {Balanced $2k$-Terminal Tree Decompositions for $k$-Terminal Recursive Graph Classes},
year = 1993, note = {Manuscript}}

%Borie 1995

@article{Borie95,
author = {Richard B. Borie}, 
title = {Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs},
journal = alg, volume = 14, year = 1995, pages = {123-137}}

@article{BoriePT08,
author = {R. B. Borie and R. G. Parker and C. A. Tovey},
title = {Solving problems on recursively constructed graphs},
journal = acmcs, volume = 41, year = 2008, number = 4}

%Born

@article{BornsteinV04,
author = {Claudson F. Bornstein and Santosh Vempala},
title = {Flow metrics},
journal = tcs, volume = 321, year = 2004, pages = {13-24}}

%Boro

@article{BorowieckiS07,
author = {M. Borowiecki and E. Sidorowicz},
title = {Generalised game colouring of graphs},
journal = dm, volume = 307, year = 2007, pages = {1225-1231}}

%Bou

%Bouchitte 1998

@inproceedings{BouchitteT98,
author = {Vincent Bouchitt{\'{e}} and Ioan Todinca},
title = {Minimal triangulations for graphs with ``few'' minimal separators},
booktitle = esa98, publisher = lncs1461, pages = {344-355}, year = 1998}

%Bouchitte 1999

@inproceedings{BouchitteT99,
author = {Vincent Bouchitt{\'{e}} and Ioan Todinca},
title = {Treewidth and minimum fill-in of weakly triangulated graphs},
booktitle = stacs99, publisher = lncs1563, pages = {197-208}, year = 1999}

%Bouchitte 2000

@inproceedings{BouchitteT00,
author = {Vincent Bouchitt{\'{e}} and Ioan Todinca},
title = {Listing all potential maximal cliques of a graph},
editor = {H. Reidel and S. Tison},
booktitle = stacs00, publisher = lncs1770, pages = {503-515}, year = 2000}

%Bouchitte 2001

@article{BouchitteT01a,
author = {Vincent Bouchitt{\'{e}} and Ioan Todinca},
title = {Treewidth and minimum fill-in: {G}rouping the minimal separators},
journal = siamjc, volume = 31, year = 2001, pages = {212-232}}

%Bouchitte 2002

@article{BouchitteT02,
author = {Vincent Bouchitt{\'{e}} and Ioan Todinca},
title = {Listing all potential maximal cliques of a graph},
journal = tcs, volume = 276, year = 2002, pages = {17-32}}

%Bouchitte 2003

@article{BouchitteT03,
author = {Vincent Bouchitt{\'{e}} and Ioan Todinca},
title = {Approximating the treewidth of {AT}-free graphs},
journal = dam, volume = 131, pages = {11-37}, year = 2003}

@article{BouchitteMT03,
author = {V. Bouchitt{\'{e}} and F. Mazoit and I. Todinca},
title = {Chordal embeddings of planar graphs},
journal = dm, volume = 273, year = 2003, pages = {85-102}}

%Bouchitte 2004

@article{BouchitteKMT04,
author = {V. Bouchitt{\'{e}} and Dieter Kratsch and Haiko M\"{u}ller and Ioan Todinca},
title = {On treewidth approximations},
journal = dam, volume = 136, year = 2004, pages = {183-196}}

%Bous

@inproceedings{BousquetDTY09,
author = {Nicolas Bousquet and Jean Daligault and St\'{e}phan Thomass\'{e} and Anders Yeo},
title = {A polynomial kernel for multicut in trees},
editor = {Susanne Albers and Jean-Yves Marion},
series = {Dagstuhl Seminar Proceedings},
publisher = {Leibniz-Zentrum f\"{u}r Informatik},
address = {Schloss Dagstuhl, Germany},
volume = {09001},
booktitle = stacs09, pages = {183-194}, year = 2009}

%Boy

@article{BoyarK87,
author = {J. Boyar and H. Karloff},
title = {Coloring planar graphs in parallel},
journal = ja, year = 1987, volume = 8, pages = {470-479}}

%Br

%Bra

@techreport{Brandenburg88,
author = {Franz J. Brandenburg},
title = {Nice Drawings of Graphs and of Trees are Computationally hard},
number = {MIP 8820}, institution = {University Passau}, year = 1988 }

%Brandstadt 1987

@article{Brandstadt87,
author = {Andreas Brandst\"{a}dt},
title = {The computational complexity of feedback vertex set, {H}amiltonian circuit, dominating set,
{S}teiner tree, and bandwidth on special perfect graphs},
journal = {J. Inf. Process. Cybern. EIK},
year = 1987, pages = {471-477}, volume = 23 }

@article{BrandstadtK87,
author = {Andreas Brandst\"{a}dt and Dieter Kratsch},
title = {On domination problems for permutation and other graphs},
journal = tcs, volume = 54, year = 1987, pages = {181-198}}

%Brandstadt 1991

@article{Brandstadt91,
author = {Andreas Brandst\"{a}dt},
title = {Classes of bipartite graphs related to chordal graphs},
journal = dam, volume = 32, year = 1991, pages = {51-60}}

@techreport{Brandstadt91a,
author = {Andreas Brandst\"{a}dt},
title = {Special Graph Classes --- A Survey (preliminary version)},
institution = {University of Duisburg},
year = 1991}

%Brandstadt 1993

@inproceedings{Brandstadt93,
author = {Andreas Brandst\"{a}dt},
title = {On improved time bounds for permutation graph classes},
editor = {Ernst W. Mayr},
booktitle = wg92, year = 1993, publisher = lncs657, pages = {1-10}}

@techreport{BrandstadtDCV93,
author = {Andreas Brandst\"{a}dt and Feodor F. Dragan and Victor D. Chepoi and Vitaly I. Voloshin},
title = {Dually chordal graphs},
institution = {University of Duisburg},
number = {SM-DU-225}, year = 1993}

%Brandstadt 1999

@book{BrandstadtLS99,
author = {Andreas Brandst\"{a}dt and {Van Bang} Le and Jeremy P. Spinrad},
title = {Graph Classes. {A} Survey},
year = 1999,
series = {SIAM Monographs on Discrete Mathematics and Applications},
publisher = {SIAM}, address = {Philadelphia, USA}}

%Brandstadt 2002

@inproceedings{BrandstadtDL02,
author = {Andreas Brands\"{a}dt and Feodor F. Dragan and Ho\`{a}ng-Oanh Le and Raffaele Mosca},
title = {New graph classes of bounded clique-width},
editor = {Lud\u{e}k Ku\u{c}era},
booktitle = wg02, publisher = lncs2573, year = 2002, pages = {57-67}}

%Brandstadt 2003

@article{BrandstadtL03,
author = {Andreas Brands\"{a}dt and Vadim Lozin},
title = {On the linear structure and clique-width of bipartite permutation graphs},
journal = arscomb, year = 2003, volume = 67, pages = {273-281}}

%Brandstadt 2004

@article{BrandstadtLM04,
author = {Andreas Brandst\"{a}dt and Ho\`{a}ng-Oanh Le and Raffaele Mosca},
title = {Chordal co-gem-free and (${P_5}$,gem)-free graphs have bounded clique-width},
journal = dam, volume = 145, year = 2004, pages = {232-241}}

@article{BrandstadtDLL04,
author = {Andreas Brandst\"{a}dt and F. F. Dragan and Ho\`{a}ng-Oanh Le and V. B. Le},
title = {Tree spanners on chordal graphs: complexity and algorithms},
journal = tcs, volume = 310, year = 2004, pages = {329-354}}

%Brandstadt 2006

@article{BrandstadtB06,
author = {Andreas Brandst\"{a}dt and Van Bang Le},
title = {Structure and linear time recognition of 3-leaf powers},
journal = ipl, volume = 98, year = 2006, pages = {133-138}}

%Brandstadt 2008,

@article{BrandstadtH08,
author = {Andreas Brandst\"{a}dt and Ch{\'{\i}}nh T. Ho\'{a}ng},
title = {On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem},
journal = tcs, volume = 389, year = 2008, pages = {295-306}}

@article{BrandstadtH08a,
author = {Andreas Brandst\"{a}dt and Ch{\'{\i}}nh T. Ho\'{a}ng},
title = {Maximum induced matchings for chordal graphs in linear time},
journal = alg, volume = 52, year = 2008, pages = {440-447}}

%Brandstadt 2009

@article{BrandstadtB09,
author = {Andreas Brandst\"{a}dt and Van {Bang Le}},
title = {Simplicial powers of graphs},
journal = tcs, volume = 410, year = 2009, pages = {5443-5454}}

%Bre

@inproceedings{BretscherCHP2003,
author = {Anna Bretscher and Derek Corneil and Michel Habib and Christophe Paul},
title = {A simple linear time {LexBFS} cograph recognition algorithm},
editor = {Hans L. Bodlaender},
booktitle = wg03, publisher = lncs2880, year = 2003, pages = {119-130}}

%Bri

@article{BrinkmannKM01,
author = {Gunnar Brinkmann and Jack H. Koolen and V. Moulton},
title = {On the hyperbolicity of chordal graphs},
journal = {Annals of Combinatorics}, volume = 5, year = 2001, pages = {61-69}}

%Bro

%Broersma 1997

@inproceedings{BroersmaDK97a,
author = {H. Broersma and Elias Dahlhaus and Ton Kloks},
title = {Algorithms for the treewidth and minimum fill-in of {HHD}-free graphs},
editor = {Rolf H. M\"{o}hring},
booktitle = wg97, publisher = lncs1335, pages = {109-117}, year = 1997}

%Broersma 1998

@inproceedings{BroersmaKKM98,
author = {Hajo Broersma and Ton Kloks and Dieter Kratsch and Haiko M\"{u}ller},
title = {A generalization of {AT}-free graphs and a generic algorithm for solving treewidth, minimum fill-in, and vertex ranking},
editor = {Juraj Hromkovic and Ondrej S\'{y}kora},
booktitle = wg98, publisher = lncs1517, year = 1998, pages = {88-99}}

%Broersma 1999

@article{BroersmaKKM99,
author = {Hajo Broersma and Ton Kloks and Dieter Kratsch and Haiko M\"{u}ller},
title = {Independent sets in asteroidal triple-free graphs},
journal = sjdm, volume = 12, year = 1999, pages = {276-287}}

%Broersma 2000

@article{BroersmaDK00,
author = {H. Broersma and Elias Dahlhaus and Ton Kloks},
title = {A linear time algorithm for minimum fill in and tree width for distance hereditary graphs},
journal = dam, volume = 99, year = 2000, pages = {367-400}}

%Broersma 2002

@article{BroersmaKKM02,
author = {Hajo Broersma and Ton Kloks and Dieter Kratsch and Haiko M\"{u}ller}, 
title = {A generalization of {AT}-free graphs and a generic algorithm for solving triangulation problems},
journal = alg, volume = 32, year = 2002, pages = {594-610}}

%Broersma 2007

@article{BroersmaL07,
author = {Hajo Broersma and Xueliang Li},
title = {On the complexity of dominating set problems related to the minimum all-ones problem},
journal = tcs, volume = 385, year = 2007, pages = {60-70}}

%Broersma 2009

@article{BroersmaJP09,
author = {Hajo Broersma and Matthew Johnson and Dani\"{e}l Paulusma},
title = {Upper bounds and algorithms for parallel knock-out numbers},
journal = tcs, volume = 410, year = 2009, pages = {1319-1327}}

%Brown

@article{BrownFL89,
author = {D. J. Brown and Michael R. Fellows and Michael A. Langston},
title = {Polynomial-time self-reducibility: Theoretical motivations and practical results},
journal = ijcm, volume = 31, year = 1989, pages = {1-9}}

%Bru

@article{BruglieriME04,
author = {Maurizio Bruglieri and Francesco Maffioli and Matthias Ehrgott},
title = {Cardinality constrained minimum cut problems: complexity and algorithms},
journal = dam, volume = 137, year = 2004, pages = {311-341}}

@article{BruglieriEHM06,
author = {Maurizio Bruglieri and Matthias Ehrgott and Horst W. Hamacher and Francesco Maffioli},
title = {An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints},
journal = dam, volume = 154, year = 2006, pages = {1344-1357}}

@article{BrunoW70,
author = {John Bruno and Louis Weinberg},
title = {A Constructive Graph-Theoretic Solution of the {S}hannon Switching Game},
journal = ieeetct, volume = {CT-17}, year = 1970, pages = {74-81}}

%Bry

@inproceedings{BryantFKL87,
author = {R. L. Bryant and Michael R. Fellows and N. G. Kinnersley and Michael A. Langston},
title = {On finding obstruction sets and polynomial-time algorithms for gate matrix layout},
booktitle = {Proceedings of the 25th Allerton Conference on Communication, Control and Computing},
year = 1987, pages = {397-398}}

@article{BryantL06,
author = {David Bryant and Jens Lagergren},
title = {Compatibility of unrooted phylogenetic trees is {FPT}},
journal = tcs, volume = 351, year = 2006, pages = {296-302}}

%Bu

%Bub

@article{BubeckB09,
author = {Uwe Bubeck and Hans {Kleine B\"{u}ning}},
title = {A new {3-CNF} transformation by parallel-serial graphs},
journal = ipl, volume = 109, year = 2009, pages = {376-379}}

%Buc

@article{Buchi60,
author = {J. R. B\"{u}chi},
title = {Weak second order logic and finite automata},
journal = {S. Math. Grundlagen Math.}, volume = 5, year = 1960, pages = {66-92}}

%Bue

@article{BuerM83,
author = {Hermann Buer and Rolf H. M{\"{o}}hring},
title = {A fast algorithm for the decomposition of graphs and posets},
journal = mor, volume = 8, number = 2, year = 1983, pages = {170-184}}

%Bui

@article{BuiXuanHLM09,
author = {B.-M. Bui-Xuan and M. Habib and V. Limouzy and F. {de Montgolfier}},
title = {Algorithmic aspects of a general modular decomposition theory},
journal = dam, volume = 157, year = 2009, pages = {1993-2009}}

@article{BuiXuanTV10,
author = {Binh-Minh Bui-Xuan and Jan Arne Telle and Martin Vatshelle},
title = {$H$-join decomposable graphs and algorithms with runtime single exponential in rankwidth},
journal = dam, volume = 158, year = 2010, pages = {809-819}}

%Bul

@article{BultW08,
author = {Fokko J. {van de Bult} and Gerhard J. Woeginger},
title = {The problem of the moody chess players},
journal = ipl, volume = 108, pages = {336-337}, year = 2008}

%Bun

@article{Buneman74,
author = {P. Buneman},
title = {A characterization of rigid circuit graphs},
journal = dm, volume = 9, year = 1974, pages = {205-212}}

%Bur

@inproceedings{BurgstallerBS04,
author = {Bernd Burgstaller and Johann Blieberger and Bernhard Scholz},
title = {On the Tree Width of {A}da Programs},
booktitle = {Ada-Europe 2004}, year = 2004, pages = {78-90}}

@article{Burke10,
author = {Edmund K. Burke and Jakub Mare\u{c}ek and Andrew J. Parkes and Hana Rudov\'{a}},
title = {Decomposition, reformulation, and diving in university course timetabling},
journal = cor, volume = 37, year = 2010, pages = {582-597}}

@inproceedings{BurrageEFLMR06,
author = {Kevin Burrage and Vladimir Estivill-Castro and Michael R. Fellows and Michael A. Langston and Shev Mac
and Frances A. Rosamond},
title = {The undirected feedback vertex set problem has a poly($k$) kernel},
editor = {Hans L. Bodlaender and Michael A. Langston},
booktitle = iwpec06, publisher = lncs4169, year = 2006, pages = {192-202}} 

%Bus

@book{BusackerS65,
author = {R. G. Busacker and U. S. R. Murty},
title = {Finite Graphs and Networks: an Introduction with Applications},
publisher = {McGraw-Hill}, address = {New York}, year = 1965 }

@unpublished{BussFM89,
author = {S. R. Buss and Michael R. Fellows and Burkhard Monien},
title = {Linear-Time Algorithms for Some Well-Known Fixed Parameter Problems},
note = {Manuscript, Department of Computer Science, University of Idaho},
year = 1989 }

@article{BussG93,
author = {Jonathan F. Buss and Judy Goldsmith},
title = {Nondeterminism within {P}},
journal = siamjc, volume = 22, year = 1993, pages = {560-572}}

%By

%Byl

@article{BylanderATJ91,
author = {T. Bylander and D. Allemang and M.C. Tanner and J.R. Josephson},
title = {The computational complexity of abduction},
journal = artint, volume = 49, pages = {25-60}, year = 1991}

%Bys

@article{Byskov04,
author = {Jesper Makholm Byskov},
title = {Enumerating maximal independent sets with applications to graph coloring},
journal = orl, year = 2004, pages = {547-556}, volume = 32}

@phdthesis{Byskov04a,
author = {Jesper Makholm Byskov},
title = {Exact Algorithms for Graph Colouring and Exact Satisfiability},
type = {PhD thesis},
school = {University of Aarhus},
address = {Aarhus, Denmark},
year = {August, 2005}}

%C

%Ca

%Cai

%Cai 1989

@unpublished{CaiC89,
author = {Leizhen Cai and Derek G. Corneil},
title = {Cycle Double Covers of Line Graphs},
year = 1989, note = {Manuscript}}

@unpublished{CaiE89,
author = {Leizhen Cai and John A. Ellis},
title = {Linear time algorithms for edge colouring line graphs of trees and of unicyclic graphs},
year = 1989, note = {Manuscript}}

@unpublished{CaiE89a,
author = {Leizhen Cai and John A. Ellis},
title = {{NP}-completeness of edge coloring some restricted graphs},
year = 1989, note = {Manuscript}}

%Cai 1993

@techreport{CaiCDF93,
author = {L. Cai and J. Chen and Rodney G. Downey and Michael R. Fellows},
title = {The parameterized complexity of short computations and factorizations},
institution = {Department of Computer Science, University of Victoria},
type = {Technical Report},
year = 1993, month = {July}}

%Cai 1996

@article{Cai96,
author = {Leizhen Cai},
title = {Fixed-parameter tractability of graph modification problems for heriditary properties},
journal = ipl, volume = 58, year = 1996, pages = {171-176}}

%Cai 1997

@article{CaiC97,
author = {Liming Cai and Jianer Chen},
title = {On Fixed-Parameter Tractability and Approximability of {NP} Optimization Problems},
journal = jcss, volume = 54, year = 1997, pages = {465-474}}

@article{CaiCDF97,
author = {L. Cai and J. Chen and R. G. Downey and M. R. Fellows},
title = {Advice classes of parameterized tractability},
journal = apal, volume = 84, year = 1997, pages = {119-138}}

%Cai 2000

@unpublished{Cai00,
author = {Leizhen Cai},
title = {The complexity of colouring parameterized graphs},
year = 2000, note = {Manuscript}}

%Cai 2001

@article{CaiZ01,
author = {Leizhen Cai and Xuding Zhu},
title = {Game chromatic index of $k$-degenerate graphs},
journal = jgt, volume = 36, pages = {144-155}, year = 2001}

@article{CaiJ03,
author = {Leitzhen Cai and D. Juedes},
title = {On the existence of subexponential parameterized algorithms},
journal = jcss, volume = 67, year = 2003, pages = {789-807}}

%Cai 2006

@unpublished{Cai06,
author = {Leizhen Cai},
title = {Parameterized complexity of cardinality constrained optimization problems},
note = {Manuscript},
year = {2006}}

@inproceedings{CaiCC06,
author = {Leizhen Cai and  S. M. Chan and S. O. Chan},
title = {Random separation: a new method for solving fixed-cardinality
optimization problems},
editor = {Hans L. Bodlaender and Michael A. Langston},
booktitle = iwpec06, publisher = lncs4169, year = 2006, pages = {239-250}}

%Cai 2009

@article{Cai09,
author = {Xuan Cai},
title = {Linear kernelizations for restricted {3-Hitting Set} problems},
journal = ipl, volume = 109, year = 2009, pages = {730-738}}

%Cai 2010

@article{CaiH10,
author = {Liming Cai and Xiuzhen Huang},
title = {Fixed-parameter approximation: Conceptual framework and approximability results},
journal = alg, volume = 57, year = 2010, pages = {398-412}}

%Cal

@article{CalamoneriPP06,
author = {Tiziana Calamoneri and Andrzej Pelc and Rossella Petreschi},
title = {Labeling trees with a condition at distance two},
journal = dm, volume = 306, pages = {1534-1539}, year = 2006}

%Can

@inproceedings{CanoM94,
author = {A. Cano and S. Moral},
title = {Heuristic algorithms for the triangulation of graphs},
editor = {B. Bouchon-Meunier and R. R. Yager and I. A. Zadeh},
booktitle = {Advances in Intelligent Computing, Selected Papers from the 5th
International Conference on Precessing and Management of Uncertainty in
Knowledge-Based Systems IPMU94},
year = 1994, pages = {98-107},
publisher = lncs945}

%Car

@article{CaragiannisFKP06,
author = {Ioannis Caragiannis and Aleksei V. Fishkin and
Christos Kaklamanis and Evi Papaioannou},
title = {Randomized on-line algorithms and lower bounds for computing large
independent sets in disk graphs},
journal = dam, volume = 155, pages = {119-136}, year = 2007}

%Cas

@article{CastelinoHS96,
author = {D. Castelino and S. Hurley and N. M. Stephens},
title = {A tabu search algorithm for frequency assignment},
journal = aor, volume = 63, pages = {301-319}, year = 1996}

%Cat

@inproceedings{CattellD94,
author = {Kevin Cattell and Michael J. Dinneen},
title = {A characterization of graphs with vertex cover up to five},
booktitle = {Proceedings International Workshop on Orders, Algorithms, and Applications, ORDAL'94},
publisher = lncs831, year = 1994, pages = {86-99}}

@article{CattellDF96,
author = {Kevin Cattell and Michael J. Dinneen and Michael R. Fellows},
title = {A simple linear-time algorithm for finding path-decompositions of
small width},
journal = ipl, volume = 57, year = 1996, pages = {197-204}}

@inproceedings{CattellDF95,
author = {Kevin Cattell and Michael J. Dinneen and Michael R. Fellows},
title = {Obstructions to Within a Few Vertices or Edges of Acyclic},
editor = {Selim G. Akl and Frank K. H. A. Dehne and J\"{o}rg-R\"{u}diger Sack and Nicola Santoro},
booktitle = wads95, pages = {415-427}, publisher = lncs955, year = 1995}

@article{CattellDDFL00,
author = {Kevin Cattell and Michael J. Dinneen and Rodney G. Downey and
Michael R. Fellows and Michael A. Langston},
title = {On computing graph minor obstruction sets},
journal = tcs, volume = 233, year = 2000, pages = {107-127}}

%Ce

%Cer

@article{CeraDGV07,
author = {M. Cera and A. Dianez and P. Garcia-Vazquez and J.C. Valenzuela},
title = {Graphs without minor complete subgraphs},
journal = dm, volume = 307, year = 2007, pages = {1276-1284}}

%Ces

@article{Cesati02,
author = {M. Cesati},
title = {Perfect code is {$W[1]$}-complete},
journal = ipl, volume = 81, year = 2002, pages = {163-168}}

%Ch

%Cha

%Chan

@inproceedings{ChanD06,
author = {Hei Chan and Adnan Darwiche},
title = {On the robustness of most probable explanations},
booktitle = uai06, year = 2006, pages = {63-71}, publisher = {AUAI Press}}

@article{ChandraKS81,
author = {A. K. Chandra and D. C. Kozen and L. J. Stockmeyer},
title = {Alternation},
journal = jacm, volume = 28, pages = {114-133}, year = 1981 }

@article{ChandranS03,
author = {L. {Sunil Chandran} and C. R. Subramanian},
title = {A spectral lower bound for the treewidth of a graph and its consequences},
journal = ipl, volume = 87, year = 2003, pages = {195-200}}

@article{ChandranS05,
author = {L. {Sunil Chandran} and C. R. Subramanian},
title = {Girth and treewidth},
journal = jctb, volume = 93, year = 2005, pages = {23-32}}

@article{ChandraG06,
author = {L. {Sunil Chandran} and Fabrizio Grandoni},
title = {A linear time algorithm to list the minimal separators of chordal graphs},
journal = dm, volume = 306, pages = {351-358}, year = 2006}

@article{ChandranK06,
author = {L. {Sunil Chandran} and T. Kavitha},
title = {The treewidth and pathwidth of hypercubes},
journal = dm, volume = 306, pages = {359-365}, year = 2006}

@article{ChandranS07,
author = {L. {Sunil Chandran} and Naveen Sivadasan},
title = {Boxicity and treewidth},
journal = jctb, volume = 97, pages = {733-744}, year = 2007}

%Chandrasekharan 1980

@article{ChandrasekharanT80,
author = {R. Chandrasekharan and A. Tamir},
title = {An {$O((n \log p)^2 )$ } Algorithm for the Continuous
$p$-Center Problem on a Tree},
journal = sjadm, volume = 1, pages = {370-375}, year = 1980 }

%Chandrasekharan 1982

@article{ChandrasekharanT82,
author = {R. Chandrasekharan and A. Tamir},
title = {Polynomially Bounded Algorithms for Locating $p$-Centers on a
Tree},
journal = mp, volume = 22, year = 1982, pages = {304-315}}

%Chandrasekharan 1988

@article{ChandrasekharanI88,
author = {Narayanan Chandrasekharan and S. Sitharama Iyengar},
title = {{NC} algorithms for recognizing chordal graphs and
$k$-Trees},
journal = ietc, volume = 37, year = 1988, pages = {1178-1183}}

@article{ChandrasekhasanLI88,
author = {Narayanan Chandrasekharan and R. Laskar and S. S. Iyengar},
title = {Maximal clique separators of chordal graphs},
journal = cn, volume = 62, year = 1988, pages = {203-215}}

@inproceedings{ChandrasekharanH88,
author = {Narayanan Chandrasekharan and S. T. Hedetniemi},
title = {Fast parallel algorithms for tree decomposing and parsing partial $k$-Trees},
booktitle  = {Proceedings of the 26th Annual Allerton Conference on Communication, Control, and Computing},
year = 1988,
pages={283-292},
address = {Urbana-Champaign, Illinois}}

%Chandrasekharan 1989

@phdthesis{Chandrasekharan89,
author = {Narayanan Chandrasekharan},
title = {Fast Parallel Algorithms and Enumeration Techniques for Partial $k$-Trees},
school = {Clemson University},
year = 1989}

%Chandrasekharan 1990

@article{Chandrasekharan90a,
author = {Narayanan Chandrasekharan},
title = {Isomorphism testing of $k$-trees is in {NC}, for fixed $k$},
journal = ipl, volume = 34, year = 1990, pages = {283-287}}

%Chang

@article{ChangD87,
author = {K. Chang and D. Du},
title = {Efficient algorithms for the layer assignment problem},
journal = {IEEE Trans CAD}, volume = 6, year = 1987, pages = {67-78}}

@article{ChangK96,
author = {G. J. Chang and D. Kuo},
title = {The {$L(2,1)$}-labelling problem on graphs},
journal = sjdm, volume = 9, year = 1996, pages = {309-316}}

@article{Chang98,
author = {M.-S. Chang},
title = {Efficient algorithms for the domination problems on interval and
circular arc-graphs},
journal = siamjc, volume = 27, year = 1998, pages = {1671-1694}}

@article{ChangKKLY00,
author = {G. J. Chang and W.-T. Ke and D. Kuo and D.D.-F. Liu and R. K. Yeh},
title = {On {$L(d,1)$}-labelings of graphs},
journal = dm, volume = 220, pages = {57-66}, year = 2000}

@inproceedings{ChangT00,
author = {J. Chang and L. Tassiulas},
title = {Fast Approximate Algorithms for Maximum Lifetime Routing
in Wireless Ad-hoc Networks},
booktitle = {Proceedings Networking 2000}, year = 2000,
pages = {702-713}}

@article{ChangL03,
author = {G. J. Chang and C. Lu},
title = {Distance-two labelings of graphs},
journal = ejcom, year = 2003, volume = 24, pages = {53-58}}

@article{ChangT04,
author = {J. Chang and L. Tassiulas},
title = {Maximum lifetime routing in wireless sensor networks},
journal = {IEEE/ACM Transaction on Networking},
volume = 12, number = 4, year = 2004, pages = {609-619}}

%Chap

@inproceedings{ChapelleMT09,
author = {Mathieu Chapelle and Fr{\'e}d{\'e}ric Mazoit and Ioan Todinca},
title = {Constructing brambles},
editor = {Rastislav Kr{\'a}lovic and Damian Niwinski},
booktitle = mfcs09, year = 2009, publisher = lncs5734, pages = {223-234}}

%Char

@article{CharniakS94,
author = {Eugene Charniak and Solomon Eyal Shimony},
title = {Cost-based abduction and {MAP} explanation},
journal = ai, volume = 66, year = 1994, pages = {345-374}}

%Chau

@inproceedings{ChaudhuriZ95,
author = {Shiva Chaudhuri and Christos D. Zaroliagis},
title = {Optimal parallel shortest paths in small treewidth digraphs},
booktitle = esa95,
editor = {Paul Spirakis},
publisher = lncs979, year = 1995, pages = {31-45}}

@article{ChaudhuriZ98,
author = {Shiva Chaudhuri and Christos D. Zaroliagis},
title = {Shortest paths in digraphs of small treewidth. {P}art {II}: {O}ptimal
parallel algorithms},
journal = tcs, volume = 203, year = 1998, pages = {205-223}}

@article{ChaudhuriZ00,
author = {Shiva Chaudhuri and Christos D. Zaroliagis},
title = {Shortest paths in digraphs of small treewidth. {P}art {I}:
{S}equential Algorithms},
journal = alg, volume = 27, year = 2000, pages = {212-226}}


@article{ChavezT98,
author = {J. D. Chavez and R. Trapp},
title = {The cyclic cutwidth of trees},
journal = dam, volume = 87, year = 1998, pages = {25-32}}

%Che

%Chek

@article{ChekuriK05,
author = {C. Chekuri and S. Khanna},
title = {A Polynomial Time Approximation Scheme for the Multiple
Knapsack Problem},
journal = siamjc, volume = 35, number = 3, year = 2005,
pages = {713-728}}


%Chen 1988

@article{ChenKS88,
author = {G. H. Chen and M. T. Kuo and J. P. Sheu},
title = {An optimal time algorithm for finding a maximum weight
independent set in a tree},
journal = bit, year = 1988 }

%Chen 1992

@inproceedings{ChenL92,
author = {Maw-Hwa Chen and Sing-Ling Lee},
title = {Linear time algorithms for $k$-cutwidth problem},
editor = {Toshihide Ibaraki and Yasuyoshi Inagaki and Kazuo Iwama and Takao Nishizeki and Masafumi Yamashita},
booktitle = isaac92, year = 1992, publisher = lncs650, pages = {21-30}}

%Chen 1993

@inproceedings{Chen93,
author = {J. Chen},
title = {A linear time algorithm for isomorphism of graphs of bounded average genus},
editor = {Ernst W. Mayr},
booktitle = wg92, year = 1993, publisher = lncs657, pages = {103-113}}

%Chen 1995

@article{ChenMS95,
author = {Guantao Chen and Lisa R. Markus and R. H. Schelp},
title = {Vertex Disjoint Cycles for Star Free Graphs},
journal = {Australasian Journal of Combinatorics}, volume = 11, year = 1995,
pages = {157-167}}

%Chen 1998

@article{Chen98,
author = {Z.-Z. Chen},
title = {Efficient approximation schemes for maximization problems on
{$K_{3,3}$}-free or {$K_5$}-free graphs},
journal = ja, volume = 26, year = 1998, pages = {166-187}}

%Chen 2001

@article{Chen01,
author = {Z.-Z. Chen},
title = {Approximation algorithms for independent sets in map graphs},
journal = ja, volume = 41, pages = {20-40}, year = 2001}

@inproceedings{ChenFJK01,
author = {Jianer Chen and Donald K. Friesen and Weijia Jia and Iyad Kanj},
title = {Using nondeterminism to design deterministic algorithms},
booktitle = fsttcs01, year = 2001, pages = {120-131}, publisher = lncs2245}

@article{ChenKJ01,
author = {J. Chen and I. A. Kanj and W. Jia},
title = {Vertex cover: Further observations and further improvements},
journal = ja, volume = 41, year = 2001, pages = {280-301}}

%Chen 2003

@inproceedings{ChenKPSX03,
author = {Jianer Chen and Iyad A. Kanj and Ljubomir Perkovic and Eric Sedgwick and Ge Xia},
title = {Genus characterizes the complexity of graph problems: Some tight results},
editor = {Jos Baeten and Jan Karel Lenstra and Joachim Parrow and Gerhard J. Woeginger},
booktitle = icalp03, publisher = lncs2719, year = 2003, pages = {845-856}}

%Chen 2004

@inproceedings{Chen04,
author = {Hubie Chen},
editor = {Ramon L\'{o}pez {de M\'{a}ntaras} and Lorenza Saitta},
title = {Quantified Constraint Satisfaction and Bounded Treewidth},
booktitle = ecai2004, pages = {161-165}, year = 2004}

@inproceedings{ChenCFHJKX04,
author = {J. Chen and B. Chor and M. Fellows and X. Huang and D. Juedes and I. Kanj and G. Xia},
title= {Tight Lower Bounds for Certain Parameterized {N}{P}-hard Problems},
booktitle={Proceedings of 19th Annual IEEE Conference on Computational Complexity},
year = {2004},
pages = {150--160},
location = {Amherst, Massachusetts, United States}}

%Chen 2005

@article{Chen05,
author = {J.-E. Chen},
title = {Parameterized computation and complexity: A new approach dealing with
{NP}-hardness},
journal = jcss, volume = 20, pages = {18-37}, year = 2005}

@article{ChenCMXJKX05,
author = {Jianer Chen and Benny Chor and Mike Fellows and Xiuzhen Huang and
David W. Juedes and Iyad A.  Kanj and Ge Xia},
title = {Tight lower bounds for certain parameterized {NP}-hard problems},
journal = ic2, volume = {201}, year = {2005}, pages = {216-231}}

%Chen 2006

@article{ChenHS06,
author = {Xujin Chen and Xiaodong Hu and Tianping Shuai},
title = {Inapproximability and approximability of maximal tree routing and coloring},
journal = jco, volume = 11, year = 2006, pages = {219-229}}

@article{ChenHKX06,
author = {Jianer Chen and X. Huang and I. A. Kanj and G. Xia},
title = {On the computational hardness based on linear {FPT}-reductions},
journal = jco, volume = 11, year = 2006, pages = {231-247}}

@article{ChenHKX06a,
author = {Jianer Chen and X. Huang and I. A. Kanj and G. Xia},
title = {Strong computational lower bounds via parameterized complexity},
journal = jcss, volume = 72, year = 2006, pages = {1346-1367}}

%Chen 2007

@article{ChenFKX07,
author = {Jianer Chen and Henning Fernau and Iyad A. Kanj and Ge Xia},
title = {Parametric duality and kernelization: Lower bounds and upper bounds on kernel size},
journal = siamjc, volume = 37, year = 2007, pages = {1077-1106}}

@article{ChenHKX07,
author = {Jianer Chen and Xiuzhen Huang and Iyad A. Kanj and Ge Xia},
title = {Polynomial time approximation schemes and parameterized complexity},
journal = dam, volume = 155, year = 2007, pages = {180-193}}

@article{ChenLLLW07,
author = {Mingxia Chen and Jianbo Li and Jianping Li and Weidong Li
and Lusheng Wang},
title = {Some approximation algorithms for the clique partition problem
in weighted interval graphs},
journal = tcs, volume = 381, year = 2007, pages = {124-133}}

@inproceedings{ChenLSZ07,
author = {Jianer Chen and Songjian Lu and Sing-Hoi Sze and Fenghui Zhang},
title = {Improved algorithms for path, matching, and packing problems},
booktitle = soda07,
editor = {Nikhil Bansal and Kirk Pruhs and Clifford Stein},
pages = {298-307}, year = 2007}

%Chen 2008

@article{ChenFLLV08,
author = {Jianer Chen and Fedor V. Fomin and Yang Liu and Songjian Lu and Yngve Villanger},
title = {Improved algorithms for feedback vertex set problems},
journal = jcss, volume = 74, year = 2008, pages = {1188-1198}}

@inproceedings{ChenLLSR08,
author = {Jianer Chen and Yang Liu and Songjian Lu and Barry {O'Sullivan} and Igor Razgon},
title = {A fixed-parameter algorithm for the directed feedback vertex set problem},
editor = {Richard E. Ladner and Cynthia Dwork},
booktitle = stoc08, pages = {177-186}, year = 2008}

%Chen 2009

@article{ChenKX09,
author = {Jianer Chen and Iyad A. Kanj and Ge Xia},
title = {On parameterized exponential time complexity},
journal = tcs, year = 2009, volume = 410, pages = {2641-2648}}

@article{ChenLL09,
author = {Jianer Chen and Yang Liu and Songjian Lu},
title = {An improved parameterized algorithm for the minimum node multiway cut problem},
journal = alg, year = 2009, volume = 55, pages = {1-13}}

@article{ChenL09,
author = {Jianer Chen and Songjian Lu},
title = {Improved parameterized set splitting algorithms: A probabilistic approach},
journal = alg, volume = 54, year = 2009, pages = {472-489}}

%Cher

@article{CheritonT76,
author = {D. Cheriton and R. E. Tarjan},
title = {Finding minimum spanning trees},
journal = siamjc, year = 1976, pages = {724-742}}

@article{CheriyanM88,
author = {J. Cheriyan and S. N. Maheshwari},
title = {Finding nonseparating induced cycles and independent spanning
trees in 3-connected graphs},
journal = ja, volume = 9, pages = {507-537}, year = 1988 }

%Chi

@article{ChibaNS81,
author = {N. Chiba and Takao Nishizeki and N. Saito},
title = {A linear algorithm for five-coloring a planar graph},
journal = ja, year = 1981, volume = 2, pages = {317-327}}

@article{ChibaN85,
author = {N. Chiba and Takao Nishizeki},
title = {Arboricity and Subgraph Listing Algorithms},
journal = siamjc, volume = 14, pages = {210-223}, year = 1985}

@article{ChibaN89,
author = {N. Chiba and Takao Nishizeki},
title = {The {H}amiltonian Cycle problem is linear-time solvable for
4-connected planar graphs},
journal = ja, volume = 10, pages = {187-211}, year = 1989}

@article{ChinnCDG82,
author = {P. Z. Chinn and J. Chv\'{a}talov\'{a} and A. K. Dewdney and N. E.
Gibbs},
title = {The bandwidth problem for graphs and matrices --- A survey},
journal = jgt, volume = 6, year = 1982, pages = {223-254}}

%Chl

@article{Chlebik08,
author = {Miroslav Chleb{\'\i}k and Janka Chleb{\'\i}kov{\'{a}}},
title = {Crown reductions for the {M}inimum {W}eighted {V}ertex {C}over problem},
journal = dam, volume = 156, year = 2008, pages = {292-312}}

@article{Chlebikova92,
author = {J. Chleb{\'\i}kov{\'{a}}},
title = {On the tree width of a graph},
journal = {Acta Mathematica Universitatis Comenianae},
volume = {LXI}, number = 2, pages = {225-236}, year = 1992}

@article{Chlebikova02,
author = {J. Chleb{\'\i}kov{\'{a}}},
title = {The structure of obstructions to treewidth and pathwidth},
journal = dam, volume = 120, pages = {61-71}, year = 2002}

@article{ChlebikovaJ07,
author = {Janka Chleb{\'\i}kov{\'{a}} and Klaus Jansen},
title = {The $d$-precoloring problem for $k$-degenerate graphs},
journal = dm, volume = 307, year = 2007, pages = {2082-2093}}

%Cho

@inproceedings{ChorFRRRS07,
author = {B. Chor and M. Fellows and M. Ragan and F. Rosamond and I. Razgon and S. Snir},
title = {Connected coloring completion for general graphs: algorithms and complexity},
editor = {Guohui Lin},
booktitle = cocoon07, publisher = lncs4598, pages = {75-85}, year = 2007}

@article{ChouWZ03,
author = {C. Chou and W. Wang and X. Zhu},
title = {Relaxed game chromatic number of graphs},
journal = dm, year = 2007, volume = 262, pages = {89-98}}

@article{ChouKHC07,
author = {Hsin-Hung Chou and Ming-Tat Ko and Chin-Wen Ho and Gen-Huey Chen},
title = {Node-searching problem on block graphs},
journal = dam, volume = 156, year = 2007, pages = {55-75}}

%Chr

@book{Christofides75,
author = {N. Christofides},
title = {Graph Theory: An Algorithmic Approach},
publisher = {Academic Press},
address = {New York},
year = 1975 }

@article{ChrobakN90,
author = {Marek Chrobak and Takao Nishizeki},
title = {Improved Edge-Coloring Algorithms for Planar Graphs},
journal = ja, volume = 102, year = 1990, pages = {102 - 116}}

@techreport{ChrobakK93,
author = {M. Chrobak and G. Kant},
title = {Convex Grid Drawings of 3-Connected Planar Graphs},
type = tr, institution = vi, number = {RUU-CS-93-45}, year = 1993}

%Chu

%Chud

@article{ChudakGHW98,
author = {F. A. Chudak and M. X. Goemans and D. S. Hochbaum and D. P. Williamson},
title = {A primal--dual interpretation of two 2-approximation algorithms
for the feedback vertex set problem in undirected graphs},
journal = orl, volume = 22, year = 1998, pages = {111-118}}

@article{ChudnovskyRST06,
author = {Maria Chudnovsky and Neil Robertson and Paul D. Seymour and Robin Thomas},
title = {The strong perfect graph theorem},
journal = {Annals of Mathematics}, volume = 164, pages = {51-229}, year = 2006}

@article{ChudnovskyRST10,
author = {Maria Chudnovsky and Neil Robertson and Paul D. Seymour and Robin Thomas},
title = {$K_4$-free graphs with no odd holes},
journal = jctb, volume = 100, year = 2010, pages = {313-331}}

%Chung 1984

@article{Chung84,
author = {F. R. K. Chung},
title = {On Optimal Linear Arrangement of Trees},
journal = {Computers \& Mathematics with Applications}, volume = 10, year = 1984, pages = {43-60}}

%Chung 1985

@article{Chung85,
author = {F. R. K. Chung},
title = {On the Cutwidth and Topological Bandwidth of a Tree},
journal = sjadm, volume = 6, year = 1985, pages = {268-277}}

@article{ChungMST85,
author = {M.-J. Chung and F. S. Makedon and Ivan Hal Sudborough and J.
Turner},
title = {Polynomial Time Algorithms for the Min Cut Problem on Degree
Restricted Trees},
journal = siamjc, year = 1985, volume = 14, pages = {158-177}}

%Chung 1986

@article{ChungLR86,
author = {F. R. K. Chung and F. T. Leighton and A. L. Rosenberg},
title = {Embedding graphs in books: {A} graph layout problem with
applications to {VLSI} design},
year = 1986, journal = sjadm }

%Chung 1989

@article{ChungS89,
author = {F. R. K. Chung and Paul D. Seymour},
title = {Graphs with small bandwidth and cutwidth},
journal = dm, volume = 75, pages = {113-119}, year = 1989}

%Chung 1994

@article{ChungM94,
author = {F. R. K. Chung and David Mumford},
title = {Chordal Completions of Planar Graphs},
journal = jctb, volume = {62}, pages = {96-106}, year = 1994}

%Cl

%Cla

@inproceedings{ClautiauxCMN03,
author = {F. Clautiaux and J. Carlier and A. Moukrim and S. N\'{e}gre},
title = {New lower and upper bounds for graph treewidth},
editor = {J. D. P. Rolim},
booktitle = wea03, publisher = lncs2647, year = 2003, pages = {70-80}}

@article{ClautiauxMNC04,
author = {F. Clautiaux and A. Moukrim and S. N{\'e}gre and J. Carlier},
title = {Heuristic and Meta-Heuristic Methods for Computing Graph Treewidth},
journal = {RAIRO Operations Research}, volume = 38, year = 2004, pages = {13-26}}

%Cle

@article{ClearyJ09,
author = {Sean Cleary and Katherine {St. John}},
title = {Rotation distance is fixed-parameter tractable},
journal = ipl, volume = 109, year = 2009, pages = {918-922}}

%Co

%Coc

%Cockayne 1975

@article{CockayneGH75,
author = {E. J. Cockayne and S. E. Goodman and S. T. Hedetniemi},
title = {A Linear Algorithm for the Domination Number of a Tree},
journal = ipl, volume = 4, year = 1975, pages = {41-44}}

%Cockayne 1981

@article{CockayneFPT81,
author = {E. J. Cockayne and O. Favaron and C. Payan and A. Thomason},
title = {Contributions to the Theory of Domination, Independence, and
Irredundance in Graphs},
journal = dm, vol = 33, year = 1981, pages = {249-258}}

%Cockayne 1986

@article{CockayneH86,
author = {E. J. Cockayne and D. E. Hewgill},
title = {Exact computation of {S}teiner minimal trees in the plane},
journal = ipl, volume = 2, year = 1986, pages = {151-156}}

%Cockayne 2004

@article{CockayneDHH04,
author = {E. J. Cockayne and P. A. Dreyer and S. M. Hedetniemi and S. T.
Hedetniemi},
title = {Roman domination in graphs},
journal = dm, volume = 278, year = 2004, pages = {11-22}}

%Cockayne 2007

@article{Cockayne07,
author = {E. J. Cockayne},
title = {Irredundance, secure domination and maximum degree in trees},
journal = dm, volume = 307, year = 2007, pages = {12-17}}


%Coh

@techreport{CohenSTV92,
author = {Robert F. Cohen and S. Sairam and Roberto Tamassia and J. S. Vitter},
title = {Dynamic Algorithms for Bounded Tree-Width Graphs},
type = {Technical Report},
number = {CS-92-19},
institution = {Department of Computer Science, Brown University},
year = 1992}

@inproceedings{CohenSTV93,
author = {Robert F. Cohen and S. Sairam and Roberto Tamassia and J. S. Vitter},
title = {Dynamic Algorithms for Optimization Problems in Bounded Tree-Width Graphs},
editor = {Giovanni Rinaldi and Laurence A. Wolsey},
booktitle = {Proceedings of the 3rd Conference on Integer Programming and Combinatorial Optimization, IPCO'93},
pages = {99-112},
year = 1993}

@inproceedings{CohenT93,
author = {Robert F. Cohen and Roberto Tamassia},
title = {Combine and Conquer},
booktitle = esa93,
editor = {Thomas Lengauer},
year = 1993,
pages = {97-108},
publisher = lncs726,
}

%Col

%Colb

@article{ColbournB81,
author = {Charles J. Colbourn and K. S. Booth},
title = {Linear time automorphism algorithms for trees, interval graphs, and
planar graphs},
journal = siamjc, volume = 10, pages = {203-225}, year = 1981}

@inproceedings{ColbournP84,
author = {Charles J. Colbourn and Andrzej Proskurowski},
title = {Concurrent transmissions in broadcast networks},
editor = {Jan Paredaens},
booktitle = icalp84, publisher = lncs172, pages = {128-136}, year = 1984}

@article{ColbournS85,
author = {Charles J. Colbourn and L. K. Stewart},
title = {Dominating cycles in series-parallel graphs},
journal = arscomb, volume = {19A}, year = 1985, pages = {107-112}}

@article{ColbournDN89,
author = {Charles J. Colbourn and Robert P. J. Day and Louis D. Nel},
title = {Unranking and ranking spanning trees of a graph},
journal = ja, volume = 10, year = 1989, pages = {271-286}}

%Cole

@article{ColeV88,
author = {Richard Cole and Uzi Vishkin},
title = {The Accelerated Centroid Decomposition Technique for Optimal
Parallel Tree Evaluation in Logarithmic Time},
journal = alg, year = 1988, volume = 3, pages = {329-346}}

@article{ColeV91,
author = {Richard Cole and Uzi Vishkin},
title = {Approximate Parallel Scheduling {II}. {A}pplications to
Logarithmic-Time Optimal Parallel Graph Algorithms},
journal = ic2, volume = 92, pages = {1-47}, year = 1991}

@article{ColeZ95,
author = {Richard Cole and Ofer Zajicek},
title = {An asynchronous parallel algorithm for undirected graph
connectivity},
journal = ja, volume = 18, pages = {50-97}, year = 1995}

@article{ColeK08,
author = {Richard Cole and {\L}ukasz Kowalik},
title = {New linear-time algorithms for edge-coloring planar graphs},
journal = alg, volume = 50, year = 2008, pages = {351-368}}

%Coli

@article{Colin98,
author = {Y. {Colin de Verdi\`{e}re}},
title = {Multiplicities of eigenvalues and tree-width of graphs},
journal = jctb, volume = 74, pages = {121-146}, year = 1998}

%Com

@unpublished{ComptonH83,
author = {K. Compton and C. W. Henson},
title = {A simple method for proving lower bounds on the complexity of logical
theories},
note = {Extended abstract, preprint}, year = 1983}

@techreport{ComptonH87,
author = {K. Compton and C. W. Henson},
title = {A Uniform Method for Proving Lower Bounds on the Computational
Complexity of Logical Theories},
number = {CRL-TR-04-87},
institution = {The University of Michigan, Computing Research
Laboratory},
pages = 53,
year = 1987, month = {April}, type = {Report}}

%Con

@techreport{CondonFLS93,
author = {Anne Condon and Joan Feigenbaum and Casten Lund and Peter Shor},
title = {Probabilistic Checkable Debate Systems and Approximation Algorithms
for {PSPACE}-hard Functions},
institution = {DIMACS},
year = 1993}

@unpublished{CondonFLS93a,
author = {Anne Condon and Joan Feigenbaum and Casten Lund and Peter Shor},
title = {Random Debaters and the Hardness of Approximating Stochastic
Functions (Extended Abstract)},
note = {Manuscript},
year = 1993}

@book{Conway76,
author = {J. H. Conway},
title = {On Numbers and Games},
publisher = {Academic Press},
address = {London}, year = 1976 }

%Coo

@inproceedings{Cook71,
author = {S. A. Cook},
title = {The complexity of theorem-proving procedures},
booktitle = stoc71,
publisher = {ACM}, address = {New York}, year = 1971, pages = {151-158}}

@techreport{CookS93,
author = {William Cook and Paul D. Seymour},
title = {An Algorithm for the Ring-Routing Problem},
institution = {Bellcore},
year = 1993,
type = {Bellcore Technical Memorandum}}

@misc{Cook96,
author = {William Cook},
year = 1996, note = {Personal communication}}

@article{CookS03,
author = {William Cook and Paul D. Seymour},
title = {Tour merging via branch-decomposition},
year = 2003, number = 3, volume = 15, pages = {233-248},
journal = informsjc}

@article{Cooper90,
author = {Gregory F. Cooper},
title = {The computational complexity of probabilistic inference using
{B}ayesian belief networks},
journal = artint, volume = 42, pages = {393--405}, year = 1990}

@techreport{Cooper93,
author = {Gregory F. Cooper},
title = {Bayesian Belief-Network Inference Using Recursive Decomposition},
number = {KSL 90-05},
year = 1990,
institution = {Knowledge Systems Laboratory, Medical Computer Science,
Stanford}}

@techreport{Cooper93a,
author = {Gregory F. Cooper},
title = {A Recursive-Decomposition Method for Solving {AI} Graph Problems},
number = {SMI-91-2},
institution = {Section of Medical Informatics, University of Pittsburgh},
year = 1993}

%Cop

@article{CoppersmithV85,
author = {D. Coppersmith and Uzi Vishkin},
title = {Solving {NP}-Hard Problems in 'Almost Trees': Vertex Cover},
journal = dam, year = 1985, volume = 10, pages = {27-45}}

@article{CoppersmithW90,
author = {D. Coppersmith and S. Winograd},
title = {Matrix multiplication via arithmetic progression},
journal = {Journal of Symbolic Computation}, volume = 9, year = 1990, pages = {251-280}}

%Cor

@book{CormenLR89,
author = {Thomas H. Cormen and Charles E. Leiserson and Ronald L. Rivest},
title = {Introduction to Algorithms},
publisher = {MIT Press}, address = {Cambridge, Mass., USA}, year = 1989}

@book{CormenLRS01,
author = {Thomas H. Cormen and Charles E. Leiserson and Ronald L. Rivest
and Clifford Stein},
title = {Introduction to Algorithms, Second Edition},
publisher = {MIT Press}, address = {Cambridge, Mass., USA}, year = 2001}

%Corneil 1981

@article{CorneilLS81,
author = {Derek G. Corneil and H. Lerchs and L. {Stewart Burlingham}},
title = {Complement reducible graphs},
journal = adm, volume = 1, year = 1981, pages = {145-162}}

%Corneil 1983

@article{CorneilK83,
author = {Derek G. Corneil and D. G. Kirkpatrick},
title = {Families of recursively defined perfect graphs},
journal = cn, volume = 39, year = 1983, pages = {237-246}}

%Corneil 1984

@article{CorneilP84,
author = {Derek G. Corneil and Y. Perl},
title = {Clustering and domination in perfect graphs},
journal = dam, volume = 9, year = 1984, pages = {27-39}}

@article{CorneilPS84,
author = {Derek G. Corneil and Y. Perl and L. K. Stewart},
title = {Cographs: recognition, applications and algorithms},
journal = cn, volume = 43, year = 1984, pages = {249-258}}

%Corneil 1985

@article{CorneilPS85,
author = {Derek G. Corneil and Y. Perl and L. K. Stewart},
title = {A linear recognition algorithm for cographs},
journal = siamjc, year = 1985, pages = {926-934}, volume = 14 }

%Corneil 1987

@article{CorneilK87,
author = {Derek G. Corneil and J. Mark Keil},
title = {A Dynamic Programming Approach to the Dominating Set Problem on $k$-trees},
journal = sjadm, pages = {535-543}, volume = 8, year = 1987 }

%Corneil 1992

@techreport{CorneilOS92,
author = {Derek G. Corneil and Stephan Olariu and Lorna Stewart},
title = {Asteroidal Triple-Free Graphs},
number = {262/92},
year = 1992, type = {Technical Report},
institution = {Dept. of Computer Science, University of Toronto}}

@unpublished{CorneilOS??,
author = {Derek G. Corneil and Stephan Olariu and Lorna Stewart},
title = {The linear structure of graphs: asteroidal triple-free graphs},
note = {Manuscript}}

%Corneil 1995

@article{CorneilKNOS95,
author = {Derek G. Corneil and Hiryoung Kim and Sridhar Natarajan and
Stephan Olariu and Alan P. Sprague},
title = {Simple Linear Time Recognition of Unit Interval Graphs},
year = 1995, journal = ipl, volume = 55, pages = {99-104}}

%Corneil 1997

@article{CorneilOS97,
author = {Derek G. Corneil and S. Olariu and L. Stewart},
title = {Asteroidal triple-free graphs},
journal = sjdm, volume = 10, year = 1997, pages = {399-430}}

@unpublished{CorneilS??,
author = {Derek G. Corneil and L. K. Stewart},
title = {Dominating Sets in Perfect Graphs},
note = {preprint}}

%Corneil 2000

@inproceedings{CorneilHLRR00,
author = {Derek G. Corneil and M. Habib and J. M. Lanlignel and Bruce Reed and Udi Rotics},
title = {Polynomial time recognition of clique-width $\leq 3$ graphs (Extended Abstract)},
editor = {Gaston H. Gonnet and Daniel Panario and Alfredo Viola},
booktitle = latin00, publisher = lncs1776, year = 2000, pages = {126-134}}

@article{CorneilOS00,
author = {Derek G. Corneil and Stephan Olariu and Lorna Stewart},
title = {Linear time algorithms for dominating pairs in asteroidal
triple-free graphs},
journal = siamjc, volume = 28, year = 2000, pages = {1284-1297}}

%Corneil 2004

@article{Corneil04,
author = {Derek G. Corneil},
title = {A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs},
journal = dam, volume = 138, pages = {371-379}, year = 2004}

%Corneil 2010

@article{CorneilKL10,
author = {Derek G. Corneil and Ekkehard K\"{o}hler and Jean-Marc Lanlignel},
title = {On end-vertices of {L}exicographic {B}readth {F}irst {S}earches},
journal = dam, volume = 158, year = 2010, pages = {434-443}}

%Cornuejols

@article{CornuejolsNP83,
author = {G. Cornu\'{e}jols and D. Naddef and W. R. Pulleyblank},
title = {{H}alin graphs and the Traveling Salesman problem},
journal = mp, volume = 26, year = 1983, pages = {287-294}}


%Cos

@article{CosmadakisP84,
author = {Stavros S. Cosmadakis and Christos H. Papadimitriou},
title = {The Travelling Salesman Problem with Many Visits to Few
Cities},
journal = siamjc, volume = 13, pages = {99-108}, year = 1984 }

%Cou

%Courcelle 1983

@article{Courcelle83,
author = {Bruno Courcelle},
title = {Fundamental properties of infinite trees},
journal = tcs, volume = 25, year = 1983, pages = {375-393}}

%Courcelle 1986

@article{Courcelle86,
author = {Bruno Courcelle},
title = {Equivalence and transformation of regular systems. {A}pplications to
recursive program schemes and grammars},
journal = tcs, volume = 42, pages = {1-22}, year=1986}

%Courcelle 1987

@inproceedings{Courcelle87,
author = {Bruno Courcelle},
title = {A representation of graphs by algebraic expressions and its use for graph rewriting systems},
editor = {Hartmut Ehrig and Manfred Nagl and Grzegorz Rozenberg and Azriel Rosenfeld},
booktitle = gragra86, publisher = lncs291, pages = {112-132}, year = 1987}

@inproceedings{Courcelle87a,
author = {Bruno Courcelle},
title = {On context-free sets of graphs and their monadic second-order theory},
editor = {Hartmut Ehrig and Manfred Nagl and Grzegorz Rozenberg and Azriel Rosenfeld},
booktitle = gragra86, publisher = lncs291, pages = {133-146}, year = 1987}

@article{Courcelle87b,
author = {Bruno Courcelle},
title = {An axiomatic definition of context-free rewriting and its
application to {NLC} graph grammars},
journal = tcs, volume = 55, pages = {141-181}, year = 1987 }

%Courcelle 1988

@inproceedings{Courcelle88a,
author = {Bruno Courcelle},
title = {On using context-free graph grammars for analysing recursive definitions},
booktitle = {Proceedings of the 2nd French-Japanese seminal on Artificial Intelligence},
publisher = {North-Holland Pub. Co.},
year = 1988}

@article{Courcelle88c,
author = {Bruno Courcelle},
title = {The Monadic Second-order Logic of Graphs {III}: {T}reewidth, Forbidden Minors and Complexity Issues},
journal = {Informatique Th\'{e}orique}, volume = 26, pages = {257-286}, year = 1992}

@article{Courcelle88d,
author = {Bruno Courcelle},
title = {Some applications of logic of universal algebra, and of category theory to the theory of graph transformations},
journal = beatcs, volume = 36, year = 1988, pages = {161-218}}

@article{Courcelle88e,
author = {Bruno Courcelle},
title = {Corrections and Additions to ``Some applications of
logic of universal algebra, and of category
theory to the theory of graph transformations''},
journal = beatcs, volume = 37, year = {1988??}, pages = {194-195}}

%Courcelle 1989

@article{Courcelle89,
author = {Bruno Courcelle},
title = {The monadic second-order logic of graphs {II}: Infinite graphs of
bounded width},
journal = mst, volume = 21, pages = {187-221}, year = 1989}

%Courcelle 1990

@article{Courcelle90,
author = {Bruno Courcelle},
title = {The monadic second-order logic of graphs {I}: {R}ecognizable sets of finite graphs},
journal = ic2, volume = 85, year = 1990, pages = {12-75}}

@inproceedings{Courcelle90a,
author = {Bruno Courcelle},
title = {Graph rewriting: an algebraic and logical approach},
booktitle = {Handbook of Theoretical Computer Science, volume {B}},
editor = {Jan van Leeuwen},
address = {Amsterdam}, year = 1990,
publisher = {North Holland Publ. Comp.},
pages = {192-242}
}

@article{Courcelle90b,
author = {Bruno Courcelle},
title = {The monadic second-order logic of graphs {IV}: {D}efinable properties
of equational graphs},
journal = apal, volume = 49, year = 1990, pages = {193-255}}

%Courcelle 1991

@article{Courcelle91,
author = {Bruno Courcelle},
title = {The monadic second-order logic of graphs {V}: {O}n closing
the gap between definability and recognizability},
journal = tcs, volume = 80, year = 1991, pages = {153-202}}

%Courcelle 1992

@article{Courcelle92,
author = {Bruno Courcelle},
title = {The monadic second-order logic of graphs {VII}: Tree-decompositions, minor and complexity issues},
journal = ita, volume = 101, year = 1992, pages = {257-286}}

@techreport{CourcelleL92,
author = {Bruno Courcelle and Jens Lagergren},
title = {Recognizable sets of graphs with bounded treewidth},
number = {92-68},
institution = {LaBRI, Bordeaux}, year = 1992}

@article{CourcelleM93,
author = {Bruno Courcelle and M. Mosbah},
title = {Monadic second-order evaluations on tree-decomposable graphs},
journal = tcs, volume = {109}, year = 1993, pages = {49-82}}

%Courcelle 1993

@inproceedings{Courcelle93,
author = {Bruno Courcelle},
title = {Graph Grammars, Monadic Second-Order Logic and the Theory of Graph Minors},
booktitle = {Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint
Summer Research Conference, Seattle WA, June 1991},
publisher = {American Math. Soc.},
address = {Providence, RI},
editor = {Neil Robertson and Paul Seymour},
note = {Contemp. Math. 147.},
pages = {565 - 590},
year = 1993}

%Courcelle 1994

@article{Courcelle94,
author = {Bruno Courcelle},
title = {The Monadic Second-Order Logic of Graphs {VI}: On several representations of graphs by relational structures},
journal = dam, volume = 54, year = 1994, pages = {117-149}}

%Courcelle 1995

@article{Courcelle95,
author = {Bruno Courcelle},
title = {The Monadic Second-Order Logic of Graphs {VIII}: {O}rientations},
journal = apal, volume = 72, year = 1995, pages = {103-143}}

@article{Courcelle95a,
author = {Bruno Courcelle},
title = {The Monadic Second-Order Logic of Graphs {VI}: {O}n several representations of graphs by relational structures, Erratum},
journal = dam, volume = 63, year = 1995, pages = {199-200}}

@misc{CourcelleS95,
author = {Bruno Courcelle and G. S{\'{e}}nizergues},
title = {The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed},
year = 1995}

%Courcelle 1996

@article{CourcelleL96,
author = {Bruno Courcelle and Jens Lagergren},
title = {Equivalent definitions of recognizability for sets of graphs of bounded tree-width},
journal = {Mathematical Structures in Computer Science}, volume = 6, year = {1996}, pages = {141-166}}

%Courcelle 1998

@inproceedings{CourcelleMR98,
author = {Bruno Courcelle and J. A. Makowsky and U. Rotics},
title = {Linear time solvable optimization problems on graphs of bounded clique width},
editor = {Juraj Hromkovic and Ondrej S\'{y}kora},
booktitle = wg98, publisher = lncs1517, year = 1998, pages = {1-16}}

%Courcelle 2000

@article{CourcelleO00,
author = {Bruno Courcelle and S. Olariu},
title = {Upper bounds to the clique-width of graphs},
journal = dam, volume = 101, year = 2000, pages = {77-114}}

@article{CourcelleMR00,
author = {Bruno Courcelle and J. A. Makowsky and U. Rotics},
title = {Linear time solvable optimization problems on graphs of bounded
clique width},
journal = tcs, volume = 33, year = 2000, pages = {125-150}}

%Courcelle 2001,

@article{CourcelleMR01,
author = {Bruno Courcelle and J. A. Makowsky and U. Rotics},
title = {On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic},
journal = dam, volume = 108, year = 2001, pages = {23-52}}

%Courcelle 2003

@article{Courcelle03,
author = {Bruno Courcelle},
title = {The monadic second-order logic of graphs {XIV}: Uniformly
sparse graphs and edge set quantifications},
journal = tcs, volume = 299, pages = {1-36}, year = 2003}

%Courcelle 2005

@article{CourcelleW05,
author = {Bruno Courcelle and Pascal Weil},
title = {The recognizability of sets of graphs is a robust property},
journal = tcs, volume = 342, pages = {173-228}, year = 2005}

%Courcelle 2006

@article{Courcelle06,
author = {Bruno Courcelle},
title = {The monadic second-order logic of graphs {XV}: On a conjecture by {D.} {S}eese},
journal = {Journal of Applied Logic}, volume = 4, year = 2006, pages = {79-114}}

%Courcelle 2007

@article{CourcelleO07,
author = {Bruno Courcelle and Sang-il Oum},
title = {Vertex-minors, monadic second-order logic, and a conjecture by {S}eese},
journal = jctb, volume = 97, year = 2007, pages = {91-126}}

%Courcelle 2009

@article{CourcelleK09,
author = {Bruno Courcelle and Mamadou Moustapha Kant\'{e}},
title = {Graph operations characterizing rank-width},
journal = dam, volume = 157, year = 2009, pages = {627-640}}

%Cournier

@inproceedings{CournierH93,
author = {A. Cournier and M. Habib},
title = {An efficient algorithm to recognize prime undirected graphs},
editor = {Ernst W. Mayr},
booktitle = wg92, year = 1993, publisher = lncs657, pages = {212-224}}

@inproceedings{CournierH94,
author = {A. Cournier and M. Habib},
title = {A new linear algorithm for modular decomposition},
booktitle = {Trees in algebra and programming, CAAP'94},
editor = {Tison Sophie},
year = 1994,
pages = {68-84},
publisher = lncs787}

%Cu

%Cur

@article{CurtisIJLM10,
author = {Andrew R. Curtis and Clemente Izurieta and Benson Joeris and Scott Lundberg and Ross M. McConnell},
title = {An implicit representation of chordal comparability graphs in linear time},
journal = dam, volume = 158, year = 2010, pages = {869-875}}

%Cy

%Cyg

@article{CyganKW09,
author = {Marek Cygan and  {\L}ukasz Kowalik and Mateusz Wykurz},
title = {Exponential-time approximation of weighted set cover},
journal = ipl, volume = 109, year = 2009, pages = {957-961}}

%Cz

@article{CzumajHLN05,
author = {Artur Czumaj and Magn\'{u}s M. Halld\'{o}rsson and Andrzej Lingas and Johan Nilsson},
title = {Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth},
journal = ipl, volume = 94, year = 2005, pages = {49-53}}

%D

%Da

%Dah

%Dahlhaus 1986

@techreport{DahlhausK86,
author = {Elias Dahlhaus and Marek Karpinski},
title = {The Matching Problem for Strongly Chordal Graphs is in {NC}},
type = {Research Report},
number = {855-CS},
institution = {University of Bonn}, address = {Bonn},
year = 1986 }

%Dahlhaus 1988

@article{DahlhausK88,
author = {Elias Dahlhaus and Marek Karpinski},
title = {Parallel Construction of Perfect Matchings and {H}amiltonian
Cycles on Dense Graphs},
year = 1988, journal = tcs, volume = 61, pages = {112-136}}

%Dahlhaus 1993

@inproceedings{Dahlhaus93,
author = {Elias Dahlhaus},
title = {Optimal (parallel) algorithms for the all-to-all vertices distance problem for certain graph classes},
editor = {Ernst W. Mayr},
booktitle = wg92, year = 1993, publisher = lncs657, pages = {60-69}}

%Dahlhaus 1995

@article{Dahlhaus95,
author = {Elias Dahlhaus},
title = {Efficient parallel recognition algorithms of cographs and distance
hereditary graphs},
journal = dam, volume = 57, year = 1995, pages = {29-44}}

%Dahlhaus 1997

@inproceedings{Dahlhaus97,
author = {Elias Dahlhaus},
title = {Minimal elimination ordering inside a given chordal graph},
editor = {Rolf H. M\"{o}hring},
booktitle = wg97, pages = {132-143}, year = 1997, publisher = lncs1335}

%Dahlhaus 1998

@inproceedings{Dahlhaus98,
author = {Elias Dahlhaus},
title = {Minimum fill-in and treewidth for graphs modularly decomposable into
chordal graphs},
editor = {Juraj Hromkovic and Ondrej S\'{y}kora},
booktitle = wg98, pages = {351-358}, year = 1998, publisher = lncs1517}

%Dahlhaus 2001

@article{DahlhausGM01,
author = {E. Dahlhaus and J. Gustedt and R. M. Mc{C}onnell},
title = {Efficient and practical modular decomposition},
journal = ja, volume = 41, pages = {360-387}, year = 2001}

%Dahlof

@article{DahlofJB04,
author = {V. Dahl\"{o}f and P. Johnsson and R. Beigel},
title = {Algorithms for four variants of the exact satisfiability problem},
journal = tcs, volume = 320, year = 2004, pages = {373-394}}

%Dag

@article{DagnumL93,
author = {Paul Dagnum and Michael Luby},
title = {Approximating probabilistic inference in {B}ayesian belief networks is
{NP}-hard},
journal = artint, volume = 60, year = 1993, pages = {141-153}}

%Dai

@inproceedings{DaiS90,
author = {W. W. Dai and M. Sato},
title = {Minimal forbidden minor characterization of planar partial
3-trees and application to circuit layout},
booktitle = {Proceedings IEEE International Symposium on Circuits and Systems},
year = 1990, pages = {2677-2681}}

@article{DaiY09,
author = {Decheng Dai and Changyuan Yu},
title = {A $5+\epsilon$-approximation algorithm for minimum weighted
dominating set in unit disk graphs},
journal = tcs, volume = 410, year = 2009, pages = {756-765}}

%Dal

@unpublished{DaligaultT09,
author = {Jean Daligault and St\'{e}phan Thomass\'{e}},
title = {On finding directed trees with many leaves},
year = 2009,
note = {In proceedings IWPEC 2009}}

@inproceedings{DalmauKV02,
author = {Victor Dalmau and Phokion G. Kolaitis and Moshe Y. Vardi},
title = {Constraint satisfaction, bounded treewidth, and finite-variable
logics},
booktitle = {Proceedings of the 8th International Conference on Principles and
Practice of Constraint Programming},
pages = {310-326},
publisher = lncs2470, year = 2002}

%Dam

%Damaschke 1989

@techreport{Damaschke89,
author = {Peter Damaschke},
title = {Paths in Interval Graphs and Circular Arc Graphs},
number = {N/89/4},
institution = {Friedrich-Schiller-University Jena, GDR},
year = 1989 }

@article{Damaschke89a,
author = {Peter Damaschke},
title = {The Hamiltonian circuit problem for circle graphs is
{NP}-complete},
journal = ipl, volume = 32, year = 1989, pages = {1-2}}

%Damaschke 1990

@unpublished{Damaschke90,
author = {Peter Damaschke},
title = {Subgraph Isomorphism for Cographs is {NP}-Complete},
year = 1990,
note = {Manuscript}}

@unpublished{Damaschke90a,
author = {Peter Damaschke},
title = {Hamilton-hereditary Graphs},
year = 1990, note = {Manuscript}}

@unpublished{DamaschkeK90,
author = {Peter Damaschke and Dieter Kratsch},
title = {Finding {H}amiltonian Paths in Cocomparability Graphs Using the Bump Number Algorithm},
year = 1990, note = {Manuscript}}

@article{Damaschke90b,
author = {Peter Damaschke},
title = {Induced subgraphs and well-quasi-ordering},
journal = jgt, volume = 14, number = 4, year = 1990, pages = {427-435}}

@article{DamaschkeMK90,
author = {Peter Damaschke and Haiko M\"{u}ller and Dieter Kratsch},
title = {Domination in convex and chordal bipartite graphs},
journal = ipl, volume = 36, year = 1990, pages = {231-236}}

%Damaschke 1991

@unpublished{DamaschkeDKS91,
author = {Peter Damaschke and Jitender S. Deogun and Dieter Kratsch and George Steiner},
title = {Finding {H}amiltonian Paths in Cocomparability Graphs Using The Bump Number Algorithm},
note = {Manuscript. Submitted to Order},
year = 1991}

%Damaschke 2006

@article{Damaschke06,
author = {Peter Damaschke},
title = {Parameterized enumeration, transversals, and imperfect phylogeny reconstruction},
journal = tcs, volume = 351, year = 2006, pages = {337-350}}

%Damaschke 2010

@article{Damaschke10,
author = {Peter Damaschke},
title = {Fixed-parameter enumerability of cluster editing and related problems},
journal = tocs, volume = 46, year = 2010, pages = {261-283}}

%Dan

@article{DankelmannGK09,
author = {Peter Dankelmann and Gregory Gutin and Eun Jung Kim},
title = {On complexity of minimum leaf out-branching problem},
journal = dam, volume = 157, year = 2009, pages = {3000-3004}}

%Dar

@article{Darwiche01,
author = {A. Darwiche},
title = {Decomposable negation normal form},
journal = jacm, volume = 48, pages = {608-647}, year = 2001}

@article{Darwiche03,
author = {A. Darwiche},
title = {A differential approach to inference in {B}ayesian networks},
journal = jacm, volume = 50, year = 2003, pages = {280-305}}

%Dav

@article{DavisP60,
author = {Martin David and Hillary Putnam},
title = {A computing procedure for quantification theory},
journal = jacm, volume = 7, year = 1960, pages = {201-215}}

%Daw

@article{Dawid92,
author = {A. P. Dawid}, 
title = {Applications of a general propagation algorithm for probabilistic expert systems},
journal = {Statistics and Computing}, volume = 2, year = 1992, pages = {25-36}}

%Day

@article{DaykinN66,
author = {D. E. Daykin and C. P. Ng},
title = {Algorithms for generalized stability numbers of tree graphs},
journal = {Journal of the Australian Mathematical Society}, volume = 6, year = 1966, pages = {89-100}}

%De

@article{DeSimoneG08,
author = {Caterina {De Simone} and Anna Galluccio},
title = {Edge-colouring of regular graphs of large degree},
journal = tcs, volume = 389, year = 2008, pages = {91-99}} 

%Dec

@article{DechterP89,
author = {R. Dechter and J. Pearl},
title = {Tree clustering for constraint networks},
journal = ai, volume = 38, year = 1989, pages = {353-366}}

@article{Dechter99,
author = {R. Dechter},
title = {Bucket elimination: a unifying framework for reasoning},
journal = ai, volume = 113, year = 1999, pages = {41-85}}

%DeF

@article{deFraysseixPP90,
author = {H. de Fraysseix and J. Pach and R. Pollack},
title = {How to draw a planar graph on a grid},
journal = combinatorica, volume = 10, year = 1990, pages = {41-51}}

%Deh

@inproceedings{DehneFLRS05,
author = {Frank Dehne and Michael Fellows and Michael Langston and Frances Rosamond and Kim Stevens},
title = {An {$O(2^{O(k)}n^3)$} {FPT} algorithm for the undirected feedback vertex set problem},
editor = {Lusheng Wang},
booktitle = cocoon05, pages = {859-869}, year = 2005, publisher = lncs3595}

@inproceedings{DehneFFPR06,
author = {Frank Dehne and Michael Fellows and Henning Fernau and Elena Prieto and Frances Rosamond},
title = {NONBLOCKER: Parameterized algorithms for minimum dominating set},
editor = {Jir\'{\i} Wiedermann and Gerard Tel and Jaroslav Pokorn{\'y} and M{\'a}ria Bielikov{\'a} and Julius Stuller},
booktitle = sofsem06, year = 2006, publisher = lncs3831, pages = {237-245}}

@inproceedings{DehneLLPSZ06,
author = {Frank Dehne and Michael A. Langston and Xuemei Luo and Syvain Pitre
and Peter Shaw and Yun Zhang},
title = {The {C}luster {E}diting problem: Implementations and experiments},
booktitle = iwpec06, publisher = lncs4169, year = 2006, pages = {13-24}}

%Dei

@article{DeinekoKW06,
author = {Vladimir G. Deineko and Bettina Klintz and Gerhard J. Woeginger},
title = {Exact algorithms for the {H}amiltonian cycle problem in planar graphs},
journal = orl, volume = 34, year = 2006, pages = {269-274}}

%Del

@unpublished{DellM09,
author = {Holger Dell and Dieter van Melkebeek},
title = {Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses},
year = 2009,
note = {To appear in: Electronic Colloquium on Computational Complexity (ECCC), volume 16}}


%Dem

%Demaine 2001

@inproceedings{DemaineO01,
author = {Erik D. Demaine and Joseph {O'Rourke}},
title = {Open problems from {CCCG} 2000},
booktitle = {Proceedings of the 13th Canadian Conference on Computational Geometry, CCCG 2001}, 
address = {Waterloo, Ontario, Canada}, year = 2001, pages = {185-187}}

%Demaine 2002

@inproceedings{DemaineHT02,
author = {E. D. Demaine and M. Hajiaghayi and Dimitrios M. Thilikos},
title = {Exponential speedup of fixed parameter algorithms on {$K_{3,3}$}-minor-free or {$K_5$}-minor-free graphs},
booktitle = soda02, pages = {262-273}, year = 2002}

%Demaine 2003

%Demaine 2004

@article{DemaineFHT04,
author = {Erik D. Demaine and Fedor V. Fomin and M. Hajiaghayi and Dimitrios M. Thilikos},
title = {Bidimensional parameters and local treewidth},
journal = sjdm, volume = 18, year = 2004, pages = {501-511}}

@article{DemaineH04,
author = {Erik D. Demaine and M. Hajiaghayi},
title = {Diameter and treewidth in minor-closed graph families, revisited},
journal = alg, volume = 40, year = 2004, pages = {211-215}}

@article{DemaineHNRT04,
author = {Erik Demaine and Mohammadtaghi Hajiaghayi and Naomi Nishimura and Prabhakar Ragde and Dimitrios M. Thilikos},
title = {Approximation algorithms for classes of graphs excluding single-crossing graphs as minors},
journal = jcss, volume = 69, year = 2004, pages = {166-195}}

%Demaine 2005

@article{DemaineFHT05,
author = {Erik D. Demaine and Fedor V. Fomin and MohammadTaghi Hajiaghayi and Dimitrios M. Thilikos},
title = {Fixed-Parameter Algorithms for ($k$,$r$)-center in Planar Graphs and Map Graphs},
journal = acmtalg, volume = 1, year = 2005, pages = {33-47}}

@article{DemaineFHT05a,
author = {Erik D. Demaine and Fedor V. Fomin and Mohammadtaghi Hajiaghayi and Dimitrios M. Thilikos},
title =  {Subexponential Parameterized Algorithms on Graphs of Bounded Genus and {$H$}-minor-free Graphs},
journal = jacm, volume = 52, year = 2005, pages = {866--893}}

@inproceedings{DemaineH05,
author = {Erik D. Demaine and Mohammadtaghi Hajiaghayi},
title = {Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality},
booktitle = soda05, year = 2005, pages = {682-689}}

@inproceedings{DemaineH05a,
author = {Erik D. Demaine and Mohammadtaghi Hajiaghayi},
title = {Bidimensionality: {N}ew connections between {FPT} algorithms and {PTASs}},
booktitle = soda05, year = 2005, pages = {590-601}}

@article{DemaineHT05,
author = {Erik D. Demaine and Mohammadtaghi Hajiaghayi and Dimitrios M. Thilikos},
title = {Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors},
journal = alg, volume = 41, year = 2005, pages = {245-267}}

%Demaine 2006

@article{DemaineHT06,
author = {Erik D. Demaine and MohammadTaghi Hajiaghayi and Dimitrios M. Thilikos},
title = {The bidimensional theory of bounded-genus graphs},
journal = sjdm, volume = 20, year = 2006, pages = {357-371}}

%Demaine 2008

@article{DemaineH08,
author = {Erik D. Demaine and MohammadTaghi Hajiaghayi}, 
title = {The bidimensionality theory and its algorithmic applications},
journal = tcj, volume = 51, year = 2008, pages = {292-302}}

@article{DemaineH08a,
author = {Erik D. Demaine and MohammadTaghi Hajiaghayi}, 
title = {Linearity of grid minors in treewidth with applications through bidimensionality},
journal = comb, volume = 28, year = 2008, pages = {19-36}}

%Demaine 2009

@article{DemaineHK09,
author = {Erik D. Demaine and MohammadTaghi Hajiaghayi and Ken-ichi Kawarabayashi},
title = {Algorithmic graph minor theory: Improved grid minor bounds and {W}agner's contraction},
journal = alg, volume = 54, year = 2009, pages = {142-180}}

%Den

@article{DendrisKT97,
author = {Nick D. Dendris and Lefteris M. Kirousis and Dimitrios M. Thilikos},
title = {Fugitive-search games on graphs and related parameters},
journal = tcs, volume = 172, year = 1997, pages = {233-254}}

%Deo

@book{Deo74,
author = {N. Deo},
title = {Graph Theory with Applications to Engineering and Computer Science},
publisher = {Prentice Hall}, address = {Englewood Cliffs, NJ},
year = 1974}

@article{DeoKL87,
author = {N. Deo and M. S. Krishnamoorty and Michael A. Langston},
title = {Exact and approximate solutions for the gate matrix layout problem},
journal = {IEEE Transactions on Computer Aided Design}, volume = 6, year = 1987, pages = {79-84}}

@article{DeogunP90,
author = {Jitender S. Deogun and Y. Peng},
title = {Edge ranking of trees},
journal = cn, volume = 79, year = 1990, pages = {19-28}}

@unpublished{DeogunKT93,
author = {Jitender S. Deogon and Dieter Kratsch and Zsolt Tuza},
title = {Some new results on rankings of graphs},
year = 1993, note = {Manuscript}}

@techreport{DeogunKKM93,
author = {Jitender S. Deogun and Ton Kloks and Dieter Kratsch and Haiko M\"{u}ller},
title = {On Vertex Ranking for Permutation and other Graphs},
type = {Computing Science Notes}, number = {93-30},
institution = {Eindhoven University of Technology},
address = {Eindhoven, The Netherlands}, year = 1993}

@article{DeogunKKM99,
author = {Jitender S. Deogun and Ton Kloks and Dieter Kratsch and Haiko M\"{u}ller},
title = {On the vertex ranking problem for trapezoid, circular-arc and other graphs},
journal = dam, volume = 98, year = 1999, pages = {39-63}}

%Der

@article{DereniowskiK056,
author = {Dariusz Dereniowski and M. Kubale},
title = {Efficient parallel query processing by graph ranking},
journal = {Fundamenta Informormaticae}, volume = 69, pages = {273-285}, year = {2005/06}}

@article{Dereniowski06,
author = {Dariusz Dereniowski},
title = {Edge ranking of weighted trees},
journal = dam, volume = 154, year = 2006, pages = {1198-1209}}

@article{DereniowskiN06,
author = {Dariusz Dereniowski and Adam Nadolski},
title = {Vertex rankings of chordal graphs and weighted trees},
journal = ipl, volume = 98, pages = {96-100}, year = 2006}

%Des

@article{DessmarkLP00,
author = {A. Dessmark and A. Lingas and A. Proskurowski},
title = {Faster algorithms for subgraph isomorphism of $k$-connected partial
$k$-trees},
journal = alg, volume = 27, pages = {337-347}, year = 2000}

%Dev

%DeV

@article{DeVosDOSRSV04,
author = {Matt DeVos and Guoli Ding and Bogdan Oporowski and Daniel P. Sanders
and Bruce Reed and Paul Seymour and Dirk Vertigan},
title = {Excluding any graph as a minor allows a low tree-width 2-coloring},
journal = jctb, volume = 91, year = 2004, pages = {25-41}}

%Di

%Dia

@inproceedings{DiazST93,
author = {J. D\'{\i}az and M. J. Serna and J. T\'{o}ran},
title = {Parallel approximation schemes for problems on planar graphs},
booktitle = esa93,
editor = {Thomas Lengauer},
year = 1993,
pages = {145-156},
publisher = lncs726,
}

@article{DiazPS02,
author = {Josep D\'{\i}az and J. Petit and Maria Serna},
title = {A survey of graph layout problems},
journal = acmcs, volume = 34, pages = {313-356}, year = 2002}

@article{DiazST02,
author = {Josep D\'{\i}az and Maria Serna and Dimitrios M. Thilikos},
title = {Counting {$H$}-colorings of partial $k$-trees},
journal = tcs, volume = 281, year = 2002, pages = {291-309}}

%Die

@book{Diestel90,
author = {Reinhard Diestel},
title = {Graph Decompositions. A Study in Infinite Graph Theory},
publisher = {Oxford Science Publications, Clarendon Press},
address = {Oxford}, year = 1990}

@article{DiestelJGT99,
author = {Reinhard Diestel and Tommy R. Jensen and Konstantin Yu. Gorbunov and
Carsten Thomassen},
title = {Highly connected sets and the excluded grid theorem},
year = 1999, pages = {61-73}, journal = jctb, volume = 75}

@article{DiestelT99,
author = {Reinhard Diestel and R. Thomas},
title = {Excluding a countable clique},
journal = jctb, volume = 76, year = 1999, pages = {41-67}}

@book{Diestel00,
author = {Reinhard Diestel},
title = {Graph theory},
publisher = {Springer-Verlag},
note = {2nd edition},
year = 2000}

@article{DiestelK04,
author = {Reinhard Diestel and Daniela K\"{u}hn},
title = {Graph minor hierarchies},
journal = dam, volume = 145, pages = {167-182}, year = 2004}

@phdthesis{Dietz84,
author = {P. F. Dietz},
title = {Intersection Graph Algorithms},
year = 1984,
school = {Computer Science Dept., Cornell University},
address = {Ithaca, N.Y.}}

@inproceedings{DietzfelbingerKMMRT88,
author = {M. Dietzfelbinger and A. Karlin and K. Mehlhorn and F.
{Meyer auf der Heide} and H. Rohnert and R. E. Tarjan},
title = {Dynamic Perfect Hashing: Upper and Lower Bounds},
year = 1988, pages = {524-531}, booktitle = focs88 }

%Dij

@misc{DijkHS06,
author = {Thomas C. {van Dijk} and Jan-Pieter {van den Heuvel} and Wouter Slob},
title = {Treewidth.com},
year = 2006}

@mastersthesis{Dijk07,
author = {Thomas C. {van Dijk}},
title = {Fixed parameter complexity of feedback problems},
school = {Utrecht University},
year = 2007}

@article{Dijkstra59,
author = {E. Dijkstra},
title = {A note on two problems in connection with graphs},
journal = {Numerische Mathematik}, volume = 1, year = 1959, pages = {269-271}}

%Din

%Ding 1992

@article{DingSS92,
author = {Guoli Ding and A. Schrijver and Paul D. Seymour},
title = {Disjoint paths in a planar graph --- {A} general theorem},
journal = sjdm, volume = 5, year = 1992, pages = {112-116}}

%Ding 1995

@article{DingO95,
author = {Guoli Ding and Bogdan Oporowski},
title = {Some results on tree decomposition of graphs},
journal = jgt, volume = 20, pages = {481-499}, year = 1995}

%Ding 1998

@article{DingOSV98,
author = {Guoli Ding and Bogdan Oporowski and Daniel P. Sanders and D.
Vertigan},
title = {Partitioning graphs of bounded tree-width},
journal = combinatorica, volume = 18, year = 1998, pages = {1-12}}

%Ding 2000

@article{DingOSV00,
author = {Guoli Ding and Bogdan Oporowski and Daniel P. Sanders and D.
Vertigan},
title = {Surfaces, tree-width, clique-minors, and partitions},
journal = jctb, volume = 79, year = 2000, pages = {221-246}}

%Ding 2001

@article{DingJS01,
author = {Guoli Ding and Thor Johnson and Paul Seymour},
title = {Spanning trees with many leaves},
journal = jgt, volume = 37, year = 2001, pages = {189-197}}

%Dinitz 1993

@inproceedings{Dinitz93,
author = {E. Dinitz},
title = {The 3-edge-components and a structural description of all 3-edge cuts in a graph},
editor = {Ernst W. Mayr},
booktitle = wg92, year = 1993, publisher = lncs657, pages = {145-157}}

%Dinitz 1994

@unpublished{Dinitz94,
author = {E. Dinitz},
title = {The connectivity carcass of a vertex subset in a graph and its
incremental maintenance},
year = 1994,
note = {Manuscript}}

@unpublished{Dinneen92,
author = {Michael J. Dinneen},
title = {A Linear Feedback Vertex Set Algorithm for Bounded Pathwidth Graphs},
note = {Manuscript}, year = 1992}

@phdthesis{Dinneen95,
author = {Michael John Dinneen},
title = {Bounded Combinatorial Width and Forbidden Substructures},
school = {University of Victoria},
year = 1995 }

@inproceedings{DinneenK00,
author = {Michael J. Dinneen and Bakhadyr Khoussainov},
title = {Update networks and their routing strategies},
booktitle = {Preproceedings WG'2000},
pages = {65-74}, year = 2000}

@article{DinneenCF01,
author = {M. J. Dinneen and K. Cattell and M. R. Fellows},
title = {Forbidden minors to graphs with small feedback sets},
journal = dm, volume = 130, pages = {215-252}, year = 2001}

@article{DinskiZ99,
author = {Thomas Dinski and Xuding Zhu},
title = {A bound for the game chromatic number of graphs},
journal = dm, volume = 196, pages = {109-115}, year = 1999}

%Dir

@article{Dirac61,
author = {G.A. Dirac},
title = {On rigid circuit graphs},
journal = amsuh, volume = 25, year = 1961, pages = {71-76}}

%Diw

@article{Diwan00,
author = {A. Diwan},
title = {Decomposing graphs with girth at least five under degree
constraints},
journal = jgt, volume = 33, pages = {237-239}, year = 2000}

%Dj

%Dje

@article{Djelloul09,
author = {Selma Djelloul},
title = {Treewidth and logical definability of graph products},
journal = tcs, volume = 410, pages = {696-710}, year = 2009}

%Dji

@article{Djidjev82,
author = {Hristo N. Djidjev},
title = {On the problem of partititioning planar graphs},
journal = sjadm, volume = 3, year = 1982, pages = {229-240}}

@inproceedings{Djidjev88,
author = {Hristo N. Djidjev},
title = {Linear algorithms for graph separation problems},
editor = {Rolf G. Karlsson and Andzej Lingas},
booktitle = swat88, publisher = lncs318, year = 1988, pages = {216-222}}

@techreport{DjidjevG90,
author = {Hristo N. Djidjev and John R. Gilbert},
title = {Separators in Graphs with Negative or Multiple Vertex
Weights},
number = {CSL-90-8}, institution = {Xerox Corporation, Palo Alto},
year = 1990 }

@article{DjidjevV97,
author = {Hristo N. Djidjev and S. M. Venkatesan},
title = {Reduced constants for simple cycle graph separation},
journal = ai, volume = 34, pages = {231-243}, year = 1997}

%Do

%Doh

@article{DohmenPT03,
author = {Klaus Dohmen and Andr\'{e} P\"{o}nitz and Peter Tittmann},
title = {A new two-variable generalization of the chromatic polynomial},
journal = dmtcs, year = 2004, pages = {69-90}, volume = 6}

%Dol

@article{DolamaS06,
author = {Mohammad Hosseini Dolama and \'{E}ric Sopena},
title = {On the oriented chromatic number of {H}alin graphs},
journal = ipl, volume = 98, year = 2006, pages = {247-252}}

@techreport{DolevT82,
author = {D. Dolev and H. Trickey},
title = {Embedding a Tree on a Line},
institution = {IBM San Jose},
year = 1982,
type = {IBM Techn. Report},
number = {RJ3368}
}

@article{DolevLT84,
author = {D. Dolev and T. Leighton and H. Trickey},
title = {Planar embeddings of planar graphs},
journal = {Adv. in Comput. Res.}, volume = 2, pages = {53-76}, year = 1984 }

%Dom

@inproceedings{DomLS09,
author = {Michael Dom and Daniel Lokshtanov and Saket Saurabh},
title = {Incompressibility through colors and {IDs}},
editor = {Susanne Albers and Alberto Marchetti-Spaccamela and Yossi Matias and Sotiris E. Nikoletseas and Wolfgang Thomas},
booktitle = icalp09-1, year = 2009, pages = {378-389}, publisher = lncs5555}

@inproceedings{DomLSV08,
author = {Michael Dom and Daniel Lokshtanov and Saket Saurabh and Yngve Villanger},
title = {Capacitated domination and covering: A parameterized perspective},
editor = {Martin Grohe and Rolf Niedermeier},
booktitle = iwpec08, publisher = lncs5018, year = 2008, pages = {78-91}}

@article{DomFHN08,
author = {Michael Dom and Jiong Guo and Falk H\"{u}ffner and Rolf
Niedermeier},
title = {Closest 4-leaf power is fixed-parameter tractable},
journal = dam, volume = 156, year = 2008, pages = {3345-3361}}

%Don

@article{Doner70,
author = {J. Doner},
title = {Tree acceptors and some of their applications},
journal = jcss, volume = 4, year = 1970, pages = {406-451}}

%Dor

%Dorn 2005

@inproceedings{DornPBF05,
author = {Frederic Dorn and Eelko Penninkx and Hans L. Bodlaender and Fedor V.  Fomin},
title = {Efficient exact algorithms on planar graphs: {E}xploiting sphere cut branch decompositions},
booktitle = esa05, publisher = lncs3669, pages = {95-106}, year = 2005}

%Dorn 2006

@inproceedings{Dorn06,
author = {Frederic Dorn},
title = {Dynamic Programming and Fast Matrix Multiplication},
booktitle = esa06,
publisher = lncs4168, pages = {280-291}, year = 2006}

@inproceedings{DornT06,
author = {Frederic Dorn and Jan Arne Telle},
title = {Two birds with one stone: the best of branchwidth and treewidth with one algorithm},
editor = {Jos\'{e} R. Correa and Alejandro Hevia and Marcos A. Kiwi},
booktitle = latin06, publisher = lncs3887, year = 2006, pages = {386-397}}

%Dorn 2007

@inproceedings{Dorn07,
author = {Frederic Dorn},
title = {How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms},
editor = {Andreas Brandst\"{a}dt and Dieter Kratsch and Haiko M\"{u}ller},
booktitle = wg07, publisher = lncs4769, year = 2007, pages = {280-291}}

%Dorn 2008

@inproceedings{DornFT08,
author = {Frederic Dorn and Fedor V. Fomin and Dimitrios M. Thilikos},
title = {Catalan structures and dynamic programming in $H$-minor-free graphs},
booktitle = soda08, year = 2008, pages = {631-640}}

%Dorn 2009

@article{DornT09,
author = {Frederic Dorn and Jan Arne Telle},
title = {Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm},
journal = dam, volume = 157, year = 2009, pages = {2737-2746}}

%Dorn 2010

@article{Dorn10,
author = {Frederic Dorn},
title = {Dynamic programming and planarity: Improved tree-decomposition based algorithms},
journal = dam, volume = 158, year = 2010, pages = {800-808}}

%Dou

@article{DourisboureG07,
author = {Yon Dourisboure and Cyril Gavoille},
title = {Tree-decompositions with bags of small diameter},
journal = dm, volume = 307, year = 2007, pages = {2008-2029}}

%Dow

@inproceedings{DowK07,
author = {P. Alex Dow and Richard E. Korf},
title = {Best-First search for treewidth},
booktitle = aaai07, pages = {1146-1151}, publisher = {AAAI Press}, year = 2007}

%Downey 1991

%article{DowneyF91b,
author = {Rodney G. Downey and Michael R. Fellows},
title = {Fixed-Parameter Tractability and Completeness {II}: {O}n completeness for {$W[1]$}},
journal = tcs, volume = 141, pages = {109-131}, year = 1995}

%Downey 1992

@incollection{DowneyF92,
author = {Rodney G. Downey and Michael R. Fellows},
title = {Fixed-Parameter Tractability and Completeness {III}: Some Structural
Aspects of the {$W$} Hierarchy},
booktitle = {Complexity Theory}, year = 1993, editor = {K. Ambos-Spies and
S. Homer and U. Sch\"{o}ning}, publisher = {Cambridge University Press},
pages = {191-226}}

@article{DowneyF92a,
author = {Rodney G. Downey and Michael R. Fellows},
title = {Fixed-Parameter Tractability and Completeness},
year = 1992, journal = cn, volume = 87, pages = {161-178}}

@inproceedings{DowneyF92b,
author = {Rodney G. Downey and Michael R. Fellows},
title = {Fixed parameter intractability},
booktitle = {Proceedings of the 7th Annual IEEE Conference on Structure in Complexity Theory},
pages = {36-49}, year = 1992}

%Downey 1993

@inproceedings{DowneyEF93,
author = {Rodney G. Downey and P. A. Evans and Michael R. Fellows},
title = {Parameterized learning complexity},
booktitle = {Proceedings 6th ACM Workshop on Computational Learning Theory, COLT'93},
pages = {51-57}, year = 1993}

@techreport{DowneyFKHW93,
author = {Rodney G. Downey and Michael R. Fellows and B. M. Kapron and
Michael T. Hallett and H. Todd Wareham},
title = {The parameterized complexity of some problems in logic and linguistics},
institution = {Department of Computer Science, University of Victoria},
address = {Victoria, B.C., Canada},
year = 1993,
type = {Technical Report}}

@unpublished{DowneyF-1,
author = {Rodney G. Downey and Michael R. Fellows},
title = {Parameterized computational feasibility},
note = {To appear in  Proc. Second Cornell Workshop on Feasible Mathematics (Birkhauser, Boston)}}

%Downey 1995

@article{DowneyF95,
author = {Rodney G. Downey and Michael R. Fellows},
title = {Fixed-Parameter Tractability and Completeness {I}: Basic Results},
journal= siamjc, volume = 24, pages = {873-921}, year = 1995}

@article{DowneyF95a,
author = {Rodney G. Downey and Michael R. Fellows},
title = {Fixed-Parameter Tractability and Completeness {II}: On completeness for {$W[1]$}},
journal = tcs, volume = 141, year = 1995, pages = {109-131}}

%Downey 1997

@incollection{DowneyFS97,
author = {Rodney G. Downey and Michael R. Fellows and Ulrike Stege},
title = {Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability},
booktitle = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science},
publisher = {American Mathematical Society},
year = {1997},
pages = {49--99}}


%Downey 1998

@book{DowneyF98,
author = {Rodney G. Downey and Michael R. Fellows},
title = {Parameterized Complexity},
publisher = {Springer},
year = 1999}
%Remark: change year in 1999

@article{DowneyF98a,
author = {Rodney G. Downey and Michael R. Fellows},
title = {Threshold dominating sets and an improved characterization of {$W[2]$}},
journal = tcs, volume = 209, pages = {123-140}, year = 1998}

%Downey 1999

@article{DowneyFS99,
author = {Rodney G. Downey and Michael R. Fellows and Ulrike Stege},
title = {Computational Tractability: The View From Mars},
journal = beatcs, volume = 69, year = 1999, pages = {73-97}}

@book{DowneyF99,
author = {Rodney G. Downey and Michael R. Fellows},
title = {Parameterized Complexity},
publisher = {Springer},
year = 1999}

@article{DowneyFVW99,
author = {Rodney G. Downey and Michael R. Fellows and A. Vardi and G. Whitte},
title = {The parameterized complexity of some fundamental problems in coding theory},
journal = siamjc, volume = 29, year = 1999, pages = {545-570}}

%Downey 2007

@article{DowneyM07,
author = {Rodney G. Downey and Catherine McCartin},
title = {Online promise problems with online width metrics},
journal = jcss, volume = 73, year = 2007, pages = {56-72}}

%Downey 2008

@article{DowneyFMR08,
author = {Rodney G. Downey and Michael R. Fellows and Catherine McCartin and Frances A. Rosamond},
title = {Paramterized approximation of dominating set problems},
journal = ipl, volume = 109, year = 2008, pages = {68-70}}

%Dr

%Dra

@techreport{DraganB93,
author = {Feodor F. Dragan and Andreas Brandst\"{a}dt},
title = {$r$-{D}ominating cliques in {H}elly graphs and chordal graphs},
institution = {Universit\"{a}t Duisburg GH},
number = {SM-DU-228}, year = 1993}

@article{DraganT10,
author = {Feodor F. Dragan and Chenyu Yan},
title = {Collective tree spanners in graphs with bounded parameters},
journal = alg, volume = 57, year = 2010, pages = {22-43}}

%Dre

@inproceedings{Dress??,
author = {A. W. M. Dress},
title = {On the computational complexity of composite systems},
editor = {L. Garrido},
booktitle = {Fluctuations and stochastic phenomena
in condensed matter, Springer Lecture Notes in Physics 268},
year = {???}}

@inproceedings{DrewesK90,
author = {F. Drewes and {H.-J.} Kreowski},
title = {A note on hyperedge replacement},
editor = {Hartmut Ehrig and Manfred Nagl and Grzegorz Rozenberg},
booktitle = gragra90, publisher = lncs532, pages = {1-12}, year = 1990}

%Du

%Duc

@article{DuchonHLS06,
author = {Philippe Duchon and Nicolas Hanusse and Emmanuelle Lebhar and Nicolas Schabanel},
title = {Can any graph be turned into a small-world},
journal = tcs, volume = 355, pages = {96-103}, year = 2006}

%Duf

@article{DuffR83,
author = {Iain S. Duff and J. K. Reid},
title = {The multifrontal solution of indefinite sparse symmetric linear equations},
journal = {ACM Transactions on Mathematical Software},
volume = 9, year = 1983, pages = {302-325}}

@article{Duffin65,
author = {R. J. Duffin},
title = {Topology of series-parallel graphs},
journal = jmaa, volume = 10, year = 1965, pages = {303-318}}

%Duj

@article{DujmovicMW05,
author = {V. Dujmovi\'{c} and P. Morin and D. R. Wood},
title = {Layout of graphs with bounded tree-width},
journal = siamjc, volume = 34, year = 2005, pages = {554-579}}

@article{DujmovicW05,
author = {V. Dujmovi\'{c} and D. R. Wood},
title = {Stacks, queues and tracks: Layouts of graph subdivisions},
journal = dmtcs, volume = 7, year = 2005, pages = {155-202}}

@inproceedings{DujmovicW06,
author = {Vida Dujmovi\'{c} and David R. Wood},
title = {Graph treewidth and geometric thickness parameters},
editor = {Patrick Healy and Nikola S. Nikolov},
booktitle = gd05, publisher = lncs3843, year = 2006, pages = {129 - 140}}

%Dum

@article{DumitrescuSZ08,
author = {Adrian Dumitrescu and Ichiro Suzuki and Pawel Zylinski},
title = {Offline variants of the ''lion and man'' problem --- {S}ome problems
and techniques for measuring crowdedness and for safe path planning ---},
journal = tcs, volume = 399, year = 2008, pages = {220-235}}

%Dun

@article{DunnK04,
author = {Charles Dunn and H. A. Kierstead},
title = {A simple competitive graph coloring algorithm {II}},
journal = jctb, volume = 90, year = 2004, pages = {93-106}}

@article{DunnK04a,
author = {Charles Dunn and H. A. Kierstead},
title = {A simple competitive graph coloring algorithm {III}},
journal = jctb, volume = 90, year = 2004, pages = {137-150}}

@article{DunnK04b,
author = {Charles Dunn and H. A. Kierstead},
title = {The relaxed game chromatic number of outerplanar graphs},
journal = jgt, volume = 46, year = 2004, pages = {69-78}}

@article{Dunn07,
author = {Charles Dunn},
title = {The relaxed game chromatic index of $k$-degenerate graphs},
journal = dm, volume = 307, year = 2007, pages = {1767-1775}}

%Dy

@article{DyerF86,
author = {M. E. Dyer and A. M. Frieze},
title = {Planar {3DM} is {NP}-complete},
journal = ja, volume = 7, year = 1986, pages = {174-184}}

%E

%Ea

%Ead

@article{EadesLS93,
author = {P. Eades and X. Lin and W. F. Smyth},
title = {A fast and effective heuristic for the feedback arc set problem},
journal = ipl, volume = 47, year = 1993, pages = {319-323}}

%Eas

@article{EaswarakumarPC94,
author = {K. S. Easwarakumar and C. {Pandu Rangan} and G. A. Cheston},
title = {A linear algorithm for centering a spanning tree of a biconnected graph},
journal = ipl, volume = 51, year = 1994, pages = {121-124}}

%Eb

@book{Ebert81,
author = {J. Ebert},
title = {Efficiente Graphenalgorithmen},
publisher = {Akademische Verlagsgesellschaft},
address = {Wiesbaden},
year = 1981 }

%Ed

@article{Edenbrandt87,
author = {A. Edenbrandt},
title = {Chordal graph recognition is in {NC}},
journal = ipl, volume = 24, year = 1987, pages = {239-241}}

@article{Edmonds65,
author = {J. Edmonds},
title = {Paths, trees, and flowers},
journal = canjm, volume = 17, pages = {445-467}, year = 1965}

@article{Edwards86,
author = {K. Edwards},
title = {The complexity of Coloring Problems on Dense Graphs},
journal = tcs, volume = 16, year = 1986, pages = {337-343}}

%Eh

@techreport{EhrenfeuchtER93,
author = {Andrzej Ehrenfeucht and Joost Engelfriet and Grzegorz Rozenberg},
title = {Finite Languages for the Representation of Graphs},
year=1993, number = {93-03},
institution = {Department of Computer Science, Leiden University}, address = {Leiden, The Netherlands}}

%Ei

%Eij

@article{EijkhofBK07,
author = {Eijkhof, Frank {v}an {d}en and Hans L. Bodlaender and Arie M. C. A.  Koster},
title = {Safe reduction rules for weighted treewidth},
journal = alg, volume = 47, year = 2007, pages = {138-158}}

%Eil

@article{EilamMZ02,
author = {T. Eilam and S. Moran and S. Zaks},
title = {The complexity of the characterization of networks supporting shortest-path interval routing},
journal = tcs, volume = 289, year = 2002, pages = {85-104}}

%El

%Ellis 1987

@techreport{EllisST87a,
author = {John A. Ellis and Ivan Hal Sudborough and J. Turner},
title = {Graph Separation and Search Number},
type = {Report},
number = {DCS-66-IR}, institution = {University of Victoria},
year = 1987
}

%Ellis 1989

@article{EllisMM89,
author = {John A. Ellis and Manrique Mata and Gary Mac{G}illivray},
title = {A linear time algorithm for longest $(s,t)$-paths in weighted outerplanar graphs},
journal = ipl, volume = 32, year = 1989, pages = {199-204}}

%Ellis 1994

@article{EllisST94,
author = {John A. Ellis and Ivan Hal Sudborough and J. Turner},
title = {The vertex separation and search number of a graph},
journal =ic2, volume = 113, year = 1994, pages = {50-79}}

%Ellis 2002

@inproceedings{EllisFF02,
author = {J. Ellis and H. Fan and M. R. Fellows},
title = {The dominating set problem is fixed parameter tractable for graphs of bounded genus},
booktitle = swat02, publisher = lncs2368, pages = {180-189}, year = 2002}

%Ellis 2004

@article{EllisM04,
author = {John Ellis and Minko Markov},
title = {Computing the vertex separation of unicyclic graphs},
journal = ic2, volume = 192, year = 2004, pages = {123-161}}

@article{EllisFF04,
author = {J. Ellis and H. Fan and M. R. Fellows},
title = {The dominating set problem is fixed parameter tractable for graphs of bounded genus},
journal = ja, year = 2004, volume = 52, pages = {152-168}}

%Ellis 2008

@article{EllisW08,
author = {John Ellis and Robert Warren},
title = {Lower bounds on the pathwidth of some grid-like graphs},
journal = dam, volume = 156, year = 2008, pages = {545-555}}

%ElM
%Elm

@phdthesis{ElMallah87,
author = {E. S. El-{M}allah},
title = {Decomposition and Embedding Problems for Restricted Networks},
school = {University of Waterloo},
year = 1987}

@article{ElMallahC88,
author = {E. S. El-{M}allah and Charles J. Colbourn},
title = {Partial $k$-tree algorithms},
journal = cn, volume = 64, year = 1988, pages = {105-119}}

%Em

@inproceedings{EmdeBoas75,
author = {Peter {van Emde Boas}},
title = {Preserving order in a forest in less than logarithmic time},
booktitle = focs75, year = 1975, pages = {75-84}}

@inproceedings{EmdeBoas82,
author = {Peter {van Emde Boas}},
title = {Dominoes are forever},
editor = {L. Priese},
booktitle = {Proceedings of the 1st GTI Workshop, Paderborn Oct. 1982, Rheie Theoretische Informatik UGH},
year = 1982, pages = {75-95}}

@inproceedings{EmdeBoas97,
author = {Peter {van Emde Boas}},
title = {The convenience of tilings},
booktitle = {Complexity, Logic and Recursion Theory},
editor = {A. Sorbi},
publisher = {Lecture Notes in Pure and Applied Mathematics, vol. 187, Marcel
Dekker Inc.},
year = 1997,
pages = {331-363}}

%En

@article{EngelG03,
author = {Konrad Engel and Sven Guttmann},
title = {Testing bandwidth for $k$-connected graphs},
journal = sjdm, volume = 16, year = 2003, pages = {301-312}}

%Engelfriet 1987

@unpublished{EngelfrietLW87,
author = {Joost Engelfriet and George Leih and Emo Welzl},
title = {Characterization and Complexity of Boundary Graph Languages},
year = 1987,
note = {Manuscript},
remark = {Among many other results, it is shown that for given $k$ and
$d$, the set of all (connected) graphs of tree-width $\leq k$ and degree
$leq d$ is in LOG(CF)}
}

%Engelfriet 1991

@article{EngelfrietH91,
author = {Joost Engelfriet and Linda Heyker},
title = {The String Generating Power of Context-Free Hypergraph Grammars},
journal = jcss, volume = 43, number = 2, year = 1991, pages = {328-360}}

@article{EngelfrietHL91,
author = {Joost Engelfriet and Linda M. Heyker and G. Leih},
title = {Context-free graph languages of bounded degree are generated by {A}pex graph grammars},
journal = ai, volume = 31, year = 1994, pages = {341-378}}

%Engelfriet 1992

@inproceedings{Engelfriet92,
author = {Joost Engelfriet},
title = {A {G}reibach normal form for context-free graph grammars},
editor = {W. Kuich},
booktitle = icalp92, publisher = lncs623, pages = {138-149}, year = 1992}

@article{EngelfrietH92,
author = {Joost Engelfriet and Linda Heyker},
title = {Context-free hypergraph grammars have the same term-generating power as attribute grammars},
journal = ai, volume = 29, pages = {161-210}, year = 1992}

%Engelfriet 1993

@techreport{EngelfrietHPG93,
author = {Joost Engelfriet and T. Harju and Andrzej Proskurowski and G.
Rozenberg},
title = {Survey on Graphs as 2-structures and Parallel Complexity of
Decomposition},
type = {Technical Report},
institution ={Department of Computer Science, Leiden University},
year = 1993, number = {93-06}}

@techreport{EngelfrietV93,
author = {Joost Engelfriet and Jan Joris Vereijken},
title = {Context-Free Graph Grammars and Concatenation of Graphs},
type = {Technical Report},
institution ={Department of Computer Science, Leiden University},
year = 1993, number = {93-06}}

%Engelfriet 1996

@techreport{Engelfriet96,
author = {Joost Engelfriet},
title = {Context-Free Graph Grammars},
type = {Technical Report},
institution ={Department of Computer Science, Leiden University},
year = 1996, number = {96-32}}

%Enr

@article{EnrightS07,
author = {Jessica Enright and Lorna Stewart},
title = {Subtree filament graphs are subtree overlap graphs},
journal = ipl, volume = 104, year = 2007, pages = {228-232}}

%Ep

%Epp

%Eppstein 1992

@article{Eppstein92,
author = {David Eppstein},
title = {Parallel recognition of series parallel graphs},
journal = ic2, volume = 98, pages = {41-55}, year = 1992}

%Eppstein 1999

@article{Eppstein99,
author = {David Eppstein},
title = {Subgraph isomorphism in planar graphs and related problems},
journal = jgaa, volume = 3, pages = {1-27}, year = 1999}

%Eppstein 2000

@article{Eppstein00,
author = {David Eppstein},
title = {Diameter and treewidth in minor-closed graph families},
journal = alg, volume = 27, year = 2000, pages = {275-291}}

%Eppstein 2001

@inproceedings{Eppstein01,
author = {David Eppstein},
title = {Small maximal independent sets and faster exact graph coloring},
editor = {Frank K. H. A. Dehne and J\"{o}rg-R\"{u}diger Sack and Roberto Tamassia},
booktitle = wads01, publisher = lncs2125, year = 2001, pages = {462-470}}

%Eppstein 2003

@article{Eppstein03,
author = {David Eppstein},
title = {Small maximal independent sets and faster exact graph
coloring},
xJOURNAL = {J. Graph Algorithms Appl.},
journal = jgaa, volume = 7, year = 2003, pages = {131-140}}

%Eppstein 2003

@inproceedings{Eppstein04,
author = {David Eppstein},
title = {Quasiconvex analysis of backtracking algorithms},
booktitle = soda04, year = 2004, pages = {781-790}}

%Er

%Erd

@article{ErdosS35,
author = {Paul Erd\"{o}s and G. Szekeres},
title = {A combinatorial problem in geometry},
journal = {Compos. Math.}, volume = 2, year = 1935, pages = {464-470}}

@article{ErdosK63,
author = {Paul Erd\"{o}s and Paul Kelly},
title = {The minimal regular graph containing a given graph},
journal = amm, volume = 70, pages = {1074-1075}, year = 1963}

@article{ErdosP65,
author = {Paul Erd\"{o}s and L. P\'{o}sa},
title = {On the independent circuits contained in a graph},
journal = canjm, volume = 17, pages = {347-352}, year = 1965}

@article{ErdosGK91,
author = {Paul Erd\"{o}s and John Gimbel and Dieter Kratsch},
title = {Some extremal results in cochromatic and dichromatic theory},
year = 1991, journal = jgt, volume = 15, number = 6, pages = {579-585}}

%Erl

@inproceedings{ErlebachL08,
author = {Thomas Erlebach and Erik Jan van Leeuwen},
title = {Domination in geometric intersection graphs},
editor = {Eduardo Sany Laber and Claudson F. Bornstein and Loana Tito Nogueira and Luerbio Faria},
booktitle = latin08, year = 2008, publisher = lncs4957, pages = {747-758}}

%Es

%Esp

@inproceedings{EspelageGW01,
author = {Wolfgang Espelage and Frank Gurski and Egon Wanke},
title = {Deciding clique-width for graphs of bounded treewidth},
editor = {Frank K. H. A. Dehne and J\"{o}rg-R\"{u}diger Sack and Roberto Tamassia},
year = 2001, pages = {87-98}, booktitle = wads01, publisher = lncs2125}

@article{EspelageGW03,
author = {Wolfgang Espelage and Frank Gurski and Egon Wanke},
title = {Deciding clique-width for graphs of bounded treewidth},
journal = jgaa, volume = 7, year = 2003, pages = {141-180}}

%Est

@inproceedings{Estivill-CastroFLR05,
author = {Vladimir Estivill-Castro and Michael R. Fellows and Michael A. Langston and Frances A. Rosamond},
title = {FPT is {P}-time extremal structure {I}},
editor = {Hajo Broersma and Matthew Johnson and Stefan Szeider},
booktitle = acid05, publisher = {King's College, London},
series = {Text in Algorithms}, volume = 4, year = 2005, pages = {1-41}}

%Esw

@article{EswaranT76,
author = {Kapali P. Eswaran and R. Endre Tarjan},
title = {Augmentation Problems},
journal = siamjc, volume = 5, year = 1976, pages = {653-665}}

%Ev

@article{Evans91,
author = {G. A. Evans},
title = {Combinatoric strategies for genome mapping},
journal = {Bioassays}, volume = 13, year = 1991, pages = {39-44}}

@inproceedings{EvenK75,
author = {Simon Even and O. Kariv},
title = {An {O}($n^{2.5}$) Algorithm for Maximum Matching in General
Graphs},
booktitle = focs75, year = 1975, pages = {100-112}}

@article{EvenT75,
author = {Simon Even and Robert Endre Tarjan},
title = {Network flow and testing graph connectivity},
journal = siamjc, volume = 4, year = 1975, pages = {507-518}}

@article{EvenT76,
author = {S. Even and R. E. Tarjan},
title = {A combinatorial problem which is complete in polynomial
space},
journal = jacm, volume = 23, year = 1976, pages = {710-719}}

@article{EvenT76a,
author = {S. Even and R. E. Tarjan},
title = {Computing an $st$-numbering},
journal = tcs, volume = 2, year = 1976, pages = {339-344}}

@book{Even79,
title = {Graph Algorithms},
author = {Simon Even},
year = 1979,
publisher = {Pitman},
address = {London}
}

@article{EvenNRS99,
author = {G. Even and J. Naor and S. Rao and B. Schieber}, 
title = {Fast approximate graph partitioning algorithms},
journal = siamjc, volume = 28, year = 1999, pages = {2187-2214}}

%F

%Fa

%Fai

@techreport{FaigleK90,
author = {U. Faigle and W. Kern},
title = {The Game Chromatic Number of Trees is 4},
type = {Memorandum}, number = {871}, year = 1990,
institution = {Department of Applied Mathematics, University of
Twente}, address = {Enschede, The Netherlands}}

@article{FaigleKKT93,
author = {U. Faigle and W. Kern and H. Kierstead and W. T. Trotter},
title = {On the Game Chromatic Number of Some Classes of Graphs},
journal = arscomb, volume = 35, pages = {143-150}, year = 1993}

%Far

@article{Farber82,
author = {M. Farber},
title = {Independent domination in chordal graphs},
journal = orl, volume = 1, year = 1982, pages = {134-138}}

@article{Farber83,
author = {M. Farber},
title = {Characterizations of strongly chordal graphs},
journal = dm, volume = 43, pages = {173-189}, year = 1983 }

@article{Farber84,
author = {M. Farber},
title = {Domination, independent domination, and duality in strongly
chordal graphs},
journal = dam, volume = 7, year = 1984, pages = {115-130}}

@article{FarberK85,
author = {M. Farber and J. Mark Keil},
title = {Domination in permutation graphs},
journal = ja, volume = 6, year = 1985, pages = {309-321}}

@article{FarberHHM86,
author = {Martin Farber and Ge\~na Hahn and Pavol Hell and Donald Miller},
title = {Concerning the achromatic number of graphs},
journal = jctb, volume = 40, year = 1986, pages = {21-39}}

@article{FarleyP80,
author = {A. M. Farley and A. Proskurowski},
title = {Computation of the Center and Diameter of Outerplanar Graphs},
journal = dam, volume = 2, year = 1980, pages = {185-191}}

@article{Farley81,
author = {A. M. Farley},
title = {Networks immune to isolated failures},
journal = netw, volume = 11, pages = {255-268}, year = 1981}

@article{FarleyHP81,
author = {A. M. Farley and S. Hedetniemi and A. Proskurowski},
title = {Partitioning Trees: Matching, Domination, and Maximum diameter},
journal = ijcis, volume = 10, pages = {55-61}, number = 1, year = 1985}

@article{FarleyP82,
author = {A. M. Farley and A. Proskurowski},
title = {Networks immune to isolated line failures},
journal = netw, volume = 12, pages = {393-403}, year = 1982}

%Fat

@article{FathFS02,
author = {K. Fath and P. Flocchini and S. Pierre},
title = {Compact routing in chordal grids and other networks},
journal = {INFOR: Information Systems and Operational Research},
volume = 40, year = 2002, pages = {119-130}}

%Fe

%Fed

%article{FederHKNP05,
author = {Tom\'{a}s Feder and Pavol Hell and Sulamita Klein and Loana Tito Nogueira and Fábio Protti},
title = {List partitions of chordal graphs},
journal = tcs, volume = 349, pages = {52-66}, year = 2005}

%Fei

%Feige 2000

@inproceedings{Feige00,
author = {U. Feige},
title = {Coping with the {NP}-hardness of the graph bandwidth problem},
editor = {Magn\'{u}s M. Halld\'{o}rsson},
booktitle = swat00, publisher = lncs1851, year = 2000, pages = {10-19}}

%Feige 2005

@inproceedings{FeigeHL05,
author = {U. Feige and M. Hajiaghayi and J. R. Lee},
title = {Improved approximation algorithms for minimum-weight vertex separators},
booktitle = stoc05, pages = {563-572}, publisher = {ACM Press},
year = 2005}

%Feige 2006

@inproceedings{FeigeM06,
author = {Uriel Feige and Mohammad Mahdian},
title = {Finding small balanced separators},
year = 2006, pages = {375-384}, booktitle = stoc06,
publisher = {ACM Press}, addres = {New York}}

%Feige 2009

@article{FeigeT09,
author = {Uriel Feige and Kunal Talwar},
title = {Approximating the bandwidth of caterpillars},
journal = alg, volume = 55, year = 2009, pages = {190-204}}

%Fel

%Fellows

@misc{FellowsPC,
author = {Michael R. Fellows},
note = {Personal communication}}

%Fellows 1987

@unpublished{FellowsHS87,
author = {Michael R. Fellows and F. Hickling and Maciej M. Sys{\l}o},
title = {A Topological Parameterization and Hard Graph Problems},
year = 1987,
note = {Presented at Boca Raton, Florida. Final paper in preparation.}}

@article{FellowsL87,
author = {Michael R. Fellows and Michael A. Langston},
title = {Nonconstructive advances in polynomial-time complexity},
year = 1987, journal = ipl, volume = 26, pages = {157-162}}

@article{FellowsL87a,
author = {Michael R. Fellows and Michael A. Langston},
title = {Nonconstructive tools for proving polynomial-Time
decidability},
year = 1988,
journal = jacm, volume = 35, pages = {727-739}}

@inproceedings{FellowsL87b,
author = {Michael R. Fellows and Michael A. Langston},
title = {Layout Permutation Problems and Well-Partially-Ordered Sets},
year = 1988,
booktitle = {5th MIT Conf. on Advanced Research in VLSI},
address = {Cambridge, MA},
publisher = lncs319,
editor = {J. Reif},
pages = {315-327}
}

%Fellows 1988

@article{FellowsFL88,
author = {Michael R. Fellows and Donald K. Friesen and Michael A.
Langston},
title = {On finding optimal and near-optimal lineal spanning trees},
journal = alg, volume = 3, year = 1988, pages = {549-560}}

@inproceedings{FellowsL88,
author = {Michael R. Fellows and Michael A. Langston},
title = {On search, decision and the efficiency of polynomial-time algorithms},
booktitle = stoc89, pages = {501-512}, year = 1989 }

@inproceedings{FellowsL88a,
author = {Michael R. Fellows and Michael A. Langston},
title = {Fast self-reduction algorithms for combinatorial problems of {VLSI} design},
editor = {John H. Reif},
booktitle = {Proceedings of the 3rd Aegean Workshop on Computing, AWOC'88},
year = 1988, pages = {278-287}, publisher = lncs319}

@techreport{FellowsL88a',
author = {Michael R. Fellows and Michael A. Langston},
title = {Fast Search Algorithms for Graph Layout Permutation Problems},
number = {CS-88-189},
institution = {Dept. of Computer Science, Washington State University},
year = 1988
}

%Fellows 1989

@misc{Fellows89,
author = {Michael R. Fellows},
note = {Personal communication},
year = 1989 }

@article{Fellows89a,
author = {Michael R. Fellows},
title = {The {R}obertson-{S}eymour theorems: {A} survey of applications},
journal = {Contemporary Mathematics}, volume = 89, year = 1989, pages = {1-18}}

@unpublished{FellowsA89,
author = {Michael R. Fellows and Karl R. Abrahamson},
title = {Cutset-Regularity Beats Well-Quasi-Ordering for Bounded Treewidth},
note = {Manuscript},
year = 1989 }

@inproceedings{FellowsKL89,
author = {Michael R. Fellows and N. G. Kinnersley and Michael A.  Langston},
title = {Finite-basis theorems, and a computational integrated approach to obstruction set isolation},
editor = {E. Kaltofen and S. M. Watt},
booktitle = {Proceedings of the 3rd Conference on Computers and Mathematics},
publisher = {Springer Verlag}, address = {New York},
pages = {37-45},
year = 1989 }

@inproceedings{FellowsL89,
author = {Michael R. Fellows and Michael A. Langston},
title = {An analogue of the {M}yhill-{N}erode theorem and its use in computing finite-basis characterizations},
booktitle = focs89, year = 1989, pages = {520-525}}

@unpublished{FellowsL89a,
author = {Michael R. Fellows and Michael A. Langston},
title = {Exploiting {RS}-posets: Constructive Algorithms from Nonconstructive tools},
note = {Preprint}, year = 1989, month = {Feb.}, pages = {1-7}}

@unpublished{Fellows89b,
author = {Michael R. Fellows},
title = {Application of an Analoque of the {Myhill-Nerode} Theorem in Obstruction Set Computation},
year = 1989,
note = {preprint}, pages = {1-12}}

@unpublished{Fellows89c,
author = {Michael R. Fellows},
title = {Regular Languages and Software Engineering Principles},
note = {Draft manuscript},
year = 1989, month = {April}, pages = {1-10}}

@unpublished{FellowsS89,
author = {Michael R. Fellows and Sam Stueckle},
title = {The Immersion Order, Forbidden Subgraphs and the Complexity of Network Integrity},
year = 1989,
note = {Manuscript, to appear in J. Comb. Math. Comb. Comput.}
}

%Fellows 1991

@incollection{FellowsKMP91,
author = {Michael R. Fellows and Jan Kratochv{\'{\i}}l and Matthias
Middendorf and Frank Pfeiffer},
title = {Induced Minors and Related Problems},
booktitle = {Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint
Summer Research Conference, Seattle WA, June 1991},
publisher = {American Math. Soc.},
address = {Providence, RI},
editor = {Neil Robertson and Paul Seymour},
note = {Contemp. Math. 147.},
pages = {179-182},
year = 1993}

@article{FellowsL91,
author = {Michael R. Fellows and Michael A. Langston},
title = {Fast search algorithms for layout permutation problems},
journal = {International Journal on Computer Aided VLSI Design}, volume = 3, year = 1991,
pages = {325-340}}

@inproceedings{FellowsL91a,
author = {Michael R. Fellows and Michael A. Langston},
title = {Constructivity Issues in Graph Algorithms},
booktitle = {Conference on Constructivity in Computer Science, San Antonio, Texas},
year = 1991}

%Fellows 1992

@article{FellowsL92,
author = {Michael R. Fellows and Michael A. Langston},
title = {On Well-Partial-Order Theory and Its Application to
Combinatorial Problems of {VLSI} Design},
journal = sjdm, volume = 5, year = 1992, pages = {117-126}}

%Fellows 1993

@inproceedings{FellowsHW93,
author = {Michael R. Fellows and Michael T. Hallett and H. Todd Wareham},
title = {{DNA} Physical Mapping: Three Ways Difficult (extended abstract)},
editor = {Thomas Lengauer},
booktitle = esa93, year = 1993, pages = {157-168}, publisher = lncs726}

@techreport{FellowsH93,
author = {Michael R. Fellows and Donovan R. Hare},
title = {Vertex Transversals That Dominate},
institution = {University of Victoria},
year = 1993}

@article{FellowsK91,
author = {Michael R. Fellows and P. Kaschube},
title = {Searching for {$K_{3,3}$} in Linear Time},
journal = {Linear and Multilinear Algebra}, volume = 29, year = 1991, pages = {279-290}}

@inproceedings{FellowsK93,
author = {Michael R. Fellows and N. Koblitz},
title = {Fixed-parameter complexity and cryptography},
booktitle = {Proceedings of the 10th International
Conference on Algebraic Algorithms and Error-Correcting Codes, AAECC 10,
Lecture Notes in Computer Science},
year = 1993}

%Fellows 1994

@article{FellowsL94,
author = {Michael R. Fellows and Michael A. Langston},
title = {On search, decision and the efficiency of polynomial-time
algorithms},
journal = jcss, year = 1994, volume = 49, pages = {769-779}}

%Fellows 2006

@inproceedings{Fellows06,
author = {Micahel R. Fellows},
title = {The lost continent of polynomial time: Preprocessing and kernelization},
editor = {Hans L. Bodlaender and Michael A. Langston},
booktitle = iwpec06, publisher = lncs4169, year = 2006, pages = {267-277}} 

@inproceedings{FellowsRRS06,
author = {Michael R. Fellows and Frances A. Rosamond and Udi Rotics and Stefan
Szeider},
title = {Clique-width minimization is {NP}-hard},
booktitle = stoc06,
pages = {354-362}, year = 2006}

@unpublished{FellowsLRR06,
author = {Michael R. Fellows and Michael A. Langston and M. Ragan and
Frances A. Rosamond},
title = {Kernelization for Convex Recoloring of Trees},
year = 2006,
note = {Unpublished manuscript}}

%Fellows 2008

@article{FellowsKNRRSTW08,
author = {Michael R. Fellows and Christian Knauer and Naomi Nishimura and Prabhakar Ragde and Frances A. Rosamond
and Ulrike Stege and Dimitrios M. Thilikos and Sue Whitesides},
title = {Faster fixed-parameter tractable algorithms for matching and packing problems},
journal = alg, volume = 52, year = 2008, pages = {167-176}}

@inproceedings{FellowsLMRS08,
author = {Michael R. Fellows and Daniel Lokshtanov and Neeldhara Misra and Frances A. Rosamond and Saket Saurabh},
title = {Graph layout problems parameterized by vertex cover},
editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga},
booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {294-305}}

%Fellows 2009

@article{FellowsHRV09,
author = {Michael R. Fellows and Danny Hermelin and Frances Rosamond and St\'{e}phane Vialette},
title = {On the parameterized complexity of multiple-interval graph problems},
journal = tcs, volume = 410, year = 2009, pages = {53-61}}

%Fels

@article{Felsenstein82,
author = {J. Felsenstein},
title = {Numerical methods for inferring evolutionary trees},
journal = {The Quaterly Review of Biology}, volume = 57, number = 4, year = 1982}

@inproceedings{Felsner93,
author = {S. Felsner},
title = {Tolerance graphs and orders},
editor = {Ernst W. Mayr},
booktitle = wg92, year = 1993, publisher = lncs657, pages = {17-26}}

%Fer

%Feremans

@phdthesis{Feremans01,
author = {C. Feremans},
title = {Generalized Spanning Trees and Extensions},
school = {Universit\'{e} Libre de Bruxelles},
address = {Brussels, Belgium}, year = 2001}

@article{FeremansLL03,
author = {C. Feremans and M. Labb\'{e} and G. Laporte},
title = {Generalized network design problems},
journal = ejor, volume = 148, year = 2003, pages = {1-13}}

@techreport{FeremansG04,
author = {C. Feremans and A. Grigoriev},
title = {Approximation schemes for the generalized geometric problems with
geographic clustering},
type = {METEOR Research Memoranda},
number = {RM/04/034},
institution = {FdEWB, University of Maastricht},
address = {Maastricht, the Netherlands},
year = 2004,
note = {http://www.personeel/unimaas.nl/a.grigoriev/research/curved.pdf}}

%Fern

@article{FernandesLW09,
author = {Cristina G. Fernandes and Orlando Lee and Yoshiko Wakabayashi},
title = {Minimum cycle cover and {C}hinese postman problems on mixed graphs of
bounded treewidth},
journal = dam, volume = 157, year = 2009, pages = {272-279}}

%Fernandez-Baca 1988

@unpublished{FernandezBacaS88,
author = {David Fern\'{a}ndez-Baca and Giora Slutzki},
title = {Algorithms for Counting and Enumeration in Decomposable Graphs},
year = 1988,
note = {Manuscript}}

%Fernandez-Baca 1989

@article{FernandezBaca89,
author = {David Fern\'{a}ndez-Baca}, 
title = {Allocating modules to processors in a distributed system},
journal = ieeetse, volume = {15}, year = 1989, pages = {1427-1436}}

@article{FernandezBacaM89,
author = {David Fern\'{a}ndez-Baca and Charles U. Martel},
title = {On the efficiency of maximum-flow algorithms on networks with
small integer capacities},
journal = alg, year = 1989, volume = 4, pages = {173-189}}

@article{FernandezBacaS89,
author = {David Fern\'{a}ndez-Baca and Giora Slutzki},
title = {Solving parametric problems on trees},
journal = ja, year = 1989, volume = 10, pages = {381-402}}

%Fernandez-Baca 1993

@article{FernandezBacaM93,
author = {David Fern\'{a}ndez-Baca and A. Medipalli},
title = {Parametric Module Allocation on Partial $k$-Trees},
journal = ieeetc, year = 1993, volume = 42, pages = {738-742}}

%Fernandez-Baca 1994

@article{FernandezBacaS94,
author = {David Fern\'{a}ndez-Baca and Giora Slutzki},
title = {Parametic Problems on Graphs of Bounded Treewidth},
journal = ja, volume = 16, pages = {408-430}, year = 1994}

@inproceedings{FernandezBacaS94a,
author = {David Fern\'{a}ndez-Baca and Giora Slutzki},
title = {Optimal parametric search on graphs of bounded treewidth},
editor = {Erik Meineche Schmidt and Sven Skyum},
booktitle = swat94, pages = {155-166}, publisher = lncs824, year = 1994}

%Fernandez-Baca 1997

@article{FernandezBacaS97,
author = {David Fern\'{a}ndez-Baca and Giora Slutzki},
title = {Optimal parametric search on graphs of bounded treewidth},
journal = ja, volume = 22, pages = {212-240}, year = 1997}

@inproceedings{FerranteR79,
author = {J. Ferrante and C. Rackoff},
title = {The computational complexity of logical theories},
booktitle = {Lecture Notes in Mathematics 718},
publisher = {Springer-Verlag}, address = {Berlin}, year = 1979}

%Fernau 2001

@article{FernauN01,
author = {Henning Fernau and Rolf Niedermeier},
title = {An efficient exact algorithm for constraint bipartite vertex
cover},
journal = ja, volume = 38, pages = {374-410}, year = 2001}

%Fernau 2004

@inproceedings{FernauJ04,
author = {Henning Fernau and David W. Juedes},
title = {A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs},
editor = {Jir\'{\i} Fiala and V{\'a}clav Koubek and Jan Kratochv\'{\i}l},
booktitle = mfcs04, year = 2004, publisher = lncs3153, pages = {488-499}}

%Fernau 2006

@inproceedings{Fernau06,
author = {Henning Fernau},
title = {Edge Dominating Set: Efficient enumeration-based exact algorithms},
editor = {Hans L. Bodlaender and Michael A. Langston},
booktitle = iwpec06, publisher = lncs4169, year = 2006, pages = {140-151}}

%Fernau 2008

@article{Fernau08,
author = {Henning Fernau},
title = {Parameterized algorithms for linear arrangement problems},
journal = dam, volume = 156, year = 2008, pages = {3166-3177}}

%Fernau 2009

@inproceedings{FernauFLRSV09,
author = {Henning Fernau and Fedor V. Fomin and Daniel Lokshtanov and Daniel Raible and Saket Saurabh and Yngve Villanger},
title = {Kernel(s) for problems with no kernel: On out-trees with many leaves (Extended abstract)},
editor = {Susanne Albers and Jean-Yves Marion},
series = {Dagstuhl Seminar Proceedings},
publisher = {Leibniz-Zentrum f\"{u}r Informatik},
address = {Schloss Dagstuhl, Germany},
volume = {09001},
booktitle = stacs09, pages = {421-432}, year = 2009}

@article{FernauRS09,
author = {Henning Fernau and Juan A. Rodr{\'{\i}}guez and Jos\'{e} M. Sigarreta},
title = {Offensive $r$-alliances in graphs},
journal = dam, volume = 157, year = 2009, pages = {177-182}}

%Fernau 2010

@article{Fernau10,
author = {Henning Fernau},
title = {Minimum dominating set of queens: A trivial programming exercise?},
journal = dam, volume = 157, year = 2010, pages = {308-318}}

%article{Fernau10a,
author = {Henning Fernau},
title = {Parameterized algorithms for {$d$-Hitting Set}: The weighted case},
journal = tcs, volume = 411, year = 2010, pages = {1698-1713}}

%Fert

@article{FertinR07,
author = {Guillaume Fertin and Andr\'{e} Raspaud},
title = {$L(p,q)$ labeling of $d$-dimensional grids},
journal = dm, volume = 307, year = 2007, pages = {2132-2140}}

%Fes

@inproceedings{FestaPR99,
author = {P. Festa and P. M. Pardalos and M. G. C. Resende},
title = {Feedback set problems},
editor = {D. Z. Du and P. M. Pardalos},
booktitle = {Handbook of Combinatorial Optimization, Vol. A.},
publisher = {Kluwer}, address = {Amsterdam, the Netherlands},
year = 1999, pages = {209-258}}

%Fi

%Fia

@article{FialaKK01,
author = {J. Fiala and Ton Kloks and J. Kratochv{\'{\i}}l},
title = {Fixed-parameter complexity of $\lambda$-labelings},
journal = dam, volume = 113, year = 2001, pages = {59-72}}

@article{FialaJLS03,
author = {J. Fiala and K. Jansen and V. B. Le and E. Seidel},
title = {Graph subcolorings: {C}omplexity and algorithms},
journal = sjdm, volume = 16, pages = {635-650}, year = 2003}

%Fig

@article{deFigueiredoFKS07,
author = {C.M.H. {de Figueiredo} and L. Faria and S. Klein and R. Sritharan},
title = {On the complexity of the sandwich problems for strongly chordal
graphs and chordal bipartite graphs},
journal = tcs, volume = 381, year = 2007, pages = {57-67}}

%Fil

@inproceedings{FilottiMR79,
author = {I. S. Filotti and Gary L. Miller and John Reif},
title = {On determining the Genus of a Graph in {$O(V^{O(g)})$} Steps},
publisher = {ACM Press}, address = {New York},
booktitle = stoc79, year = 1979, pages = {27-37}}

%Fio

@article{Fiorini75,
author = {S. Fiorini},
title = {On the chromatic index of outerplanar graphs},
journal = jctb, volume = 18, year = 1975, pages = {35-38}}

@book{FioriniW77,
author = {S. Fiorini and R. J. Wilson},
title = {Edge-colorings of Graphs},
publisher = {Pitman},
address = {London},
year = 1977
}

%Fis

@article{FishburnF82,
author = {J. P. Fishburn and R. A. Finkel},
title = {Quotient networks},
journal = ieeetc, volume = {C-31}, year = 1982, pages = {288-295}}

@article{FishburnR03,
author = {Peter C. Fishburn and Fred S. Roberts},
title = {No-hole {$L$}(2,1)-colorings},
journal = dam, volume = 130, year = 2003, pages = {513-519}}

@article{FischerMR08,
author = {E. Fischer and J.A. Makowsky and E.V. Ravve},
title = {Counting truth assignments of formulas of bounded tree-width
or clique-width},
journal = dam, volume = 156, year = 2008, pages = {511-529}}

%Fit

@article{Fitch81,
author = {W. M. Fitch},
title = {A non-sequential method for constructing trees and hierarchical classifications},
journal = {Journal of Molecular Evolution}, volume = 18, year = 1981, pages = {30-37}}

%Fl

%Fla

@techreport{FlamminiLM95,
author = {M. Flammini and J. {van Leeuwen} and A. Marchetti-Spaccamela},
title = {The Complexity of Interval Routing on Random Graphs},
type = {Technical Report},
number = {UU-CS-1995-16},
institution = {Utrecht University},
year = 1991}

%Fle

@article{FleinerIM07,
author = {Tamas Fleiner and Robert W. Irving and David F. Manlove},
title = {Efficient algorithms for generalized Stable Marriage and
Roommates problems},
journal = tcs, volume = 381, year = 2007, pages = {162-176}}

@inproceedings{FleischerWY09,
author = {Rudolf Fleischer and Xi Wu and Liwei Yuan},
title = {Experimental study of {FPT} algorithms for the directed feedback
vertex set problem},
editor = {Amos Fiat and Peter Sanders},
booktitle = esa09, publisher = lncs5757, year = 2009,
pages = {611-622}}

%Flo

@inproceedings{FlocchiniMS08,
author = {Paola Flocchini and Bernard Mans and Nicola Santoro},
title = {Tree decontamination with temporary immunity},
editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga},
booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {330-341}}

@article{FloreenKKO05,
author = {P. Flor\'een and P. Kaski and J. Kohonen and P. Orponen},
title = {Exact and approximate balanced data gathering in
energy-constrained sensor networks},
journal = tcs, volume = 344, number = 1, year = 2005, pages = {30-46}}

%Flu

@phdthesis{Fluiter97,
author = {Babette de Fluiter},
title = {Algorithms for Graphs of Small Treewidth},
school = {Utrecht University},
year = 1997}

@misc{FluiterB97,
author = {Babette de Fluiter and Hans L. Bodlaender},
title = {Parallel algorithms for treewidth two},
editor = {Rolf H. M\"{o}hring},
booktitle = wg97, year = 1997, publisher = lncs1335, pages = {157-170}}

@article{FlumFG02,
author = {J\"{o}rg Flum and M. Frick and Martin Grohe},
title = {Query evaluation via tree-decomposition},
journal = jacm, volume = 49, pages = {716-751}, year = 2002}

@book{FlumG06,
author = {J\"{o}rg Flum and Martin Grohe},
title = {Parameterized Complexity Theory},
publisher = {Springer}, year = 2006}

%Fo

%Fom

%Fomin 1998

@article{Fomin98,
author = {Fedor V. Fomin},
title = {Helicopter search problems, bandwidth and pathwidth},
journal = dam, volume = 85, year = 1998, pages = {59-70}}

%Fomin 1999

@article{Fomin99,
author = {Fedor V. Fomin},
title = {Note on a helicopter search problem on graphs},
journal = dam, volume = 95, year = 1999, pages = {241-249}}

%Fomin 2000

@article{FominG00,
author = {Fedor V. Fomin and Petr A. Golovach},
title = {Interval completion and graph searching},
journal = sjdm, volume = 13, year = 2000, pages = {454-464}}

%Fomin 2002

@techreport{FominT02,
author = {F. V. Fomin and D. M. Thilikos},
title = {New upper bounds on the decomposability of planar graphs and fixed
paramater algorithms},
year = 2002,
institution = {Universitat Polit\`ecnica de Catalunya},
number = {LSI-02-56-R},
type = {Technical Report},
address = {Spain}}

%Fomin 2003

@article{Fomin03,
author = {Fedor V. Fomin},
title = {Pathwidth of planar and line graphs},
journal = gc, volume = 19, year = 2003, pages = {91-99}}

@article{FominG03,
author = {Fedor V. Fomin and Petr A. Golovach},
title = {Interval degree and bandwidth of a graph},
journal = dam, volume = 129, pages = {345-359}, year = 2003}

@inproceedings{FominHT03,
author = {Fedor V. Fomin and Pinar Heggernes and Jan Arne Telle},
title = {Graph searching, elimination trees, and a generalization of bandwidth},
editor = {Andrzej Lingas and Bengt J. Nilsson},
booktitle = fct03, year = 2003, publisher = lncs2751, pages = {73-85}}

@article{FominT03,
author = {Fedor V. Fomin},
title = {On the monotonicity of games generated by symmetric submodular functions},
journal = dam, volume = 131, pages = {323-335}, year = 2003}

@inproceedings{FominT03a,
author = {Fedor V. Fomin and Dimitrios M. Thilikos},
title = {Dominating sets and local treewidth},
booktitle = esa03, publisher = lncs2832, year = 2003, pages = {221-229}}

@techreport{FominT03b,
author = {F. V. Fomin and D. M. Thilikos},
title = {A Simple and Fast Approach for Solving Problems on Planar Graphs},
year = 2003,
institution = {Department of Informatics, University of Bergen},
number = {258},
type = {Technical Report},
address = {Bergen, Norway}}

@inproceedings{FominT03c,
author = {Fedor V. Fomin and Dimitrios M. Thilikos},
title = {Dominating sets in planar graphs: Branch-width and exponential speedup},
booktitle = soda03, year = 2003, pages = {168-177}}

%Fomin 2004

@techreport{FominFT04,
author = {F. V. Fomin and P. Fraigniaud and D. M. Thilikos},
title = {The Price of Connectedness in Expansions},
year = 2004,
institution = {Universitat Polit\`ecnica de Catalunya},
number = {LSI-04-28-R},
type = {Technical Report},
address = {Spain}}

@inproceedings{FominKT04,
author = {Fedor V. Fomin and Dieter Kratsch and Ioan Todinca},
title = {Exact (exponential) algorithms for treewidth and minimum fill-in},
editor = {Josep D{\'{\i}}az and Juhani Karhum\"{a}ki and Arto Lepist\"{o} and Donald Sanella},
booktitle = icalp04, publisher = lncs3142, pages = {568-580}, year = 2004}

@article{FominKM04,
author = {Fedor V. Fomin and Dieter Kratsch and Haiko M\"{u}ller},
title = {Algorithms for graphs with small octopus},
journal = dam, volume = 134, year = 2004, pages = {105-128}}

@inproceedings{FominKW04,
author = {Fedor V. Fomin and Dieter Kratsch and Gerhard J. Woeginger},
title = {Exact (exponential) algorithms for the dominating set problem},
editor = {Juraj Hromkovi\u{c} and Manfred Nagl and Bernhard Westfechtel},
booktitle = wg04, pages = {245-256}, year = 2004, publisher = lncs3353}

@inproceedings{FominMT05,
author = {Fedor V. Fomin and F. Mazoit and Ioan Todinca},
title = {Computing branchwidth via efficient triangulations and blocks},
editor = {Dieter Kratsch},
booktitle = wg05, year = 2005, publisher = lncs3787, pages = {374-384}}

@inproceedings{FominT04,
author = {Fedor V. Fomin and Dimitrios M. Thilikos},
title = {A simple and fast approach for solving problems on planar graphs},
booktitle = stacs04, year = 2004, publisher = lncs2996, pages = {56-67}}

@inproceedings{FominT04b,
author = {Fedor V. Fomin and Dimitrios M. Thilikos},
title = {Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speedup},
editor = {Josep D{\'{\i}}az and Juhani Karhum\"{a}ki and Arto Lepist\"{o} and Donald Sanella},
booktitle = icalp04, year = 2004, publisher = lncs3142, pages = {581-592}}

%Fomin 2005

@inproceedings{FominGPS05,
author = {Fedor V. Fomin and Fabrizio Grandoni and A. Pyatkin and A. A. Stepanov},
title = {Bounding the number of minimal dominating sets: a measure and conquer approach},
editor = {Xiaotie Deng and Ding-Zhu Du},
booktitle = isaac05, publisher = lncs3827, year = 2005, pages = {192-203}}

@article{FominGK05,
author = {Fedor V. Fomin and Fabrizio Grandoni and  Dieter Kratsch},
title = {Some new techniques in design and analysis of exact (exponential) algorithms},
journal = beatcs, volume = 87, year = 2005, pages = {47-77}}

@inproceedings{FominGK05a,
author = {Fedor V. Fomin and Fabrizio Grandoni and Dieter Kratsch},
title = {Measure and conquer: Domination --- a case study},
editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and Moti Yung},
booktitle = icalp05, publisher = lncs3580, year = 2005, pages = {191-203}}

%Fomin 2006

@inproceedings{FominGK06,
author = {Fedor V. Fomin and Fabrizio Grandoni and Dieter Kratsch},
title = {Measure and conquer: a simple {$O(2^{0.288n})$} independent set algorithm},
booktitle = soda06, year = 2006, pages = {18-25}}

@inproceedings{FominGK06a,
author = {Fedor V. Fomin and Fabrizio Grandoni and Dieter Kratsch},
title = {Solving connected dominating set faster than $2^n$},
editor = {S. Arun-Kumar and Naveen Garg},
booktitle = fsttcs06, year = 2006, pages = {152-163},
publisher = lncs4337}

@inproceedings{FominGP06,
author = {Fedor V. Fomin and Serge Gaspers and Christian Knauer},
title = {Finding a minimum feedback vertex set in time {$O(1.7548^n)$}},
editor = {Hans L. Bodlaender and Michael A. Langston},
booktitle = iwpec06, publisher = lncs4169, year = 2006, pages = {183-191}}

@article{FominH06,
author = {Fedor V. Fomin and Kjartan H{\o}ie},
title = {Pathwidth of cubic graphs and exact algorithms},
journal = ipl, volume = 97, year = 2006, pages = {191-196}}

@article{FominT06,
author = {Fedor V. Fomin and Dimitrios M. Thilikos},
title = {New upper bounds on the decomposability of planar graphs},
journal = jgt, volume = 51, year = 2006, pages = {53-81}}

@article{FominT06a,
author = {Fedor V. Fomin and Dimitrios M. Thilikos},
title = {Approximation of pathwidth of outerplanar graphs},
journal = jda, volume = 4, year = 2006, pages = {499-510}}

@article{FominT06c,
author = {Fedor V. Fomin and Dimitrios M. Thilikos},
title = {Dominating sets in planar graphs: Branch-width and exponential speedup},
journal = siamjc, volume = 36, year = 2006, pages = {281-309}}

%Fomin 2008

@inproceedings{FominGHMEW08,
author = {Fedor V. Fomin and Petr A. Golovach and Alexander Hall and Mat\'{u}s Mihal\'{a}k and Elias Vicari and Peter Widmayer},
title = {How to guard a graph},
editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga},
booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {318-329}}

@article{FominKTV08,
author = {Fedon V. Fomin and Dieter Kratsch and Ioan Todinca and Yngve Villanger},
title = {Exact algorithms for treewidth and minimum fill-in},
journal = siamjc, volume = 38, year = 2008, pages = {1058-1079}}

@article{FominT08,
author = {Fedor V. Fomin and Dimitrios M. Thilikos},
title = {An annotated bibliography on guaranteed graph searching},
journal = tcs, volume = 399, year = 2008, pages = {236-245}}

@inproceedings{FominV08,
author = {Fedor V. Fomin and Yngve Villanger},
title = {Treewidth computation and extremal combinatorics},
editor = {Luca Aceto and Ivan Damg{\aa}rd and Leslie Ann Goldberg and
Magn\'{u}s M. Halld\'{o}rsson and Anna Ing\'{o}lfsd\'{o}ttir and Igor Walukuewics},
booktitle = icalp08-1, year = 2008, publisher = lncs5125, pages = {210-221}}

%Fomin 2009

@article{FominFN09,
author = {Fedor V. Fomin and Pierre Fraigniaud and Nicolas Nisse},
title = {Nondeterministic graph searching: From pathwidth to treewidth},
journal = alg, volume = 53, year = 2009, pages = {358-373}}

@article{FominGK09,
author = {Fedon V. Fomin and Fabrizio Grandoni and Dieter Kratsch},
title = {A measure {\&} conquer approach for the analysis of exact algorithms},
journal = jacm, volume = 56, year = 2009, number = 5}

%article{FominGKKL09,
author = {Fedor V. Fomin and Petr A. Golovach and Jan Kratochv\'il and Dieter Kratsch and Mathieu Liefloff},
title = {Sort and Search: Exact algorithms for generalized domination},
journal = ipl, volume = 109, year = 2009, pages = {795-798}}

@article{FominGSS09,
author = {Fedor V. Fomin and Serge Gaspers and Saket Saurabh and Alexey A.  Stepanov},
title = {On two techniques of combining branching and treewidh},
journal = alg, volume = 54, year = 2009, pages = {181-207}}

@unpublished{FominV09,
author = {Fedor V. Fomin and Yngve Villanger},
title = {Finding induced subgraphs via minimal triangulations},
year = 2009,
note = {Report, published on http://arxiv.org/abs/0909.5278}}

%Fomin 2010

@article{FominGKLS10,
author = {Fedor V. Fomin and Serge Gaspers and Dieter Kratsch and Mathieu Liedloff and Saket Saurabh},
title = {Iterative compression and exact algorithms},
journal = tcs, volume = 411, year = 2010, pages = {1045-1053}}

@article{FominGKNS10,
author = {Fedor V. Fomin and Petr A. Golovach and Jan Kratochv\'il and Nicolas Nisse and Karol Suchan},
title = {Pursuing a fast robber on a graph},
journal = tcs, volume = 411, year = 2010, pages = {1167-1181}}

@unpublished{FominGLS10,
author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Saket Saurabh},
title = {Algorithmic lower bounds for problems parameterized by clique-width},
year = 2009, 
note = {To appear in Proceedings SODA 2010}}

@unpublished{FominLST10,
author = {Fedor V. Fomin and Daniel Lokshtanov and Saket Saurabh and Dimitrios M. Thilikos},
title = {Bidimensionality and Kernels},
year = 2009, 
note = {To appear in Proceedings SODA 2010}}

%For

@inproceedings{Fortnow97,
author = {L. Fortnow},
title = {Counting complexity},
booktitle = {Complexity Theory Retrospective II},
editor = {L. A. Hemaspaandra and A. Selman},
publisher = {Springer-Verlag},
year = 1997,
pages = {81-107}}

@inproceedings{FortnowS08,
author = {Lance Fortnow and Rahul Santhanam},
title = {Infeasibility of instance compression and succinct {PCPs} for {NP}},
booktitle = stoc08, year = 2008, pages = {133-142},
publisher = {ACM Press}, addres = {New York}}

@article{FortuneHW80,
author = {S. Fortune and J. E. Hopcroft and J. Wyllie},
title = {The directed subgraph homeomorphism problem},
journal = {J. Theoret. Comput. Sci. ??????}, volume = 10,
pages = {111-121}, year = 1980}
%Check the journal. Is is TCS?

%Fot

@inproceedings{FotakisNPS00,
author = {D. A. Fotakis and S. E. Nikoletseas and V. G. Papadopoulou and P. G.  Spirakis},
title = {{NP}-completeness results and efficient approximations for radiocoloring in planar graphs},
editor = {Mogens Nielsen and Branislav Rovan},
booktitle = mfcs00, publisher = lncs1893, year = 2000, pages = {363-372}}

@article{FotatisNPS05,
author = {D. A. Fotakis and S. E. Nikoletseas and V. G. Papadopoulou and P. G.  Spirakis},
title = {Radiocoloring in planar graphs: {C}omplexity and approximations},
journal = tcs, volume = 340, year = 2005, pages = {457-644}}

%Fr

%Fra

%Fraenkel 1978

@inproceedings{FraenkelGJSY78,
author = {A. S. Fraenkel and M. R. Garey and D. S. Johnson and T.  Schaefer and Y. Yesha},
title = {The complexity of checkers on an $n \times n$ board --- preliminary version},
booktitle = focs78, year = 1978, pages = {55-64}}

%Fraenkel 1979

@article{FraenkelY79,
author = {A. S. Fraenkel and Y. Yesha},
title = {Complexity of problems in games, graphs and algebraic equations},
year = 1979, journal = dam, volume = 1, pages = {15-30}}

%Fraenkel 1981 

@article{FraenkelL81,
author = {A. S. Fraenkel and D. Lichtenstein},
title = {Computing a perfect strategy for $n$ by $n$ chess requires time exponential in $n$},
journal = jctA, volume = 31, year = 1981, pages = {199-214}}

%Fraenkel 1982

@article{FraenkelY82,
author = {A. S. Fraenkel and Y. Yesha},
title = {Theory of annihilation games {I}},
journal = jctb, volume = 33, year = 1982, pages = {60-86}}

%Fraenkel 1987

@article{FraenkelG87,
author = {A. S. Fraenkel and E. Goldschmidt},
title = {Pspace-hardness of some combinatorial games},
journal = jctA, volume = 46, year = 1987, pages = {21-38}}

%Fraenkel 1988

@misc{Fraenkel88,
author = {A. S. Fraenkel},
title = {Selected bibliography on two-player combinatorial games and some related material},
year = 1988 }

%Fraenkel 1992

@unpublished{FraenkelSU92,
author = {Aviezri S. Fraenkel and Edward R. Scheinerman and Daniel Ullman},
title = {Undirected Edge Geography},
year = 1992,
note = {Manuscript}}

@techreport{FraenkelKS92,
author = {A. S. Fraenkel and A. Kotzig and G. Sabidussi},
title = {Modular Nim},
year = 1992,
institution = {The Weizmann Institute of Science},
address = {Rehovot, Israel},
number = {CS92-02},
type = {Technical Report}}

%Fraenkel 1993

@article{FraenkelS93,
author = {A. S. Fraenkel and S. Simonson},
title = {Geography},
journal = tcs, volume = 110, year = 1993, pages = {197-214}}

%Fraigniaud

@techreport{FraigniaudG94,
author = {P. Fraigniaud and C. Gavoille},
title = {Interval Routing Schemes},
institution = {Centre de Recerca Matem\`{a}tica, Institut d'Estudes Catalans},
address = {Barcelona, Spain},
number = {251},
year = 1994}

@article{FraigniaudG06,
author = {Pierre Fraigniaud and Cyril Gavoille},
title = {Header-size lower bounds for end-to-end communication in memoryless networks},
journal = cnet, volume = 50, year = 2006, pages = {1630-1638}}

@article{FraigniaudN08,
author = {Pierre Fraigniaud and Nicolas Nisse},
title = {Monotony properties of connected visible graph searching},
journal = ic2, volume = 206, year = 2008, pages = {1383-1393}}

%Fran

@inproceedings{Frank90,
author = {Andr\'{a}s Frank},
title = {Augmenting graphs to meet edge-connectivity requirements},
booktitle = focs90, pages = {708-718}, year = 1990}

@article{Frankl87,
author = {P. Frankl},
title = {Cops and robbers in graphs with large girth and {C}ayley graphs},
pages = {301-305}, year = 1987, journal = dam, volume = 17 }

@article{FranklinGY00,
author = {Matthew Franklin and Zvi Galil and Moti Yung},
title = {Eavesdropping games: A graph-theoretic approach to privacy in distributed systems},
journal = jacm, volume = 47, year = 2000, pages = {225-243}}

%Fre

%Frederickson 1981

@article{FredericksonJ81,
author = {Greg N. Frederickson and J. {Ja'Ja}},
title = {Approximation algorithms for several graph augmentation problems},
journal = siamjc, volume = 10, year = 1981, pages = {270-283}}

%Frederickson 1983

@article{FredericksonJ83,
author = {Greg N. Frederickson and D. B. Johnson},
title = {Finding $k$th path and $p$-centers by generating and searching good data structures},
journal = ja, volume = 4, year = 1983, pages = {61-80}}

%Frederickson 1987

@article{Frederickson87,
author = {Greg N. Frederickson},
title = {Fast algorithms for shortest paths in planar graphs},
journal = siamjc, volume = 16, year = 1987, pages = {1004-1022}}

@unpublished{FredericksonH87,
author = {Greg N. Frederickson and Suzanne E. Hambrusch},
title = {Planar Linear Arrangement of Outerplanar Graphs},
year = 1987,
note = {Manuscript},
address = {Dept. of Computer Sciences, Purdue University}
}

%Frederickson 1988

@article{FredericksonJ88,
author = {Greg N. Frederickson and R. Janardan},
title = {Designing networks with compact routing tables},
journal = alg, volume = 3, year = 1988, pages = {171-190}}

%Frederickson 1992

@unpublished{Frederickson92,
author = {Greg N. Frederickson},
title = {Ambivalent data structures for dynamic 2-edge-connectivity and $k$ smallest spanning trees},
note = {Manuscript}, year = 1992}

%Frederickson 1993

@inproceedings{Frederickson93a,
author = {Greg N. Frederickson},
title = {A data structure for dynamically maintaining rooted trees},
booktitle = soda93, pages = {175-184}, year = 1993}

%Frederickson 1997

@article{Frederickson97,
author = {Greg N. Frederickson},
title = {A data structure for dynamically maintaining rooted trees},
journal = ja, volume = 24, pages = {37-65}, year = 1997}

%Frederickson 1998

@article{Frederickson98,
author = {Greg N. Frederickson},
title = {Maintaining regular properties dynamically in $k$-terminal graphs},
journal = ja, volume = 33, year = 1999, pages = {244-266}}

@article{FrederikssonM06,
author = {Kimmo Fredriksson and Maxim Mozgovoy},
title = {Efficient parameterized string matching},
journal = ipl, volume = 100, year = 2006, pages = {91-96}}

@article{Fredman76,
author = {M. L. Fredman},
title = {New bounds on the complexity of the shortest path problem},
journal = siamjc, volume = 5, year = 1976, pages = {276-287}}

%Fren

@article{FrendrupHRV09,
author = {Allan Frendrup and Michael A. Henning and Bert Randerath and Preben
Dahl Vestergaard},
title = {An upper bound on the domination number of a graph with minimum
degree 2},
journal = dm, volume = 309, year = 2009, pages = {639-646}}

%Fri

@article{FrickG01,
author = {M. Frick and M. Grohe},
title = {Deciding first-order properties of locally tree-decomposable
structures},
journal = jacm, volume = 48, year = 2001, pages = {1184-1206}}

@article{Frick04,
author = {Markus Frick},
title = {Generalized model-checking over locally tree-decomposable classes},
journal = tcs, volume = 37, year = 2004, pages = {157-191}}

@article{FriedmanRS87,
author = {Harvey Friedman and Neil Robertson and Paul D. Seymour},
title = {The Metamathematics of the Graph Minor Theorem},
year = 1987,
journal = cm, volume = 65, pages = {229-261}}

@article{Frieze87,
author = {A. M. Frieze},
title = {Parallel Algorithms for Finding {H}amiltonian Cycles in
Random Graphs},
journal = ipl, year = 1987, pages = {111-117}}

%Fu

%Fuj

@article{FujiiKN69,
author = {M. Fujii and T. Kasami and K. Ninomiya},
title = {Optimal sequencing of two equivalent processors},
journal = sjam, volume = 17, year = 1969, pages = {784-789},
note = {Erratum. SIAM J. Appl. Math. 20 (1971) 141.}}

@article{FujitaN08,
author = {Shinya Fujita and Tomoki Nakamigawa},
title = {Balanced decomposition of a vertex-colored graph},
journal = dam, volume = 156, year = 2008, pages = {3339-3344}}

%Ful

@article{FulkersonG65,
author = {D. R. Fulkerson and O. A. Gross},
title = {Incidence matrices and interval graphs},
journal = {Pacific Journal of Mathetics}, volume = 15, year = 1965, pages = {835-855}}

%Fur

@inproceedings{Furer07,
author = {Martin F\"{u}rer},
title = {Faster integer multiplication},
year = 2007,
booktitle = stoc07}

@article{FurstGM88,
author = {Merrick L. Furst and Jonathan L. Gross and Lyle A.
{McGeoch}},
title = {Finding a Maximum-Genus Graph Imbedding},
journal = jacm, volume = 35, year = 1988, pages = {523-534}}

%G

%Ga

%Gaa

@phdthesis{Gaag90,
author = {Linda C. {van der Gaag}},
title = {Probability-Based Models for Plausible Reasoning},
school = {University of Amsterdam},
year = 1990 }

@inproceedings{GaagBF04,
author = {Linda C. {van der Gaag} and Hans L. Bodlaender and Ad Feelders},
title = {Monotonicity in {B}ayesian Networks},
editor = {David Maxwell Chickering and Joseph Y. Halpern},
booktitle = uai04, pages = {569-576}, year = 2004, publisher = {AUAI Press}}

%Gab

@article{GaborHS89,
author = {C. P. Gabor and W. L. Hsu and K. J. Supowit},
title = {Recognizing circle graphs in polynomial time},
journal = jacm, volume = 36, year = 1989, pages = {435-473}}

%Gabow 1982

@article{GabowK82,
author = {H. Gabow and O. Kariv},
title = {Algorithms for edge coloring bipartite graphs and multigraphs},
journal = siamjc, volume = 11, year = 1982, pages = {117-129}}

%Gabow 1983

@inproceedings{Gabow83,
author = {Harold N. Gabow},
title = {An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems},
booktitle = stoc83, year = 1983, pages = {448-456}}

%Gabow 1986

@article{GabowGST86,
author = {H. N. Gabow and Z. Galil and T. Spencer and R. E. Tarjan},
title = {Efficient algorithms for finding minimum spanning trees in undirected and directed graphs},
journal = comb, volume = 6, year = 1986, pages = {106-122}}

%Gabow 1992

@article{GabowW92,
author = {H. N. Gabow and H. H. Westermann},
title = {Forests, Frames, and Games: Algorithms for Matroid Sums and Applications},
journal = alg, volume = 7, pages = {465-498}, year = 1992}

%Gabow 2000

@inproceedings{Gabow00,
author = {H. N. Gabow},
title = {Using expander graphs to find vertex connectivity},
booktitle = focs00, year = 2000, pages = {410-420}}

%Gabow 2004

@inproceedings{Gabow04,
author = {Harold N. Gabow},
title = {Finding paths and cycles of superpolylogarithmic length},
booktitle = stoc04, year = 2004, pages = {407-416}}

%Gabow 2008

@inproceedings{GabowN08,
author = {Harold N. Gabow and Shuxin Nie},
title = {Finding long paths, cycles, and circuits},
editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga},
booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {752-763}}

%Gal

@article{GaleS62,
author = {D. Gale and L. Shapley},
title = {College admissions and the stability of marriage},
journal = amm, volume = 69, year = 1962, pages = {9-15}}

@article{GaleS85,
author = {D. Gale and M. Sotomayor},
title = {Some remarks on the stable matching problem},
journal = dam, volume = 11, year = 1985, pages = {223-232}}

@article{GalilKS89,
author = {Zvi Galil and Ravi Kannan and Endre Szemer\'{e}di},
title = {On nontrivial separators for $k$-page graphs and simulations by nondeterministic one-tape {T}uring machines},
journal = jcss, volume = 38, year = 1989, pages = {134-149}}

@article{GalloGT89,
author = {Giorgio Gallo and Michael D. Grigoriadis and Robert Endre Tarjan},
title = {A fast parametric maximum flow algorithm and applications},
journal = siamjc, volume = 18, year = 1989, pages = {30-55}}

%Gan

@article{GanianH10,
author = {Robert Ganian and Petr Hlin\v{e}n\'{y}},
title = {On parse trees and {M}yhill-{N}erode-type tools for handling graphs of bounded rank-width},
journal = dam, volume = 158, year = 2010, pages = {851-867}}

@article{Ganjali03,
author = {Y. Ganjali},
title = {Optimum multi-dimensional interval routing schemes on networks with dynamic cost links},
journal = {Computing and Informatics}, volume = 22, year = 2003, pages = {1-17}}

@techreport{GanleyH95,
author = {Joseph L. Ganley and Lenwood S. Heath},
title = {The pagenumber of \mbox{$k$-trees} is {$O(k)$}},
institution = {Department of Computer Science, Virginia Tech},
number = {TR--95--17},
address = {Blacksburg, Virginia},
year = 1995}

@article{GanleyH01,
author = {Joseph L. Ganley and Lenwood S. Heath},
title = {The pagenumber of {$k$}-trees is {$O(k)$}},
journal = dam, volume = 109, year = 2001, pages = {215-221}}

%Gar

@inproceedings{Garbe95,
author = {Renate Garbe},
title = {Tree-width and path-width of comparability graphs of interval orders},
editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer},
booktitle = wg94, publisher = lncs903, year = 1995, pages = {26-37}}

%Garey 1976

@article{GareyJ76,
author = {Michael R. Garey and David S. Johnson},
title = {The complexity of near-optimal graph coloring},
journal = jacm, volume = 23, pages = {43-49}, year = 1976}

@article{GareyJS76,
author = {Michael R. Garey and David S. Johnson and L. Stockmeyer},
title = {Some simplified {NP}-complete graph problems},
journal = tcs, volume = 1, year = 1976, pages = {237-267}}

%Garey 1977

@article{GareyJ77,
author = {Michael R. Garey and David S. Johnson},
title = {The rectilinear {S}teiner tree problem is {NP}-complete},
journal = sjam, volume = 32, year = 1977, pages = {826-834}}

%Garey 1978

@article{GareyGJK78,
author = {Michael R. Garey and R. L. Graham and David S. Johnson and D. E. Knuth},
title = {Complexity Results for Bandwidth Minimization},
year = 1978, journal = sjam, volume = 34, pages = {477-495}}

%Garey 1979

@book{GareyJ79,
author = {Michael R. Garey and David S. Johnson},
title = {Computers and Intractability, A Guide to the Theory of {NP}-Completeness},
publisher = {W.H. Freeman and Company},
year = 1979,
address = {New York}
}

%Garey 1980

@article{GareyJMP80,
author = {Michael R. Garey and David S. Johnson and Gary L. Miller and Christos H. Papadimitriou},
title = {The complexity of coloring circular arcs and chords},
journal = sjadm, volume = 1, year = 1980, pages = {216-227}}

%Garey 1983

@article{GareyJ83,
author = {Michael R. Garey and David S. Johnson},
title = {Crossing number is {NP}-complete},
journal = sjadm, volume = 4, year = 1983, pages = {312-316}}

%Garg

@inproceedings{Garg95,
author = {A. Garg},
title = {On drawing angle graphs},
editor = {R. Tamassia and I. G. Tollis},
booktitle = gd94, publisher = lncs894, year = 1995, pages = {84-95}}

@phdthesis{Garg96,
author = {Ashim Garg},
title = {Where to Draw the Line},
school = {Department of Computer Science, Brown University},
year = 1996}

@inproceedings{GargK98,
author = {N. Garg and J. K\"onemann},
title = {Faster and Simpler Algorithms for Multi-commodity Flow and
Other Fractional Packing Problems},
booktitle = focs98, year = 1998, pages = {300-309}}

%Gas

@inproceedings{GaspersKL06,
author = {Serge Gaspers and Dieter Kratsch and Mathieu Liedloff},
title = {Exponential time algorithms for the minimum dominating set problem on some graph classes},
editor = {Lars Arge and Rusins Freivalds},
booktitle = swat06, pages = {148-159}, year = 2006, publisher = lncs4059}

@inproceedings{GaspersL06,
author = {Serge Gaspers and Mathieu Liedloff},
title = {A branch-and-reduce algorithm for finding a minimum independent dominating Set in graphs},
editor = {Fedor V. Fomin},
booktitle = wg06, year = 2006, pages = {78-89}, publisher = lncs4271}

%Gav

@inproceedings{Gavoille97,
author = {Cyril Gavoille},
title = {On the dilation of interval routing},
editor = {Igor Privara and Peter Ruzicka},
booktitle = mfcs97, publisher = lncs1295, pages = {259-268}, year = 1997}

@article{Gavoille00,
author = {Cyril Gavoille},
title = {A survey on interval routing},
journal = tcs, volume = 245, pages = {217-253}, year = 2000}

@article{Gavril72,
author = {F{\u{a}}nic\u{a} Gavril},
title = {Algorithms for minimum coloring, maximum clique, minimum
covering by cliques, and maximum independent set of a chordal graph},
journal = siamjc, volume = 1, year = 1972, pages = {180-187}}

@article{Gavril74,
author = {F{\u{a}}nic\u{a} Gavril},
title = {The intersection graphs of subtrees in trees are exactly
         the chordal graphs},
journal = jctb, year = 1974, volume = 16, pages = {47-56}}

@article{Gavril74b,
author = {F{\u{a}}nic\u{a} Gavril},
title = {An algorithm for testing chordiality of graphs},
journal = ipl, volume = 3, pages = {110-112}, year = 1974 }

@article{Gavril75,
author = {F{\u{a}}nic\u{a} Gavril},
title = {A recognition algorithm for the intersection graphs of
directed paths in directed trees},
journal = dm, volume = 13, year = 1975, pages = {237-249}}

@article{Gavril78,
author = {F{\u{a}}nic\u{a} Gavril},
title = {A recognition algorithm for the intersection graphs of paths
         in trees},
journal = dm, volume = 23, pages = {211-227}, year = 1978 }

@unpublished{Gavril88,
author = {F{\u{a}}nic\u{a} Gavril},
title = {A Graph Partition Problem Related to {2-CNFSAT}},
year = 1988,
note = {Draft paper}
}

@article{Gavril08,
author = {F{\u{a}}nic\u{a} Gavril},
title = {Minimum weight feedback vertex sets in circle graphs},
journal = ipl, volume = 107, year = 2008, pages = {1-6}}

%Ge

%Gee

%Geelen 2000

@article{Geelen00,
author = {James F. Geelen},
title = {An algebraic matching algorithm},
journal = comb, volume = 20, year = 2000, pages = {61-70}}

%Geelen 2002

@article{GeelenGW02,
author = {J. F. Geelen and A. M. H. Gerards and G. Whittle},
title = {Branch width and well-quasi-ordering in matroids and graphs},
journal = jctb, volume = 84, pages = {270-290}, year = 2002}

%Geelen 2003

@article{GeelenGRW03,
author = {J. F. Geelen and A. M. H. Gerards and N. Robertson and G. Whittle},
title = {On the excluded minors for the matroids of branch-width $k$},
journal = jctb, volume = 88, pages = {261-265}, year = 2003}

%Geelen 2006

@article{GeelenGRW06,
author = {J. Geelen and B. Gerards and N. Robertson and G. Whittle},
title = {Obstructions to branch-decomposition of matroids},
journal = jctb, volume = 96, year = 2006, pages = {560-570}}

%Geelen 2007

@article{GeelenGW07,
author = {Jim Geelen and Bert Gerards and Geoff Whittle},
title = {Excluding a planar graph from {GF($q$)}-representable matroids},
journal = jctb, volume = 97, year = 2007, pages = {971-998}}

%Geelen 2009

@article{GeelenG09,
author = {Jim Geelen and Bert Gerards},
title = {Excluding a group-labelled graph},
journal = jctb, volume = 99, year = 2009, pages = {247-253}}

@article{GeelenGW09,
author = {Jim Geelen and Bert Gerards and Geoff Whittle},
title = {Tangles, tree-decompositions and grids in matroids},
journal = jctb, volume = 99, year = 2009, pages = {657-667}}

%Geo

@article{George73,
author = {J. A. George},
title = {Nested dissection of a regular finite element mesh},
journal = sjna, volume = 10, year = 1973, pages = {345-367}}

@book{GeorgeL81,
author = {J. A. George and J. W. H. Liu},
title = {Computer Solution of Large Sparse Positive Definite Systems},
publisher = {Prentice-Hall Inc.}, address = {Englewood Cliffs, New Yersey},
year = 1981}

@article{GeorgeL89,
author = {A. George and J. W. H. Liu},
title = {The evolution of the minimum degree ordering algorithm},
journal = {SIAM Review}, volume = 31, year = 1989, pages = {1-19}}

@article{GeorgesMW94,
author = {J. P. Georges and D. W. Mauro and M. A. Whittlesey},
title = {Relating path coverings to vertex labelings with a condition at
distance two},
journal = dm, volume = 135, year = 1994, pages = {103-111}}

@article{GeorgesM96,
author = {J. P. Georges and D. W. Mauro},
title = {On the size of graphs labeled with a condition at distance two},
journal = jgt, volume = 22, pages = {47-57}, year = 1996}

%Ger

@incollection{Gerards95,
author = {A. M. H. Gerards},
title = {Matching},
booktitle = {Handbooks in Operations Research and Management Sciences,
Volume 7, Network Models},
pages = {135-224},
chapter = 3,
editor = {{M. O. Ball et al.}},
year = 1995,
address = {Amsterdam},
publisher = {Elsevier Science}}

@article{GerberK03,
author = {Michael U. Gerber and Daniel Kobler},
title = {Algorithms for vertex-partitioning problems on graphs with fixed
clique-width},
journal = tcs, volume = 299, year = 2003, pages = {719-734}}

@inproceedings{GerstelZ93,
author = {O. Gerstel and S. Zaks},
title = {A new characterization of tree medians with applications to distributed algorithms},
editor = {Ernst W. Mayr},
booktitle = wg92, year = 1993, publisher = lncs657, pages = {135-144}}

%Gi

%Gia

@inproceedings{GiammarresiI92,
author = {Dora Giammarresi and Giuseppe F. Italiano},
title = {Dynamic 2- and 3-connectivity on planar graphs},
editor = {O. Nurmi and E. Ukkonen},
booktitle = swat92, publisher = lncs621, year = 1992, pages = {221-232}}

%Gib

%Gibbons 1985

@book{Gibbons85,
author = {Alan M. Gibbons},
title = {Algorithmic Graph Theory},
publisher = {Cambridge Univ. Press},
address = {Cambridge, UK},
year = 1985}

%Gibbons 1986

@techreport{GibbonsR86,
author = {A. M. Gibbons and W. Rytter},
title = {A Fast Parallel Algorithm for Optimally Edge-coloring of Outerplanar Graphs},
year = 1986,
number = {80},
institution = {Dept. of Computer Science, University of Warwick}
}

%Gibbons 1988

@article{GibbonsIR88,
author = {Alan M. Gibbons and Amos Israeli and Wojciech Rytter},
title = {Parallel {$O(\log n)$} time edge-coloring of trees and {H}alin
Graphs},
journal = ipl, volume = 27, year = 1988, pages = {43-52}}

@unpublished{GibbonsR88,
author = {Alan Gibbons and Wojciech Rytter},
title = {Fast Parallel Algorithms for Optimal Edge-Coloring of Some Tree-Structured Graphs},
year = 1988,
note = {Manuscript}
}

@inproceedings{GibbonsKMS88,
author = {P. Gibbons and R. M. Karp and Gary L. Miller and D. Soroker},
title = {Subtree isomorphism is in random {NC}},
editor = {John H. Reif},
booktitle = {Proceedings of the 3rd Aegean Workshop on Computing, AWOC'88},
publisher = lncs319, year = 1988, pages = {43-52}}

%Gibbons 1990

@article{GibbonsR90,
author = {Alan M. Gibbons and W. Rytter},
title = {Optimally edge-colouring outerplanar graphs is in {NC}},
journal = tcs, volume = 71, pages = {401-411}, year = 1990}

%Gibbons 1991

@article{GibbonsKRST91,
author = {Phillip Gibbons and Richard Karp and Vijaya Ramachandran and Danny Soroker and Robert Tarjan},
title = {Transitive compaction in parallel via branchings},
journal = ja, year = 1991, volume = 12, pages = {110-125}}

%Gil

@article{GilbertHT84,
author = {John R. Gilbert and J. P. Hutchinson and Robert Endre Tarjan},
title = {A separator theorem for graphs of bounded genus},
journal = ja, volume = 5, year = 1984, pages = {391-407}}

@article{GilbertLT80,
author = {J. R. Gilbert and T. Lengauer and R. E. Tarjan},
title = {The pebbling problem is complete in polynomial space},
journal = siamjc, volume = 9, pages = {513-524}, year = 1980 }

@article{GilbertRE84,
author = {John R. Gilbert and Donald J. Rose and Anders Edenbrandt},
title = {A separator theorem for chordal graphs},
journal = sjadm, volume = 5, year = 1984, pages = {306-313}}

@article{Gill77,
author = {J. Gill},
title = {Computational complexity of probabilistic complexity classes},
journal = siamjc, volume = 6, year = 1977, pages = {675-695}}

@article{GilmoreH64,
author = {P. C. Gilmore and A. J. Hoffman},
title = {A characterization of comparability graphs and of interval graphs},
journal = canjm, volume = 16, year = 1964, pages = {539-548}}

%Gim

@article{GimenezHN06,
author = {Omer Gim\'{e}nez and Petr Hlin\v{e}n\'{y} and Marc Noy},
title = {Computing the {T}utte polynomial on graphs of bounded clique-width},
journal = sjdm, volume = 20, year = 2006, pages = {932-946}}

%Gl

%Glo

@article{GloverHW79,
author = {H. H. Glover and P. Huneke and C. Wang},
title = {103 graphs that are irreducible for the projective plane},
journal = jctb, volume = 27, year = 1979, pages = {332-370}}

%Go

%Goe

@article{GoemansW97,
author = {Michel X. Goemans and David P. Williamson},
title = {Primal-Dual Approximation Algorithms for Feedback Problems in
Planar Graphs},
journal = combinatorica, volume = 17, year = 1997, pages = {1-23}}

%Gog

@inproceedings{GogateD04,
author = {Vibhav Gogate and Rina Dechter},
title = {A complete anytime algorithm for treewidth},
editor = {David Maxwell Chickering and Joseph Y. Halpern},
booktitle = uai04, publisher = {AUAI Press}, pages = {201-208}, year = 2004}

%Gol

%Gold

@inproceedings{GoldbergPV88,
author = {Andrew V. Goldberg and Serge A. Plotkin and Pravin M.
Vaidya},
title = {Sublinear-Time Parallel Algorithms for Matching and Related
Problems},
booktitle = focs88, pages = {174-185}, year = 1988 }

@article{GoldbergT88,
author = {Andrew V. Goldberg and Robert Endre Tarjan},
title = {A new approach to the maximum-flow problem},
journal = jacm, volume = 35, pages = {921-940}, year = 1988 }

@article{GoldbergGKS95,
author = {P. W. Goldberg and M. C. Golumbic and H. Kaplan and R. Shamir},
title = {Four strikes against physical mapping of {DNA}},
journal = {Journal of Computational Biology}, volume = 2, number = 1, pages = {139-152}, year = 1995}}

@article{GoldbergGPSW96,
author = {L. A. Goldberg and P. W. Goldberg and C. A. Philips and E. Sweedyk and T. Warnow},
title = {Minimizing phylogenetic number to find good evolutionary trees},
journal = dam, volume = 71, pages = {111-136}, year = 1996}

@article{GoldbergK04,
author = {Andrew V. Goldberg and Alexander V. Karzanov},
title = {Maximum skew-symmetric flows and matchings},
journal = mp, volume = 100, year = 2004, pages = {537-568}}

@inproceedings{GoldschmidthH88,
author = {Olivier Goldschmidt and Dorit S. Hochbaum},
title = {Polynomial algorithm for the $k$-cut problem},
booktitle = focs88, pages = {444-451}, year = 1988 }

%Golo

@article{Golovach93,
author = {Petr A. Golovach},
title = {The cutwidth of a graph and the vertex separation number of the line graph},
journal = dam, volume = 3, year = 1993, pages = {517-521}}

@inproceedings{GolovachV08,
author = {Petr A. Golovach and Yngve Villanger},
title = {Parameterized complexity for domination problems on degenerate graphs},
editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani\"{e}l Paulusma},
booktitle = wg08, publisher = lncs5344, year = 2008, pages = {195-205}}

%Golumbic 1980

@book{Golumbic80,
author = {Martin Charles Golumbic},
year = 1980,
title = {Algorithmic Graph Theory and Perfect Graphs},
publisher = {Academic Press},
address = {New York}}

%Golumbic 1983

@article{GolumbicRU83,
author = {Martin Charles Golumbic and Doron Rotem and Jorge Urrutia},
title = {Comparability graphs and intersection graphs},
journal = dm, volume = 43, year = 1983, pages = {37-46}}

%Golumbic 1985

@article{GolumbicJ85,
author = {Martin Charles Golumbic and R. E. Jamison},
title = {The edge intersection graphs of paths in a tree},
journal = jctb, volume = 38, year = 1985, pages = {8-22}}

@article{GolumbicJ85b,
author = {Martin Charles Golumbic and R. E. Jamison},
title = {Edge and vertex intersections of paths in a tree},
journal = dm, volume = 55, year = 1985, pages = {151-159}}

%Golumbic 1987

@article{Golumbic87,
author = {Martin Charles Golumbic},
title = {A general method for avoiding cycling in a network},
journal = ipl, volume = 24, pages = {251-253}, year = 1987 }

%Golumbic 1988

@article{GolumbicH88,
author = {Martin Charles Golumbic and P. L. Hammer},
title = {Stability in circular-arc graphs},
journal = ja, volume = 9, pages = {314-320}, year = 1988}

%Golumbic 1993

@article{GolumbicS93,
author = {Martin Charles Golumbic and R. Shamir},
title = {Complexity and algorithms for reasoning about time: {A}
graph-theoretic approach},
journal = jacm, volume = 40, year = 1993, pages = {1108 - 1133}}

%Golumbic 1994

@article{GolumbicKS94,
author = {Martin Charles Golumbic and H. Kaplan and R. Shamir},
title = {On the complexity of {DNA} physical mapping},
journal = {Advances in Applied Mathematics}, volume = 15, year = 1994, pages = {251-261}}

%Golumbic 1995

@article{GolumbicKS95,
author = {Martin Charles Golumbic and H. Kaplan and R. Shamir},
title = {Graph Sandwich Problems},
journal = ja, volume = 19, year = 1995, pages = {449-472}}

%Golumbic 2000

@article{GolumbicR00,
author = {Martin Charles Golumbic and Udi Rotics},
title = {On the clique-width of some perfect graph classes},
journal = ijfcs, volume = 11, year = 2000, pages = {423-443}}

%Golumbic 2006

@article{GolumbicMR06,
author = {Martin Charles Golumbic and Aviad Mintz and Udi Rotics},
title = {Factoring and recognition of read-once functions using cographs and
normality and the readability of functions associated with partial $k$-trees},
journal = dam, volume = 154, year = 2006, pages = {1465-1477}}

%Golumbic 2008

@article{GolumbicLS08,
author = {Martin Charles Golumbic and Marina Lipshteyn and Michal Stern},
title = {The $k$-edge intersection graphs of paths in a tree},
journal = dam, volume = 156, year = 2008, pages = {451-461}}

%Gon

@book{GondranM84,
author = {M. Gondran and M. Minoux},
title = {Graphs and Algorithms},
year = 1984,
publisher = {Wiley}, address = {Chichester, UK}}

%Gor

@inproceedings{Gorbunov93,
author = {K. {Yu.} Gorbunov},
title = {An Estimate of the Tree-Width of a Graph Which has not a Given Planar Grid as a Minor},
editor = {Juraj Hromkovic and Ondrej S\'{y}kora},
booktitle = wg98, year = 1998, pages = {372-383}, publisher = lncs1517}

%Got

%Gottlob 2000

@article{GottlobLS00,
author = {Georg Gottlob and Nicola Leone and Francesco Scarcello},
title = {A comparison of structural {CSP} decomposition methods},
year = 2000, pages = {243-282}, journal = ai, volume = 124}

%Gottlob 2002

@article{GottlobLS02,
author = {Georg Gottlob and Nicola Leone and Francesco Scarcello},
title = {Hypertree decompositions and tractable queries},
journal = jcss, volume = 64, pages = {579-627}, year = 2002}

@article{GottlobSS02,
author = {G. Gottlob and F. Scarcello and M. Sideri},
title = {Fixed-parameter complexity in {AI} and nonmonotonic reasoning},
journal = ai, volume = 138, pages = {55-86}, year = 2002}

%Gottlob 2004

@article{GottlobP04,
author = {G. Gottlob and R. Pichler},
title = {Hypergraphs in model checking: {A}cyclicity and hypertree-width
versus clique-width},
journal = siamjc, volume = 33, pages = {351-378}, year = 2004}

%Gottlob 2005

@inproceedings{GottlobGMSS05,
author = {G. Gottlob and M. Grohe and N. Musliu and M. Samer and F. Scarcello},
title = {Hypertree decompositions: Structure, algorithms, and applications},
editor = {Dieter Kratsch},
booktitle = wg05, publisher = lncs3787, year = 2005, pages = {1-15}}

%Gottlob 2009

@article{GottlobMS09,
author = {Georg Gottlob and Zolt{\'a}n Mikl{\'o}s and Thomas Schwentick},
title = {Generalized hypertree decompositions: {NP}-hardness and tractable variants},
journal = jacm, volume = 56, year = 2009, number = 6}

%Gottlob 2010

@article{GottlobPW10,
author = {Georg Gottlob and R. Pichler and F. Wei},
title = {Bounded treewidth as a key to tractability of knowledge representation and reasoning},
journal = ai, volume = 174, year = 2010, pages = {105-132}}

@article{GottlobPW10a,
author = {Georg Gottlob and R. Pichler and F. Wei},
title = {Tractable database design and datalog abduction through bounded treewidth},
journal = {Information Systems}, volume = 35, year = 2010, pages = {278-298}}

%Gov

@inproceedings{GovindanLR93,
author = {R. Govindran and M. A. Langston and S. Ramachandramurthi},
title = {A practical approach to layout optimization},
booktitle = {Proceedings of the 6th International Conference on VLSI Design},
address = {Bombay, India}, year = 1993, pages = {222-225}}

@article{GovindranLY98,
author = {Rajeev Govindran and Michael A. Langston and Xudong Yan},
title = {Approximating the pathwidth of outerplanar graphs},
journal = ipl, year = 1998, volume = 68, pages = {17-23}}

@article{GovindranR01,
author = {Rajeev Govindran and S. Ramachandramurthi},
title = {A weak immersion relation on graphs and its applications},
journal = dm, volume = 230, pages = {189-206}, year = 2001}

%Gr

%Gra

%Grab

@techreport{Grabe91,
author = {A. Grabe},
title = {Zur Berechnung der Grundzustandsenergie und der
Zustandssumme von Spin-Glas-Hamiltonfunktionen},
type = {Diplomarbeit},
institution = {Bielefeld University},
month = {March}, year = 1991, pages = {1-155}}

%Grae

@techreport{Graef93,
author = {Albert Gr{\"{a}}f},
title = {Complete Difference Sets and {$T$}-Colorings of Complete Graphs},
institution = {University of Mainz}, year = 1993}

%Grah

@book{GrahamKP94,
author = {R. L. Graham and D. E. Knuth and O. Patashnik},
title = {Concrete Mathematics},
year = 1994, 
publisher = {Addison-Wesley}}

%Gram

@article{GrammGHN04,
author = {Jens Gramm and Jiong Guo and Falk H\"{u}ffner and Rolf Niedermeier},
title = {Automated generation of search tree algorithms for hard graph-modification problems},
journal = alg, volume = 29, pages = {321-347}, year = 2004}

@inproceedings{GrammGHN06,
author = {Jens Gramm and Jiong Guo and Falk H\"{u}ffner and Rolf Niedermeier},
title = {Data reduction, exact, and heuristic algorithms for clique cover},
booktitle = alenex06, year = 2006, publisher = {SIAM}, pages = {86-94}}

@article{GrammFHN08,
author = {Jens Gramm and Jiong Guo and Falk H\"{u}ffner and Rolf Niedermeier},
title = {Data reduction and exact algorithms for clique cover},
journal = acmjea, year = 2008, volume = 13, number = {2.2}}

@article{GrammNT08,
author = {J. Gramm and A. Nickelsen and T. Tantau},
title = {Fixed-parameter algorithms in phylogenetics},
journal = tcj, volume = 51, year = 2008, pages = {79-101}}

%Gran

@article{Grandoni06,
author = {Fabrizio Grandoni},
title = {A note on the complexity of minimum dominating set},
journal = jda, volume = 4, year = 2006, pages = {209-214}}

@techreport{GranotS90,
author = {Daniel Granot and Darko Skorin-Kapov},
title = {A Fixed Cost Spanning-Forest Problem On Series-Parallel Graphs},
institution = {SUNY at Stony-Brook},
type = {Harriman School Working Paper},
number = {HAR-90-009}, year = 1990}

@article{GranotS91,
author = {Daniel Granot and Darko Skorin-Kapov},
title = {{NC} algorithms for recognizing partial 2-trees and 3-trees},
journal = sjdm, volume = 4, number = 3, pages = {342-354}, year = 1991}

@article{GranotS94,
author = {Daniel Granot and Darko Skorin-Kapov},
title = {On some optimization problems on $k$-trees and partial $k$-trees},
journal = dam, volume = 48, year = 1994, pages = {129-145}}

%Gri

@article{GriggsY92,
author = {J. R. Griggs and R. K. Yeh},
title = {Labeling graphs with a condition at distance 2},
journal = sjdm, volume = 5, year = 1992, pages = {586-595}}

@article{GrigoriadisK88,
author = {M. D. Grigoriades and B. Kalantari},
title = {A new class of heuristic algorithms for weighted perfect
matching},
journal = jacm, volume = 35, year = 1988, pages = {769-776}}

@article{GrigorievMU09,
author = {Alexander Grigoriev and Bert Marchal and Natalya Usotskaya},
title = {On planar graphs with large tree-width and small grid minors},
journal = endm, volume = 32, year = 2009, pages = {35-42}}

%Gro

%Grohe 2003

@article{Grohe03,
author = {Martin Grohe},
title = {Local tree-width, excluded minors, and approximation algorithms},
journal = combinatorica, volume = 23, year = 2003, pages = {613-632}}

%Grohe 2004

@article{Grohe04,
author = {Martin Grohe},
title = {Computing crossing numbers in quadratic time},
journal = jcss, volume = 68, pages = {285-302}, year = 2004}

%Grohe 2009

@article{GroheM09,
author = {Martin Grohe and D\'{a}niel Marx},
title = {On tree width, bramble size, and expansion},
journal = jctb, year = 2009, volume = 99, pages = {218-228}}

%Gros

@book{GrossT87,
author = {Jonathan L. Gross and Thomas W. Tucker},
title = {Topological Graph Theory},
series = {Wiley Interscience Series in Discrete Mathematics and Optimization},
publisher = {J. Wiley \& Sons},
address = {New York},
year = 1987}

@book{GrossY99,
title = {Graph Theory and Its Applications},
author = {Jonathan Gross and Jay Yellen},
year = {1999},
address = {CRC Press},
publisher = {New York}}

@article{GrotschelLA85,
author = {M. L. Gr\"{o}tschel and L. Lovasz and A. Schrijver},
title = {Polynomial algorithms for perfect graphs},
journal = adm, volume = 21, year = 1985, pages = {325-327}}

%Gu

@inproceedings{GuT05,
author = {Qian-Ping Gu and Hisao Tamaki},
title = {Optimal branch-decomposition of planar graphs in {$O(n^3)$} time},
editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and Moti Yung},
booktitle = icalp05, publisher = lncs3580, pages = {373-384}, year = 2005}

@article{GuT08,
author = {Qian-Ping Gu and Hisao Tamaki},
title = {Optimal branch-decomposition of planar graphs in {$O(n^3)$} time},
journal = acmtalg, volume = 4, year = 2008, pages = {Article No. 30}}

%Gua

@article{GuanZ99,
author = {D. Guan and X. Zhu},
title = {Game chromatic number of outerplanar graphs},
journal = jgt, volume = 30, pages = {67-70}, year = 1999}

%Guo

%Guo 2005

@inproceedings{GuoGHNW05,
author = {Jiong Guo and Jens Gramm and Falk H\"{u}ffner and Rolf
Niedermeier and Sebastian Wernicke},
title = {Improved fixed-parameter algorithms for two feedback set
problems},
editor = {Frank K. H. A. Dehne and Alejandro L\'{o}pez-Ortiz and
J\"{o}rg-R\"{u}dinger Sack},
booktitle = wads05, pages = {158-168}, publisher = lncs3608, year = 2005}

%Guo 2006

@phdthesis{Guo06,
author = {Jiong Guo},
title = {Algorithm Design Techniques for Parameterized Graph Modification
Problems},
year = 2006,
school = {Institut f\"{u}r Informatik, Friedrich-Schiller-Universit\"{a}t},
address = {Jena, Germany}}

@inproceedings{GuoNW06,
author = {Jiong Guo and Rolf Niedermeier and Sebastian Wernicke},
title = {Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual},
editor = {Hans L. Bodlaender and Michael A. Langston},
booktitle = iwpec06, publisher = lncs4169, year = 2006, pages = {203-214}}

%Guo 2007

@inproceedings{Guo07,
author = {Jiong Guo},
title = {A more effective linear kernelization for Cluster Editing},
editor = {Bo Chen and Mike Paterson and Guochan Zhang},
booktitle = {Proceedings 1st International Symposium on Combinatorics,
Algorithms, Probabilistic and Experimental Methodologies, ESCAPE 2007},
year = 2007, publisher = lncs4614, pages = {36-47}}

@article{GuoHM07,
author = {Jiong Guo and Falk Hueffner and Hannes Moser},
title = {Feedback arc set in bipartite tournaments is {NP}-complete},
journal = ipl, volume = 102, year = 2007, pages = {62-65}}

@article{GuoN07,
author = {Jiong Guo and Rolf Niedermeier},
title = {Invitation to Data Reduction and Problem Kernelization},
journal = {ACM SIGACT News}, volume = 38, pages = {31-45}, year = 2007}

@inproceedings{GuoN07a,
author = {Jiong Guo and Rolf Niedermeier},
title = {Linear problem kernels for {NP}-hard problems on planar graphs},
editor = {Lars Arge and Christian Cachin and Tomasz Jurdzinski and Andrzej Tarlecki},
booktitle = icalp07, publisher = lncs4596, pages = {375-386}, year = 2007}

@article{GuoNW07,
author = {Jiong Guo and Rolf Niedermeier and Sebastian Wernicke},
title = {Parameterized complexity of vertex cover variants},
journal = tocs, volume = 41, year = 2007, pages = {501-520}}

@article{GuoNU07,
author = {Jiong Guo and Rolf Niedermeier and Johannes Uhlmann},
title = {Two fixed-parameter algorithms for {Vertex Covering by Paths on
Trees}},
journal = ipl, volume = 106, year = 2008, pages = {81-86}}

%Guo 2009

@article{Guo09,
author = {Jiong Guo},
title = {A more effective linear kernelization for cluster editing},
journal = tcs, volume = 410, year = 2009, pages = {718-726}}

%Gupta 1982

@article{GuptaLL82,
author = {U. I. Gupta and D. T. Lee and Joseph Y.-T. Leung},
title = {Efficient algorithms for interval graphs and circular-arc graphs},
journal = netw, volume = 12, year = 1982, pages = {459-467}}

%Gupta 1993

@inproceedings{Gupta93,
author = {Arvind Gupta},
title = {Finite automata as characterizations of minor closed tree families (Extended Abstract)},
editor = {Andrzej Lingas and Rolf G. Karlsson and Svante Carlsson},
booktitle = icalp93, pages = {359-370}, year = 1993, publisher = lncs700}

%Gupta 1994

@techreport{GuptaN94,
author = {Arvind Gupta and Naomi Nishimura},
title = {Sharp Divisions in Complexity of Subgraph Isomorphism for Graphs of
Bounded Path- and Tree- Width},
number = {CS-94-45}, year = 1994,
institution = {University of Waterloo, Computer Science Department},
address = {Waterloo, Ontario, Canada},
remark = {Contained an error. Corrected as GuptaN95.}}

@inproceedings{GuptaN94a,
author = {Arvind Gupta and Naomi Nishimura},
title = {Sequential and parallel algorithms for embedding problems on classes of partial $k$-trees},
editor = {Erik Meineche Schmidt and Sven Skyum},
booktitle = swat94, publisher = lncs824, pages = {172-182}, year = 1994}

%Gupta 1995

@unpublished{GuptaKMS95,
author = {Arvind Gupta and Damon Kaller and S. Mahajan and T. Shermer},
title = {Vertex partitioning problems on partial $k$-trees},
note = {Manuscript}, year = 1995}

@techreport{GuptaN95,
author = {Arvind Gupta and Naomi Nishimura},
title = {The Complexity of Subgraph Isomorphism: Duality Results for Graphs of
Bounded Path- and Tree-Width},
number = {CS-95-14}, year = 1995,
institution = {University of Waterloo, Computer Science Department},
address = {Waterloo, Ontario, Canada}}

@article{GuptaN95a,
author = {Arvind Gupta and Naomi Nishimura},
title = {The parallel complexity of tree embedding problems},
journal = ja, volume = 18, pages = {176-200}, year = 1995}

%Gupta 1996

@article{GuptaN96,
author = {Arvind Gupta and Naomi Nishimura},
title = {The complexity of subgraph isomorphism for classes of
partial $k$-trees},
journal = tcs, volume = 164, year = 1996, pages = {287-298}}

%Gupta 1999

@article{GuptaS99,
author = {Srabani Sen Gupta and Bhabani P. Sinha},
title = {A simple {$O(\log N)$} time parallel algorithm for testing
isomorphism of maximal outerplanar graphs},
journal = jpdc, volume = 56, year = 1999, pages = {144-155}}

%Gupta 2000

@article{GuptaKS00,
author = {A. Gupta and D. Kaller and T. Shermer},
title = {Linear-time algorithms for partial $k$-tree complements},
journal = alg, volume = 27, year = 2000, pages = {254-274}}

%Gupta 2005

@article{GuptaNPR05,
author = {Arvind Gupta and Naomi Nishimura and Andrzej Proskurowski and
Prabhakar Ragda},
title = {Embeddings of $k$-connected graphs of pathwidth $k$},
journal = dam, volume = 145, pages = {242-265}, year = 2005}

%Gur

@article{GurariS84,
author = {E. M. Gurari and Ivan Hal Sudborough},
title = {Improved Dynamic Programming Algorithms for Bandwidth Minimization and
the Mincut Linear Arrangement Problem},
journal = ja, year = 1984, volume = 5, pages = {531-546}}

@article{GurevichSV84,
author = {Y. Gurevich and L. Stockmeyer and Uzi Vishkin},
title = {Solving {NP}-hard Problems on Graphs that are Almost Trees
and an Application to Facility Location Problems},
journal = jacm, year = 1984, volume = 31, pages = {459-473}}

@article {GurevichS87, 
author = {Yuri Gurevich and Saharon Shelah},
title = {Expected computation time for {H}amiltonian path problem},
journal = siamjc, volume = 16, year = 1987, pages = {486-502}}

@article{Gurski06,
author = {Frank Gurski},
title = {Linear layouts measuring neighbourhoods in graphs},
journal = dm, volume = 306, pages = {1637-1650}, year = 2006}

@article{GurskiW06,
author = {Frank Gurski and Egon Wanke},
title = {Vertex disjoint paths on clique-width bounded graphs},
journal = tcs, volume = {359}, year = 2006, pages = {188-199}}

@article{GurskiW07,
author = {Frank Gurski and Egon Wanke},
title = {A local characterization of bounded clique-width for line graphs},
journal = dm, volume = 307, year = 2007, pages = {756-759}}

@article{GurskiW07a,
author = {Frank Gurski and Egon Wanke},
title = {Line graphs of bounded clique width},
journal = dm, volume = 307, pages = {2734-2754}, year = 2007}

@article{GurskiW09,
author = {Frank Gurski and Egon Wanke},
title = {The {NLC}-width and clique-width for powers of graphs of bounded
tree-width},
journal = dam, volume = 157, pages = {583-595}, year = 2009}

%Gus

%Gusfield 1986

@article{GusfieldP86,
author = {D. Gusfield and L. Pitt},
title = {Equivalent approximation algorithms for node cover},
journal = ipl, year = 1986, volume = 22, pages = {291-294}}

%Gusfield 1987

@article{Gusfield87,
author = {D. Gusfield},
title = {Three fast algorithms for four problems in stable marriage},
journal = siamjc, volume= 16, year = 1987, pages = {111-128}}

%Gusfield 1988

@article{Gusfield88,
author = {D. Gusfield},
title = {The structure of the stable roommates problem: {E}fficient representation and enumeration of all stable assignments},
journal = siamjc, volume = 17, year = 1988, pages = {742-769}}

%Gusfield 1991

@article{Gusfield91,
author = {D. Gusfield},
title = {Efficient algorithms for inferring evolutionary trees},
journal = networks, volume = 21, year = 1991, pages = {19-28}}

%Gusfield 1992

@article{GusfieldM92,
author = {D. Gusfield and C. Martel},
title = {A fast algorithm for the generalized parametric minimum cut problem and applications},
journal = alg, volume = 7, year = 1992, pages = {499-520}}

%Gustedt 1991

@techreport{Gustedt91,
author = {Jens Gustedt},
title = {Well Quasi Ordering Finite Posets and Formal Languages},
number = {290/1991}, year = 1991,
institution = {Fachbereich Mathematik, Technische Universit\"{a}t Berlin}}

%Gustedt 1992

@unpublished{GustedtS92,
author = {Jens Gustedt and Angelika Steger},
title = {Testing Hereditary Properties Efficiently},
year = 1992,
note = {Manuscript}}

%Gustedt 1993

@article{Gustedt93,
author = {Jens Gustedt},
title = {On the pathwidth of chordal graphs},
journal = dam, year = 1993, volume = 45, number = 3, pages = {233-248}}

%Gustedt 1998

@article{Gustedt98,
author = {Jens Gustedt},
title = {Efficient {Union-Find} for planar graphs and other sparse graph
classes},
journal = tcs, volume = 203, pages = {123-141}, year = 1998}

%Gustedt 2002

@inproceedings{GustedtMT02,
author = {J. Gustedt and O. A. M{\ae}hle and J. A. Telle},
title = {The treewidth of {J}ava programs},
editor = {David M. Mount and Clifford Stein},
booktitle = wea02, publisher = lncs2409, year = 2002, pages ={86-97}}

%Gut

@article{GutinKLY05,
author = {G. Gutin and T. Kloks and C. M. Lee and A. Yeo},
title = {Kernels in planar digraphs},
journal = jcss, volume = 71, pages = {174-184}, year = 2005}

@article{GutinRK09,
author = {Gregory Gutin and Igor Razgon and Eun Jung Kim},
title = {Minimum leaf out-branching and related problems},
journal = tcs, volume = 410, year = 2009, pages = {4571-4579}}

@inproceedings{GutjahrWW89,
author = {Wolfgang Gutjahr and Emo Welzl and Gerhart Woeginger},
title = {Polynomial Graph-Colorings},
booktitle = stacs89,
pages = {108-119},
year = 1989}

@unpublished{Gutner09,
author = {Shai Gutner},
title = {Polynomial kernels and faster algorithms for the dominating set problem on graphs with an excluded minor},
year = 2009,
note = {In Proceedings IWPEC 2009}}

%H

%Ha

%Haa

@article{HaasH06,
author = {Robert Haas and Michael Hoffmann},
title = {Chordless paths through three vertices},
journal = tcs, volume = 351, year = 2006, pages = {360-371}}

%Hab

%Habel 1987

@inproceedings{HabelK87,
author = {Annegret Habel and Hans-J\"{o}rg Kreowski},
title = {May we introduce to you: hyperedge replacement},
editor = {Hartmut Ehrig and Manfred Nagl and Grzegorz Rozenberg and Azriel Rosenfeld},
booktitle = gragra86, publisher = lncs291, pages = {15-26}, year = 1987}

@article{HabelK87a,
author = {Annegret Habel and Hans-J\"{o}rg Kreowski},
title = {Characteristics of Graph Languages generated by Edge Replacement},
journal = tcs, volume = 51, year = 1987, pages = {81-115}}

%Habel 1988

@inproceedings{Habel88,
author = {Annegret Habel},
title = {Graph-Theoretic Properties Compatible with Graph Derivations},
editor = {Jan van Leeuwen},
booktitle = wg88, pages = {11-29}, publisher = lncs344, year = 1988 }

%Habel 1989

@article{HabelKV89,
author = {Annegret Habel and Hans-J\"{o}rg Kreowski and W. Vogler},
title = {Metatheorems for decision problems on hyperedge-replacement graph languages},
journal = ai, volume = 26, year = 1989, pages = {657-677}}

%Habel 1990

@inproceedings{HabelK90,
author = {Annegret Habel and Hans-J\"{o}rg Kreowski},
title = {Filtering hyperedge-replacement languages through compatible properties},
editor = {Manfred Nagl},
booktitle = wg89, year = 1990, publisher = lncs411, pages = {107-120}}

%Habel 1992

@book{Habel92,
author = {Annegret Habel},
title = {Hyperedge Replacement: Grammars and Languages},
publisher = {Springer-Verlag},
address = {Berlin},
series = {Lecture Notes in Computer Science, Vol. 643},
year = 1992}

@inproceedings{HabelK92,
author = {Annegret Habel and Hans-J\"{o}rg Kreowski},
title = {Collage Grammars},
booktitle = lncs532,
pages = {411-429},
year = 1991}

@unpublished{HabelKT92,
author = {Annegret Habel and Hans-J\"{o}rg Kreowski and Stefan Taubenberger},
title = {Collage and Patterns Generated by Hyperedge Replacement},
year = 1992,
note = {Manuscript, to appear in Languages and Design 1992}}

%Habib

@article{HabibM87,
author = {Michel Habib and Rolf H. M{\"{o}}hring},
title = {On some complexity properties of {N}-free posets and posets with
bounded decomposition diameter},
journal = dm, volume = 63, year = 1987, pages = {157-182}}

@article{HabibM94,
author = {Michel Habib and Rolf H. M{\"{o}}hring},
title = {Treewidth of Cocomparability Graphs and a New Order-theoretic Parameter},
journal = {ORDER}, volume = 1, pages = {47-60}, year = 1994}

@article{HabibP04,
author = {Michel Habib and Christophe Paul},
title = {A simple linear time algorithm for cograph recognition},
journal = dam, volume = 145, pages = {183-197}, year = 2004}

%Hac

@article{Hackbusch97,
author = {W. Hackbusch},
title = {On the feedback vertex set problem for a planar graph},
journal = {Computing}, volume = 58, year = 1997, pages = {129-155}}

%Hag

%Hagerup 1988

@article{Hagerup88,
author = {Torben Hagerup},
title = {On Saving Space in Parallel Computation},
journal = ipl, volume = 29, pages = {327-329}, year = 1988 }

%Hagerup 1990

@article{Hagerup90,
author = {Torben Hagerup},
title = {Optimal parallel algorithms on planar graphs},
journal = ic2, volume = 84, pages = {71-96}, year = 1990 }

@article{Hagerup90a,
author = {Torben Hagerup},
title = {Planar Depth-First Search in ${O}(\log n)$ Parallel Time},
journal = siamjc, volume = 19, pages = {678-704}, year = 1990 }}

%Hagerup 1995

@inproceedings{HagerupKNR95,
author = {Torben Hagerup and Jyrki Katajainen and Naomi Nishimura and Prabhakar Ragde},
title = {Characterizations of $k$-Terminal Flow Networks and Computing Network Flows in Partial $k$-Trees},
booktitle = soda95, year = 1995, pages = {641-649}}

%Hagerup 1997

@inproceedings{Hagerup97,
author = {Torben Hagerup},
title = {Dynamic algorithms for graphs of bounded treewidth},
editor = {Pierpaolo Degano and Roberto Gorrieri and Alberto Marchetti-Spaccamela},
booktitle = icalp97, publisher = lncs1256, year = 1997, pages = {292-302}}

%Hagerup 1998

@article{HagerupKNR98,
author = {Torben Hagerup and Jyrki Katajainen and Naomi Nishimura and
Prabhakar Ragde},
title = {Characterizing multiterminal flow networks and computing flows in
networks of small treewidth},
journal = jcss, volume = 57, pages = {366-375}, year = 1998}

%Hagerup 2000

@article{Hagerup00,
author = {Torben Hagerup},
title = {Dynamic algorithms for graphs of bounded treewidth},
journal = alg, volume = 27, year = 2000, pages = {292-315}}

%Haj

%Hal

@article{HalldorssonKT00,
author = {Magn\'us M. Halld\'orsson and Jan Kratochv\'il and Jan Arne Telle},
title = {Independent Sets with Domination Constraints},
journal = dam, volume = 99, year = 2000, pages = {39-54}}

@article{HalldorssonK02,
author = {Magn{\'{u}}s Halld{\'{o}}rsson and Guy Kortsarz},
title = {Tools for Multicoloring with Applications to Planar Graphs and Partial
$k$-Trees},
journal = ja, volume = 42, pages = {334-366}, year = 2002}

%Han

@article{Han08,
author = {Yijie Han},
title  = {A note of an {$O(n^3 / \log n)$} time algorithm for all pairs shortest paths},
journal = ipl, volume = 105, year = 2008, pages = {114-116}}

%Hao

@article{HaoO94,
author = {Jianxiu Hao and James B. Orlin},
title = {A faster algorithm for finding the minimum cut in a directed graph},
journal = ja, volume = 17, pages = {424-446}, year = 1994}

%Har

@article{HaralamidesMM91,
author = {J. Haralamides and F. Makedon and B. Monien},
title = {Bandwidth minimization: an approximation algorithm for caterpillars},
journal = mst, volume = 24, year = 1991, pages = {169-177}}

@book{Harary69,
author = {F. Harary},
title = {Graph Theory},
publisher = {Addison-Wesley},
address = {Reading, MA},
year = 1969 }

@unpublished{HararyT??,
author = {Frank Harary and Zsolt Tuza},
title = {Two graph-coloring games},
note = {Manuscript}}

@article{HareHH86,
author = {E. O. Hare and S. T. Hedetniemi and W. R. Hare},
title = {Algorithms for computing the domination number of $k \times
n$ complete grid graphs},
journal = cn, volume = 55, year = 1986, pages = {81-92}}

@article{HareH87,
author = {E. O. Hare and S. T. Hedetniemi},
title = {A linear algorithm for computing the knight's domination
number of a $k \times n$ chessboard},
journal = cn, volume = 59, year = 1987, pages = {115-130}}

@inproceedings{HareHLPW87,
author = {E. Hare and S. Hedetniemi and R. Laskar and K. Peters and T. Wimer},
title = {Linear-time Computability of Combinatorial Problems on
Generalized-Series-Parallel Graphs},
booktitle = {Proceedings of the Japan-US Joint Seminar on Discrete Algorithms and Complexity},
publisher = {Academic Press, Inc.},
address = {Orlando, Florida},
editor = {David S. Johnson and Takao Nishizeki and Akihiro Nozaki and
Herbert S. Wilf},
year = 1987
}

%Has

@article{HassinT86,
author = {R. Hassin and A. Tamir},
title = {Efficient Algorithms for Optimization and Selection on
Series-Parallel Graphs},
journal = sjadm, volume = 7, year = 1986, pages = {379-389}}

@article{HasunumaIOU09,
author = {Toru Hasunuma and Toshimasa Ishii and Hirotaka Ono and Yuski Uno},
title = {An {$O(n^{1.75})$} algorithm for {$L(2,1)$}-labeling of trees},
journal = tcs, volume = 410, year = 2009, pages = {3702-3710}}

%Hat

@article{HattinghJJP07,
author = {Johannes H. Hattingh and Elizabeth Jonck and Ernst J. Joubert and Andrew R. Plummer},
title = {Total restrained domination in trees},
journal = dm, volume = 307, pages = {1643-1650}, year = 2007}

%He

%He 1987

@article{HeY87,
author = {Xin He and Yaacov Yesha},
title = {Parallel recognition and decomposition of two terminal series
parallel graphs},
journal = ic2, year = 1987, pages = {15-38}, volume = 75 }

%He 1988

@article{HeY88,
author = {Xin He and Yaacov Yesha},
title = {Binary Tree Algebraic Computation and Parallel Algorithms for Simple Graphs},
journal = ja, volume = 9, pages = {92-113}, year = 1988 }

%He 1990

@article{HeY90,
author = {Xin He and Yaacov Yesha},
title = {Efficient Parallel Algorithms for $r$-Dominating Set and $p$-Center Problems on Trees},
journal = alg, volume = 5, year = 1990, pages = {129-145}}

%He 1991

@article{He91a,
author = {Xin He},
title = {An improved algorithm for the planar 3-cut problem},
journal = ja, volume = 12, pages = {23-37}, year = 1991}

@article{He91,
author = {Xin He},
title = {Efficient parallel algorithms for series-parallel graphs},
journal = ja, volume = 12, pages = {409-430}, year = 1991}

%He 1992

@inproceedings{He92,
author = {Xin He},
title = {Parallel Algorithms for Cograph Recognition with Applications},
editor = {O. Nurmi and E. Ukkonen},
booktitle = swat92, publisher = lncs621, year = 1992, pages = {94-105}}

%He 1993

@article{He93,
author = {Xin He},
title = {Parallel algorithms for cograph recognition with applications},
journal = ja, volume = 15, year = 1993, pages = {284-313}}

@article{HeZL05,
author = {P. R. He and W. J. Zhang and Q. Li},
title = {Some further development on the eigensystem approach for graph isomorphism detection},
journal = {Journal of the Franklin Institute}, volume = 342, year = 2005, pages = {657-673}}

%Hea

@article{Heath87,
author = {Lenwood S. Heath},
title = {Embedding outerplanar graphs in small books},
journal = sjadm, volume = 8, year = 1987, pages = {198-218}}

%Hec

@article{HechtU74,
author = {M. S. Hecht and J. D. Ullman},
title = {Characterization of Reducible Flow Graphs},
journal = jacm, volume = 21, year = 1974, pages = {367-375}}

%Hed

@inproceedings{HedetniemiHL85,
author = {S. M. Hedetniemi and S. T. Hedetniemi and R. Laskar},
title = {Domination in trees: models and algorithms},
booktitle = {Graph Theory with Applications to Algorithms and Computer
Science},
publisher = {Wiley},
address = {New York},
year = 1985, pages = {423-442}}

@article{HedetniemiPS85,
author = {S. M. Hedetniemi and A. Proskurowski and M. M. Sys{\l}o},
title = {Interior graphs of maximal outerplanar graphs},
journal = jctb, volume = 38, pages = {156-167}, number = 2, year = 1985}

@article{HedetniemiLP86,
author = {S. T. Hedetniemi and R. Laskar and J. Pfaff},
title = {A linear algorithm for the domination number of a cactus},
journal = dam, volume = 13, year = 1986, pages = {287-292}}

%Heg

%Heggernes 1998

@article{HeggernesT98,
author = {Pinar Heggernes and Jan Arne Telle},
title = {Partitioning Graphs into Generalized Dominating Sets},
journal = nordicjc, volume = 5, year = 1998, pages = {128-142}}

%Heggernes 2001

@inproceedings{HeggernesEKP01,
author = {P. Heggernes and S. Eisenstat and G. Kumfert and A. Pothen},
title = {The computational complexity of the minimum degree algorithm},
booktitle = {Proceedings of the 14th Norwegian Computer Science Conference, NIK 2001},
pages = {98-109}, year = 2001}

%Heggernes 2002

@inproceedings{HeggernesV02,
author = {Pinar Heggernes and Yngve Villanger},
title = {Efficient implementation of a minimal triangulation algorithm},
editor = {Rolf M{\"{o}}hring and Rajeev Raman},
booktitle = esa02, publisher = lncs2461, year = 2002, pages = {550-561}}

%Heggernes 2005

@article{HeggernesTV05,
author = {Pinar Heggernes and Jan Arne Telle and Yngve Villanger},
title = {Computing minimal triangulations in time {${O}(n^\alpha \log n) = o(n^{2.376})$}},
journal = sjdm, volume = 19, year = 2005, pages = {900-913}}

@inproceedings{HeggernesSTV05,
author = {Pinar Heggernes and K. Suchan and I. Todinca and Yngve Villanger},
title = {Minimal interval completions},
booktitle = esa05, year = 2005, publisher = lncs3669, pages = {403-414}}

%Heggernes 2006

@article{Heggernes06,
author = {Pinar Heggernes},
title = {Minimal triangulations of graphs: {A} survey},
journal = dm, volume = 306, pages = {297-317}, year = 2006}

@article{HeggernesL06,
author = {Pinar Heggernes and Daniel Lokshtanov},
title = {Optimal broadcast domination in polynomial time},
journal = dm, volume = 306, pages = {3267-3280}, year = 2006}

@inproceedings{HeggernesV06,
author = {Pinar Heggernes and Yngve Villanger},
title = {Simple and efficient modifications of elimination orderings},
booktitle = {Proceedings of the 7th International Conference on Appied Parallel Computing, PARA 2004}, 
year = 2006, publisher = lncs3732, pages = {788-797}}

%Heggernes 2008

@inproceedings{HeggernesKM08,
author = {Pinar Heggernes and Dieter Kratsch and Daniel Meister},
title = {Bandwidth of bipartite permutation graphs in polynomial time},
editor = {Eduardo Sany Laber and Claudson F. Bornstein and Loana Tito Nogueira and Luerbio Faria},
booktitle = latin08, year = 2008, publisher = lncs4957, pages = {216-227}}

%Heggernes 2009

@article{HeggernesKM09,
author = {Pinar Heggernes and Dieter Kratsch and Daniel Meister},
title = {Bandwidth of bipartite permutation graphs in polynomial time},
journal = jda, volume = 7, year = 2009, pages = {533-544}}

@article{HeggernesM09,
author = {Pinar Heggernes and Federico Mancini},
title = {Dynamically maintaining split graphs},
journal = dam, volume = 157, year = 2009, pages = {2057-2069}}

@article{HeggernesP09,
author = {Pinar Heggernes and Charis Papadopoulos},
title = {Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions},
journal = tcs, volume = 410, year = 2009, pages = {1-15}}

@article{HeggernesP09a,
author = {Pinar Heggernes and Barry W. Peyton},
title = {Fast computation of minimal fill inside a given elimination orering},
journal = sjmaa, volume = 30, year = 2009, pages = {1424-1444}}

%Hei

@inproceedings{HeinzelmanCB00,
author = {W. R. Heinzelman and A. Chandrakasan and H. Balakrishnan},
title = {Energy-Efficient Communication Protocol for Wireless Microsensor Networks},
booktitle = {Proceedings of the 33rd Hawaii International Conference on System Sciences, HICSS-33},
year = 2000}

%Hel

@article{HeldK62,
author = {M. Held and R. Karp},
title = {A dynamic programming approach to sequencing problems},
journal = {Journal of the Society for Industrial and Applied Mathematics}, volume = 10, year = 1962, pages = {196-210}}

@unpublished{HelmbergMPR93,
author = {Christoph Helmberg and Bojan Mohar and Svatopluk Poljak and
Franz Rendl},
title = {A spectral approach to Bandwidth and Separator Problems in Graphs},
note = {Manuscript}, year = 1993}

@article{HellM76,
author = {P. Hell and D. Miller},
title = {Graphs with given achromatic number},
journal = dm, volume = 16, year = 1976, pages = {195-207}}

%Hen

%Henning 2003

@article{Henning03,
author = {M. A. Henning},
title = {Defending the {R}oman Empire from multiple attacks},
journal = dm, volume = 271, year = 2003, pages = {101-115}}

@article{HenningH03,
author = {M. A. Henning and S. T. Hedetniemi},
title = {Defending the {R}oman Empire --- {A} new strategy},
journal = dm, volume = 271, year = 2003, pages = {239-251}}

%Henning 2009

@article{Henning09,
author = {Michael A. Henning},
title = {A survey or selected recent results on total domination in graphs},
journal = dm, volume = 309, year = 2009, pages = {32-63}}

%Henning 2010

@article{HenningK10,
author = {Michael A. Henning and Adel P. Kazemi},
title = {$k$-Tuple total domination in graphs},
journal = dam, volume = 158, year = 2010, pages = {1006-1011}}

@inproceedings{HenzingerK97,
author = {Monika R. Henzinger and Valerie King},
title = {Maintaining minimum spanning trees in dynamic graphs},
editor = {Pierpaolo Degano and Roberto Gorrieri and Alberto Marchetti-Spaccamela},
booktitle = icalp97, publisher = lncs1256, year = 1997, pages = {594-604}}

%Her

@inproceedings{HershbergerRS92,
author = {J. Herschberger and M. Rauch and S. Suri},
title = {Fully Dynamic 2-Connectivity in Planar Graphs},
editor = {O. Nurmi and E. Ukkonen},
booktitle = swat92, publisher = lncs621, year = 1992, pages = {233-244}}

%Heu

@inproceedings{HeunM96,
title={Embedding Graphs with Bounded Treewidth into Optimal Hypercubes},
author={Volker Heun and Ernst W. Mayr},
editor = {Claude Puech and R{\"u}diger Reischuk},
booktitle = stacs96, publisher = lncs1046, pages = {157-168}, year = 1996}

@techreport{HeuvelM99,
author = {Jan van den Heuvel and Sean McGuinness},
title = {Colouring the square of a planar graph},
institution = {Centre for Discrete and Applicable Mathematics, London School
of Economics, London, U.K.},
type = {Report},
number = {LSE-CDAM-99-06},
year = 1999}

%Hi

%Hic

%Hicks 2000

@phdthesis{Hicks00,
author = {Illya V. Hicks},
title = {Branch Decompositions and their Applications},
school = {Rice University},
address = {Houston, Texas},
year = 2000}

%Hicks 2002

@article{Hicks02,
author = {Illya V. Hicks},
title = {Branchwidth heuristics},
journal = cn, volume = 159, year = 2002, pages = {31-50}}

%Hicks 2004

@article{Hicks04,
author = {Illya V. Hicks},
title = {Branch decompositions and minor containment},
journal = networks, volume = 43, year = 2004, pages = {1-9}}

%Hicks 2005

@article{Hicks05a,
author = {Illya V. Hicks},
title = {Planar branch decompositions {I}: {T}he ratcatcher},
journal = informsjc, volume = 17, year = 2005, pages = {402-412}}

@article{Hicks05b,
author = {Illya V. Hicks},
title = {Planar branch decompositions {II}: {T}he cycle method},
journal = informsjc, volume = 17, year = 2005, pages = {413-421}}

@article{Hicks05,
author = {Illya V. Hicks},
title = {Graphs, Branchwidth, and Tangles! {O}h My!},
journal = networks, volume = 45, year = 2005, pages = {55-60}}

@InCollection{HicksKK05,
author = {Hicks, Illya V. and Koster, Arie M. C. A. and Elif Koloto\u{g}lu},
title = {Branch and Tree Decomposition Techniques for Discrete Optimization},
booktitle = {TutORials 2005},
editor = {J. Cole Smith},
publisher = {INFORMS Annual Meeting},
series = {INFORMS Tutorials in Operations Research Series},
chapter = {1}, year = {2005}, pages = {1--29},
}

%Hicks 2007

@article{HicksM07,
author = {Illya V. Hicks and Nolan B. {McMurray Jr.}},
title = {The branchwidth of graphs and their cycle matroids},
journal = jctb, volume = 97, year = 2007, pages = {681-692}}

%Hii

@mastersthesis{Hiim97m,
author = {Bj\orn Hiim},
title = {Implementing and testing of algorithms for tree-like graphs},
school = {University of Bergen},
address = {Bergen, Norway},
year = 1997}

%Hir

@article{HirschbergCS79,
author = {D. S. Hirschberg and A. K. Chandra and D. V. Sarwate},
title = {Computing connected components on parallel computers},
journal = cacm, volume = 22, year = 1979, pages = {461-464}}

%Hl

%Hli

%Hlineny 2002

@article{Hlineny02,
author = {Petr Hlin\v{e}n\'{y}},
title = {On the excluded minors for matroids of branch-width tree},
journal = ejc, volume = 9, number = 1, year = 2002}

%Hlineny 2003

@article{Hlineny03,
author = {Petr Hlin\v{e}n\'{y}},
title = {Crossing-number critical graphs have bounded path-width},
journal = jctb, volume = 88, pages = {347-367}, year = 2002}

@techreport{HlinenyW03,
author = {Petr Hlin\v{e}n{\'y} and G. Whittle},
title = {Matroid Tree-width},
year = 2003,
address = {Ostrava, Czech Republic},
institution = {Technical University Ostrava},
note = {Extended abstract in Eurocomb'03, ITI Series 2003-145, Charles University}}

%Hlineny 2005

@article{Hlineny05,
author = {Petr Hlin\v{e}n\'{y}},
title = {A parameterized algorithm for matroid branch-width},
journal = siamjc, volume = 35, year = 2005, pages = {259-277}}

%Hlineny 2006

@article{Hlineny06,
author = {Petr Hlin\v{e}n\'{y}},
title = {Branch-width, parse trees, and monadic second-order logic for matroids},
journal = jctb, volume = 96, year = 2006, pages = {325-351}}

@article{Hlineny06a,
author = {Petr Hlin\v{e}n\'{y}},
title = {A parameterized algorithm for matroid branchwidth},
journal = siamjc, volume = 35, year = 2006, pages = {259-277}}

@article{Hlineny06b,
author = {Petr Hlin\v{e}n\'{y}},
title = {Crossing number is hard for cubic graphs},
journal = jctb, volume = 96, year = 2006, pages = {455-471}}

@article{Hlineny06c,
author = {Petr Hlin\v{e}n\'{y}},
title = {The {T}utte polynomial for matroids of bounded branch-width},
journal = cpc, volume = 15, year = 2006, pages = {397-409}}

@article{HlinenyS06,
author = {Petr Hlin\v{e}n{\'y} and Detlef Seese},
title = {Trees, grids, and {MSO} decidability: From graphs to matroids},
journal = tcs, volume = 351, pages = {425-436}, year = 2006}

@article{HlinenyW06,
author = {Petr Hlin\v{e}n{\'y} and Geoff Whittle},
title = {Matroid tree-width},
journal = ejcom, volume = 27, year = 2006, pages = {1117-1128}}

%Hlineny08

@article{HlinenyO08,
author = {Petr Hlin\v{e}n{\'y} and {Sang-il} Oum},
title = {Finding branch-decompositions and rank-decompositions},
journal = siamjc, volume = 38, year = 2008, pages = {1012-1032}}

@article{HlinenyOSG08,
author = {Petr Hlin\v{e}n{\'y} and {Sang-il} Oum and Detlef Seese and Georg Gottlob},
title = {Width parameters beyond tree-width and their applications},
journal = tcj,  volume = 51, year = 2008, pages = {326-362}}

%Ho

@article{HoL88,
author = {Chin-Wen Ho and Richard C. T. Lee},
title = {Efficient parallel algorithms for finding maximal cliques,
clique trees, and minimum coloring on chordal graphs},
journal = ipl, volume = 28, year = 1988, pages = {301-309}}

%article{HoL89,
author = {Chin-Wen Ho and Richard C. T. Lee},
title = {Counting clique trees and computing perfect elimination
schemes in parallel},
journal = ipl, volume 31, pages = {61-68}, year = 1989}

%Hoe

@article{HoeselM09,
author = {Hoesel, C. P. M. {v}an and B. Marchal},
title = {Finding good tree decompositions by local search},
journal = endm, volume = 32, year = 2009, pages = {43--50}}

%Hof

@article{HofPW09,
author = {Pim {van 't Hof} and Dani\"{e}l Paulusma and Gerhard J. Woeginger},
title = {Partitioning graphs into connected parts},
journal = tcs, volume = 410, year = 2009, pages = {4834-4843}}

@article{HofP10,
author = {Pim {van 't Hof} and Dani\"{e}l Paulusma},
title = {A new characterization of {$P_6$}-free graphs},
journal = dam, volume = 158, year = 2010, pages = {731-740}}

%Hoh

@unpublished{HohbergR89,
author = {Walter Hohberg and R\"udiger Reischuk},
title = {Decomposition of Graphs --- A Uniform Approach for the Design
of Fast Sequential and Parallel Algorithms on Graphs},
year = 1989, note = {Preprint}}

@mastersthesis{Hohberg89,
author = {Walter Hohberg},
title = {Zerlegung von {G}raphen --- ein allgemeines, sequentielles und
paralleles {L}\"{o}sungsverfahren f\"{u}r Graphprobleme},
school = {TH Darmstadt},
note = {Dissertation},
year = 1989}

@unpublished{HohbergR90,
author = {Walter Hohberg and R\"udiger Reischuk},
title = {A Framework to Design Algorithms for Optimization Problems on Graphs},
note = {Preprint}, year = 1990, month = {April}}

%Hol

@article{Holst02,
author = {Hein {van der Holst}},
title = {On the ''Largeur d'Arborescence''},
journal = jgt, volume = 41, pages = {24-52}, year = 2002}

@article{Holst09,
author = {Hein {van der Holst}},
title = {A polynomial-time algorithm to find a linkless embedding of a graph},
journal = jctb, volume = 99, year = 2009, pages = {512-530}}

@article{Holyer81,
author = {Ian Holyer},
title = {The {NP}-Completeness of Edge-coloring},
journal = siamjc, volume = 10, year = 1981, pages = {718-720}}

%Hon

@article{HongR82,
author = {J. Hong and A. Rosenberg},
title = {Graphs that are almost binary trees},
journal = siamjc, volume = 11, year = 1982, pages = {227-242}}

@article{HongMR83,
author = {J. Hong and K. Mehlhorn and A. Rosenberg},
title = {Cost trade-offs in graph embeddings, with applications},
journal = jacm, volume = 30, year = 1983, pages = {709-728}}

@article{HongP06,
author = {B. Hong and V. K. Prasanna},
title = {Maximum lifetime data sensing and extraction in energy
constrained networked sensor systems},
journal = jpdc, volume = 66, number = 4, year = 2006, pages = {566-577}}

%Hoo

@phdthesis{Hoover90,
author = {Mark Hoover},
title = {Complexity, Structure and Algorithms for Edge-Partition
Problems},
school = {University of New Mexico},
address = {Albuquerque, New Mexico, USA},
year = 1990}

%Hop

@article{HopcroftT73,
author = {J. E. Hopcroft and Robert Endre Tarjan},
title = {Dividing a graph into triconnected components},
journal = siamjc, volume = 2, pages = {135-158}, year = 1973}

@article{HopcroftT74,
author = {J. E. Hopcroft and Robert Endre Tarjan},
title = {Efficient planarity testing},
journal = jacm, volume = 21, pages = {549-568}, year = 1974 }

@article{HopcroftK75,
author = {J. E. Hopcroft and R. M. Karp},
title = {An $n^{5/2}$ Algorithm for Maximum Matching in Bipartite
Graphs},
journal = siamjc, volume = 2, year = 1973, pages = {225-231}}

@article{HopcroftPV77,
author = {J. E. Hopcroft and W. Paul and L. Valiant},
title = {On time versus space},
journal = jacm, volume = 24, year = 1977, pages = {332-337}}

%Hor

@book{HorowitzS78,
author = {Ellis Horowitz and Sartaj Sahni},
title = {Fundamentals of Computer Algorithms},
publisher = {Pitman}, address = {London}, year = 1978}

%Hou

@article{HougardyPS94,
author = {S. Hougardy and H. J. Pr\"{o}mel and A. Steger},
title = {Probabilistically checkable proofs and their consequences for
approximation algorithms},
journal = dm, volume = 136, year = 1994, pages = {175-223}}

%Hs

%Hsi

@article{HsiehHHKC02,
author = {Sun-Yuan Hsieh and Chin-Wen Ho and Tsan-Sheng Hsu and Ming-Tat Ko
and Gen-Huey Chen},
title = {Characterization of efficiently parallel solvable problems on
distance-hereditary graphs},
journal = sjdm, volume = 15, year = 2002, pages = {488-518}}

@article{Hsieh05,
author = {Sun-Yuan Hsieh},
title = {Efficiently parallelizable problems on a class of decomposable
graphs}, 
journal = jcss, volume = 70, year = 2005, pages = {140-156}}

%Hsu

@article{Hsu85,
author = {Wen-Lian Hsu},
title = {Maximum weight clique algorithms for circular-arc graphs and
circle graphs},
journal = siamjc, volume = 14, year = 1985, pages = {224-231}}

@article{Hsu87,
author = {Wen-Lian Hsu},
title = {Decomposition of perfect graphs},
journal = jctb, volume = 43, year = 1987, pages = {70-94}}

@article{Hsu87a,
author = {Wen-Lian Hsu},
title = {Recognizing planar perfect graphs},
journal = jacm, volume = 34, year = 1987, pages = {255-288}}

@article{Hsu88,
author = {Wen-Lian Hsu},
title = {The Coloring and Maximum Independent Set problems on planar
perfect graphs},
journal = jacm, volume = 35, year = 1988, pages = {535-563}}

@inproceedings{Hsu93,
author = {Wen-Lian Hsu},
title = {A simple test for interval graphs},
editor = {Ernst W. Mayr},
booktitle = wg92, year = 1993, publisher = lncs657, pages = {11-16}}

%Hu

%Hua

@article{Huang06,
author = {Jing Huang},
title = {Representation characterizations of chordal bipartite graphs},
journal = jctb, volume = 96, year = 2006, pages = {673-683}}

%Huf

@phdthesis{Huffner08,
author = {Falk H\"{u}ffner},
title = {Algorithms and Experiments for Parameterized Approaches to Hard Graph Problems},
year = {2008},
school = {Friedrich-Schiller University},
address = {Jena, Germany}}

@inproceedings{HuffnerKMN08,
author = {Falk H\"{u}ffner and Christian Komusiewicz and Hannes Moser and Rolf Niedermeier},
title = {Fixed-parameter algorithms for cluster vertex deletion},
editor = {Eduardo Sany Laber and Claudson F. Bornstein and Loana Tito Nogueira and Luerbio Faria},
booktitle = latin08, year = 2008, publisher = lncs4957, pages = {711-722}}

@article{HuffnerKMN09,
author = {Falk H\"{u}ffner and Christian Komusiewicz and Hannes Moser and Rolf Niedermeier},
title = {Isolation concepts for clique enumeration: Comparison and computational experiments},
journal = tcs, volume = 410, year = 2009, pages = {5384-5397}}

%Hun

@book{Hungerford74,
author = {Thomas W. Hungerford},
title = {Algebra},
publisher = {Springer-Verlag, New York},
series = {Graduate Texts in Mathematics 73},
year = 1974 }

%techreport{HuntMRRRS93,
author = {H. B. {Hunt, III} and Madhav V. Marathe and Venkatesh Radhakrishnan and S. S.
Ravi and D. J. Rosenkrantz and Richard E. Stearns},
title = {Every Problem in {MAX SNP} has a Parallel Approximation Algorithm},
number = {TR 93-8},
institution = {Dept. of Computer Science, University at Albany - SUNY},
address = {Albany, NY},
year = 1993}

@article{HunterK08,
author = {Paul Hunter and Stephan Kreutzer},
title = {Digraph measures: {K}elly decompositions, games, and orderings},
journal = tcs, volume = 399, year = 2008, pages = {206-219}}

%Hur

@article{HurinkN08,
author = {Johann L. Hurink and Tim Nieberg},
title = {Approximating minimum independent dominating sets in wireless
networks},
journal = ipl, volume = 109, year = 2008, pages = {155-160}}

%I

%Ib

%Iba

@article{Ibarra09,
author = {Louis Ibarra},
title = {The clique-separator graph for chordal graphs},
journal = dam, volume = 157, year = 2009, pages = {1737-1749}}

@article{Ibarra10,
author = {Oscar H. Ibarra and Igor Potapov and Hsu-Chun Yen},
title = {On decision problems for parameterized machines},
journal = tcs, volume = 411, year = 2010, pages = {1192-1201}}

%Id

%Idu

@article{IduryS93,
author = {R. Idury and A. Schaffer},
title = {Triangulating three-colored graphs in linear time and linear space},
journal = sjdm, volume = 2, pages = {289-293}, year = 1993}

%Ih

@inproceedings{Ihler93,
author = {E. Ihler},
title = {Minimum rectilinear {S}teiner trees for intervals on two parallel lines},
editor = {Ernst W. Mayr},
booktitle = wg92, year = 1993, publisher = lncs657, pages = {123-134}}

%Im

%Imp

@article{ImpagliazzoPZ01,
author = {Russell Impagliazzo and Ramamohan Paturi and Francis Zane},
title = {Which problems have strongly exponential complexity?},
journal = jcss, volume = 63, year = 2001, pages = {512-530}}

%In

%Inm

@manual{Inmos91,
title = {The T9000 Transputer Products Overview Manual},
organization = {Inmos}, year = 1991}

%Ir

%Irv

@article{Irving85,
author = {Robert W. Irving},
title = {An efficient algorithm for the stable roommates problem},
journal = ja, volume = 6, year = 1985, pages = {577-595}}

@article{IrvingL86,
author = {Robert W. Irving and P. Leather},
title = {The complexity of counting stable marriages},
journal = siamjc, volume = 15, year = 1986, pages = {655-667}}

@article{IrvingLG87,
author = {Robert W. Irving and P. Leather and D. Gusfield},
title = {An efficient algorithm for the ``optimal'' stable marriage},
journal = jacm, volume = 34, year = 1987, pages = {532-543}}

@article{Irving91,
author = {Robert W. Irving},
title = {On approximating the minimum independent dominating set},
journal = ipl, volume = 37, year = 1991, pages = {197-200}}

%Is

%Isl

@article{IslerK08,
author = {Volkan Isler and Nikhil Karnad},
title = {The role of information in the cop-robber game},
journal = tcs, volume = 399, year = 2008, pages = {169-178}}

%Iso

@article{IsobeZN99,
author = {Shuji Isobe and Xiao Zhou and Takao Nishizeki},
title = {A polynomial-time algorithm for finding total colorings of partial
$k$-trees},
journal = ijfcs, volume = 10, pages = {171-194}, year = 1999}

%It

%Ita

@article{ItaiR78,
author = {A. Itai and M. Rodeh},
title = {Finding a Minimum Circuit in a Graph},
journal = siamjc, volume = 7, year = 1978, pages = {413-423}}

@article{ItaiPS94,
author = {A. Itai abd C. H. Papadimitriou and J. L. Szwartzfiter},
title = {Hamiltonian paths in grid graphs},
journal = siamjc, volume = 11, year = 1984, pages = {676-684}}

@inproceedings{ItalianoMN89,
author = {G. F. Italiano and A. {Marchetti Spaccamela} and U. Nanni},
title = {Dynamic data structures for series parallel digraphs},
editor = {Frank K. H. A. Dehne and J\"{o}rg-R\"{u}diger Sach and Nicola Santoro},
booktitle = wads89, pages = {352-372}, year = 1989, publisher = lncs382}

%Ito

@article{ItoNZ03,
author = {T. Ito and T. Nishizeki and X. Zhou},
title = {Algorithms for multicolorings of partial $k$-trees},
journal = {IEICE Transactions on Information and Systems}, volume = {E86-D}, year = 2003, pages = {191-200}}

@article{ItoZN06,
author = {Takehiro Ito and Xiao Zhou and Takao Nishizeki},
title = {Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size},
journal = jda, volume = 4, year = 2006, pages = {142-154}}

%Iy

@article{IyerRV88,
author = {A. V. Iyer and H. D. Ratliff and G. Vijayan},
title = {Optimal node ranking of trees},
journal = ipl, volume = 28, year = 1988, pages = {225-229}}

@article{IyerRV91,
author = {A. V. Iyer and H. D. Ratliff and G. Vijayan},
title = {On an edge-ranking problem of trees and graphs},
journal = dam, volume = 30, year = 1991, pages = {43-52}}

%J

%Ja

%Jai

@unpublished{JainC??,
author = {Amit Jain and N. Chandrasekharan},
title = {An efficient parallel algorithm for min-cost flow on directed
series-parallel networks},
note = {Manuscript}}

%Jaj

@book{Jaja92,
author = {Joseph J{\'{a}}J{\'{a}}},
title = {An Introduction to Parallel Algorithms},
year = 1992, publisher = {Addison-Wesley}}

%Jak

@article{JakobyLR06,
author = {Andreas Jakoby and Maciej Li\'{s}kiewicz and R\"{u}diger Reischuk},
title = {Space efficient algorithms for directed series-parallel graphs},
journal = ja, volume = 60, year = 2006, pages = {85-114}}

%Jam

@article{JamisonO89,
author = {B. Jamison and S. Olariu},
title = {$P_4$-reducible graphs, a class of uniquely tree representable graphs},
journal = sam, volume = 81, year = 1989, pages = {79-87}}

@article{JamisonO89b,
author = {B. Jamison and S. Olariu},
title = {On a Class of {$P_5$}-Free Graphs},
journal = sam, volume = 81, year = 1989, pages = {33-39}}

@article{JamisonO91,
author = {B. Jamison and S. Olariu},
title = {On a unique tree representation for {$P_4$}-extendible graphs},
journal = dam, volume = 34, year = 1991, pages = {151-164}}

@article{JamisonO92,
author = {B. Jamison and S. Olariu},
title = {A tree representation for {$P_4$}-sparse graphs},
journal = dam, volume = 35, year = 1992, pages = {115-129}}

@unpublished{JamisonO92a,
author = {B. Jamison and S. Olariu},
title = {P-components and the Homogeneous Decomposition of Graphs},
note = {Manuscript},
year = {1992}}

@article{JamisonO92b,
author = {B. Jamison and S. Olariu},
title = {Recognizing $P_4$-sparse graphs in linear time},
journal = siamjc, volume = 21, number = 2, year = 1992, pages = {381-406}}

@inproceedings{JamisonO93,
author = {B. Jamison and S. Olariu},
title = {On the homogeneous decomposition of graphs},
editor = {Ernst W. Mayr},
booktitle = wg92, year = 1993, publisher = lncs657, pages = {170-183}}

%Jan

%Jansen 1990

@techreport{Jansen90,
author = {Klaus Jansen},
title = {An Assignment Problem for Hardware Design},
type = {Arbeitsberichte},
number = 27, year = 1990,
institution = {Universit\"{a}t Trier, Mathematik}}

@techreport{Jansen90a,
author = {Klaus Jansen},
title = {Interval Union of Graphs},
type = {Arbeitsberichte},
number = 27, year = 1990,
institution = {Universit\"{a}t Trier, Mathematik}}

%Jansen 1993

@inproceedings{Jansen93,
author = {Klaus Jansen},
title = {On scheduling problems restricted to interval orders},
editor = {Ernst W. Mayr},
booktitle = wg92, year = 1993, publisher = lncs657, pages = {27-36}}

@inproceedings{JansenS93,
author = {Klaus Jansen and Petra Scheffler},
title = {Generalized Coloring for Tree-like Graphs},
editor = {Ernst W. Mayr},
booktitle = wg92, year = 1993, publisher = lncs657, pages = {50-59}}

%Jansen 1997

@article{JansenS97,
author = {Klaus Jansen and Petra Scheffler and Gerhard Woeginger},
title = {The disjoint cliques problem},
journal = {RAIRA Recherhe Operationelle}, volume = 31, year = 1997, pages = {45-66}}

%Jansen 2006

@article{JansenKLS06,
author = {K. Jansen and M. Karpinski and A. Lingas and E. Seidel},
title = {Polynomial time approximation schemes for max-bisection on planar and
geometric graphs},
journal = siamjc, volume = 35, year = 2006, pages = {110-119}}

%Jansen 2009

@mastersthesis{Jansen09,
author = {Bart Jansen},
title = {Fixed parameter complexity of the weighted max leaf problem},
year = 2009,
school = {Department of Computer Science, Utrecht University}}

%Je

%Jeg

@article{JegouT03,
author = {Philippe J\'{e}gou and Cyril Terrioux},
title = {Hybrid backtracking bounded by tree-decomposition of constraint networks},
journal = ai, volume = 146, year = 2003, pages = {43-75}}

@inproceedings{JegouNT05,
author = {Philippe J\'{e}gou and Samba Ndiaye and Cyril Terrioux},
title = {Computing and Exploiting Tree-Decompositions for Solving Constraint Networks},
booktitle = {Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming, CP 2005},
publisher = lncs3709, year = 2005, pages = {777-781}}

%Jel

@article{Jelinek10,
author = {V\'{\i}t Jel\'{\i}nek},
title = {The rank-width of the square grid},
journal = dam, volume = 158, year = 2010, pages = {841-850}}

%Jen

@book{Jensen01,
author = {F. V. Jensen},
title = {Bayesian Networks and Decision Graphs},
publisher = {Statistics for Engineering and Information Science,
Springer-Verlag},
address = {New York},
year = 2001}

%Ji

%Jin

@article{JinL06,
author = {Zemin Jin and Xueliang Li},
title= {On the $k$-path cover problem for cacti},
journal = tcs, pages = {354-363}, year = 2006, volume = 355}

%Jo

%Joh

@article{Johansson98,
author = {{\"{O}}jvind Johansson},
title = {Clique-decomposition, {NLC}-decomposition, and modular 
decomposition-relationships and results for random graphs},
journal = cn, volume = 132, pages = {39-60}, year = 1998}

@article{Johansson00,
author = {{\"{O}}jvind Johansson},
title = {NLC$_2$-decomposition in polynomial time},
journal = ijfcs, volume = 11, year = 2000, pages = {373-395}}

%Johnson 1983

@article{Johnson83,
author = {D. S. Johnson},
title = {The {NP}-completeness column: {An} ongoing guide},
journal = ja, volume = 4, year = 1983, pages = {397-411}}

%Johnson 1985

@article{Johnson85,
author = {David S. Johnson},
title = {The {NP}-completeness Column: An Ongoing Guide},
journal = ja, year = 1985, volume = 6, pages = {434-451}}

%Johnson 1987

@article{Johnson87,
author = {David S. Johnson},
title = {The {NP}-completeness Column: An Ongoing Guide},
journal = ja, year = 1987, volume = 8, pages = {285-303}}

@article{JohnsonP87,
author = {David S. Johnson and H. O. Pollak},
title = {Hypergraph planarity and the complexity of drawing Venn diagrams},
journal = jgt, volume = 11, year = 1987, pages = {309-326}}

%Johnson 1988

@article{JohnsonYP88,
author = {David S. Johnson and Mihalis Yannakakis and
Christos H. Papadimitriou},
title = {On generating all maximal independent sets},
journal = ipl, year = 1988, volume = 27, pages = {119-123}}

%Johnson 2001

@article{JohnsonRST01,
author = {T. Johnson and N. Robertson and P. D. Seymour and R. Thomas},
title = {Directed tree-width},
journal = jctb, volume = 82, year = 2001, pages = {138-154}}

%Ju

@article{JungckDD82,
author = {John R. Jungck and Gregg Dick and Amy Gleason Dick},
title = {Computer-assisted sequencing, interval graphs, and molecular evolution}, 
journal = {BioSystems}, volume = 15, year = 1982, pages = {259-273}}

%K

%Ka

%Kab

@inproceedings{Kabanets97,
author = {Valentine Kabanets},
title = {Recognizability Equals Definability for Partial $k$-Paths},
editor = {Pierpaolo Degano and Roberto Gorrieri and Alberto Marchetti-Spaccamela},
booktitle = icalp97, year = 1997, publisher = lncs1256, pages = {805-815}}

%Kai

@article{Kaiser09,
author = {T. Kaiser},
title = {Minors of simplicial complexes},
journal = dam, volume = 157, year = 2009, pages = {2597-2602}}

%Kaj

@article{KajitaniIU86,
author = {Y. Kajitani and A. Ishizuka and S. Ueno},
title = {Characterization of partial 3-trees in terms of three structures},
journal = gc, volume = 2, year = 1986, pages = {233-246}}

%Kal

%Kall

@inproceedings{Kaller95,
author = {Damon Kaller},
title = {Definability equals recognizability of partial 3-trees},
editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti-Spaccamela},
booktitle = wg96, pages = {239-253}, year = 1997, publisher = lncs1197}

@inproceedings{KallerGS95,
author = {Damon Kaller and A. Gupta and T. Shermer},
title = {Regular-factors in the complement of partial $k$-trees},
editor = {Selim G. Akl and Frank K. H. A. Dehne and J\"{o}rg-R\"{u}diger Sack and Nicola Santoro},
booktitle = wads95, publisher = lncs955, pages = {403-414}, year = 1995}

@inproceedings{KallerGS95a,
author = {Damon Kaller and A. Gupta and T. Shermer},
title = {The $\chi_t$-coloring problem},
editor = {Ernst W. Mayr and Claude Puech},
booktitle = stacs95, publisher = lncs900, pages = {409-420}, year = 1995}

@article{Kaller00,
author = {Damon Kaller},
title = {Definability equals recognizability of partial 3-trees and
$k$-connected partial $k$-trees},
journal = alg, volume = 27, year = 2000, pages = {348-381}}

%Kalp

@article{KalpakisDN03,
author = {K. Kalpakis and K. Dasgupta and P. Namjoshi},
title = {Efficient algorithms for maximum lifetime data gathering
and aggregation in wireless sensor networks},
journal = cnet, volume = 42, number = 6, year = 2003, pages = {697-716}}

%Kam

@article{MainskiLM09,
author = {Marcin Kami\'{n}ski and Vadim V. Lozin and Martin Milani\v{c}},
title = {Recent developments on graphs of bounded clique-width},
journal = dam, volume = 157, year = 2009, pages = {2747-2761}}

@inproceedings{KammerT08,
author = {Frank Kammer and Torsten Tholey},
title = {The complexity of minimum convex coloring},
editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga},
booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {16-27}}

%Kan

@article{KanevskyR91,
author = {A. Kanevsky and V. Ramachandran},
title = {Improved algorithms for graph four-connectivity},
journal = jcss, volume = 42, year = 1991, pages = {288-306}}

@inproceedings{KanjPS04,
author = {Iyad A. Kanj and Michael J. Pelsmajer and Marcus Schaefer},
title = {Parameterized algorithms for feedback vertex set},
editor = {R. G. Downey and M. R. Fellows},
booktitle = iwpec04, year = 2004, publisher = lncs3162, pages = {235-248}}

@article{KannanW92,
author = {Sampath Kannan and Tandy Warnow},
title = {Triangulating 3-colored graphs},
journal = sjdm, volume = 5, year = 1992, pages = {249-258}}

@article{KannanW94,
author = {Sampath Kannan and Tandy Warnow},
title = {Inferring Evolutionary History from {DNA} sequences},
journal = siamjc, volume = 23, year = 1994, pages = {713-737}}

@article{KannanW97,
author = {Sampath Kannan and Tandy Warnow},
title = {A fast algorithm for the computation and enumeration of perfect phylogenies},
journal = siamjc, volume = 26, year = 1997, pages = {1749-1763}}

@techreport{Kant91,
author = {Goos Kant},
title = {Linear Planar Augmentation Algorithms for Outerplanar
Graphs},
type = {Technical Report},
number = {RUU-CS-91-47},
institution = {Utrecht University},
year = 1991}

@inproceedings{Kant93,
author = {Goos Kant},
title = {Hexagonal grid drawings},
editor = {Ernst W. Mayr},
booktitle = wg92, year = 1993, publisher = lncs657, pages = {263-276}}

@phdthesis{Kant93a,
author = {Goos Kant},
title = {Algorithms for Drawing Planar Graphs},
school = {Utrecht University}, year = 1993}

@article{Kant96,
author = {Goos Kant},
title = {Augmenting Outerplanar Graphs},
journal = ja, volume = 21, pages = {1-25}, year = 1996}

@article{KantB97,
author = {Goos Kant and Hans L. Bodlaender},
title = {Triangulating Planar Graphs While Minimizing the Maximum
Degree},
journal = ic2, volume = 135, pages = {1-14}, year = 1997}


%Kap

%Kaplan 1994

@inproceedings{KaplanST94,
author = {Haim Kaplan and Ron Shamir and Robert Endre Tarjan},
title = {Tractability of parameterized completion problems on
chordal and interval graphs: Minimum Fill-in and Physical Mapping},
booktitle = focs94, pages = {780-791}, year = 1994}

%Kaplan 1996

@article{KaplanS96,
author = {Haim Kaplan and Ron Shamir},
title = {Pathwidth, Bandwidth and Completion Problems to Proper Interval
Graphs with Small Cliques},
journal = siamjc, volume = 25, pages = {540-561}, year = 1996}

%Kaplan 1999

@article{KaplanST99,
author = {Haim Kaplan and Ron Shamir and Robert Endre Tarjan},
title = {Tractability of parameterized completion problems on chordal,
strongly chordal, and proper interval graphs},
journal = siamjc, volume = 28, year = 1999, pages = {1906-1922}}

%Kaplan 2009

@inproceedings{KaplanN09,
author = {Haim Kaplan and Yahav Nussbaum},
title = {Maximum flow in directed planar graphs with vertex capacities},
editor = {Amos Fiat and Peter Sanders},
booktitle = esa09, publisher = lncs5757, year = 2009,
pages = {397-407}}

%Kar

@inproceedings{Karp72,
author = {Richard M. Karp},
title = {Reducibility among combinatorial problems},
booktitle = {Complexity of Computer Computations},
publisher = {Plenum Press}, year = 1972,
editor = {R. E. Miller and J. W. Thatcher},
pages = {85 - 104}}

@article{Karp75,
author = {Richard M. Karp},
title = {On the complexity of combinatorial problems},
journal = networks, year = 1975, volume = 5, pages = {45-68}}

@article{KarpUW86,
author = {R. M. Karp and E. Upfal and A. Wigderson},
title = {Constructing a maximum matching is in random {NC}},
journal = comb, volume = 6, year = 1986, pages = {35-48}}

@inproceedings{Karp93,
author = {Richard M. Karp},
title = {Mapping the Genome: Some Combinatorial Problems Arising in
Molecular Biology},
year = 1993,
booktitle = stoc93, pages = {278-285}, publisher = {ACM Press},
address = {New York}
}

@techreport{KarpinskiWZ97,
author = {Marek Karpinski and J\"{u}rgen Wirtgen and Alex Zelikovsky},
title = {An approximation algorithm for the bandwidth problem on dense graphs},
number = {TR97-017},
type = {Electronic Colloquium on Computational Complexity Report},
year = 1997}

@article{Karonski82,
author = {M. Karonski},
title = {On the number of $k$-trees in a random graph},
journal = pms, volume = 2, year = 1982, pages = {197-205},
something = {Fasc. 2}}

%Kas

@article{KashemZN00,
author = {Md. Abul Kashem and Xiao Zhou and Takao Nishizeki},
title = {Algorithms for generalized vertex-rankings of partial $k$-trees},
journal = tcs, volume = 240, year = 2000, pages = {407-427}}

@inproceedings{KashiwabaraF79,
author = {T. Kashiwabara and T. Fujisawa},
title = {An {NP}-complete problem on interval graphs},
booktitle = {Proc. IEEE Symp. on Circuits and Systems},
year = 1979, pages = {82-83}}

%Kav

@techreport{KavvadiasPSZ94,
author = {D. Kavvadias and G. Pantziou and P. Spirakis and C. Zaroliagis},
title = {Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel
Solution of Shortest Paths and Other Problems},
number = {MPI-I-94-131},
year = 1994,
institution = {Max-Planck-Institut f\"{u}r Informatik},
address = {Saarbr\"{u}cken, Germany}}

%Kaw

@inproceedings{KawarabayashiM08,
author = {Ken-ichi Kawarabayashi and Bojan Mohar},
title = {Graph and map isomorphism and all polyhedral embeddings in linear time},
booktitle = stoc08, year = 2008, pages = {471-480}}

@article{KawarabayashiT09,
author = {Ken-ichi Kawarabayashi and Carsten Thomassen},
title = {Decomposing a planar graph into an independent set and a forest},
journal = jctb, volume = 99, year = 2009, pages = {674-684}}

%Kay

@article{Kaye00,
author = {Richard Kaye},
title = {Minesweeper is {NP}-complete},
journal = {The Mathematical Intelligencer}, volume = 22, year = 2000, pages = {9-15}}

%Ke

@article{KeijsperPS06,
author = {J. C. M. Keijsper and R. A. Pendavingh and L. Stougie},
title = {A linear programming formulation of {M}ader's edge-disjoint paths problem},
journal = jctb, volume = 96, pages = {159-163}, year = 2006}

@article{Keil85,
author = {J. Mark Keil},
title = {Finding {H}amiltonian Circuits in Interval Graphs},
journal = ipl, year = 1985, volume = 20, pages = {201-206}
}

@article{Keil86,
author = {J. Mark Keil},
title = {Total domination in interval graphs},
journal = ipl, year = 1986, volume = 22, pages = {171-174}}

%Kh

@article{Khuller90,
author = {Samir Khuller},
title = {Extending planar graph algorithms to {$K_{3,3}$}-free
graphs},
journal = ic2, volume = 84, year = 1990 , pages = {13-25}}

@article{Khuller90a,
author = {Samir Khuller},
title = {Coloring algorithms for {$K_5$}-minor free graphs},
journal = ipl, volume = 34, year = 1990, pages = {203-208}}

@article{KhullerS91,
author = {Samir Khuller and Baruch Schieber},
title = {Efficient parallel algorithms for testing $k$-connectivity
and finding disjoint $s$-$t$ paths in graphs},
journal = siamjc, volume = 20, year = 1991, pages = {353-375}}

%Ki

%Kie

@article{KiersteadT94,
author = {H. A. Kierstead and W. T. Trotter},
title = {Planar graph coloring with an uncooperative partner},
year=1994,
journal = jgt, volume = 18, number = 6, pages = {569-584}}

@article{Kierstead00,
author = {H. A. Kierstead}, 
title = {A simple competitive graph coloring algorithm},
journal = jctb, volume = 78, pages = {57-68}, year = 2000}

@article{KiersteadT01,
author = {H. A. Kierstead and W. T. Trotter},
title = {Competive colorings of oriented graphs},
journal = ejc, volume = 8, number = 2, year = 2001, pages={R12}}

%Kik

@article{KikunoYK83,
author = {T. Kikuno and N. Yoshida and Y. Kakuda},
title = {A Linear Algorithm for the Domination Number of a Series-Parallel
Graph},
journal = dam, volume = 5, year = 1983, pages = {299-311}}

%Kim

@article{Kim90,
author = {S. K. Kim},
title = {A parallel algorithm for finding a maximum clique in a set of
circular arcs of a circle},
journal = ipl, volume = 34, year = 1990, pages = {235-242}}

@article{Kim90a,
author = {H. Kim},
title = {Finding a maximum independent set  in a permutation graph},
journal = ipl, volume = 36, year = 1990, pages = {19-24}}

%Kin

@article{KindervaterLS89,
author = {Gerard A. P. Kindervater and Jan Karel Lenstra and David B.
Schmoys},
title = {The parallel complexity of {TSP} heuristics},
journal = ja, volume = 10, year = 1989, pages = {249-270}}

%Kinnersley 1989

@phdthesis{Kinnersley89,
author = {Nancy G. Kinnersley},
title = {Obstruction Set Isolation for Layout Permutation Problems},
school = {Washington State University},
year = 1989, month = {May}, pages = {i-x,1-217}}

%Kinnersley 1992

@article{Kinnersley92,
author = {Nancy G. Kinnersley},
title = {The vertex separation number of a graph equals its path width},
journal = ipl, volume = 42, pages = {345-350}, year = 1992}

%Kinnersley 1994

@techreport{Kinnersley94,
author = {Nancy G. Kinnersley},
title = {Construction obstruction set isolation for min cut linear
arrangement},
type = {Technical Report},
number = {94-1},
institution = {Department of Computer Science, University of Kansas},
address = {Lawrence, Kansas, USA},
year = 1994}

@article{KinnersleyK94,
author = {Nancy G. Kinnersley and William M. Kinnersley},
title = {Tree automata for cutwidth recognition},
journal = cn, volume = 104, year = 1994, pages = {129-142}}

@article{KinnersleyK94a,
author = {Nancy G. Kinnersley and William M. Kinnersley},
title = {An efficient polynomial-time algorithm for three-track gate matrix layout},
journal = tcj, volume = 37, year = 1994, pages = {449- 462}}

@article{KinnersleyL94,
author = {Nancy G. Kinnersley and Michael A. Langston},
title = {Obstruction Set Isolation for the Gate Matrix Layout Problem},
journal = dam, volume = 54, year = 1994, pages = {169-213}}

%Kir

@article{Kirchhoff1847,
author = {G. Kirchhoff},
title = {\"{U}ber die {A}ufl\"{o}sung der {G}leichugen, auf welche man bei der
{U}ntersuchung der Linearen {V}erteilung Galvanischer {S}tr\"{o}me gef\"{u}hrt wird}, 
journal = {Ann. Phys. Chem.}, volume = 71, year = 1847, pages = {497-508}}

@article{KirousisP85,
author = {Lefteris M. Kirousis and Christos H. Papadimitriou},
title = {Interval graphs and searching},
journal = dm, volume = 55, year = 1985, pages = {181-184}}

@article{KirousisP86,
author = {Lefteris M. Kirousis and Christos H. Papadimitriou},
title = {Searching and pebbling},
journal = tcs, volume = 47, year = 1986, pages = {205-218}}

@unpublished{KirousisT94,
author = {Lefteris M. Kirousis and Dimitrios M. Thilikos},
title = {The linkage of a graph},
note = {Manuscript},
year = 1994}

%Kj

@techreport{Kjaerulff90,
author = {U. Kj{\ae}rulff},
title = {Triangulation of Graphs --- Algorithms Giving Small Total State Space},
type = {Research Report}, number = {R-90-09}, 
institution = {Dept. of Mathematics and Computer Science, Aalborg University},
year = 1990}

@article{Kjaerulff92,
author = {U. Kj{\ae}rulff},
title = {Optimal decomposition of probabilistic networks by simulated annealing},
journal = {Statistics and Computing}, volume = 2, year = 1992, pages = {2-17}}

%Kl

%Kla

@article{KlaweCP82,
author = {M. M. Klawe and Derek G. Corneil and Andrzej Proskurowski},
title = {Isomorphism testing in hookup classes},
journal = sjadm, volume = 3, pages = {260-274}, year = 1982 }

%Kle

@inproceedings{Klein88,
author = {Philip N. Klein},
title = {Efficient parallel algorithms for chordal graphs},
booktitle = focs88, pages = {150-161}, year = 1988 }

@article{KleinS90,
author = {Philip Klein and Clifford Stein},
title = {A parallel algorithm for eliminating cycles in undirected
graphs},
journal = ipl, volume = 34, year = 1990, pages = {307-312}}

@inproceedings{KleinARR90,
author = {Philip Klein and Ajit Agrawal and R. Ravi and Satish Rao},
title = {Approximation through multicommodity flow},
booktitle = focs90, year = 1990, pages = {726-737}}

@inproceedings{Kleinberg00,
author = {Jon Kleinberg},
title = {The small-world phenomenon: An algorithmic perspective},
booktitle = stoc00,
pages = {163-170}, year = 2000}

@book{KleinbergT05,
author = {Jon Kleinberg and \'{E}va Tardos},
title = {Algorithm Design},
publisher = {Addison-Wesley},
address = {Boston},
year = 2005}

@article{KleitmanV90,
author = {Daniel J. Kleitman and Rakesh V. Vohra},
title = {Computing the bandwidth of interval graphs},
journal = sjdm, volume = 3, year = 1990, pages = {373-375}}

%Klo

%Kloks 1992

@inproceedings{KloksB92,
author = {Ton Kloks and Hans Bodlaender},
title = {Approximating Treewidth and Pathwidth of Some Classes of Perfect Graphs},
editor = {Toshihide Ibaraki and Yasuyoshi Inagaki and Kazuo Iwama and Takao Nishizeki and Masafumi Yamashita},
booktitle = isaac92, year = 1992, publisher = lncs650, pages = {116-125}}

%Kloks 1993

@phdthesis{Kloks93',
author = {Ton Kloks},
title = {Treewidth},
school = {Utrecht University, Utrecht, The Netherlands},
year = 1993}

@book{Kloks93,
author = {Ton Kloks},
title = {Treewidth. Computations and Approximations},
publisher = {Springer-Verlag},
address = {Berlin},
series = {Lecture Notes in Computer Science, Vol. 842},
year = 1994}

@techreport{KloksKS93,
author = {Ton Kloks and Dieter Kratsch and J. Spinrad},
title = {Treewidth and pathwidth of cocomparability graphs of bounded
dimension},
type = {Computing Science Notes}, number = {93-46},
institution = {Eindhoven University of Technology}, year = 1993}

%Kloks 1994

@article{Kloks94,
author = {Ton Kloks},
title = {{$K_{1,3}$}-free and {$W_4$}-free graphs},
journal = ipl, volume = 60, year = 1996, pages = {221-223}}

@techreport{KloksK94,
author = {Ton Kloks and Dieter Kratsch},
title = {Computing a perfect edge without vertex elimination ordering of a
chordal bipartite graph},
type = {Computing Science Notes}, number = {94-41},
institution = {Eindhoven University of Technology}, year = 1994}

@techreport{KloksKM94,
author = {Ton Kloks and Dieter Kratsch and Haiko M\"{u}ller},
title = {Dominoes},
type = {Computing Science Notes}, number = {94-12},
institution = {Eindhoven University of Technology}, year = 1994}

%Kloks 1995

@article{KloksK95,
author = {Ton Kloks and Dieter Kratsch},
title = {Treewidth of chordal bipartite graphs},
journal = ja, volume = 19, pages = {266-281}, year = 1995}

%Kloks 1996

@article{Kloks96,
author = {Ton Kloks},
title = {Treewidth of circle graphs},
journal = ijfcs, volume = 7, year = 1996, pages = {111-120}}

@misc{Kloks,
author = {Ton Kloks},
note = {Personal communication}}

@article{Kloks96a,
author = {Ton Kloks},
title = {{$K_{1,3}$}-free and {$W_4$}-free graphs},
journal = ipl, volume = 60, year = 1996, pages = {221-223}}

@techreport{KloksKM96,
author = {Ton Kloks and Dieter Kratsch and Haiko M\"{u}ller},
title = {Asteroidal sets in graphs},
type = {Memorandum}, number = {1347},
institution = {Dep. Appl. Math, University of Twente},
address = {Enschede, The Netherlands},
year = 1996}

%Kloks 1997

@article{KloksKS97,
author = {Ton Kloks and Dieter Kratsch and Jeremy Spinrad},
title = {On treewidth and minimum fill-in of asteroidal triple-free graphs},
journal = tcs, volume = 175, pages = {309-335}, year = 1997}

@inproceedings{KloksKM97,
author = {Ton Kloks and Dieter Kratsch and Haiko M\"{u}ller},
title = {Asteroidal sets in graphs},
editor = {Rolf H. M\"{o}hring},
booktitle = wg97, publisher = lncs1335, year = 1997, pages = {229-241}}

%Kloks 1998

@article{KloksK98,
author = {T. Kloks and D. Kratsch},
title = {Listing all minimal separators of a graph},
journal = siamjc, volume = 27, number = 3, pages = {605-613},year = 1998}

@article{KloksKW98,
author = {Ton Kloks and Dieter Kratsch and C. K. Wong},
title = {Minimum fill-in of circle and circular-arc graphs},
journal = ja, volume = 28, pages ={272-289}, year = 1998}

@article{KloksMW98,
author = {Ton Kloks and Haiko M{\"u}ller and C. K. Wong},
title = {Vertex ranking of asteroid triple-free graphs},
journal = ipl, volume = 68, year = 1998, pages = {201-206}}

%Kloks 1999

@article{KloksKM99,
author = {Ton Kloks and Dieter Kratsch and Haiko M\"{u}ller},
title = {Approximating the Bandwidth for Asteroidal Triple-free Graphs},
journal = ja, volume = 32, pages = {41-57}, year = 1999}

%Kloks 2001

@article{KloksKM01,
author = {Ton Kloks and Dieter Kratsch and Haiko M\"{u}ller},
title = {On the structure of graphs with bounded asteroidal number},
journal = {Graphs. Combin.}, year = 2001, volume = 17, pages = {295-306}}

@article{KloksT01,
author = {Ton Kloks and Richard B. Tan},
title = {Bandwidth and topological bandwidth of graphs with few $P_4$'s},
journal = dam, volume = 115, year = 2001, pages = {117-133}}

@misc{KloksLL01,
author = {Ton Kloks and C. M. Lee and Jim Liu},
title = {Feedback vertex sets and disjoint cycles in planar (di)graphs},
note = {Optimization Online}, year = 2001}

%Kloks 2002

@inproceedings{KloksLL02,
author = {Ton Kloks and C. M. Lee and Jim Liu},
title = {New algorithms for $k$-face cover, $k$-feedback vertex set, and $k$-disjoint cycles on plane and planar graphs},
editor = {Lud\u{e}k Ku\u{c}era},
booktitle = wg02, publisher = lncs2573, year = 2002, pages = {282-295}}

%Kloks 2004

@article{KloksKM05,
author = {Ton Kloks and Jan Kratochv{\'{\i}}l and Haiko M\"{u}ller},
title = {Computing the branchwidth of interval graphs},
journal = dam, volume = 145, pages = {266-275}, year = 2005}

%Kloks 2006

@article{KloksKLL06,
author = {Ton Kloks and Dieter Kratsch and Chuan-Min Lee and Jiping Liu},
title = {Improved bottleneck domination algorithms},
journal = dam, volume = 154, pages = {1578-1592}, year = 2006}

%Kn

%Kna

@inproceedings{KnauerS06,
author = {Christiaan Knauer and Andreas Spillner},
title = {A fixed-parameter algorithm for the minimum weight triangulation problem based on small graph separators},
editor = {Fedor V. Fomin},
booktitle = wg06, year = 2006, pages = {1-14}, publisher = lncs4271}

%Kne



@inproceedings{KneisMRR05,
author = {Joachim Kneis and Daniel M\"{o}lle and Stefan Richter and Peter Rossmanith},
title = {On the parameterized complexity of exact satisfiability problems},
editor = {Joanna Jedrzejowicz and Andrzej Szepietowski},
booktitle = mfcs05, publisher = lncs3618, year = 2005, pages = {568-579}}

@article{KneisMRR06,
author = {Joachim Kneis and Daniel M\"{o}lle and Stefan Richter and Peter Rossmanith},
title = {Parameterized power domination complexity},
journal = ipl, volume = 98, year = 2006, pages = {145-149}}

inproceedings{KneisMRR06a,
author = {Joachim Kneis and Daniel M{\"o}lle and Stefan Richter and Peter Rossmanith},
title  = {Divide-and-Color},
editor = {Fedor V. Fomin},
booktitle = wg06, publisher = lncs4271, year = 2006, pages = {58-67}}

@inproceedings{KneisLR08,
author = {Joachim Kneis and Alexander Langer and Peter Rossmanith},
title = {A new algorithm for finding trees with many leaves},
editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga},
booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {270-281}}

@inproceedings{KneisLR09,
author = {Joachim Kneis and Alexander Langer and Peter Rossmanith},
title = {A fine-grained analysis of a simple independent set algorithm},
publisher = {LIPIcs, volume 4},
booktitle = fsttcs09, year = 2009, pages = {287-298}}

%Ko

%Kob

@article{Kobayashi09,
author = {Yusuke Kobayashi},
title = {Induced disjoint paths problem in a planar graph},
journal = dam, volume = 157, year = 2009, pages = {3231-3238}}

@article{KoblerR03,
author = {Daniel Kobler and Udi Rotics},
title = {Edge dominating set and colorings on graphs with fixed clique-width},
journal = dam, volume = 126, pages = {197-221}, year = 2003}

%Koe

@book{Koenig36,
author = {D. K{\"{o}}nig},
title = {Theorie der endlichen und unendlichen {G}raphen},
year = 1936, publisher = {Akademische Verlagsgesellschaft},
address = {Leipzig}}

%Koh

@article{KohlSTV05,
author = {A. Kohl and J. Schreyer and Z. Tuza and M. Voigt},
title = {List versions of {$L(d,s)$}-labelings},
journal = tcs, volume = 349, year = 2005, pages = {92-98}}

%Koi

@unpublished{KoivistoP10,
author = {Mikko Koivisto and Pekka Parviainen},
title = {A space-time tradeoff for permutation problems},
year = 2010,
note = {To appear in Proceedings SODA 2010}}

%Kor

@techreport{KorachO89,
author = {Ephraim Korach and Z. Ostfeld},
title = {Recognition of {DFS} Trees: Sequential and Parallel
Algorithms with Refined Verifications},
number = 582, type = {Technical Report},
year = 1989, institution = {Technion, Haifa, Israel}}

@techreport{KorachO90,
author = {Ephraim Korach and Z. Ostfeld},
title = {On the Existence of Special {DFS}-trees},
number = 612, type = {Technical Report},
year = 1990, institution = {Technion, Haifa, Israel}}

@unpublished{KorachS90,
author = {Ephraim Korach and Nir Solel},
title = {Linear Time Algorithm for Minimum Weight {S}teiner Tree in Graphs with Bounded Treewidth},
year = 1990,
note = {Manuscript}}

@article{KorachS93,
author = {Ephraim Korach and Nir Solel},
title = {Tree-width, Path-width and Cutwidth},
journal = dam, volume = 43, pages = {97-101}, year = 1993}

@article{KorachT93,
author = {Ephraim Korach and A. Tal},
title = {Generalized vertex disjoint paths in series-parallel graphs},
journal = dam, volume = 41, year = 1993, pages = {147-164}}

@article{KornaiT92,
author = {Andr/'{a}s Kornai and Zsolt Tuza},
title = {Narrowness, Pathwidth, and their Application in Natural Language
Processing},
journal = dam, volume = 36, year = 1992, pages = {87-92}}

@phdthesis{deKort92,
author = {Jeroen {de Kort}},
title = {Edge-disjointness in Combinatorial Optimization},
school = {University of Amsterdam},
year = 1992}

@article{KorteM89,
author = {Norbert Korte and Rolf H. M{\"{o}}hring},
title = {An incremental linear-time algorithm for recognizing interval
graphs},
journal = siamjc, volume = 18, year = 1989, pages = {68-81}}

%Kos

%Koster 1999

@phdthesis{Koster99,
author = {Arie M. C. A. Koster},
title = {Frequency Assignment - Models and Algorithms},
year = 1999,
school = {Univ. Maastricht},
address = {Maastricht, The Netherlands}}

@techreport{KosterHK99,
author = {Arie M. C. A. Koster and Stan P. M. van Hoesel and Antoon W. J. Kolen},
title = {Solving frequency assignment problems via tree-decomposition},
institution = {Faculty of Economics and Business Administration,
Universiteit Maastricht},
address = {Maastricht, The Netherlands},
number = {RM/99/011}, year = 1999}

%Koster 2001

@inproceedings{KosterBH01,
author = {Arie M. C. A. Koster and Hans L. Bodlaender and Stan P. M. van Hoesel},
title = {Treewidth: Computational Experiments},
booktitle = {Electronic Notes in Discrete Mathematics},
volume = 8,
pages = {54-57},
publisher = {Elsevier Science Publishers},
editor = {Hajo Broersma and Ulrich Faigle and Johann Hurink and Stefan Pickl},
year = 2001}

%Koster 2002

@article{KosterHK02,
author = {Arie M. C. A. Koster and Stan P. M. van Hoesel and Antoon W. J. Kolen},
title = {Solving partial constraint satisfaction problems with tree decomposition},
journal = networks, volume = 40, number = 3, year = 2002, pages = {170-180}}

%Koster 2004 

@techreport{KosterWB04,
author = {Arie M. C. A. Koster and Thomas Wolle and Hans L. Bodlaender},
title = {Degree-Based Treewidth Lower Bounds},
institution = {Institute for Information and Computing
Sciences, Utrecht University},
number = {UU-CS-2004-050},
year = {2004},
address = {Utrecht, The Netherlands}}

%Koster 2005

@inproceedings{KosterWB05,
author = {Arie M. C. A. Koster and Thomas Wolle and Hans L. Bodlaender},
title = {Degree-based treewidth lower bounds},
editor = {Sotiris E. Nikoletseas},
booktitle = wea05, publisher = lncs3503, year = 2005, pages = {101-112}}

%Koster 2006

@unpublished{KosterMvH06,
author = {Arie M. C. A. Koster and Bert Marchal and C. P. M. van Hoesel},
title = {Local search algorithms for treewidth},
note = {Work in progress}, year = 2006}

%Kr

%Kra

%Kram

@article{KramerK07,
author = {Florica Kramer and Horst Kramer},
title = {A survey on the distance-colouring of graphs},
journal = dm, volume = 308, year = 2007, pages = {422-426}}

%Krat

@article{KratochvilN89,
author = {Jan Kratochv{\'{\i}}l and Jaroslav Ne\~{s}et\~{r}il},
title = {{NP}-hardness results for intersection graphs},
journal = {Comment. Math. Univ. Carolinae}, volume = 30, number = 4, year = 1989, pages = {761-773}}

@article{KratochvilN90,
author = {Jan Kratochv{\'{\i}}l and Jaroslav Ne\~{s}et\~{r}il},
title = {{\sc independent set} and {\sc clique} problems in intersection-defined classes of graphs},
journal = {Comment. Math. Univ. Carolinae}, volume = 31, number = 1, year = 1990, pages = {85-93}}

@inproceedings{KratochvilT98,
author = {Jan Kratochv{\'{\i}}l and Zsolt Tusa},
title = {Rankings of directed graphs},
editor = {Juraj Hromkovic and Ondrej S\'{y}kora},
booktitle = wg98, publisher = lncs1517, year = 1998, pages = {114-123}}

%Kratsch 1987

@article{Kratsch87,
author = {Dieter Kratsch},
title = {Finding the Minimum Bandwidth of an Interval Graph},
journal = ic2, volume = 74, year = 1987, pages = {140-158}}

%Kratsch 1990

@article{Kratsch90,
author = {Dieter Kratsch},
title = {Finding dominating cliques efficiently, in strongly chordal graphs
and undirected path graphs},
journal = dm, volume = 86, year = 1990, pages = {225-238}}

@techreport{Kratsch90a,
author = {Dieter Kratsch},
title = {Cardinality {S}teiner Tree and Connected Dominating Set for
Undirected Path Graphs},
institution = {Friedrich Schiller Universit\"{a}t Jena, GDR},
year = 1990, number = {N/90/91}}

@unpublished{KratschH90,
author = {Dieter Kratsch and L. A. Hemachandra},
title = {On the Complexity of Graph Reconstruction},
year = 1990, note = {Manuscript}}

%Kratsch 2003

@inproceedings{KratschS03,
author = {Dieter Kratsch and Jeremy Spinrad},
title = {Between {$O(nm)$} and {$O(n^\alpha)$}},
booktitle = soda03, pages = {709-716}, year = 2003}

%Kratsch 2004

@misc{Kratsch04,
author = {Dieter Kratsch},
note = {Personal communication}, year = 2004}

%Kratsch 2006

@inproceedings{KratschL06,
author = {Dieter Kratsch and Mathieu Liedloff},
title = {An exact algorithm for the minimum dominating clique problem},
editor = {Hans L. Bodlaender and Michael A. Langston},
booktitle = iwpec06, publisher = lncs4169, year = 2006, pages = {128-139}}

@article{KratschS06,
author = {Dieter Kratsch and Jeremy Spinrad},
title = {Minimal fill in {$O(n^{2.69})$} time},
journal = dm, volume = 206, year = 2006, pages = {366-371}}

%Kratsch 2007,

@article{KratschL07,
author = {Dieter Kratsch and Mathieu Liedloff},
title = {An exact algorithm for the minimum dominating clique problem},
journal = tcs, volume = 385, year = 2007, pages = {226-240}}

%Kratsch 2008

@article{KratschMT08,
author = {Dieter Kratsch and Haiko M\"{u}ller and Ioan Todinca},
title = {Feedback vertex set on {AT}-free graphs},
journal = dam, volume = 156, year = 2008, pages = {1936-1947}}

%Kratsch 2009

@inproceedings{Kratsch09,
author = {Stephan Kratsch},
title = {Polynomial kernelizations for {MIN F$^+\Pi_1$} and {MAX NP}},
editor = {Susanne Albers and Jean-Yves Marion},
series = {Dagstuhl Seminar Proceedings},
publisher = {Leibniz-Zentrum f\"{u}r Informatik},
address = {Schloss Dagstuhl, Germany},
volume = {09001},
booktitle = stacs09, pages = {601-612}, year = 2009}

@article{KratschM09,
author = {Dieter Kratsch and Haiko M\"{u}ller},
title = {On a property of minimal triangulations},
journal = dm, volume = 309, year = 2009, pages = {1724-1729}}

@unpublished{KratschW09,
author = {Stephan Kratsch and Magnus Wahlstr\"{o}m},
title = {Two edge modification problems without polynomial kernels},
year = 2009,
note = {In Proceedings IWPEC 2009}}

%Kre

@unpublished{KreidlerS96,
author = {Martin Kreidler and Detlef Seese},
title = {Monadic {NP} and built-in Trees},
note = {Manuscript}, year = 1996}

@article{Krentel88,
author = {M. W. Krentel},
title = {The complexity of optimization problems},
journal = jcss, volume = 36, year = 1988, pages = {490-509}}

@article{Kreweras72,
author = {G. Kreweras},
title = {Sur les partition non crois\'ees d'un circle},
year = 1972,
journal = dm, volume = 1, number = 4, pages = {333 - 350}}

%Kru

@article{KruskalRS90,
author = {Clyde P. Kruskal and Larry Rudolph and Marc Snir},
title = {Efficient Parallel Algorithms for Graph Problems},
journal = alg, volume = 5, year = 1990, pages = {43-64}}

%Ku

%Kun

@article{KundgrenP08,
author = {Andr\'{e} K\"{u}ndgren and Michael J. Pelsmajer},
title = {Nonrepetitive colorings of graphs of bounded tree-width},
journal = dm, volume = 308, year = 2008, pages = {4473-4478}}

%Kuo

@article{KuoY04,
author = {David Kuo and Jing-Ho Yan},
title = {On {$L(2,1)$}-labelings of {C}artesian products of paths and cycles},
journal = dm, volume = 283, year = 2004, pages = {136-144}}

%Kus

@article{KuskeL05,
author = {D. Kuske and M. Lohrey},
title = {Logical aspects of {C}ayley-graphs: The group case},
journal = apal, volume = 131, year = 2005, pages = {263-286}}

%Kw

@inproceedings{Kwisthout08,
author = {Johan H. P. Kwisthout},
title = {Complexity Results for Enumerating {MPE} and Partial {MAP}},
editor = {M. Jaeger and T. Nielsen},
booktitle = {Proceedings of the 4th European Workshop on Probabilistic Graphical Models, PGM 2008},
year = 2008, pages = {161-168}}

@phdthesis{Kwisthout09,
author = {Johan H. P. Kwisthout},
title = {The Computational Complexity of Probabilistic Networks},
school = {Utrecht University},
address = {Utrecht, the Netherlands},
year = 2009}

%L

%La

%Lag

%Lagergren 1990

@inproceedings{Lagergren90,
author = {Jens Lagergren},
title = {Efficient Parallel Algorithms for Tree-Decomposition and Related
Problems},
year = 1990, booktitle = focs90, pages = {173-182}}

%Lagergren 1991

@phdthesis{Lagergren91,
author = {Jens Lagergren},
title = {Algorithms and Minimal Forbidden Minors for Tree-decomposable
Graphs},
school = {Royal Institute of Technology, Stockholm, Sweden},
year = 1991 }

@inproceedings{LagergrenA91,
author = {Jens Lagergren and Stefan Arnborg},
title = {Finding minimal forbidden minors using a finite congruence},
editor = {Javier Leach Albert and Burkhard Monien and Mario Rodr\'{\i}guez-Artalejo},
booktitle = icalp91, publisher = lncs510, year = 1991, pages = {532-543}}

%Lagergren 1993

@inproceedings{Lagergren93,
author = {Jens Lagergren},
title = {An uppern bound on the size of an obstruction}, 
booktitle = {Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint
Summer Research Conference, Seattle WA, June 1991},
publisher = {American Math. Soc.},
address = {Providence, RI},
editor = {Neil Robertson and Paul Seymour},
note = {Contemp. Math. 147.},
pages = {601-621},
year = 1993}

@article{Lagergren93a,
author = {Jens Lagergren},
title = {An upper bound on the size of a minimal forbidden minor},
journal = {AMS Contemporary Mathematics series}, volume = 147, year = 1993, pages = {601-621}}

%Lagergren 1994

@article{Lagergren94,
author = {Jens Lagergren},
title = {The nonexistence of reduction rules giving an embedding into a $k$-tree},
journal = dam, volume = 54, pages = {219-223}, year = 1994}

%Lagergren 1995

@unpublished{Lagergren95,
author = {Jens Lagergren},
title = {Upper Bounds on the Size of Obstructions and Intertwines},
year = 1995, note = {Manuscript}}

%Lagergren 1996

@article{Lagergren96,
author = {Jens Lagergren},
title = {Efficient parallel algorithms for graphs of bounded tree-width},
journal = ja, volume = 20, pages = {20-44}, year = 1996}

%Lai

@article{Laing07,
author = {Kofi A. Laing},
title = {Name-independent compact routing in trees},
journal = ipl, volume = 103, year = 2007, pages = {57-60}}

%Lam

@article{LamY98,
author = {T. W. Lam and F. L. Yue},
title = {Edge ranking of graphs is hard},
journal = dam, volume = 85, pages = {71-86}, year = 1998}

%Lan

@book{LandoZ2004,
author = {Sergei K. Lando and Alexander K. Zvonkin},
title = {Graphs on Surfaces and Their Applications},
year = 2004, 
publisher = {Springer-Verlag},
address = {Heidelberg}}

@techreport{Langston90,
author = {Michael A. Langston},
title = {Fast Search Algorithms for Layout Permutation Problems},
institution = {University of Tennessee},
number = {CS-90-107}, month = {May}, year = 1990}}

@inproceedings{Langston93,
author = {Michael A. Langston},
title = {An obstruction-based approach to layout optimization},
booktitle = {Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint
Summer Research Conference, Seattle WA, June 1991},
publisher = {American Math. Soc.},
address = {Providence, RI},
editor = {Neil Robertson and Paul Seymour},
note = {Contemp. Math. 147.},
pages = {623 - 629},
year = 1993}

%Lap

@inproceedings{Lapoire98,
author = {D. Lapoire},
title = {Recognizability equals definability, for every set of graphs of bounded tree-width},
booktitle = stacs98, pages = {618-628}, publisher=lncs1373, year = 1998}

%Lar

@article{LarranagaKPM97,
author = {Pedro {Larra\~{n}aga} and Cindy M. H. Kuijpers and Mikel Poza and Roberto H. Murga},
title = {Decomposing {B}ayesian networks: triangulation of the moral graph with genetic algorithms},
journal = {Statistics and Computing}, volume = 7, number = 1, year = 1997, pages = {19-34}}

%Las

@techreport{LaskarP83,
author = {R. Laskar and J. Pfaff},
title = {Domination and irredundance in graphs},
number = 434, type = {Technical Report}, institution = {Clemson University,
Dept. of Math. Sc.}, year = 1983}

@article{LaskarPHH84,
author = {R. Laskar and J. Pfaff and S. M. Hedetniemi and S. T. Hedetniemi},
title = {On the Algorithmic Complexity of Total Domination},
journal = sjadm, volume = 5, year = 1984, pages = {420-425}}

%Lau

@article{LauritzenS88,
author = {S. J. Lauritzen and D. J. Spiegelhalter},
title = {Local computations with probabilities on graphical structures and their application to expert systems},
journal = {The Journal of the Royal Statistical Society. Series B (Methodological)}, volume = 50, year = 1988, pages = {157-224}}

@techreport{Lautemann87,
author = {Clemens Lautemann},
title = {Efficient Algorithms on Graphs Represented by Decomposition Trees},
number = {6/87},
year = 1987,
institution = {Fachbereich Mathematik/Informatik, Universit\"{a}t Bremen}
}

@inproceedings{Lautemann88,
author = {Clemens Lautemann},
title = {Efficient algorithms on context-free graph languages},
editor = {Timo Lepist\"{o} and Arto Salomaa},
booktitle = icalp88, publisher = lncs317, pages = {362-378}, year = 1988}

@inproceedings{Lautemann88a,
author = {Clemens Lautemann},
title = {Decomposition trees: structured graph representation and efficient algorithms},
editor = {Max Dauchet and Maurice Nivat},
booktitle = {Proceedings of the 13th Colloquium on Trees in Algebra and Programming, CAAP'88},
publisher = lncs299, pages = {28-39}, year = 1988}

@techreport{Lautemann90,
author = {Clemens Lautemann},
title = {Tree Automata, Tree Decomposition and Hyperedge Replacement},
number = {2/90},
type = {Informatik-Bericht},
institution = {Johannes Gutenberg-Universit\"{a}t Mainz},
year = 1990}

@article{Lautemann90a,
author = {Clemens Lautemann},
title = {The complexity of graph languages generated by hyperedge
replacement},
journal = ai, volume = 27, year = 1990, pages = {399-421}}

%Law

@book{Lawler76,
author = {E. Lawler},
title = {Combinatorial Optimization: Networks and Matroids},
publisher = {Holt, Rinehart and Winston},
address = {New York},
year = 1976 }

@article{Lawler76a,
author = {E. Lawler},
title = {A note on the complexity of the chromatic number problem},
journal = ipl, volume = 5, year = 1976, pages = {66-67}}

@inproceedings{LawlerS85,
author = {Eugene L. Lawler and P. J. Slater},
title = {A Linear Time Algorithm for Finding an Optimal Dominating Subforest of a Tree},
booktitle = {Proc. Graph Theory and its Applications to Algorithms and Computer Science},
pages = {501-506},
editor = {Y. Alavi et al.},
year = 1985
}

@incollection{LawlerLRS93,
author = {Eugene L. Lawler and Jan Karel Lenstra and Alexander H. G. {Rinnooy
Kan} and David B. Shmoys},
title = {Sequencing and Scheduling: Algorithms and Complexity},
booktitle = {Handbooks in OR \& MS, Vol. 4},
editor = {S.C. Graves et al},
publisher = {Elsevier Science Publishers},
year = 1993, pages = {445-522}}

@article{LawsonK98,
author = {Nancy Lawson and M. S. Krishnamoorthy}, 
title = {Bridge obstructions to circular-tree gate matrix
layout},
journal = gc, volume = 14, year = 1998, pages = {143-153}}

%LaP

@article{LaPaugh93,
author = {A. S. LaPaugh},
title = {Recontamination Does Not Help to Search a Graph},
journal = jacm, volume = 40, year = 1993, pages = {224-245}}

%Le

@article{LeLM03,
author = {H.-O. Le and V. B. Le and H. M\"{u}ller},
title = {Splitting a graph into disjoint induced paths or cycles},
journal = dam, volume = 131, pages = {199-212}, year = 2003}

%Lea

@inproceedings{LeaverFayLS04,
author = {Andrew {Leaver-Fay} and Yuanxin Liu and Jack Snoeyink},
title = {Faster placement of hydrogen atoms in protein structures by dynamic programming},
booktitle = alenex04, year = 2004, pages = {39-48}}

%Lee

@article{Lee09,
author = {Chuan-Min Lee},
title = {On the complexity of signed and minus total domination in graphs},
journal = ipl, volume = 109, year = 2009, pages = {1177-1181}}

@incollection{LeeuwenT86,
author = {Jan {van Leeuwen} and Richard B. Tan},
title = {Computer Networks with Compact Routing Tables},
editor = {G. Rozenberg and A. Salomaa},
booktitle = {The Book of {L}},
publisher = {Springer-Verlag}, address = {Berlin}, year = 1986,
pages = {298-307}}

@article{LeeuwenT87,
author = {Jan {van Leeuwen} and Richard B. Tan},
title = {Interval Routing},
journal = tcj, volume = 30, year = 1987, pages = {298-307}}

@inproceedings{Leeuwen90,
author = {Jan {van Leeuwen}},
title = {Graph Algorithms},
booktitle = {Handbook of Theoretical Computer Science, {A}: {A}lgorithms and
Complexity Theory},
address = {Amsterdam}, year = 1990,
publisher = {North Holland Publ. Comp.},
pages = {527-631}
}

@inproceedings{LeeuwenT95,
author = {Jan {van Leeuwen} and Richard B. Tan},
title = {Compact Routing Methods: A Survey},
booktitle = {Proc 1st
Colloquium on Structural Information and Communication Complexity
(SIROCCO'94)},
publisher = {Carleton Univ. Press}, address={Ottawa}, year = 1994,
pages = {71-93}}

@inproceedings{Leeuwen05,
author = {E.J. van Leeuwen},
title = {Approximation Algorithms for Unit Disk Graphs},
editor = {Dieter Kratsch},
booktitle = wg05, publisher = lncs3787, year = 2005, pages = {351-361}}

%Leh

@article{Lehot74,
author = {P. G. H. Lehot},
title = {An optimal algorithm to detect a line graph and output its
root graph},
journal = jacm, volume = 21, pages = {569-575}, year = 1974 }

%Lei

@inproceedings{LeightonR88,
author = {F. T. Leighton and S. Rao},
title = {An approximate max-flow min-cut theorem for uniform multi-commodity
flow problems with applications to approximate algorithms},
booktitle = focs88, publisher = {IEEE}, pages = {422-431},
year = 1988, 
note = {Full version: submitted manuscript}
}

@article{Leimer93,
author = {H.-G. Leimer},
title = {Optimal decomposition by clique separators},
journal = dm, volume = 113, pages = {99-123}, year=1993}

%Lek

@article{LekkerkerkerB62,
author = {C. G. Lekkerkerker and J. C. Boland},
title = {Representation of a finite graph by a set of intervals on the real line},
journal = fundmath, volume = 51, year = 1962, pages = {45-64}}

@unpublished{LeisersonP87,
author = {Charles E. Leiserson and Cynthia A. Philips},
title = {Parallel Contraction of Planar Graphs},
year = 1987,
note = {MIT, manuscript}
}

@article{Lengauer81,
author = {Thomas Lengauer},
title = {Black-White Pebbles and Graph Separation},
journal = ai, volume = 16, year = 1981, pages = {465-475}}

@article{Lengauer82,
author = {Thomas Lengauer},
title = {Upper and Lower Bounds on the Complexity of the Min-Cut
Linear Arrangement Problem on Trees},
journal = sjadm, volume = 3, pages = {99-113}, year = 1982 }

@article{Lengauer87,
author = {Thomas Lengauer},
title = {Efficient algorithms for finding minimum spanning forests in
hierarchically defined graphs},
journal = ja, volume = 8, year = 1987, pages = {260-284}}

@article{LengauerW88,
author = {Thomas Lengauer and Egon Wanke},
title = {Efficient solutions of connectivity problems on
hierarchically defined graphs},
journal = siamjc, volume = 17, year = 1988, pages = {1063-1080}}

@inproceedings{LengauerW88a,
author = {Thomas Lengauer and Egon Wanke},
title = {Efficient analysis of graph properties on context-free graph languages}, 
editor = {Timo Lepist\"{o} and Arto Salomaa},
booktitle = icalp88, publisher = lncs317, pages = {379-393}, year = 1988}

@article{LeungVW84,
author = {Joseph Y.-T. Leung and Oliver Vornberger and James D. Witthoff},
title = {On Some Variants of The Bandwidth Minimization Problem},
journal = siamjc, year = 1984, volume = 13, pages = {650-667}}

@article{LevenG83,
author = {D. Leven and Zvi Galil},
title = {{NP}-completeness of finding the chromatic index of regular
graphs},
journal = ja, volume = 4, year = 1983, pages = {35-44}}

@inproceedings{Levin84,
author = {L. A. Levin},
title = {Problems, complete in ``average'' instance},
booktitle = stoc84,
year = 1984}

%Li

@article{LiZ07,
author = {Xueliang Li and Xiaoyan Zhang},
title = {On the minimum monochromatic or multicolored subgraph partition
problems},
journal = tcs, volume = 385, year = 2007, pages = {1-10}}


%Lia

@article{LiangRDS91,
author = {Y. Liang and C. Rhee and S. K. Dhall and S. Lakshmivarahan},
title = {A new approach for the domination problem on permutation
graphs},
journal = ipl, volume = 37, year = 1991, pages = {219-224}}

%Lic

@article{LichtensteinS80,
author = {D. Lichtenstein and M. Sipser},
title = {Go is polynomial-space hard},
journal = jacm, volume = 27, year = 1980, pages = {393-401}}

@article{Lichtenstein82,
author = {David Lichtenstein},
title = {Planar formulae and their uses},
journal = siamjc, volume = 11, year = 1982, pages = {185-225}}

@article{LickW70,
author = {D. R. Lick and A. T. White},
title = {$k$-Degenerate graphs},
journal = canjm, volume = 22, year = 1970, pages = {1082--1096}}

%Lie

@article{Liedloff08,
author = {Mathieu Liedloff},
title = {Finding a dominating set on bipartite graphs},
journal = ipl, volume = 107, year = 2008, pages = {154-157}}

@article{LiedloffKLP08,
author = {Mathieu Liedloff and Ton Kloks and Jiping Liu and Sheng-Lung Peng},
title = {Efficient algorithms for {R}oman domination on some classes of graphs}, 
journal = dam, volume = 156, year = 2008, pages = {3400-3415}}

%Lin

@article{LinO91,
author = {R. Lin and S. Olariu},
title = {An {NC} Recognition Algorithm for Cographs},
journal = jpdc, volume = 13, year = 1991, pages = {76-90}}

@article{LinCL06,
author = {Guohui Lin and Zhipeng Cai and Dekang Lin},
title = {Vertex covering by paths on trees with its applications in machine translation},
journal = ipl, year = 2006, volume = 97, pages = {73-81}}

%Lingas 1985

@inproceedings{Lingas85,
author = {Andrzej Lingas},
title = {Subgraph Isomorphism for easily separable graphs with bounded valence},
booktitle = wg85, year = 1985, pages = {217-229}}

%Lingas 1987

@techreport{Lingas87,
author = {Andrzej Lingas},
title = {On Parallel Complexity of the Subgraph Isomorphism Problem},
number = {LITH-IDA-R-87-10},
institution = {Link\"{o}ping University},
year = 1987
}

%Lingas 1988

@unpublished{Lingas88,
author = {Andrzej Lingas},
title = {Subgraph Isomorphism for Connected Graphs of Bounded Valence and Bounded Separator is in {NC}},
note = {Ext. abstract},
year = 1988
}

@inproceedings{LingasS88,
author = {Andrzej Lingas and Maciej M. Sys{\l}o},
title = {A polynomial-time algorithm for subgraph isomorphism of two-connected series-parallel graphs},
editor = {Timo Lepist\"{o} and Arto Salomaa},
booktitle = icalp88, year = 1988, pages = {394-409}, publisher = lncs317}

%Lingas 1989

@article{Lingas89,
author = {Andrzej Lingas},
title = {Subgraph Isomorphism for biconnected outerplanar graphs in cubic time},
journal = tcs, volume = 63, year = 1989, pages = {295-302}}

@article{LingasK89,
author = {Andrzej Lingas and Marek Karpinski},
title = {Subtree Isomorphism is {NC} reducible to Bipartite Perfect Matching},
journal = ipl, volume = 30, year = 1989, pages = {27-32}}

@article{LingasP89,
author = {Andrzej Lingas and Andrzej Proskurowski},
title = {Fast parallel algorithms for the subgraph homeomorphism and the subgraph isomorphism problems for classes of planar graphs},
journal = tcs, volume = 68, year = 1989, pages = {155-174}}

@article{LingerPS95,
author = {Gerard T. Linger and Themistocles Politof and A. Satyanarayana},
title = {A forbidden minor characterization and reliability of a class of partial 4-trees},
journal = networks, volume = 25, pages = {139-146}, year = 1995}

%Lip

@article{LiptonRT79,
author = {Richard J. Lipton and Donald J. Rose and Robert Endre Tarjan},
title = {Generalized nested dissection},
journal = sjna, volume = 16, year = 1979, pages = {346-358}}

@article{LiptonT79,
author = {Richard J. Lipton and Robert Endre Tarjan},
title = {A separator theorem for planar graphs},
journal = sjam, volume = 36, year = 1979, pages = {177-189}}

@article{LiptonT80,
author = {Richard J. Lipton and Robert Endre Tarjan},
title = {Applications of a planar separator theorem},
journal = siamjc, volume = 9, year = 1980, pages = {615-627}}

%Lit

@inproceedings{LitovskiMZ93,
author = {I. Litovsky and Y. M{\'{e}}tivier and W. Zielonka},
title = {The power and the limitations of local computations on graphs},
editor = {Ernst W. Mayr},
booktitle = wg92, year = 1993, publisher = lncs657, pages = {333-345}}

%Liu

%Liu 1980

@article{LiuG80,
author = {P. C. Liu and R. C. Geldmacher},
title = {An {$O(\max(m,n))$} algorithm for finding a subgraph
homeomorphic to $K_4$},
journal = cn, volume = 29, year = 1980, pages = {597-609}}

%Liu 1990

@article{Liu90,
author = {J. W. H. Liu},
title = {The role of elimination trees in sparse factorization},
journal = sjmaa, volume = 11, year = 1990, pages = {134-172}}

%Liu 1997

@article{LiuY97,
author = {D.D.-F. Liu and R. K. Yeh},
title = {On distance two labellings of graphs},
journal = arscomb, volume = 47, year = 1997, pages = {13-22}}

%Liu 1998

@article{LiuY98,
author = {Chuan-Ming Liu and Ming-Shing Yu},
title = {An optimal parallel algorithm for node ranking of cographs},
journal = dam, volume = 87, year = 1998, pages = {187-201}}

%Liu 2006

@inproceedings{LiuLCS06,
author = {Yang Liu and Songjian Lu and Jianer Chen and Sing-Hoi Sze},
title = {Greedy localization and color-coding: Improved matching and packing algorithms},
editor = {Hans L. Bodlaender and Michael A. Langston},
booktitle = iwpec06, publisher = lncs4169, year = 2006, pages = {83-94}}

%Liu 2008

@article{Liu08,
author = {Daphne Der-Fen Liu},
title = {Radio number for trees},
journal = dm, volume = 308, year = 2008, pages = {1153-1164}}

%Liu 2009

@article{Liu09,
author = {Hong Liu and Haodi Feng and Daming Zhu and Junfeng Luan},
title = {Parameterized computational complexity of control problems in voting systems},
journal = tcs, volume = 410, year = 2009, pages = {2746-2753}}

%Liu 2010

@article{Liu10,
author = {Hong Liu and Daming Zhu},
title = {Parameterized complexity of control problems in Maximin election},
journal = ipl, volume = 110, year = 2010, pages = {383-388}}

%Ll

%Llo

@article{LloydSW88,
author = {Errol L. Lloyd and Mary Lou Soffa and Ching-Chy Wang},
title = {On locating minimum feedback vertex sets},
journal = jcss, volume = 37, pages = {292-311}, year = 1988}

%Lo

%Lok

%Lokshtanov 2009

@inproceedings{LokshtanovMS09,
author = {Daniel Lokshtanov and Matthias Mnich and Saket Saurabh},
title = {Linear kernel for planar connected dominating set},
editor = {Jianer Chen and S. Barry Cooper},
booktitle = tamc09, publisher = lncs5532, year = 2009, pages = {281-290}}

%Lokshtanov 2010

@article{Lokshtanov10,
author = {Daniel Lokshtanov},
title = {On the complexity of computing treelength},
journal = dam, volume = 158, year = 2010, pages = {820-827}}

@article{LokshtanovMP10,
author = {Daniel Lokshtanov and Federico Mancini and Charis Papadopoulos},
title = {Characterizing and computing minimal cograph completions},
journal = dam, volume = 158, year = 2010, pages = {755-764}}

%Lop

@article{LopezL80,
author = {A. D. Lopez and H. F. S. Law},
title = {A dense gate matrix layout method for {MOS VLSI}},
journal = ieeeted,
volume = 27, year = 1980, pages = {1671-1675}}

%Loz

@article{LozinR04,
author = {Vadim Lozin and Dieter Rautenbach},
title = {On the band-, tree-, and clique-width of graphs with
bounded vertex degree},
journal = sjdm, volume = 18, year = 2004, pages = {195-206}}

@article{LozinR04a,
author = {Vadim Lozin and Dieter Rautenbach},
title = {Chordal bipartite graphs of bounded tree- and clique-width},
journal = dm, volume = 283, pages = {151-158}, year = 2004}

@article{LozinR07,
author = {Vadim Lozin and Dieter Rautenbach},
title = {The relative clique-width of a graph},
journal = jctb, volume = 97, pages = {846-858}, year = 2007}

@inproceedings{Lozin08,
author = {Vadim Lozin},
title = {From tree-width to clique-width: {E}xcluding a unit interval graph},
editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga},
booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {871-882}}

%Lu

@article{LuKT02,
author = {Ching Lung Lu and Ming-Tat Ko and Chuan Yi Tang},
title = {Perfect edge domination and efficient edge domination in graphs},
journal = dam, volume = 119, year = 2002, pages = {227-250}}

%Lub

@article{Luby86,
author = {Michael Luby},
title = {A simple parallel algorithm for the maximal independent set
problem},
journal = siamjc, volume = 4, year = 1986 , pages = {1036-1053}}

@misc{Luby88,
author = {Michael Luby},
title = {Removing randomness in parallel computation without a processor
penalty}}

%Luc

@article{LuccioS07,
author = {Flaminia L. Luccio and Jop F. Sibeyn},
title = {Feedback vertex sets in mesh-based networks},
journal = tcs, volume = 383, year = 2007, pages = {86-101}}

@phdthesis{Lucena02,
author = {Brian Lucena},
title = {Dynamic Programming, Tree-Width, and Computation on Graphical
Models},
school = {Brown University},
address = {Providence, RI, USA},
year = 2002}

@article{Lucena03,
author = {Brian Lucena},
title = {A new lower bound for tree-width using maximum cardinality search},
journal = sjdm, volume = 16, year = 2003, pages = {345-353}}

@article{Lucena07,
author = {Brian Lucena},
title = {Achievable sets, brambles, and sparse treewidth obstructions},
journal = dam, volume = 155, pages = {1055-1065}, year = 2007}

@article{LucetMC00,
author = {C. Lucet and J.-F. Manouvrier and J. Carlier},
title = {Evaluating network reliability and 2-edge-connected reliability in
linear time for bounded pathwidth graphs},
journal = alg, volume = 27, year = 2000, pages = {316-336}}

@article{LucetMM06,
author = {C. Lucet and F. Mendes and A. Moukrim},
title = {An exact method for graph coloring},
journal = cor, volume = 33, year = 2006, pages = {2189-2207}}

@article{LuekerB79,
author = {G. S. Lueker and K. S. Booth},
title = {A linear-time algorithm for deciding interval graph isomorphism},
journal = jacm, volume = 26, year = 1979, pages = {183-195}}

%M

%Ma

%Maa

@article{MaamounM87,
author = {M. Maamoun and H. Meyniel},
title = {On a game of policemen and robbers},
journal = dam, volume = 17, year = 1987, pages = {307-309}}

%Mad

@article{MadelaineS08,
author = {Florent R. Madelaine and Iain A. Stewart},
title = {Improved upper and lower bounds on the feedback vertex numbers of
grids and butterflies},
journal = dm, year = 2008, volume = 308, pages = {4144-4164}}

%Mah

%Mahajan 1987

@inproceedings{MahajanP87,
author = {Sanjeev Mahajan and Joseph G. Peters},
title = {Algorithms for Regular Properties in Recursive Graphs},
booktitle = {Proceedings of the 25th Annual Allerton Conference on
Communication, Control, and Computing},
pages = {14-23},
year = 1987}

%Mahajan 1994

@article{MahajanP94,
author = {Sanjeev Mahajan and Joseph G. Peters},
title = {Regularity and locality in $k$-terminal graphs},
journal = dam, volume = 54, pages = {229-250}, year = 1994}

%Mahajan 1999

@article{MahajanR99,
author = {M. Mahajan and V. Raman},
title = {Parameterizing Above Guaranteed Values: MaxSat and MaxCut},
journal = ja, volume = 31, issue = 2, year = 1999, pages = {335-354}}

%Mahajan 2006

@article{MahajanRS09,
author = {Meena Mahajan and Venkatesh Raman and Somnath Sikdar},
title = {Parameterizing problems above or below guaranteed values},
journal = jcss, volume = 72, year = 2009, pages = {137-153}}

@article{Maharry99,
author = {J. Maharry},
title = {An excluded minor theorem for the octahedron},
journal = jgt, volume = 31, year = 1999, pages = {95-100}}

@article{MaheshRS91,
author = {R. Mahesh and C. P. Rangan and A. Srinivasan},
title = {On finding the minimum bandwidth of interval graphs},
journal = ic2, volume = 95, year = 1991, pages = {218-224}}

@inproceedings{MaheshwariZ01,
author = {A. Maheshwari and N. Zeh},
title = {I/O-Efficient Algorithms for Bounded Treewidth Graphs},
booktitle = soda01, pages = {89-90}, year = 2001}

%Mak

@article{MakedonS89,
author = {F. S. Makedon and Ivan Hal Sudborough},
title = {On minimizing width in linear layouts},
journal = dam, volume = 23, pages = {201-298}, year = 1989 }

@article{MakedonSW93,
author = {F. Makedon and D. Sheinwald and Y. Wolfsthal},
title = {A simple linear-time algorithm for the recognition of bandwidth-2
biconnected graphs},
journal = ipl, volume = 46, year = 1993, pages = {103-107}}

@article{MakedonPS85,
author = {F. S. Makedon and Christos H. Papadimitriou and Ivan Hal Sudborough},
title = {Topological Bandwidth},
journal = sjadm, volume = 6, year = 1985, pages = {418-444}}

@article{MakinoUI01,
author = {K. Makino and Y. Uno and T. Ibaraki},
title = {On minimum edge ranking spanning trees},
journal = ja, volume = 38, year = 2001, pages = {411-437}}

%Makowsky

@article{MakowskyR99,
author = {J. A. Makowsky and Udi Rotics},
title = {On the clique-width of graphs with few {$P_4$}'s},
journal = ijfcs, volume = 10, year = 1999, pages = {329-348}}

@inproceedings{Makowsky01,
author = {J. A. Makowsky},
title = {Colored {T}utte polynomials and {K}auffman brackets for graphs of
bounded treewidth},
booktitle = soda01, pages = {487-495}, year = 2001}

@article{MakowskyM03,
author = {J. A. Makowsky and J. P. Mari\~{n}o},
title = {The parameterized complexity of knot polynomials},
journal = jcss, volume = 67, year = 2003, pages = {742-756}}

@article{Makowsky04,
author = {J. A. Makowsky},
title = {Coloured {T}utte polynomials and {K}auffman brackets for graphs of
bounded tree width},
journal = dam, volume = 145, pages = {276-290}, year = 2004}

%Mal

@article{Malitz94,
author = {Seth M. Malitz},
title = {Graphs with {$E$} edges have pagenumber {$O(\sqrt{E})$}},
journal = ja, volume = 17, year = 1994, pages = {71-84}}

@article{Malitz94a,
author = {Seth M. Malitz},
title = {Genus $g$ graphs have pagenumber {$O(\sqrt{g})$}},
journal = ja, volume = 17, year = 1994, pages = {85-109}}

%Man

%Manb

@article{ManberT84,
author = {Udi Manber and Martin Tompa},
title = {The effect of number of {H}amiltonian paths on the complexity of a vertex coloring problem},
journal = siamjc, volume = 13, year = 1984, pages = {109-115}}

%Manc

@article{Mancini10,
author = {Federico Mancini},
title = {Minimum fill-in and treewidth of split$+ke$ and split$+kv$ graphs},
journal = dam, volume = 158, year = 2010, pages = {747=754}}

%Mann

@article{ManninoORC07,
author = {Carlo Mannino and Gianpaolo Oriolo and Federico Ricci and Sunil Chandran},
title = {The stable set problem and the thinness of a graph},
journal = orl, volume = 35, year = 2007, pages = {1-9}}

%Mans

@article{Mansfield82,
author = {A. Mansfield},
title = {Determining the thickness of graphs is {NP}-hard},
journal = {Mathematical Proceedings of the Cambridge Philosophical Society}, volume = 93, year = 1982, pages = {9-23}}

@article{MansourS89,
author = {Yishay Mansour and Baruch Schieber},
title = {Finding the edge connectivity of directed graphs},
volume = 10, year = 1989, journal = ja, pages = {76-85}}

%Mar

@unpublished{MarchalHK08,
author = {B. Marchal and Hoesel, C.P.M. {v}an and Koster, A. M. C. A.},
title = {A local search algorithm for determining tree decompositions of graphs},
note = {Presented on the International Symposium on Combinatorial Optimization},
month = mar, year = 2008}

@article{Marcotte90,
author = {O. Marcotte},
title = {Exact edge-colorings of graphs without prescribed minors},
journal = {DIMACS Ser. Discrete Math. Theoretc. Comput. Sci.},
volume = 1, year = 1990, pages = {235-243}}

@techreport{Marecek09,
author = {Jakub Mare\u{c}ek},
title = {Some probabilistic results on width measures of graphs},
type = {Report},
number = {arXiv:0908.1772v5},
year = 2009}

@article{Markowitz57,
author = {H. M. Markowitz},
title = {The elimination form of the inverse and its application to linear programming},
journal = {Management Science}, volume = 3, year = 1957, pages = {255-269}}

%Marx 2005

@article{Marx05,
author = {D\'{a}niel Marx},
title = {Parameterized complexity of constraint satisfaction problems},
journal = {Computational Complexity}, volume = 14, year = 2005, pages = {153-183}}

%Marx 2006

@article{Marx06,
author = {D\'{a}niel Marx},
title = {Parameterized graph separation problems},
journal = tcs, volume = 351, year = 2006, pages = {394-406}}

@article{Marx06a,
author = {D\'{a}niel Marx},
title = {Parameterized coloring problems on chordal graphs},
journal = tcs, volume = 351, year = 2006, pages = {407-424}}

@article{Marx06b,
author = {D\'{a}niel Marx},
title = {Precoloring extension on unit interval graphs},
journal = dam, volume = 154, year = 2006, pages = {995-1002}}

@article{Marx06c,
author = {D\'{a}niel Marx},
title = {Minimum sum multicoloring on the edges of trees},
journal = tcs, volume = 361, year = 2006, pages = {133-149}}

@inproceedings{Marx06d,
author = {D\'{a}niel Marx},
title = {Chordal deletion is fixed-parameter tractable},
editor = {Fedor V. Fomin},
booktitle = wg06, year = 2006, pages = {37-48}, publisher = lncs4271}

%Marx 2009

@article{Marx09,
author = {D\'{a}niel Marx},
title = {A parameterized view on matroid optimization problems},
journal = tcs, volume = 410, year = 2009, pages = {4471-4479}}

@article{MarxR09,
author = {D\'{a}niel Marx and Igor Razgon},
title = {Constant ratio fixed-parameter approximation of the edge multicut problem},
journal = ipl, volume = 109, year = 2009, pages = {1161-1166}}

@article{MarxS09,
author = {D\'{a}niel Marx and Marcus Schaefer},
title = {The complexity of nonrepetive coloring},
journal = dam, volume = 157, year = 2009, pages = {13-18}}

@article{MarxS09a,
author = {D\'{a}niel Marx and Ildik\'{o} Schlotter},
title = {Parameterized graph cleaning problems},
journal = dam, volume = 157, year = 2009, pages = {3258-3267}}

%Marz

@article{MarzbanGJ09,
author = {Marjan Marzban and Qian-Ping Gu and Xiaohua Jia},
title = {Computational study on planar dominating set problem},
journal = tcs, volume = 410, year = 2009, pages = {5455-5466}}

%Mas

@article{MasudaN88,
author = {S. Masuda and N. Nakajima},
title = {An optimal algorithm for finding a maximum independent set of
a circular-arc graphs},
journal = siamjc, volume = 17, pages = {41-52}, year = 1988 }

%Mat

%Mata

@phdthesis{Mata-Montero90,
author = {E. Mata-Montero},
title = {Reliability of Partial $k$-Tree Networks},
school = {University of Oregon},
number = {UO-CIS-TR-90-14},
year = 1990}

@article{Mata-Montero91,
author = {E. Mata-Montero},
title = {Resilience of partial $k$-tree networks with edge and node failures},
journal = networks, volume = 21, year = 1991, pages = {321-344}}

%Mate

@article{Mate81,
author = {A. M\'at\'e},
title = {A lower estimate for the achromatic number of irreducible graphs},
journal = dm, volume = 2, year = 1981, pages = {128-145}}

%Math

@inproceedings{MathiesonPS04,
author = {Luke Mathieson and Elena Prieto  and Peter Shaw},
title = {Packing Edge Disjoint Triangles: A Parameterized View},
editor = {R. G. Downey and M. R. Fellows},
booktitle = iwpec04, year = 2004, publisher = lncs3162, pages = {127-137}}

%Mato

@article{MatousekT91,
author = {Ji{\u{r}}\'{\i} Matou{\v{s}}ek and Robin Thomas},
title = {Algorithms for finding tree-decompositions of graphs},
year = 1991, journal = ja, volume = 12, pages = {1-22}}

@article{MatousekT92,
author = {Ji{\u{r}}\'{\i} Matou{\v{s}}ek and Robin Thomas},
title = {On the Complexity of Finding Iso- and Other Morphisms for
Partial $k$-Trees},
journal = dm, volume = 108, year = 1992, pages = {343-364}}

%Mats

@inproceedings{MatsuiUU08,
author = {Yasuko Matsui and Ryuhei Uehara and Takeaki Uno},
title = {Enumeration of perfect sequences of chordal graph},
editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga},
booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {859-870}}

%Mau

@article{MauerSW81,
author = {H. A. Mauer and Ivan Hal Sudborough and E. Welzl},
title = {On the complexity of the general coloring problem},
journal = ic, volume = 51, year = 1981, pages = {128-145}}

%May

@article{MayhewNW09,
author = {Dillon Mayhew and Mike Newman and Geoff Whittle},
title = {On excluded minors for real-representability},
journal = jctb, volume = 99, year = 2009, pages = {685-689}}

%Maz

@phdthesis{Mazoit04,
author = {Fr\'{e}d\'{e}ric Mazoit},
title = {D\'{e}compositions algorithmiques des graphes},
school = {Ecole Normale Sup\'{e}rieure de Lyon},
year = 2004}

@article{Mazoit06,
author = {F. Mazoit},
title = {Listing all the minimal separators of a 3-connected planar graph},
journal = dm, volume = 306, pages = {372 - 380}, year = 2006}

@inproceedings{Mazoit06a,
author = {F. Mazoit},
title = {The branch-width of circular-arc graphs},
editor = {Jos\'{e} R. Correa and Alejandro Hevia and Marcos A. Kiwi},
booktitle = latin06, publisher = lncs3887, year = 2006, pages = {727-736}}

@article{MazoitN08,
author = {Fr\'{e}d\'{e}ric Mazoit and Nicolas Nisse},
title = {Monotonicity of non-deterministic graph searching},
journal = tcs, volume = 399, year = 2008, pages = {169-178}}

%Mc

%McC

@article{McConnellS99,
author = {R.~M. Mc{C}onnell and J. Spinrad},
title = {Modular decomposition and transitive orientation},
journal = dm, volume = 201, year = 1999, pages = {189-241}}

@article{McConnellM04,
author = {Ross M. Mc{C}onnell and Fabien {de Montgolfier}},
title = {Linear-time modular decomposition of directed graphs},
journal = dam, volume = 145, pages = {198-209}, year = 2004}

%McD

@inproceedings{McDiarmidRSS92,
author = {C. McDiarmid and Bruce Reed and A. Schrijver and B. Shepherd},
title = {Non-Interfering Network Flows},
editor = {O. Nurmi and E. Ukkonen},
booktitle = swat92, publisher = lncs621, year = 1992, pages = {245-257}}

@article{McDiarmidR03,
author = {C. McDiarmid and B. Reed},
title = {Channel assignment on graphs of bounded treewidth},
journal = dm, volume = 273, pages = {183-192}, year = 2003}

%McG

@inproceedings{McGuinnessK92,
author = {Patrick J. McGuinness and Andr{\'{e}} E. K{\'{e}}zdy},
title = {An Algorithm to Find a {$K_5$} Minor},
booktitle = soda92, year = 1992, pages = {345-356}}

%McH

@article{McHughP90,
author = {J. McHugh and Y. Perl},
title = {Best location of service centers in a tree-like network under budget
constraints},
journal = dm, year = 1990, volume = 86, pages = {199-214}}

%McK

@article{McKayW90,
author = {Brendan D. {McKay} and Nicholas C. Wormald},
title = {Uniform generation of random regular graphs of moderate
degree},
journal = ja, volume = 11, year = 1990, pages = {52-67}}

%McM

@article{McMorrisWW94,
author = {F. R. McMorris and Tandy Warnow and T. Wimer},
title = {Triangulating Vertex-Colored Graphs},
journal = sjdm, volume = 7, number = 2, year = 1994, pages = {296-306}}

%McN

@article{McNaughton93,
author = {R. McNaughton},
title = {Infinite games played on finite graphs},
journal = apal, volume = 65, pages={149-184}, year = 1993}

%McV

@article{McVitieW71,
author = {D. {McVitie} and L. B. Wilson},
title = {The stable marriage problem},
journal = cacm, volume = 14, year = 1971, pages = {486-490}}

%Me

%Mee

@inproceedings{MeerR06,
author = {Klaus Meer and Dieter Rautenbach},
title = {On the {OBDD} size for graphs of bounded tree- and clique-width},
editor = {Hans L. Bodlaender and Michael A. Langston},
booktitle = iwpec06, publisher = lncs4169, year = 2006, pages = {71-82}}

@article{MeerR09,
author = {Klaus Meer and Dieter Rautenbach},
title = {On the {OBDD} size for graphs of bounded tree- and clique-width},
journal = dm, volume = 309, year = 2009, pages = {843-851}}

%Meg

@article{MegiddoHGJP88,
author = {Nimrod Megiddo and S. L. Hakimi and Michael R. Garey and David S. Johnson
and Christos H. Papadimitriou},
title = {The Complexity of Searching a Graph},
journal = jacm, volume = 35, pages = {18-44}, year = 1988 }

@article{MegiddoV88,
author = {Nimrod Megiddo and Uzi Vishkin},
title = {On finding a minimum dominating set in a tournament
({N}ote)},
journal = tcs, volume = 61, year = 1988, pages = {307-316}}

%Meh

@book{Mehlhorn84a,
author = {Kurt Mehlhorn},
title = {Sorting and Searching},
series = {Data Structures and Algorithms},
volume = 1,
publisher = {Springer Verlag},
address = {Berlin},
year = 1984 }

@book{Mehlhorn84,
author = {K. Mehlhorn},
title = {Graph Algorithms and {NP}-Completeness},
series = {Data Structures and Algorithms},
volume = 2,
publisher = {Springer Verlag},
address = {Berlin},
year = 1984 }

@inproceedings{MehlhornNR89,
author = {K. Mehlhorn and S. N\"{a}her and M. Rauch},
title = {On the complexity of a game related to the dictionary
problem},
booktitle = focs89, year = 1989, pages = {546-548}}

@book{MehlhornN95,
author = {Kurt Mehlhorn and Stefan N\"aher},
title = {{LEDA}: A Platform for Combinatorial and Geometric Computing},
publisher = {Cambridge University Press},
year = 1995
}


%Mei

%Meister 2006

@article{Meister06,
author = {Daniel Meister},
title = {Two characterisations of minimal triangulations of {$2K_2$}-free graphs},
journal = dm, volume = 306, year = 2006, pages = {3327-3333}}

%Meister 2010

@article{MeisterTV10,
author = {Daniel Meister and Jan Arne Telle and Martin Vatshelle},
title = {Recognizing digraphs of {K}elly-width 2},
journal = dam, volume = 158, year = 2010, pages = {741-746}}

%Men

@article{Menger27,
author = {K. Menger},
title = {Zur Allgemeinen {K}urventheorie},
journal = fundmath, volume = 10, year = 1927, pages = {96-115}}

%Mes

@article{MessingerNP08,
author = {M. E. Messinger and R. J. Nowakowski and P. Pra{\l}at},
title = {Cleaning a network with brushes},
journal = tcs, volume = 399, year = 2008, pages = {191-205}}

%Mez

@article{MezziniM10,
author = {Mauro Mezzini and Marina Moscarini},
title = {Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable {M}arkov network},
journal = tcs, volume = 411, year = 2010, pages = {958-966}}

%Mi

%Mil

@article{Miller83,
author = {Gary L. Miller},
title = {Isomorphism of $k$-contractible graphs: A generalization of bounded valence and bounded genus},
journal = ic, volume = 56, year = 1983, pages = {1-23}}

@inproceedings{MillerR85,
author = {Gary L. Miller and John Reif},
title = {Parallel Tree Contraction and its Application},
booktitle = focs85, year = 1985, pages = {478-489}}

@article{Miller86,
author = {Gary L. Miller},
title = {Finding small simple cycle separators for 2-connected planar graphs},
journal = jcss, volume = 32, year = 1986, pages = {265-279}}

@inproceedings{MillerS86,
author = {Z. Miller and Ivan Hal Sudborough},
title = {Polynomial Algorithms for Recognizing Small Cutwidth in Hypergraphs},
booktitle = {Proc. Aegean Workshop on Computing, VLSI algorithms and
architecture AWOC '86, Springer Verlag Lecture Notes in Computer
Science, Vol. 227},
year = 1986,
pages = {252-260}
}

@article{Miller88,
author = {Z. Miller},
title = {A linear algorithm for topological bandwidth in degree 3 trees},
journal = siamjc, volume = 17, year = 1988, pages = {1018-1035}}

@incollection{MillerR89,
author = {Gary L. Miller and John Reif},
title = {Parallel Tree Contraction. {P}art 1: {F}undamentals},
booktitle = {Advances in Computing Research 5: Randomness and Computation},
editor = {S. Micali},
publisher = {JAI Press, Greenwich, CT},
pages = {47-72},
year = 1989},

@article{MillerR91,
author = {Gary L. Miller and John Reif},
title = {Parallel Tree Contraction. {P}art 2: {F}urther applications},
journal = siamjc, year = 1991, pages = {1128 - 1147}, volume = 20}

%Mis

@inproceedings{MishraRSS07,
author = {S. Mishra and V. Raman and S. Saurabh and S. Sikdar and C. R. Subramanian},
title = {The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number},
editor = {Takeshi Tokuyama},
booktitle = isaac07, publisher = lncs4835, year = 2007, pages = {268-279}}

%Mit

@article{Mitchell79,
author = {S. L. Mitchell},
title = {Linear algorithms to recognize outerplanar and maximal
outerplanar graphs},
journal = ipl, volume = 9, pages = {229-232}, year = 1979 }

@article{MitchellCH79,
author = {S. L. Mitchell and E. J. Cockayne and S. T. Hedetniemi},
title = {Linear algorithms on recursive representations of trees},
journal = jcss, volume = 18, year = 1979, pages = {76-85}}

@article{MitchellH79,
author = {Sandra L. Mitchell and Stephen T. Hedetniemi},
title = {Linear algorithms for edge-coloring trees and unicyclic graphs},
journal = ipl, volume = 9, year = 1979, pages = {110-112}}

@article{Mittal88,
author = {Hari Ballabh Mittal},
title = {A fast backtrack algorithm for graph isomorphism},
journal = ipl, volume = 29, year = 1988, pages = {105-110}}

@inproceedings{Miyano87,
author = {Satoru Miyano},
title = {The lexicographically first maximal subgraph problems: {P}-completeness and {NC} algorithms},
booktitle = icalp87, publisher = lncs267, year = 1987, pages = {425-234}}

@article{Miyano88,
author = {Satoru Miyano},
title = {A Parallelizable Lexicographically First Maximal Edge-Induced Subgraph Problem},
journal = ipl, volume = 27, pages = {75-78}, year = 1988 }

%Mo

%Moe

@article{MoehringR84,
author = {Rolf H. M{\"{o}}hring and F. J. Radermacher},
title = {Substitution decomposition and connections with combinatorial
optimization},
journal = adm, volume = 19, year = 1984, pages = {257-356}}

@inproceedings{Moehring85,
author = {Rolf H. M{\"{o}}hring},
title = {Algorithmic aspects of comparability graphs and interval graphs},
booktitle = {Graphs and Order},
editor = {I. Rival},
pages = {41-101},
year = 1985,
publisher = {Reidel},
address = {Dordrecht}
}

@article{Moehring856,
author = {Rolf H. M{\"{o}}hring},
title = {Algorithmic aspects of the substitution decomposition in optimization
over relations, set systems and boolean functions},
journal = aor, volume = 4, year = {1985/1986}, pages = {195-225}}

@inproceedings{Moehring89,
author = {Rolf H. M{\"{o}}hring},
title = {Computationally tractable classes of ordered sets},
booktitle = {Algorithms and Order},
editor = {I. Rival},
publisher = {Kluwer Acad. Publ.},
address = {Dordrecht},
year = 1989}

@inproceedings{Moehring90,
author = {Rolf H. M{\"{o}}hring},
title = {Graph Problems Related to Gate Matrix Layout and {PLA}
Folding},
booktitle = {Computational Graph Theory, Comuting Suppl. 7},
editor = {E. Mayr and H. Noltemeier and M. Sys{\l}o},
publisher = {Springer Verlag}, pages = {17-51}, year = 1990}

@article{Moehring96,
author = {Rolf H. M{\"{o}}hring},
title = {Triangulating graphs without asteroidal triples},
journal = dam, volume = 64, year = 1996, pages = {281-287}}

%Moh

@article{MoharR96,
author = {Bojan Mohar and Neil Robertson},
title = {Disjoint Essential Cycles},
journal = jctb, volume = 68, year = 1996, pages = {324-349}}

@article{MoharR96a,
author = {Bojan Mohar and Neil Robertson},
title = {Planar Graphs on Nonplanar Surfaces},
journal = jctb, volume = 68, year = 1996, pages = {87-111}}

@book{MoharT2001,
author = {Bojan Mohar and Carsten Thomassen},
title = {Graphs on Surfaces},
year = {2001},
publisher = {The Johns Hopkins University Press},
address = {Baltimore}
}

%Mon

@article{Monien85,
author = {Burkhard Monien},
title = {How to find long paths efficiently},
journal = adm, volume = 25, pages = {239-254}, year = 1985 }

@article{MonienS85,
author = {Burkhard Monien and Ival Hal Sudborough},
title = {Bandwidth-Constrained {NP}-Complete Problems},
journal = tcs, volume = 41, year = 1985, pages = {141-167}}

@article{Monien86,
author = {Burkhard Monien},
title = {The Bandwidth Minimization Problem for Caterpillars with Hair
Length 3 is {NP}-complete},
journal = sjadm, volume = 7, year = 1986, pages = {505-512}}

@article{MonienS88,
author = {Burkhard Monien and Ival Hal Sudborough},
title = {Min Cut is {NP}-complete for Edge Weighted Trees},
journal = tcs, volume = 58, year = 1988, pages = {209-229}}

@article{MonmaW86,
author = {Clyde L. Monma and Victor K. Wei},
title = {Intersection Graphs of Paths in a Tree},
journal = jctb, volume = 41, year = 1986, pages = {141-181}}

%Mor

@article{MoranW91,
author = {Shlomo Moran and Yaron Wolfstahl},
title = {Optimal covering of cacti by vertex-disjoint paths},
journal = tcs, volume = 84, year = 1991, pages = {179-187}}

@inproceedings{MoranS05,
author = {Shlomo Moran and Sagi Snir},
title = {Convex recolorings of strings and trees: Definitions, hardness results, and algorithms},
editor = {Frank K. H. A. Dehne and Alejandro L\'{o}pez-Ortiz and J\"{o}rg-R\"{u}dinger Sack},
booktitle = wads05, publisher = lncs3608, year = 2005, pages = {218-232}}

@inproceedings{MoranS05a,
author = {Shlomo Moran and Sagi Snir},
title = {Efficient Approximation of Convex Recolorings},
booktitle = {Proceedings APPROX 2005: 8th International Workshop on
Approximation Algorithms for Combinatorial Optimization Problems, published
with Proceedings RANDOM 2005},
publisher = lncs3624,
pages = {192-208}, year = 2005}

@article{MoranS07,
author = {Shlomo Moran and Sagi Snir},
title = {Efficient approximation of convex recolorings},
journal = jcss, volume = 73, year = 2007, pages = {1078-1089}}

@article{MoranS08,
author = {Shlomo Moran and Sagi Snir},
title = {Convex recolorings of strings and trees: {D}efinitions, hardness results and algorithms},
journal = jcss, volume = 74, year = 2008, pages = {850-869}}

%Mos

@phdthesis{Mosbah92,
author = {Mohamed H\'{e}di Mosbah},
title = {Constructions d'Algorithmes Pour les Graphes Structur\'{e}s par des M{\'e}thodes Alg\'{e}briques et Logiques},
year = 1992,
school = {Universit{\'e} Bordeaux-I}}

@inproceedings{Mosbah93,
author = {Mohamed H\'{e}di Mosbah},
title = {Probabilistic graph grammars},
editor = {Ernst W. Mayr},
booktitle = wg92, year = 1993, publisher = lncs657, pages = {236-247}}

@inproceedings{Moser09,
author = {Hannes Moser},
title = {A problem kernelization for graph packing},
editor = {Mogens Nielsen and Anton{\'{\i}}n Kucera and Peter Bro Miltersen and Catuscia Palamidessi and Petr Tuma and Frank D. Valencia},
booktitle = sofsem09, publisher = lncs5404, year = 2009, pages = {401-412}}

@article{MoserS09,
author = {Hannes Moser and Somnath Sikdar},
title = {The parameterized complexity of the induced matching problem},
journal = dam, volume = 157, year = 2009, pages = {715-727}}

%Mot

@mastersthesis{Motte93,
author = {Nikolas Motte},
title = {Algorithmen zur Berechnung der Baumweite von Graphen},
school = {University of Passau, Germany},
year = 1993}

@inproceedings{MotwaniRS88,
author = {Rajeev Motwani and Arvind Raghunathan and Huzur Saran},
title = {Constructive results from graph minors: {L}inkless embeddings},
booktitle = focs88, year = 1988, pages = {398-407}}

%Mu

@article{MullerB87,
author = {H. M\"{u}ller and A. Brandst\"{a}dt},
title = {The {NP}-completeness of {Steiner Tree} and {Dominating Set} for chordal bipartite graphs},
journal = tcs, volume = 53, year = 1987, pages = {157-165},
remark = {The page number may be wrong}}

@article{MullerS89,
author = {John H. Muller and Jeremy Spinrad},
title = {Incremental Modular Decomposition},
journal = jacm, volume = 36, year = 1989, pages = {1-19}}

@article{MullerU10,
author = {Haiko M\"{u}ller and Ruth Urner},
title = {On a disparity between relative cliquewidth and relative {NLC}-width},
journal = dam, volume = 158, year = 2010, pages = {828-840}}

%Mv

%Mx

%My

@article{MyungLT95,
author = {Y. S. Myung and C. H. Lee and D. W. Tcha},
title = {On the generalized minimum spanning tree problem},
journal = networks, year = 1995, volume = 26, pages = {231-241}}

%Mz

%N

%Na

%Nag

@article{NagamochiI92,
author = {Hiroshi Nagamochi and T. Ibaraki},
title = {A linear-time algorithm for finding a sparse $k$-connected spanning
subgraph of a $k$-connected graph},
journal = alg, volume = 7, year = 1992, pages = {583-596}}

@article{NagamochiK06,
author = {Hiroshi Nagamochi and Taizo Kawada},
title = {Minmax subtree cover problem on cacti},
journal = dam, volume = 154, year = 2006, pages = {1254-1263}}

%Nak

@article{NakanoON94,
author = {Shin-Ichi Nakano and Takashi Oguma and Tako Nishizeki},
title = {A linear time algorithm for c-triangulating three-colored graphs},
journal = {Trans. Institute of Electronics, Information and Communication, 
Eng., A.}, volume = {377-A}, number = 3, pages = {543-546}, year = 1994,
note = {In Japanese}}

@article{NakayamaM07,
author = {Shin-Ichi Nakayama and Shigeru Masuyama},
title = {A polynomial time algorithm for obtaining minimum edge ranking on
two-connected outerplanar graphs},
journal = ipl, volume = 103, year = 2007, pages = {211-250}}

%Nao

@article{NaorNS87,
author = {Joseph Naor and Moni Naor and Alejandro A. Sch\"{a}ffer},
title = {Fast Parallel Algorithms for Chordal Graphs},
journal = siamjc, volume = 18, year = 1989, pages = {327-349}}

@article{NaorN90,
author = {Joseph Naor and Mark B. Novick},
title = {An efficient reconstruction of a graph from its line graph in
parallel},
journal = ja, year = 1990, volume = 11, pages = {132-143}}

@inproceedings{NaorGM90,
author = {Dalit Naor and Dan Gusfield and Charles Martel},
title = {A Fast Algorithm for Optimally Increasing the
Edge-Connectivity},
booktitle = focs90, pages = {698-707}, year = 1990 }

%Nar

@techreport{NarasimhanM88,
author = {Giri Narasimhan and Rachel Manber},
title = {A Generalization of {L}ovasz's Sandwich Theorem},
number = 800,
institution = {Computer Science Dept., University of Wisconsin-Madison},
year = 1988
}

@techreport{NarasimhanM88a,
author = {Giri Narasimhan and Rachel Manber},
title = {Stability Number and Chromatic Number of Tolerance Graphs},
number = 788,
institution = {Computer Science Dept., University of Wisconsin-Madison},
year = 1988
}

@article{Narasimhan89,
author = {Giri Narasimhan},
title = {A note on the Hamiltonian Circuit problem on Directed Path
Graphs},
journal = ipl, volume = 32, year = 1989, pages = {167-170}}

@phdthesis{Narayanan89,
author = {{Ch.} Narayanan},
title = {Fast Parallel Algorithms and Enumeration Techniques for Partial $k$-Trees},
school = {The Clemson University},
month = {August}, year = 1989, pages = {i-vii,1-116},
note = {Report No. URI-071}}

@article{NarayananN98,
author = {Lata Narayanan and Naomi Nishimura},
title = {Interval routing on $k$-trees},
journal = ja, volume = 26, year = 1998, pages = {325-369}}

%Nas

@article{NashW65,
author = {C. {Nash-Williams}},
title = {On well-quasi ordering infinite trees},
journal = {Proceedings of the Cambridge Philosophical Society}, volume = 61, year = 1965, pages = {697-720}}

%Nat

@article{NatanzonSS00,
author = {Assaf Natanzon and Ron Shamir and Roded Sharan},
title = {A Polynomial Approximation Algorithm for the Minimum Fill-In
Problem},
journal = sjdm, volume = 30, pages = {1067-1079}, year = 2000}

@article{NatarajanW78,
author = {K. S. Natarajan and L. J. White},
title = {Optimum domination in weighted trees},
journal = ipl, volume = 7, year = 1978, pages = {261-265}}

%Nau

@techreport{Naumann94,
author = {Valeska Naumann},
title = {Measuring the distance to series-parallel graphs by path
expressions},
number = {376/1994}, year = 1994,
institution = {Technische Universit\"{a}t Berlin},
address = {Berlin, Germany}}

%Ne

%Nem

@article{NemhauserT75,
author={G. L. Nemhauser and L. E. Trotter},
title = {Vertex packing: Structural properties and algorithms},
journal = mp, year = 1975, volume = 8, pages = {232-248}}

%Ner

@article{NerodeRY96,
author = {Anil Nerode and Jeffrey B. Remmel and Alexander Yakhnis},
title = {McNaughton games and extracting strategies for concurrent programs},
journal = apal, volume = 78, year = 1996, pages = {203-242}}

%Nes

@article{NesetrilZ96,
author = {Jaroslav Ne\~{s}et\~{r}il and Xuding Zhu},
title = {On bounded treewidth duality of graphs},
journal = jgt, volume = 23, pages = {151-162}, year = 1996}

@article{NesetrilS01,
author = {Jaroslav Ne\~{s}et\~{r}il and E. Sopena},
title = {On the oriented game chromatic number},
journal = ejc, volume = 8, year = 2001, number = 2, pages = {R14}}

@article{NesetrilM06,
author = {Jaroslav Ne\~{s}et\~{r}il and Patrice Ossona de Mendez},
title = {Tree-depth, subgraph coloring and homomorphism bounds},
journal = ejcom, volume = 27, year = 2006, pages = {1022-1041}}

%Neu

@article{NeufeldtC85,
author = {E. M. Neufeldt and C. J. Colbourn},
title = {The most reliable series-parallel networks},
journal = networks, volume = 15, year = 1985, pages = {27-32}}

%Ni

%Nie

@booklet{Niedermeier02,
author = {R. Niedermeier},
title = {Invitation to fixed-parameter algorithms},
year = 2002,
note = {Habilitation Thesis},
address = {Universit\"{a}t T\"{u}bingen}}

@book{Niedermeier06,
author = {Rolf Niedermeier},
title = {Invitation to fixed-parameter algorithms},
publisher = {Oxford University Press},
series = {Oxford Lecture Series in Mathematics and Its Applications},
year = 2006}

%Nik

@article{NikolopoulosP06,
author = {Stavros D. Nikolopoulos and Leonidas Palios},
title = {Minimal separators in {$P_4$}-sparse graphs},
journal = dm, volume = 306, pages = {381-392}, year = 2006}

%Nis

@article{NishimuraRT00,
author = {Naomi Nishimura and Prabhakar Ragde and Dimitrios M. Thilikos},
title = {Finding smallest supertrees under minor containment},
journal = ijfcs, volume = 11, year = 2000, pages = {445-466}}

@inproceedings{NishimuraRT04,
author = {Naomi Nishimura and Prabhakar Ragde and Dimitrios M. Thilikos},
title = {Smaller kernels for hitting set problems of constant arity},
editor = {R. G. Downey and M. R. Fellows},
booktitle = iwpec04, year = 2004, publisher = lncs3162, pages = {239-250}}

@article{Nisse09,
author = {Nicolas Nisse},
title = {Connected graph searching in chordal graphs},
journal = dam, volume = 157, year = 2009, pages = {2603-2610}}

@article{NisseS09,
author = {Nicolas Nisse and David Soguet},
title = {Graph searching with advice},
journal = tcs, volume = 410, year = 2009, pages = {1307-1318}}

%No

%Nob

@article{Noble98,
author = {S. D. Noble},
title = {Evaluating the {T}utte polynomial for graphs of bounded tree-width},
journal = cpc, year = 1998, pages = {307-321}, volume = 7}

%Nog

@article{NogaYZ95,
author = {Noga Alon and Raphael Yuster and Uri Zwick},
title = {Color-coding},
journal = jacm, volume = 42, year = 1995, pages = {855-856}}

%Nor

@article{NorineSTW06,
author = {Serguei Norine and Paul Seymour and Robin Thomas and Paul Wollan},
title = {Proper minor-closed families are small},
journal = jctb, volume = 96, year = 2006, pages = {754-757}}

%Nov

@techreport{Novick89,
author = {Mark B. Novick},
title = {Fast Parallel Algorithms for the Modular Decomposition},
institution = {Department of Computer Science, Cornell University},
number = {TR 89-1016}, year = 1989 }

%O

%Oc

@article{OchemP08,
author = {Pascal Ochem and Alexandre Pinlou},
title = {Oriented colorings of partial 2-trees},
journal = ipl, volume = 108, year = 2008, pages = {82-86}}

%Og

@article{OgawaHS03,
author = {M. Ogawa and Z. Hu and I. Sasano},
title = {Iterative-free program analysis},
journal = {ACM SIGPLAN Notices}, volume = 38, year = 2003, pages = {111-123}}

%Oh

%Ohs

@article{Ohsugi10,
author = {Hidefumi Ohsugi},
title = {Normality of cut polytopes of graphs is a minor closed property},
journal = dm, volume = 310, year = 2010, pages = {1160-1166}}

%Oht

@article{Othsuki76,
author = {T. Ohtsuki},
title = {A fast algorithm for finding an optimal ordering in the
vertex elimination ordering of a graph},
journal = siamjc, volume = 5, year = 1976, pages = {133-145}}

@article{OthsukiCF76,
author = {T. Ohtsuki and L. K. Cheung and T. Fujisawa},
title = {Minimal triangulation of a graph and optimal pivoting ordering
in a sparse matrix},
journal = jmaa, volume = 54, pages = {622-633}, year = 1976}

@article{OhtsukiMKF81,
author = {T. Ohtsuki and H. Mori and T. Kashiwabara and T. Fujisawa},
title = {On minimal augmentation of a graph to obtain an interval graph},
journal = jcss, volume = 22, year = 1981, pages = {60-97}}

%Ol

%Ola

@article{Olariu89,
author = {Stephan Olariu},
title = {A decomposition for strongly perfect graphs},
journal = jgt, volume = 13, number = 3, year = 1989, pages = {301-311}}

@article{Olariu91,
author = {Stephan Olariu},
title = {On the structure of unbreakable graphs},
journal = jgt, volume = 15, number = 4, year = 1991, pages = {349-373}}

@article{OlariuSZ92,
author = {Stephan Olariu and James L. Schwing and Jingyuan Zhang},
title = {Optimal parallel encoding and decoding algorithms for trees},
journal = ijfcs, volume = 3, number = 1, year = 1992, pages = {1-10}}

%Ole

@article{OlesenM02,
author = {Kristian G. Olesen and Anders L. Madsen},
title = {Maximal prime subgraph decomposition of {B}ayesian networks},
journal = {IEEE Trans. on Systems, Man, and Cybernetics, Part B},
volume = 32, year = 2002, pages = {21-31}}

%Or

%Ord

%author = {F. Ord\'o\~nez and B. Krishnamachari},

@article{OrdonezK04,
author = {F. Ordonez and B. Krishnamachari},
title = {Optimal information extraction in energy-limited wireless sensor networks},
journal = {IEEE Journal on Selected Areas in Communications},
volume = 22, year = 2004, number = 6, pages = {1121-1129}}

%Orl

@article{OrlinBB81,
author = {James B. Orlin and Maurizio A. Bonucelli and Daniel P.  Bovet},
title = {An {$O(n^2)$} algorithm for coloring proper circular arc graphs},
journal = sjadm, volume = 2, year = 1981, pages = {88-93}}

%Os

%Ost

@article{Ostrovskii10,
author = {M. I. Ostrovskii},
title = {Minimum congestion spanning trees in planar graphs},
journal = dm, volume = 310, year = 2010, pages = {1204-1209}}

%Ou

%Oum

%Oum 2005

@article{Oum05,
author = {{Sang-il} Oum},
title = {Rank-width and vertex-minors},
journal = jctb, volume = 95, year = 2005, pages = {79-100}}

%Oum 2006

@article{OumS06,
author = {{Sang-il} Oum and Paul Seymour},
title = {Approximating clique-width and branch-width},
journal = jctb, volume = 96, year = 2006, pages = {514-528}}

%Oum 2007

@article{OumS07,
author = {{Sang-il} Oum and Paul Seymour},
title = {Testing branch-width},
journal = jctb, volume = 97, year = 2007, pages = {385-393}}

%Oum 2008

@article{Oum08,
author = {{Sang-il} Oum},
title = {Rank-width and well-quasi ordering},
journal = sjdm, volume = 22, year = 2008, pages = {666-682}}

@article{Oum08a,
author = {{Sang-il} Oum},
title = {Rank-width is less than or equal to branch-width},
journal = jgt, volume = 57, year = 2008, pages = {239-244}}

@article{Oum08b,
author = {{Sang-il} Oum},
title = {Approximating rank-width and clique-width quickly},
journal = acmtalg, volume = 5, number = 1, year = 2008},

%Oum 2009

@article{Oum09,
author = {Sang-il Oum},
title = {Computing rank-width exactly},
journal = ipl, volume = 109, year = 2009, pages = {730-738}}

%P

%Pa

%Pan

@article{PandaD03,
author = {B. S. Panda and S. K. Das},
title = {A linear time recognition algorithm for proper interval graphs},
journal = ipl, volume = 87, year = 2003, pages = {153-161}}

%Pap

%Papadimitriou 1975

@article{Papadimitriou75,
author = {Christos H. Papadimitriou},
title = {Games Against Nature},
journal = jcss, volume = 31, year = 1985, pages = {288-301}}

%Papadimitriou 1976

@article{Papadimitriou76,
author = {Christos H. Papadimitriou},
title = {The {NP}-completeness of the bandwidth minimization problem},
journal = comp, volume = 16, year = 1976, pages = {263-270}}

%Papadimitriou 1981

@article{PapadimitriouY81,
author = {Christos H. Papadimitriou and Mihalis Yannakakis},
title = {The clique problem for planar graphs},
journal = ipl, volume = 13, year = 1981, pages = {131-133}}

%Papadimitriou 1982

@book{PapadimitriouS82,
author = {Christos H. Papadimitriou and K. Steiglitz},
title = {Combinatorial Optimization: Algorithms and Complexity},
publisher = {Prentice Hall},
address = {Englewoods Cliffs, NJ},
year = 1982 }

%Papadimitriou 1984

@article{Papadimitriou84,
author = {Christos H. Papadimitriou},
title = {On the complexity of unique solutions},
journal = jacm, volume = 31, year = 1984, pages = {392-400}}

%Papadimitriou 1989

@techreport{PapadimitriouS89,
author = {Christos H. Papadimitriou and Martha Sideris},
title = {The Bisection Width of Grid Graphs},
number = {89.0584},
institution = {CTI Patras},
year = 1989}

%Papadimitriou 1994

@book{Papadimitriou94,
author = {Christos H. Papadimitriou},
title = {Computational Complexity},
year = 1994, 
publisher = {Addison-Wesley},
address = {Reading, Mass.}}

@article{PapakostasT98,
author = {Achilleas Papakostas and Ioannis G. Tollis},
title = {Algorithms for area-efficient orthogonal drawings},
journal = {Computation Geometry: Theory and Applications}, volume = 9, year = 1998, pages = {83-110}}

%Par

%Park

@inproceedings{Park02,
author = {J. D. Park},
title = {MAP complexity results and approximation methods},
editor = {A. Darwiche and N. Friedman},
booktitle = uai02, publisher = {Morgan Kaufmann}, pages = {388-396}, year = 2002}

@article{ParkD04,
author = {J. D. Park and A. Darwiche},
title = {Complexity results and approximation settings for {MAP} explanations},
journal = jair, volume = 21, year = 2004, pages = {101-133}}

%Parn

@article{ParnasR07,
author = {Michal Parnas and Dana Ron},
title = {Approximating the minimum vertex cover in sublinear time and a
connection to distributed algorithms},
journal = tcs, volume = 381, year = 2007, pages = {183-196}}

%Parr

@unpublished{Parra94,
author = {Andreas Parra},
title = {Triangulating bitolerance graphs},
note = {Manuscript},
year = 1994}

@misc{Parra95,
author = {Andreas Parra},
note = {Personal communication}, year = 1995}

@phdthesis{Parra96,
author = {Andreas Parra},
title = {Structural and Algorithmic Aspects of Chordal Graph Embeddings},
year = 1996,
school = {Technical University Berlin}}

@article{ParraS97,
author = {Andreas Parra and Petra Scheffler},
title = {Characterizations and algorithmic applications of chordal graph
embeddings},
journal = dam, volume = 79, pages = {171-188}, year = 1997}

@article{Parra98,
author = {Andreas Parra},
title = {Triangulating multitolerance graphs},
journal = dam, volume = 84, year = 1998, pages = {183-197}}

%Pars

@inproceedings{Parsons76,
author = {T. D. Parsons},
title = {Pursuit Evasion in a Graph},
booktitle = {Theory and Application of Graphs},
editor = {Y. Alavi and D. R. Lick},
publisher = {Springer Verlag},
address = {Berlin},
year = 1976, pages = {426-441}}

%Part

@article{Parter61,
author = {S. Parter},
title = {The use of linear graphs in {Gauss} elimination},
journal = {SIAM Review}, volume = 3, pages = {119-130}, year = 1961}

%Pau

%Paul 1978

@article{Paul78,
author = {J. L. Paul},
title = {Tic-Tac-Toe in $n$-dimensions},
journal = {Math. Mag.}, year = 1978, pages = {45-49}, volume = 51 }

%Paul 1980

@article{PaulPR80,
author = {W. J. Paul and E. J. Prauss and R. Reischuk},
title = {On alternation},
journal = ai, volume = 14, pages = {243-255}, year = 1980 }

@article{PaulR80,
author = {W. J. Paul and R. Reischuk},
title = {On alternation {II}},
journal = ai, volume = 14, pages = {391-403}, year = 1980 }

%Paul 2005

@inproceedings{PaulT05,
author = {Christophe Paul and Jan Arne Telle},
title = {New tools and simpler algorithms for branchwidth},
booktitle = esa05, publisher = lncs3669, year = 2005, pages = {379-390}}

%Paul 2009

@article{PaulT09,
author = {Christophe Paul and Jan Arne Telle},
title = {Branchwidth of chordal graphs},
journal = dam, volume = 157, year = 2009, pages = {2718-2725}}

%Paw

@article{PawagiGR87,
author = {Shaunak R. Pawagi and P. S. Gopalakrishnan and I. V.
Ramakrishnan},
title = {Computing dominators in parallel},
journal = ipl, volume = 24, year = 1987, pages = {217-221}}

%Pe

%Pea

@book{Pearl88,
author = {J. Pearl},
title = {Probablistic Reasoning in Intelligent Systems: Networks of Plausible
Inference},
publisher = {Morgan Kaufmann}, year = 1988, address = {Palo Alto}}

%Pec

@article{PeckS92,
author = {G. W. Peck and A. Shastri},
title = {Bandwidth of theta graphs with short paths},
journal = dm, volume = 103, pages = {177-187}, year = 1992}

%Pen

@article{PengHHKT00,
author = {Sheng-Lung Peng and Chin-Wen Ho and Tsan-Shen Hsu and Ming-Tat Ko
and {Chuan Yi} Tang},
title = {Edge and node searching problems on trees},
journal = tcs, volume = 240, pages = {429-446}, year = 2000}

@article{PengKHHT00,
author = {S.-L. Peng and M.-T. Ko and C.-W. Ho and T.-S. Hsu and C. Y. Tang},
title = {Graph searching on some subclasses of chordal graphs},
journal = alg, volume = 27, pages = {395-426}, year = 2000}

@article{PengC06,
author = {Sheng-Lung Peng and Chi-Kang Chen},
title = {On the interval completion of chordal graphs},
journal = dam, volume = 154, pages = {1003-1010}, year = 2006}

%Per

@inproceedings{PerkovicR99,
author = {Ljubomir Perkovi{\'{c}} and Bruce Reed},
title = {An improved algorithm for finding tree decompositions of small width},
editor = {Peter Widmayer and Gabriele Neyer and Sephan Eidenbenz},
booktitle = wg99, publisher = lncs1665, year = 1999, pages = {148-154}}

@article{PerkovicR00,
author = {Ljubomir Perkovi{\'{c}} and Bruce Reed},
title = {An improved algorithm for finding tree decompositions of small width},
journal = ijfcs, volume = 11, year = 2000, pages = {365-371}}

%Per

@article{PerlS78,
author = {Y. Perl and Y. Shiloach},
title = {Finding two disjoint paths between two pairs of vertices in a
graph},
journal = jacm, year = 1978, volume = 23, pages = {1-9}}

%Pey

@article{Peyton01,
author = {B. W. Peyton},
title = {Minimal orderings revisited},
journal = sjmaa, volume = 23, year = 2001, pages = {271-294}}

%Pf

@article{PfaffLH84,
author = {J. Pfaff and R. Laskar and S. T. Hedetniemi},
title = {Linear algorithms for independent domination and total
domination in series-parallel graphs},
journal = cn, volume = 45, year = 1984, pages = {71-82}}

%Ph

%Phi

@inproceedings{PhilipRS09,
author = {Geevarghese Philip and Venkatesh Raman and Somnath Sikdar},
title = {Solving Dominating Set in larger classes of graphs: {FPT} algorithms
and polynomial kernels},
editor = {Amos Fiat and Peter Sanders},
booktitle = esa09, publisher = lncs5757, year = 2009, pages = {694-705}}

%Pl

@inproceedings{PlehnV90,
author = {J\"{u}rgen Plehn and Bernd Voigt},
title = {Finding minimally weighted subgraphs},
editor = {Rolf H. M\"{o}hring},
booktitle = wg90, publisher = lncs484, year = 1991, pages = {18-29}}

%Pi

%Pie

@article{Pietrzak03,
author = {Krzysztof Pietrzak},
title = {On the parameterized complexity of the fixed alphabet {\em shortest
common supersequence} and {\em longest common subsequence} problems},
journal = jcss, volume = 67, year = 2003, pages = {757-771}}

%Pin

@article{PinlouS06,
author = {Alexandre Pinlou and \'{E}ric Sopena},
title = {Oriented vertex and arc colorings of outerplanar graphs},
journal = ipl, volume = 100, year = 2006, pages = {97-104}}

%Po

%Pon

@inproceedings{PontaHN08,
author = {Oriana Ponta and Falk H\"{u}ffner and Rolf Niedermeier},
title = {Speeding up Dynamic Programming for Some {NP}-Hard Graph Recoloring
Problems},
editor = {M. Agrawal and D.-Z. Du and Z. Duan and A. Li},
booktitle = tamc08, publisher = lncs4978, year = 2008, pages = {490-501}}

%Pr

%Pri

@phdthesis{Prieto05,
author = {Elena Prieto},
title = {Systematic Kernelization in {FPT} Algorithm Design},
school = {University of Newcastle},
address = {Australia}, year = 2005}

@article{PrietoS06,
author = {Elena Prieto and Christian Sloper},
title = {Looking at the stars},
journal = tcs, volume = 351, pages = {437-445}, year = 2006}

%Pro

%Proskurowski 1979

@article{Proskurowski79,
author = {Andrzej Proskurowski},
title = {Minimum dominating cycles in two-trees},
journal = ijcis, volume = 8, number = 5, year = 1979, pages = {405-417}}

%Proskurowski 1980

@article{Proskurowski80,
author = {Andrzej Proskurowski},
title = {Centers of maximal outerplanar graphs},
journal = jgt, year = 1980, volume = 4, number = 2, pages = {75-79}}

@article{Proskurowski80a,
author = {Andrzej Proskurowski},
title = {Centers of 2-trees},
journal = adm, volume = 9, year = 1980, pages = {1-5}}

%Proskurowski 1981

@article{Proskurowski81,
author = {Andrzej Proskurowski},
title = {Recursive graphs, recursive labelings and shortest paths},
journal = siamjc, volume = 16, year = 1981, pages = {391-397}}

@article{ProskurowskiS81,
author = {Andrzej Proskurowski and Maciej M. Sys{\l}o},
title = {Minimum dominating cycles in outerplanar graphs},
journal = ijcis, volume = 10, year = 1981, pages = {127-139}}

%Proskurowski 1984

@article{Proskurowski84,
author = {Andrzej Proskurowski},
title = {Separating subgraphs in $k$-trees: {C}ables and Caterpillars},
journal = dm, volume = 49, year = 1984, pages = {275-285}}

%Proskurowski 1986

@article{ProskurowskiS86,
author = {Andrzej Proskurowski and Maciej M. Sys{\l}o},
title = {Efficient Vertex- and Edge-colorings of Outerplanar Graphs},
journal =sjadm, volume = 7, year = 1986, pages = {131-136}}

%Proskurowski 1989

@techreport{Proskurowski89,
author = {Andrzej Proskurowski},
title = {Maximal Graphs of Pathwidth $k$ or Searching a Partial
$k$-caterpillar},
number = {CIS-TR-89-17},
institution = {Dept. of Computer and Information Science, University
of Oregon},
year = 1989}

%Proskurowski 1990

@article{ProskurowskiS90,
author = {Andrzej Proskurowski and Maciej M. Sys{\l}o},
title = {Efficient Computations in Tree-like Graphs},
journal = {Comput. Suppl.}, volume = 7, year = 1990, pages = {1 - 15}}

%Proskurowski 1993

@inproceedings{Proskurowski93,
author = {Andrzej Proskurowski},
title = {Graph reductions, and techniques for finding minimal forbidden minors},
booktitle = {Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint
Summer Research Conference, Seattle WA, June 1991},
publisher = {American Math. Soc.},
address = {Providence, RI},
editor = {Neil Robertson and Paul Seymour},
note = {Contemp. Math. 147.},
pages = {591-600},
year = 1993}

@article{ProvanB83,
author = {{J. Scott} Provan and Michael O. Ball},
title = {The complexity of counting cuts and of computing the probability that
a network remains connected},
journal = siamjc, volume = 12, number = 4, year = 1983, pages = {777-788}}

%Prz

@article{PrzytyckaC91,
author = {T. Przytycka and D. G. Corneil},
title = {Parallel algorithms for parity graphs},
journal = ja, volume = 12, pages = {96-109}, year = 1991}

%Pu

%Pul

@article{Pullman84,
author = {Normal J. Pullman},
title = {Clique covering of graphs {IV}. {A}lgorithms},
journal = siamjc, volume = 13, year = 1984, pages = {57-75}}

%Pun

@article{PunnenN94,
author = {Abraham P. Punnen and K. P. K. Nair},
title = {A fast and simple algorithm for the bottleneck biconnected spanning
subgraph problem},
journal = ipl, volume = 50, year = 1994, pages = {283-286}}

%Q

%Qu

@article{Quilliot85,
author = {A. Quilliot},
title = {A short note about pursuit games played on a graph with a given genus},
journal = jctb, volume = 38, year = 1985, pages = {89-92}}

%R

%Ra

%Rab

@article{RabinS59,
author = {M. O. Rabin and D. S. Scott},
title = {Finite automata and their decision problems},
journal = {IBM Journal of Research and Development}, volume = 3, year = 1959, pages = {114-125}}

@inproceedings{Rabin65,
author = {M. O. Rabin},
title = {A simple method for undecidability proofs and some applications},
publisher = {North-Holland Publishing Company},
booktitle = {Logic, Methodology and Philosophy of Science},
year = 1965, editor = {Y. {Bar-Hillel}}, pages = {58-68}}

@article{Rabin69,
author = {M. O. Rabin},
title = {Decidability of second-order theories and automata on infinite trees},
journal = {Transactions of the American Mathematical Society}, volume = 141, year = 1969, pages = {1-35}}

@incollection{Rabin77,
author = {M. O. Rabin},
title = {Decidable theories},
booktitle = {Handbook of Mathematical Logic},
editor = {K. J. Barwise},
publisher = {North-Holland Publishing Company},
year = 1977, pages = {595-629}}

@article{RabinV89,
author = {Michael O. Rabin and Vijay V. Vazirani},
title = {Maximum matchings in general graphs through randomization},
journal = ja, volume = 10, year = 1989, pages = {557-567}}

%Rad

@techreport{RadhakrishnanHS92,
author = {Venkatesh Radhakrishnan and Harry B. {Hunt III} and Richard E. Stearns},
title = {On Solving Systems of Linear Equations and Path Problems for Bounded Treewidth Graphs},
institution = {Dept. of Computer Science, SUNY Albany},
number = {92-5},
year = 1992}

@techreport{RadhakrishnanHS93,
author = {Venkatesh Radhakrishnan and Harry B. {Hunt III} and Richard E. Stearns},
title = {Efficient Algorithms for Hierarchical Descriptions with Bounded Treewidth},
institution = {Dept. of Computer Science, SUNY Albany},
number = {93-7},
year = 1993}

%Rai

@inproceedings{RaibleF08,
author = {Daniel Raible and Henning Fernau},
title = {Power domination in {$O^\ast(1.7448^n)$} using reference search trees},
editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga},
booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {136-147}}

%Raj

@unpublished{RajaramanBP93,
author = {Anand Rajaraman and Hari Balakrishnan and C. {Pandu Rangan}},
title = {Modular Decomposition Techniques for Distance-Hereditary Graphs},
note = {Manuscript}, year = 1993}

%Ram

@phdthesis{Ramachandramurthi94,
author = {Siddharthan Ramachandramurthi},
title = {Algorithms for {VLSI} Layout Based on Graph Width Metrics},
school = {Computer Science Department, University of Tennessee},
address = {Knoxville, Tennessee, USA},
year = 1994}

@inproceedings{Ramachandramurthi95,
author = {Siddharthan Ramachandramurthi},
title = {A Lower Bound for Treewidth and its Consequences},
editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer},
booktitle = wg94, publisher = lncs903, year = 1995, pages = {14-25}}

@article{Ramachandramurthi97,
author = {Siddharthan Ramachandramurthi},
title = {The structure and number of obstructions to treewidth},
journal = sjdm, volume = 10, year = 1997, pages = {146-157}}

@article{Ramachandran88,
author = {Vijaya Ramachandran},
title = {Finding a minimum feedback arc set in reducible flow graphs},
journal = ja, volume = 9, pages = {299-313}, year = 1988 }

@article{RamalingamP88,
author = {G. Ramalingam and C. {Pandu Rangan}},
title = {Total Domination in Interval Graphs Revisited},
journal = ipl, volume = 27, year = 1988, pages = {17-22}}

@article{RamalingamP88a,
author = {G. Ramalingam and C. {Pandu Rangan}},
title = {A unified approach to domination problems on interval graphs},
journal = ipl, volume = 27, year = 1988, pages = {271-274}}

@article{RamalingamP90,
author = {G. Ramalingam and C. {Pandu Rangan}},
title = {New sequential and parallel algorithms for interval graph
recognition},
journal = ipl, volume = 34, year = 1990, pages = {215-219}}

%Raman

@inproceedings{RamanSS02,
author = {Venkatesh Raman and Saket Saurabh and C. R. Subramanian},
title = {Faster fixed parameter tractable algorithms for undirected feedback vertex set},
editor = {P. Bose and P. Morin},
booktitle = isaac02, year = 2002, pages = {241 - 248}, publisher = lncs2518}

@article{RamanSS05,
author = {Venkatesh Raman and Saket Saurabh and C. R. Subramanian},
title = {Faster algorithms for feedback vertex set},
journal = {Proceedings 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics, GRACO 2005,
Electronic Notes in Discrete Mathematics},
volume = 19, year = 2005, pages = {273-279}}

@article{RamanS06,
author = {Venkatesh Raman and Saket Saurabh},
title = {Parameterized algorithms for feedback set problems and their duals in
tournaments},
journal = tcs, volume = 351, pages = {446-458}, year = 2006}

@article{RamanS07,
author = {Venkatesh Raman and Somnath Sikdar},
title = {Parameterized complexity of the induced subgraph problem in
directed graphs},
journal = ipl, volume = 104, pages = {79-85}, year = 2007}

%Ran

@techreport{RanderathS05,
author = {B. Randerath and I. Schiermeyer},
title = {Exact Algorithms for Minimum Dominating Set},
type = {Technical Report},
number = {zaik2005-501},
institution = {Universit\"{a}t zu K\"{o}ln, Cologne, Germany},
year = 2005}

%Rao

@article{RaoR89,
author = {A. {Srinivasa Rao} and C. {Pandu Rangan}},
title = {Linear algorithm for domatic number on interval graphs},
journal = ipl, volume = 33, year = 1989, pages = {29-33}}

@article{RaoR89a,
author = {A. {Srinivasa Rao} and C. {Pandu Rangan}},
title = {Optimal parallel algorithms on circular-arc graphs},
journal = ipl, volume = 33, year = 1989, pages = {147-156}}

@article{RaoR90,
author = {Srinivasa {Rao Arikati} and C. {Pandu Rangan}},
title = {Linear algorithm for optimal path cover problem on interval
graphs},
journal = ipl, volume = 34, year = 1990, pages = {149-153}}

%Rau

@article{Rautenbach07,
author = {Dieter Rautenbach},
title = {Dominating and large induced trees in regular graphs},
journal = dm, volume = 307, year = 2007, pages = {3177-3186}}

%Rav

@article{RaviSMRR96,
author = {R. Ravi and R. Sundaram and Madhav V. Marathe and D. J. Rosenkrantz and
S. S. Ravi},
title = {Spanning trees---Short or Small},
journal = sjdm, volume = 9, pages = {178 - 200}, year = 1996}

%Raz

@inproceedings{Razgon06,
author = {Igor Razgon},
title = {Exact Computation of Maximum Induced Forest},
editor = {Lars Arge and Rusins Freivalds},
booktitle = swat06, publisher = lncs4059, year = 2006, pages = {160-171}}

@article{Razgon07,
author = {Igor Razgon},
title = {A {$2^{O(k)}$}poly($n$) algorithm for
the parameterized Convex Recoloring problem},
journal = ipl, volume = 104, pages = {53-58}, year = 2007}

@inproceedings{RazgonS08,
author = {Igor Razgon and B. O'Sullivan},
title = {Almost $2$-{SAT} is Fixed-Parameter Tractable (Extended Abstract)},
editor = {Luca Aceto and Ivan Damg{\aa}rd and Leslie Ann Goldberg and
Magn\'{u}s M. Halld\'{o}rsson and Anna Ing\'{o}lfsd\'{o}ttir and Igor Walukuewics},
booktitle = icalp08-1, year = 2008, publisher = lncs5125, pages = {551-562}}

%Re

%Rea

@inbook{Read93,
author = {Ronald C. Read},
title = {Prospects for Graph Theory Algorithms},
booktitle = {Quo Vadis, Graph Theory},
Xeditor = {J. Gimbel and J. W. Kennedy and L. V, Quintas},
publisher = {Elsevier Science Publishers},
series = {Annals of Discrete Mathematics},
volume = {55},
pages = {201-210},
year = 1993}

%Ree

%Reed 1992

@inproceedings{Reed92,
author = {Bruce Reed},
title = {Finding approximate separators and computing tree-width
quickly},
publisher = {ACM Press}, address = {New York},
booktitle = stoc92, pages = {221-228},
year = 1992}

%Reed 1993

@inproceedings{ReedRSS93,
author = {Bruce A. Reed and N. Robertson and A. Schrijver and Raul D.
Seymour},
title = {Finding disjoint trees in planar graphs in linear time},
booktitle = {Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint
Summer Research Conference, Seattle WA, June 1991},
publisher = {American Math. Soc.},
address = {Providence, RI},
editor = {Neil Robertson and Paul Seymour},
note = {Contemp. Math. 147.},
pages = {295 - 301 },
year = 1993}

%Reed 1997

@incollection{Reed97,
author = {Bruce A. Reed},
title = {Tree width and tangles, a new measure of connectivity and some
applications},
booktitle = {Surveys in Combinatorics}, 
series = {LMS Lecture Note Series},
volume = 241, pages = {87-162}, year = 1997,
publisher = {Cambridge University Press}, address = {Cambridge, UK}}

%Reed 2003

@incollection{Reed03,
author = {Bruce A. Reed},
title = {Algorithmic aspects of tree width},
booktitle = {Recent advances in algorithms and combinatorics},
series = {CMS Books Math. / Ouvrages Math. SMC, 11},
publisher = {Springer}, address = {New York}, pages = {85-107},
year = 2003}

%Reed 2008

@inproceedings{ReedL08,
author = {Bruce A. Reed and Zhentao Li},
title = {Optimization and recognition for {$K_5$}-minor free graphs in linear time},
editor = {Eduardo Sany Laber and Claudson F. Bornstein and Loana Tito Nogueira and Luerbio Faria},
booktitle = latin08, year = 2008, publisher = lncs4957, pages = {206-215}}

%Rei

@article{Reisch80,
author = {S. Reisch},
title = {Gobang ist {PSPACE}-vollst{\"{a}}ndig},
journal = ai, volume = 13, year = 1980, pages = {59-66}}

@article{Reisch81,
author = {S. Reisch},
title = {Hex ist {PSPACE}-vollst{\"{a}}ndig},
journal = ai, volume = 15, year = 1981, pages = {167-191}}

%Ren

@article{RenooijGP02,
author = {Slija Renooij and Linda C. van der Gaag and Simon Parsons},
title = {Context-specific sign-propogation in qualitative probabilistic networks},
journal = ai, volume = 140, year = 2002, pages = {207-230}}

%Ri

%Ric

@article{RichardsL85,
author = {D. Richards and A. L. Liestman},
title = {Finding Cycles of a Given Length},
journal = adm, volume = 27, pages = {249-256}, year = 1985 }

@article{Richards86,
author = {D. Richards},
title = {Finding Short Cycles in Planar Graphs Using Separators},
journal = ja, volume = 7, year = 1986, pages = {249-256}}

@phdthesis{Richey85,
author = {M. B. Richey},
title = {Combinatorial optimization on series-parallel graphs: algorithms and complexity},
school = {School of Industrial and Systems Engineering, Georgia Institute of
Technology},
year = 1985}

%Rie

@article{RiegeRSY07,
author = {Tobias Riege and J\"{o}rg Rothe and Holger Spakowski and Masaki Yamamoto},
title = {An improved exact algorithm for the domatic number problem},
journal = ipl, volume = 101, year = 2007, pages = {101-106}}

%Ro

%Rob

@article{Robson86,
author = {J. M. Robson},
title = {Algorithms for maximum independent sets},
journal = ja, volume = 7, year = 1986, pages = {425-440}}

@techreport{Robson01,
author = {J. M. Robson},
title = {Finding an independent set in time {$O(2^{n/4})$}},
note = {Technical report 1251-01},
institution = {LaBRi, Universit\'{e} Bordeaux}, 
year = 2001}

%Robertson

%Exception to rule: The graph minors papers are numbered to their
%number in the series

@article{RobertsonS1,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {I}. {E}xcluding a Forest},
journal = jctb, year = 1983, volume = 35, pages = {39-61}}

@article{RobertsonS2,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {II}. {A}lgorithmic Aspects of Tree-Width},
journal = ja, year = 1986, volume = 7, pages = {309-322}}

@article{RobertsonS85,
author = {Neil Robertson and Paul D. Seymour},
title = {Disjoint Paths -- A Survey},
journal = sjadm, volume = 6, year = 1985, pages = {300-305}}

@article{RobertsonS3,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {III}. {P}lanar Tree-Width},
journal = jctb, volume = 36, year = 1984, pages = {49-64}}

@article{RobertsonS4,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {IV}. {T}ree-Width and Well-Quasi-Ordering},
journal = jctb, volume = 48, year = 1990, pages = {227-254}}

@article{RobertsonS5,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {V}. {E}xcluding a planar graph},
journal = jctb, volume = 41, year = 1986, pages = {92-114}}

@article{RobertsonS6,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {VI}. {D}isjoint Paths across a Disc},
journal = jctb, volume = 41, year = 1986, pages = {115-138}}

@article{RobertsonS7,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {VII}. {D}isjoint paths on a surface},
journal = jctb, volume = 45, pages = {212-254}, year = 1988}}

@article{RobertsonS8,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {VIII}. {A} {K}uratowski theorem for general
surfaces},
journal = jctb, volume = 48, pages = {255-288}, year = 1990}}

@article{RobertsonS9,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {IX}. {D}isjoint crossed paths},
journal = jctb, volume = 49, pages = {40-77}, year = 1990}}

@article{RobertsonS10,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {X}. {O}bstructions to tree-decomposition},
journal = jctb, volume = 52, year = 1991, pages = {153-190}}

@article{RobertsonS11,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {XI}. {D}istance on a Surface},
journal = jctb, volume = 60, year = 1994, pages = {72-106}}

@article{RobertsonS12,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {XII}. {E}xcluding a Non-planar Graph},
journal = jctb, volume = 64, year = 1995, pages = {240-272}}

@article{RobertsonS13,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {XIII}. {T}he Disjoint Paths Problem},
journal = jctb, volume = 63, year = 1995, pages = {65-110}}

@article{RobertsonS14,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {XIV}. {E}xtending an Embedding},
journal = jctb, volume = 65, year = 1995, pages = {23-50}}

@article{RobertsonS15,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {XV}. {G}iant Steps},
journal = jctb, volume = 68, year = 1996, pages = {112-148}}

@article{RobertsonS16,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {XVI}. {E}xcluding a non-planar graph},
journal = jctb, volume = 89, year = 2003, pages = {43-76}}

@article{RobertsonS17,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {XVII}. {T}aming a vortex},
journal = jctb, volume = 77, year = 1999, pages = {162-210}}

@article{RobertsonS18,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {XVIII}. {T}ree-decompositions and well-quasi ordering},
journal = jctb, volume = 89, year = 2003, pages = {77-108}}

@article{RobertsonS19,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {XIX}. {W}ell-quasi-ordering on a surface},
journal = jctb, volume = 90, year = 2004, pages = {325-385}}

@article{RobertsonS20,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {XX}. {W}agner's conjecture},
journal = jctb, volume = 92, year = 2004, pages = {325-357}}

@article{RobertsonS21,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {XXI}. {G}raphs with unique linkages},
journal = jctb, volume = 99, year = 2009, pages = {583-616}}

@unpublished{RobertsonS22,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {XXII}. {I}rrelevant vertices in linkage problems},
note = {Manuscript},
year = 1992
}

@article{RobertsonS23,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph minors {XXIII}. {N}ash-{W}illiams' immersion conjecture},
journal = jctb, volume = 100, year = 2010, pages = {181-205}}



%Robertson 1984

@article{RobertsonS84,
author = {Neil Robertson and Paul D. Seymour},
title = {Generalizing {K}uratowskis Theorem},
journal = cn, volume = 45, year = 1984, pages = {129-138}}

@inproceedings{RobertsonS84a,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph width and well-quasi ordering: a survey},
booktitle = {Progress in Graph Theory},
editor = {J. A. Bondy and U. S. R. Murty},
publisher = {Academic Press},
address = {Toronto},
year = 1984, pages  = {399-406}}

%Robertson 1985

@inproceedings{RobertsonS85a,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph minors --- A survey},
editor = {I. Anderson},
booktitle = {Surveys in Combinatorics},
publisher = {Cambridge Univ.\ Press},
year = 1985, pages = {153--171}}

%Robertson 1988

@unpublished{RobertsonS88,
author = {Neil Robertson and Paul D. Seymour},
title = {An Outline of a Disjoint Path Algorithm},
note = {Preprint}, year = 1988, month = {May}}

%Robertson 1993

@inproceedings{RobertsonS93,
author = {Neil Robertson and Paul D. Seymour},
title = {Excluding a graph with one crossing},
booktitle = {Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint
Summer Research Conference, Seattle WA, June 1991},
publisher = {American Math. Soc.},
address = {Providence, RI},
editor = {Neil Robertson and Paul Seymour},
note = {Contemp. Math. 147.},
pages = {669-675},
year = 1993}

@inproceedings{RobertsonST93,
author = {Neil Robertson and Paul D. Seymour and Robin Thomas},
title = {A survey of linkless embeddings},
booktitle = {Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint
Summer Research Conference, Seattle WA, June 1991},
publisher = {American Math. Soc.},
address = {Providence, RI},
editor = {Neil Robertson and Paul Seymour},
note = {Contemp. Math. 147.},
pages = {125-136},
year = 1993}

@inproceedings{RobertsonST93a,
author = {Neil Robertson and Paul D. Seymour and Robin Thomas},
title = {Structural Description of Lower Ideals of Trees},
booktitle = {Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint
Summer Research Conference, Seattle WA, June 1991},
publisher = {American Math. Soc.},
address = {Providence, RI},
editor = {Neil Robertson and Paul Seymour},
note = {Contemp. Math. 147.},
pages = {525-538},
year = 1993}

%Robertson 1994

@article{RobertsonST94,
author = {Neil Robertson and Paul D. Seymour and Robin Thomas},
title = {Quickly Excluding a Planar Graph},
journal = jctb, volume = 62, year = 1994, pages = {323-348}}

%Robertson 1997

@article{RobertsonSST97,
author = {Neil Robertson and Daniel Sanders and Paul Seymour and Robin
Thomas},
title = {The Four-Colour Theorem},
journal = jctb, volume = 70, year = 1997, pages = {2-44}}

@article{RobinsonG89,
author = {A. G. Robinson and A. J. Goldman},
title = {The set coincidence game: Complexity, Attainability, and
Symmetric Strategies},
journal = jcss, volume = 39, year = 1989, pages = {376-387}}

@article{Robson84,
author = {J. M. Robson},
title = {{$N$} by {$N$} {Checkers} is {Exptime} complete},
journal = siamjc, volume = 13, year = 1984, pages = {252-267}}

@article{Robson85,
author = {J. M. Robson},
title = {Alternation with restrictions on looping},
journal = ic, volume = 67, pages = {2-11}, year = 1985 }

%Roc

@book{Rockafellar84,
author = {R. T. Rockafellar},
title = {Network Flows and Monotronic Optimization},
publisher = {Wiley},
address = {New York},
year = 1984}

%Rod

@article{Rodriguez-VelazquezS09,
author = {J. A. Rodr\'{\i}guez-Vel\'{a}zquez and J. M. Sigarreta},
title = {Global defensive $k$-alliances in graphs},
journal = dam, volume = 157, year = 2009, pages = {211-218}}

%Roh

@mastersthesis{Rohrig98,
author = {Hein R{\"{o}}hrig},
title = {Tree decomposition: A feasibility study},
school = {Max-Planck-Institut f{\"{u}}r Informatik},
address = {Saarbr{\"{u}}cken, Germany},
year = 1998}

%Ron

@article{Ronn90,
author = {Eytan Ronn},
title = {{NP}-complete stable matching problems},
journal = ja, volume = 11, year = 1990, pages = {285 - 304}}

%Roo

%van Rooij 2006

@mastersthesis{vanRooij06,
author = {Johan M. M. {van Rooij}},
title = {Design by Measure and Conquer: An {$O(1.5086^n)$} Algorithm for Minimum Dominating Set and Similar Problems},
school = {Institute for Information and Computing Sciences, Utrecht University},
number = {INF/SRC-06-05}, year = 2006}

%van Rooij 2008

@inproceedings{vanRooijB08,
author = {Johan M. M. van Rooij and Hans L. Bodlaender},
title = {Design by Measure and Conquer --- A faster exact algorithm for Dominating Set},
booktitle = stacs08,
year = 2008, pages = {657-668}}

@inproceedings{vanRooijB08a,
author = {Johan M. M. van Rooij and Hans L. Bodlaender},
title = {Exact algorithms for Edge Domination},
booktitle = {Proceedings of the 3rd International Workshop on Parameterized and Exact Computation, IWPEC 2008},
editor = {Martin Grohe and Rolf Niedermeier},
year = 2008,
pages = {214-225},
publisher = {Springer, Lecture Notes in Computer Science, volume 5018},
address = {Berlin}}

%van Rooij 2009

%inproceedings{vanRooijBR09,
author = {Johan M. M. van Rooij and Hans L. Bodlaender and Peter Rossmanith},
title = {Dynamic programming on tree decompositions using generalised fast subset convolution},
editor = {Amos Fiat and Peter Sanders},
booktitle = esa09, publisher = lncs5757, year = 2009,
pages = {566-577}}

@inproceedings{vanRooijNvD09,
author = {Johan M. M. van Rooij and Jesper Nederlof and Thomas C. van Dijk},
title = {Inclusion/Exclusion meets Measure and Conquer: Exact algorithms for counting dominating sets},
editor = {Amos Fiat and Peter Sanders},
booktitle = esa09, publisher = lncs5757, year = 2009,
pages = {554-565}}

%Ros

@article{Rose70,
author = {Donald J. Rose},
title = {Triangulated graphs and the elimination process},
journal = jmaa, volume = 32, year = 1970, pages = {597-609}}

@inproceedings{Rose72,
author = {Donald J. Rose},
title = {A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations},
booktitle = {Graph Theory and Computing},
editor = {R. C. Reed},
publisher = {Academic Press}, year = 1972, pages = {183-217}}

@article{Rose74,
author = {Donald J. Rose},
title = {On simple characterization of $k$-trees},
journal = dm, volume = 7, year = 1974, pages = {317-322}}

@article{RoseTL76,
author = {Donald J. Rose and Robert Endre Tarjan and George S. Lueker},
title = {Algorithmic aspects of vertex elimination on graphs},
journal = siamjc, volume = 5, year = 1976, pages = {266-283}}

@article{RosenbergS81,
author = {A. Rosenberg and Ivan Hal Sudborough},
title = {Bandwidth and pebbling},
journal = comp, volume = 31, year = 1981, pages = {115-139}}

@article{RosentalG77,
author = {A. Rosental and A. Goldner},
title = {Smallest augmentations to biconnect a graph},
journal = siamjc, volume = 6, year = 1977, pages = {55-66}}

%Rot

@article{Roth96,
author = {D. Roth},
title = {On the hardness of approximate reasoning},
journal = artint, volume = 82, pages = {273-302}, year = 1996}

@techreport{Rote89,
author = {G\"{u}nther Rote},
title = {Path Problems in Graphs},
number = {B-89-11},
year = 1989,
institution = {Freie Universit\"{a}t Berlin}}

%Ru

%Rub

@article{RubalcabaS08,
author = {Robert R. Rubalcaba and Peter J. Slater},
title = {Roman dominating influence parameters},
journal = dm, volume = 307, year = 2007, pages = {3194-3200}}

%Ruz

@article{Ruzzo80,
author = {W. L. Ruzzo},
title = {Tree-size bounded alternation},
journal = jcss, volume = 21, year = 1980, pages = {218-235}}

%S

%Sa

%Sak

@article{Sakai94,
author = {D. Sakai},
title = {Labeling chordal graphs: {D}istance two condition},
journal = sjdm, volume = 7, year = 1994, pages = {133-140}}

%Sal

@article{SalamonW08,
author = {G. Salamon and G. Wiener},
title = {On finding spanning trees with few leaves},
journal = ipl, volume = 105, year = 2008, pages = {164-169}}

@article{Salavatipour04,
author = {Mohammad R. Salavatipour},
title = {A polynomial time algorithm for strong edge coloring of partial $k$-trees},
journal = dam, volume = 143, year = 2004, pages = {285-291}}

%Sam

@article{SamerS10,
author = {Marko Samer and Stefan Szeider},
title = {Algorithms for propositional model counting},
journal = jda, volume = 8, year = 2010, pages = {50-64}}

@article{SamerS10a,
author = {Marko Samer and Stefan Szeider},
title = {Constraint satisfaction with bounded treewidth revisited},
journal = jcss, volume = 76, year = 2010, pages = {103-114}}

%San

@article{Sanders96,
author = {Daniel P. Sanders},
title = {On Linear Recognition of Tree-Width at Most Four},
journal = sjdm, volume = 9, number = 1, year = 1996, pages = {101-117}}

@article{SantoroK85,
author = {N. Santoro and R. Khatib},
title = {Labelling and Implicit Routing in Networks},
journal = tcj, volume = 28, year = 1985, pages = {5-8}}

@inproceedings{Santos91,
author = {Eugene Santos Jr.},
title = {On the generation of alternative explanations with implications for belief revision},
editor = {Bruce D'Ambrosio and Philippe Smets},
booktitle = uai91, year = 1991, pages = {339-347}, publisher = {Morgan Kaufmann}}

%Sas

@article{Sasatte08,
author = {Prashant Sasatte},
title = {Improved {FPT} algorithm for feedback vertex set problem in bipartite tournament},
journal = ipl, volume = 105, year = 2008, pages = {79-82}}

%Sat

@techreport{SatyanP92,
author = {C. R. Satyan and C. {Pandu Rangan}},
title = {Treewidth of bipartite permutation graphs},
number = {TR-TCS-92-8},
institution = {Indian Institute of Technology, Madras, India},
year = 1992}

@article{SatyanarayanaT90,
author = {A. Satyanarayana and L. Tung},
title = {A characterization of partial 3-trees},
journal = netw, volume = 20, year = 1990, pages = {299-322}}

%Sau

@misc{Saurabh09,
author = {Saket Saurabh},
note = {Personal communication},
year = 2009}

%Sax

@article{Saxe80,
author = {J. B. Saxe},
title = {Dynamic programming algorithms for recognizing small-bandwidth graphs in polynomial time},
journal = sjadm, volume = 1, year = 1980, pages = {363-369}}

%Sc

%Sch

%Scha

@article{Schaefer78a,
author = {T. J. Schaefer},
title = {On the complexity of some two-person perfect-information games},
journal = jcss, volume = 16, year = 1978, pages = {185-225}}

@inproceedings{Schaefer78b,
author = {T. J. Schaefer},
title = {The complexity of satisfiability problems},
booktitle = stoc78, year = 1978, pages = {216-226}}

@article{Schaffer89,
author = {A. A. Sch\"{a}ffer}, 
title = {Optimal node ranking of trees in linear time},
journal = ipl, volume = 33, year = 1989, pages = {91-99}}

%Sche

%Scheffler 1986

@unpublished{SchefflerS86,
author = {Petra Scheffler and Detlef Seese},
title = {A Combinatorial and Logical Approach to Linear-Time Computability },
note = {Extended abstract},
year = 1986 }

%Scheffler 1987

@techreport{Scheffler87,
author = {Petra Scheffler},
title = {Linear-time Algorithms for {NP}-complete Problems Restricted
to Partial $k$-Trees},
type = {Report},
number = {R-MATH-03/87},
institution = {Karl-Weierstrass-Institut F\"ur Mathematik},
address = {Berlin, GDR},
year = 1987
}

%Scheffler 1988

@inproceedings{Scheffler88,
author = {Petra Scheffler},
title = {What graphs have bounded treewidth?},
year = 1988,
booktitle = {Proc. 7th Fishland Coll. Discr. Math. and Appl.},
address = {Wustrow, Rostocker Mathematisches Kolloquium}
}

@unpublished{Scheffler88a,
author = {Petra Scheffler},
title = {Linear-time Algorithms for Graphs of Bounded Tree-width. {T}he DISJOINT-PATHS-problem},
year = 1988,
note = {Manuscript, to appear in Graphentheorie und Anwendungen}
}

%Scheffler 1989

@phdthesis{Scheffler89,
author = {Petra Scheffler},
title = {Die {B}aumweite von {G}raphen als ein {M}a\ss  \  f\"{u}r die
{K}ompliziertheit algorithmischer {P}robleme},
school = {Akademie der Wissenschaften der DDR},
address = {Berlin}, year = 1989 }

%Scheffler 1990

@inproceedings{Scheffler90,
author = {Petra Scheffler},
title = {A linear algorithm for the pathwidth of trees},
booktitle = {Topics in combinatorics and graph theory},
editor = {R. Bodendiek and R. Henn},
publisher = {Physica-Verlag}, address = {Heidelberg}, year = {1990},
pages = {613-620}}

%Scheffler 1994

@techreport{Scheffler94,
author = {Petra Scheffler},
title = {A practical linear time algorithm for disjoint paths in graphs with 
bounded tree-width},
institution = {TU Berlin, Fachbereich Mathematik},
type={Report},
number = {396/1994},
address={Berlin}, year = 1994}

%Schi

@article{SchieberM89,
author = {Baruch Schieber and Shlomo Moran},
title = {Parallel algorithms for maximum bipartite matchings and
maximum 0-1 flows},
journal = jpdc, volume = 6, year = 1989 }

@article{Schiermeyer08,
author = {Ingo Schiermeyer},
title = {Efficiency in exponential time for domination-type problems},
journal = dam, volume = 156, year = 2008, pages = {3291-3297}}

%Scho

@inproceedings{Schoening05,
author = {Uwe Sch\"{o}ning},
title = {Algorithmics in Exponential Time},
booktitle = stacs05,
publisher = lncs3404, year = 2005, pages = {36-43}}

@article{Schoening06,
author = {Uwe Sch\"{o}ning},
title = {Smaller superconcentrators of density 28},
journal = ipl, volume = 28, pages = {127-129}, year = 2006}

%Schr

@book{Schrijver86,
author = {Alexander Schrijver},
title = {Theory of Linear and Integer Programming},
publisher = {John Wiley \& Sons},
address = {Chichester}, year = 1986}

@article{Schrijver91,
author = {A. Schrijver},
title = {Disjoint Homotopic Paths and Trees in a Planar Graph},
journal = dcg, volume = 6, year = 1991, pages = {527-574}}

@book{Schrijver03,
author = {Alexander Schrijver},
title = {Combinatorial Optimization. Polyhedra and Efficiency},
year = 2003,
publisher = {Springer}, address = {Berlin}}

%Schw

@article{SchwarzT06,
author = {C. Schwarz and D. S. Troxell},
title = {{$L(2,1)$}-labelings of {C}artesian products of two cycles},
journal = dam, volume = 154, year = 2006, pages = {1522-1540}}

@article{SchwikowskiS02,
author = {Benno Schwikowski and Ewald Speckenmeyer},
title = {On enumerating all minimal solutions of feedback problems},
journal = dam, volume = 117, year = 2002, pages = {253-265}}

%Se

%See

%Seese 1975

@article{Seese75,
author = {Detlef Seese},
title = {Zur {E}ntscheidbarkeit der monadische {T}heorie 2. {S}tufe baumartiger {G}raphen},
journal = {W.Z. der Humbolt-Universit\"{a}t zu Berlin},
volume = {Math.-Nat. R. XXIV},
year = 1975, number = 6, pages = {768-772}}

@article{Seese75a,
author = {Detlef Seese},
title = {Ein {U}nentscheidbarkeitskriterium},
journal = {W.Z. der Humbolt-Universit\"{a}t zu Berlin},
volume = {Math.-Nat. R. XXIV},
year = 1975, number = 6, pages = {772-780}}

%Seese 1979

@article{Seese79,
author = {Detlef Seese},
title = {Some graph theoretical operations and decidability},
journal = {Mathematische Nachrichten}, volume = 87, year = 1979, pages = {15-21}}

%Seese 1985

@inproceedings{Seese85,
author = {Detlef Seese},
title = {Tree-partite graphs and the complexity of algorithms},
editor = {L. Budach},
year = 1985, booktitle = fct85, publisher = lncs199, pages = {412-421}}

%Seese 1989

@unpublished{Seese89,
author = {Detlef Seese},
title = {Interpretability and Tree Automata: A Simple Way to Solve Algorithmic Problems Closely Related to Graphs},
year = 1989, note = {Preprint}, pages = {1-63}}

@unpublished{SeeseW89a,
author = {Detlef G. Seese and W. Wessel},
title = {Graphminoren und Gitter, Zu einigen Arbeiten
von N. Robertson und P. D. Seymour},
note = {Preprint}, pages = {1-77}, year = 1989}

@article{SeeseW89,
author = {Detlef G. Seese and W. Wessel},
title = {Grids and their minors},
journal = jctb, volume = 47, year = 1989, pages = {349-360}}

%Seese 1991

@article{Seese91,
author = {Detlef Seese},
title = {The structure of the models of decidable monadic theories of
graphs},
journal = apal, volume = 53, year = 1991, pages = {169-195}}

@unpublished{Seese91a,
author = {Detlef Seese},
title = {Interpretability and Tree Automata:  a Simple Way to Solve
Algorithmic Problems on Graphs Closely Related to Trees},
year = 1991,
note = {Manuscript}}

%Seg

@article{Segawa94,
author = {Tomomi Segawa},
title = {Radius increase caused by edge deletion},
journal = {SUT Journal of Mathematics}, volume = 30, year = 1994, pages = {159-162}}

%Set

@article{Sethi75,
author = {R. Sethi},
title = {Complete register allocation problems},
journal = siamjc, volume = 4, year = 1975, pages = {226-248}}

%Sey

%Seymour 1980

@article{Seymour80,
author = {Paul D. Seymour},
title = {Disjoint paths in graphs},
journal = dm, volume = 29, year = 1980, pages = {293-309}}

%Seymour 1989

%Seymour 1990

@article{Seymour90,
author = {Paul D. Seymour},
title = {Colouring series-parallel graphs},
journal = comb, volume = 85, pages = {12-75}, year = 1990}

%Seymour 1993

@article{SeymourT93,
author = {Paul D. Seymour and Robin Thomas},
title = {Graph Searching and a Minimax Theorem for Tree-width},
journal = jctb, volume = 58, year = 1993, pages = {239-257}}

%Seymour 1994

@article{SeymourT94,
author = {Paul D. Seymour and Robin Thomas},
title = {Call routing and the ratcatcher},
journal = combinatorica, volume = 14, number = 2, year = 1994, pages = {217-241}}

%Seymour 2006

%Note: this is a reissue of Seymour80:
@article{Seymour06,
author = {P. D. Seymour},
title = {Disjoint paths in graphs},
journal = dm, volume = 306, pages = {979-991}, year = 2006}

%Sh

%Sha

@article{ShamirS04,
author = {Ron Shamir and Roded Sharan},
title = {A fully dynamic algorithm for modular decomposition and recognition
of cographs},
journal = dam, volume = 136, pages = {329-340}, year = 2004}

@article{Shannon88,
author = {Gregory E. Shannon},
title = {A Linear-Processor Algorithm for Depth-First Search in Planar
Graphs},
journal = ipl, volume = 29, year = 1988, pages = {119-123}}

@article{ShashaZ90,
author = {Dennis Shasha and Kaizhong Zhang},
title = {Fast algorithms for the unit cost editing distance between
trees},
journal = ja, volume = 11, year = 1990, pages = {581-621}}

%Shc

@Article{Shcherbina07,
	author = 			 {O. A. Shcherbina},
	title = 			 {Tree Decompositions and Discrete Optimization
                  Problems: {A} Survey},
	journal = 		 {Cybernetics and Systems Analysis},
	year = 				 {2007},
	volume = 	 {43},
	number = 	 {4},
	pages = 		 {549--562},
}

%Shi

@article{ShihH89,
author = {W.-K. Shih and W.-L. Hsu},
title = {An $O(n log n + m log log n)$ maximum weight clique algorithm
for circular-arc graphs},
journal = ipl, volume = 31, year = 1989, pages = {129-134}}

@article{Shiloach79,
author = {Y. Shiloach},
title = {A Minimum Linear Arrangement Algorithms for Undirected
Trees},
journal = siamjc, volume = 8, pages = {15-32}, year = 1979 }

@article{Shiloach79a,
author = {Y. Shiloach},
title = {A polynomial solution to the undirected two paths problem},
journal = jacm, volume = 27, year = 1980, pages = {445-456}}

@article{ShiloachV82,
author = {Y. Shiloach and U. Vishkin},
title = {An {${O}(n \log n )$} parallel connectivity algorithm},
journal = ja, year = 1982, pages = {57-67}}

@article{Shimony94,
author = {S. E. Shimony},
title = {Finding {MAPs} for belief networks is {NP}-hard},
journal = artint, volume = 68, pages = {399-410}, year = 1994}

%Sho

@unpublished{ShoikhetG97a,
author = {Kirill Shoikhet and Dan Geiger},
title = {Finding optimal triangulations via minimal vertex separators},
note = {Manuscript}, year = 1997}

@inproceedings{ShoikhetG97,
author = {Kirill Shoikhet and Dan Geiger},
title = {A practical algorithm for finding optimal triangulations},
booktitle = aaai97, publisher = {Morgan Kaufmann}, year = 1997, pages = {185-190}}

%Si

%Sid

@article{Sidorowicz07,
author = {E. Sidorowicz},
title = {The game chromatic number and the game colouring number of cactuses},
journal = ipl, volume = 102, year = 2007, pages = {147-151}}

%Sie

@Book{SiekLL01,
author = {Jeremy G. Siek and Lie-Quan Lee and Andrew Lumsdaine},
title =	 {{The Boost Graph Library: User Guide and Reference Manual}},
publisher = {Addison-Wesley Professional},
year = {2001},
note = {Software available on \url{http://www.boost.org}}}

%Sig

@article{SigarretaR09,
author = {J. M. Sigarreta and J. A. Rodr\'{\i}guez},
title = {On the global offensive alliance number of a graph},
journal = dam, volume = 157, year = 2009, pages = {219-226}}

%Sim

@phdthesis{Simon75,
author = {J. Simon},
title = {On Some Central Problems in Computational Complexity},
school = {Cornell University},
address = {Ithaca, N.Y.},
year = 1975}

@inproceedings{Simon77,
author = {Janos Simon},
title = {On the difference between one and many},
booktitle = icalp77, publisher = lncs52, year = 1977, pages = {480-491}}

@article{Simonovits67,
author = {M. Simonovits},
title = {A new proof and generalizations of a theorem of {E}rd\"{o}s and {P}\'{o}sa on graphs without $k+1$ independent circuits},
journal = {Acta Mathematica Academiae Scientiarum Hungaricae}, volume = 18, year = 1976, pages = {191-206}}

@phdthesis{Simonson86,
author ={Shai Simonson},
title = {Layout Problems on Graphs},
school = {EECS Department, Northwestern University},
year = 1986}

@article{Simonson87,
author ={Shai Simonson},
title = {A variation on the Min Cut Linear Arrangement Problem},
journal = mst, volume = 20, year = 1987, pages = {235-252}}

@article{SimonsonS92,
author = {Shai Simonson and I. Hal Sudborough},
title = {On the complexity of tree embedding problems},
journal = ipl, volume = 44, year = 1992, pages = {323-328}}

%Sk

%Sko

@article{Skodinis01,
author = {Konstantin Skodinis},
title = {The complexity of the {$K_{n,n}$}-problem for node replacement graph
languages},
journal = ic2, volume = 168, pages = {95-112}, year = 2001}

@article{Skodinis03,
author = {Konstantin Skodinis},
title = {Construction of linear tree-layouts which are optimal with respect to
vertex separation in linear time},
journal = ja, volume = 47, pages = {40-59}, year = 2003}

@inproceedings{Skowronska82,
author = {M. Skoronska},
title = {Efficient vertex- and edge-coloring of {H}alin Graphs},
booktitle = {Proceedings of the 3rd Czechoslovak Symposium on Graph Theory},
address = {Prague},
year = 1982
}

%Sl

@article{Slisenko82,
author = {A. O. Slisenko},
title = {Context-free graph grammars as a tool for describing
polynomial-time subclasses of hard problems},
journal = ipl, year = 1982, pages = {52-56}, volume = 14}

%Sn

@phdthesis{Snir04,
author = {S. Snir},
title = {Computational Issues in Phylogenetic Reconstruction: Analytic Maximum
Likelihood Solutions, and Convex Recoloring},
school = {Department of Computer Science, Technion},
address = {Haifa, Israel},
year = 2004}

%So

@inproceedings{SongLMPC05,
author = {Y. Song and C. Liu and R. Malmberg and F. Pan and L. Cai},
title = {Tree Decomposition Based Fast Search of {RNA} Structures Including Pseudoknots in Genomes},
booktitle = {Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference, CSB'05},
year = {2005},
isbn = {0-7695-2344-7},
pages = {223--234},
doi = {http://dx.doi.org/10.1109/CSB.2005.52},
publisher = {IEEE Computer Society},
address = {Washington, DC, USA},
}

%Sp

%Spi

@article{Spinrad91,
author = {Jeremy P. Spinrad},
title = {Finding large holes},
journal = ipl, volume = 39, year = 1991, pages = {227-229}}

@article{Spinrad94,
author = {Jeremy P. Spinrad},
title = {Recognition of circle graphs},
journal = ja, volume = 16, year = 1994, pages = {264-282}}

%Spr

@article{Sprague94,
author = {A. P. Sprague},
title = {An {$O(n \log n)$} algorithm for the bandwidth of interval graphs},
journal = sjdm, volume = 7, year = 1994, pages = {213-220}}

%Sr

%Sre

@article{Srebo03,
author = {N. Srebo},
title = {Maximum likelihood bounded tree-width Markov networks},
journal = ai, volume = 143, pages = {123-138}, year = 2003}

%Sri

@inproceedings{SrinivasN96,
author = {Shenoy Srinivas and Pandurang Nayak},
title = {Efficient enumeration of instantiations of {B}ayesian networks},
editor = {Eric Horvitz and Finn Verner Jensen},
booktitle = uai96, year = 1996, pages = {500-508}, publisher = {Morgan Kaufmann}}

%St

%Sta

@inproceedings{Stamm90,
author = {Hermann Stamm},
title = {On feedback problems in planar digraphs},
editor = {Rolf M\"{o}hring},
booktitle = wg90, publisher = lncs484, pages = {79-89}, year = 1991}

%Ste

@article{StearnsH96,
author = {Richard E. Stearns and Harry B. {Hunt III}},
title = {An algebraic model for combinatorial problems},
journal = siamjc, volume = 25, year = 1996, pages = {448-476}}

@article{StearnsH02,
author = {Richard E. Stearns and Harry B. {Hunt III}},
title = {Exploiting structure in quantified formulas},
journal = ja, volume = 43, year = 2002, pages = {220-263}}

@article{Steel92,
author="M. Steel",
title="The complexity of reconstructing trees from
qualitative characters and subtrees",
journal="J. of Classification",
volume="9",
year="1992",
pages="91--116"  }

@unpublished{Stewart88?,
author = {Iain A. Stewart},
title = {Colouring perfect planar graphs in parallel},
year = 1988,
note = {Manuscript}
}

%Sto

@article{Stockmeyer76,
author = {L. J. Stockmeyer},
title = {The polynomial-time hierarchy},
journal = tcs, year = 1976, volume = 3, pages = {1-22}}

@article{StockmeyerC79,
author = {L. J. Stockmeyer and A. K. Chandra},
title = {Provably difficult combinatorial games},
journal = siamjc, volume = 8, pages = {151-174}, year = 1979 }

@article{Storer83,
author = {J. A. Storer},
title = {On the complexity of chess},
journal = jcss, volume = 27, pages = {77-100}, year = 1983}

%Str

@article{Strassen69,
author = {V. Strassen},
title = {Gaussian elimination is not optimal},
journal = {Numerische Mathematik}, volume = 14, year = 1969, pages = {354-356}}

%Su

%Suc

@article{SuchanT07,
author = {Karol Suchan and Ioan Todinca},
title = {On powers of graphs of bounded NLC-width (clique-width)},
journal = dam, volume = 155, year = 2007, pages = {1885-1893}}

@article{SuchanT09,
author = {Karol Suchan and Ioan Todinca },
title = {Minimal interval completion through graph exploration},
journal = tcs, volume = 410, year = 2009, pages = {35-43}}

@unpublished{SuchanV09,
author = {Karol Suchan and Yngve Villanger},
title = {Computing pathwidth faster than $2^n$},
year = 2009,
note = {To appear in Proceedings IWPEC 2009}}

%Sud

@article{Sudborough87,
author = {Ivan Hal Sudborough},
title = {``{C}utwidth'' and Related Graph Problems},
journal = beatcs,
pages = {79-110},
year = 1987,
month = feb
}

%Sug

@article{SugiharaS89,
author = {Kazuo Sugihara and Ichiro Suzuki},
title = {Optimal algorithms for a pursuit-evasion problem in grids},
journal = sjdm, volume = 2, year = 1989, pages = {126-143}}

%Sun

@article{SundaramSR94,
author = {Ravi Sundaram and Karan {Sher Singh} and C. {Pandu Rangan}},
title = {Treewidth of circular-arc graphs},
year = 1994, journal = sjdm, volume = 7, pages = {647-655}}

%Suz

@article{SuzukiTN90,
author = {H. Suzuki and N. Takahashi and Takao Nishizeki},
title = {A linear algorithm for bipartition of biconnected graphs},
journal = ipl, volume = 33, pages = {227-231}, year = 1990 }

%Sy

@inproceedings{Sy92,
author = {Bon K. Sy},
title = {Reasoning {MPE} to multiply connected belief networks using message passing},
booktitle = aaai92, publisher = {AAAI Press}, year = 1992, pages = {570-576}}

%Sys

@article{Syslo79,
author = {Maciej M. Sys{\l}o},
title = {Characterisations of outerplanar graphs},
journal = dm, volume = 26, year = 1979, pages = {47-53}}

@article{Syslo82,
author = {Maciej M. Sys{\l}o},
title = {The subgraph isomorphism problem for outerplanar graphs},
journal = tcs, volume = 17, year = 1982, pages = {91-97}}

@article{Syslo82b,
author = {Maciej M. Sys{\l}o},
title = {A labeling algorithm to recognize a line graph and output its root graph},
journal = ipl, volume = 15, year = 1982, pages = {28-30}}

@inproceedings{Syslo83,
author = {Maciej M. Sys{\l}o},
title = {{NP}-Complete Problems On Some Tree-Structured Graphs: A Review},
editor = {M. Nagl and J. Perl},
booktitle = wg83, year = 1983, pages = {342-353},
publisher = {University Verlag Rudolf Trauner},
address = {Linz, West Germany}}

@inproceedings{SysloP83,
author = {Maciej M. Sys{\l}o and Andrzej Proskurowski},
title = {On {H}alin graphs},
booktitle = {Graph Theory, Lagow, 1981},
publisher = lncs1018, pages = {248-256}, year = 1983}

@article{Syslo84,
author = {Maciej M. Sys{\l}o},
title = {Series-parallel graphs and depth-first search trees},
journal = ieeetcs,
volume = {CAS-31}, number = 12, year = 1984, month = {Dec.}, pages =
{1029-1033}}

@inproceedings{Syslo86,
author = {Maciej M. Sys{\l}o},
title = {On Some Generalizations of Outerplanar Graphs: Results and Open Problems},
editor = {G. Tinhofer and G. Schmidt},
booktitle = wg86, publisher = lncs246, year = 1986, pages = {146-164}}

%Sz

@article{SzekeresW68,
author = {G. Szekeres and H. S. Wilf},
title = {An inequality for the chromatic number of a graph},
journal = jct, volume = 4, year = 1968, pages = {1-3}}

%T

%Ta

%Tak

@article{TakahashiUK91,
author = {Atsushi Takahashi and Shuichi Ueno and Yoji Kajitani},
title = {Minimal Acyclic Forbidden Minors for the Family of Graphs
with Bounded Path-Width},
journal = dm, pages={293 - 304}, volume = 127, number = {1/3}, year = 1994}

@article{TakahashiUK91a,
author = {Atsushi Takahashi and Shuichi Ueno and Yoji Kajitani},
title = {Mixed-Searching and Proper-Path-Width},
journal = tcs, volume = 137, year = 1995, pages = {253-268}}

@article{TakahashiUK95,
author = {Atsushi Takahashi and Shuichi Ueno and Yoji Kajitani},
title = {Mixed-Searching and Proper-Path-Width},
journal = tcs, volume = 137, year = 1995, pages = {253-268}}

@article{TakahashiUK95a,
author = {Atsushi Takahashi and Shuichi Ueno and Yoji Kajitani},
title = {Minimal forbidden minors for the family of graphs with proper-path-width at most two},
journal = {IEICE Trans. Fund.}, volume = {E78-A}, year = 1995, pages = {1828-1839}}

@article{TakamizawaNS82,
author = {K. Takamizawa and Takao Nishizeki and N. Saito},
title = {Linear-time computability of combinatorial problems on series-parallel graphs},
journal = jacm, volume = 29, year = 1982, pages = {623-641}}

@article{Takaoka92,
author = {Tadao Takaoka},
title = {A new upper bound on the complexity of the all pairs shortest path problem},
journal = ipl, volume = 43, year = 1992, pages = {195-199}}


%Tam

@article{Tamassia87,
author = {R. Tamassia},
title = {On embedding a graph in the grid with the minimum number of bends},
journal = siamjc, volume = 16, pages = {421-444}, year = 1987}

%Tan

@article{Tan91,
author = {Jimmy J. M. Tan},
title = {A necessary and sufficient condition for the existence of a complete stable matching},
journal = ja, volume = 12, year = 1991, pages = {154-178}}

%Tar

%Tarjan 1972

@article{Tarjan72,
author = {Robert Endre Tarjan},
title = {Depth first search and linear graph algorithms},
journal = siamjc, volume = 1, year = 1972, pages = {146-160}}

@techreport{Tarjan72a,
author = {Robert Endre Tarjan},
title = {Finding a maximum clique},
type = {Technical report},
institution = {Department of Computer Science, Cornell University, Ithaca, NY},
year = 1972}

%Tarjan 1974

@article{Tarjan74,
author = {Robert Endre Tarjan},
title = {A note on finding the bridges of a graph},
journal = ipl, volume = 2, year = 1974, pages = {160-161}}

%Tarjan 1975

@article{Tarjan75,
author = {R. E. Tarjan},
title = {Efficiency of a good but not linear set union algorithm},
journal = jacm, volume = 22, year = 1975, pages = {215-225}}

%Tarjan 1975

@article{TarjanT77,
author = {R. E. Tarjan and A. Trojanowski},
title = {Finding a maximum independent set},
journal = siamjc, volume = 6, year = 1977, pages = {537-546}}

%Tarjan 1983

@book{Tarjan83,
author = {Robert Endre Tarjan},
title = {Data Structures and Network Algorithms},
publisher = {SIAM},
address = {Philadelphia, PA},
year = 1983 }

%Tarjan 1984

@article{TarjanY84,
author = {Robert Endre Tarjan and Mihalis Yannakakis},
title = {Simple linear time algorithms to test chordiality of graphs, test acyclicity of graphs, and selectively reduce acyclic hypergraphs},
journal = siamjc, volume = 13, pages = {566-579}, year = 1984 }

%Tarjan 1985

@article{Tarjan85,
author = {Robert Endre Tarjan},
title = {Decomposition by clique separators},
journal = dm, volume = 55, year = 1985, pages = {221-232}}

@article{TarjanV85,
author = {Robert Endre Tarjan and Uzi Vishkin},
title = {An efficient parallel biconnectivity algorithm},
journal = siamjc, volume = 14, number = 4, year = 1985, pages = {862-874}}

@book{TarskiMR53,
author = {A. Tarski and A. Mostowski and R. M. Robinson},
title = {Undecidable Theories},
publisher = {North-Holland Publishing Company},
year = 1953, pages = {xi+98 pp.}}

%Taz

@article{TazariM09,
author = {Siamak Tazari and Matthias M\"{u}ller-Hannemann},
title = {Shortest paths in linear time on minor-closed graph classes, with an
application to {S}teiner tree approximation},
journal = dam, volume = 157, year = 2009, pages = {673-684}}

%Te

%Tel

%Telle 1993

@article{TelleP93,
author = {Jan Telle and Andrzej Proskurowski},
title = {Efficient Sets in Partial $k$-Trees},
journal = dam, volume = 44, year = 1993, pages = {109-117}}

@inproceedings{TelleP93a,
author = {Jan Telle and Andrzej Proskurowski},
title = {Practical algorithms on partial $k$-trees with an application to domination-like problems},
editor = {Frank K. H. A. Dehne and J\"{o}rg-R\"{u}diger Sack and Nicola Santoro and Sue Whitesides},
booktitle = wads93, publisher = lncs709, year = 1993, pages = {610-621}}

%Telle 1994

@phdthesis{Telle94,
author = {Jan Arne Telle},
title = {Vertex Partitioning Problems: Characterization, Complexity and Algorithms on Partial $k$-Trees},
school = {Department of Computer and Information Science, University of
Oregon}, address = {Eugene, Oregon, USA},
year = 1994}

@article{Telle94a,
author = {Jan Arne Telle},
title = {Complexity of Domination-Type Problems in Graphs},
journal = nordicjc, volume = 1, year = 1994, pages = {157-171}}

%Telle 1997

@article{TelleP97,
author = {Jan Arne Telle and Andrzej Proskurowski},
title = {Algorithms for vertex partitioning problems on partial $k$-trees},
journal = sjdm, volume = 10, year = 1997, pages = {529 - 550}}

%Telle 2005

@article{Telle01,
author = {Jan Arne Telle},
title = {Tree-decompositions of small pathwidth},
journal = dam, volume = 145, year = 2005, pages = {210-218}}

%Th

%Tha

@article{ThatcherW68,
author = {J. W. Thatcher and J. B. Wright},
title = {Generalized Finite Automata Theory with an Application to a Decision Problem in Second-Order Logic},
journal = mst, volume = 2, year = 1988, pages = {57-81}}

%Thi

%Thilikos 1997

@techreport{Thilikos97,
author = {Dimitrios M. Thilikos},
title = {Algorithms and Obstructions for Linear-Width and Related Search Parameters},
number = {UU-CS-97-35},
year = 1997,
institution = {Department of Computer Science, Utrecht University},
address = {Utrecht},
type = {Technical Report}}

@article{ThilikosB97,
author = {Dimitrios M. Thilikos and Hans L. Bodlaender},
title = {Fast partitioning $l$-apex graphs with applications to approximating
maximum induced-subgraph problems},
journal = ipl, volume = 61, pages = {227-232}, year = 1997}

%Thilikos 1999

@article{Thilikos99,
author = {Dimitrios M. Thilikos},
title = {Quickly excluding $K_{2,r}$ from planar graphs},
journal = {Electronic Notes in Discrete Mathematics}, year = 1999, volume = 3, pages = {189-194}}

%Thilikos 2000

@article{Thilikos00,
author = {Dimitrios M. Thilikos},
title = {Algorithms and obstructions for linear-width and related search parameters},
journal = dam, volume = 105, year = 2000, pages = {239-271}}

@techreport{ThilikosSB00,
author = {Dimitrios M. Thilikos and Maria J. Serna and Hans L. Bodlaender},
title = {A constructive linear time algorithm for small cutwidth},
institution = {Departament de Llenguatges i Sistemes Informatics,
Universitat Politecnica de Catalunya},
address = {Barcelona, Spain},
number = {LSI-00-48-R},
year = 2000
}

@inproceedings{ThilikosSB00a,
author = {Dimitrios M. Thilikos and Maria J. Serna and Hans L. Bodlaender},
title = {Constructive linear time algorithms for small cutwidth and carving-width},
editor =  {D.T. Lee and Shang-Hua Teng},
booktitle = isaac00, publisher = lncs1969, pages = {192--203}, year = {2000}}

%Thilikos 2005

@article{ThilikosSB05,
author = {Dimitrios M. Thilikos and Maria J. Serna and Hans L. Bodlaender},
title = {Cutwidth {I}: {A} linear time fixed parameter algorithm},
journal = ja, volume = 56, pages = {1-24}, year = 2005}

@article{ThilikosSB05a,
author = {Dimitrios M. Thilikos and Maria J. Serna and Hans L. Bodlaender},
title = {Cutwidth {II}: {Algorithms} for partial $w$-trees of bounded degree},
journal = ja, volume = 56, pages = {25-49}, year = 2005}

%Tho

@article{Thomas85,
author = {Robin Thomas},
title = {Graphs without {$K_4$} and well-quasi-ordering},
journal = jctb, volume = 38, pages = {240-247}, year = 1985}

@article{Thomas90,
author = {Robin Thomas},
title = {A {M}enger-like property of tree-width. {T}he finite case},
journal = jctb, volume = 48, pages = {67-76}, year = 1990}

@article{Thomason84,
author = {Andrew Thomason},
title = {An extremal function for contraction of graphs},
journal = {Mathematical Proceedings of the Cambridge Philosophical Society}, year = 1984, volume = 95, pages = {261-265}}

@inproceedings{Thomasse09,
author = {St\'{e}phan Thomass\'{e}},
title = {A quadratic kernel for Feedback Vertex Set},
booktitle = soda09,
pages = {115-119},
year = 2009}

@unpublished{Thomassen87,
author = {C. Thomassen},
title = {Embeddings and Minors},
note = {Manuscript, to appear in Handbook of Combinatorics, ed. by R. L. Graham, M.
Gr\"{o}tschel and L. Lovasz, North Holland},
year = 1987,
something = {Mat-Report No. 1987-10, pp. 1-63}}

@article{Thomassen89,
author = {Carsten Thomassen},
title = {The graph genus problem is {NP}-complete},
journal = ja, volume = 10, year = 1989, pages = {568-576}}

@article{Thomassen97,
author = {Carsten Thomassen},
title = {A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces},
journal = jctb, volume = 70, year = 1997, pages = {306-311}}

@article{Thorup98,
author = {Mikkel Thorup},
title = {Structured Programs have Small Tree-Width and Good Register Allocation},
journal = ic2, volume = 142, year=1998, pages = {159-181}}

%To

%Tod

@article{Toda91,
author = {S. Toda},
title = {PP is as hard as the polynomial-time hierarchy},
journal = siamjc, volume = 20, year = 1991, pages = {865-877}}

@article{TodaO92,
author = {S. Toda and M. Ogiwara},
title = {Counting classes are at least as hard as the polynomial-time hierarchy},
journal = siamjc, volume = 21, year = 1992, pages = {316-328}}

@article{Toda94,
author = {Seinosuke Toda},
title = {Simple characterizations of {P($\#$P)} and complete problems},
journal = jcss, volume = 49, year = 1994, pages = {1-17}}

%Tog

@article{TogasakiY02,
author = {Mitsunori Togasaki and Koichi Yamazaki},
title = {Pagenumber of pathwidth-$k$ graphs and strong pathwidth-$k$ graphs},
journal = dm, volume = 259, year = 2002, pages = {361-368}}

%Tor

@article{Toran91,
author = {S. Toran},
title = {Complexity classes defined by counting quantifiers},
journal = jacm, volume = 38, year = 1991, pages = {752-773}}

@article{TorreGS92,
author = {Pilar {de la Torre} and Raymond Greenlaw and Alejandro A.  Sch\"{a}ffer},
title = {Optimal Tree Ranking is in {{\cal NC}}},
journal = ipl, volume = 2, number = 1, year = 1992, pages = {31-41}}

@techreport{TorreGS93,
author = {Pilar {de la Torre} and Raymond Greenlaw and Alejandro A. Sch\"{a}ffer},
title = {A Note on {D}eogun and {P}eng's Edge Ranking Algorithm},
type = {Technical Report},
number = {93-13},
institution = {Department of Computer Science, University of New Hampshire},
address = {Durham, New Hampshire, USA},
year = 1993}

@article{TorreGS95,
author = {Pilar {de la Torre} and Raymond Greenlaw and Alejandro A. Sch\"{a}ffer},
title = {Optimal edge ranking of trees in polynomial time},
journal = alg, volume = 13, year = 1995, pages = {592-618}}

%Tr

%Tra

@article{Traldi06,
author = {Lorenzo Traldi},
title = {On the colored {T}utte polynomial of a graph of bounded treewidth},
journal = dam, volume = 154, year = 2006, pages = {1032-1036}}

%Ts

@article{TsinC84,
author = {Yung H. Tsin and Franciss Y. Chin},
title = {Efficient parallel algorithms for a class of graph theoretic problems},
journal = siamjc, volume = 13, year = 1984, pages = {580-599}}

%Tu

%Tuc

@article{Tucker80,
author = {A. Tucker},
title = {An efficient test for circular-arc graphs},
journal = siamjc, volume = 9, pages = {1-24}, year = 1980 }

@article{Tucker84,
author = {A. Tucker},
title = {An ${O}(n^2)$ algorithm for coloring perfect planar graphs},
journal = ja, volume = 5, year = 1984, pages = {60-68}}

%Tur

@article{Turing36,
author = {Alan Turing},
title = {On computable numbers, with an application to the {E}ntscheidungsproblem},
journal = {Proceedings of the London Mathematical Society Series 2}, volume = 42, year = 1936, pages = {230-265}}

%Tut

@article{Tutte54,
author = {W. T. Tutte},
title = {A short proof of the factor theorem for finite graphs},
journal = {Canadian Journal of Mathematics}, volume = 6, year = 1954, pages = {347-352}}

@article{Tutte60,
author = {W. T. Tutte},
title = {Convex representations of graphs},
journal = {Proceedings of the London Mathematical Society}, volume = 10, year = 1960, pages = {304-320}}

@book{Tutte84,
author = {W. T. Tutte},
title = {Graph Theory},
series = {Encyclopedia of Mathematics and Its Applications},
volume = 21,
year = 1984,
publisher = {Addison-Wesley},
address = {Menlo Park, CA}}

%Tuz

@unpublished{TuzaL??,
author = {Zsolt Tuza and Aristid Lindenmayer},
title = {Locally Generated Colourings of Hexagonal Cell Division Patterns:
Application to Retinal Cell Differentiation},
note = {Manuscript.
To appear in: Memorial Vol.? for A. Lindenmayer}}

@article{Tuza04,
author = {Zsolt Tuza},
title = {Strong branchwidth and local transversals},
journal = dam, volume = 145, pages = {291-296}, year = 2004}

%U

%Ue

%Ueh

@article{UeharaU07,
author = {Ryuhei Uehara and Yushi Uno},
title = {On computing longest paths in small graph classes},
journal = ijfcs, year = 2007, volume = 18, pages = {911-930}}

@inproceedings{Uehara08,
author = {Ryuhei Uehara},
title = {Bandwidth of bipartite permutation graphs},
editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga},
booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {824-835}}

%Un

%Ung

@article{Ungar51,
author = {P. Ungar},
title = {A theorem on planar graphs},
journal = {Journal of the London Mathematical Society}, volume = 26, year = 1951, pages = {256-262}}

%V

%Va

%Val

@article{ValdesTL82,
author = {J. Valdes and Robert Endre Tarjan and Eugene L. Lawler},
title = {The recognition of series parallel digraphs},
journal = siamjc, volume = 11, pages = {298-313}, year = 1982 }

@article{Valiant79,
author = {Leslie Valiant},
title = {The complexity of enumeration and reliability problems},
journal = siamjc, volume = 6, year = 1979, pages = {410-421}}

@article{Valiant79a,
author = {Leslie Valiant},
title = {The complexity of computing the permanent},
journal = tcs, volume = 8, year = 1979, pages = {189-201}}

%Van

@article{VanEmdeBoasKZ84,
author = {P. {van {Emde Boas}} and R. Kaas and E. Zijlstra},
title = {Design and implementation of an efficient priority queue},
journal = mst, volume = 10, year = 1984, pages = {99-127}}

%Vas

%article{Vassilevska09,
author = {Virginia Vassilevska},
title = {Efficient algorithms for clique problems},
journal = ipl, year = 2009, volume = 109, pages = {254-257}}

%Vaz

@article{Vazirani89,
author = {Vijay V. Vazirani},
title = {{NC} Algorithms for Computing the Number of Perfect Matchings
in {$K_{3,3}$}-Free Graphs and Related Problems},
journal = ic2, volume = 80, year = 1989, pages = {152-164}}

%Vi

%Vil

@techreport{Villanger05,
author = {Yngve Villanger},
title = {Counting and listing all potential maximal cliques of a graph},
institution = {Department of Informatics, University of Bergen},
address = {Bergen, Norway},
type = {Reports in Informatics},
number = {302},
year = 2005}

@article{Villanger06,
author = {Yngve Villanger},
title = {{Lex M versus MCS-M}},
journal = dm, volume =  306, year = 2006, pages = {393-400}}

@inproceedings{Villanger06a,
author = {Yngve Villanger},
title = {Improved exponential-time algorithms for treewidth and minimum fill-in},  
editor = {Jos\'{e} R. Correa and Alejandro Hevia and Marcos A. Kiwi},
booktitle = latin06, publisher = lncs3887, year = 2006, pages = {800--811}}

@article{VillangerHPT09,
author = {Yngve Villanger and Pinar Heggernes and Christophe Paul and Jan Arne Telle},
title = {Interval completion is fixed parameter tractable},
journal = siamjc, volume = 38, year = 2009, pages = {2007-2020}}

%Vo

@article{Vogler93,
author = {Walter Vogler},
title = {On Hyperedge Replacement and {BNLC} Graph Grammars},
journal = dam, volume = 46, pages = {253-273}, year = 1993}

%W

%Wa

%Wag

@article{Wagner37a,
author = {K. Wagner},
title = {{\"U}ber eine {E}rweiterung eines {S}atzes von {K}uratowski},
journal = {Deut.\ Math.}, volume = 2, year = 1937, pages = {280-285}}

@article{Wagner37,
author = {K. Wagner},
title = {{\"U}ber eine {E}igenshaft der Ebenen {C}omplexe},
journal = {Math. Ann.}, volume = 14, year = 1937, pages = {570-590}}

@inproceedings{WagnerW93,
author = {D. Wagner and K. Weihe},
title = {A linear-time algorithm for edge-disjoint paths in planar graphs},
editor = {Thomas Lengauer},
booktitle = esa93, year = 1993, pages = {384-395}, publisher = lncs726}

%Wal

@article{WaldC83,
author = {J. A. Wald and Charles J. Colbourn},
title = {Steiner Trees, Partial 2-Trees, and Minimum {IFI} Networks},
journal = netw, year = 1983, volume = 13, pages = {159-167}}

@inproceedings{WaldC82,
author = {J. A. Wald and Charles J. Colbourn},
title = {Steiner trees in outerplanar graphs},
booktitle = {Proceedings of the 13th Southeastern Conf. on Combinatorics, Graph Theory, and Computing},
publisher = {Utilitas Mathematica Publishing, Winnipeg, Ont.},
year = 1982
}

@article{Walter78,
author = {J. Walter},
title = {Representations of chordal graphs as subgraphs of a tree},
journal = jgt, volume = 2, year = 1978, pages = {265-267}}

%Wan

%Wang

%Wang 2008

@article{WangLL08,
author = {Rui Wang and Francis C. M. Lau and Yan Yan Liu},
title = {On the hardness of minimizing space for all-shortest-path interval routing schemes},
journal = tcs, volume = 389, year = 2008, pages = {250-264}}

%Wang 2010

@article{WangNFC10,
author = {Jianxin Wang and Dan Ning and Qilong Feng and Jianer Chen},
title = {An improved kernelization for {$P_2$}-packing},
journal = ipl, volume = 110, year = 2010, pages = {188-192}}


%Wank

@article{WankeW89,
author = {Egon Wanke and Manfred Wiegers},
title = {Undecidability of the bandwidth problem on linear graph languages},
journal = ipl, volume = 33, year = 1989, pages = {193-197}}

@techreport{Wanke91,
author = {Egon Wanke},
title = {$k$-{NLC} Graphs and polynomial algorithms},
number = {80},
type = {Bericht, Reihe Informatik},
institution = {Universit\"{a}t Paderborn},
year = 1991, pages = {1-19}}

@article{Wanke94,
author = {Egon Wanke},
title = {Bounded Tree-width and {LOGCFL}},
journal = ja, volume = 16, year = 1994, pages = {470-491}}

@article{Wanke94a,
author = {Egon Wanke},
title = {$k$-NLC graphs and polynomial algorithms},
journal = dam, volume = 54, year = 1994, pages = {251-266}}

@article{Wanless01,
author = {I. M. Wanless},
title = {Path achievement games},
journal = {Austalasian Journal of Combinatorics}, volume = 23, year = 2001, pages = {9-18}}

%Wax

@article{WaxmanI88,
author = {Bernard M. Waxman and Makoto Imase},
title = {Worst-case performance of {R}ayward-{S}mith's {S}teiner tree heuristic},
journal = ipl, volume = 29, year = 1988, pages = {283-287}}

%We

%Wei

@article{WeifanY06,
author = {Wang Weifan and Wang Yiqiao},
title = {$L(p,q)$-labeling of {$K_4$}-minor free graphs},
journal = ipl, volume = 98, year = 2006, pages = {169-173}}

%Wen

@inproceedings{Wen90,
author = {W. X. Wen},
title = {Optimal decomposition of belief networks},
editor = {P. P. Bonissone and M. Henrion and L. N. Kanal and J. F. Lemmer},
booktitle = uai90, year = 1990, pages = {245--256}, publisher = {Elsevier}}

%Wes

@book{West01,
author =  {D. B. West},
title = {Introduction to graph theory},
publisher = {Prentice Hall},
year = {2001}}

@article{WestbrookT92,
author = {J. Westbrook and R. E. Tarjan},
title = {Maintaining bridge-connected and biconnected components on line},
journal = alg, volume = 7, year = 1992, pages = {433-464}}

%Wh

%Whi

@article{WhiteFP85,
author = {K. White and M. Farber and W. Pulleyblank},
title = {Steiner tress, connected domination and strongly chordal graphs},
journal = networks, volume = 15, year = 1985, pages = {109-124}}

@article{Whitesides81,
author = {S. Whitesides}, 
title = {An algorithm for finding clique cutsets},
journal = ipl, volume = 12, year = 1981, pages = {31-32}}

%Wi

%Wid

@inproceedings{Widmayer86,
author = {P. Widmayer},
title = {On approximation algorithm for {S}teiner's problem in graphs},
editor = {G. Tinhofer and G. Schmidt},
booktitle = wg86, publisher = lncs246, year = 1986, pages = {17-28}}

%Wie

@inproceedings{Wiegers86,
author = {Manfred Wiegers},
title = {Recognizing Outerplanar Graphs in Linear Time},
editor = {G. Tinhofer and G. Schmidt},
booktitle = wg86, publisher = lncs246, year = 1986, pages = {165-176}}

@inproceedings{WiegersM88,
author = {Manfred Wiegers and Burkhard Monien},
title = {Bandwidth and Profile Minimization},
editor = {J. van Leeuwen},
booktitle = wg88, publisher = lncs344, pages = {378-393}, year = 1988}

@inproceedings{Wiegers90,
author = {Manfred Wiegers},
title = {The $k$-section of treewidth restricted graphs},
editor = {B. Rovan},
booktitle = mfcs90, publisher = lncs452, year = 1990, pages = {530-537}}

%Wil

@article{Wilf87,
author = {H. Wilf},
title = {Finite Lists of Obstructions},
journal = amm, volume = 94, year = 1987, pages = {267-271}}

@article{Williams09,
author = {Ryan Williams},
title = {Finding paths of length $k$ in {$O^\ast(2^k)$} time},
journal = ipl, volume = 109, year = 2009, pages = {315-318}}

@article{Williamson84,
author = {S. G. Williamson},
title = {Depth-first search and {K}uratowski subgraphs},
journal = jacm, volume = 31, year = 1984, pages = {681-693}}

%Wim

@article{WimerHL85,
author = {T. V. Wimer and S. T. Hedetniemi and R. Laskar},
title = {A methodology for constructing linear graph algorithms},
journal = cn, volume = 50, year = 1985, pages = {43-60}}

@techreport{WimerH86,
author = {T. V. Wimer and S. T. Hedetniemi},
title = {$k$-Terminal Recursive Families of Graphs},
institution = {Clemson University},
year = 1986
}

@phdthesis{Wimer87,
author = {T. V. Wimer},
title = {Linear Algorithms on $k$-Terminal Graphs},
school = {Dept. of Computer Science, Clemson University},
year = 1987
}

@article{Wimer87a,
author = {T. V. Wimer},
title = {Linear algorithms for the dominating cycle problems in series-parallel graphs, 2-trees and {H}alin graphs},
year = 1987, journal = cn, volume = 56 }

%Win

@article{Winter85,
author = {Pawel Winter},
title = {Generalized {S}teiner problem in outerplanar graphs},
journal = bit, volume = 25, year = 1985, pages = {485-496}}

@article{Winter86,
author = {Pawel Winter},
title = {Generalized Steiner problem in {H}alin networks},
journal = ja, volume = 7, year = 1986, pages = {549-566}}

@article{Winter87,
author = {P. Winter},
title = {Steiner problem in networks: {A} survey},
journal = netw, volume = 17, year = 1987, pages = {129-167}}

%Wo

%Woe

@inproceedings{Woeginger03,
author = {Gerhard J. Woeginger},
title = {Exact algorithms for {NP}-hard problems: {A} survey},
booktitle = {Combinatorial Optimization: ''Eureka, you shrink''},
publisher = {Springer Lecture Notes in Computer Science, vol.~2570},
address = {Berlin}, year = 2003, pages = {185-207}}

@inproceedings{Woeginger04,
author = {Gerhard J. Woeginger},
title = {Space and time complexity of exact algorithms: some open problems
(invited talk)},
editor = {R. G. Downey and M. R. Fellows},
booktitle = iwpec04, publisher = lncs3162, year = 2004, pages = {281-290}}

@article{Woeginger08,
author = {Gerhard J. Woeginger},
title = {Open problems around exact algorithms},
journal = dam, volume = 156, year = 2008, pages = {397-405}}

%Wol

@techreport{WolleKB04,
author = {Thomas Wolle and Arie M. C. A. Koster and Hans L. Bodlaender},
title = {A Note on Contraction Degeneracy},
institution = {Institute of Information and Computing Sciences, Utrecht University},
address = {Utrecht, The Netherlands},
year = 2004,
type = {Technical Report},
number = {UU-CS-2004-042}}

@techreport{WolleB04,
author = {Thomas Wolle and Hans L. Bodlaender},
title = {A Note on Edge Contraction},
institution = {Institute of Information and Computing Sciences, Utrecht University},
address = {Utrecht, The Netherlands},
year = 2004,
type = {Technical Report},
number = {UU-CS-2004-028}}

@phdthesis{Wolle05,
author = {Thomas Wolle},
title = {Computational Aspects of Treewidth. {L}ower Bounds and Network
Reliability},
school = {Faculty of Science, Utrecht University},
address = {Utrecht, the Netherlands},
year = 2005}

%Woo

@inproceedings{Wood02,
author = {David R. Wood},
title = {Queue layouts, tree-width, and three-dimensional graph drawing},
booktitle = fsttcs02, pages = {348-359}, year = 2002, publisher = lncs2556}

@inproceedings{WoodT06,
author = {David R. Wood and Jan Arne Telle},
title = {Planar decompositions and the crossing number of graphs with an excluded minor},
editor = {Michael Kaufmann and Dorothea Wagner},
booktitle = gd06, year = 2006, publisher = lncs4372, pages = {150-161}}

%Wu

@article{WuZ08,
author = {Jiaojiao Wu and Xuding Zhu},
title = {Lower bounds for the game colouring number of partial $k$-trees
and planar graphs},
journal = dm, volume = 308, year = 2008, pages = {2637-2642}}

%Wul

@article{WuDJLH06,
author = {Weili Wul and Hongwei Dul and Xiaohua Jial and Yingshu Li and
Scott C.-H. Huang},
title = {Minimum connected dominating sets and maximal independent sets in
unit disk graphs},
journal = tcs, volume = 352, pages = {1-7}, year = 2006}


%X

%Xi

%Xin

@article{XingCC06,
author = {Hua-Ming Xing and Xin Chen and Xue-Gang Chen},
title = {A note on {R}oman domination in graphs},
journal = dm, volume = 306, year = 2006, pages = {3338-3340}}

%Xu

%Xue

@article{XueCN05,
author = {Y. Xue and Y. Cui and K. Nahrstedt},
title = {Maximizing Lifetime for Data Aggregation in Wireless Sensor Networks},
journal = {Mobile Networks and Applications},
volume = 10, pages = {853-864}, year = {2005}}

%Y

%Ya

%Yam

@article{YamaguchiAM03,
author = {Atsuko Yamaguchi and Kiyoko F. Aoki and Hiroshi Mamitsuka},
title = {Graph complexity of chemical compounds in biological pathways},
journal = {Genome Informatics}, volume = 14, year = 2003, pages = {376-377}}

@article{YamaguchiAM04,
author = {Atsuko Yamaguchi and Kiyoko F. Aoki and Hiroshi Mamitsuka},
title = {Finding the maximum common subgraph of a partial $k$-tree and a graph with a polynomially bounded number of spanning trees},
journal = ipl, volume = 92, year = 2004, pages = {57-63}}

@inproceedings{YamazakiBFT97,
author = {Koichi Yamazaki and Hans L. Bodlaender and Babette {de Fluiter} and Dimitrios Thilikos},
title = {Isomorphism for graphs of bounded distance width},
booktitle = ciac97, publisher = lncs1203, year = 1997, pages = {276-287}}

@article{Yamazaki01,
author = {Koichi Yamazaki},
title = {On approximation intractability of the path-distance-width problem},
journal = dam, volume = 110, pages = {317-325}, year = 2001}

@article{YamazakiBFT99,
author = {Koichi Yamazaki and Hans L. Bodlaender and Babette {de Fluiter} and
Dimitrios Thilikos},
title = {Isomorphism for graphs of bounded distance width},
journal = alg, volume = 24, pages = {105-127}, year = 1999}

%Yan

@mastersthesis{Yan89,
author = {X. Yan},
title = {A relative approximation algorithm for computing the pathwidth of outerplanar graphs},
type = {Master thesis},
school = {Department of Computer Science, Washington State University},
address = {Pullman, WA, USA},
year = 1989}

@article{YangC08,
author = {Boting Yang and Yi Cao},
title = {Digraph searching, directed vertex separation and directed pathwidth},
journal = dam, volume = 156, year = 2008, pages = {1822-1837}}

@article{YannakakisG80,
author = {Mihalis Yannakakis and Fanica Gavril},
title = {Edge dominating sets in graphs},
journal = sjam, volume = 38, year = 1980, PAGES = {364-372}}

@article{Yannakakis81,
author = {Mihalis Yannakakis},
title = {Computing the minimum fill-in is {NP}-complete},
journal = sjadm, volume = 2, year = 1981, pages = {77-79}}

@article{Yannakakis85,
author = {Mihalis Yannakakis},
title = {A polynomial algorithm for the Min-Cut Linear Arrangement
of trees},
journal = jacm, volume = 32, year = 1985, pages = {950-988}}

@article{YannakakisG87,
author = {Mihalis Yannakakis and Fanica Gavril},
title = {The maximum $k$-colorable subgraph problem for chordal graphs},
journal = ipl, volume = 24, year = 1987, pages = {133-137}}

@article{Yannakakis89,
author = {Mihalis Yannakakis},
title = {Embedding Planar Graphs in Four Pages},
journal = jcss, volume = 38, year = 1989, pages = {36-67}}

%Yap

@book{Yap86,
author = {H. P. Yap},
title = {Some Topics in Graph Theory},
address = {Cambridge, UK},
series = {London Mathematical Society Lecture Note Series},
volume = 108,
year = 1986,
publisher = {Cambridge Univ. Press}}

%Ye

%Yeh

@article{Yeh06,
author = {Roger K. Yeh},
title = {A survey on labeling graphs with a condition at distance two},
journal = dm, volume = 306, pages = {1217-1231}, year = 2006}

%Yen

@article{Yen02,
author = {W. C. K. Yen},
title = {Bottleneck domination and bottleneck independent domination on
graphs},
journal = jise, volume = 18, year = 2002, pages = {311-331}}

%Yu

@article{YuC94,
author = {Chang-Wu Yu and Gen-Huey Chen},
title = {A theorem on permutation graphs with applications},
journal = {Information Sciences}, volume = 77, year = 1994, pages = {177-193}}

%Z

%Ze

%Zei

@article{ZeitlhoferW03,
author = {Thomas Zeitlhofer and Bernhard Wess},
title = {List-coloring of interval graphs with application to register assignment for heterogeneous register-set architectures},
journal = {Signal Processing}, volume = 83, year = 2003, pages = {1411-1525}}

%Zh

%Zha

@article{ZhangGW09,
author = {Zhao Zhang and Xiaofeng Gao and Weili Wu},
title = {{PTAS} for connected vertex cover in unit disk graphs},
journal = tcs, volume = 410, year = 2009, pages = {5398-5402}}

@book{ZhaoG04,
author = {F. Zhao and L. Guibas},
title = {Wireless Sensor Networks: An Information Processing Approach},
publisher = {Morgan Kaufman},
year = 2004}

@inproceedings{ZhaoCC07,
author = {Jizhen Zhao and Dongsheng Che and Liming Cai},
title = {Comparative pathway annotation with protein-{DNA} interaction and operon information via graph tree decomposition},
booktitle = {Proceedings of Pacific Symposium on Biocomputing, PSB 2007},
pages = {496-507}, year = {2007}, volume ={12}}

@Article{ZhaoMC08,
author = {Jizhen Zhao and Russell L. Malmberg and Liming Cai},
title = {Rapid ab initio Prediction of {RNA} Pseudoknots via Graph Tree Decomposition},
journal = {Journal of Mathematical Biology}, year = {2008}, volume = 56, number = {1--2}, pages = {145--159}}

%Zho

%Zhou 1992

@inproceedings{ZhouNSN92,
author = {X. Zhou and S. Nakano and H. Suzuki and T. Nishizeki},
title = {An efficient algorithm for edge-coloring series-parallel multigraphs},
editor = {I. Simon},
year = 1992, booktitle = latin92, publisher = lncs583, pages = {516-529}}

@unpublished{ZhouNSN92a,
author = {X. Zhou and S. Nakano and H. Suzuki and T. Nishizeki},
title = {Efficient Algorithm for Edge-Coloring Partial $k$-Trees},
year = 1992,
institution = {Department of Information Engineering, Tohoku University},
address ={Sendai, Japan},
note = {Manuscript}}

%Zhou 1993

@inproceedings{ZhouNN93,
author = {X. Zhou and S. Nakano and T. Nishizeki},
title = {A linear algorithm for edge-coloring partial $k$-trees},
editor = {Thomas Lengauer},
booktitle = esa93, year = 1993, pages = {409-418}, publisher = lncs726 }

%Zhou 1994

@inproceedings{ZhouN94,
author = {X. Zhou and T. Nishizeki},
title = {An efficient algorithm for edge-ranking trees},
editor = {Jan van Leeuwen},
booktitle = esa94, year = 1994, pages = {118-129}, publisher = lncs855}

%Zhou 1995

@inproceedings{ZhouN95,
author = {X. Zhou and T. Nishizeki},
title = {Finding optimal edge-rankings of trees},
booktitle = soda95, year = 1995, pages = {122-131}}

@article{ZhouN95a,
author = {X. Zhou and T. Nishizeki},
title = {Optimal parallel algorithms for edge-coloring partial $k$-trees with bounded degrees},
journal = {IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science},
volume = {E78-A}, pages = {463-469}, year = 1995}

@article{ZhouNN95,
author = {Xiao Zhou and Nobuaki Nagai and Takao Nishizeki},
title = {Generalized vertex-rankings of trees},
year = 1995, journal = ipl, volume = 56, pages = {321-328}}

%Zhou 1996

@article{ZhouNN96,
author = {Xiao Zhou and S. Nakano and Takao Nishizeki},
title = {Edge-coloring partial $k$-trees},
journal = ja, volume = 21, year = 1996, pages = {598-617}}

@article{ZhouSN96,
author = {Xiao Zhou and Hitoshi Suzuki and Takao Nishizeki},
title = {A linear algorithm for edge-coloring series-parallel multigraphs},
journal = ja, volume = 20, year = 1996, pages = {174-201}}

@inproceedings{ZhouTN96,
author = {Xiao Zhou and Syurei Tamura and Takao Nishizeki},
title = {Finding edge-disjoint paths in partial $k$-trees},
editor = {Tetsuo Asano and Yoshidie Igarashi and Hiroshi Nagamochi and Satoru Miyano and Subhash Suri},
booktitle = isaac96, publisher = lncs1178, year = 1996, pages = {203-212}}

%Zhou 1997

@inproceedings{ZhouKN97,
author = {Xiao Zhou and Md. Abul Kashem and Takao Nishizeki},
title = {Generalized edge-ranking of trees},
editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti-Spaccamela},
booktitle = wg96, pages = {390-404}, year = 1997, publisher = lncs1197}

%Zhou 2000

@article{ZhouFN00,
author = {X. Zhou and K. Fuse and Takao Nishizeki},
title = {A linear algorithm for finding $[g,f]$-colorings of partial $k$-trees},
journal = alg, volume = 27, pages = {227-243}, year = 2000}

@article{ZhouKN00,
author = {X. Zhou and Y. Kanari and Takao Nishizeki},
title = {Generalized vertex-colorings of partial $k$-trees},
journal = {IEICE Trans E.83-A}, volume = 4, year = 2000, pages = {671-677}}

%Zhu

@article{Zhu00,
author = {Xuding Zhu},
title = {The game coloring number of pseudo partial $k$-trees},
journal = dam, volume = 215, year = 2000, pages = {245-262}}

%Zm

@article{ZmazekZ04,
author = {Bla\~ Zmazek and Janez \~{Z}erovnik},
title = {The obnoxious center problem on weighted cactus graphs},
journal = dam, volume = 136, pages = {377-386}, year = 2004}

%%%% REFERENCES WITHOUT AUTHOR NAMES %%%%

@misc{TreewidthLIB,
key = {TreewidthLIB},
title= {TreewidthLIB},
year = {2004-- \ldots},
url = {http://www.cs.uu.nl/people/hansb/treewidthlib},
howpublished = {http://www.cs.uu.nl/people/hansb/treewidthlib}
}

@Misc{DIMACS_challenge2,
key = {DIMACS},
title = {The Second {DIMACS} Implementation Challenge: {NP-Hard Problems:
Maximum Clique, Graph Coloring, and Satisfiability}},
howpublished = {See http://dimacs.rutgers.edu/Challenges/},
year = {1992--1993}
}

@misc{Boost,
key = {Boost},
title = {Boost {C}++ Libraries},
howpublished = {http://www.boost.org/},
year = {1999--2009}
}

@misc{Koster2008,
  key={ComputeTW},
  author = {Arie M. C. A. Koster},
  title={{ComputeTW} -- {A}n interactive platform for computing Treewidth of graphs},
  year={2009},
  note = {http://www.math2.rwth-aachen.de/{$\sim$}koster/ComputeTW}
}