Taken from http://www.staff.science.uu.nl/~bodla101/graphs-bib/graphs.bib

% When updating this file with the svn-system, please follow the general
% format:

% 1. The key is formed as follows:
%    - First the last name of the first author in full
%    - Then for each other author the first letter of its last name
%    - Then the last two digits of the year of publication
%    - In case there are more papers with the same key, then make
%      the second and further distinct by adding an "a", "b", etc.
%    - There is one exception (see RobertsonS1 etc.)
%    
% 2. Put the paper in place where it is sorted according to the following
%    rules:
%    - Papers are first sorted with respect to the last name of the first
%      author
%    - Then, the year of appearance is used
%    - And then (but the file doesn't follow the rule always), use the rest
%      of the key (names of other authors, year)
%    - At the end of the file, there are references without list of authors
%      (e.g., websites)
%    - In comments, guidelines for alphabetical ordening and searching are
%      given
%
% 3. Use { and } for the enclosing of strings, not " ".
%
% The file has first some string definitions - you can guess the system
% and, if useful, add similar definitions, and then the papers in order
% as described above.
% 

%
% For many years, I added many papers to my bibtex-file. The system is
% more or less as designed back then, plus some modifications made
% over the years.
%                         Hans Bodlaender, August 23, 2005

%
%
%         ABBREVIATIONS
%
%         OF JOURNAL-NAMES
%

@string{adm = "Annals Discrete Math."}
@string{ai = "Acta Informatica"}
@string{artint = "Artificial Intelligence"} 
@string{alg = "Algorithmica"}
@string{amm = "Amer. Math. Monthly"}
@string{aor = "Annals of Operations Research"}
@string{apal = "Annals of Pure and Applied Logic"}
@string{amsuh = "Abh. Math. Sem. Univ. Hamburg"}
@string{beatcs = "Bulletin of the EATCS"}
@string{bit = "BIT"}
@string{cacm = "Comm. ACM"}
@string{canjm = "Canad. J. Math."}
@string{cj = "Computer Journal"}
@string{cm = "Contemporary Mathematics"}
@string{cn = "Congressus Numerantium"}
@string{comb = "Combinatorica"}
@string{combinatorica = "Combinatorica"}
@string{comp = "Computing"}
@string{cpc = "Combinatorics, Probability, and Computing"}
@string{dm = "Disc. Math."}
@string{dam = "Disc. Appl. Math."}
@string{dcg = "Discrete and Computational Geometry"}
@string{elemmath = "Elem. Math."}
@string{ejc = "The Electronic Journal of Combinatorics"}
@string{ejor = "European Journal of Operational Research"}
@string{gc = "Graphs and Combinatorics"}
@string{ic = "Information and Control"}
@string{ic2 = "Information and Computation"}
@string{ietc = "IEEE Trans. on Computers"}
@string{ieeetc = "IEEE Trans. on Computers"}
@string{ieeetcs = "IEEE Trans. on Circuits and Systems"}
@string{ieeetct = "IEEE Trans. on Circuit Theory"}
@string{ieeeted = "IEEE Trans. on Electronic Devices"}
@string{ieeetse = "IEEE Trans. on Software Eng."}
@string{ijcis = "Int. J. of Computer and System Sciences"}
@string{ijcm = "Int. J. Comput. Math."}
@string{ijfcs = "Int. J. Found. Computer Science"}
@string{informsjc = "Informs J. on Computing"}
@string{ipl = "Information Processing Letters"}
@string{ja = "J. Algorithms"}
@string{jair = "J. Artificial Intelligence Research"}
@string{jacm = "J. ACM"}
@string{jct = "J. Comb. Theory"},
@string{jcta = "J. Comb. Theory Series A"},
@string{jctb = "J. Comb. Theory Series B"},
@string{jco = "Journal of Combinatorial Optimization"}
@string{jgaa  = "J. Graph Algorithms and Applications"}
@string{jgt  = "J. Graph Theory"}
@string{jip  = "J. Information Processing"}
@string{jcss  = "J. Comp. Syst. Sc."}
@string{jpdc  = "J. Parallel and Distributed Computing"}
@string{math  = "Mathematika"}
@string{mor  = "Mathematics of Operations Research"}
@string{mp  = "Math. Programming"}
@string{mst  = "Mathematical Systems Theory"}
@string{netw  = "Networks"}
@string{networks  = "Networks"}
@string{or = "Operations Research"}
@string{orl  = "Operations Research Letters"}
@string{pms  = "Probability and Mathematical Statistics"}
@string{siamjc = "SIAM J. Comput."}
@string{sjam = "SIAM J. Appl. Math."}
@string{sjadm = "SIAM J. Alg. Disc. Meth."}
@string{sjdm = "SIAM J. Disc. Math."}
@string{sjna = "SIAM J. Num. Anal."}
@string{tcs = "Theor. Comp. Sc."}

@string{vi= "Department of Computer Science, Utrecht University"},
@string{tr= "Technical Report"}

@string{stoc79 = "Proceedings of the 11th Annual Symposium on Theory of Computing"}
@string{stoc80 = "Proceedings of the 12th Annual Symposium on Theory of Computing"}
@string{stoc81 = "Proceedings of the 13th Annual Symposium on Theory of Computing"}
@string{stoc82 = "Proceedings of the 14th Annual Symposium on Theory of Computing"}
@string{stoc83 = "Proceedings of the 15th Annual Symposium on Theory of Computing"}
@string{stoc84 = "Proceedings of the 16th Annual Symposium on Theory of Computing"}
@string{stoc85 = "Proceedings of the 17th Annual Symposium on Theory of Computing"}
@string{stoc86 = "Proceedings of the 18th Annual Symposium on Theory of Computing"}
@string{stoc87 = "Proceedings of the 19th Annual Symposium on Theory of Computing"}
@string{stoc88 = "Proceedings of the 20th Annual Symposium on Theory of Computing"}
@string{stoc89 = "Proceedings of the 21rd Annual Symposium on Theory of Computing"}
@string{stoc90 = "Proceedings of the 22th Annual Symposium on Theory of Computing"}
@string{stoc91 = "Proceedings of the 23th Annual Symposium on Theory of Computing"}
@string{stoc92 = "Proceedings of the 24th Annual Symposium on Theory of Computing"}
@string{stoc93 = "Proceedings of the 25th Annual Symposium on Theory of Computing"}
@string{stoc94 = "Proceedings of the 26th Annual Symposium on Theory of Computing"}
@string{stoc95 = "Proceedings of the 27th Annual Symposium on Theory of Computing"}
@string{stoc96 = "Proceedings of the 28th Annual Symposium on Theory of Computing"}
@string{stoc97 = "Proceedings of the 29th Annual Symposium on Theory of Computing"}

@string{focs75 = "Proceedings of the 16th Annual Symposium on Foundations of Computer Science"},
@string{focs76 = "Proceedings of the 17th Annual Symposium on Foundations of Computer Science"},
@string{focs77 = "Proceedings of the 18th Annual Symposium on Foundations of Computer Science"},
@string{focs78 = "Proceedings of the 19th Annual Symposium on Foundations of Computer Science"},
@string{focs79 = "Proceedings of the 20th Annual Symposium on Foundations of Computer Science"},
@string{focs80 = "Proceedings of the 21rd Annual Symposium on Foundations of Computer Science"},
@string{focs81 = "Proceedings of the 22th Annual Symposium on Foundations of Computer Science"},
@string{focs82 = "Proceedings of the 23th Annual Symposium on Foundations of Computer Science"},
@string{focs83 = "Proceedings of the 24th Annual Symposium on Foundations of Computer Science"},
@string{focs84 = "Proceedings of the 25th Annual Symposium on Foundations of Computer Science"},
@string{focs85 = "Proceedings of the 26th Annual Symposium on Foundations of Computer Science"},
@string{focs86 = "Proceedings of the 27th Annual Symposium on Foundations of Computer Science"},
@string{focs87 = "Proceedings of the 28th Annual Symposium on Foundations of Computer Science"},
@string{focs88 = "Proceedings of the 29th Annual Symposium on Foundations of Computer Science"},
@string{focs89 = "Proceedings of the 30th Annual Symposium on Foundations of Computer Science"},
@string{focs90 = "Proceedings of the 31rd Annual Symposium on Foundations of Computer Science"},
@string{focs91 = "Proceedings of the 32th Annual Symposium on Foundations of Computer Science"},
@string{focs92 = "Proceedings of the 33th Annual Symposium on Foundations of Computer Science"},
@string{focs93 = "Proceedings of the 34th Annual Symposium on Foundations of Computer Science"},
@string{focs94 = "Proceedings of the 35th Annual Symposium on Foundations of Computer Science"},
@string{focs95 = "Proceedings of the 36th Annual Symposium on Foundations of Computer Science"},
@string{focs96 = "Proceedings of the 37th Annual Symposium on Foundations of Computer Science"},


@string{icalp84 = "Proceedings of the 11th International Colloquium
on Automata, Languages and Programming"}
@string{icalp85 = "Proceedings of the 12th International Colloquium
on Automata, Languages and Programming"}
@string{icalp86 = "Proceedings of the 13th International Colloquium
on Automata, Languages and Programming"}
@string{icalp87 = "Proceedings of the 14th International Colloquium
on Automata, Languages and Programming"}
@string{icalp88 = "Proceedings of the 15th International Colloquium
on Automata, Languages and Programming"}
@string{icalp89 = "Proceedings of the 16th International Colloquium
on Automata, Languages and Programming"}
@string{icalp90 = "Proceedings of the 17th International Colloquium
on Automata, Languages and Programming"}
@string{icalp91 = "Proceedings of the 18th International Colloquium
on Automata, Languages and Programming"}
@string{icalp92 = "Proceedings of the 19th International Colloquium
on Automata, Languages and Programming"}
@string{icalp93 = "Proceedings of the 20th International Colloquium
on Automata, Languages and Programming"}
@string{icalp94 = "Proceedings of the 21th International Colloquium
on Automata, Languages and Programming"}
@string{icalp95 = "Proceedings of the 22nd International Colloquium
on Automata, Languages and Programming"}
@string{icalp96 = "Proceedings of the 23rd International Colloquium
on Automata, Languages and Programming"}
@string{icalp97 = "Proceedings of the 24th International Colloquium
on Automata, Languages and Programming"}
@string{icalp98 = "Proceedings of the 25th International Colloquium
on Automata, Languages and Programming"}
@string{icalp99 = "Proceedings of the 26th International Colloquium
on Automata, Languages and Programming"}
@string{icalp00 = "Proceedings of the 27th International Colloquium
on Automata, Languages and Programming"}
@string{icalp01 = "Proceedings of the 28th International Colloquium
on Automata, Languages and Programming"}
@string{icalp02 = "Proceedings of the 29th International Colloquium
on Automata, Languages and Programming"}
@string{icalp03 = "Proceedings of the 30th International Colloquium
on Automata, Languages and Programming"}
@string{icalp04 = "Proceedings of the 31st International Colloquium
on Automata, Languages and Programming"}
@string{icalp05 = "Proceedings of the 32nd International Colloquium
on Automata, Languages and Programming"}

@string{soda90 = "Proceedings of the 1st Annual ACM-SIAM Symposium on
Discrete Algorithms"}
@string{soda91 = "Proceedings of the 2nd Annual ACM-SIAM Symposium on
Discrete Algorithms"}
@string{soda92 = "Proceedings of the 3rd Annual ACM-SIAM Symposium on
Discrete Algorithms"}
@string{soda93 = "Proceedings of the 4th Annual ACM-SIAM Symposium on
Discrete Algorithms"}
@string{soda94 = "Proceedings of the 5th Annual ACM-SIAM Symposium on
Discrete Algorithms"}
@string{soda95 = "Proceedings of the 6th Annual ACM-SIAM Symposium on
Discrete Algorithms"}
@string{soda96 = "Proceedings of the 7th Annual ACM-SIAM Symposium on
Discrete Algorithms"}
@string{soda97 = "Proceedings of the 8th Annual ACM-SIAM Symposium on
Discrete Algorithms"}
@string{soda98 = "Proceedings of the 9th Annual ACM-SIAM Symposium on
Discrete Algorithms"}
@string{soda99 = "Proceedings of the 10th Annual ACM-SIAM Symposium on
Discrete Algorithms"}
@string{soda00 = "Proceedings of the 11th Annual ACM-SIAM Symposium on
Discrete Algorithms"}
@string{soda01 = "Proceedings of the 12th Annual ACM-SIAM Symposium on
Discrete Algorithms"}
@string{soda02 = "Proceedings of the 13th Annual ACM-SIAM Symposium on
Discrete Algorithms"}
@string{soda03 = "Proceedings of the 14th Annual ACM-SIAM Symposium on
Discrete Algorithms"}

@string{wg88 = "Proceedings 14th International Workshop on Graph-Theoretic Concepts in Computer Science WG'88"}
@string{wg89 = "Proceedings 15th International Workshop on Graph-Theoretic Concepts in Computer Science WG'89"}
@string{wg90 = "Proceedings 16th International Workshop on Graph-Theoretic Concepts in Computer Science WG'90"}
@string{wg91 = "Proceedings 17th International Workshop on Graph-Theoretic Concepts in Computer Science WG'91"}
@string{wg92 = "Proceedings 18th International Workshop on Graph-Theoretic Concepts in Computer Science WG'92"}
@string{wg93 = "Proceedings 19th International Workshop on Graph-Theoretic Concepts in Computer Science WG'93"}
@string{wg94 = "Proceedings 20th International Workshop on Graph-Theoretic Concepts in Computer Science WG'94"}
@string{wg95 = "Proceedings 21st International Workshop on Graph-Theoretic Concepts in Computer Science WG'95"}
@string{wg96 = "Proceedings 22nd International Workshop on Graph-Theoretic Concepts in Computer Science WG'96"}
@string{wg97 = "Proceedings 23rd International Workshop on Graph-Theoretic Concepts in Computer Science WG'97"}
@string{wg98 = "Proceedings 24th International Workshop on Graph-Theoretic Concepts in Computer Science WG'98"}
@string{wg99 = "Proceedings 25th International Workshop on Graph-Theoretic Concepts in Computer Science WG'99"}
@string{wg00 = "Proceedings 26th International Workshop on Graph-Theoretic Concepts in Computer Science WG'00"}
@string{wg01 = "Proceedings 27th International Workshop on Graph-Theoretic Concepts in Computer Science WG'01"}
@string{wg02 = "Proceedings 28th International Workshop on Graph-Theoretic Concepts in Computer Science WG'02"}
@string{wg03 = "Proceedings 29th International Workshop on Graph-Theoretic Concepts in Computer Science WG'03"}
@string{wg04 = "Proceedings 30th International Workshop on Graph-Theoretic Concepts in Computer Science WG'03"}


@string{mfcs90 = "Proceedings Conference on Mathematical Foundations of
Computer Science MFCS'90"}

@string{lncs172 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 172"}
@string{lncs210 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 210"}
@string{lncs219 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 219"}
@string{lncs246 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 246"}
@string{lncs291 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 291"}
@string{lncs299 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 299"}
@string{lncs317 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 317"}
@string{lncs318 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 318"}
@string{lncs319 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 319"}
@string{lncs344 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 344"}
@string{lncs382 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 382"}
@string{lncs452 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 452"}
@string{lncs477 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 477"}
@string{lncs510 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 510"}
@string{lncs532 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 532"}
@string{lncs533 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 533"}
@string{lncs583 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 583"}
@string{lncs621 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 621"}
@string{lncs623 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 623"}
@string{lncs650 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 650"}
@string{lncs657 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 657"}
@string{lncs665 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 665"}
@string{lncs700 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 700"}
@string{lncs709 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 700"}
@string{lncs726 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 726"}
@string{lncs762 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 762"}
@string{lncs787 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 787"}
@string{lncs824 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 824"}
@string{lncs831 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 831"}
@string{lncs842 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 842"}
@string{lncs855 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 855"}
@string{lncs894 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 894"}
@string{lncs900 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 900"}
@string{lncs903 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 903"}
@string{lncs955 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 955"}
@string{lncs979 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 979"}
@string{lncs1017 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1017"}
@string{lncs1046 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1046"}
@string{lncs1090 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1090"}
@string{lncs1178 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1178"}
@string{lncs1197 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1197"}
@string{lncs1203 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1203"}
@string{lncs1256 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1256"}
@string{lncs1335 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1335"}
@string{lncs1373 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1373"}
@string{lncs1461 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1461"}
@string{lncs1517 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1517"}
@string{lncs1563 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1563"}
@string{lncs1665 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1665"}
@string{lncs1770 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1770"}
@string{lncs1776 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1776"}
@string{lncs1893 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1893"}
@string{lncs2076 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2076"}
@string{lncs2125 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2125"}
@string{lncs2136 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2136"}
@string{lncs2245 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2245"}
@string{lncs2286 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2286"}
@string{lncs2368 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2368"}
@string{lncs2409 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2409"}
@string{lncs2461 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2461"}
@string{lncs2470 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2470"}
@string{lncs2556 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2556"}
@string{lncs2573 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2573"}
@string{lncs2647 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2647"}
@string{lncs2832 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2832"}
@string{lncs2880 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2880"}
@string{lncs2996 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2996"}
@string{lncs3503 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3503"}
@string{lncs3669 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3669"}

%
%         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, number = 6, pages = {968 - 980}, year = 2003}

%Ab

%Abd

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

%Abr

%Abrahamson 1989

@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}
}

%Abrahamson 1990

@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}}

%Abrahamson 1993

@inproceedings{AbrahamsonDF93,
author = {Karl R. Abrahamson and Rodney G. Downey and Michael R. Fellows},
title = {Fixed-parameter intractability {II}},
booktitle = {Proceedings of the 10th Symposium on Theoretical Computer
Science},
year = 1993, 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}}

%Abrahamson 1995

@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 = {Annals of Pure and Applied Logic}, volume=73, pages = {235-276},
year = 1995}

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

%Ad

%Ada

@inproceedings{AdachiIK81,
author = {A. Adachi and S. Iwata and T. Kasai},
title = {Low level complexity for combinatorial games},
booktitle = {13th Annual ACM Symposium on Theory of Computing},
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, pages = {361-376} , year = 1984}

@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}, pages = {1843-1852}, year = 1987}

%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}}

%Ag

%Aga

@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}}

%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},
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 Hamiltonian 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, pages = {15-17}, year = 1983}

%Al

%Alb

%Alber 2001

@inproceedings{AlberFFFNRS01,
author = {J. Alber and H. Fan and M. R. Fellows and H. Fernau and R.
Niedermeier and F. A. Rosamond and U. Stege},
title = {Refined search tree technique for dominating set on planar graphs},
booktitle = {Proceedings of the 26th International Symposium on Mathematical
Foundations of Computer Science},
publisher = lncs2136, year = 2001, pages = {111-122}}

@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}, 
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

@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},
booktitle = {Proceedings of the 5th Latin American Theoretical Informatics
(LATIN 2002)},
publisher = lncs2286, year = 2002, pages = {613-627}}

%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}

%Als

@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}

%Alo

@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}}

@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.}}

@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},
note = {J. Amer. Math. Soc. (to appear)}}

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

%Am

@inproceedings{Amir01,
author = {E. Amir},
title = {Efficient approximations for triangulation of minimum treewidth},
booktitle = {Proceedings of the 17th Conference on Uncertainty in Artificial
Intelligence}, pages = {7-15},
year = 2001}

%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 = {J. Combin. Theory Ser. B.},
volume = 41, pages = {37-47} }

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

%Ans

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

%Ap

%Apo

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

%App

@article{AppelH77,
author = {K. Appel and W. Haken},
title = {Every planar map is 4-colorable},
journal = {Illinois J. Math},
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

%Arc

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

@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
}

%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},
year = 1985, journal = bit, volume = 25, pages = {2-23} }

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

%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, pages = {277-284}, year = 1987, volume = 8 }

%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 = {J. Expt. Theor. Artif. Intell.},
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, pages = {484-509}, year = 1994}

@article{AspvallPT00,
author = {B. Aspvall and A. Proskurowski and J. A. Telle},
title = {Memory requirements for table computations in partial $k$-tree
algorithms},
volume = 27, year = 2000, journal = alg, 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},
journal = sjadm, year = 1981, volume = 2, pages = {387-392} }

%At

%Ata

@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},
year = 1993,
booktitle = {Proceedings 1st Annual European Symposium on Algorithms ESA'93},
editor = {Thomas Lengauer},
pages = {13-24},
publisher = lncs726,
}

%B

%Ba

%Bab

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

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

%Bac

@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}}

@inproceedings{BachooreB05,
author = {Emgad H. Bachoore and Hans L. Bodlaender},
title = {New upper bound heuristics for treewidth},
editor = {Sotiris E. Nikoletseas},
booktitle = {Proceedings of the 4th International Workshop on Experimental and
Efficient Algorithms WEA 2005},
publisher = lncs3503,
year = 2005,
pages = {217-227}}

%Bad

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

%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}}

%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{BarthFH02,
author = {D. Barth and P. Fragopoulou and M.-C. Heydemann},
title = {Uniform emulations of Cartesian-product and Cayley 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 = {Proc. Graph Theoretic Concepts in Computer Science},
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} }

%Be

%Bec

@inproceedings{BeckerG96,
author = {A. Becker and D. Geiger},
title = {A sufficiently fast algorithm for finding close to optimal
junction trees},
booktitle = {Proceedings of the Twelfth Conference on Uncertainty in
Artificial Intelligence},
publisher = {Morgan Kaufmann}, year = 1996, pages = {81-96}}

@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, pages = {3-17}, year = 2001} 

%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{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} }

%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}}

%Ber

@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 }

@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 }

@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} }

@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} }

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

%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 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 minimal separators of a graph},
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}}

%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 = {Proceedings 28th Int. Workshop on Graph Theoretic Concepts in
Computer Science, WG'02},
publisher = lncs2573, year = 2002, pages = {1-12}}

%Berry 2003

@inproceedings{BerryHS03,
author = {Anne Berry and Pinar Heggernes and Genevieve Simonet},
title = {The minimum degree heuristic and the minimal triangulation process},
booktitle = {Proceedings 29th Int. Workshop on Graph Theoretic Concepts in
Computer Science, WG'03},
publisher = lncs2880, year = 2003, pages = {58-70}}

%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, pages = {287-298}, year = 2004}

@unpublished{BerryBHSV??,
author = {Anne Berry and Jean-Paul Bordat and Pinar Heggernes and Genevieve
Simonet and Yngve Villanger},
title = {A wide-range algorithm for minimal triangulation from an arbitrary
ordering},
note = {Journal of Algorithms, to appear}}

%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},
booktitle = {Proceedings 3rd Scandinavian Workshop on Algorithm Theory},
editor = {O. Nurmi and E. Ukkonen},
publisher = lncs621, year = 1992,
pages = {272-283}}

@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} }

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

@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} }

@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} }

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

%Bey

@inproceedings{BeyerPHM77,
author = {T. Beyer and Andrzej Proskurowski and S. Hedetniemi and S.
Mitchell},
title = {Independent domination in trees},
booktitle = {Proceedings 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

%Bie

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

%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, pages = {53-76}, year = 1988 } }

%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 Ser. 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, year = 1991, volume = 12, 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, pages = {163-189}, year = 1992}

%Bienstock 1993

@unpublished{BienstockL93,
author = {Daniel Bienstock and Michael A. Langston},
title = {Algorithmic implications of the graph minor theorem},
year = 1993, note = {To appear as chapter in: Handbook of Operations Research
and Management Science: Volume on Networks and Distribution}}

%Bl

%Bla

@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}}

@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}}

@inproceedings{BlairBH02,
author = {Jean R. S. Blair and Anne Berry and Pinar Heggernes},
title = {Maximum cardinality search for computing minimal triangulations},
booktitle = {WG 2002}, year = 2002, note = {Fout: Zie BerryBH02}}

%Blo

@techreport{BlokhuisK94,
author = {A. Blokhuis and T. Kloks},
title = {On the equivalence covering number of splitgraphs},
type = {Computing Science Reports},
number = {94-39}, institution = {Department of Computing Science, Eindhoven
University of Technology},
year = 1994}

%Bo

%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, note = {Ext. abstract in proceedings ICALP 88.} }

@inproceedings{Bodlaender87,
author = {Hans L. Bodlaender},
title = {Dynamic programming algorithms on graphs with bounded
tree-width},
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},
booktitle = wg88,
editor = {J. van Leeuwen},
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 = {Bulletin of the EATCS},
pages = {116-126},
volume = 36,
year = 1988
}

@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, pages = {1-23}, year = 1993}

@article{Bodlaender89z,
author = {Hans L. Bodlaender},
title = {On the complexity of some coloring games},
journal = {Int. J. Found. of Comp. Sc.},
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},
year = 1990, volume = 11, journal = ja, 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},
booktitle = icalp91,
publisher = lncs510,
year = 1991, pages = { 544-555},
note = {Extended version available as technical report, Utrecht University.}}

%Bodlaender 1992

@inproceedings{Bodlaender92b,
author = {Hans L. Bodlaender},
title = {Dynamic Algorithms for Graphs with Treewidth 2},
booktitle = wg93,
publisher = {Springer Verlag}, address = {Berlin},
year = 1994,
pages = {112-124}}

@article{Bodlaender92c,
author = {Hans L. Bodlaender},
title = {A Tourist Guide through Treewidth},
journal = {Acta Cybernetica}, 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},
year = 1992,
pages = {273-283},
booktitle = {Proceedings 19th International Colloquium on Automata,
Languages and Programming},
publisher = lncs623,
address = {Berlin}}

@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, year = 1993, volume = 110, pages = {215-245}}

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

@inproceedings{Bodlaender93c,
author = {Hans L. Bodlaender},
title = {Kayles on special classes of graphs --- {An} application of
{S}prague-{G}rundy theory},
booktitle = {Proceedings of the 18th International Workshop on
Graph-Theoretic Concepts in Computer Science, WG'92},
editor = {E. W. Mayr},
year = 1993,
pages = {90-102},
publisher = {Springer Verlag, Lecture Notes in Computer Science,
volume 657}} 

@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, pages = {31-54}, year = 1995}

@misc{BodlaenderF93,
author = {Hans L. Bodlaender and Michael R. Fellows},
year = 1993,
note = {Work in progress}}

@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, pages = {160-172}, year = 1993}

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

%Bodlaender 1994

@article{Bodlaender94c,
author = {Hans L. Bodlaender},
title = {On disjoint cycles},
journal = ijfcs, year = 1994, volume = 5, number = 1, 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}}

%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{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, pages = {238-255}, year = 1995}

@inproceedings{BodlaenderF95,
author = {Hans L. Bodlaender and Babette de Fluiter},
title = {Intervalizing $k$-Colored Graphs},
year = 1995,
pages = {87-98},
editor = {Zolt\'{a}n F\"{u}l\"{o}p and Ferenc G\'{e}cseg},
booktitle = {Proceedings 22nd International Colloquium on Automata,
Languages and Programming},
publisher = {Springer-Verlag, Lecture Notes in Computer Science 944},
address = {Berlin},
note = {Full version appeared as Tech.\ Rep.\ UU-CS-1995-15, Department of
Computer Science, Utrecht University}}

@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}}

@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, pages = {606-616}, year = 1995}

@techreport{BodlaenderT95,
author = {Hans L. Bodlaender and Dimitrios M. Thilikos},
title = {Treewidth and small separators for graphs with small chordality},
institution = vi,
address = {Utrecht},
type = tr,
number = {UU-CS-1995-02},
year = 1995,
note = {To appear in Disc. Appl. Math.}
}

%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},
year = 1996,
editor = {Joseph Diaz and Maria Serna},
booktitle = {Proceedings 4st Annual European Symposium on Algorithms ESA'96,
Lecture Notes on Computer Science, vol. 1136},
pages = {277-289},
publisher = {Springer Verlag},
address = {Berlin}}

@inproceedings{BodlaenderF96a,
author = {Hans L. Bodlaender and Babette de Fluiter},
title = {Reduction algorithms for constructing solutions in
graphs with small treewidth},
booktitle={Proceedings 2nd Annual International Conference on Computing and
Combinatorics, COCOON'96},
editor = {Jin-Yi Cai and Chak Kuen Wong},
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},
booktitle = {Proc. Conference on Pattern Matching},
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},
booktitle = {Proceedings of the 22nd International Symposium on Mathematical
Foundations of Computer Science, MFCS'97,  Lecture Notes in Computer Science,
volume 1295},
editor = {Igor Privara and Peter Ruzicka},
publisher = {Springer-Verlag},
address = {Berlin},
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},
booktitle = {Proceedings 24th International Colloquium on Automata, Languages,
and Programming}, 
editor = {Pierpaolo Degano and Roberto Gorrieri and Alberto
Marchetti-Spaccamela},
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, pages = {1-45}, year = 1998}

@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 = {Proceedings of the Ninth Annual ACM-SIAM
Symposium on Discrete Algorithms (San Francisco, CA, 1998)},
pages = {574--583},
publisher = {ACM},
address = {New York},
year = {1998}, MRCLASS = {68N20}, MRNUMBER = {1 642 971}}

@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, year = 1998, volume = 2, number = 5, 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, pages = {167-188}, year = 2000} 

%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, pages = {543-559}, year = 2001}

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

@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},
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},
booktitle = {Proceedings of the 17th Conference on Uncertainty in Artificial
Intelligence},
editor = {J. Breese and D. Koller},
publisher = {Morgan Kaufmann},
address = {San Francisco},
year = 2001,
pages = {32-39}}

%Bodlaender 2002

@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}}

%Bodlaender 2003

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

@techreport{BodlaenderK03,
author = {Hans L. Bodlaender and Arie M. C. A. Koster},
title = {Safe separators for treewidth},
institution = {Institute for Information and Computing
Sciences, Utrecht University},
address = {Utrecht, The Netherlands},
year = 2003,
number = {UU-CS-2003-027},
note = {Extended abstract in proceedings ALENEX'04}}

@article{BodlaenderR03,
author = {Hans L. Bodlaender and Udi Rotics},
title = {Computing the treewidth and the minimum fill-in with
the modular decomposition},
journal = alg, year = 2003, volume = 36, 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 = {Proc. 30th International Workshop on
Graph-Theoretic Concepts in Computer Science WG 2004},
year = 2004,
pages = {81-92},
publisher = {Springer-Verlag, Lecture Notes in Computer Science 3353}
}

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

@inproceedings{BodlaenderK04b,
author = {Hans L. Bodlaender and Arie M. C. A. Koster},
title = {Safe separators for treewidth},
booktitle = {Proceedings 6th Workshop on Algorithm Engineering and
Experiments ALENEX04},
year = 2004, pages = {70-78}}

@inproceedings{BodlaenderKW04,
author = {Hans L. Bodlaender and Arie M. C. A. Koster and Thomas Wolle},
title = {Contraction and Treewidth Lower Bounds},
booktitle = {Proceedings 12th Annual European Symposium on Algorithms,
ESA2004},
editor = {Susanne Albers and Tomasz Radzik},
year = 2004,
pages = {628-639},
publisher = {Springer, Lecture Notes in Computer Science, vol. 3221}}

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

@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 = {SOFSEM 2005: Theory and Practive of Computer Science: 31st
Conference on Current Trends in Theory and Practive of Computer Science},
year = 2005,
publisher = {Springer-Verlag, Lecture Notes in Computer Science 3381},
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, pages = {143-154}, year = 2004}

@misc{BodlaenderFKKT05,
author = {Hans L. Bodlaender and Fedor V. Fomin and Arie M. C. A. Koster
and Dieter Kratsch and Dimitrios M. Thilikos},
note = {Work in progress}, year = 2005}

@inproceedings{BodlaenderGK05,
author = {Hans L. Bodlaender and Alexander Grigoriev and Arie M. C. A.
Koster},
title = {Treewidth Lower Bounds with Brambles},
booktitle = {Proceedings 13th Annual European Symposium on Algorithms,
ESA2005},
OPTeditor = {},
year = 2005,
OPTpages = {},
publisher = {Springer, Lecture Notes in Computer Science}}

@misc{BodlaenderK05,
author = {Hans L. Bodlaender and Arie M. C. A. Koster},
title = {Treewidth Computations {I}. {U}pper Bounds},
year = 2005,
note = {Paper in preparation}}

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

@misc{BodlaenderK05b,
author = {Hans L. Bodlaender and Arie M. C. A. Koster},
title = {Treewidth Computations {III}. {E}xact Algorithms and Preprocessing},
note = {To appear}}

@unpublished{BodlaenderK05c,
author = {Hans L. Bodlaender and Arie M. C. A. Koster},
title = {Experimental analysis of the {MCS} treewidth lower bound},
year = 2005,
note = {In preparation}
}

@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}}

%Bol

@book{Bollobas78,
author = {B. Bollobas},
title = {Extremal Graph Theory},
publisher = {Academic Press},
address = {London},
year = 1978
}

@book{Bollobas85,
author = {B. Bollobas},
title = {Random Graphs},
address = {London},
publisher = {Academic Press},
year = 1985
}

%Bon

@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 }

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

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

@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

@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} }

@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, year = 1976, volume = 13, pages = {335-379} }

@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, pages = {416-446}, year = 1993}

@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}

@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, pages = {344-378}, year = 1999}

%Bor

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

%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}}

%Bou

%Bouchitte 1998

@inproceedings{BouchitteT98,
author = {Vincent Bouchitt{\'{e}} and Ioan Todinca},
title = {Minimal triangulations for graphs with ``few'' minimal separators},
booktitle = {Proceedings ESA'98},
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 = {Proceedings STACS'99},
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 = {Proceedings STACS'00},
publisher = lncs1770, pages = {503-515}, year = 2000}

%Bouchitte 2001

@article{BouchitteT01,
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}}

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

%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}}

%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} }
%CHECK of t echt deze titel is.

%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},
booktitle = wg92,
address = {Berlin},
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 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 = {Proceedings 28th Int. Workshop on Graph Theoretic Concepts in
Computer Science, WG'02},
publisher = lncs2573, year = 2002, pages = {57-67}}

%Brandstadt 2003

@article{BrandstadtL03,
author = {Andreas Brands\"{a}dt and V. Lozin},
title = {On the linear structure and clique-width of bipartite permutation
graphs},
journal = {Ars Combin.}, 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, pages = {232-241}, year = 2004}

%Bre

@inproceedings{BretscherCHP2003,
author = {Anna Bretscher and Derek Corneil and Michel Habib and Christophe
Paul},
title = {A Simple Linear Time {LexBFS} Cograph Recognition Algorithm},
booktitle = wg03,
editor = {Hans L. Bodlaender},
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},
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},
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}}

@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}}

@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, pages = {311-341}, year = 2004}

@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 = {Proc. 25th Allerton Conf. on Communication, Control and
Computing}, year = 1987,
pages = {397-398}}

%Bu

%Buc

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

%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}}

%Bun

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

%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 }

%By

@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}

%C

%Ca

%Cai

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

@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}}

@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} }

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

@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}

%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},
booktitle = {Proceedings 4th Int. Workshop on Algorithms and Data Structures},
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}}

%Ch

%Cha

@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{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 }

@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} }

@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},
year = 1988,
pages={283-292},
booktitle  = {Proc. 26th Annual Allerton Conference on Communication,
Control, and Computing},
address = {Urbana-Champaign, Illinois}}

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

@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}}

@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}}

@inproceedings{ChaudhuriZ95,
author = {Shiva Chaudhuri and Christos D. Zaroliagis},
title = {Optimal parallel shortest paths in small treewidth digraphs},
booktitle = {Proceedings 3rd Annual European Symposium on Algorithms ESA'95},
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

%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},
booktitle = {Proceedings Third International Symposium on Algorithms and
Computation, ISAAC'92},
year = 1992,
publisher = lncs650,
address = {Berlin},
pages = {21-30}}

%Chen 1993

@inproceedings{Chen93,
author = {J. Chen},
title = {A linear time algorithm for isomorphism of graphs of bounded average
genus},
booktitle = wg92,
address = {Berlin},
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

@inproceedings{ChenFJK01,
author = {Jianer Chen and Donald K. Friesen and Weijia Jia and Iyad Kanj},
title = {Using nondeterminism to design deterministic algorithms},
booktitle = {Proceedings 21st Conference on Foundations of Software Technology
and Theoretical Computer Science, FSTTCS 2001},
year = 2001, pages = {120-131}, publisher = lncs2245}

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

%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{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{Chlebikova92,
author = {J. Chleb{\'\i}kov{\'{a}}},
title = {On the tree width of a graph},
journal = {Acta Math. Univ. Comenianae},
volume = {LXI}, number = 2, pages = {225-236}, year = 1992}

%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

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

@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} }

@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 }

@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}

@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},
booktitle = {Proceedings International Workshop on Experimental and Efficient
Algorithms, WEA 2003},
editor = {J. D. P. Rolim},
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}}

%Co

%Coc

@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} }

@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} }

@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} }

%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},
pages = {99-112},
booktitle = {Proceedings of the 3rd Conference on Integer Programming and
Combinatorial Optimization},
year = 1993}

@inproceedings{CohenT93,
author = {Robert F. Cohen and Roberto Tamassia},
title = {Combine and Conquer},
booktitle = {Proceedings 1st Annual European Symposium on Algorithms ESA'93},
editor = {Thomas Lengauer},
year = 1993,
pages = {97-108},
publisher = lncs726,
}

%Col

@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},
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 = {Ars Combinatorica},
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} }

@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{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 = {Proc. 3rd Ann. Symp. on Theory of Computing}, 
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
Bayesian 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} }

%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}

%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)},
booktitle = {Proceedings of the Latin American Theoretical INformatic,
LATIN'2000},
publisher = lncs1776, year = 2000, address = {New York}, pages = {126-134}}

@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} }

%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}

%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},
booktitle = {Proc. 3rd Int. Workshop on Graph Grammars},
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},
booktitle = {Proc. 3rd Int. Workshop on Graph Grammars},
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 = {Proc. 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}

@techreport{Courcelle89a,
author = {Bruno Courcelle},
title = {The Monadic Second-order Logic of Graphs {VI}: {O}n Several
Representations of Graphs by Relational Structures},
number = {89-99}, institution = {Bordeaux-I University},
note = {To appear in: Discrete Applied Mathematics}, 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}}

@unpublished{Courcelle91a,
author = {Bruno Courcelle},
title = {The Monadic Second-Order Logic of Graphs {VII}: {G}raphs as
Relational Structures}, year = 1991,
note = {Manuscript, to appear in: Theoretical Computer Science}}

%Courcelle 1992

@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{CourcelleM92,
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 1995

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

@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},
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, pages = {23-52}, year = 2001}

%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}

%Cournier

@inproceedings{CournierH93,
author = {A. Cournier and M. Habib},
title = {An efficient algorithm to recognize prime undirected graphs},
booktitle = wg92, address = {Berlin},
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}

%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, pages = {49-53}, year = 2005}

%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},
booktitle = wg92,
address = {Berlin},
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},
pages = {132-143}, year = 1997, booktitle = wg97, publisher = lncs1335}

%Dahlhaus 1998

@inproceedings{Dahlhaus98,
author = {Elias Dahlhaus},
title = {Minimum fill-in and treewidth for graphs modularly decomposable into
chordal graphs},
pages = {351-358}, year = 1998, booktitle = wg98, 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}

%Dag

@article{DagnumL93,
author = {Paul Dagnum and Michael Luby},
title = {Approximating probabilistic inference in Bayesian 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}}

%Dal

@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},
year = 1990, journal = jgt, volume = 14, pages = {427-435}, number = 4}

@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}

%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}}

%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 = {J. Austral. Math. Soc.}, volume = 6, year = 1966, pages = {89-100} }

%De

%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, pages = {41-85}, year = 1999}

%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}}

%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 = {Proceeings of the 13th Annual Symposium on Algorithms and
Computation SODA}, 
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

@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 = {Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete
Algorithms, SODA2005},
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 = {Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete
Algorithms, SODA2005},
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, pages = {245-267}, year = 2005}

%Den

@article{DendrisKT97,
author = {Nick D. Dendris and Lefteris M. Kirousis and Dimitrios M. Thilikos},
title = {Fugitive-Search Games on Graphs and Related Parameters},
opmerking = {Was: DendrisKT95},
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 Trans. Computer Aided Design}, volume = 6,
year = 1987, pages = {79-84} }

@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{DeogunP90,
author = {Jitender S. Deogun and Y. Peng},
title = {Edge ranking of trees},
journal = cn, volume = 79, year = 1990, pages = {19-28}}

%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 = {Proceedings 1st Annual European Symposium on Algorithms ESA'93},
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 = {ACM Computing Surveys}, 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 }

%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, year = 1992, pages = {112-116}, volume = 5}

%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},
booktitle = wg92, address = {Berlin},
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}}

%Dj

@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},
booktitle = {Proc. SWAT'88},
publisher = lncs318, address = {Berlin},
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 }

%Do

%Dol

@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 }

%Don

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

%Dor

@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 = {Proceedings 13th Annual European Symposium on Algorithms ESA'2005},
publisher = lncs3669, pages = {95-106},
year = 2005}

%Dow

%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 Seventh 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 Sixth ACM Workshop on Computational Learning Theory
(COLT)},
pages = {51-57}, year = 1993}

@techreport{DowneyF93,
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},
institution = {Department of Computer Science, University of Victoria},
address = {Victoria, B.C., Canada},
year = 1993,
number = {DCS-216-IR},
opmerking = {Gebruik AbrahamsonRF in plaats hiervan},
note = {To appear in Ann. Pure Appl. Logic}}

@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}

%Downey 1998

@book{DowneyF98,
author = "R. G. Downey and M. R. Fellows",
title = "Parameterized Complexity",
publisher = {Springer},
year = "1998"}

%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}

%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{DrewesK94,
author = {F. Drewes and {H.-J.} Kreowski},
title = {A note on hyperedge replacement},
booktitle = {Proc. 4th International Workshop on Graph Grammars and Their
Application to Computer Science}, 
publisher = lncs532, pages = {1-11}, year = 1994}

%Du

@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 = {J. Math. Anal. Appl.},
year = 1965, volume = 10, pages = {303-318} }

%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

@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, year = 1987, volume = 24, pages = {239-241}}

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

%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

@inproceedings{EijkhofB02,
author = {Eijkhof, Frank {v}an {d}en and Hans L. Bodlaender},
title = {Safe reduction rules for weighted treewidth},
editor = {Lud\u{e}k Ku\u{c}era},
booktitle = {Proceedings 28th Int. Workshop on Graph Theoretic Concepts in
Computer Science, WG'02},
publisher = lncs2573, year = 2002, pages = {176-185}}

@techreport{EijkhofBK02,
author = {Eijkhof, Frank {v}an {d}en and Hans L. Bodlaender and Arie M. C. A.
Koster},
title = {Safe reduction rules for weighted treewidth},
institution = {Konrad-Zuse-Zentrum {f\"ur} Informationstechnik Berlin},
address = {Berlin, Germany}, year = 2002, number = {02--49},
type = {ZIB-report}}


%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, year = 1994, pages = {50-79}, volume = 113}

%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 = {Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
SWAT'02},
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, pages = {123-161}, year = 2004}

@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}}

%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 = {Proc. 16th Ann. Symp. on Foundations of Computer Science},
year = 1975, pages = {75-84}}

@inproceedings{EmdeBoas82,
author = {Peter {van Emde Boas}},
title = {Dominoes are forever},
editor = {L. Priese},
booktitle = {Proc. 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, pages = {301-312}, year = 2003}

%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, pages = {341-378}, year = 1994}

%Engelfriet 1992

@inproceedings{Engelfriet92,
author = {Joost Engelfriet},
title = {A {G}reibach Normal Form for Context-Free Graph Grammars},
booktitle = icalp92,
publisher = lncs623,
pages = {138-149}, editor = {W. Kuich}, 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}}

%Ep

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

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

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

%Er

@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}}

%Es

@inproceedings{EspelageGW01,
author = {Wolfgang Espelage and Frank Gurski and Egon Wanke},
title = {Deciding clique-width for graphs of bounded treewidth},
year = 2001, pages = {87-98},
booktitle = {Proceedings WADS 2001},
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}}

@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} }

@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

@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 K. Kierstead and W. T. Trotter},
title = {On the Game Chromatic Number of Some Classes of Graphs},
journal = {Ars Combin.}, volume = 35, pages = {143-150}, year = 1993}

@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}

%Fe

%Fel

%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},
booktitle = {Proc. 3rd Aegean Workshop on Computing},
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, pages = {1-18},
year = 1989 }

@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},
booktitle = {Proceedings of the 3rd Conference on Computers and
Mathematics},
editor = {E. Kaltofen and S. M. Watt},
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 = {Int. J. 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)},
booktitle = {Proceedings 1st Annual European Symposium on Algorithms ESA'93},
editor = {Thomas Lengauer},
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}

@unpublished{FellowsK,
author = {Michael R. Fellows and P. Kaschube},
title = {Searching for {$K_{3,3}$} in Linear Time},
note = {Journal of Linear and Multilinear Algebra, to appear} }

@inproceedings{FellowsK93,
author = {Michael R. Fellows and N. Koblitz},
title = {Fixed-parameter complexity and cryptography},
booktitle = {Proceedings of the Tenth 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}}

@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},
booktitle = wg92,
address = {Berlin},
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}}

%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},
booktitle = {Proc. 4th Scandinavian Workshop on Algorithm Theory},
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}

@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}

%Fi

%Fia

@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}

%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}}

%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}

%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},
note = {To appear in Proceedings WG'97}, year = 1997}

@article{FlumFG02,
author = {J. Flum and M. Frick and M. Grohe},
title = {Query evaluation via tree-decomposition},
journal = jacm, volume = 49, pages = {716-751}, year = 2002}

%Fo

%Fom

%Fomin 2000

@article{FominG00,
author = {Fedor V. Fomin and P. 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{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 = {Proceedings ESA'2003},
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}}

%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},
booktitle = icalp04,
pages = {568-580}, year = 2004}

@inproceedings{FominT04,
author = {Fedor V. Fomin and Dimitrios M. Thilikos},
title = {A Simple and Fast Approach for Solving Problems on Planar Graphs},
booktitle = {Proc. 21st Symp. Theoretical Aspects of Computer Science (STACS
2004)},
year = 2004,
publisher = lncs2996,
pages = {56-67}}

%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}}

@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},
booktitle = {Proceedings 25th International Symposium on the Mathematical
Foundations of Computer Science, MFCS'2000},
editor = {Mogens Nielsen and Branislav Rovan},
publisher = lncs1893,
pages = {363-372}, year = 2000}

@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, pages = {457-644}, year = 2005}


%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, pages = {21-38} , year = 1987}

%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},
year = 1993, pages = {197-214}, volume = 110, journal = tcs
}

@techreport{FraignaiudG94,
author = {P. Fraignaiud 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}

@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 }

%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, pages = {1004-1022}, year = 1987}

@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

@unpublished{Frederickson93,
author = {Greg N. Frederickson},
title = {Maintaining regular properties dynamically in $k$-terminal graphs},
year = 1993, note = {Manuscript. To appear in {\em Algorithmica}.}}

@inproceedings{Frederickson93a,
author = {Greg N. Frederickson},
title = {A data structure for dynamically maintaining rooted trees},
booktitle = {Proceedings of the 4th ACM-SIAM Symposium on Discrete
Algorithms},
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}

@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}}

%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.}}

%Ful

@article{FulkersonG65,
author = {D. R. Fulkerson and O. A. Gross},
title = {Incidence matrices and interval graphs},
journal = {Pacific J. Math.}, volume = 15, year = 1965, pages = {835-855}}

%Fur

@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 Bayesian Networks},
booktitle = {Proceedings 20th Conference on Uncertainty in Artificial
Intelligence UAI 2004},
year = 2004}

%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 = {41st Annual Symposium on Foundations of Computer Science (FOCS
2000)},
publisher = {IEEE Computer Society},
year = 2000, pages = {410-420}}

%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, pages = {134-149}, year = 1989 }

@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, pages = {30-55}, year = 1989 }

%Gan

@techreport{GanleyH95,
author = {J. L. Ganley and L. 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}

%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 = {Proceedings 20th International Workshop on
Graph Theoretic Concepts in Computer Science WG'94},
publisher = {Springer Verlag, Lecture Notes in Computer Science, vol.
903},
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}

%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} }

@inproceedings{Garg95,
author = {A. Garg},
title = {On drawing angle graphs},
editors = {R. Tamassia and I. G. Tollis},
booktitle = {Proceedings 3rd International Symposium on Graph Drawing GD'94},
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}

%Gav

@unpublished{Gavoille97,
author = {Cyril Gavoille},
title = {On the dilation of interval routing},
note = {In: Proceedings MFCS'97}, year = 1997}

@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}
}

%Ge

%Gee

@article{Geelen00,
author = {James F. Geelen},
title = {An algebraic matching algorithm},
journal = comb, volume = 20, year = 2000, pages = {61-70}}

%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}

%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}

%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},
booktitle = wg92, address = {Berlin},
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},
booktitle = {Proceedings 3rd Scandinavian Workshop on Algorithm Theory},
editor = {O. Nurmi and E. Ukkonen},
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},
year = 1988,
booktitle = {Proceedings of 3rd International Workshop on Parallel
Computation and VLSI AWOC'88}
}

%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},
year = 1964, journal = {Canad. J. Math.}, volume = 16, pages = {539-548} }

%Go

%Gog

@inproceedings{GogateD04,
author = {Vibhav Gogate and Rina Dechter},
title = {A complete anytime algorithm for treewidth},
booktitle = {Proceedings of the 20th Annual Conference on Uncertainty in 
Artificial Intelligence UAI-04},
publisher = {AUAI Press}, address = {Arlington, Virginia, USA},
pages = {201-208}, year = 2004}

%Gol

@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 = {J. Computational Biology}, volume = 2, number = 1, pages = {139-152},
year = 1995}}

@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 }

@inproceedings{GoldschmidthH88,
author = {Olivier Goldschmidt and Dorit S. Hochbaum},
title = {Polynomial algorithm for the $k$-cut problem},
booktitle = focs88, pages = {444-451}, year = 1988 }

@article{Golovach93,
author = {P. 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}}

%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, pages = {251-261},
year = 1994}

%Golumbic 1995

@article{GolumbicKS95,
author = {Martin Charles Golumbic and H. Kaplan and R. Shamir},
title = {Graph Sandwich Problems},
journal = ja, volume = 19, pages = {449-472}, year = 1995}

%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}}

%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},
year = 1998, pages = {372-383}, booktitle = wg98, publisher = lncs1517}

%Got

@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}

@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}

%Gov

@inproceedings{GovindanLR93,
author = {R. Govindran and M. A. Langston and S. Ramachandramurthi},
title = {A practical approach to layout optimization},
booktitle = {Proc. 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

@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}}

@techreport{Graef93,
author = {Albert Gr{\"{a}}f},
title = {Complete Difference Sets and {$T$}-Colorings of Complete Graphs},
institution = {University of Mainz}, year = 1993}

@book{GrahamKP94,
author = {R. L. Graham and D. E. Knuth and O. Patashnik},
title = {Concrete Mathematics},
year = 1994, 
publisher = {Addison-Wesley}}

@unpublished{GranotS88,
author = {Daniel Granot and Darko Skorin-Kapov},
title = {On Some Optimization Problems on $k$-Trees and Partial
$k$-Trees},
year = 1988,
note = {Manuscript, to appear in Discrete Appl. Math.} }

@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}

%Gri

@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} }

%Gro

@article{Grohe03,
author = {Martin Grohe},
title = {Local tree-width, excluded minors, and approximation algorithms},
journal = combinatorica, volume = 23, year = 2003, pages = {613-632}}

@article{Grohe04,
author = {Martin Grohe},
title = {Computing crossing numbers in quadratic time},
journal = jcss, volume = 68, pages = {285-302}, year = 2004}

@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},
booktitle = icalp05,
publisher = {Lecture Notes in Computer Science, Springer},
year = 2005}

%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}

%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)},
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},
booktitle = {Proceedings of the Fourth Scandinavian Workshop on Algorithm
Theory}, 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 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}}

%Gus

@article{GusfieldP86,
author = {D. Gusfield and L. Pitt},
title = {Equivalent approximation algorithms for node cover},
journal = ipl, year = 1986, volume = 22, pages = {291-294} }

@article{Gusfield87,
author = {D. Gusfield},
title = {Three fast algorithms for four problems in stable marriage},
journal = siamjc, volume= 16, year = 1987, pages = {111-128}}

@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}}

@article{Gusfield91,
author = {D. Gusfield},
title = {Efficient algorithms for inferring evolutionary trees},
journal = {Networks}, volume = 21, pages = {19-28}, year = 1991}

@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}}

@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}}

@unpublished{GustedtS92,
author = {Jens Gustedt and Angelika Steger},
title = {Testing Hereditary Properties Efficiently},
year = 1992,
note = {Manuscript}}

@article{Gustedt93,
author = {Jens Gustedt},
title = {On the pathwidth of chordal graphs},
journal = dam, year = 1993, volume = 45, number = 3, pages = {233-248}}

@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}

@inproceedings{GustedtMT02,
author = {J. Gustedt and O. A. M{\ae}hle and J. A. Telle},
title = {The treewidth of {J}ava programs},
booktitle = {Proceedings 4th International Workshop on Algorithm Engineering
and Experiments},
editor = {David M. Mount and Clifford Stein},
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}

@inproceedings{GutjahrWW89,
author = {Wolfgang Gutjahr and Emo Welzl and Gerhart Woeginger},
title = {Polynomial Graph-Colorings},
booktitle = {Proc. STACS '89},
pages = {108-119},
year = 1989 }

%H

%Ha

%Hab

%Habel 1987

@inproceedings{HabelK87,
author = {Annegret Habel and H. J. Kreowski},
title = {May we introduce to you: hyperedge replacement},
booktitle = {Proc. Graph-Grammars and their Applications to Computer
Science '86},
publisher = lncs291,
pages = {15-26},
year = 1987,
editor = {H. Ehrig and M. Nagl and A. Rosenberg} }

@article{HabelK87a,
author = {Annegret Habel and H. J. 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},
booktitle = wg88,
editor = {Jan van Leeuwen},
pages = {11-29},
publisher = lncs344,
year = 1988 }

%Habel 1989

@article{HabelKV89,
author = {Annegret Habel and H.-J. 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 H.-J. Kreowski},
title = {Filtering hyperedge-replacement languages through compatible
properties},
booktitle = wg89,
year = 1990}

%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}}

@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{Habib04,
author = {Michel Habib and Christophe Paul},
title = {A simple linear time algorithm for cograph recognition},
journal = dam, volume = 145, pages = {183-197}, year = 2004}

%Hag

@article{Hagerup88,
author = {Torben Hagerup},
title = {On Saving Space in Parallel Computation},
journal = ipl, volume = 29, pages = {327-329}, year = 1988 }

@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 } }

@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},
year = 1995, booktitle = {Proceedings 6th Annual ACM-SIAM Symposium on
Discrete Algorithms},
pages = {641-649}}

@inproceedings{Hagerup97,
author = {Torben Hagerup},
title = {Dynamic algorithms for graphs of bounded treewidth},
booktitle = {Proceedings 24th International Colloquium on Automata, Languages,
and Programming}, 
editor = {Pierpaolo Degano and Roberto Gorrieri and Alberto
Marchetti-Spaccamela},
publisher = lncs1256,
year = 1997,
pages = {292-302}}

@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}

@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{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}

%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 = {Proc. 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} }

%He

@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 }

@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 }

@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} }

@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}

@inproceedings{He92,
author = {Xin He},
title = {Parallel Algorithms for Cograph Recognition with Applications},
booktitle = {Proceedings 3rd Scandinavian Workshop on Algorithm Theory},
editor = {O. Nurmi and E. Ukkonen},
publisher = lncs621, year = 1992,
pages = {94-105}}

@article{He93,
author = {Xin He},
title = {Parallel algorithms for cograph recognition with applications},
journal = ja, volume = 15, year = 1993, pages = {284-313}}

%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

@inproceedings{HeggernesV02,
author = {Pinar Heggernes and Yngve Villanger},
title = {Efficient implementation of a minimal triangulation algorithm},
booktitle = {Proceedings of the 10th Annual European Symposium on Algorithms,
ESA'2002},
editor = {Rolf M{\"{o}}hring and Rajeev Raman},
publisher = lncs2461,
year = 2002, pages = {550-561}}

@inproceedings{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})$}},
year = 2005,
booktitle = {Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete
Algorithms SODA 2005},
pages = {907-916}}

@unpublished{Heggernes??,
author = {Pinar Heggernes},
title = {Minimal triangulations of graphs: {A} survey},
note = {To appear in Discrete Mathematics}}

%Hel

@article{HeldK62,
author = {M. Held and R. Karp},
title = {A dynamic programming approach to sequencing problems},
journal = {J. SIAM}, 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

@inproceedings{HenzingerK97,
author = {Monika R. Henzinger and Valerie King},
title = {Maintaining minimum spanning trees in dynamic graphs},
booktitle = {Proceedings 24th International Colloquium on Automata, Languages,
and Programming},
editor = {Pierpaolo Degano and Roberto Gorrieri and Alberto
Marchetti-Spaccamela},
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},
booktitle = {Proceedings 3rd Scandinavian Workshop on Algorithm Theory},
editor = {O. Nurmi and E. Ukkonen},
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},
booktitle = {13th Annual Symposium on Theoretical Aspects of Computer
Science STACS'96},
editor = {Claude Puech and R{\"u}diger Reischuk},
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

@unpublished{Hicks05a,
author = {Illya V. Hicks},
title = {Planar branch decompositions {I}: {T}he ratcatcher},
year = 2005,
note = {INFORMS Journal on Computing (to appear)}}

@unpublished{Hicks05b,
author = {Illya V. Hicks},
title = {Planar branch decompositions {II}: {T}he cycle method},
year = 2005,
note = {INFORMS Journal on Computing (to appear)}}

@article{Hicks05,
author = {Illya V. Hicks},
title = {Graphs, Branchwidth, and Tangles! {O}h My!},
journal = networks, volume = 45, year = 2005, pages = {55-60}}

%Hii

%mastersthesis{Hiim97m,
author = {Bj\orn Hiim},
title = {Implementing and testing of algorithms for tree-like graphs},
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 } }

%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} }

%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{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}}

%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},
booktitle = wg92,
address = {Berlin},
year = 1993, publisher = lncs657, pages = {11-16}}

%Hu

@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 M. V. Marathe and V. Radhakrishnan and S. S.
Ravi and D. J. Rosenkrantz and R. 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}

%I

%Id

@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},
booktitle = wg92, address = {Berlin},
year = 1993, publisher = lncs657, pages = {123-134}}

%In

@manual{Inmos91,
title = {The T9000 Transputer Products Overview Manual},
organization = {Inmos}, year = 1991}

%Ir

@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

@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},
booktitle = {Proceedings of Workshop on Algorithms and Data Structures},
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}}

%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}}

%Jam

@article{JamisonO89,
author = {B. Jamison and S. Olariu},
title = {$P_4$-reducible graphs, a class of uniquely tree representable
graphs},
journal = {Studies in Applied Mathematics}, volume = 81, pages = {79-87},
year = 1989}

@article{JamisonO89b,
author = {B. Jamison and S. Olariu},
title = {On a Class of {$P_5$}-Free Graphs},
journal = {Studies in Applied Mathematics}, volume = 81, pages = {33-39},
year = 1989}

@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, pages = {381-406}, year = 1992}

@inproceedings{JamisonO93,
author = {B. Jamison and S. Olariu},
title = {On the homogeneous decomposition of graphs},
booktitle = wg92, address = {Berlin},
year = 1993, publisher = lncs657, pages = {170-183}}

%Jan

@unpublished{Jansen1,
author = {Klaus Jansen},
title = {The processor optimization problem},
note = {Manuscript, to appear in Theor. Comp. Sc.}}

@unpublished{Jansen2,
author = {Klaus Jansen},
title = {Transfer flow graphs},
note = {Manuscript, to appear in Disc. Math.}}

@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} }

@inproceedings{Jansen93,
author = {Klaus Jansen},
title = {On scheduling problems restricted to interval orders},
booktitle = wg92,
address = {Berlin},
year = 1993, publisher = lncs657, pages = {27-36}}

@inproceedings{JansenS93,
author = {Klaus Jansen and Petra Scheffler},
title = {Generalized Coloring for Tree-like Graphs},
booktitle = wg92,
address = {Berlin},
year = 1993, publisher = lncs657, pages = {50-59}}

@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}}

%Je

@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}

%Jo

@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}}

@article{Johnson83,
author = {D. S. Johnson},
title = {The {NP}-completeness column: {An} ongoing guide},
journal = ja, volume = 4, year = 1983, pages = {397-411}}

@article{Johnson85,
author = {David S. Johnson},
title = {The {NP}-completeness Column: An Ongoing Guide},
journal = ja, year = 1985, volume = 6, pages = {434-451}}

@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} }

@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} }

%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}, pages = {259-273}, year = 1982}

%K

%Ka

%Kab

@inproceedings{Kabanets97,
author = {Valentine Kabanets},
title = {Recognizability Equals Definability for Partial $k$-Paths},
booktitle = {Proceedings 24th International Colloquium on Automata, Languages,
and Programming}, 
editor = {Pierpaolo Degano and Roberto Gorrieri and Alberto
Marchetti-Spaccamela},
year = 1997,
publisher = lncs1256,
pages = {805-815}}

%Kaj

@article{KajitaniIU86,
author = {Y. Kajitani and A. Ishizuka and S. Ueno},
title = {A characterization of the partial $k$-tree in terms of certain
substructures},
journal = {Graphs and Combinatorics}, volume = 2, year = 1986,
pages = {233-246}}

@article{KajitaniIU86a,
author = {Y. Kajitani and A. Ishizuka and S. Ueno},
title = {Characterization of partial 3 trees in terms of 3 structures},
journal = gc, volume = 2, year = 1986, pages = {233-246}}

%Kal

@inproceedings{Kaller95,
author = {Damon Kaller},
title = {Definability equals recognizability of partial 3-trees},
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},
booktitle = {Proceedings 4th Workshop on Algorithms and Data Structures},
publisher = lncs955, pages = {403-414}, year = 1995}

@inproceedings{KallerGS95a,
author = {Damon Kaller and A. Gupta and T. Shermer},
title = {The $\chi_t$-coloring problem},
booktitle = {Proceedings 12th Symposium on Theoretical Aspects of Computer
Science},
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}}

%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{KannanW90,
author = {Sampath Kannan and Tandy Warnow},
title = {Inferring Evolutionary History from {DNA} sequences},
booktitle = focs90, year = 1990, pages = {362-371}}

@article{KannanW92,
author = {Sampath Kannan and Tandy Warnow},
title = {Triangulating 3-colored graphs},
journal = sjdm, volume = 5, year = 1992, pages = {249-258}}

@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},
booktitle = wg92, address = {Berlin},
year = 1993, publisher = lncs657, pages = {263-276}}

@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

@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 = {Proceedings of the 35th annual symposium on Foundations of 
	Computer Science (FOCS)},
publisher = {IEEE Computer Science Press}, pages = {780-791}, year = 1994}

@article{KaplanST94a,
author = {Haim Kaplan and Ron Shamir and Robert Endre Tarjan},
title = {Tractability of parameterized completion problems on chordal and
interval graphs},
journal = {Found. Comput. Ser.},
year = 1994, pages = {780 - 791}}

@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}

%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{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}}

%Kay

@article{Kaye00,
author = {Richard Kaye},
title = {Minesweeper is {NP}-complete},
journal = {The Mathematical Intelligencer}, volume = 22, year = 2000,
pages = {9-15}}

%Ke

@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

@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}}

@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} }

@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}}

@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 = {Computer J.}, volume = 37, pages = {449- 462}, year = 1994}

@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} }

@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}, year = 1992, pages = {2-17}, 
volume = 2}

%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}}

@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},
booktitle = {Proceedings Third International Symposium on Algorithms and
Computation, ISAAC'92},
year = 1992,
publisher = lncs650,
address = {Berlin},
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},
booktitle = wg97,
publisher = lncs1335,
year = 1997,
editor = {R. M\"{o}hring},
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{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}}

@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}}

%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}

%Ko

%Kob

@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}}

%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 = {A. M. C. A. Koster and S. P. M. van Hoesel and A. 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 = {A. M. C. A. Koster and H. L. Bodlaender and S. 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 = {A. M. C. A. Koster and S. P. M. van Hoesel and A. W. J. Kolen},
title = {Solving partial constraint satisfaction problems with tree
decomposition},
journal = {Networks}, volume = 40, pages = {170-180}, year = 2002}

%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 = {Proceedings of the 4th International Workshop on Experimental and
Efficient Algorithms WEA 2005},
publisher = lncs3503,
year = 2005,
pages = {101-112}}

%Kr

%Kra

@article{KratochvilN89,
author = {Jan Kratochvil 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 Kratochvil 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 Kratochvil and Zsolt Tusa},
title = {Rankings of directed graphs},
booktitle = wg98, publisher = lncs1517, year = 1998, pages = {114-123}}

@article{Kratsch87,
author = {Dieter Kratsch},
title = {Finding the Minimum Bandwidth of an Interval Graph},
journal = ic2, volume = 74, year = 1987, pages = {140-158} }

@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} }

@misc{Kratsch04,
author = {Dieter Kratsch},
note = {Personal communication}, year = 2004}

%Kre

@unpublished{KreidlerS96,
author = {Martin Kreidler and Detlef Seese},
title = {Monadic {NP} and built-in Trees},
note = {Manuscript}, year = 1996}

@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

@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}}

%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},
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}

%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 = {Proceedings 15th Annual Symposium on Theoretical Aspects of
Computer Science},
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 (UK)},
volume = 7, number = 1, pages = {19-34}, year = 1997}


%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},
booktitle = icalp88,
publisher = lncs317,
pages = {362-378},
year = 1988
}

@inproceedings{Lautemann88a,
author = {Clemens Lautemann},
title = {Decomposition trees: structured graph representation and efficient
algorithms},
booktitle = {Proceedings 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-???}}

%Law

@book{Lawler76,
author = {E. Lawler},
title = {Combinatorial Optimization: Networks and Matroids},
publisher = {Holt, Rinehart and Winston},
address = {New York},
year = 1976 }

@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}

%Lee

@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 = {Computer Journal}, 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}}

%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},
year = 1962, volume = 51, journal = {Fund. Math}, 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},
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 = {Proceedings 16th Ann. ACM Symp. on Theory of Computing},
year = 1984}

%Li

%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 = {Canadian Journal of Mathematics}, year = 1970,
pages = {1082--1096}, volume = 22}

%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}}

%Lingas 1985

@inproceedings{Lingas85,
author = {Andrzej Lingas},
title = {Subgraph Isomorphism for easily separable graphs with bounded
valence},
booktitle = {Proc. 11th Workshop on Graph-Theoretic Concepts in
Computer Science},
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
}

@techreport{LingasK87,
author = {Andrzej Lingas and M. Karpinski},
title = {Subtree Isomorphism and Bipartite Perfect Matching are
Mutually {NC} Reducible},
number = {LITH-IDA-R-87-10},
institution = {Link\"{o}ping University},
year = 1987
, note = {To appear in Inform. Proc. Letters}
}

%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},
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{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{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{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},
booktitle = wg92, address = {Berlin},
year = 1993, publisher = lncs657, pages = {333-345}}

%Liu

@article{Liu90,
author = {J. W. H. Liu},
title = {The role of elimination trees in sparse factorization},
journal = {SIAM J. Matrix Analysis and Applications}, volume = 11,
year = 1990, pages = {134-172}}

@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} }

@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}}

%Ll

@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

%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 = {V. Lozin and D. 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 = {V. Lozin and D. Rautenbach},
title = {Chordal bipartite graphs of bounded tree- and clique-width},
journal = dm, volume = 283, pages = {151-158}, year = 2004}

%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}}

@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}}

@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{Lucet00,
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{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} }

%Mah

@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 }

@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}

@article{Maharry99,
author = {J. Maharry},
title = {An excluded minor theorem for the octahedron},
journal = jgt, volume = 31, pages = {95-100}, year = 1999}

@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, pages = {218-224}, year = 1991}

@inproceedings{MaheshwariZ01,
author = {A. Maheshwari and N. Zeh},
title = {I/O-Efficient Algorithms for Bounded Treewidth Graphs},
booktitle = {Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete
Algorithms (SODA 2001)},
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} }

%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. Marino},
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, pages = {71-84}, year = 1994}

@article{Malitz94a,
author = {Seth M. Malitz},
title = {Genus $g$ Graphs have Pagenumber {$O(\sqrt{g})$}},
journal = ja, volume = 17, pages = {85-109}, year = 1994}

%Man

@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, year = 1984, volume = 13, pages = {109-115} }

@article{Mansfield82,
author = {A. Mansfield},
title = {Determining the thickness of graphs is {NP}-hard},
journal = {Math. Proc. Cambridge Phil. Soc.},
volume = 93, pages = {9-23}, year = 1982 }

@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

@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}}

@article{Marx05,
author = {D. Marx},
title = {Parameterized complexity of constraint satisfaction problems},
journal = {Computational Complexity}, volume = 14, year = 2005, 
pages = {153-183}}

%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

@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, pages = {321-344}, year = 1991}

@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} }

@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} }

%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} }

%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},
booktitle = {Proceedings 3rd Scandinavian Workshop on Algorithm Theory},
editor = {O. Nurmi and E. Ukkonen},
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 = {Proc. 3rd ACM-SIAM Symposium on Discrete Algorithms},
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

%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} }

%Men

@article{Menger27,
author = {K. Menger},
title = {Zur Allgemeinen {K}urventheorie},
journal = {Fund. Math.}, volume = 10, year = 1927, pages = {96-115}}

%Mi

@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}
}

@unpublished{MillerR??,
author = {Gary L. Miller and John Reif},
title = {Parallel Tree Contraction and its Application},
journal = jcss, note = {To appear}}

@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}

@unpublished{Miller??,
author = {Z. Miller},
title = {A Linear Algorithm for Topological Bandwidth in Degree 3
Trees},
note = {Manuscript submitted for publication}
}

@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{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 = {Proc. 14th ICALP, Lecture Notes in Computer Science, Vol.
267},
publisher = {Springer Verlag},
address = {Berlin},
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},
remark = {was Moehring93},
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

@unpublished{MoranW88,
author = {Shlomo Moran and Yaron Wolfstahl},
title = {Optimal Covering of Cacti by Vertex-Disjoint Paths},
year = 1988,
note = {To appear in: Proc. French-Israel Conference on .... }
}

%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},
booktitle = wg92, address = {Berlin},
year = 1993, publisher = lncs657, pages = {236-247}}

%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{MullerS89,
author = {John H. Muller and Jeremy Spinrad},
title = {Incremental Modular Decomposition},
journal = jacm, volume = 36, year = 1989, pages = {1-19} }

@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}}

%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

%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}}

%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}}

%Nas

@article{NashW65,
author = {C. {Nash-Williams}},
title = {On well-quasi ordering infinite trees},
journal = {Proc. Cambridge Phil Soc.},
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

%Ner

@article{NerodeRY96,
author = {Anil Nerode and Jeffrey B. Remmel and Alexander Yakhnis},
title = {McNaughton games and extracting strategies for concurrent programs},
journal = {Annals of Pure and Applied Logic}, year = 1996, volume = 78,
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 = {The Electronic Journal of Combinatorics},
volume = 8, year = 2001, number = 2, pages = {R14}}

%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}}

%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}}

%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}

%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

%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

@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, pages = {21-31}, year = 2002}

%Or

%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} }

%Ou

@article{Oum05,
author = {Sang-il Oum},
title = {Rank-width and vertex-minors},
journal = jctb, volume = 95, pages = {79-100}, year = 2005}

%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

@article{Papadimitriou75,
author = {Christos H. Papadimitriou},
title = {Games Against Nature},
journal = jcss, volume = 31, year = 1985, pages = {288-301}}

@article{Papadimitriou76,
author = {Christos H. Papadimitriou},
title = {The {NP}-completeness of the bandwidth minimization problem},
journal = comp, volume = 16, year = 1976, pages = {263-270} }

@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} }

@book{PapadimitriouS82,
author = {Christos H. Papadimitriou and K. Steiglitz},
title = {Combinatorial Optimization: Algorithms and Complexity},
publisher = {Prentice Hall},
address = {Englewoods Cliffs, NJ},
year = 1982 }

@techreport{PapadimitriouS89,
author = {Christos H. Papadimitriou and Martha Sideris},
title = {The Bisection Width of Grid Graphs},
number = {89.0584},
institution = {CTI Patras},
year = 1989}

@book{Papadimitrou94,
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

@inproceedings{Park02,
author = {J. D. Park},
title = {MAP complexity results and approximation methods},
editor = {A. Darwiche and N. Friedman},
booktitle = {Proceedings of the 18th Conference on Uncertainty in
Artificial Intelligence},
publisher = {Morgan Kaufmann},
pages = {388-396}, year = 2002}

@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}}

@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} }

%Pau

@article{Paul78,
author = {J. L. Paul},
title = {Tic-Tac-Toe in $n$-dimensions},
journal = {Math. Mag.}, year = 1978, pages = {45-49}, volume = 51 }

@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 }

%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}

%Per

@inproceedings{PerkovicR99,
author = {Ljubomir Perkovi{\'{c}} and Bruce Reed},
title = {An improved algorithm for finding tree decompositions of small
width},
editor = {Peter Widmayer},
booktitle = {Proceedings 25th Int. Workshop on Graph Theoretic Concepts in
Computer Science, WG'99},
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 = {SIAM J. Matrix Anal. Appl.},
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} }

%Pl

@inproceedings{PlehnV90,
author = {J\"{u}rgen Plehn and Bernd Voigt},
title = {Finding Minimally Weighted Subgraphs},
booktitle = wg90,
publisher = {Springer Verlag, Lecture Notes in Computer Science,
vol.\ 484}, year = 1991, pages = {18-29} }

%Pi

@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}}

%Pr

%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 = {J. Comb. Theory B.},
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 = {V. Radhakrishnan and H. B. {Hunt III} and R. 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 = {V. Radhakrishnan and H. B. {Hunt III} and R. E. Stearns},
title = {Efficient Algorithms for Hierarchical Descriptions with Bounded
Treewidth},
institution = {Dept. of Computer Science, SUNY Albany},
number = {93-7},
year = 1993}

%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 = {Proceedings 20th International Workshop on
Graph Theoretic Concepts in Computer Science WG'94},
publisher = {Springer Verlag, Lecture Notes in Computer Science, vol.
903},
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}}

%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} }

%Rav

@article{RaviSMRR96,
author = {R. Ravi and R. Sundaram and M. 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}

%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

@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}

@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}

@inbook{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}}

@inbook{Reed03,
author = {B. 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}

%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

@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}

%Ro

%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}}
year = 1991
}

@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}}
}

@unpublished{RobertsonS21,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {XXI}. {G}raphs with unique linkages},
note = {Manuscript},
year = 1992
}

@unpublished{RobertsonS22,
author = {Neil Robertson and Paul D. Seymour},
title = {Graph Minors. {XXII}. {I}rrelevant vertices in linkage problems},
note = {Manuscript},
year = 1992
}

%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}

%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} }

%Ros

@article{Rose70,
author = {Donald J. Rose},
title = {Triangulated Graphs and the elimination process},
journal = {J. Math. Anal. Appl.},
volume = 32, year = 1970, pages = {597-609} }

@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

@article{Ruzzo80,
author = {W. L. Ruzzo},
title = {Tree-size bounded alternation},
journal = jcss, volume = 21, year = 1980, pages = {218-235} }

%S

%Sa

%Sal

@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}}

%San

@article{Sanders96,
author = {Daniel P. Sanders},
title = {On Linear Recognition of Tree-Width at Most Four},
journal = sjdm, volume = 9, number = 1, pages = {101-117}, year = 1996}

@article{SantoroK85,
author = {N. Santoro and R. Khatib},
title = {Labelling and Implicit Routing in Networks},
journal = {Computer Journal}, volume = 28, year = 1985, pages = {5-8}}

%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}}

%Sax

@article{Saxe80,
author = {J. B. Saxe},
title = {Dynamic Programming Algorithms for Recognizing
Small-Bandwidth Graphs in Polynomial Time},
journal = sjadm, year = 1980, volume = 1, pages = {363-369}}

%Sc

%Sch

@article{Schaefer78a,
author = {T. J. Schaefer},
title = {On the complexity of some two-person perfect-information
games},
journal = jcss, year = 1978, volume = 16, pages = {185-225} }

@inproceedings{Schaefer78b,
author = {T. J. Schaefer},
title = {The complexity of satisfiability problems},
booktitle = {Proc. 10th Symp. on Theory of Computation},
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}}

%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}

@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 }

@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}}

%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 = {Math. Nachr.},
volume = 87, year = 1979, pages = {15-21}}

%Seese 1985

@inproceedings{Seese85,
author = {Detlef Seese},
title = {Tree-Partite Graphs And The Complexity of Algorithms},
booktitle = {Proc. 1985 Int. Conf. on Fundamentals of
Computation Theory, Lecture Notes in Computer Science 199},
year = 1985,
editor = {L. Budach},
publisher = {Springer Verlag},
pages = {412-421},
address = {Berlin}
}

%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 J. Math.}, volume = 30, pages = {159-162}, year = 1994}

%Set

@article{Sethi75,
author = {R. Sethi},
title = {Complete register allocation problems},
journal = siamjc, volume = 4, year = 1975, pages = {226-248}}

%Sey

@article{Seymour80,
author = {Paul D. Seymour},
title = {Disjoint paths in graphs},
journal = dm, volume = 29, year = 1980, pages = {293-309} }

@article{SeymourT89,
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}}

@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}}

@article{Seymour90,
author = {Paul D. Seymour},
title = {Colouring series-parallel graphs},
journal = comb, volume = 85, pages = {12-75}, year = 1990}

@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}}

%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}}

%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 = {Proc. National Conference on Artificial Intelligence (AAAI
'97)},
pages = {185-190},
publisher = {Morgan Kaufmann},
year = {1997}}

%Si

@phdthesis{Simon75,
author = {J. Simon},
title = {On Some Central Problems in Computational Complexity},
school = {Cornell University},
address = {Ithaca, N.Y.},
year = 1975}

@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 = {Proc. 3rd Czechoslovak Symp. 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}

%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{SrivinasN96,
author = {Shenoy Srinivas and Pandurang Nayak},
title = {Efficient enumeration of instantiations of Bayesian networks},
booktitle = {Proceedings UAI 1996}, year=1996, pages = {500-508}}

%St

%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}

%Su

%Sud

@article{Sudborough87,
author = {Ivan Hal Sudborough},
title = {``{C}utwidth'' and Related Graph Problems},
journal = {Bulletin of the EATCS},
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

@article{Syslo79,
author = {Maciej M. Sys{\l}o},
title = {Characterisations of outerplanar graphs},
journal = dm, volume = 26, pages = {47-53}, year = 1979 }

@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, pages = {28-30}, year = 1982 }

@inproceedings{Syslo83,
author = {Maciej M. Sys{\l}o},
title = {{NP}-Complete Problems On Some Tree-Structured Graphs: A
Review},
booktitle = {Proc. WG'83 International Workshop on Graph
             Theoretic Concepts in Computer Science},
year = 1983,
editor = {M. Nagl and J. Perl},
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 = {Springer, LNCS 1018},
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},
booktitle = {Proc. Graph-Theoretic Concepts in Computer Science 86},
editor = {G. Tinhofer and G. Schmidt},
publisher = {Springer Verlag},
address = {Berlin},
note = {Lect. Notes in Comp. Sc. Vol. 246},
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, pages = {1-3}, year = 1968}

%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},
year = 1982, journal = jacm, volume = 29, pages = {623-641} }

@unpublished{Takaoka91,
author = {Tadao Takaoka},
title = {A New Upper Bound on the Complexity of the All Pairs Shortest
Path Problem},
year = 1991, note = {Manuscript. To appear in proceedings WG'91}}


%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 = {R. E. Tarjan}, 
title = {Depth first search and linear graph algorithms},
journal = siamjc, volume = 1, year = 1972, pages = {146-160}}

%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 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.}}

%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},
booktitle = {Proceedings of Workshop on Algorithms and Data Structures
WADS'93},
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}

%Telle 1997

@article{TelleP97,
author = {Jan Arne Telle and Andrzej Proskurowski},
title = {Algorithms for vertex partitioning problems on partial $k$-trees},
year = 1997, journal = sjdm, volume = 10, pages = {529 - 550}}

%Telle 2004

@article{Telle01,
author = {Jan Arne Telle},
title = {Tree-decompositions of small pathwidth},
journal = dam, volume = 145, pages = {210-218}, year = 2004}

%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 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},
booktitle = {Proc. 11th International Symposium on Algorithms And Computation
ISAAC '00, Lecture Notes in Computer Science 1969},
editor =  {D.T. Lee and Shang-Hua Teng},
publisher =  {Springer-Verlag},
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 = {Math. Proc. Camb. Phil. Soc.},
year = 1984, volume = 95, pages = {261-265} }

@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, pages = {568-576}, year = 1989 }

@article{Thomassen97,
author = {Carsten Thomassen},
title = {A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces},
journal = jctb, volume = 70, pages = {306-311}, year = 1997}

@article{Thorup98,
author = {Mikkel Thorup},
title = {Structured Programs have Small Tree-Width and Good Register
Allocation},
journal = ic2, volume = 142, pages = {159-181}, year=1998}

%To

%Tod

@article{Toda91,
author = {S. Toda},
title = {PP is as hard as the polynomial-time hierarchy},
journal = siamjc, volume = 20, pages = {865-877}, year = 1991}

@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, pages = {316-328}, year = 1992}

%Tor

@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}}

%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
Entscheidungsproblem}, year = 1936,
journal = {Proc. London Math. Soc. Ser. 2}, volume = 42, pages = {230-265}}

%Tut

@article{Tutte60,
author = {W. T. Tutte},
title = {Convex representations of graphs},
journal = {Proc. London Math. Soc.}, 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

%Un

@article{Ungar51,
author = {P. Ungar},
title = {A theorem on planar graphs},
journal = {J. London Math. Soc.},
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}}

%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}

%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},
booktitle = {Proceedings 1st Annual European Symposium on Algorithms ESA'93},
editor = {Thomas Lengauer},
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 = {Proc. 13th Southeastern Conf. on Combinatorics,
Graph Theory, and Computing},
publisher = {Utilitas Mathematica Publishing, Winnipeg, Ont.},
year = 1982
}

%Wan

@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, pages = {470-491}, year = 1994}

@article{Wanke94a,
author = {Egon Wanke},
title = {$k$-NLC graphs and polynomial algorithms},
journal = dam, volume = 54, pages = {251-266}, year = 1994}

@article{Wanless01,
author = {I. M. Wanless},
title = {Path achievement games},
journal = {Austalasian J. of Combinatorics},
year = 2001, volume = 23, 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, year = 1988, volume = 29, pages = {283-287} }

%We

%Wen

@inproceedings{Wen90,
author = {W. X. Wen},
title = {Optimal decomposition of belief networks},
booktitle = {Proceedings of the Sixth Workshop on Uncertainty in Artificial Intelligence},
editor = {P. P. Bonissone and M. Henrion and L. N. Kanal and J. F. Lemmer},
year = 1990, pages = {245--256}}

%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},
booktitle = {Proc. Graph-Theoretic Concepts in Computer Science 86},
editor = {G. Tinhofer and G. Schmidt},
publisher = {Springer Verlag},
address = {Berlin},
note = {Lect. Notes in Comp. Sc. Vol. 246},
year = 1986,
pages = {17-28}
}

%Wie

@inproceedings{Wiegers86,
author = {Manfred Wiegers},
title = {Recognizing Outerplanar Graphs in Linear Time},
booktitle = {Proc. Graph-Theoretic Concepts in Computer Science 86},
editor = {G. Tinhofer and G. Schmidt},
publisher = {Springer Verlag},
address = {Berlin},
note = {Lect. Notes in Comp. Sc. Vol. 246},
year = 1986,
pages = {165-176}
}

@inproceedings{WiegersM88,
author = {Manfred Wiegers and Burkhard Monien},
title = {Bandwidth and Profile Minimization},
booktitle = wg88,
publisher = lncs344,
pages = {378-393},
address = {Berlin},
editor = {J. van Leeuwen},
year = 1988
}

@inproceedings{Wiegers90,
author = {Manfred Wiegers},
title = {The $k$-section of Treewidth Restricted Graphs},
booktitle = mfcs90,
publisher = lncs452,
address = {Berlin},
year = 1990,
editor = {B. Rovan},
pages = {530-537}}

%Wil

@article{Wilf87,
author = {H. Wilf},
title = {Finite Lists of Obstructions},
journal = {Amer. Math. Monthly},
volume = 94, year = 1987, pages = {267-271} }

@article{Williamson84,
author = {S. G. Williamson},
title = {Depth-first search and {K}uratowski subgraphs},
journal = jacm, volume = 31, pages = {681-693}, year = 1984 }

%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, pages = {43-60}, year = 1985 }

@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, pages = {485-496}, year = 1985 }

@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)},
booktitle = {Proceedings 1st International Workshop on Parameterized and Exact
Computation},
publisher = {Springer Lecture Notes in Computer Science, vol.~3162},
address = {Berlin}, year = 2004, pages = {281-290}}

%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 = {Proc. of 22nd Foundations of Software Technology and Theoretical
Computer Science FSTTCS'02},
pages = {348-359}, year = 2002,
publisher = lncs2556}

%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 = {Proc. 3rd Italian Conference on Algorithms and Complexity},
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{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} }

%Yu

@article{YuC94,
author = {Chang-Wu Yu and Gen-Huey Chen},
title = {A theorem on permutation graphs with applications},
journal = {Information Sciences}, volume = 77, pages = {177-193}, year =
1994}

%Z

%Zh

%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},
year = 1992,
booktitle = {Proceedings LATIN'92},
editor = {I. Simon},
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},
booktitle = {Proceedings 1st Annual European Symposium on Algorithms ESA'93},
editor = {Thomas Lengauer},
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},
booktitle = {Proceedings 2nd Annual European Symposium on Algorithms ESA'93},
editor = {Jan van Leeuwen},
year = 1994,
pages = {118-129},
publisher = lncs855}

%Zhou 1995

@unpublished{ZhouN95,
author = {X. Zhou and T. Nishizeki},
title = {Finding optimal edge-rankings of trees},
note = {To appear in Proceedings SODA'95}}

@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},
booktitle = {Proceedings 7th International Symposium on Algorithms and
Computation},
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},
booktitle = wg96, pages = {390-404}, year = 1997,
publisher = lncs1197}

%Zhou 1999

%Zhou 2000

@article{ZhouFN00,
author = {X. Zhou and K. Fuse and T. 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 T. 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}}

%%%% REFERENCES WITHOUT AUTHOR NAMES %%%%

key = {TreewidthLIB},
@misc{TreewidthLIB,
title= {TreewidthLIB},
year = {2004},
howpublished = {http://www.cs.uu.nl/people/hansb/treewidthlib}
}
key = {DIMACS},

@Misc{DIMACS_challenge2,
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}
}
