diff options
| author | Karl Berry <karl@freefriends.org> | 2011-03-06 22:31:53 +0000 |
|---|---|---|
| committer | Karl Berry <karl@freefriends.org> | 2011-03-06 22:31:53 +0000 |
| commit | 0e6e50ca2549504070b29679d6159236bdf1b308 (patch) | |
| tree | 0171343229c3531b47eefd984597c35b86922078 /Master/texmf-dist/source/bibtex/biber/t | |
| parent | 876cc70b39dad10fa8b3e5d2d600e0bad3c48f8d (diff) | |
adding biber, including binaries in both Master/bin and Build
git-svn-id: svn://tug.org/texlive/trunk@21617 c570f23f-e606-0410-a88d-b1316a301751
Diffstat (limited to 'Master/texmf-dist/source/bibtex/biber/t')
94 files changed, 35050 insertions, 0 deletions
diff --git a/Master/texmf-dist/source/bibtex/biber/t/00-options.t b/Master/texmf-dist/source/bibtex/biber/t/00-options.t new file mode 100755 index 00000000000..d9212b93e38 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/00-options.t @@ -0,0 +1,102 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8' ; + +use Test::More tests => 7; + +use Biber; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata") ; + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('options.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests + +# Biber options +Biber::Config->setoption('fastsort', 1); +Biber::Config->setoption('sortlocale', 'C'); + +# Biblatex options +Biber::Config->setblxoption('labelyearspec', [ 'year' ]); + +# Now generate the information +$biber->prepare; +my $out = $biber->get_output_obj; +my $section = $biber->sections->get_section(0); +my $main = $section->get_list('MAIN'); +my $bibentries = $section->bibentries; + +my $dmv = [ + [ + {'presort' => {}}, + {'mm' => {}}, + ], + [ + {'sortkey' => {'final' => 1}} + ], + [ + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {'sortyear' => {}}, + {'year' => {}} + ], + [ + {'volume' => {}}, + {'0000' => {}} + ] + ]; + +my $bln = [ 'author', 'editor' ]; + +my $l1 = q| \entry{L1}{book}{} + \name{labelname}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \name{author}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \list{publisher}{1}{% + {Oxford}% + } + \strng{namehash}{DJ1} + \strng{fullhash}{DJ1} + \field{sortinit}{D} + \field{labelyear}{1998} + \count{uniquename}{0} + \field{day}{05} + \field{month}{04} + \field{origday}{30} + \field{origmonth}{10} + \field{origyear}{1985} + \field{title}{Title 1} + \field{year}{1998} + \endentry + +|; + +ok(Biber::Config->getblxoption('uniquename') == 1, "Single-valued option") ; +is_deeply(Biber::Config->getblxoption('labelnamespec'), [ 'author' ], "Multi-valued options"); +ok(Biber::Config->getoption('mincrossrefs') == 88, "Setting Biber options via control file"); +ok(Biber::Config->getblxoption('useprefix', 'book') == 1 , "Per-type single-valued options"); +is_deeply(Biber::Config->getblxoption('labelnamespec', 'book'), $bln, "Per-type multi-valued options"); +is($bibentries->entry('l1')->get_field('labelyearname'), 'year', 'Global labelyear setting' ) ; +is( $out->get_output_entry($main,'l1'), $l1, 'Global labelyear setting - labelyear should be YEAR') ; + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/01-names-biblatexml.t b/Master/texmf-dist/source/bibtex/biber/t/01-names-biblatexml.t new file mode 100755 index 00000000000..249bc2e9841 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/01-names-biblatexml.t @@ -0,0 +1,82 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +#use Test::More skip_all => 'bltxml not working yet'; +use Test::More tests => 1; + +use Biber; +use Biber::Input::file::bibtex; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata"); + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('names-biblatexml.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests + +# Biber options +Biber::Config->setoption('fastsort', 1); +Biber::Config->setoption('sortlocale', 'C'); + +# Now generate the information +$biber->prepare; +my $out = $biber->get_output_obj; +my $section = $biber->sections->get_section(0); +my $main = $section->get_list('MAIN'); +my $bibentries = $section->bibentries; + +my $l1 = q| \entry{BulgakovRozenfeld:1983}{book}{} + \name{labelname}{3}{% + {{Булгаков}{Б.}{Павел~Георгиевич}{П.}{}{}{}{}}% + {{Розенфельд}{Ð .}{БориÑ~Ðбрамович}{Б.~B.}{Билл}{д.}{}{}{}{}}% + {{Ðхмедов}{Ð.}{Ðшраф~Ðхмедович}{Ð.~Ð.}{}{}{}{}}% + } + \name{author}{3}{% + {{Булгаков}{Б.}{Павел~Георгиевич}{П.}{}{}{}{}}% + {{Розенфельд}{Ð .}{БориÑ~Ðбрамович}{Б.~B.}{Билл}{д.}{}{}{}{}}% + {{Ðхмедов}{Ð.}{Ðшраф~Ðхмедович}{Ð.~Ð.}{}{}{}{}}% + } + \list{language}{1}{% + {Russian}% + } + \list{location}{1}{% + {МоÑква}% + } + \list{publisher}{1}{% + {Ðаука}% + } + \strng{namehash}{БПРБBдÐÐÐ1} + \strng{fullhash}{БПРБBдÐÐÐ1} + \field{sortinit}{Б} + \field{labelyear}{1983} + \field{eventday}{16} + \field{eventendday}{17} + \field{eventendmonth}{05} + \field{eventendyear}{1990} + \field{eventmonth}{05} + \field{eventyear}{1990} + \field{origday}{02} + \field{origmonth}{04} + \field{origyear}{1985} + \field{pagetotal}{240} + \field{series}{Ðаучно-биографичеÑÐºÐ°Ñ Ð»Ð¸Ñ‚ÐµÑ€Ð°Ñ‚ÑƒÑ€Ð°} + \field{title}{Mukhammad al-Khorezmi. Ca. 783 – ca. 850} + \field{urlday}{01} + \field{urlendyear}{} + \field{urlmonth}{07} + \field{urlyear}{1991} + \field{year}{1983} + \endentry + +|; + +is( $out->get_output_entry($main, 'bulgakovrozenfeld:1983'), $l1, 'Basic BibLaTeXML test - 1') ; + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/01-names.t b/Master/texmf-dist/source/bibtex/biber/t/01-names.t new file mode 100755 index 00000000000..22808d39c58 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/01-names.t @@ -0,0 +1,780 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 47; + +use Biber; +use Biber::Input::file::bibtex; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata"); + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('names.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests + +# Biber options +Biber::Config->setoption('fastsort', 1); +Biber::Config->setoption('sortlocale', 'C'); + +# Now generate the information +$biber->prepare; +my $out = $biber->get_output_obj; +my $section = $biber->sections->get_section(0); +my $main = $section->get_list('MAIN'); +my $bibentries = $section->bibentries; + +my $name1 = + { firstname => "John", + firstname_i => "J.", + firstname_it => "J", + lastname => "Doe", + lastname_i => "D.", + lastname_it => "D", + nameinitstring => "Doe_J", + namestring => "Doe, John", + prefix => undef, + prefix_i => undef, + prefix_it => undef, + strip => { firstname => 0, lastname => 0, prefix => undef, suffix => undef }, + suffix => undef, + suffix_i => undef, + suffix_it => undef}; +my $name2 = + { firstname => "John", + firstname_i => "J.", + firstname_it => "J", + lastname => "Doe", + lastname_i => "D.", + lastname_it => "D", + nameinitstring => "Doe_J_J", + namestring => "Doe, Jr, John", + prefix => undef, + prefix_i => undef, + prefix_it => undef, + strip => { firstname => 0, lastname => 0, prefix => undef, suffix => 0 }, + suffix => "Jr", + suffix_i => "J.", + suffix_it => "J" } ; + + + +my $name3 = + { firstname => "Johann~Gottfried", + firstname_i => "J.~G.", + firstname_it => "JG", + lastname => "Berlichingen zu~Hornberg", + lastname_i => "B.~z.~H.", + lastname_it => "BzH", + nameinitstring => "v_Berlichingen_zu_Hornberg_JG", + namestring => "von Berlichingen zu Hornberg, Johann Gottfried", + prefix => "von", + prefix_i => "v.", + prefix_it => "v", + strip => { firstname => 0, lastname => 0, prefix => 0, suffix => undef }, + suffix => undef, + suffix_i => undef, + suffix_it => undef}; + +my $name4 = + { firstname => "Johann~Gottfried", + firstname_i => "J.~G.", + firstname_it => "JG", + lastname => "Berlichingen zu~Hornberg", + lastname_i => "B.~z.~H.", + lastname_it => "BzH", + nameinitstring => "Berlichingen_zu_Hornberg_JG", + namestring => "von Berlichingen zu Hornberg, Johann Gottfried", + prefix => "von", + prefix_i => "v.", + prefix_it => "v", + strip => { firstname => 0, lastname => 0, prefix => 0, suffix => undef }, + suffix => undef, + suffix_i => undef, + suffix_it => undef}; + + +my $name5 = + { firstname => undef, + firstname_i => undef, + firstname_it => undef, + lastname => "Robert and Sons, Inc.", + lastname_i => "R.", + lastname_it => "R", + nameinitstring => "{Robert_and_Sons,_Inc.}", + namestring => "Robert and Sons, Inc.", + prefix => undef, + prefix_i => undef, + prefix_it => undef, + strip => { firstname => undef, lastname => 1, prefix => undef, suffix => undef }, + suffix => undef, + suffix_i => undef, + suffix_it => undef}; + + +my $name6 = + { firstname => 'Ê¿AbdallÄh', + firstname_i => 'A.', + firstname_it => 'A', + lastname => 'al-á¹¢Äliḥ', + lastname_i => 'á¹¢.', + lastname_it => 'á¹¢', + prefix => undef, + prefix_i => undef, + prefix_it => undef, + suffix => undef, + suffix_i => undef, + suffix_it => undef, + strip => { firstname => 0, lastname => 0, prefix => undef, suffix => undef }, + namestring => 'al-á¹¢Äliḥ, Ê¿AbdallÄh', + nameinitstring => 'al-á¹¢Äliḥ_A' } ; + + +my $name7 = + { firstname => 'Jean Charles~Gabriel', + firstname_i => 'J.~C.~G.', + firstname_it => 'JCG', + lastname_i => 'V.~P.', + lastname_it => 'VP', + lastname => 'Vallée~Poussin', + prefix => 'de~la', + prefix_i => 'd.~l.', + prefix_it => 'dl', + suffix => undef, + suffix_i => undef, + suffix_it => undef, + strip => { firstname => 0, lastname => 0, prefix => 0, suffix => undef }, + namestring => 'de la Vallée Poussin, Jean Charles Gabriel', + nameinitstring => 'dl_Vallée_Poussin_JCG' } ; +my $name8 = + { firstname => 'Jean Charles Gabriel', + firstname_i => 'J.', + firstname_it => 'J', + lastname => 'Vallée~Poussin', + lastname_i => 'V.~P.', + lastname_it => 'VP', + prefix => 'de~la', + prefix_i => 'd.~l.', + prefix_it => 'dl', + suffix => undef, + suffix_i => undef, + suffix_it => undef, + strip => { firstname => 1, lastname => 0, prefix => 0, suffix => undef }, + namestring => 'de la Vallée Poussin, Jean Charles Gabriel', + nameinitstring => 'Vallée_Poussin_J' } ; +my $name9 = + { firstname => 'Jean Charles Gabriel {de la}~Vallée', + firstname_i => 'J.~C. G. d.~V.', + firstname_it => 'JCGdV', + lastname => 'Poussin', + lastname_i => 'P.', + lastname_it => 'P', + prefix => undef, + prefix_i => undef, + prefix_it => undef, + suffix => undef, + suffix_i => undef, + suffix_it => undef, + strip => { firstname => 0, lastname => 0, prefix => undef, suffix => undef }, + namestring => 'Poussin, Jean Charles Gabriel {de la} Vallée', + nameinitstring => 'Poussin_JCGdV' } ; +my $name10 = + { firstname => 'Jean Charles~Gabriel', + firstname_i => 'J.~C.~G.', + firstname_it => 'JCG', + lastname => 'Vallée Poussin', + lastname_i => 'V.', + lastname_it => 'V', + prefix => 'de~la', + prefix_i => 'd.~l.', + prefix_it => 'dl', + suffix => undef, + suffix_i => undef, + suffix_it => undef, + strip => { firstname => 0, lastname => 1, prefix => 0, suffix => undef }, + namestring => 'de la Vallée Poussin, Jean Charles Gabriel', + nameinitstring => '{Vallée_Poussin}_JCG' } ; +my $name11 = + { firstname => 'Jean Charles Gabriel', + firstname_i => 'J.', + firstname_it => 'J', + lastname => 'Vallée Poussin', + lastname_i => 'V.', + lastname_it => 'V', + prefix => 'de~la', + prefix_i => 'd.~l.', + prefix_it => 'dl', + suffix => undef, + suffix_i => undef, + suffix_it => undef, + strip => { firstname => 1, lastname => 1, prefix => 0, suffix => undef }, + namestring => 'de la Vallée Poussin, Jean Charles Gabriel', + nameinitstring => '{Vallée_Poussin}_J' } ; + +my $name12 = + { firstname => 'Jean Charles~Gabriel', + firstname_i => 'J.~C.~G.', + firstname_it => 'JCG', + lastname => 'Poussin', + lastname_i => 'P.', + lastname_it => 'P', + prefix => undef, + prefix_i => undef, + prefix_it => undef, + suffix => undef, + suffix_i => undef, + suffix_it => undef, + strip => { firstname => 0, lastname => 0, prefix => undef, suffix => undef }, + namestring => 'Poussin, Jean Charles Gabriel', + nameinitstring => 'Poussin_JCG' } ; +my $name13 = + { firstname => 'Jean~Charles', + firstname_i => 'J.~C.', + firstname_it => 'JC', + lastname => 'Poussin Lecoq', + lastname_i => 'P.', + lastname_it => 'P', + prefix => undef, + prefix_i => undef, + prefix_it => undef, + suffix => undef, + suffix_i => undef, + suffix_it => undef, + strip => { firstname => 0, lastname => 1, prefix => undef, suffix => undef }, + namestring => 'Poussin Lecoq, Jean Charles', + nameinitstring => '{Poussin_Lecoq}_JC' } ; +my $name14 = + { firstname => 'J.~C.~G.', + firstname_i => 'J.~C.~G.', + firstname_it => 'JCG', + lastname => 'Vallée~Poussin', + lastname_i => 'V.~P.', + lastname_it => 'VP', + prefix => 'de~la', + prefix_i => 'd.~l.', + prefix_it => 'dl', + suffix => undef, + suffix_i => undef, + suffix_it => undef, + strip => { firstname => 0, lastname => 0, prefix => 0, suffix => undef }, + namestring => 'de la Vallée Poussin, J. C. G.', + nameinitstring => 'dl_Vallée_Poussin_JCG' } ; + +my $name15 = + { firstname => 'E.~S.', + firstname_i => 'E.~S.', + firstname_it => 'ES', + lastname => 'El-{M}allah', + lastname_i => 'M.', + lastname_it => 'M', + prefix => undef, + prefix_i => undef, + prefix_it => undef, + suffix => undef, + suffix_i => undef, + suffix_it => undef, + strip => { firstname => 0, lastname => 0, prefix => undef, suffix => undef }, + namestring => 'El-{M}allah, E. S.', + nameinitstring => 'El-{M}allah_ES' } ; + + +my $name16 = + { firstname => 'E.~S.', + firstname_i => 'E.~S.', + firstname_it => 'ES', + lastname => '{K}ent-{B}oswell', + lastname_i => 'K.-B.', + lastname_it => 'KB', + prefix => undef, + prefix_i => undef, + prefix_it => undef, + suffix => undef, + suffix_i => undef, + suffix_it => undef, + strip => { firstname => 0, lastname => 0, prefix => undef, suffix => undef }, + namestring => '{K}ent-{B}oswell, E. S.', + nameinitstring => '{K}ent-{B}oswell_ES' } ; + + +my $l1 = q| \entry{L1}{book}{} + \name{labelname}{1}{% + {{Adler}{A.}{Alfred}{A.}{}{}{}{}}% + } + \name{author}{1}{% + {{Adler}{A.}{Alfred}{A.}{}{}{}{}}% + } + \strng{namehash}{AA1} + \strng{fullhash}{AA1} + \field{sortinit}{A} + \endentry + +|; + +my $l2 = q| \entry{L2}{book}{} + \name{labelname}{1}{% + {{Bull}{B.}{Bertie~B.}{B.~B.}{}{}{}{}}% + } + \name{author}{1}{% + {{Bull}{B.}{Bertie~B.}{B.~B.}{}{}{}{}}% + } + \strng{namehash}{BBB1} + \strng{fullhash}{BBB1} + \field{sortinit}{B} + \endentry + +|; + +my $l3 = q| \entry{L3}{book}{} + \name{labelname}{1}{% + {{Crop}{C.}{C.~Z.}{C.~Z.}{}{}{}{}}% + } + \name{author}{1}{% + {{Crop}{C.}{C.~Z.}{C.~Z.}{}{}{}{}}% + } + \strng{namehash}{CCZ1} + \strng{fullhash}{CCZ1} + \field{sortinit}{C} + \endentry + +|; + +my $l4 = q| \entry{L4}{book}{} + \name{labelname}{1}{% + {{Decket}{D.}{Derek~D}{D.~D.}{}{}{}{}}% + } + \name{author}{1}{% + {{Decket}{D.}{Derek~D}{D.~D.}{}{}{}{}}% + } + \strng{namehash}{DDD1} + \strng{fullhash}{DDD1} + \field{sortinit}{D} + \endentry + +|; + +my $l5 = q| \entry{L5}{book}{} + \name{labelname}{1}{% + {{Eel}{E.}{Egbert}{E.}{von}{v.}{}{}}% + } + \name{author}{1}{% + {{Eel}{E.}{Egbert}{E.}{von}{v.}{}{}}% + } + \strng{namehash}{vEE1} + \strng{fullhash}{vEE1} + \field{sortinit}{v} + \endentry + +|; + +my $l6 = q| \entry{L6}{book}{} + \name{labelname}{1}{% + {{Frome}{F.}{Francis}{F.}{van~der~valt}{v.~d.~v.}{}{}}% + } + \name{author}{1}{% + {{Frome}{F.}{Francis}{F.}{van~der~valt}{v.~d.~v.}{}{}}% + } + \strng{namehash}{vdvFF1} + \strng{fullhash}{vdvFF1} + \field{sortinit}{v} + \endentry + +|; + +my $l7 = q| \entry{L7}{book}{} + \name{labelname}{1}{% + {{Gloom}{G.}{Gregory~R.}{G.~R.}{van}{v.}{}{}}% + } + \name{author}{1}{% + {{Gloom}{G.}{Gregory~R.}{G.~R.}{van}{v.}{}{}}% + } + \strng{namehash}{vGGR1} + \strng{fullhash}{vGGR1} + \field{sortinit}{v} + \endentry + +|; + +my $l8 = q| \entry{L8}{book}{} + \name{labelname}{1}{% + {{Henkel}{H.}{Henry~F.}{H.~F.}{van}{v.}{}{}}% + } + \name{author}{1}{% + {{Henkel}{H.}{Henry~F.}{H.~F.}{van}{v.}{}{}}% + } + \strng{namehash}{vHHF1} + \strng{fullhash}{vHHF1} + \field{sortinit}{v} + \endentry + +|; + +my $l9 = q| \entry{L9}{book}{} + \name{labelname}{1}{% + {{{Iliad Ipswich}}{I.}{Ian}{I.}{}{}{}{}}% + } + \name{author}{1}{% + {{{Iliad Ipswich}}{I.}{Ian}{I.}{}{}{}{}}% + } + \strng{namehash}{II1} + \strng{fullhash}{II1} + \field{sortinit}{I} + \endentry + +|; + + +my $l10 = q| \entry{L10}{book}{} + \name{labelname}{1}{% + {{Jolly}{J.}{James}{J.}{}{}{III}{I.}}% + } + \name{author}{1}{% + {{Jolly}{J.}{James}{J.}{}{}{III}{I.}}% + } + \strng{namehash}{JIJ1} + \strng{fullhash}{JIJ1} + \field{sortinit}{J} + \endentry + +|; + + +my $l10a = q| \entry{L10a}{book}{} + \name{labelname}{1}{% + {{Pimentel}{P.}{Joseph~J.}{J.~J.}{}{}{Jr.}{J.}}% + } + \name{author}{1}{% + {{Pimentel}{P.}{Joseph~J.}{J.~J.}{}{}{Jr.}{J.}}% + } + \strng{namehash}{PJJJ1} + \strng{fullhash}{PJJJ1} + \field{sortinit}{P} + \endentry + +|; + + +my $l11 = q| \entry{L11}{book}{} + \name{labelname}{1}{% + {{Kluster}{K.}{Kevin}{K.}{van}{v.}{Jr.}{J.}}% + } + \name{author}{1}{% + {{Kluster}{K.}{Kevin}{K.}{van}{v.}{Jr.}{J.}}% + } + \strng{namehash}{vKJK1} + \strng{fullhash}{vKJK1} + \field{sortinit}{v} + \endentry + +|; + +my $l12 = q| \entry{L12}{book}{} + \name{labelname}{1}{% + {{Vall{\'e}e~Poussin}{V.~P.}{Charles Louis Xavier~Joseph}{C.~L. X.~J.}{de~la}{d.~l.}{}{}}% + } + \name{author}{1}{% + {{Vall{\'e}e~Poussin}{V.~P.}{Charles Louis Xavier~Joseph}{C.~L. X.~J.}{de~la}{d.~l.}{}{}}% + } + \strng{namehash}{dlVPCLXJ1} + \strng{fullhash}{dlVPCLXJ1} + \field{sortinit}{d} + \endentry + +|; + +my $l13 = q| \entry{L13}{book}{} + \name{labelname}{1}{% + {{Van de~Graaff}{V.~d.~G.}{R.~J.}{R.~J.}{}{}{}{}}% + } + \name{author}{1}{% + {{Van de~Graaff}{V.~d.~G.}{R.~J.}{R.~J.}{}{}{}{}}% + } + \strng{namehash}{VdGRJ1} + \strng{fullhash}{VdGRJ1} + \field{sortinit}{V} + \endentry + +|; + +my $l14 = q| \entry{L14}{book}{} + \name{labelname}{1}{% + {{St~John-Mollusc}{S.~J.-M.}{Oliver}{O.}{}{}{}{}}% + } + \name{author}{1}{% + {{St~John-Mollusc}{S.~J.-M.}{Oliver}{O.}{}{}{}{}}% + } + \strng{namehash}{SJMO1} + \strng{fullhash}{SJMO1} + \field{sortinit}{S} + \endentry + +|; + +my $l15 = q| \entry{L15}{book}{} + \name{labelname}{1}{% + {{Gompel}{G.}{Roger~P.{\,}G.}{R.~P.}{van}{v.}{}{}}% + } + \name{author}{1}{% + {{Gompel}{G.}{Roger~P.{\,}G.}{R.~P.}{van}{v.}{}{}}% + } + \strng{namehash}{vGRP1} + \strng{fullhash}{vGRP1} + \field{sortinit}{v} + \endentry + +|; + +my $l16 = q| \entry{L16}{book}{} + \name{labelname}{1}{% + {{Gompel}{G.}{Roger~{P.\,G.}}{R.~P.}{van}{v.}{}{}}% + } + \name{author}{1}{% + {{Gompel}{G.}{Roger~{P.\,G.}}{R.~P.}{van}{v.}{}{}}% + } + \strng{namehash}{vGRP1} + \strng{fullhash}{vGRP1} + \field{sortinit}{v} + \endentry + +|; + +my $l17 = q| \entry{L17}{book}{} + \name{labelname}{1}{% + {{Lovecraft}{L.}{Bill~H.{\,}P.}{B.~H.}{}{}{}{}}% + } + \name{author}{1}{% + {{Lovecraft}{L.}{Bill~H.{\,}P.}{B.~H.}{}{}{}{}}% + } + \strng{namehash}{LBH1} + \strng{fullhash}{LBH1} + \field{sortinit}{L} + \endentry + +|; + +my $l18 = q| \entry{L18}{book}{} + \name{labelname}{1}{% + {{Lovecraft}{L.}{Bill~{H.\,P.}}{B.~H.}{}{}{}{}}% + } + \name{author}{1}{% + {{Lovecraft}{L.}{Bill~{H.\,P.}}{B.~H.}{}{}{}{}}% + } + \strng{namehash}{LBH1} + \strng{fullhash}{LBH1} + \field{sortinit}{L} + \endentry + +|; + +my $l19 = q| \entry{L19}{book}{} + \name{labelname}{1}{% + {{Mustermann}{M.}{Klaus-Peter}{K.-P.}{}{}{}{}}% + } + \name{author}{1}{% + {{Mustermann}{M.}{Klaus-Peter}{K.-P.}{}{}{}{}}% + } + \strng{namehash}{MKP1} + \strng{fullhash}{MKP1} + \field{sortinit}{M} + \endentry + +|; + +my $l20 = q| \entry{L20}{book}{} + \name{labelname}{1}{% + {{Ford}{F.}{{John Henry}}{J.}{}{}{}{}}% + } + \name{author}{1}{% + {{Ford}{F.}{{John Henry}}{J.}{}{}{}{}}% + } + \strng{namehash}{FJ1} + \strng{fullhash}{FJ1} + \field{sortinit}{F} + \endentry + +|; + +my $l21 = q| \entry{L21}{book}{} + \name{labelname}{1}{% + {{Smith}{S.}{{\v S}omeone}{{\v S}.}{}{}{}{}}% + } + \name{author}{1}{% + {{Smith}{S.}{{\v S}omeone}{{\v S}.}{}{}{}{}}% + } + \strng{namehash}{SS1} + \strng{fullhash}{SS1} + \field{sortinit}{S} + \endentry + +|; + +my $l22 = q| \entry{L22}{book}{} + \name{labelname}{1}{% + {{{\v S}mith}{{\v S}.}{Someone}{S.}{}{}{}{}}% + } + \name{author}{1}{% + {{{\v S}mith}{{\v S}.}{Someone}{S.}{}{}{}{}}% + } + \strng{namehash}{SS1} + \strng{fullhash}{SS1} + \field{sortinit}{\v{S}} + \endentry + +|; + + +my $l23 = q| \entry{L23}{book}{} + \name{labelname}{1}{% + {{Smith}{S.}{Å omeone}{Å .}{}{}{}{}}% + } + \name{author}{1}{% + {{Smith}{S.}{Å omeone}{Å .}{}{}{}{}}% + } + \strng{namehash}{SÅ 1} + \strng{fullhash}{SÅ 1} + \field{sortinit}{S} + \endentry + +|; + +my $l24 = q| \entry{L24}{book}{} + \name{labelname}{1}{% + {{Å mith}{Å .}{Someone}{S.}{}{}{}{}}% + } + \name{author}{1}{% + {{Å mith}{Å .}{Someone}{S.}{}{}{}{}}% + } + \strng{namehash}{Å S1} + \strng{fullhash}{Å S1} + \field{sortinit}{Å } + \endentry + +|; + +my $l25 = q| \entry{L25}{book}{} + \name{labelname}{1}{% + {{{American Psychological Association, Task Force on the Sexualization of Girls}}{A.}{}{}{}{}{}{}}% + } + \name{author}{1}{% + {{{American Psychological Association, Task Force on the Sexualization of Girls}}{A.}{}{}{}{}{}{}}% + } + \strng{namehash}{A1} + \strng{fullhash}{A1} + \field{sortinit}{A} + \endentry + +|; + +my $l26 = q| \entry{L26}{book}{} + \name{labelname}{1}{% + {{{Sci-Art Publishers}}{S.}{}{}{}{}{}{}}% + } + \name{author}{1}{% + {{{Sci-Art Publishers}}{S.}{}{}{}{}{}{}}% + } + \strng{namehash}{S1} + \strng{fullhash}{S1} + \field{sortinit}{S} + \endentry + +|; + +# Malformed anyway but a decent test +my $l28 = q| \entry{L28}{book}{} + \strng{namehash}{1} + \strng{fullhash}{1} + \field{sortinit}{0} + \warn{\item Name "Deux et al.,, O." is malformed (consecutive commas): skipping name} + \endentry + +|; + + +my $l29 = q| \entry{L29}{book}{} + \name{labelname}{1}{% + {{{U.S. Department of Health and Human Services, National Institute of Mental Health, National Heart, Lung and Blood Institute}}{U.}{}{}{}{}{}{}}% + } + \name{author}{1}{% + {{{U.S. Department of Health and Human Services, National Institute of Mental Health, National Heart, Lung and Blood Institute}}{U.}{}{}{}{}{}{}}% + } + \strng{namehash}{U1} + \strng{fullhash}{U1} + \field{sortinit}{U} + \endentry + +|; + + +is_deeply(Biber::Input::file::bibtex::parsename('John Doe', 'author'), $name1, 'parsename 1'); +is_deeply(Biber::Input::file::bibtex::parsename('Doe, Jr, John', 'author'), $name2, 'parsename 2'); +is_deeply(Biber::Input::file::bibtex::parsename('von Berlichingen zu Hornberg, Johann Gottfried', 'author', {useprefix => 1}), $name3, 'parsename 3') ; +is_deeply(Biber::Input::file::bibtex::parsename('von Berlichingen zu Hornberg, Johann Gottfried', 'author', {useprefix => 0}), $name4, 'parsename 4') ; +is_deeply(Biber::Input::file::bibtex::parsename('{Robert and Sons, Inc.}', 'author'), $name5, 'parsename 5') ; +is_deeply(Biber::Input::file::bibtex::parsename('al-á¹¢Äliḥ, Ê¿AbdallÄh', 'author'), $name6, 'parsename 6') ; +is_deeply(Biber::Input::file::bibtex::parsename('Jean Charles Gabriel de la Vallée Poussin', 'author', {useprefix => 1}), $name7, 'parsename 7'); +is_deeply(Biber::Input::file::bibtex::parsename('{Jean Charles Gabriel} de la Vallée Poussin', 'author'), $name8, 'parsename 8'); +is_deeply(Biber::Input::file::bibtex::parsename('Jean Charles Gabriel {de la} Vallée Poussin', 'author'), $name9, 'parsename 9'); +is_deeply(Biber::Input::file::bibtex::parsename('Jean Charles Gabriel de la {Vallée Poussin}', 'author'), $name10, 'parsename 10'); +is_deeply(Biber::Input::file::bibtex::parsename('{Jean Charles Gabriel} de la {Vallée Poussin}', 'author'), $name11, 'parsename 11'); +is_deeply(Biber::Input::file::bibtex::parsename('Jean Charles Gabriel Poussin', 'author'), $name12, 'parsename 12'); +is_deeply(Biber::Input::file::bibtex::parsename('Jean Charles {Poussin Lecoq}', 'author'), $name13, 'parsename 13'); +is_deeply(Biber::Input::file::bibtex::parsename('J. C. G. de la Vallée Poussin', 'author', {useprefix => 1}), $name14, 'parsename 14'); +is_deeply(Biber::Input::file::bibtex::parsename('E. S. El-{M}allah', 'author'), $name15, 'parsename 15'); +is_deeply(Biber::Input::file::bibtex::parsename('E. S. {K}ent-{B}oswell', 'author'), $name16, 'parsename 16'); + +is( $out->get_output_entry($main,'l1'), $l1, 'First Last') ; +is( $out->get_output_entry($main,'l2'), $l2, 'First Initial. Last') ; +is( $out->get_output_entry($main,'l3'), $l3, 'Initial. Initial. Last') ; +is( $out->get_output_entry($main,'l4'), $l4, 'First Initial Last') ; +is( $out->get_output_entry($main,'l5'), $l5, 'First prefix Last') ; +is( $out->get_output_entry($main,'l6'), $l6, 'First prefix prefix Last') ; +is( $out->get_output_entry($main,'l7'), $l7, 'First Initial. prefix Last') ; +is( $out->get_output_entry($main,'l8'), $l8, 'First Initial prefix Last') ; +is( $out->get_output_entry($main,'l9'), $l9, 'First {Last Last}') ; +is( $out->get_output_entry($main,'l10'), $l10, 'Last, Suffix, First') ; +is( $out->get_output_entry($main,'l10a'), $l10a, 'Last, Suffix, First Initial.') ; +is( $out->get_output_entry($main,'l11'), $l11, 'prefix Last, Suffix, First') ; +is( $out->get_output_entry($main,'l13'), $l13, 'Last Last Last, Initial. Initial.'); +is( $out->get_output_entry($main,'l14'), $l14, 'Last Last-Last, First'); +is( $out->get_output_entry($main,'l15'), $l15, 'First F.{\,}F. Last'); +is( $out->get_output_entry($main,'l16'), $l16, 'First {F.\,F.} Last'); +is( $out->get_output_entry($main,'l17'), $l17, 'Last, First {F.\,F.}'); +is( $out->get_output_entry($main,'l18'), $l18, 'Last, First F.{\,}F.'); +is( $out->get_output_entry($main,'l19'), $l19, 'Firstname with hyphen'); +is( $out->get_output_entry($main,'l20'), $l20, 'Protected dual first name'); +is( $out->get_output_entry($main,'l23'), $l23, 'Unicode firstname'); +is( $out->get_output_entry($main,'l24'), $l24, 'Unicode lastname'); +is( $out->get_output_entry($main,'l25'), $l25, 'Single string name'); +is( $out->get_output_entry($main,'l26'), $l26, 'Hyphen at brace level <> 0'); +is($section->bibentry('l27')->get_field('author')->count_elements, 1, 'Bad name with 3 commas'); +is( $out->get_output_entry($main,'l28'), $l28, 'Bad name with consecutive commas'); +is( $out->get_output_entry($main,'l29'), $l29, 'Escaped name with 3 commas'); + +# A few tests depend set to non UTF-8 output +# Have to use a new biber object when trying to change encoding as this isn't +# dealt with in ->prepare +$biber->parse_ctrlfile('names.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Biber options +Biber::Config->setoption('bblencoding', 'latin1'); + +# Now generate the information +$biber->prepare; +$out = $biber->get_output_obj; +$section = $biber->sections->get_section(0); +$main = $section->get_list('MAIN'); +$bibentries = $section->bibentries; + +is($bibentries->entry('l21')->get_field($bibentries->entry('l21')->get_field('labelnamename'))->nth_element(1)->get_firstname_it, '{\v S}', 'Terseinitials 1'); +is( $out->get_output_entry($main,'l12'), $l12, 'First First First First prefix prefix Last Last') ; +is( $out->get_output_entry($main,'l21'), $l21, 'LaTeX encoded unicode firstname'); +is( $out->get_output_entry($main,'l22'), $l22, 'LaTeX encoded unicode lastname'); + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/01-utils.t b/Master/texmf-dist/source/bibtex/biber/t/01-utils.t new file mode 100755 index 00000000000..4ab07225158 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/01-utils.t @@ -0,0 +1,83 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8' ; + +use Test::More tests => 19; +use Biber; +use Biber::Entry::Name; +use Biber::Entry::Names; +use Biber::Utils; +use Biber::LaTeX::Recode; +use Log::Log4perl qw(:easy); +use IPC::Cmd qw( can_run run ); +use Cwd; +my $cwd = getcwd; + +Log::Log4perl->easy_init($ERROR); +my $biber = Biber->new(noconf => 1); + +# File locating +# Using File::Spec->canonpath() to normalise path separators so these tests work +# on Windows/non-Windows +# Absolute path +is(File::Spec->canonpath(locate_biber_file("$cwd/t/tdata/general1.bcf")), File::Spec->canonpath("$cwd/t/tdata/general1.bcf"), 'File location - 1'); +# Relative path +is(File::Spec->canonpath(locate_biber_file('t/tdata/general1.bcf')), File::Spec->canonpath('t/tdata/general1.bcf'), 'File location - 2'); +# Same place as control file +Biber::Config->set_ctrlfile_path('t/tdata/general1.bcf'); +is(File::Spec->canonpath(locate_biber_file('t/tdata/examples.bib')), File::Spec->canonpath('t/tdata/examples.bib'), 'File location - 3'); + +SKIP: { + skip "No LaTeX installation", 1 unless can_run('kpsewhich'); + # using kpsewhich + like(File::Spec->canonpath(locate_biber_file('biblatex-examples.bib')), qr|[/\\]bibtex[/\\]bib[/\\]biblatex[/\\]biblatex-examples\.bib\z|, 'File location - 4'); + } + +# In output_directory +Biber::Config->setoption('output_directory', 't/tdata'); +is(File::Spec->canonpath(locate_biber_file('general1.bcf')), File::Spec->canonpath("t/tdata/general1.bcf"), 'File location - 5'); + +# String normalising +is( normalise_string('"a, b–c: d" ', 1), 'a bc d', 'normalise_string' ); + +Biber::Config->setoption('bblencoding', 'latin1'); +is( normalise_string_underscore('\c Se\x{c}\"ok-\foo{a}, N\`i\~no + $§+ :-) ', 1), 'Secoka_Nino', 'normalise_string_underscore 1' ); + +Biber::Config->setoption('bblencoding', 'UTF-8'); +is( normalise_string_underscore('\c Se\x{c}\"ok-\foo{a}, N\`i\~no + $§+ :-) ', 0), 'Åžecöka_Nìño', 'normalise_string_underscore 2' ); + +is( normalise_string_underscore('{Foo de Bar, Graf Ludwig}', 1), 'Foo_de_Bar_Graf_Ludwig', 'normalise_string_underscore 2'); + +# LaTeX decoding +is( latex_decode('Mu\d{h}ammad ibn M\=us\=a al-Khw\=arizm\={\i}'), 'Muḥammad ibn MÅ«sÄ al-KhwÄrizmÄ«', 'latex decode 1'); +is( latex_decode('\alpha'), '\alpha', 'latex decode 2'); # no greek decoding by default +is( latex_decode('\alpha', scheme => 'full'), 'α', 'Latex decode 3'); # greek decoding with "full" + +# LaTeX encoding +is( latex_encode('Muḥammad ibn MÅ«sÄ al-KhwÄrizmÄ«'), 'Mu\d{h}ammad ibn M\={u}s\={a} al-Khw\={a}rizm\={\i}', 'latex encode 1'); +is( latex_encode('α'), 'α', 'latex encode 2'); # no greek encoding by default +is( latex_encode('α', scheme => 'full'), '{$\alpha$}', 'latex encode 3'); # greek encoding with "full" + +my $names = bless [ + (bless { namestring => '\"Askdjksdj, Bsadk Cklsjd', nameinitstring => '\"Askdjksdj, BC' }, 'Biber::Entry::Name'), + (bless { namestring => 'von Ãœsakdjskd, Vsajd W\`asdjh', nameinitstring => 'v Ãœsakdjskd, VW'}, 'Biber::Entry::Name'), + (bless { namestring => 'Xaskldjdd, Yajs\x{d}ajks~Z.', nameinitstring => 'Xaskldjdd, YZ'}, 'Biber::Entry::Name'), + (bless { namestring => 'Maksjdakj, Nsjahdajsdhj', nameinitstring => 'Maksjdakj, N' }, 'Biber::Entry::Name') +], 'Biber::Entry::Names'; + +is( makenameid($names), 'Äskdjksdj_Bsadk_Cklsjd_von_Ãœsakdjskd_Vsajd_Wà sdjh_Xaskldjdd_Yajsdajks_Z_Maksjdakj_Nsjahdajsdhj', 'makenameid' ); + +my @arrayA = qw/ a b c d e f c /; +my @arrayB = qw/ c e /; +my @AminusB = reduce_array(\@arrayA, \@arrayB); +my @AminusBexpected = qw/ a b d f /; + +is_deeply(\@AminusB, \@AminusBexpected, 'reduce_array') ; + +is(remove_outer('{Some string}'), 'Some string', 'remove_outer') ; + +is( normalise_string_lite('Ä.~{\c{C}}.~{\c S}.'), 'ÄCS', 'normalise_string_lite' ) ; + diff --git a/Master/texmf-dist/source/bibtex/biber/t/03-basic-misc.t b/Master/texmf-dist/source/bibtex/biber/t/03-basic-misc.t new file mode 100755 index 00000000000..e33e8951945 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/03-basic-misc.t @@ -0,0 +1,241 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 15; + +use Biber; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata"); + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile("general2.bcf"); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests + +# Biber options +Biber::Config->setoption('fastsort', 1); + +# Now generate the information +$biber->prepare; +my $out = $biber->get_output_obj; +my $section = $biber->sections->get_section(0); +my $main = $section->get_list('MAIN'); +my @keys = sort $section->get_citekeys; +my @citedkeys = sort qw{ murray t1 kant:ku kant:kpv t2 shore}; + +my @allkeys = sort qw{ stdmodel aristotle:poetics vazques-de-parga t1 +gonzalez averroes/bland laufenberg westfahl:frontier knuth:ct:a kastenholz +averroes/hannes iliad luzzatto malinowski sorace knuth:ct:d britannica +nietzsche:historie stdmodel:weinberg knuth:ct:b baez/article knuth:ct:e itzhaki +jaffe padhye cicero stdmodel:salam reese averroes/hercz murray shore +aristotle:physics massa aristotle:anima gillies set kowalik gaonkar springer +geer hammond wormanx westfahl:space worman set:herrmann augustine gerhardt +piccato hasan hyman stdmodel:glashow stdmodel:ps_sc kant:kpv companion almendro +sigfridsson ctan baez/online aristotle:rhetoric pimentel00 pines knuth:ct:c moraux cms +angenendt angenendtsk loh markey cotton vangennepx kant:ku nussbaum nietzsche:ksa1 +vangennep knuth:ct angenendtsa spiegelberg bertram brandt set:aksin chiu nietzsche:ksa +set:yoon maron coleridge tvonb t2 } ; + +is_deeply( \@keys, \@citedkeys, 'citekeys 1') ; +is_deeply( [ $section->get_list('SHORTHANDS')->get_keys ], [ 'kant:kpv', 'kant:ku' ], 'shorthands' ) ; + +# reset some options and re-generate information + +# Have to do a citekey deletion as we are not re-reading the .bcf which would do it for us +# Otherwise, we have citekeys and allkeys which confuses fetch_data() +$section->del_citekeys; +$section->allkeys; +$biber->prepare; +$section = $biber->sections->get_section(0); +my $bibentries = $section->bibentries; + +$out = $biber->get_output_obj; + +@keys = sort $section->get_citekeys; + +is_deeply( \@keys, \@allkeys, 'citekeys 2') ; + +my $murray1 = q| \entry{murray}{article}{} + \name{labelname}{14}{% + {{Hostetler}{H}{Michael~J.}{MJ}{}{}{}{}}% + {{Wingate}{W}{Julia~E.}{JE}{}{}{}{}}% + {{Zhong}{Z}{Chuan-Jian}{CJ}{}{}{}{}}% + {{Harris}{H}{Jay~E.}{JE}{}{}{}{}}% + {{Vachet}{V}{Richard~W.}{RW}{}{}{}{}}% + {{Clark}{C}{Michael~R.}{MR}{}{}{}{}}% + {{Londono}{L}{J.~David}{JD}{}{}{}{}}% + {{Green}{G}{Stephen~J.}{SJ}{}{}{}{}}% + {{Stokes}{S}{Jennifer~J.}{JJ}{}{}{}{}}% + {{Wignall}{W}{George~D.}{GD}{}{}{}{}}% + {{Glish}{G}{Gary~L.}{GL}{}{}{}{}}% + {{Porter}{P}{Marc~D.}{MD}{}{}{}{}}% + {{Evans}{E}{Neal~D.}{ND}{}{}{}{}}% + {{Murray}{M}{Royce~W.}{RW}{}{}{}{}}% + } + \name{author}{14}{% + {{Hostetler}{H}{Michael~J.}{MJ}{}{}{}{}}% + {{Wingate}{W}{Julia~E.}{JE}{}{}{}{}}% + {{Zhong}{Z}{Chuan-Jian}{CJ}{}{}{}{}}% + {{Harris}{H}{Jay~E.}{JE}{}{}{}{}}% + {{Vachet}{V}{Richard~W.}{RW}{}{}{}{}}% + {{Clark}{C}{Michael~R.}{MR}{}{}{}{}}% + {{Londono}{L}{J.~David}{JD}{}{}{}{}}% + {{Green}{G}{Stephen~J.}{SJ}{}{}{}{}}% + {{Stokes}{S}{Jennifer~J.}{JJ}{}{}{}{}}% + {{Wignall}{W}{George~D.}{GD}{}{}{}{}}% + {{Glish}{G}{Gary~L.}{GL}{}{}{}{}}% + {{Porter}{P}{Marc~D.}{MD}{}{}{}{}}% + {{Evans}{E}{Neal~D.}{ND}{}{}{}{}}% + {{Murray}{M}{Royce~W.}{RW}{}{}{}{}}% + } + \strng{namehash}{HMJ+1} + \strng{fullhash}{HMJWJEZCJHJEVRWCMRLJDGSJSJJWGDGGLPMDENDMRW1} + \field{labelalpha}{Hos\textbf{+}98} + \field{sortinit}{H} + \count{uniquename}{0} + \true{singletitle} + \field{annotation}{An \texttt{article} entry with \arabic{author} authors. By default, long author and editor lists are automatically truncated. This is configurable} + \field{hyphenation}{american} + \field{indextitle}{Alkanethiolate gold cluster molecules} + \field{journaltitle}{Langmuir} + \field{number}{1} + \field{shorttitle}{Alkanethiolate gold cluster molecules} + \field{subtitle}{Core and monolayer properties as a function of core size} + \field{title}{Alkanethiolate gold cluster molecules with core diameters from 1.5 to 5.2~nm} + \field{volume}{14} + \field{year}{1998} + \field{pages}{17\bibrangedash 30} + \endentry + +|; + +my $murray2 = q| \entry{murray}{article}{} + \name{labelname}{14}{% + {{Hostetler}{H}{Michael~J.}{MJ}{}{}{}{}}% + {{Wingate}{W}{Julia~E.}{JE}{}{}{}{}}% + {{Zhong}{Z}{Chuan-Jian}{CJ}{}{}{}{}}% + {{Harris}{H}{Jay~E.}{JE}{}{}{}{}}% + {{Vachet}{V}{Richard~W.}{RW}{}{}{}{}}% + {{Clark}{C}{Michael~R.}{MR}{}{}{}{}}% + {{Londono}{L}{J.~David}{JD}{}{}{}{}}% + {{Green}{G}{Stephen~J.}{SJ}{}{}{}{}}% + {{Stokes}{S}{Jennifer~J.}{JJ}{}{}{}{}}% + {{Wignall}{W}{George~D.}{GD}{}{}{}{}}% + {{Glish}{G}{Gary~L.}{GL}{}{}{}{}}% + {{Porter}{P}{Marc~D.}{MD}{}{}{}{}}% + {{Evans}{E}{Neal~D.}{ND}{}{}{}{}}% + {{Murray}{M}{Royce~W.}{RW}{}{}{}{}}% + } + \name{author}{14}{% + {{Hostetler}{H}{Michael~J.}{MJ}{}{}{}{}}% + {{Wingate}{W}{Julia~E.}{JE}{}{}{}{}}% + {{Zhong}{Z}{Chuan-Jian}{CJ}{}{}{}{}}% + {{Harris}{H}{Jay~E.}{JE}{}{}{}{}}% + {{Vachet}{V}{Richard~W.}{RW}{}{}{}{}}% + {{Clark}{C}{Michael~R.}{MR}{}{}{}{}}% + {{Londono}{L}{J.~David}{JD}{}{}{}{}}% + {{Green}{G}{Stephen~J.}{SJ}{}{}{}{}}% + {{Stokes}{S}{Jennifer~J.}{JJ}{}{}{}{}}% + {{Wignall}{W}{George~D.}{GD}{}{}{}{}}% + {{Glish}{G}{Gary~L.}{GL}{}{}{}{}}% + {{Porter}{P}{Marc~D.}{MD}{}{}{}{}}% + {{Evans}{E}{Neal~D.}{ND}{}{}{}{}}% + {{Murray}{M}{Royce~W.}{RW}{}{}{}{}}% + } + \strng{namehash}{HMJ+1} + \strng{fullhash}{HMJWJEZCJHJEVRWCMRLJDGSJSJJWGDGGLPMDENDMRW1} + \field{labelalpha}{Hos98} + \field{sortinit}{H} + \count{uniquename}{0} + \true{singletitle} + \field{annotation}{An \texttt{article} entry with \arabic{author} authors. By default, long author and editor lists are automatically truncated. This is configurable} + \field{hyphenation}{american} + \field{indextitle}{Alkanethiolate gold cluster molecules} + \field{journaltitle}{Langmuir} + \field{number}{1} + \field{shorttitle}{Alkanethiolate gold cluster molecules} + \field{subtitle}{Core and monolayer properties as a function of core size} + \field{title}{Alkanethiolate gold cluster molecules with core diameters from 1.5 to 5.2~nm} + \field{volume}{14} + \field{year}{1998} + \field{pages}{17\bibrangedash 30} + \endentry + +|; + +my $t1 = q| \entry{t1}{misc}{} + \name{labelname}{1}{% + {{Brown}{B}{Bill}{B}{}{}{}{}}% + } + \name{author}{1}{% + {{Brown}{B}{Bill}{B}{}{}{}{}}% + } + \strng{namehash}{BB1} + \strng{fullhash}{BB1} + \field{labelalpha}{Bro92} + \field{sortinit}{B} + \count{uniquename}{0} + \field{title}{Normal things {$^{3}$}} + \field{year}{1992} + \field{pages}{100\bibrangedash} + \keyw{primary, something,somethingelse} + \endentry + +|; + +my $t2 = q| \entry{t2}{misc}{} + \name{labelname}{1}{% + {{Brown}{B}{Bill}{B}{}{}{}{}}% + } + \name{author}{1}{% + {{Brown}{B}{Bill}{B}{}{}{}{}}% + } + \strng{namehash}{BB1} + \strng{fullhash}{BB1} + \field{labelalpha}{Bro94} + \field{sortinit}{B} + \count{uniquename}{0} + \field{title}{Signs of W$\frac{o}{a}$nder} + \field{year}{1994} + \field{pages}{100} + \endentry + +|; + + +my $Worman_N = [ 'WN1', 'WN2' ] ; +my $Gennep = [ 'vGA1', 'vGJ1' ] ; + +is( $out->get_output_entry($main,'t1'), $t1, 'bbl entry with maths in title 1' ) ; +is( $bibentries->entry('shore')->get_field('month'), '3', 'default bib month macros' ) ; +ok( $bibentries->entry('t1')->has_keyword('primary'), 'Keywords test - 1' ) ; +ok( $bibentries->entry('t1')->has_keyword('something'), 'Keywords test - 2' ) ; +ok( $bibentries->entry('t1')->has_keyword('somethingelse'), 'Keywords test - 3' ) ; +is( $out->get_output_entry($main,'t2'), $t2, 'bbl entry with maths in title 2' ) ; +is_deeply( Biber::Config->_get_uniquename('Worman_N'), $Worman_N, 'uniquename count 1') ; +is_deeply( Biber::Config->_get_uniquename('Gennep'), $Gennep, 'uniquename count 2') ; +is( $out->get_output_entry($main,'murray'), $murray1, 'bbl with > maxnames' ) ; +is( $out->get_output_entry($main,'missing1'), " \\missing{missing1}\n", 'missing citekey 1' ) ; +is( $out->get_output_entry($main,'missing2'), " \\missing{missing2}\n", 'missing citekey 2' ) ; + +Biber::Config->setblxoption('alphaothers', ''); +Biber::Config->setblxoption('sortalphaothers', ''); + +# Have to do a citekey deletion as we are not re-reading the .bcf which would do it for us +# Otherwise, we have citekeys and allkeys which confuses fetch_data() +$section->del_citekeys; +$biber->prepare ; +$section = $biber->sections->get_section(0); +$main = $section->get_list('MAIN'); +$out = $biber->get_output_obj; + +is( $out->get_output_entry($main,'murray'), $murray2, 'bbl with > maxnames, empty alphaothers' ) ; + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/05-extrayear.t b/Master/texmf-dist/source/bibtex/biber/t/05-extrayear.t new file mode 100755 index 00000000000..42aae41de62 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/05-extrayear.t @@ -0,0 +1,55 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 17; + +use Biber; +use Biber::Utils; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata"); + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('extrayear.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests + +# Biber options +Biber::Config->setoption('fastsort', 1); +Biber::Config->setoption('sortlocale', 'C'); + +# Biblatex options +Biber::Config->setblxoption('labelyear', [ 'year' ]); +Biber::Config->setblxoption('maxnames', 1); + +# Now generate the information +$biber->prepare; +my $section = $biber->sections->get_section(0); +my $main = $section->get_list('MAIN'); +my $bibentries = $section->bibentries; + +is($main->get_extrayeardata('l1'), '1', 'Entry L1 - one name, first in 1995'); +is($main->get_extrayeardata('l2'), '2', 'Entry L2 - one name, second in 1995'); +is($main->get_extrayeardata('l3'), '3', 'Entry L3 - one name, third in 1995'); +is($main->get_extrayeardata('l4'), '1', 'Entry L4 - two names, first in 1995'); +is($main->get_extrayeardata('l5'), '2', 'Entry L5 - two names, second in 1995'); +is($main->get_extrayeardata('l6'), '1', 'Entry L6 - two names, first in 1996'); +is($main->get_extrayeardata('l7'), '2', 'Entry L7 - two names, second in 1996'); +ok(is_undef($main->get_extrayeardata('l8')), 'Entry L8 - one name, only in year'); +ok(is_undef($main->get_extrayeardata('l9')), 'Entry L9 - No name, same year as another with no name'); +ok(is_undef($main->get_extrayeardata('l10')), 'Entry L10 - No name, same year as another with no name'); +is($main->get_extrayeardata('companion1'), '1', 'Entry companion1 - names truncated to same as another entry in same year'); +is($main->get_extrayeardata('companion2'), '2', 'Entry companion2 - names truncated to same as another entry in same year'); +ok(is_undef($main->get_extrayeardata('companion3')), 'Entry companion3 - one name, same year as truncated names'); +ok(is_undef($main->get_extrayeardata('vangennep')), 'Entry vangennep - prefix makes it different'); +ok(is_undef($main->get_extrayeardata('gennep')), 'Entry gennep - different from prefix name'); +ok(is_undef($main->get_extrayeardata('ly1')), 'Date range means no extrayear - 1'); +ok(is_undef($main->get_extrayeardata('ly2')), 'Date range means no extrayear - 2'); + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/05-labelalpha.t b/Master/texmf-dist/source/bibtex/biber/t/05-labelalpha.t new file mode 100755 index 00000000000..4da1caf7197 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/05-labelalpha.t @@ -0,0 +1,157 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 70; + +use Biber; +use Biber::Utils; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata"); + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('labelalpha.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests + +# Biber options +Biber::Config->setoption('fastsort', 1); +Biber::Config->setoption('sortlocale', 'C'); + +# Biblatex options +Biber::Config->setblxoption('labelalpha', 1); +Biber::Config->setblxoption('maxnames', 1); +Biber::Config->setblxoption('labelyear', undef); + +# Now generate the information +$biber->prepare; +my $section = $biber->sections->get_section(0); +my $main = $section->get_list('MAIN'); +my $bibentries = $section->bibentries; + +is($bibentries->entry('l1')->get_field('sortlabelalpha'), 'Doe95', 'maxnames=1 minnames=1 entry L1 labelalpha'); +ok(is_undef($main->get_extraalphadata('l1')), 'maxnames=1 minnames=1 entry L1 extraalpha'); +is($bibentries->entry('l2')->get_field('sortlabelalpha'), 'Doe+95', 'maxnames=1 minnames=1 entry L2 labelalpha'); +is($main->get_extraalphadata('l2'), '1', 'maxnames=1 minnames=1 entry L2 extraalpha'); +is($bibentries->entry('l3')->get_field('sortlabelalpha'), 'Doe+95', 'maxnames=1 minnames=1 entry L3 labelalpha'); +is($main->get_extraalphadata('l3'), '2', 'maxnames=1 minnames=1 entry L3 extraalpha'); +is($bibentries->entry('l4')->get_field('sortlabelalpha'), 'Doe+95', 'maxnames=1 minnames=1 entry L4 labelalpha'); +is($main->get_extraalphadata('l4'), '3', 'maxnames=1 minnames=1 entry L4 extraalpha'); +is($bibentries->entry('l5')->get_field('sortlabelalpha'), 'Doe+95', 'maxnames=1 minnames=1 entry L5 labelalpha'); +is($main->get_extraalphadata('l5'), '4', 'maxnames=1 minnames=1 entry L5 extraalpha'); +is($bibentries->entry('l6')->get_field('sortlabelalpha'), 'Doe+95', 'maxnames=1 minnames=1 entry L6 labelalpha'); +is($main->get_extraalphadata('l6'), '5', 'maxnames=1 minnames=1 entry L6 extraalpha'); +is($bibentries->entry('l7')->get_field('sortlabelalpha'), 'Doe+95', 'maxnames=1 minnames=1 entry L7 labelalpha'); +is($main->get_extraalphadata('l7'), '6', 'maxnames=1 minnames=1 entry L7 extraalpha'); +is($bibentries->entry('l8')->get_field('sortlabelalpha'), 'Sha85', 'maxnames=1 minnames=1 entry L8 labelalpha'); +ok(is_undef($main->get_extraalphadata('l8')), 'maxnames=1 minnames=1 entry L8 extraalpha'); +ok(is_undef($main->get_extraalphadata('l9')), 'L9 extraalpha unset due to shorthand'); +ok(is_undef($main->get_extraalphadata('l10')), 'L10 extraalpha unset due to shorthand'); +is($main->get_extraalphadata('knuth:ct'), '1', 'YEAR with range needs label differentiating from individual volumes - 1'); +is($main->get_extraalphadata('knuth:ct:a'), '2', 'YEAR with range needs label differentiating from individual volumes - 2'); +is($main->get_extraalphadata('knuth:ct:b'), '1', 'YEAR with range needs label differentiating from individual volumes - 3'); +is($main->get_extraalphadata('knuth:ct:c'), '2', 'YEAR with range needs label differentiating from individual volumes - 4'); + +# reset options and regenerate information +Biber::Config->setblxoption('maxnames', 2); +Biber::Config->setblxoption('minnames', 1); + +for (my $i=1; $i<9; $i++) { + $bibentries->entry("l$i")->del_field('sortlabelalpha'); + $bibentries->entry("l$i")->del_field('labelalpha'); + $main->set_extraalphadata("l$i",undef); +} + +$biber->prepare; +$section = $biber->sections->get_section(0); +$main = $section->get_list('MAIN'); +$bibentries = $section->bibentries; + +is($bibentries->entry('l1')->get_field('sortlabelalpha'), 'Doe95', 'maxnames=2 minnames=1 entry L1 labelalpha'); +ok(is_undef($main->get_extraalphadata('l1')), 'maxnames=2 minnames=1 entry L1 extraalpha'); +is($bibentries->entry('l2')->get_field('sortlabelalpha'), 'DA95', 'maxnames=2 minnames=1 entry L2 labelalpha'); +is($main->get_extraalphadata('l2'), '1', 'maxnames=2 minnames=1 entry L2 extraalpha'); +is($bibentries->entry('l3')->get_field('sortlabelalpha'), 'DA95', 'maxnames=2 minnames=1 entry L3 labelalpha'); +is($main->get_extraalphadata('l3'), '2', 'maxnames=2 minnames=1 entry L3 extraalpha'); +is($bibentries->entry('l4')->get_field('sortlabelalpha'), 'Doe+95', 'maxnames=2 minnames=1 entry L4 labelalpha'); +is($main->get_extraalphadata('l4'), '1', 'maxnames=2 minnames=1 entry L4 extraalpha'); +is($bibentries->entry('l5')->get_field('sortlabelalpha'), 'Doe+95', 'maxnames=2 minnames=1 entry L5 labelalpha'); +is($main->get_extraalphadata('l5'), '2', 'maxnames=2 minnames=1 entry L5 extraalpha'); +is($bibentries->entry('l6')->get_field('sortlabelalpha'), 'Doe+95', 'maxnames=2 minnames=1 entry L6 labelalpha'); +is($main->get_extraalphadata('l6'), '3', 'maxnames=2 minnames=1 entry L6 extraalpha'); +is($bibentries->entry('l7')->get_field('sortlabelalpha'), 'Doe+95', 'maxnames=2 minnames=1 entry L7 labelalpha'); +is($main->get_extraalphadata('l7'), '4', 'maxnames=2 minnames=1 entry L7 extraalpha'); +is($bibentries->entry('l8')->get_field('sortlabelalpha'), 'Sha85', 'maxnames=2 minnames=1 entry L8 labelalpha'); +ok(is_undef($main->get_extraalphadata('l8')), 'maxnames=2 minnames=1 entry L8 extraalpha'); + +# reset options and regenerate information +Biber::Config->setblxoption('maxnames', 2); +Biber::Config->setblxoption('minnames', 2); + +for (my $i=1; $i<9; $i++) { + $bibentries->entry("l$i")->del_field('sortlabelalpha'); + $bibentries->entry("l$i")->del_field('labelalpha'); + $main->set_extraalphadata("l$i", undef); +} + +$biber->prepare; +$section = $biber->sections->get_section(0); +$main = $section->get_list('MAIN'); +$bibentries = $section->bibentries; + +is($bibentries->entry('l1')->get_field('sortlabelalpha'), 'Doe95', 'maxnames=2 minnames=2 entry L1 labelalpha'); +ok(is_undef($main->get_extraalphadata('l1')), 'maxnames=2 minnames=2 entry L1 extraalpha'); +is($bibentries->entry('l2')->get_field('sortlabelalpha'), 'DA95', 'maxnames=2 minnames=2 entry L2 labelalpha'); +is($main->get_extraalphadata('l2'), '1', 'maxnames=2 minnames=2 entry L2 extraalpha'); +is($bibentries->entry('l3')->get_field('sortlabelalpha'), 'DA95', 'maxnames=2 minnames=2 entry L3 labelalpha'); +is($main->get_extraalphadata('l3'), '2', 'maxnames=2 minnames=2 entry L3 extraalpha'); +is($bibentries->entry('l4')->get_field('sortlabelalpha'), 'DA+95', 'maxnames=2 minnames=2 entry L4 labelalpha'); +is($main->get_extraalphadata('l4'), '1', 'maxnames=2 minnames=2 entry L4 extraalpha'); +is($bibentries->entry('l5')->get_field('sortlabelalpha'), 'DA+95', 'maxnames=2 minnames=2 entry L5 labelalpha'); +is($main->get_extraalphadata('l5'), '2', 'maxnames=2 minnames=2 entry L5 extraalpha'); +is($bibentries->entry('l6')->get_field('sortlabelalpha'), 'DS+95', 'maxnames=2 minnames=2 entry L6 labelalpha'); +is($main->get_extraalphadata('l6'), '1', 'maxnames=2 minnames=2 entry L6 extraalpha'); +is($bibentries->entry('l7')->get_field('sortlabelalpha'), 'DS+95', 'maxnames=2 minnames=2 entry L7 labelalpha'); +is($main->get_extraalphadata('l7'), '2', 'maxnames=2 minnames=2 entry L7 extraalpha'); +is($bibentries->entry('l8')->get_field('sortlabelalpha'), 'Sha85', 'maxnames=2 minnames=2 entry L8 labelalpha'); +ok(is_undef($main->get_extraalphadata('l8')), 'maxnames=2 minnames=2 entry L8 extraalpha'); + +# reset options and regenerate information +Biber::Config->setblxoption('maxnames', 3); +Biber::Config->setblxoption('minnames', 1); + +for (my $i=1; $i<9; $i++) { + $bibentries->entry("l$i")->del_field('sortlabelalpha'); + $bibentries->entry("l$i")->del_field('labelalpha'); + $main->set_extraalphadata("l$i", undef); +} + +$biber->prepare; +$section = $biber->sections->get_section(0); +$main = $section->get_list('MAIN'); +$bibentries = $section->bibentries; + +is($bibentries->entry('l1')->get_field('sortlabelalpha'), 'Doe95', 'maxnames=3 minnames=1 entry L1 labelalpha'); +ok(is_undef($main->get_extraalphadata('l1')), 'maxnames=3 minnames=1 entry L1 extraalpha'); +is($bibentries->entry('l2')->get_field('sortlabelalpha'), 'DA95', 'maxnames=3 minnames=1 entry L2 labelalpha'); +is($main->get_extraalphadata('l2'), '1', 'maxnames=3 minnames=1 entry L2 extraalpha'); +is($bibentries->entry('l3')->get_field('sortlabelalpha'), 'DA95', 'maxnames=3 minnames=1 entry L3 labelalpha'); +is($main->get_extraalphadata('l3'), '2', 'maxnames=3 minnames=1 entry L3 extraalpha'); +is($bibentries->entry('l4')->get_field('sortlabelalpha'), 'DAE95', 'maxnames=3 minnames=1 entry L4 labelalpha'); +is($main->get_extraalphadata('l4'), '1', 'maxnames=3 minnames=1 entry L4 extraalpha'); +is($bibentries->entry('l5')->get_field('sortlabelalpha'), 'DAE95', 'maxnames=3 minnames=1 entry L5 labelalpha'); +is($main->get_extraalphadata('l5'), '2', 'maxnames=3 minnames=1 entry L5 extraalpha'); +is($bibentries->entry('l6')->get_field('sortlabelalpha'), 'DSE95', 'maxnames=3 minnames=1 entry L6 labelalpha'); +ok(is_undef($main->get_extraalphadata('l6')), 'maxnames=3 minnames=1 entry L6 extraalpha'); +is($bibentries->entry('l7')->get_field('sortlabelalpha'), 'DSJ95', 'maxnames=3 minnames=1 entry L7 labelalpha'); +ok(is_undef($main->get_extraalphadata('l7')), 'maxnames=3 minnames=1 entry L7 extraalpha'); +is($bibentries->entry('l8')->get_field('sortlabelalpha'), 'Sha85', 'maxnames=3 minnames=1 entry L8 labelalpha'); +ok(is_undef($main->get_extraalphadata('l8')), 'maxnames=3 minnames=1 entry L8 extraalpha'); + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/05-sorting.t b/Master/texmf-dist/source/bibtex/biber/t/05-sorting.t new file mode 100755 index 00000000000..8378f5f280c --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/05-sorting.t @@ -0,0 +1,1382 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 40; + +use Biber; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata"); + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile("general1.bcf"); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests + +# Biber options +Biber::Config->setoption('fastsort', 1); +Biber::Config->setoption('sortlocale', 'C'); + +my $yearoff1 = 'mm,,Knuth_Donald E,Computers Typesetting,1984,0000'; +my $yearoff2 = 'mm,,Knuth_Donald E,Computers Typesetting,198,0000'; +my $yearoff3 = 'mm,,Knuth_Donald E,Computers Typesetting,1984,0000'; +my $yearoff4 = 'mm,,Knuth_Donald E,Computers Typesetting,984,0000'; +my $yearoff5 = 'mm,,Knuth_Donald E,Computers Typesetting,1984,0000'; +my $yearoff6 = 'mm,,Knuth_Donald E,Computers Typesetting,1984,0000'; +my $yearoff7 = 'mm,,Knuth_Donald E,Computers Typesetting,198,0000'; +my $yearoff8 = 'mm,,Knuth_Donald E,Computers Typesetting,1984,0000'; +my $yearoff9 = 'mm,,Knuth_Donald E,Computers Typesetting,984,0000'; +my $vol1 = 'mm,,Glashow_Sheldon,Partial Symmetries of Weak Interactions,1961,2200'; +my $vol2 = 'mm,,Glashow_Sheldon,Partial Symmetries of Weak Interactions,1961,2200000'; +my $vol3 = 'mm,,Glashow_Sheldon,Partial Symmetries of Weak Interactions,1961,ÄÄÄ22'; +my $nty = 'mm,,Glashow_Sheldon,Partial Symmetries of Weak Interactions,1961,22'; +my $nyt = 'mm,,Glashow_Sheldon,1961,Partial Symmetries of Weak Interactions,22'; +my $nyvt = 'mm,,Glashow_Sheldon,1961,22,Partial Symmetries of Weak Interactions'; +my $anyt_la = 'mm,Gla61,,Glashow_Sheldon,1961,Partial Symmetries of Weak Interactions,0000'; +my $anyt = 'mm,,,Glashow_Sheldon,1961,Partial Symmetries of Weak Interactions,0000'; +my $anyvt_la = 'mm,Gla61,,Glashow_Sheldon,1961,0022,Partial Symmetries of Weak Interactions'; +my $anyvt_la2 = "mm,Hos+98,,Hostetler_Michael J+\x{10FFFD},1998,0014,Alkanethiolate gold cluster molecules with core diameters from 15 to 52 nm"; +my $anyvt_la3 = "mm,HW98,,Hostetler_Michael J+Wingate_Julia E+\x{10FFFD},1998,0014,Alkanethiolate gold cluster molecules with core diameters from 15 to 52 nm"; +my $anyvt_la4 = "mm,HW+98,,Hostetler_Michael J+Wingate_Julia E+\x{10FFFD},1998,0014,Alkanethiolate gold cluster molecules with core diameters from 15 to 52 nm"; +my $anyvt = 'mm,,,Glashow_Sheldon,1961,0022,Partial Symmetries of Weak Interactions'; +my $ynt = 'mm,,1961,Glashow_Sheldon,Partial Symmetries of Weak Interactions'; +my $ydnt = 'mm,,1961,Glashow_Sheldon,Partial Symmetries of Weak Interactions'; +my $debug = 'stdmodel'; +my $sk1 = 'mm,,AATESTKEY,AATESTKEY,AATESTKEY,AATESTKEY'; +my $ps_sc = 'zs,,Partial Symmetries of Weak Interactions,,Partial Symmetries of Weak Interactions,Partial Symmetries of Weak Interactions'; +my $noname = 'mm,,Partial Symmetries of Weak Interactions,Partial Symmetries of Weak Interactions,1961,22'; +my $citeorder = '0000001'; +my $lists1 = 'Marcel Dekker'; +my $lists2 = 'Chichester'; +my $lists3 = "IBM+\x{10FFFD}"; +my $lists4 = "IBM_HP+\x{10FFFD}"; +my $lists5 = 'IBM_HP_Sun_Sony'; +my $dates1 = '1979,01,0200000,1980,04,08,1924,06,07,1924,07,09,1924,0002,05,192,02,03,1979,03,04,79,03,03'; +my $edtypeclass1 = 'redactor,Jaffé_Philipp,Loewenfeld_Samuel+Kaltenbrunner_Ferdinand+Ewald_Paul'; +my $prefix1 = 'mm,,Luzzatto_Moshe Ḥayyim,,,Lashon laRamḥal uvo sheloshah ḥiburim,2000,0000'; +my $diacritic1 = 'mm,,Hasan_AlÄ«,alHasan_Ê¿AlÄ«,Hasan_AlÄ«,Some title,2000,0000'; + +# These have custom presort and also an exclusion on year and title set +my $useprefix1 = 'ww,,von_Bobble_Terrence,,,0000'; +my $useprefix2 = 'ww,,Bobble_Terrence_von,,,0000'; + +Biber::Config->setblxoption('useprefix', 1); + +# regenerate information +$biber->prepare; +my $section = $biber->sections->get_section(0); +my $bibentries = $section->bibentries; +my $main = $section->get_list('MAIN'); + +is($main->get_sortdata('tvonb')->[0], $useprefix1, 'von with type-specific presort, exclusions and useprefix=true' ); + +Biber::Config->setblxoption('useprefix', 0); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('tvonb')->[0], $useprefix2, 'von with type-specific presort, exclusions and useprefix=false' ); + +my $S; + +# Testing nosort +$S = [ + [ + { + }, + { + 'presort' => {}} + ], + [ + {final => 1, + }, + { + 'sortkey' => {}} + ], + [ + { + }, + { + 'sortname' => {}}, + { + 'author' => {}}, + { + 'editor' => {}}, + { + 'translator' => {}}, + { + 'sorttitle' => {}}, + { + 'title' => {}} + ], + [ + { + }, + { + 'editor' => {}}, + ], + [ + { + }, + { + 'translator' => {}}, + ], + [ + { + }, + { + 'sorttitle' => {}}, + { + 'title' => {}} + ], + [ + { + }, + { + 'labelyear' => {}} + ], + [ + { + }, + { + 'volume' => {}}, + { + '0000' => {}} + ] + ]; +$main->set_sortscheme($S); +Biber::Config->setoption('nosort', { author => [ q/\A\p{L}{2}\p{Pd}/, q/[\x{2bf}\x{2018}]/ ], + translator => [ q/\A\p{L}{2}\p{Pd}/, q/[\x{2bf}\x{2018}]/ ], + # type_title should be not used as there is an + # explicit title nosort + type_title => q/\A.*/, + title => q/\A\p{L}{2}\p{Pd}/ + }); + +Biber::Config->setoption('sortcase', '1'); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('luzzatto')->[0], $prefix1, 'Title with nosort' ); +is($main->get_sortdata('hasan')->[0], $diacritic1, 'Name with nosort' ); + +# Testing editor roles +$S = [ + [ + {}, + { + 'editoratype' => {}}, + ], + [ + {}, + { + 'editor' => {}}, + ], + [ + {}, + { + 'editora' => {}}, + ], + ]; +$main->set_sortscheme($S); +Biber::Config->setoption('sortcase', 0); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('jaffe')->[0], $edtypeclass1, 'Editor type/class' ); + + +# Testing sorting using various date fields +$S = [ + [ + {}, + {'year' => {}}, + ], + [ + {}, + {'month' => {}}, + ], + [ + {}, + {'day' => {pad_side => 'right', + pad_width => 7}}, + ], + [ + {}, + {'endyear' => {}}, + ], + [ + {}, + {'endmonth' => {}}, + ], + [ + {}, + {'endday' => {}}, + ], + [ + {}, + {'origyear' => {'sort_direction' => 'descending'}} + ], + [ + {}, + {'origmonth' => {}} + ], + [ + {}, + {'origday' => {}} + ], + [ + {}, + {'origendyear' => {}} + ], + [ + {}, + {'origendmonth' => {}} + ], + [ + {}, + {'origendday' => {}} + ], + [ + {}, + {'eventendyear' => {}} + ], + [ + {}, + {'eventendmonth' => {pad_side => 'left', + pad_width => 4}} + ], + [ + {}, + {'eventendday' => {}} + ], + [ + {}, + {'eventyear' => {'substring_side' => 'left', + 'substring_width' => 3}} + ], + [ + {}, + {'eventmonth' => {}} + ], + [ + {}, + {'eventday' => {}} + ], + [ + {sort_direction => 'descending'}, + {'urlendyear' => {}} + ], + [ + {}, + {'urlendmonth' => {}} + ], + [ + {}, + {'urlendday' => {}} + ], + [ + {}, + {'urlyear' => {'substring_side' => 'right', + 'substring_width' => 2}} + ], + [ + {}, + {'urlmonth' => {}} + ], + [ + {}, + {'urlday' => {}} + ], + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('moraux')->[0], $dates1, 'Very contrived but thorough test of date sorting' ); + +# Testing max/minITEMS with sorting using list fields +# publisher +$S = [ + [ + {}, + {'publisher' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('augustine')->[0], $lists1, 'max/minitems test 1 (publisher)' ); + +# location +$S = [ + [ + {}, + {'location' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('cotton')->[0], $lists2, 'max/minitems test 2 (location)' ); + + +# institution +$S = [ + [ + {}, + {'institution' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('chiu')->[0], $lists3, 'max/minitems test 3 (institution)' ); + +# institution with minitems=2 +Biber::Config->setblxoption('minitems', 2); +$S = [ + [ + {}, + {'institution' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('chiu')->[0], $lists4, 'max/minitems test 4 (institution - minitems=2)' ); + +# institution with maxitems=4, minitems=3 +Biber::Config->setblxoption('maxitems', 4); +Biber::Config->setblxoption('minitems', 3); +$S = [ + [ + {}, + {'institution' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('chiu')->[0], $lists5, 'max/minitems test 5 (institution - maxitems=4/minitems=3)' ); + + + +# nty with implicit default left, 4-digit year sort +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'year' => {}} + ], + [ + {}, + {'volume' => {}}, + {'0000' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('knuth:ct')->[0], $yearoff1, 'nty with default left offset, 4 digit year' ); + +# nty with left, 3-digit year sort, case sensitive +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'year' => {'substring_side' => 'left', + 'substring_width' => 3}} + ], + [ + {}, + {'volume' => {}}, + {'0000' => {}} + ] + ]; +$main->set_sortscheme($S); +Biber::Config->setoption('sortcase', 1); +# regenerate information +$biber->prepare; + +is($main->get_sortdata('knuth:ct')->[0], $yearoff2, 'nty with left offset, 3 digit year, case sensitive' ); + + +# nty with left, 4-digit year sort, case sensitive +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'year' => {'substring_side' => 'left', + 'substring_width' => 4}} + ], + [ + {}, + {'volume' => {}}, + {'0000' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('knuth:ct')->[0], $yearoff3, 'nty with left offset, 4 digit year, case sensitive' ); + +# nty with right, 3-digit year sort +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'year' => {'substring_side' => 'right', + 'substring_width' => 3}} + ], + [ + {}, + {'volume' => {}}, + {'0000' => {}} + ] + ]; +$main->set_sortscheme($S); +Biber::Config->setoption('sortcase', 0); +# regenerate information +$biber->prepare; + +is($main->get_sortdata('knuth:ct')->[0], $yearoff4, 'nty with right offset, 3 digit year' ); + +# nty with right, 4-digit year sort +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'year' => {'substring_side' => 'right', + 'substring_width' => 4}} + ], + [ + {}, + {'volume' => {}}, + {'0000' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('knuth:ct')->[0], $yearoff5, 'nty with right offset, 4 digit year' ); + +# ntyd with left, 4-digit year sort +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'year' => {'substring_side' => 'left', + 'substring_width' => 4, + 'sort_direction' => 'descending'}} + ], + [ + {}, + {'volume' => {}}, + {'0000' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('knuth:ct')->[0], $yearoff6, 'ntyd with left offset, 4 digit year' ); + +# ntyd with left, 3-digit year sort +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'year' => {'substring_side' => 'left', + 'substring_width' => 3, + 'sort_direction' => 'descending'}} + ], + [ + {}, + {'volume' => {}}, + {'0000' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('knuth:ct')->[0], $yearoff7, 'ntyd with left offset, 3 digit year' ); + +# ntyd with right, 4-digit year sort +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'year' => {'substring_side' => 'right', + 'substring_width' => 4, + 'sort_direction' => 'descending'}} + ], + [ + {}, + {'volume' => {}}, + {'0000' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('knuth:ct')->[0], $yearoff8, 'ntyd with right offset, 4 digit year' ); + +# ntyd with right, 3-digit year sort +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'year' => {'substring_side' => 'right', + 'substring_width' => 3, + 'sort_direction' => 'descending'}} + ], + [ + {}, + {'volume' => {}}, + {'0000' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('knuth:ct')->[0], $yearoff9, 'ntyd with right offset, 3 digit year' ); + +# nty with right-padded vol +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sortyear' => {}}, + {'year' => {}} + ], + [ + {}, + {'volume' => {pad_side => 'right'}}, + {'0000' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('stdmodel')->[0], $vol1, 'nty with right-padded vol' ); + +# nty with right-padded 7-char vol +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sortyear' => {}}, + {'year' => {}} + ], + [ + {}, + {'volume' => {pad_side => 'right', + pad_width => 7}}, + {'0000' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('stdmodel')->[0], $vol2, 'nty with right-padded 7-char vol' ); + +# nty with left-padded 5-char using Unicode "Ä" as pad_char vol +# Unicode char will be lowercase "Ä‘" in sortstring +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sortyear' => {}}, + {'year' => {}} + ], + [ + {}, + {'volume' => {pad_side => 'left', + pad_width => 5, + pad_char => 'Ä'}}, + {'0000' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('stdmodel')->[0], $vol3, 'nty with left-padded 5-char "a" pad char vol' ); + + +# nty +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sortyear' => {}}, + {'year' => {}} + ], + [ + {}, + {'volume' => {}}, + {'0000' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('stdmodel')->[0], $nty, 'basic nty sort' ); +is($main->get_sortdata('angenendtsk')->[0], $sk1, 'basic sortkey sort' ); + +# nyt +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'labelname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sortyear' => {}}, + {'year' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'volume' => {}}, + {'0000' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('stdmodel')->[0], $nyt, 'basic nyt sort' ); + +# nyvt +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sortyear' => {}}, + {'year' => {}} + ], + [ + {}, + {'volume' => {}}, + {'0000' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('stdmodel')->[0], $nyvt, 'basic nyvt sort' ); + +# anyt with labelalpha +Biber::Config->setblxoption('labelalpha', 1); +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {}, + {'labelalpha' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sortyear' => {}}, + {'year' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'0000' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('stdmodel')->[0], $anyt_la, 'anyt sort (with labelalpha)' ); +Biber::Config->setblxoption('labelalpha', 0); +$bibentries->entry('stdmodel')->del_field('labelalpha'); +$bibentries->entry('stdmodel')->del_field('sortlabelalpha'); +$bibentries->entry('stdmodel:glashow')->del_field('labelalpha'); # it's a crossref so have to clear it here too +$bibentries->entry('stdmodel:glashow')->del_field('sortlabelalpha'); + +# anyt without labelalpha +# regenerate information +$biber->prepare; + +is($main->get_sortdata('stdmodel')->[0], $anyt, 'anyt sort (without labelalpha)' ); + +# anyvt with labelalpha +Biber::Config->setblxoption('labelalpha',1); +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {}, + {'labelalpha' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sortyear' => {}}, + {'year' => {}} + ], + [ + {}, + {'volume' => {pad_width => 4}}, + {'0000' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('stdmodel')->[0], $anyvt_la, 'anyvt sort (with labelalpha)' ); +is($main->get_sortdata('murray')->[0], $anyvt_la2, 'anyvt sort (> maxnames=3 minnames=1, with labelalpha and alphaothers)' ); + +Biber::Config->setblxoption('maxnames', 2); +Biber::Config->setblxoption('minnames', 2); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('murray')->[0], $anyvt_la4, 'anyvt sort (> maxnames=2 minnames=2, with labelalpha and alphaothers)' ); + +Biber::Config->setblxoption('alphaothers', ''); +Biber::Config->setblxoption('sortalphaothers', ''); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('murray')->[0], $anyvt_la3, 'anyvt sort (> maxnames=2 minnames=2,with labelalpha and without alphaothers)' ); + +Biber::Config->setblxoption('labelalpha', 0); +$bibentries->entry('stdmodel')->del_field('labelalpha'); +$bibentries->entry('stdmodel')->del_field('sortlabelalpha'); +$bibentries->entry('stdmodel:glashow')->del_field('labelalpha'); # it's a crossref so have to clear it here too +$bibentries->entry('stdmodel:glashow')->del_field('sortlabelalpha'); +$bibentries->entry('murray')->del_field('labelalpha'); +$bibentries->entry('murray')->del_field('sortlabelalpha'); + +# anyvt without labelalpha + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('stdmodel')->[0], $anyvt, 'anyvt sort (without labelalpha)' ); + +# ynt +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortyear' => {}}, + {'labelyear' => {}}, + {'9999' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('stdmodel')->[0], $ynt, 'basic ynt sort' ); + +# ydnt +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {sort_direction => 'descending'}, + {'sortyear' => {}}, + {'year' => {}}, + {'9999' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('stdmodel')->[0], $ydnt, 'basic ydnt sort' ); +Biber::Config->setblxoption('labelalpha', 0); + +# debug +$S = [ + [ + {}, + {'entrykey' => {}}, + ], + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('stdmodel')->[0], $debug, 'basic debug sort' ); + +# nty with use* all off +Biber::Config->setblxoption('useauthor', 0); +Biber::Config->setblxoption('useeditor', 0); +Biber::Config->setblxoption('usetranslator', 0); +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sortyear' => {}}, + {'year' => {}} + ], + [ + {}, + {'volume' => {}}, + {'0000' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('stdmodel')->[0], $noname, 'nty with use* all off' ); + + +# nty with modified presort and short_circuit at title +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {final => 1, + }, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sortyear' => {}}, + {'year' => {}} + ], + [ + {}, + {'volume' => {}}, + {'0000' => {}} + ] + ]; + +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('stdmodel:ps_sc')->[0], $ps_sc, 'nty with modified presort and short-circuit title' ); + + +# citeorder sort + +$S = [ + [ + {}, + {'citeorder' => {}} + ] + ]; +$main->set_sortscheme($S); + +# regenerate information +$biber->prepare; + +is($main->get_sortdata('stdmodel')->[0], $citeorder, 'citeorder' ); + +unlink <*.utf8>; + + diff --git a/Master/texmf-dist/source/bibtex/biber/t/06-labelname.t b/Master/texmf-dist/source/bibtex/biber/t/06-labelname.t new file mode 100755 index 00000000000..7d59f54ed1e --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/06-labelname.t @@ -0,0 +1,41 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 3; + +use Biber; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata"); + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +Biber::Config->setoption('fastsort', 1); +$biber->parse_ctrlfile("general1.bcf"); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests + +# Biblatex options +Biber::Config->setblxoption('labelnamespec', ['shortauthor', 'author', 'shorteditor', 'editor', 'translator']); +Biber::Config->setblxoption('labelnamespec', ['editor', 'translator'], 'PER_TYPE', 'book'); + +# Now generate the information +$biber->prepare; +my $bibentries = $biber->sections->get_section(0)->bibentries; + +my $sa = 'shortauthor'; +my $a = 'author'; +my $ted = 'editor'; + + +is($bibentries->entry('angenendtsa')->get_field('labelnamename'), $sa, 'global shortauthor' ); +is($bibentries->entry('stdmodel')->get_field('labelnamename'), $a, 'global author' ); +is($bibentries->entry('aristotle:anima')->get_field('labelnamename'), $ted, 'type-specific editor' ); + + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/07-bcfvalidation.t b/Master/texmf-dist/source/bibtex/biber/t/07-bcfvalidation.t new file mode 100755 index 00000000000..4bd9baad5bc --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/07-bcfvalidation.t @@ -0,0 +1,30 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 32; +use XML::LibXML; +use Biber; +chdir('t'); + +# Validate all .bcfs used in tests + +# Set up schema +my $CFxmlschema = XML::LibXML::RelaxNG->new(location => '../data/schemata/bcf.rng'); + +foreach my $bcf (<tdata/*.bcf>) { +# Set up XML parser + my $CFxmlparser = XML::LibXML->new(); + + # basic parse and XInclude processing + my $CFxp = $CFxmlparser->parse_file($bcf); + + # XPath context + my $CFxpc = XML::LibXML::XPathContext->new($CFxp); + $CFxpc->registerNs('bcf', 'https://sourceforge.net/projects/biblatex'); + + # Validate against schema. Dies if it fails. + $CFxmlschema->validate($CFxp); + is($@, '', "Validation of $bcf"); +} diff --git a/Master/texmf-dist/source/bibtex/biber/t/10-configfile.t b/Master/texmf-dist/source/bibtex/biber/t/10-configfile.t new file mode 100755 index 00000000000..039cfbadd8d --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/10-configfile.t @@ -0,0 +1,26 @@ +use strict; +use warnings; + +use Test::More tests => 6; +use Biber; +use Cwd qw(getcwd); +use File::Spec; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); + +my $biberA = Biber->new( configfile => "t/tdata/biber2.conf" ); +is(Biber::Config->getoption('mincrossrefs'), 5); +my %colloptsA = ( level => 3, table => "/home/user/data/otherkeys.txt" ); +my %nosort = (author => [ q/\A\p{L}{2}\p{Pd}/, q/[\x{2bf}\x{2018}]/ ], + translator => q/[\x{2bf}\x{2018}]/ ); +is_deeply(Biber::Config->getoption('collate_options'), \%colloptsA); +is_deeply(Biber::Config->getoption('nosort'), \%nosort); + +chdir("t/tdata"); +my $cwdB = getcwd(); +my $biberB = Biber->new(configfile => "biber3.conf"); +is(Biber::Config->getcmdlineoption('configfile'), File::Spec->catfile("biber3.conf")); +is(Biber::Config->getoption('mincrossrefs'), 3); +my %colloptsB = ( level => 1, table => "/home/user/data/mykeys.txt" ); +is_deeply(Biber::Config->getoption('collate_options'), \%colloptsB); + diff --git a/Master/texmf-dist/source/bibtex/biber/t/10-sort-case.t b/Master/texmf-dist/source/bibtex/biber/t/10-sort-case.t new file mode 100755 index 00000000000..e5c75245304 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/10-sort-case.t @@ -0,0 +1,52 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 2; + +use Biber; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata") ; +my $S; + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('sort-case.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests +Biber::Config->setoption('sortcase', 1); +Biber::Config->setoption('sortupper', 1); + +$S = [ + [ + {}, + {'author' => {}}, + ], + ]; +Biber::Config->setblxoption('sorting', {default => $S}); + +$biber->prepare; +my $section = $biber->sections->get_section(0); +my $main = $section->get_list('MAIN'); + +is_deeply([$main->get_keys], ['CS1','CS3','CS2'], 'U::C case - 1'); + +$biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('sort-case.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Global here is sortcase=0, sortupper=1 +# title is sortcase=1, sortupper=0 +# So, all names are the same and it depends on title +$biber->prepare; +$section = $biber->sections->get_section(0); +$section = $biber->sections->get_section(0); +$main = $section->get_list('MAIN'); +is_deeply([$main->get_keys], ['CS3','CS2','CS1'], 'U::C case - 2'); + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/10-sort-complex.t b/Master/texmf-dist/source/bibtex/biber/t/10-sort-complex.t new file mode 100755 index 00000000000..2f618e151fa --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/10-sort-complex.t @@ -0,0 +1,193 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 8; + +use Biber; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata") ; + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('sort-complex.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests + +# Biber options +Biber::Config->setoption('fastsort', 1); + +# Biblatex options +Biber::Config->setblxoption('labelalpha', 1); +Biber::Config->setblxoption('labelyear', undef); + +# Now generate the information +$biber->prepare; +my $section = $biber->sections->get_section(0); +my $main = $section->get_list('MAIN'); +my $shs = $section->get_list('SHORTHANDS'); +my $out = $biber->get_output_obj; + +isa_ok($biber, "Biber"); + +my $sc = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'labelalpha' => {}}, + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sortyear' => {}}, + {'year' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'volume' => {pad_char => '0', + pad_side => 'left', + pad_width => '4'}}, + {'0000' => {}} + ], + ]; + +my $sc3 = q| \entry{L4}{book}{} + \true{morelabelname} + \name{labelname}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \true{moreauthor} + \name{author}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \list{location}{1}{% + {Cambridge}% + } + \list{publisher}{1}{% + {Another press}% + } + \strng{namehash}{DJo1} + \strng{fullhash}{DJo1} + \field{labelalpha}{Doe\textbf{+}95} + \field{sortinit}{D} + \field{extraalpha}{2} + \field{title}{Some title about sorting} + \field{year}{1995} + \endentry + +|; + +my $sc4 = q| \entry{L1}{book}{} + \name{labelname}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \name{author}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \list{location}{1}{% + {Cambridge}% + } + \list{publisher}{1}{% + {A press}% + } + \strng{namehash}{DJ1} + \strng{fullhash}{DJ1} + \field{labelalpha}{Doe95} + \field{sortinit}{D} + \field{extraalpha}{1} + \field{title}{Algorithms For Sorting} + \field{year}{1995} + \endentry + +|; + +my $sc5 = q| \entry{L2}{book}{} + \name{labelname}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \name{author}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \list{location}{1}{% + {Cambridge}% + } + \list{publisher}{1}{% + {A press}% + } + \strng{namehash}{DJ1} + \strng{fullhash}{DJ1} + \field{labelalpha}{Doe95} + \field{sortinit}{D} + \field{extraalpha}{3} + \field{title}{Sorting Algorithms} + \field{year}{1995} + \endentry + +|; + +my $sc6 = q| \entry{L3}{book}{} + \name{labelname}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \name{author}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \list{location}{1}{% + {Cambridge}% + } + \list{publisher}{1}{% + {A press}% + } + \strng{namehash}{DJ1} + \strng{fullhash}{DJ1} + \field{labelalpha}{Doe95} + \field{sortinit}{D} + \field{extraalpha}{2} + \field{title}{More and More Algorithms} + \field{year}{1995} + \endentry + +|; + +is_deeply( $main->get_sortscheme , $sc, 'sort scheme'); +is( $out->get_output_entry($main,'l4'), $sc3, '\alphaothers set by "and others"'); +is( $out->get_output_entry($main,'l1'), $sc4, '2-pass - labelalpha after title'); +is( $out->get_output_entry($main,'l2'), $sc5, '2-pass - labelalpha after title'); +is( $out->get_output_entry($main,'l3'), $sc6, '2-pass - labelalpha after title'); +is_deeply([ $main->get_keys ], ['L5', 'L4', 'L1', 'L3', 'L2'], 'citeorder - 1'); + +# This should be the same as $main citeorder as both $main and $shs use same +# global sort spec. $shs should also get the keys from the sort cache as a result. +# Can't do the usual SHORTHAND filter on SHORTHAND field in .bcf as adding SHORTHAND +# fields to the entries changes the sort order of $main (as SHORTHAND overrides the default +# label) +is_deeply([ $shs->get_keys ], ['L5', 'L4', 'L1', 'L3', 'L2'], 'citeorder - 2'); + + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/10-sort-order.t b/Master/texmf-dist/source/bibtex/biber/t/10-sort-order.t new file mode 100755 index 00000000000..f412f23b65b --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/10-sort-order.t @@ -0,0 +1,518 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 13; + +use Biber; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata") ; +my $S; + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('sort-order.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests +Biber::Config->setoption('fastsort', 1); + +# citeorder (sorting=none) +$S = [ + [ + {}, + {'citeorder' => {}} + ] + ]; +Biber::Config->setblxoption('sorting', {default => $S}); +Biber::Config->setblxoption('labelyear', undef); + +# (re)generate informtion based on option settings +$biber->prepare; +my $section = $biber->sections->get_section(0); +my $main = $section->get_list('MAIN'); + +is_deeply([ $main->get_keys ], ['L2','L1B','L1','L4','L3','L5','L1A','L7','L8','L6','L9'], 'citeorder'); + +# nty +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sortyear' => {}}, + {'year' => {}}, + {'0000' => {}} + ], + [ + {}, + {'volume' => {}}, + {'0000' => {}} + ] + ]; + +$main->set_sortscheme($S); + +$biber->set_output_obj(Biber::Output::BBL->new()); +$biber->prepare; +$section = $biber->sections->get_section(0); +is_deeply([ $main->get_keys ], ['L5','L1A','L1','L1B','L2','L3','L4','L8','L7','L6','L9'], 'nty'); + +# nyt +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sortyear' => {}}, + {'year' => {}}, + {'0000' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'volume' => {}}, + {'0000' => {}} + ] + ]; + +$main->set_sortscheme($S); + +$biber->set_output_obj(Biber::Output::BBL->new()); +$biber->prepare; +$section = $biber->sections->get_section(0); +is_deeply([$main->get_keys], ['L5','L1A','L1','L1B','L2','L3','L4','L8','L7','L6','L9'], 'nyt'); + +# nyvt +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sortyear' => {}}, + {'year' => {}}, + {'0000' => {}} + ], + [ + {}, + {'volume' => {}}, + {'0000' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ] + ]; + + +$main->set_sortscheme($S); + +$biber->set_output_obj(Biber::Output::BBL->new()); +$biber->prepare; +$section = $biber->sections->get_section(0); +is_deeply([$main->get_keys], ['L5','L1','L1A','L1B','L2','L3','L4','L8','L7','L6','L9'], 'nyvt'); + +# nyvt with volume padding +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sortyear' => {}}, + {'year' => {}}, + {'0000' => {}} + ], + [ + {}, + {'volume' => {pad_side => 'right'}}, + {'0000' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ] + ]; + + +$main->set_sortscheme($S); + +$biber->set_output_obj(Biber::Output::BBL->new()); +$biber->prepare; +$section = $biber->sections->get_section(0); +is_deeply([$main->get_keys], ['L5','L1A','L1','L1B','L2','L3','L4','L8','L7','L6','L9'], 'nyvt with volume padding'); + +# ynt +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortyear' => {}}, + {'year' => {}}, + {'9999' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + ]; + +$main->set_sortscheme($S); + +$biber->set_output_obj(Biber::Output::BBL->new()); +$biber->prepare; +$section = $biber->sections->get_section(0); +is_deeply([$main->get_keys], ['L3','L1B','L1A','L1','L4','L2','L8','L7','L6','L9','L5'], 'ynt'); + +# ynt with year substring +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortyear' => {}}, + {'year' => {'substring_side' => 'left', + 'substring_width' => 3}}, + {'9999' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + ]; + +$main->set_sortscheme($S); + +$biber->set_output_obj(Biber::Output::BBL->new()); +$biber->prepare; +$section = $biber->sections->get_section(0); +is_deeply([$main->get_keys], ['L3','L1B','L1A','L1','L2','L4','L8','L7','L6','L9','L5'], 'ynt with year substring'); + +# ydnt +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {sort_direction => 'descending'}, + {'sortyear' => {}}, + {'year' => {}}, + {'9999' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + ]; + +$main->set_sortscheme($S); + +$biber->set_output_obj(Biber::Output::BBL->new()); +$biber->prepare; +$section = $biber->sections->get_section(0); +# This is correct as "aaaaaa" sorts before all years when descending +is_deeply([$main->get_keys], ['L5','L9','L6','L7','L8','L2','L4','L1A','L1','L1B','L3'], 'ydnt'); + +# anyt +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {}, + {'labelalpha' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sortyear' => {}}, + {'year' => {}}, + {'0000' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'0000' => {}} + ] + ]; + +$main->set_sortscheme($S); +Biber::Config->setblxoption('labelalpha', 1); + +$biber->set_output_obj(Biber::Output::BBL->new()); +$biber->prepare; +$section = $biber->sections->get_section(0); +is_deeply([$main->get_keys], ['L1B','L1A','L1','L2','L3','L4','L5','L8','L7','L6','L9'], 'anyt'); + +Biber::Config->setblxoption('labelalpha', 0); + +# anyvt +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {}, + {'labelalpha' => {}} + ], + [ + {final => 1, + }, + {'sortkey' => {}} + ], + [ + {}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sortyear' => {}}, + {'year' => {}}, + {'0000' => {}} + ], + [ + {}, + {'volume' => {}}, + {'0000' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ] + ]; + +$main->set_sortscheme($S); +Biber::Config->setblxoption('labelalpha', 1); + +$biber->set_output_obj(Biber::Output::BBL->new()); +$biber->prepare; +$section = $biber->sections->get_section(0); +is_deeply([$main->get_keys], ['L1B','L1','L1A','L2','L3','L4','L5','L8','L7','L6','L9'], 'anyvt'); + + +# nty with descending n +$S = [ + [ + {sort_direction => 'descending'}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sorttitle' => {}}, + {'title' => {}} + ], + [ + {}, + {'sortyear' => {}}, + {'year' => {}}, + {'0000' => {}} + ], + ]; + +$main->set_sortscheme($S); + +$biber->set_output_obj(Biber::Output::BBL->new()); +$biber->prepare; +$section = $biber->sections->get_section(0); +is_deeply([$main->get_keys], ['L9','L6','L7','L8','L5','L4','L3','L2','L1B','L1A','L1'], 'nty with descending n'); + + +# testing case sensitive with fastsort +# In alphabetic, all uppercase comes before lower so the +# "sortcase => 1" on location means that "edinburgh" sorts at the end after "London" +# Take this out of the location sorting spec and it fails as it should +$S = [ + [ + {sortcase => 1}, + {'location' => {}} + ] + ]; + +$main->set_sortscheme($S); + +$biber->set_output_obj(Biber::Output::BBL->new()); +# Have to set local to something which understand lexical/case differences for this test +# otherwise testing on Windows doesn't work ... +Biber::Config->setoption('sortlocale', 'C'); +$biber->prepare; +$section = $biber->sections->get_section(0); +is_deeply([$main->get_keys], ['L1B','L1','L1A','L2','L3','L4','L5','L7','L8','L9','L6'], 'location - sortcase=1'); + +# Test nosort option +$S = [ + [ + {}, + {'title' => {}} + ] + ]; + +$main->set_sortscheme($S); +# Set nosort for tests, skipping "The " in titles so L7 should sort before L6 +Biber::Config->setoption('nosort', { type_title => q/\AThe\s+/ }); + +$biber->set_output_obj(Biber::Output::BBL->new()); +$biber->prepare; +$section = $biber->sections->get_section(0); +is_deeply([$main->get_keys], ['L1A','L1','L1B','L2','L3','L4','L5','L7','L6','L9','L8'], 'nosort 1'); + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/10-sort-uc.t b/Master/texmf-dist/source/bibtex/biber/t/10-sort-uc.t new file mode 100755 index 00000000000..cddc457cafb --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/10-sort-uc.t @@ -0,0 +1,104 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 6; + +use Biber; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata") ; +my $S; + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('sort-uc.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests +Biber::Config->setoption('sortlocale', 'sv_SE'); + +# U::C Swedish tailoring +$biber->prepare; +my $section = $biber->sections->get_section(0); +my $main = $section->get_list('MAIN'); +my $shs = $section->get_list('SHORTHANDS'); + +# Shorthands are sorted by shorthand (as per bcf) +is_deeply([$main->get_keys], ['LS2','LS1','LS3','LS4'], 'U::C tailoring - 1'); +is_deeply([$shs->get_keys], ['LS3', 'LS4','LS2','LS1'], 'U::C tailoring - 2'); + +# Set sorting of shorthands to global sorting default +$shs->set_sortscheme(Biber::Config->getblxoption('sorting')); + +$biber->prepare; +$section = $biber->sections->get_section(0); +is_deeply([$shs->get_keys], ['LS2', 'LS1','LS3','LS4'], 'U::C tailoring - 3'); + + +# Descending name in Swedish collation +$S = [ + [ + {}, + {'presort' => {}} + ], + [ + {final => 1}, + {'sortkey' => {}} + ], + [ + {sort_direction => 'descending'}, + {'sortname' => {}}, + {'author' => {}}, + {'editor' => {}}, + {'translator' => {}}, + {'sorttitle' => {}}, + {'title' => {}} + ] + ]; + +$main->set_sortscheme($S); + +$biber->prepare; +$section = $biber->sections->get_section(0); + +is_deeply([$main->get_keys], ['LS3','LS4','LS1','LS2'], 'U::C tailoring descending - 1'); + +# Local lower before upper setting +$S = [ + [ + {sortupper => 0}, + {'title' => {}} + ] + ]; + +$main->set_sortscheme($S); + +$biber->prepare; +$section = $biber->sections->get_section(0); +is_deeply([$main->get_keys], ['LS4', 'LS3','LS2','LS1'], 'upper_before_lower locally false'); + +# Local case insensitive negates the sortupper being false as this no longer +# means anything so it reverts to bib order for LS3 and LS4 +# For this, have to reparse the .bcf otherwise the citekey order from previous +# test is kept for things that are not sort distinguishable +$biber->parse_ctrlfile('sort-uc.bcf'); +$section = $biber->sections->get_section(0); +$main = $section->get_list('MAIN'); +$biber->set_output_obj(Biber::Output::BBL->new()); +$S = [ + [ + {sortupper => 0, + sortcase => 0}, + {'title' => {}} + ] + ]; + +$main->set_sortscheme($S); +$biber->prepare; +is_deeply([$main->get_keys], ['LS3', 'LS4','LS2','LS1'], 'sortcase locally false, upper_before_lower locally false'); + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/11-set-dynamic.t b/Master/texmf-dist/source/bibtex/biber/t/11-set-dynamic.t new file mode 100755 index 00000000000..317f713dc9d --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/11-set-dynamic.t @@ -0,0 +1,138 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 7; + +use Biber; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata") ; + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('set-dynamic.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests + +# Biber options +Biber::Config->setoption('fastsort', 1); + +# Now generate the information +$biber->prepare; +my $section0 = $biber->sections->get_section(0); +my $main0 = $section0->get_list('MAIN'); +my $sh0 = $section0->get_list('SHORTHANDS'); +my $section1 = $biber->sections->get_section(1); +my $main1 = $section1->get_list('MAIN'); +my $sh1 = $section1->get_list('SHORTHANDS'); +my $out = $biber->get_output_obj; + +my $string1 = q| \entry{DynSet}{set}{} + \set{Dynamic1,Dynamic2,Dynamic3} + \name{labelname}{1}{% + {{Dynamism}{D.}{Derek}{D.}{}{}{}{}}% + } + \name{author}{1}{% + {{Dynamism}{D.}{Derek}{D.}{}{}{}{}}% + } + \strng{namehash}{DD1} + \strng{fullhash}{DD1} + \field{sortinit}{0} + \field{labelyear}{2002} + \field{annotation}{Some Dynamic Note} + \field{shorthand}{d1} + \field{title}{Doing Daring Deeds} + \field{year}{2002} + \endentry + +|; + +my $string2 = q| \entry{Dynamic1}{book}{} + \inset{DynSet} + \name{labelname}{1}{% + {{Dynamism}{D.}{Derek}{D.}{}{}{}{}}% + } + \name{author}{1}{% + {{Dynamism}{D.}{Derek}{D.}{}{}{}{}}% + } + \strng{namehash}{DD1} + \strng{fullhash}{DD1} + \field{sortinit}{0} + \field{annotation}{Some Dynamic Note} + \field{shorthand}{d1} + \field{title}{Doing Daring Deeds} + \field{year}{2002} + \endentry + +|; + +my $string3 = q| \entry{Dynamic2}{book}{} + \inset{DynSet} + \name{labelname}{1}{% + {{Bunting}{B.}{Brian}{B.}{}{}{}{}}% + } + \name{author}{1}{% + {{Bunting}{B.}{Brian}{B.}{}{}{}{}}% + } + \strng{namehash}{BB1} + \strng{fullhash}{BB1} + \field{sortinit}{0} + \field{shorthand}{d2} + \field{title}{Beautiful Birthdays} + \field{year}{2010} + \endentry + +|; + +my $string4 = q| \entry{Dynamic3}{book}{} + \inset{DynSet} + \name{labelname}{1}{% + {{Regardless}{R.}{Roger}{R.}{}{}{}{}}% + } + \name{author}{1}{% + {{Regardless}{R.}{Roger}{R.}{}{}{}{}}% + } + \strng{namehash}{RR1} + \strng{fullhash}{RR1} + \field{sortinit}{0} + \field{shorthand}{d3} + \field{title}{Reckless Ravishings} + \field{year}{2000} + \endentry + +|; + +# Labelyear is now here as skiplab is not set for this entry when cited in section +# without citation of a set it is a member of +my $string5 = q| \entry{Dynamic3}{book}{} + \name{labelname}{1}{% + {{Regardless}{R.}{Roger}{R.}{}{}{}{}}% + } + \name{author}{1}{% + {{Regardless}{R.}{Roger}{R.}{}{}{}{}}% + } + \strng{namehash}{RR1} + \strng{fullhash}{RR1} + \field{sortinit}{0} + \field{labelyear}{2000} + \field{shorthand}{d3} + \field{title}{Reckless Ravishings} + \field{year}{2000} + \endentry + +|; + +is($out->get_output_entry($main0,'DynSet'), $string1, 'Dynamic set test 1'); +is($out->get_output_entry($main0,'Dynamic1'), $string2, 'Dynamic set test 2'); +is($out->get_output_entry($main0,'Dynamic2'), $string3, 'Dynamic set test 3'); +is($out->get_output_entry($main0,'Dynamic3'), $string4, 'Dynamic set test 4'); +is($out->get_output_entry($main0,'Dynamic3', 1), $string5, 'Dynamic set test 5'); +is_deeply([$sh0->get_keys], ['DynSet'], 'Dynamic set skiplos 1'); +is_deeply([$sh1->get_keys], ['Dynamic3'], 'Dynamic set skiplos 2'); + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/11-set-legacy.t b/Master/texmf-dist/source/bibtex/biber/t/11-set-legacy.t new file mode 100755 index 00000000000..3691c47b8fa --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/11-set-legacy.t @@ -0,0 +1,117 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 3; + +use Biber; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata") ; + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('set-legacy.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests + +# Biber options +Biber::Config->setoption('fastsort', 1); + +# Now generate the information +$biber->prepare; +my $section = $biber->sections->get_section(0); +my $main = $section->get_list('MAIN'); +my $out = $biber->get_output_obj; + +my $string1 = q| \entry{Elias1955}{set}{} + \set{Elias1955a,Elias1955b} + \name{labelname}{1}{% + {{Elias}{E.}{P.}{P.}{}{}{}{}}% + } + \name{author}{1}{% + {{Elias}{E.}{P.}{P.}{}{}{}{}}% + } + \strng{namehash}{EP1} + \strng{fullhash}{EP1} + \field{sortinit}{0} + \field{labelyear}{1955} + \field{issn}{0096-1000} + \field{journaltitle}{IRE Transactions on Information Theory} + \field{month}{03} + \field{number}{1} + \field{title}{Predictive coding--I} + \field{volume}{1} + \field{year}{1955} + \field{pages}{16\bibrangedash 24} + \verb{doi} + \verb 10.1109/TIT.1955.1055126 + \endverb + \warn{\item Field 'crossref' is no longer needed in set entries in Biber - ignoring in entry 'Elias1955'} + \endentry + +|; + +my $string2 = q| \entry{Elias1955a}{article}{} + \inset{Elias1955} + \name{labelname}{1}{% + {{Elias}{E.}{P.}{P.}{}{}{}{}}% + } + \name{author}{1}{% + {{Elias}{E.}{P.}{P.}{}{}{}{}}% + } + \strng{namehash}{EP1} + \strng{fullhash}{EP1} + \field{sortinit}{0} + \field{issn}{0096-1000} + \field{journaltitle}{IRE Transactions on Information Theory} + \field{month}{03} + \field{number}{1} + \field{title}{Predictive coding--I} + \field{volume}{1} + \field{year}{1955} + \field{pages}{16\bibrangedash 24} + \verb{doi} + \verb 10.1109/TIT.1955.1055126 + \endverb + \warn{\item Field 'entryset' is no longer needed in set member entries in Biber - ignoring in entry 'Elias1955a'} + \endentry + +|; + +my $string3 = q| \entry{Elias1955b}{article}{} + \inset{Elias1955} + \name{labelname}{1}{% + {{Elias}{E.}{P.}{P.}{}{}{}{}}% + } + \name{author}{1}{% + {{Elias}{E.}{P.}{P.}{}{}{}{}}% + } + \strng{namehash}{EP1} + \strng{fullhash}{EP1} + \field{sortinit}{0} + \field{issn}{0096-1000} + \field{journaltitle}{IRE Transactions on Information Theory} + \field{month}{03} + \field{number}{1} + \field{title}{Predictive coding--II} + \field{volume}{1} + \field{year}{1955} + \field{pages}{24\bibrangedash 33} + \verb{doi} + \verb 10.1109/TIT.1955.1055116 + \endverb + \warn{\item Field 'entryset' is no longer needed in set member entries in Biber - ignoring in entry 'Elias1955b'} + \endentry + +|; + +is($out->get_output_entry($main,'elias1955'), $string1, 'Legacy set test 1'); +is($out->get_output_entry($main,'elias1955a'), $string2, 'Legacy set test 2'); +is($out->get_output_entry($main,'elias1955b'), $string3, 'Legacy set test 3'); + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/11-set-static.t b/Master/texmf-dist/source/bibtex/biber/t/11-set-static.t new file mode 100755 index 00000000000..c014c4bb1d0 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/11-set-static.t @@ -0,0 +1,129 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 5; + +use Biber; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata") ; + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('set-static.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests + +# Biber options +Biber::Config->setoption('fastsort', 1); + +# Now generate the information +$biber->prepare; +my $section = $biber->sections->get_section(0); +my $main = $section->get_list('MAIN'); +my $out = $biber->get_output_obj; + +my $string1 = q| \entry{Static1}{set}{} + \set{Static2,Static3,Static4} + \name{labelname}{1}{% + {{Bumble}{B.}{Brian}{B.}{}{}{}{}}% + } + \name{author}{1}{% + {{Bumble}{B.}{Brian}{B.}{}{}{}{}}% + } + \strng{namehash}{BB1} + \strng{fullhash}{BB1} + \field{sortinit}{0} + \field{labelyear}{2001} + \field{annotation}{Some notes} + \field{title}{Blessed Brains} + \field{year}{2001} + \endentry + +|; + +my $string2 = q| \entry{Static2}{book}{} + \inset{Static1} + \name{labelname}{1}{% + {{Bumble}{B.}{Brian}{B.}{}{}{}{}}% + } + \name{author}{1}{% + {{Bumble}{B.}{Brian}{B.}{}{}{}{}}% + } + \strng{namehash}{BB1} + \strng{fullhash}{BB1} + \field{sortinit}{0} + \field{annotation}{Some Blessed Note} + \field{title}{Blessed Brains} + \field{year}{2001} + \endentry + +|; + +my $string3 = q| \entry{Static3}{book}{} + \inset{Static1} + \name{labelname}{1}{% + {{Crenellation}{C.}{Clive}{C.}{}{}{}{}}% + } + \name{author}{1}{% + {{Crenellation}{C.}{Clive}{C.}{}{}{}{}}% + } + \strng{namehash}{CC1} + \strng{fullhash}{CC1} + \field{sortinit}{0} + \field{title}{Castles and Crime} + \field{year}{2002} + \endentry + +|; + +my $string4 = q| \entry{Static4}{book}{} + \inset{Static1} + \name{labelname}{1}{% + {{Dingle}{D.}{Derek}{D.}{}{}{}{}}% + } + \name{author}{1}{% + {{Dingle}{D.}{Derek}{D.}{}{}{}{}}% + } + \strng{namehash}{DD1} + \strng{fullhash}{DD1} + \field{sortinit}{0} + \field{title}{Dungeons, Dark and Dangerous} + \field{year}{2005} + \endentry + +|; + +# Labelyear is now here as skiplab is not set for this entry when cited in section +# without citation of a set it is a member of +my $string5 = q| \entry{Static2}{book}{} + \name{labelname}{1}{% + {{Bumble}{B.}{Brian}{B.}{}{}{}{}}% + } + \name{author}{1}{% + {{Bumble}{B.}{Brian}{B.}{}{}{}{}}% + } + \strng{namehash}{BB1} + \strng{fullhash}{BB1} + \field{sortinit}{0} + \field{labelyear}{2001} + \field{annotation}{Some Blessed Note} + \field{title}{Blessed Brains} + \field{year}{2001} + \endentry + +|; + + +is($out->get_output_entry($main,'Static1'), $string1, 'Static set test 1'); +is($out->get_output_entry($main,'Static2'), $string2, 'Static set test 2'); +is($out->get_output_entry($main,'Static3'), $string3, 'Static set test 3'); +is($out->get_output_entry($main,'Static4'), $string4, 'Static set test 4'); +is($out->get_output_entry($main,'Static2', 1), $string5, 'Static set test 5'); + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/12-skips.t b/Master/texmf-dist/source/bibtex/biber/t/12-skips.t new file mode 100755 index 00000000000..ae4f33ccb13 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/12-skips.t @@ -0,0 +1,207 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 16; + +use Biber; +use Biber::Utils; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata") ; + +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('skips.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests + +# Biber options +Biber::Config->setoption('fastsort', 1); + +# Now generate the information +$biber->prepare; +my $out = $biber->get_output_obj; +my $section = $biber->sections->get_section(0); +my $shs = $section->get_list('SHORTHANDS'); +my $main = $section->get_list('MAIN'); +my $bibentries = $section->bibentries; + +my $set1 = q| \entry{seta}{set}{} + \set{set:membera,set:memberb,set:memberc} + \name{labelname}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \name{author}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \strng{namehash}{DJ1} + \strng{fullhash}{DJ1} + \field{labelalpha}{Doe10} + \field{sortinit}{D} + \field{extrayear}{1} + \field{labelyear}{2010} + \field{extraalpha}{1} + \field{title}{Set Member A} + \field{year}{2010} + \keyw{key1, key2} + \endentry + +|; + +my $set2 = q| \entry{set:membera}{book}{} + \inset{seta} + \name{labelname}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \name{author}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \strng{namehash}{DJ1} + \strng{fullhash}{DJ1} + \field{sortinit}{D} + \field{title}{Set Member A} + \field{year}{2010} + \keyw{key1, key2} + \endentry + +|; + +my $set3 = q| \entry{set:memberb}{book}{} + \inset{seta} + \name{labelname}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \name{author}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \strng{namehash}{DJ1} + \strng{fullhash}{DJ1} + \field{sortinit}{D} + \field{title}{Set Member B} + \field{year}{2010} + \endentry + +|; + +my $set4 = q| \entry{set:memberc}{book}{} + \inset{seta} + \name{labelname}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \name{author}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \strng{namehash}{DJ1} + \strng{fullhash}{DJ1} + \field{sortinit}{D} + \field{title}{Set Member C} + \field{year}{2010} + \endentry + +|; + +my $noset1 = q| \entry{noseta}{book}{} + \name{labelname}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \name{author}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \strng{namehash}{DJ1} + \strng{fullhash}{DJ1} + \field{labelalpha}{Doe10} + \field{sortinit}{D} + \field{extrayear}{2} + \field{labelyear}{2010} + \field{extraalpha}{2} + \field{title}{Stand-Alone A} + \field{year}{2010} + \endentry + +|; + +my $noset2 = q| \entry{nosetb}{book}{} + \name{labelname}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \name{author}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \strng{namehash}{DJ1} + \strng{fullhash}{DJ1} + \field{labelalpha}{Doe10} + \field{sortinit}{D} + \field{extrayear}{3} + \field{labelyear}{2010} + \field{extraalpha}{3} + \field{title}{Stand-Alone B} + \field{year}{2010} + \endentry + +|; + +my $noset3 = q| \entry{nosetc}{book}{} + \name{labelname}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \name{author}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \strng{namehash}{DJ1} + \strng{fullhash}{DJ1} + \field{labelalpha}{Doe10} + \field{sortinit}{D} + \field{extrayear}{4} + \field{labelyear}{2010} + \field{extraalpha}{4} + \field{title}{Stand-Alone C} + \field{year}{2010} + \endentry + +|; + +my $sk4 = q| \entry{skip4}{article}{dataonly} + \name{labelname}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \name{author}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \list{location}{1}{% + {Cambridge}% + } + \list{publisher}{1}{% + {A press}% + } + \strng{namehash}{DJ1} + \strng{fullhash}{DJ1} + \field{sortinit}{D} + \field{shorthand}{AWS} + \field{title}{Algorithms Which Sort} + \field{year}{1932} + \endentry + +|; + +is_deeply([$shs->get_keys], ['skip1'], 'skiplos - not in LOS'); +is($bibentries->entry('skip1')->get_field('options'), 'skipbib', 'Passing skipbib through'); +is($bibentries->entry('skip2')->get_field('labelalpha'), 'SA', 'Normal labelalpha'); +is($bibentries->entry('skip2')->get_field($bibentries->entry('skip2')->get_field('labelyearname')), '1995', 'Normal labelyear'); +ok(is_undef($bibentries->entry('skip3')->get_field('labelalpha')), 'skiplab - no labelalpha'); +ok(is_undef($bibentries->entry('skip3')->get_field('labelyearname')), 'skiplab - no labelyear'); +ok(is_undef($bibentries->entry('skip4')->get_field('labelalpha')), 'dataonly - no labelalpha'); +is($out->get_output_entry($main,'skip4'), $sk4, 'dataonly - checking output'); +ok(is_undef($bibentries->entry('skip4')->get_field('labelyearname')), 'dataonly - no labelyear'); +is($out->get_output_entry($main,'seta'), $set1, 'Set parent - with labels'); +is($out->get_output_entry($main,'set:membera'), $set2, 'Set member - no labels 1'); +is($out->get_output_entry($main,'set:memberb'), $set3, 'Set member - no labels 2'); +is($out->get_output_entry($main,'set:memberc'), $set4, 'Set member - no labels 3'); +is($out->get_output_entry($main,'noseta'), $noset1, 'Not a set member - extrayear continues from set 1'); +is($out->get_output_entry($main,'nosetb'), $noset2, 'Not a set member - extrayear continues from set 2'); +is($out->get_output_entry($main,'nosetc'), $noset3, 'Not a set member - extrayear continues from set 3'); + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/13-uniquename.t b/Master/texmf-dist/source/bibtex/biber/t/13-uniquename.t new file mode 100755 index 00000000000..805a7e50863 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/13-uniquename.t @@ -0,0 +1,171 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 5; + +use Biber; +use Biber::Output::BBL; +use Biber::Utils; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata") ; + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('uniquename.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests + +# Biber options +Biber::Config->setoption('fastsort', 1); + +# Now generate the information +$biber->prepare; +my $out = $biber->get_output_obj; +my $section = $biber->sections->get_section(0); +my $main = $section->get_list('MAIN'); +my $bibentries = $section->bibentries; + +my $un1 = q| \entry{un1}{book}{} + \name{labelname}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \name{author}{1}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + } + \list{location}{1}{% + {Cambridge}% + } + \list{publisher}{1}{% + {A press}% + } + \strng{namehash}{DJ1} + \strng{fullhash}{DJ1} + \field{labelalpha}{Doe94} + \field{sortinit}{D} + \field{labelyear}{1994} + \count{uniquename}{2} + \field{title}{Unique 1} + \field{year}{1994} + \endentry + +|; + +my $un2 = q| \entry{un2}{book}{} + \name{labelname}{1}{% + {{Doe}{D.}{Edward}{E.}{}{}{}{}}% + } + \name{author}{1}{% + {{Doe}{D.}{Edward}{E.}{}{}{}{}}% + } + \list{location}{1}{% + {Cambridge}% + } + \list{publisher}{1}{% + {A press}% + } + \strng{namehash}{DE1} + \strng{fullhash}{DE1} + \field{labelalpha}{Doe34} + \field{sortinit}{D} + \field{labelyear}{1934} + \count{uniquename}{1} + \field{title}{Unique 2} + \field{year}{1934} + \endentry + +|; + +my $un3 = q| \entry{un3}{book}{} + \name{labelname}{1}{% + {{Doe}{D.}{Jane}{J.}{}{}{}{}}% + } + \name{author}{1}{% + {{Doe}{D.}{Jane}{J.}{}{}{}{}}% + } + \list{location}{1}{% + {Cambridge}% + } + \list{publisher}{1}{% + {A press}% + } + \strng{namehash}{DJ2} + \strng{fullhash}{DJ2} + \field{labelalpha}{Doe83} + \field{sortinit}{D} + \field{labelyear}{1983} + \count{uniquename}{2} + \field{title}{Unique 3} + \field{year}{1983} + \endentry + +|; + +my $un4 = q| \entry{un4}{book}{} + \name{labelname}{2}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + {{Mills}{M.}{Mike}{M.}{}{}{}{}}% + } + \name{author}{2}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + {{Mills}{M.}{Mike}{M.}{}{}{}{}}% + } + \list{location}{1}{% + {Cambridge}% + } + \list{publisher}{1}{% + {A press}% + } + \strng{namehash}{DJ+1} + \strng{fullhash}{DJMM1} + \field{labelalpha}{Doe\textbf{+}21} + \field{sortinit}{D} + \field{labelyear}{1921} + \count{uniquename}{0} + \field{title}{Unique 4} + \field{year}{1921} + \endentry + +|; + +my $un5 = q| \entry{un5}{book}{} + \name{labelname}{1}{% + {{Chaps}{C.}{}{}{}{}{}{}}% + } + \name{author}{2}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + {{Mills}{M.}{Mike}{M.}{}{}{}{}}% + } + \name{shortauthor}{1}{% + {{Chaps}{C.}{}{}{}{}{}{}}% + } + \list{location}{1}{% + {Cambridge}% + } + \list{publisher}{1}{% + {A press}% + } + \strng{namehash}{C1} + \strng{fullhash}{DJMM1} + \field{labelalpha}{Cha21} + \field{sortinit}{D} + \field{labelyear}{1921} + \count{uniquename}{0} + \field{title}{Unique 5} + \field{year}{1921} + \endentry + +|; + + +is($out->get_output_entry($main,'un1'), $un1, 'Uniquename requiring full name expansion - 1'); +is($out->get_output_entry($main,'un3'), $un3, 'Uniquename requiring full name expansion - 2'); +is($out->get_output_entry($main,'un2'), $un2, 'Uniquename requiring initials name expansion'); +is($out->get_output_entry($main,'un4'), $un4, 'Namehash and fullhash different due to maxnames setting'); +is($out->get_output_entry($main,'un5'), $un5, 'Fullnamshash ignores SHORT* names'); + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/14-sections.t b/Master/texmf-dist/source/bibtex/biber/t/14-sections.t new file mode 100755 index 00000000000..2414da99f58 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/14-sections.t @@ -0,0 +1,98 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 14; +use Biber; +use Biber::Constants; +use Biber::Utils; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata"); + +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('sections.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests + +# Biber options +Biber::Config->setoption('fastsort', 1); +Biber::Config->setoption('bblsafechars', 1); + +# Now generate the information +$biber->prepare; +my $out = $biber->get_output_obj; +my $section0 = $biber->sections->get_section(0); +my $main0 = $section0->get_list('MAIN'); +my $shs0 = $section0->get_list('SHORTHANDS'); +my $section1 = $biber->sections->get_section(1); +my $main1 = $section1->get_list('MAIN'); +my $shs1 = $section1->get_list('SHORTHANDS'); +my $section2 = $biber->sections->get_section(2); +my $main2 = $section2->get_list('MAIN'); +my $shs2 = $section2->get_list('SHORTHANDS'); +my $section3 = $biber->sections->get_section(3); +my $main3 = $section3->get_list('MAIN'); +my $shs3 = $section3->get_list('SHORTHANDS'); + +my $preamble = [ + 'Å tring for Preamble 1', + 'String for Preamble 2', + 'String for Preamble 3', + 'String for Preamble 4' + ]; + +my $v = $Biber::VERSION; +if ($Biber::BETA_VERSION) { + $v .= ' (beta)'; +} + +my $head = qq|% \$ biblatex auxiliary file \$ +% \$ biblatex version $BIBLATEX_VERSION \$ +% \$ biber version $v \$ +% Do not modify the above lines! +% +% This is an auxiliary file used by the 'biblatex' package. +% This file may safely be deleted. It will be recreated by +% biber or bibtex as required. +% +\\begingroup +\\makeatletter +\\\@ifundefined{ver\@biblatex.sty} + {\\\@latex\@error + {Missing 'biblatex' package} + {The bibliography requires the 'biblatex' package.} + \\aftergroup\\endinput} + {} +\\endgroup + +\\preamble{% +\\v{S}tring for Preamble 1% +String for Preamble 2% +String for Preamble 3% +String for Preamble 4% +} + +|; + +is_deeply($biber->get_preamble, $preamble, 'Preamble for all sections'); +is($section0->bibentry('sect1')->get_field('note'), 'value1', 'Section 0 macro test'); +# If macros were not reset between sections, this would give a macro redef error +is($section1->bibentry('sect4')->get_field('note'), 'value2', 'Section 1 macro test'); +is_deeply([$main0->get_keys], ['sect1', 'sect2', 'sect3', 'sect8'], 'Section 0 citekeys'); +is_deeply([$shs0->get_keys], ['sect1', 'sect2', 'sect8'], 'Section 0 shorthands'); +is_deeply([$main1->get_keys], ['sect4', 'sect5'], 'Section 1 citekeys'); +is_deeply([$shs1->get_keys], ['sect4', 'sect5'], 'Section 1 shorthands'); +is_deeply([$main2->get_keys], ['sect1', 'sect6', 'sect7'], 'Section 2 citekeys'); +is_deeply([$shs2->get_keys], ['sect1', 'sect6', 'sect7'], 'Section 2 shorthands'); +is_deeply([$section3->get_orig_order_citekeys], ['sect1', 'sect2', 'sectall1'], 'Section 3 citekeys'); +is($out->get_output_section(0)->number, '0', 'Checking output sections - 1'); +is($out->get_output_section(1)->number, '1', 'Checking output sections - 2'); +is($out->get_output_section(2)->number, '2', 'Checking output sections - 3'); +is($out->get_output_head, $head, 'Preamble output check with bblsafechars'); + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/15-sections-complex.t b/Master/texmf-dist/source/bibtex/biber/t/15-sections-complex.t new file mode 100755 index 00000000000..8145483dc06 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/15-sections-complex.t @@ -0,0 +1,176 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 64; + +use Biber; +use Biber::Utils; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata"); + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('sections-complex.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests + +# Biber options +Biber::Config->setoption('fastsort', 1); +Biber::Config->setoption('sortlocale', 'C'); + +# Biblatex options +Biber::Config->setblxoption('labelalpha', 1); +Biber::Config->setblxoption('maxnames', 1); +Biber::Config->setblxoption('labelyear', undef); + +# Now generate the information +$biber->prepare; +my $section0 = $biber->sections->get_section(0); +my $bibentries0 = $section0->bibentries; +my $main0 = $section0->get_list('MAIN'); +my $section1 = $biber->sections->get_section(1); +my $main1 = $section1->get_list('MAIN'); +my $bibentries1 = $section1->bibentries; + +is($bibentries0->entry('l1')->get_field('sortlabelalpha'), 'Doe95', 'maxnames=1 minnames=1 entry L1 labelalpha'); +ok(is_undef($main0->get_extraalphadata('l1')), 'maxnames=1 minnames=1 entry L1 extraalpha'); +is($bibentries0->entry('l2')->get_field('sortlabelalpha'), 'Doe+95', 'maxnames=1 minnames=1 entry L2 labelalpha'); +is($main0->get_extraalphadata('l2'), '1', 'maxnames=1 minnames=1 entry L2 extraalpha'); +is($bibentries0->entry('l3')->get_field('sortlabelalpha'), 'Doe+95', 'maxnames=1 minnames=1 entry L3 labelalpha'); +is($main0->get_extraalphadata('l3'), '2', 'maxnames=1 minnames=1 entry L3 extraalpha'); +is($bibentries0->entry('l4')->get_field('sortlabelalpha'), 'Doe+95', 'maxnames=1 minnames=1 entry L4 labelalpha'); +is($main0->get_extraalphadata('l4'), '3', 'maxnames=1 minnames=1 entry L4 extraalpha'); +is($bibentries1->entry('l5')->get_field('sortlabelalpha'), 'Doe+95', 'maxnames=1 minnames=1 entry L5 labelalpha'); +is($main1->get_extraalphadata('l5'), '1', 'maxnames=1 minnames=1 entry L5 extraalpha'); +is($bibentries1->entry('l6')->get_field('sortlabelalpha'), 'Doe+95', 'maxnames=1 minnames=1 entry L6 labelalpha'); +is($main1->get_extraalphadata('l6'), '2', 'maxnames=1 minnames=1 entry L6 extraalpha'); +is($bibentries1->entry('l7')->get_field('sortlabelalpha'), 'Doe+95', 'maxnames=1 minnames=1 entry L7 labelalpha'); +is($main1->get_extraalphadata('l7'), '3', 'maxnames=1 minnames=1 entry L7 extraalpha'); +is($bibentries1->entry('l8')->get_field('sortlabelalpha'), 'Sha85', 'maxnames=1 minnames=1 entry L8 labelalpha'); +ok(is_undef($main1->get_extraalphadata('l8')), 'maxnames=1 minnames=1 entry L8 extraalpha'); + +# reset options and regenerate information +Biber::Config->setblxoption('maxnames', 2); +Biber::Config->setblxoption('minnames', 1); + +for (my $i=1; $i<5; $i++) { + $bibentries0->entry("l$i")->del_field('sortlabelalpha'); + $bibentries0->entry("l$i")->del_field('labelalpha'); + $main0->set_extraalphadata("l$i", undef); +} +for (my $i=5; $i<9; $i++) { + $bibentries1->entry("l$i")->del_field('sortlabelalpha'); + $bibentries1->entry("l$i")->del_field('labelalpha'); + $main1->set_extraalphadata("l$i", undef); +} +$biber->prepare; +$section0 = $biber->sections->get_section(0); +$bibentries0 = $section0->bibentries; +$main0 = $section0->get_list('MAIN'); +$section1 = $biber->sections->get_section(1); +$main1 = $section1->get_list('MAIN'); +$bibentries1 = $section1->bibentries; + +is($bibentries0->entry('l1')->get_field('sortlabelalpha'), 'Doe95', 'maxnames=2 minnames=1 entry L1 labelalpha'); +ok(is_undef($main0->get_extraalphadata('l1')), 'maxnames=2 minnames=1 entry L1 extraalpha'); +is($bibentries0->entry('l2')->get_field('sortlabelalpha'), 'DA95', 'maxnames=2 minnames=1 entry L2 labelalpha'); +is($main0->get_extraalphadata('l2'), '1', 'maxnames=2 minnames=1 entry L2 extraalpha'); +is($bibentries0->entry('l3')->get_field('sortlabelalpha'), 'DA95', 'maxnames=2 minnames=1 entry L3 labelalpha'); +is($main0->get_extraalphadata('l3'), '2', 'maxnames=2 minnames=1 entry L3 extraalpha'); +is($bibentries0->entry('l4')->get_field('sortlabelalpha'), 'Doe+95', 'maxnames=2 minnames=1 entry L4 labelalpha'); +ok(is_undef($main0->get_extraalphadata('l4')), 'maxnames=2 minnames=1 entry L4 extraalpha'); +is($bibentries1->entry('l5')->get_field('sortlabelalpha'), 'Doe+95', 'maxnames=2 minnames=1 entry L5 labelalpha'); +is($main1->get_extraalphadata('l5'), '1', 'maxnames=2 minnames=1 entry L5 extraalpha'); +is($bibentries1->entry('l6')->get_field('sortlabelalpha'), 'Doe+95', 'maxnames=2 minnames=1 entry L6 labelalpha'); +is($main1->get_extraalphadata('l6'), '2', 'maxnames=2 minnames=1 entry L6 extraalpha'); +is($bibentries1->entry('l7')->get_field('sortlabelalpha'), 'Doe+95', 'maxnames=2 minnames=1 entry L7 labelalpha'); +is($main1->get_extraalphadata('l7'), '3', 'maxnames=2 minnames=1 entry L7 extraalpha'); +is($bibentries1->entry('l8')->get_field('sortlabelalpha'), 'Sha85', 'maxnames=2 minnames=1 entry L8 labelalpha'); +ok(is_undef($main1->get_extraalphadata('l8')), 'maxnames=2 minnames=1 entry L8 extraalpha'); + +# reset options and regenerate information +Biber::Config->setblxoption('maxnames', 2); +Biber::Config->setblxoption('minnames', 2); + +for (my $i=1; $i<5; $i++) { + $bibentries0->entry("l$i")->del_field('sortlabelalpha'); + $bibentries0->entry("l$i")->del_field('labelalpha'); + $main0->set_extraalphadata("l$i", undef); +} +for (my $i=5; $i<9; $i++) { + $bibentries1->entry("l$i")->del_field('sortlabelalpha'); + $bibentries1->entry("l$i")->del_field('labelalpha'); + $main1->set_extraalphadata("l$i", undef); +} +$biber->prepare; +$section0 = $biber->sections->get_section(0); +$bibentries0 = $section0->bibentries; +$main0 = $section0->get_list('MAIN'); +$section1 = $biber->sections->get_section(1); +$main1 = $section1->get_list('MAIN'); +$bibentries1 = $section1->bibentries; + +is($bibentries0->entry('l1')->get_field('sortlabelalpha'), 'Doe95', 'maxnames=2 minnames=2 entry L1 labelalpha'); +ok(is_undef($main0->get_extraalphadata('l1')), 'maxnames=2 minnames=2 entry L1 extraalpha'); +is($bibentries0->entry('l2')->get_field('sortlabelalpha'), 'DA95', 'maxnames=2 minnames=2 entry L2 labelalpha'); +is($main0->get_extraalphadata('l2'), '1', 'maxnames=2 minnames=2 entry L2 extraalpha'); +is($bibentries0->entry('l3')->get_field('sortlabelalpha'), 'DA95', 'maxnames=2 minnames=2 entry L3 labelalpha'); +is($main0->get_extraalphadata('l3'), '2', 'maxnames=2 minnames=2 entry L3 extraalpha'); +is($bibentries0->entry('l4')->get_field('sortlabelalpha'), 'DA+95', 'maxnames=2 minnames=2 entry L4 labelalpha'); +ok(is_undef($main0->get_extraalphadata('l4')), 'maxnames=2 minnames=2 entry L4 extraalpha'); +is($bibentries1->entry('l5')->get_field('sortlabelalpha'), 'DA+95', 'maxnames=2 minnames=2 entry L5 labelalpha'); +ok(is_undef($main1->get_extraalphadata('l5')), 'maxnames=2 minnames=2 entry L5 extraalpha'); +is($bibentries1->entry('l6')->get_field('sortlabelalpha'), 'DS+95', 'maxnames=2 minnames=2 entry L6 labelalpha'); +is($main1->get_extraalphadata('l6'), '1', 'maxnames=2 minnames=2 entry L6 extraalpha'); +is($bibentries1->entry('l7')->get_field('sortlabelalpha'), 'DS+95', 'maxnames=2 minnames=2 entry L7 labelalpha'); +is($main1->get_extraalphadata('l7'), '2', 'maxnames=2 minnames=2 entry L7 extraalpha'); +is($bibentries1->entry('l8')->get_field('sortlabelalpha'), 'Sha85', 'maxnames=2 minnames=2 entry L8 labelalpha'); +ok(is_undef($main1->get_extraalphadata('l8')), 'maxnames=2 minnames=2 entry L8 extraalpha'); + +# reset options and regenerate information +Biber::Config->setblxoption('maxnames', 3); +Biber::Config->setblxoption('minnames', 1); + +for (my $i=1; $i<5; $i++) { + $bibentries0->entry("l$i")->del_field('sortlabelalpha'); + $bibentries0->entry("l$i")->del_field('labelalpha'); + $main0->set_extraalphadata("l$i", undef); +} +for (my $i=5; $i<9; $i++) { + $bibentries1->entry("l$i")->del_field('sortlabelalpha'); + $bibentries1->entry("l$i")->del_field('labelalpha'); + $main1->set_extraalphadata("l$i", undef); +} + +$biber->prepare; +$section0 = $biber->sections->get_section(0); +$bibentries0 = $section0->bibentries; +$main0 = $section0->get_list('MAIN'); +$section1 = $biber->sections->get_section(1); +$main1 = $section1->get_list('MAIN'); +$bibentries1 = $section1->bibentries; + +is($bibentries0->entry('l1')->get_field('sortlabelalpha'), 'Doe95', 'maxnames=3 minnames=1 entry L1 labelalpha'); +ok(is_undef($main0->get_extraalphadata('l1')), 'maxnames=3 minnames=1 entry L1 extraalpha'); +is($bibentries0->entry('l2')->get_field('sortlabelalpha'), 'DA95', 'maxnames=3 minnames=1 entry L2 labelalpha'); +is($main0->get_extraalphadata('l2'), '1', 'maxnames=3 minnames=1 entry L2 extraalpha'); +is($bibentries0->entry('l3')->get_field('sortlabelalpha'), 'DA95', 'maxnames=3 minnames=1 entry L3 labelalpha'); +is($main0->get_extraalphadata('l3'), '2', 'maxnames=3 minnames=1 entry L3 extraalpha'); +is($bibentries0->entry('l4')->get_field('sortlabelalpha'), 'DAE95', 'maxnames=3 minnames=1 entry L4 labelalpha'); +ok(is_undef($main0->get_extraalphadata('l4')), 'maxnames=3 minnames=1 entry L4 extraalpha'); +is($bibentries1->entry('l5')->get_field('sortlabelalpha'), 'DAE95', 'maxnames=3 minnames=1 entry L5 labelalpha'); +ok(is_undef($main1->get_extraalphadata('l5')), 'maxnames=3 minnames=1 entry L5 extraalpha'); +is($bibentries1->entry('l6')->get_field('sortlabelalpha'), 'DSE95', 'maxnames=3 minnames=1 entry L6 labelalpha'); +ok(is_undef($main1->get_extraalphadata('l6')), 'maxnames=3 minnames=1 entry L6 extraalpha'); +is($bibentries1->entry('l7')->get_field('sortlabelalpha'), 'DSJ95', 'maxnames=3 minnames=1 entry L7 labelalpha'); +ok(is_undef($main1->get_extraalphadata('l7')), 'maxnames=3 minnames=1 entry L7 extraalpha'); +is($bibentries1->entry('l8')->get_field('sortlabelalpha'), 'Sha85', 'maxnames=3 minnames=1 entry L8 labelalpha'); +ok(is_undef($main1->get_extraalphadata('l8')), 'maxnames=3 minnames=1 entry L8 extraalpha'); + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/16-encoding.t b/Master/texmf-dist/source/bibtex/biber/t/16-encoding.t new file mode 100755 index 00000000000..d1d76863ef2 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/16-encoding.t @@ -0,0 +1,322 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 10; + +use Biber; +use Biber::Utils; +use Biber::Output::Test; +use Encode; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata"); + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +Biber::Config->setoption('fastsort', 1); +Biber::Config->setoption('sortlocale', 'C'); + +my $encode1 = q| \entry{testÅ }{book}{} + \name{labelname}{1}{% + {{Encalcer}{E}{Edward}{E}{}{}{}{}}% + } + \name{author}{1}{% + {{Encalcer}{E}{Edward}{E}{}{}{}{}}% + } + \list{publisher}{1}{% + {A press}% + } + \strng{namehash}{EE1} + \strng{fullhash}{EE1} + \field{labelalpha}{Enc99} + \field{sortinit}{E} + \field{labelyear}{1999} + \count{uniquename}{0} + \true{singletitle} + \field{title}{Å ome title} + \field{year}{1999} + \endentry + +|; + +my $encode2 = q| \entry{test1}{book}{} + \name{labelname}{1}{% + {{Encalcer}{E}{Edward}{E}{}{}{}{}}% + } + \name{author}{1}{% + {{Encalcer}{E}{Edward}{E}{}{}{}{}}% + } + \list{publisher}{1}{% + {A press}% + } + \strng{namehash}{EE1} + \strng{fullhash}{EE1} + \field{labelalpha}{Enc99} + \field{sortinit}{E} + \field{labelyear}{1999} + \count{uniquename}{0} + \true{singletitle} + \field{title}{Söme title} + \field{year}{1999} + \endentry + +|; + +my $encode3 = q| \entry{test1}{book}{} + \name{labelname}{1}{% + {{Encalcer}{E}{Edward}{E}{}{}{}{}}% + } + \name{author}{1}{% + {{Encalcer}{E}{Edward}{E}{}{}{}{}}% + } + \list{publisher}{1}{% + {A press}% + } + \strng{namehash}{EE1} + \strng{fullhash}{EE1} + \field{labelalpha}{Enc99} + \field{sortinit}{E} + \field{labelyear}{1999} + \count{uniquename}{0} + \true{singletitle} + \field{title}{Å»ome title} + \field{year}{1999} + \endentry + +|; + +my $encode5 = q| \entry{test}{book}{} + \name{labelname}{1}{% + {{Encalcer}{E}{Edward}{E}{}{}{}{}}% + } + \name{author}{1}{% + {{Encalcer}{E}{Edward}{E}{}{}{}{}}% + } + \list{publisher}{1}{% + {A press}% + } + \strng{namehash}{EE1} + \strng{fullhash}{EE1} + \field{labelalpha}{Enc99} + \field{sortinit}{E} + \field{labelyear}{1999} + \count{uniquename}{0} + \true{singletitle} + \field{title}{à titlé} + \field{year}{1999} + \endentry + +|; + +my $encode6 = q| \entry{test}{book}{} + \name{labelname}{1}{% + {{Encalcer}{E}{Edward}{E}{}{}{}{}}% + } + \name{author}{1}{% + {{Encalcer}{E}{Edward}{E}{}{}{}{}}% + } + \list{publisher}{1}{% + {A press}% + } + \strng{namehash}{EE1} + \strng{fullhash}{EE1} + \field{labelalpha}{Enc99} + \field{sortinit}{E} + \field{labelyear}{1999} + \count{uniquename}{0} + \true{singletitle} + \field{title}{↑\`{a} titl\'{e}} + \field{year}{1999} + \endentry + +|; + +my $encode7 = q| \entry{test}{book}{} + \name{labelname}{1}{% + {{Encalcer}{E}{Edward}{E}{}{}{}{}}% + } + \name{author}{1}{% + {{Encalcer}{E}{Edward}{E}{}{}{}{}}% + } + \list{publisher}{1}{% + {A press}% + } + \strng{namehash}{EE1} + \strng{fullhash}{EE1} + \field{labelalpha}{Enc99} + \field{sortinit}{E} + \field{labelyear}{1999} + \count{uniquename}{0} + \true{singletitle} + \field{title}{{$\uparrow$}\`{a} titl\'{e}} + \field{year}{1999} + \endentry + +|; + + +my $outvar; +my $output; + +# Latin9 .bib -> UTF-8 .bbl +$biber->parse_ctrlfile('encoding1.bcf'); +$biber->set_output_obj(Biber::Output::Test->new()); +# Biber options +Biber::Config->setoption('bibencoding', 'latin9'); +Biber::Config->setoption('bblencoding', 'UTF-8'); +# Now generate the information +$biber->prepare; +# Get reference to output object +$output = $biber->get_output_obj; +$output->set_output_target_file(\$outvar); +# Write the output to the target +$output->output; +is($outvar, encode(Biber::Config->getoption('bblencoding'), $encode1), 'latin9 .bib -> UTF-8 .bbl'); + +# UTF-8 .bib -> UTF-8 .bbl +$biber->parse_ctrlfile('encoding2.bcf'); +$biber->set_output_obj(Biber::Output::Test->new()); +# Biber options +Biber::Config->setoption('bibencoding', 'UTF-8'); +Biber::Config->setoption('bblencoding', 'UTF-8'); +# Now generate the information +$biber->prepare; +# Get reference to output object +$output = $biber->get_output_obj; +$output->set_output_target_file(\$outvar); +# Write the output to the target +$output->output; +is($outvar, encode(Biber::Config->getoption('bblencoding'), $encode1), 'UTF-8 .bib -> UTF-8 .bbl'); + +# UTF-8 .bib -> latin1 .bbl +$biber->parse_ctrlfile('encoding5.bcf'); +$biber->set_output_obj(Biber::Output::Test->new()); +# Biber options +Biber::Config->setoption('bibencoding', 'UTF-8'); +Biber::Config->setoption('bblencoding', 'latin1'); +# Now generate the information +$biber->prepare; +# Get reference to output object +$output = $biber->get_output_obj; +$output->set_output_target_file(\$outvar); +# Write the output to the target +$output->output; +is($outvar, encode(Biber::Config->getoption('bblencoding'), $encode5), 'UTF-8 .bib -> latin1 .bbl'); + +# UTF-8 .bib -> UTF-8 with --bblsafechars +$biber->parse_ctrlfile('encoding6.bcf'); +$biber->set_output_obj(Biber::Output::Test->new()); +# Biber options +Biber::Config->setoption('bibencoding', 'UTF-8'); +Biber::Config->setoption('bblencoding', 'UTF-8'); +Biber::Config->setoption('bblsafechars', 1); +# Now generate the information +$biber->prepare; +# Get reference to output object +$output = $biber->get_output_obj; +$output->set_output_target_file(\$outvar); +# Write the output to the target +$output->output; +is($outvar, encode(Biber::Config->getoption('bblencoding'), $encode6), 'UTF-8 .bib -> UTF-8 .bbl, safechars'); + +# UTF-8 .bib -> UTF-8 with --bblsafechars and --bblcharsset=full +$biber->parse_ctrlfile('encoding6.bcf'); +$biber->set_output_obj(Biber::Output::Test->new()); +# Biber options +Biber::Config->setoption('bibencoding', 'UTF-8'); +Biber::Config->setoption('bblencoding', 'UTF-8'); +Biber::Config->setoption('bblsafechars', 1); +Biber::Config->setoption('bblsafecharsset', 'full'); +# Now generate the information +$biber->prepare; +# Get reference to output object +$output = $biber->get_output_obj; +$output->set_output_target_file(\$outvar); +# Write the output to the target +$output->output; +is($outvar, encode(Biber::Config->getoption('bblencoding'), $encode7), 'UTF-8 .bib -> UTF-8 .bbl, bblsafecharsset=full'); + +# UTF-8 .bib -> Latin9 .bbl +$biber->parse_ctrlfile('encoding2.bcf'); +$biber->set_output_obj(Biber::Output::Test->new()); +# Biber options +Biber::Config->setoption('bblsafechars', 0); +Biber::Config->setoption('bibencoding', 'UTF-8'); +Biber::Config->setoption('bblencoding', 'latin9'); +# Now generate the information +$biber->prepare; +# Get reference to output object +$output = $biber->get_output_obj; +$output->set_output_target_file(\$outvar); +# Write the output to the target +$output->output; +is($outvar, encode(Biber::Config->getoption('bblencoding'), $encode1), 'UTF-8 .bib -> latin9 .bbl'); + +# latin1 .bib -> cp1252 .bbl +$biber->parse_ctrlfile('encoding3.bcf'); +$biber->set_output_obj(Biber::Output::Test->new()); +# Biber options +Biber::Config->setoption('bibencoding', 'latin1'); +Biber::Config->setoption('bblencoding', 'cp1252'); +# Now generate the information +$biber->prepare; +# Get reference to output object +$output = $biber->get_output_obj; +$output->set_output_target_file(\$outvar); +# Write the output to the target +$output->output; +is($outvar, encode(Biber::Config->getoption('bblencoding'), $encode2), 'latin1 .bib -> CP1252 .bbl'); + +# latin2 .bib -> latin3 .bbl +$biber->parse_ctrlfile('encoding4.bcf'); +$biber->set_output_obj(Biber::Output::Test->new()); +# Biber options +Biber::Config->setoption('bibencoding', 'latin2'); +Biber::Config->setoption('bblencoding', 'latin3'); +# Now generate the information +$biber->prepare; +# Get reference to output object +$output = $biber->get_output_obj; +$output->set_output_target_file(\$outvar); +# Write the output to the target +$output->output; +is($outvar, encode(Biber::Config->getoption('bblencoding'), $encode3), 'latin2 .bib -> latin3 .bbl'); + +# latin2 .bib -> latin1 .bbl - should fail +$biber->parse_ctrlfile('encoding4.bcf'); +$biber->set_output_obj(Biber::Output::Test->new()); +# Biber options +Biber::Config->setoption('bibencoding', 'latin2'); +Biber::Config->setoption('bblencoding', 'latin1'); +# Now generate the information +$biber->prepare; +# Get reference to output object +$output = $biber->get_output_obj; +$output->set_output_target_file(\$outvar); +# Write the output to the target +# This test will generate encoding errors so redirect STDERR until it's done +open OLDERR, '>&', \*STDERR; +open STDERR, '>', '/dev/null'; +$output->output; +open STDERR, '>&', \*OLDERR; +isnt($outvar, encode(Biber::Config->getoption('bblencoding'), $encode3), 'latin2 .bib -> latin1 .bbl failure'); + +# Custom encoding alias +# latin1 .bib -> applemacce (MacRoman) .bbl +$biber->parse_ctrlfile('encoding3.bcf'); +$biber->set_output_obj(Biber::Output::Test->new()); +# Biber options +Biber::Config->setoption('bibencoding', 'latin1'); +Biber::Config->setoption('bblencoding', 'applemacce'); +# Now generate the information +$biber->prepare; +# Get reference to output object +$output = $biber->get_output_obj; +$output->set_output_target_file(\$outvar); +# Write the output to the target +$output->output; +is($outvar, encode(Biber::Config->getoption('bblencoding'), $encode2), 'latin1 .bib -> applemacce (custom alias) .bbl'); + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/17-crossrefs.t b/Master/texmf-dist/source/bibtex/biber/t/17-crossrefs.t new file mode 100755 index 00000000000..3f5574b372f --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/17-crossrefs.t @@ -0,0 +1,434 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 20; + +use Biber; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata") ; + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('crossrefs.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests + +# Biber options +Biber::Config->setoption('fastsort', 1); + +# Now generate the information +$biber->prepare; +my $section0 = $biber->sections->get_section(0); +my $main0 = $section0->get_list('MAIN'); +my $section1 = $biber->sections->get_section(1); +my $main1 = $section1->get_list('MAIN'); +my $out = $biber->get_output_obj; + +# crossref field is included as the parent is included by being crossrefed >= mincrossrefs times +my $cr1 = q| \entry{cr1}{inbook}{} + \name{labelname}{1}{% + {{Gullam}{G.}{Graham}{G.}{}{}{}{}}% + } + \name{author}{1}{% + {{Gullam}{G.}{Graham}{G.}{}{}{}{}}% + } + \name{editor}{1}{% + {{Erbriss}{E.}{Edgar}{E.}{}{}{}{}}% + } + \list{publisher}{1}{% + {Grimble}% + } + \strng{namehash}{GG1} + \strng{fullhash}{GG1} + \field{sortinit}{G} + \field{labelyear}{1974} + \field{booktitle}{Graphs of the Continent} + \strng{crossref}{crm} + \field{eprintclass}{SOMECLASS} + \field{eprinttype}{SomEPrFiX} + \field{origyear}{1955} + \field{title}{Great and Good Graphs} + \field{year}{1974} + \endentry + +|; + +# crossref field is included as the parent is included by being crossrefed >= mincrossrefs times +my $cr2 = q| \entry{cr2}{inbook}{} + \name{labelname}{1}{% + {{Fumble}{F.}{Frederick}{F.}{}{}{}{}}% + } + \name{author}{1}{% + {{Fumble}{F.}{Frederick}{F.}{}{}{}{}}% + } + \name{editor}{1}{% + {{Erbriss}{E.}{Edgar}{E.}{}{}{}{}}% + } + \list{institution}{1}{% + {Institution}% + } + \list{publisher}{1}{% + {Grimble}% + } + \strng{namehash}{FF1} + \strng{fullhash}{FF1} + \field{sortinit}{F} + \field{labelyear}{1974} + \field{booktitle}{Graphs of the Continent} + \strng{crossref}{crm} + \field{origyear}{1943} + \field{title}{Fabulous Fourier Forms} + \field{year}{1974} + \warn{\item Field 'school' is aliased to field 'institution' but both are defined in entry with key 'cr2' - skipping field 'school'} + \endentry + +|; + +# This is included as it is crossrefed >= mincrossrefs times +# Notice lack of labelname and hashes because the only name is EDITOR and useeditor is false +my $crm = q| \entry{crm}{book}{} + \name{editor}{1}{% + {{Erbriss}{E.}{Edgar}{E.}{}{}{}{}}% + } + \list{publisher}{1}{% + {Grimble}% + } + \strng{namehash}{1} + \strng{fullhash}{1} + \field{sortinit}{G} + \field{labelyear}{1974} + \field{title}{Graphs of the Continent} + \field{year}{1974} + \endentry + +|; + +# crossref field is included as the parent is cited +my $cr3 = q| \entry{cr3}{inbook}{} + \name{labelname}{1}{% + {{Aptitude}{A.}{Arthur}{A.}{}{}{}{}}% + } + \name{author}{1}{% + {{Aptitude}{A.}{Arthur}{A.}{}{}{}{}}% + } + \name{editor}{1}{% + {{Monkley}{M.}{Mark}{M.}{}{}{}{}}% + } + \list{publisher}{1}{% + {Rancour}% + } + \strng{namehash}{AA1} + \strng{fullhash}{AA1} + \field{sortinit}{A} + \field{labelyear}{1996} + \field{booktitle}{Beasts of the Burbling Burns} + \strng{crossref}{crt} + \field{eprinttype}{sometype} + \field{origyear}{1934} + \field{title}{Arrangements of All Articles} + \field{year}{1996} + \warn{\item Field 'archiveprefix' is aliased to field 'eprinttype' but both are defined in entry with key 'cr3' - skipping field 'archiveprefix'} + \endentry + +|; + +# cited as normal +my $crt = q| \entry{crt}{book}{} + \name{editor}{1}{% + {{Monkley}{M.}{Mark}{M.}{}{}{}{}}% + } + \list{publisher}{1}{% + {Rancour}% + } + \strng{namehash}{1} + \strng{fullhash}{1} + \field{sortinit}{B} + \field{labelyear}{1996} + \field{title}{Beasts of the Burbling Burns} + \field{year}{1996} + \endentry + +|; + +# various event fields inherited correctly +my $cr6 = q| \entry{cr6}{inproceedings}{} + \name{labelname}{1}{% + {{Author}{A.}{Firstname}{F.}{}{}{}{}}% + } + \name{author}{1}{% + {{Author}{A.}{Firstname}{F.}{}{}{}{}}% + } + \name{editor}{1}{% + {{Editor}{E.}{}{}{}{}{}{}}% + } + \list{location}{1}{% + {Address}% + } + \strng{namehash}{AF1} + \strng{fullhash}{AF1} + \field{sortinit}{A} + \field{labelyear}{2009} + \field{booktitle}{Manual booktitle} + \field{eventday}{21} + \field{eventendday}{24} + \field{eventendmonth}{08} + \field{eventendyear}{2009} + \field{eventmonth}{08} + \field{eventtitle}{Title of the event} + \field{eventyear}{2009} + \field{title}{Title of inproceeding} + \field{venue}{Location of event} + \field{year}{2009} + \field{pages}{123\bibrangedash} + \endentry + +|; + +# Special fields inherited correctly +my $cr7 = q| \entry{cr7}{inbook}{} + \name{labelname}{1}{% + {{Author}{A.}{Firstname}{F.}{}{}{}{}}% + } + \name{author}{1}{% + {{Author}{A.}{Firstname}{F.}{}{}{}{}}% + } + \name{bookauthor}{1}{% + {{Bookauthor}{B.}{Brian}{B.}{}{}{}{}}% + } + \list{publisher}{1}{% + {Publisher of proceeding}% + } + \strng{namehash}{AF1} + \strng{fullhash}{AF1} + \field{sortinit}{A} + \field{labelyear}{2010} + \field{booksubtitle}{Book Subtitle} + \field{booktitle}{Book Title} + \field{booktitleaddon}{Book Titleaddon} + \field{title}{Title of Book bit} + \field{year}{2010} + \field{pages}{123\bibrangedash 126} + \verb{verbb} + \verb String + \endverb + \endentry + +|; + +# Default inheritance supressed except for specified +my $cr8 = q| \entry{cr8}{incollection}{} + \name{labelname}{1}{% + {{Smith}{S.}{Firstname}{F.}{}{}{}{}}% + } + \name{author}{1}{% + {{Smith}{S.}{Firstname}{F.}{}{}{}{}}% + } + \strng{namehash}{SF1} + \strng{fullhash}{SF1} + \field{sortinit}{S} + \field{labelyear}{2010} + \field{booktitle}{Book Title} + \field{title}{Title of Collection bit} + \field{year}{2010} + \field{pages}{1\bibrangedash 12} + \endentry + +|; + +# xref field is included as the parent is included by being crossrefed >= mincrossrefs times +my $xr1 = q| \entry{xr1}{inbook}{} + \name{labelname}{1}{% + {{Zentrum}{Z.}{Zoe}{Z.}{}{}{}{}}% + } + \name{author}{1}{% + {{Zentrum}{Z.}{Zoe}{Z.}{}{}{}{}}% + } + \strng{namehash}{ZZ1} + \strng{fullhash}{ZZ1} + \field{sortinit}{Z} + \field{origyear}{1921} + \field{title}{Moods Mildly Modified} + \strng{xref}{xrm} + \endentry + +|; + +# xref field is included as the parent is included by being crossrefed >= mincrossrefs times +my $xr2 = q| \entry{xr2}{inbook}{} + \name{labelname}{1}{% + {{Instant}{I.}{Ian}{I.}{}{}{}{}}% + } + \name{author}{1}{% + {{Instant}{I.}{Ian}{I.}{}{}{}{}}% + } + \strng{namehash}{II1} + \strng{fullhash}{II1} + \field{sortinit}{I} + \field{origyear}{1926} + \field{title}{Migraines Multiplying Madly} + \strng{xref}{xrm} + \endentry + +|; + +# This is included as it is crossrefed >= mincrossrefs times +# Notice lack of labelname and hashes because the only name is EDITOR and useeditor is false +my $xrm = q| \entry{xrm}{book}{} + \name{editor}{1}{% + {{Prendergast}{P.}{Peter}{P.}{}{}{}{}}% + } + \list{publisher}{1}{% + {Mainstream}% + } + \strng{namehash}{1} + \strng{fullhash}{1} + \field{sortinit}{C} + \field{labelyear}{1970} + \field{title}{Calligraphy, Calisthenics, Culture} + \field{year}{1970} + \endentry + +|; + +# xref field is included as the parent is cited +my $xr3 = q| \entry{xr3}{inbook}{} + \name{labelname}{1}{% + {{Normal}{N.}{Norman}{N.}{}{}{}{}}% + } + \name{author}{1}{% + {{Normal}{N.}{Norman}{N.}{}{}{}{}}% + } + \strng{namehash}{NN1} + \strng{fullhash}{NN1} + \field{sortinit}{N} + \field{origyear}{1923} + \field{title}{Russion Regalia Revisited} + \strng{xref}{xrt} + \endentry + +|; + +# cited as normal +my $xrt = q| \entry{xrt}{book}{} + \name{editor}{1}{% + {{Lunders}{L.}{Lucy}{L.}{}{}{}{}}% + } + \list{publisher}{1}{% + {Middling}% + } + \strng{namehash}{1} + \strng{fullhash}{1} + \field{sortinit}{K} + \field{labelyear}{1977} + \field{title}{Kings, Cork and Calculation} + \field{year}{1977} + \endentry + +|; + +# No crossref field as parent is not cited (mincrossrefs < 2) +my $cr4 = q| \entry{cr4}{inbook}{} + \name{labelname}{1}{% + {{Mumble}{M.}{Morris}{M.}{}{}{}{}}% + } + \name{author}{1}{% + {{Mumble}{M.}{Morris}{M.}{}{}{}{}}% + } + \name{editor}{1}{% + {{Jermain}{J.}{Jeremy}{J.}{}{}{}{}}% + } + \list{publisher}{1}{% + {Pillsbury}% + } + \strng{namehash}{MM1} + \strng{fullhash}{MM1} + \field{sortinit}{M} + \field{labelyear}{1945} + \field{booktitle}{Vanquished, Victor, Vandal} + \field{origyear}{1911} + \field{title}{Enterprising Entities} + \field{year}{1945} + \endentry + +|; + +# No crossref field as parent is not cited (mincrossrefs < 2) +my $xr4 = q| \entry{xr4}{inbook}{} + \name{labelname}{1}{% + {{Mistrel}{M.}{Megan}{M.}{}{}{}{}}% + } + \name{author}{1}{% + {{Mistrel}{M.}{Megan}{M.}{}{}{}{}}% + } + \strng{namehash}{MM2} + \strng{fullhash}{MM2} + \field{sortinit}{M} + \field{origyear}{1933} + \field{title}{Lumbering Lunatics} + \endentry + +|; + +# Missing keys in xref/crossref should be deleted during datasource parse +# So these two should have no xref/crossref data in them +my $mxr = q| \entry{mxr}{inbook}{} + \name{labelname}{1}{% + {{Mistrel}{M.}{Megan}{M.}{}{}{}{}}% + } + \name{author}{1}{% + {{Mistrel}{M.}{Megan}{M.}{}{}{}{}}% + } + \strng{namehash}{MM2} + \strng{fullhash}{MM2} + \field{sortinit}{M} + \field{origyear}{1933} + \field{title}{Lumbering Lunatics} + \endentry + +|; + +my $mcr = q| \entry{mcr}{inbook}{} + \name{labelname}{1}{% + {{Mistrel}{M.}{Megan}{M.}{}{}{}{}}% + } + \name{author}{1}{% + {{Mistrel}{M.}{Megan}{M.}{}{}{}{}}% + } + \strng{namehash}{MM2} + \strng{fullhash}{MM2} + \field{sortinit}{M} + \field{origyear}{1933} + \field{title}{Lumbering Lunatics} + \endentry + +|; + + +is($out->get_output_entry($main0,'cr1'), $cr1, 'crossref test 1'); +is($out->get_output_entry($main0,'cr2'), $cr2, 'crossref test 2'); +is($out->get_output_entry($main0,'crm'), $crm, 'crossref test 3'); +is($out->get_output_entry($main0,'cr3'), $cr3, 'crossref test 4'); +is($out->get_output_entry($main0,'crt'), $crt, 'crossref test 5'); +is($out->get_output_entry($main0,'cr4'), $cr4, 'crossref test 6'); +is($section0->has_citekey('crn'), 0,'crossref test 7'); +is($out->get_output_entry($main0,'cr6'), $cr6, 'crossref test (inheritance) 8'); +is($out->get_output_entry($main0,'cr7'), $cr7, 'crossref test (inheritance) 9'); +is($out->get_output_entry($main0,'cr8'), $cr8, 'crossref test (inheritance) 10'); +is($out->get_output_entry($main0,'xr1'), $xr1, 'xref test 1'); +is($out->get_output_entry($main0,'xr2'), $xr2, 'xref test 2'); +is($out->get_output_entry($main0,'xrm'), $xrm, 'xref test 3'); +is($out->get_output_entry($main0,'xr3'), $xr3, 'xref test 4'); +is($out->get_output_entry($main0,'xrt'), $xrt, 'xref test 5'); +is($out->get_output_entry($main0,'xr4'), $xr4, 'xref test 6'); +is($section0->has_citekey('xrn'), 0,'xref test 7'); +is($out->get_output_entry($main0,'mxr'), $mxr, 'missing xref test'); +is($out->get_output_entry($main0,'mcr'), $mcr, 'missing crossef test'); +is($section1->has_citekey('crn'), 0,'mincrossrefs reset between sections'); + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/18-bibtex-aliases.t b/Master/texmf-dist/source/bibtex/biber/t/18-bibtex-aliases.t new file mode 100755 index 00000000000..38b3f0230fb --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/18-bibtex-aliases.t @@ -0,0 +1,45 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 7; + +use Biber; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata") ; + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('bibtex-aliases.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests + +# Biber options +Biber::Config->setoption('fastsort', 1); +Biber::Config->setoption('validate_structure', 1); + +# Now generate the information +$biber->prepare; + +my $section = $biber->sections->get_section(0); +my $bibentries = $section->bibentries; + +my $w1 = ["Field 'school' is aliased to field 'institution' but both are defined in entry with key 'alias2' - skipping field 'school'", + "Entry 'alias2' - invalid entry type 'thing' - defaulting to 'misc'", + "Entry 'alias2' - invalid field 'institution' for entrytype 'misc'" +]; + +is($bibentries->entry('alias1')->get_field('entrytype'), 'thesis', 'Alias - 1' ); +is($bibentries->entry('alias1')->get_field('type'), 'phdthesis', 'Alias - 2' ); +is_deeply($bibentries->entry('alias1')->get_field('location'), ['Ivory Towers'], 'Alias - 3' ); +is($bibentries->entry('alias1')->get_field('address'), undef, 'Alias - 4' ); +is($bibentries->entry('alias2')->get_field('entrytype'), 'misc', 'Alias - 5' ); +is_deeply($bibentries->entry('alias2')->get_field('warnings'), $w1, 'Alias - 6' ) ; +is($bibentries->entry('alias2')->get_field('school'), undef, 'Alias - 7' ); + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/18-structure-constraints.t b/Master/texmf-dist/source/bibtex/biber/t/18-structure-constraints.t new file mode 100755 index 00000000000..a98a95cab8e --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/18-structure-constraints.t @@ -0,0 +1,68 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 14; + +use Biber; +use Biber::Output::BBL; +use Biber::Utils; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata") ; + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('structure-constraints.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests + +# Biber options +Biber::Config->setoption('fastsort', 1); +Biber::Config->setoption('validate_structure', 1); + +# Now generate the information +$biber->prepare; + +my $section = $biber->sections->get_section(0); +my $bibentries = $section->bibentries; + +my $c1 = [ "Entry 'c1' - invalid entry type 'badtype' - defaulting to 'misc'" ]; +my $c2 = [ "Entry 'c2' - invalid field 'badfield' for entrytype 'eta'", + "Entry 'c2' - invalid field 'journaltitle' for entrytype 'eta'", + "Missing mandatory field 'author' in entry 'c2'" ]; +my $c3 = [ "Invalid format (integer) of field 'month' - ignoring field in entry 'c3'" ]; +my $c4 = [ "Invalid value of field 'month' must be '<=12' - ignoring field in entry 'c4'", + "Invalid value of field 'field1' must be '>=5' - ignoring field in entry 'c4'" ]; +# There would also have been a date+year constraint violation in the next test if +# it weren't for the fact that the date processing in bibtex.pm already deals with this +# and removed the year field +my $c5 = [ "Overwriting field 'year' with year value from field 'date' for entry 'c5'", + "Constraint violation - none of fields (field5, field6) must exist when all of fields (field2, field3, field4) exist. Ignoring them." ]; +my $c6 = [ "Constraint violation - one of fields (field7, field8) must exist when all of fields (field1, field2) exist", + "Constraint violation - all of fields (field9, field10) must exist when all of fields (field5, field6) exist" ]; +my $c7 = [ "Missing mandatory field - one of 'fielda, fieldb' must be defined in entry 'c7'", + "Constraint violation - none of fields (field7) must exist when one of fields (field5, field6) exist. Ignoring them."]; +my $c8 = [ "Constraint violation - none of fields (field4) must exist when none of fields (field2, field3) exist. Ignoring them.", + "Constraint violation - one of fields (field10, field11) must exist when none of fields (field8, field9) exist", + "Constraint violation - all of fields (field12, field13) must exist when none of fields (field6) exist" ]; + +is_deeply($bibentries->entry('c1')->get_field('warnings'), $c1, 'Constraints test 1' ); +is_deeply($bibentries->entry('c2')->get_field('warnings'), $c2, 'Constraints test 2' ); +is_deeply($bibentries->entry('c3')->get_field('warnings'), $c3, 'Constraints test 3a' ); +ok(is_undef($bibentries->entry('c3')->get_field('month')), 'Constraints test 3b' ); +is_deeply($bibentries->entry('c4')->get_field('warnings'), $c4, 'Constraints test 4a' ); +ok(is_undef($bibentries->entry('c4')->get_field('month')), 'Constraints test 4b' ); +is_deeply($bibentries->entry('c5')->get_field('warnings'), $c5, 'Constraints test 5a' ); +ok(is_undef($bibentries->entry('c5')->get_field('field5')), 'Constraints test 5b' ); +ok(is_undef($bibentries->entry('c5')->get_field('field6')), 'Constraints test 5c' ); +is_deeply($bibentries->entry('c6')->get_field('warnings'), $c6, 'Constraints test 6' ); +is_deeply($bibentries->entry('c7')->get_field('warnings'), $c7, 'Constraints test 7a' ); +ok(is_undef($bibentries->entry('c7')->get_field('field7')), 'Constraints test 7b' ); +is_deeply($bibentries->entry('c8')->get_field('warnings'), $c8, 'Constraints test 8a' ); +ok(is_undef($bibentries->entry('c8')->get_field('field4')), 'Constraints test 8b' ); + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/18-structure-dateformats.t b/Master/texmf-dist/source/bibtex/biber/t/18-structure-dateformats.t new file mode 100755 index 00000000000..1d4e425de45 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/18-structure-dateformats.t @@ -0,0 +1,328 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 31; + +use Biber; +use Biber::Output::BBL; +use Biber::Utils; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata"); + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('structure-dateformats.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests + +# Biber options +Biber::Config->setoption('fastsort', 1); +Biber::Config->setoption('sortlocale', 'C'); +Biber::Config->setoption('validate_structure', 1); + +# Biblatex options +Biber::Config->setblxoption('labelyearspec', [ 'year' ]); + +# Now generate the information +$biber->prepare; +my $out = $biber->get_output_obj; +my $section = $biber->sections->get_section(0); +my $main = $section->get_list('MAIN'); +my $bibentries = $section->bibentries; +my $l1 = [ "Invalid format '1985-1030' of date field 'origdate' in entry 'L1' - ignoring", + "Invalid format '1.5.1998' of date field 'urldate' in entry 'L1' - ignoring", + "Invalid date value 'YYYY/14/DD' - ignoring its components in entry 'L1'" ]; +my $l2 = [ "Invalid format '1995-1230' of date field 'origdate' in entry 'L2' - ignoring" ]; +my $l3 = [ "Invalid format '1.5.1988' of date field 'urldate' in entry 'L3' - ignoring" ]; +my $l4 = [ "Invalid format '1995-1-04' of date field 'date' in entry 'L4' - ignoring", + "Missing mandatory field - one of 'date, year' must be defined in entry 'L4'" ]; +my $l5 = [ "Invalid format '1995-10-4' of date field 'date' in entry 'L5' - ignoring", + "Missing mandatory field - one of 'date, year' must be defined in entry 'L5'" ]; +my $l6 = [ "Invalid date value '1996/13/03' - ignoring its components in entry 'L6'" ]; +my $l7 = [ "Invalid date value '1996/10/35' - ignoring its components in entry 'L7'" ]; +my $l11 = [ "Overwriting field 'year' with year value from field 'date' for entry 'L11'"]; +my $l12 = [ "Overwriting field 'month' with month value from field 'date' for entry 'L12'" ]; + +my $l13c = q| \entry{L13}{book}{} + \name{labelname}{2}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + {{Abrahams}{A.}{Albert}{A.}{}{}{}{}}% + } + \name{author}{2}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + {{Abrahams}{A.}{Albert}{A.}{}{}{}{}}% + } + \list{publisher}{1}{% + {Oxford}% + } + \strng{namehash}{DJAA1} + \strng{fullhash}{DJAA1} + \field{sortinit}{D} + \field{extrayear}{3} + \field{labelyear}{1996} + \field{day}{01} + \field{endyear}{} + \field{month}{01} + \field{title}{Title 2} + \field{year}{1996} + \endentry + +|; + +my $l14 = q| \entry{L14}{book}{} + \name{labelname}{2}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + {{Abrahams}{A.}{Albert}{A.}{}{}{}{}}% + } + \name{author}{2}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + {{Abrahams}{A.}{Albert}{A.}{}{}{}{}}% + } + \list{publisher}{1}{% + {Oxford}% + } + \strng{namehash}{DJAA1} + \strng{fullhash}{DJAA1} + \field{sortinit}{D} + \field{extrayear}{4} + \field{labelyear}{1996} + \field{day}{10} + \field{endday}{12} + \field{endmonth}{12} + \field{endyear}{1996} + \field{month}{12} + \field{title}{Title 2} + \field{year}{1996} + \endentry + +|; + +my $l15 = q| \entry{L15}{book}{} + \name{labelname}{2}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + {{Abrahams}{A.}{Albert}{A.}{}{}{}{}}% + } + \name{author}{2}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + {{Abrahams}{A.}{Albert}{A.}{}{}{}{}}% + } + \list{publisher}{1}{% + {Oxford}% + } + \strng{namehash}{DJAA1} + \strng{fullhash}{DJAA1} + \field{sortinit}{D} + \field{title}{Title 2} + \warn{\item Missing mandatory field - one of 'date, year' must be defined in entry 'L15'} + \endentry + +|; + +my $l16 = q| \entry{L16}{proceedings}{} + \name{labelname}{2}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + {{Abrahams}{A.}{Albert}{A.}{}{}{}{}}% + } + \name{editor}{2}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + {{Abrahams}{A.}{Albert}{A.}{}{}{}{}}% + } + \list{publisher}{1}{% + {Oxford}% + } + \strng{namehash}{DJAA1} + \strng{fullhash}{DJAA1} + \field{sortinit}{D} + \field{extrayear}{6} + \field{labelyear}{1996} + \field{eventday}{01} + \field{eventmonth}{01} + \field{eventyear}{1996} + \field{title}{Title 2} + \warn{\item Missing mandatory field - one of 'date, year' must be defined in entry 'L16'} + \endentry + +|; + +my $l17 = q| \entry{L17}{proceedings}{} + \name{labelname}{2}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + {{Abrahams}{A.}{Albert}{A.}{}{}{}{}}% + } + \name{editor}{2}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + {{Abrahams}{A.}{Albert}{A.}{}{}{}{}}% + } + \list{publisher}{1}{% + {Oxford}% + } + \strng{namehash}{DJAA1} + \strng{fullhash}{DJAA1} + \field{sortinit}{D} + \field{extrayear}{5} + \field{labelyear}{1996} + \field{day}{10} + \field{endday}{12} + \field{endmonth}{12} + \field{endyear}{1996} + \field{eventday}{10} + \field{eventendday}{12} + \field{eventendmonth}{12} + \field{eventendyear}{2004} + \field{eventmonth}{12} + \field{eventyear}{1998} + \field{month}{12} + \field{origday}{10} + \field{origendday}{12} + \field{origendmonth}{12} + \field{origendyear}{1998} + \field{origmonth}{12} + \field{origyear}{1998} + \field{title}{Title 2} + \field{year}{1996} + \endentry + +|; + +my $l17c = q| \entry{L17}{proceedings}{} + \name{labelname}{2}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + {{Abrahams}{A.}{Albert}{A.}{}{}{}{}}% + } + \name{editor}{2}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + {{Abrahams}{A.}{Albert}{A.}{}{}{}{}}% + } + \list{publisher}{1}{% + {Oxford}% + } + \strng{namehash}{DJAA1} + \strng{fullhash}{DJAA1} + \field{sortinit}{D} + \field{labelyear}{1998} + \field{day}{10} + \field{endday}{12} + \field{endmonth}{12} + \field{endyear}{1996} + \field{eventday}{10} + \field{eventendday}{12} + \field{eventendmonth}{12} + \field{eventendyear}{2004} + \field{eventmonth}{12} + \field{eventyear}{1998} + \field{month}{12} + \field{origday}{10} + \field{origendday}{12} + \field{origendmonth}{12} + \field{origendyear}{1998} + \field{origmonth}{12} + \field{origyear}{1998} + \field{title}{Title 2} + \field{year}{1996} + \endentry + +|; + +my $l17e = q| \entry{L17}{proceedings}{} + \name{labelname}{2}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + {{Abrahams}{A.}{Albert}{A.}{}{}{}{}}% + } + \name{editor}{2}{% + {{Doe}{D.}{John}{J.}{}{}{}{}}% + {{Abrahams}{A.}{Albert}{A.}{}{}{}{}}% + } + \list{publisher}{1}{% + {Oxford}% + } + \strng{namehash}{DJAA1} + \strng{fullhash}{DJAA1} + \field{sortinit}{D} + \field{labelyear}{1998\bibdatedash 2004} + \field{day}{10} + \field{endday}{12} + \field{endmonth}{12} + \field{endyear}{1996} + \field{eventday}{10} + \field{eventendday}{12} + \field{eventendmonth}{12} + \field{eventendyear}{2004} + \field{eventmonth}{12} + \field{eventyear}{1998} + \field{month}{12} + \field{origday}{10} + \field{origendday}{12} + \field{origendmonth}{12} + \field{origendyear}{1998} + \field{origmonth}{12} + \field{origyear}{1998} + \field{title}{Title 2} + \field{year}{1996} + \endentry + +|; + +is_deeply($bibentries->entry('l1')->get_field('warnings'), $l1, 'Date values test 1' ) ; +ok(is_undef($bibentries->entry('l1')->get_field('origyear')), 'Date values test 1a - ORIGYEAR undef since ORIGDATE is bad' ) ; +ok(is_undef($bibentries->entry('l1')->get_field('urlyear')), 'Date values test 1b - URLYEAR undef since URLDATE is bad' ) ; +ok(is_undef($bibentries->entry('l1')->get_field('month')), 'Date values test 1c - MONTH undef since not integer' ) ; +is_deeply($bibentries->entry('l2')->get_field('warnings'), $l2, 'Date values test 2' ) ; +is_deeply($bibentries->entry('l3')->get_field('warnings'), $l3, 'Date values test 3' ) ; +is_deeply($bibentries->entry('l4')->get_field('warnings'), $l4, 'Date values test 4' ) ; +is_deeply($bibentries->entry('l5')->get_field('warnings'), $l5, 'Date values test 5' ) ; +is_deeply($bibentries->entry('l6')->get_field('warnings'), $l6, 'Date values test 6' ) ; +is_deeply($bibentries->entry('l7')->get_field('warnings'), $l7, 'Date values test 7' ) ; +is($bibentries->entry('l8')->get_field('month'), '01', 'Date values test 8b - MONTH hacked to integer' ) ; +ok(is_undef($bibentries->entry('l9')->get_field('warnings')), 'Date values test 9' ) ; +ok(is_undef($bibentries->entry('l10')->get_field('warnings')), 'Date values test 10' ) ; +is_deeply($bibentries->entry('l11')->get_field('warnings'), $l11, 'Date values test 11' ); +is($bibentries->entry('l11')->get_field('year'), '1996', 'Date values test 11a - DATE overrides YEAR' ) ; +is_deeply($bibentries->entry('l12')->get_field('warnings'), $l12, 'Date values test 12' ); +is($bibentries->entry('l12')->get_field('month'), '01', 'Date values test 12a - DATE overrides MONTH' ) ; +# it means something if endyear is defined but null ("1935-") +ok(is_def_and_null($bibentries->entry('l13')->get_field('endyear')), 'Date values test 13 - range with no end' ) ; +ok(is_undef($bibentries->entry('l13')->get_field('endmonth')), 'Date values test 13a - ENDMONTH undef for open-ended range' ) ; +ok(is_undef($bibentries->entry('l13')->get_field('endday')), 'Date values test 13b - ENDDAY undef for open-ended range' ) ; +is( $out->get_output_entry($main,'l13'), $l13c, 'Date values test 13c - labelyear open-ended range' ) ; +is( $out->get_output_entry($main,'l14'), $l14, 'Date values test 14 - labelyear same as YEAR when ENDYEAR == YEAR') ; +is( $out->get_output_entry($main,'l15'), $l15, 'Date values test 15 - labelyear should be undef, no DATE or YEAR') ; + +# reset options and regenerate information +Biber::Config->setblxoption('labelyearspec', [ 'year', 'eventyear', 'origyear' ]); +$bibentries->entry('l17')->del_field('year'); +$bibentries->entry('l17')->del_field('month'); +$bibentries->entry('l16')->del_field('warnings'); +$biber->prepare; +$out = $biber->get_output_obj; + +is($bibentries->entry('l16')->get_field('labelyearname'), 'eventyear', 'Date values test 16 - labelyearname = eventyear when YEAR is (mistakenly) missing' ) ; +is($out->get_output_entry($main,'l16'), $l16, 'Date values test 16a - labelyear = EVENTYEAR value when YEAR is (mistakenly) missing' ); +is($bibentries->entry('l17')->get_field('labelyearname'), 'year', 'Date values test 17 - labelyearname = YEAR' ) ; +is($out->get_output_entry($main,'l17'), $l17, 'Date values test 17a - labelyear = YEAR value when ENDYEAR is the same and ORIGYEAR is also present' ) ; + +# reset options and regenerate information +Biber::Config->setblxoption('labelyearspec', [ 'origyear', 'year', 'eventyear' ]); +$bibentries->entry('l17')->del_field('year'); +$bibentries->entry('l17')->del_field('month'); +$biber->prepare; +$out = $biber->get_output_obj; + +is($bibentries->entry('l17')->get_field('labelyearname'), 'origyear', 'Date values test 17b - labelyearname = ORIGYEAR' ) ; +is($out->get_output_entry($main,'l17'), $l17c, 'Date values test 17c - labelyear = ORIGYEAR value when ENDORIGYEAR is the same and YEAR is also present' ) ; + +# reset options and regenerate information +Biber::Config->setblxoption('labelyearspec', [ 'eventyear', 'year', 'origyear' ], 'PER_TYPE', 'proceedings'); +$bibentries->entry('l17')->del_field('year'); +$bibentries->entry('l17')->del_field('month'); +$biber->prepare; +$out = $biber->get_output_obj; + +is($bibentries->entry('l17')->get_field('labelyearname'), 'eventyear', 'Date values test 17d - labelyearname = EVENTYEAR' ) ; +is($out->get_output_entry($main,'l17'), $l17e, 'Date values test 17e - labelyear = ORIGYEAR-ORIGENDYEAR' ) ; + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/19-related-entries.t b/Master/texmf-dist/source/bibtex/biber/t/19-related-entries.t new file mode 100755 index 00000000000..6c0d312f8ed --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/19-related-entries.t @@ -0,0 +1,223 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 9; + +use Biber; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata") ; + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('related.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests + +# Biber options +Biber::Config->setoption('fastsort', 1); + +# Now generate the information +$biber->prepare; +my $out = $biber->get_output_obj; +my $section = $biber->sections->get_section(0); +my $shs = $section->get_list('SHORTHANDS'); +my $main = $section->get_list('MAIN'); +my $bibentries = $section->bibentries; + +my $k1 = q| \entry{key1}{article}{} + \name{labelname}{1}{% + {{Author}{A.}{}{}{}{}{}{}}% + } + \name{author}{1}{% + {{Author}{A.}{}{}{}{}{}{}}% + } + \strng{namehash}{A1} + \strng{fullhash}{A1} + \field{sortinit}{0} + \field{labelyear}{1998} + \field{journaltitle}{Journal Title} + \field{number}{5} + \field{related}{78f825aaa0103319aaa1a30bf4fe3ada,3631578538a2d6ba5879b31a9a42f290,caf8e34be07426ae7127c1b4829983c1} + \field{relatedtype}{reprintas} + \field{shorthand}{RK1} + \field{title}{Original Title} + \field{volume}{12} + \field{year}{1998} + \field{pages}{125\bibrangedash 150} + \endentry + +|; + +my $k2 = q| \entry{key2}{inbook}{} + \name{labelname}{1}{% + {{Author}{A.}{}{}{}{}{}{}}% + } + \name{author}{1}{% + {{Author}{A.}{}{}{}{}{}{}}% + } + \list{location}{1}{% + {Location}% + } + \list{publisher}{1}{% + {Publisher}% + } + \strng{namehash}{A1} + \strng{fullhash}{A1} + \field{sortinit}{0} + \field{labelyear}{2009} + \field{booktitle}{Booktitle} + \field{related}{c2add694bf942dc77b376592d9c862cd} + \field{relatedstring}{First} + \field{relatedtype}{reprintof} + \field{shorthand}{RK2} + \field{title}{Reprint Title} + \field{year}{2009} + \field{pages}{34\bibrangedash 60} + \endentry + +|; + +my $k3 = q| \entry{key3}{inbook}{} + \name{labelname}{1}{% + {{Author}{A.}{}{}{}{}{}{}}% + } + \name{author}{1}{% + {{Author}{A.}{}{}{}{}{}{}}% + } + \list{location}{1}{% + {Location}% + } + \list{publisher}{1}{% + {Publisher2}% + } + \strng{namehash}{A1} + \strng{fullhash}{A1} + \field{sortinit}{0} + \field{labelyear}{2010} + \field{booktitle}{Booktitle} + \field{related}{c2add694bf942dc77b376592d9c862cd} + \field{relatedstring}{Second} + \field{relatedtype}{reprintof} + \field{shorthand}{RK3} + \field{title}{Reprint Title} + \field{year}{2010} + \field{pages}{33\bibrangedash 57} + \endentry + +|; + +my $kck1 = q| \entry{c2add694bf942dc77b376592d9c862cd}{article}{dataonly} + \name{labelname}{1}{% + {{Author}{A.}{}{}{}{}{}{}}% + } + \name{author}{1}{% + {{Author}{A.}{}{}{}{}{}{}}% + } + \strng{namehash}{A1} + \strng{fullhash}{A1} + \field{sortinit}{0} + \field{journaltitle}{Journal Title} + \field{number}{5} + \field{shorthand}{RK1} + \field{title}{Original Title} + \field{volume}{12} + \field{year}{1998} + \field{pages}{125\bibrangedash 150} + \endentry + +|; + +my $kck2 = q| \entry{78f825aaa0103319aaa1a30bf4fe3ada}{inbook}{dataonly} + \name{labelname}{1}{% + {{Author}{A.}{}{}{}{}{}{}}% + } + \name{author}{1}{% + {{Author}{A.}{}{}{}{}{}{}}% + } + \list{location}{1}{% + {Location}% + } + \list{publisher}{1}{% + {Publisher}% + } + \strng{namehash}{A1} + \strng{fullhash}{A1} + \field{sortinit}{0} + \field{booktitle}{Booktitle} + \field{shorthand}{RK2} + \field{title}{Reprint Title} + \field{year}{2009} + \field{pages}{34\bibrangedash 60} + \endentry + +|; + +my $kck3 = q| \entry{3631578538a2d6ba5879b31a9a42f290}{inbook}{dataonly} + \name{labelname}{1}{% + {{Author}{A.}{}{}{}{}{}{}}% + } + \name{author}{1}{% + {{Author}{A.}{}{}{}{}{}{}}% + } + \list{location}{1}{% + {Location}% + } + \list{publisher}{1}{% + {Publisher2}% + } + \strng{namehash}{A1} + \strng{fullhash}{A1} + \field{sortinit}{0} + \field{booktitle}{Booktitle} + \field{shorthand}{RK3} + \field{title}{Reprint Title} + \field{year}{2010} + \field{pages}{33\bibrangedash 57} + \endentry + +|; + +my $kck4 = q| \entry{caf8e34be07426ae7127c1b4829983c1}{inbook}{dataonly} + \name{labelname}{1}{% + {{Author}{A.}{}{}{}{}{}{}}% + } + \name{author}{1}{% + {{Author}{A.}{}{}{}{}{}{}}% + } + \list{location}{1}{% + {Location}% + } + \list{publisher}{1}{% + {Publisher2}% + } + \strng{namehash}{A1} + \strng{fullhash}{A1} + \field{sortinit}{0} + \field{booktitle}{Booktitle} + \field{shorthand}{RK4} + \field{title}{Reprint Title} + \field{year}{2011} + \field{pages}{33\bibrangedash 57} + \endentry + +|; + +is( $out->get_output_entry($main,'key1'), $k1, 'Related entry test 1' ) ; +is( $out->get_output_entry($main,'key2'), $k2, 'Related entry test 2' ) ; +is( $out->get_output_entry($main,'key3'), $k3, 'Related entry test 3' ) ; +is( $out->get_output_entry($main,'c2add694bf942dc77b376592d9c862cd'), $kck1, 'Related entry test 4' ) ; +is( $out->get_output_entry($main,'78f825aaa0103319aaa1a30bf4fe3ada'), $kck2, 'Related entry test 5' ) ; +is( $out->get_output_entry($main,'3631578538a2d6ba5879b31a9a42f290'), $kck3, 'Related entry test 6' ) ; +is( $out->get_output_entry($main,'caf8e34be07426ae7127c1b4829983c1'), $kck4, 'Related entry test 7' ) ; +# Key k4 is used only to create a related entry clone but since it isn't cited itself +# it shouldn't be in the .bbl +is( $out->get_output_entry($main,'key4'), undef, 'Related entry test 8' ) ; +is_deeply([$shs->get_keys], ['key1', 'key2', 'key3'], 'Related entry test 9'); + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/20-sortlists.t b/Master/texmf-dist/source/bibtex/biber/t/20-sortlists.t new file mode 100755 index 00000000000..cbf9bc63a5c --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/20-sortlists.t @@ -0,0 +1,38 @@ +use strict; +use warnings; +use utf8; +no warnings 'utf8'; + +use Test::More tests => 8; + +use Biber; +use Biber::Output::BBL; +use Log::Log4perl qw(:easy); +Log::Log4perl->easy_init($ERROR); +chdir("t/tdata") ; +my $S; + +# Set up Biber object +my $biber = Biber->new(noconf => 1); +$biber->parse_ctrlfile('sortlists.bcf'); +$biber->set_output_obj(Biber::Output::BBL->new()); + +# Options - we could set these in the control file but it's nice to see what we're +# relying on here for tests +Biber::Config->setoption('fastsort', 1); + +# (re)generate informtion based on option settings +$biber->prepare; +my $section = $biber->sections->get_section(0); +my $out = $biber->get_output_obj; + +is_deeply([$section->get_list('lname')->get_keys], ['K1', 'K2', 'K4', 'K3'], 'List - name order'); +is_deeply([$section->get_list('lyear')->get_keys], ['K4', 'K1', 'K2', 'K3'], 'List - year order'); +is_deeply([$section->get_list('ltitle')->get_keys], ['K1', 'K4', 'K2', 'K3'], 'List - title order'); +is_deeply([$section->get_list('lnamef1')->get_keys], ['K2', 'K4'], 'List - name order (filtered) - 1'); +is_deeply([$section->get_list('lnamef2')->get_keys], ['K4'], 'List - name order (filtered) - 2'); +is_deeply([$section->get_list('lnamef3')->get_keys], ['K1', 'K2'], 'List - name order (filtered) - 3'); +is_deeply([$section->get_list('lnamef4')->get_keys], ['K3'], 'List - name order (filtered) - 4'); +is_deeply([$section->get_list('lnamef5')->get_keys], ['K1', 'K3'], 'List - name order (filtered) - 5'); + +unlink <*.utf8>; diff --git a/Master/texmf-dist/source/bibtex/biber/t/pod-coverage.t b/Master/texmf-dist/source/bibtex/biber/t/pod-coverage.t new file mode 100755 index 00000000000..fc40a57c2a4 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/pod-coverage.t @@ -0,0 +1,18 @@ +use strict; +use warnings; +use Test::More; + +# Ensure a recent version of Test::Pod::Coverage +my $min_tpc = 1.08; +eval "use Test::Pod::Coverage $min_tpc"; +plan skip_all => "Test::Pod::Coverage $min_tpc required for testing POD coverage" + if $@; + +# Test::Pod::Coverage doesn't require a minimum Pod::Coverage version, +# but older versions don't recognize some common documentation styles +my $min_pc = 0.18; +eval "use Pod::Coverage $min_pc"; +plan skip_all => "Pod::Coverage $min_pc required for testing POD coverage" + if $@; + +all_pod_coverage_ok(); diff --git a/Master/texmf-dist/source/bibtex/biber/t/pod.t b/Master/texmf-dist/source/bibtex/biber/t/pod.t new file mode 100755 index 00000000000..ee8b18ade66 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/pod.t @@ -0,0 +1,12 @@ +#!perl -T + +use strict; +use warnings; +use Test::More; + +# Ensure a recent version of Test::Pod +my $min_tp = 1.22; +eval "use Test::Pod $min_tp"; +plan skip_all => "Test::Pod $min_tp required for testing POD" if $@; + +all_pod_files_ok(); diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/biber2.conf b/Master/texmf-dist/source/bibtex/biber/t/tdata/biber2.conf new file mode 100644 index 00000000000..04aa56cba2e --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/biber2.conf @@ -0,0 +1,14 @@ +## config file for Biber + +mincrossrefs = 5 +<collate_options> + level = 3 + table = /home/user/data/otherkeys.txt +</collate_options> +<nosort> + # strip prefices like 'al-' when sorting author + author \A\p{L}{2}\p{Pd} + # strip diacritics when sorting author + author [\x{2bf}\x{2018}] + translator [\x{2bf}\x{2018}] +</nosort> diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/biber3.conf b/Master/texmf-dist/source/bibtex/biber/t/tdata/biber3.conf new file mode 100644 index 00000000000..88905384c51 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/biber3.conf @@ -0,0 +1,7 @@ +## config file for Biber + +mincrossrefs = 3 +<collate_options> + level = 1 + table = /home/user/data/mykeys.txt +</collate_options> diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/bibtex-aliases.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/bibtex-aliases.bcf new file mode 100644 index 00000000000..3b307748f97 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/bibtex-aliases.bcf @@ -0,0 +1,1364 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">author</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <bcf:structure> + <bcf:datetypes> + <bcf:datetype>date</bcf:datetype> + <bcf:datetype>origdate</bcf:datetype> + <bcf:datetype>eventdate</bcf:datetype> + <bcf:datetype>urldate</bcf:datetype> + </bcf:datetypes> + <bcf:entrytypes> + <bcf:entrytype>article</bcf:entrytype> + <bcf:entrytype>artwork</bcf:entrytype> + <bcf:entrytype>audio</bcf:entrytype> + <bcf:entrytype>book</bcf:entrytype> + <bcf:entrytype>bookinbook</bcf:entrytype> + <bcf:entrytype>booklet</bcf:entrytype> + <bcf:entrytype>collection</bcf:entrytype> + <bcf:entrytype>commentary</bcf:entrytype> + <bcf:entrytype>customa</bcf:entrytype> + <bcf:entrytype>customb</bcf:entrytype> + <bcf:entrytype>customc</bcf:entrytype> + <bcf:entrytype>customd</bcf:entrytype> + <bcf:entrytype>custome</bcf:entrytype> + <bcf:entrytype>customf</bcf:entrytype> + <bcf:entrytype>inbook</bcf:entrytype> + <bcf:entrytype>incollection</bcf:entrytype> + <bcf:entrytype>inproceedings</bcf:entrytype> + <bcf:entrytype>inreference</bcf:entrytype> + <bcf:entrytype>image</bcf:entrytype> + <bcf:entrytype>jurisdiction</bcf:entrytype> + <bcf:entrytype>legal</bcf:entrytype> + <bcf:entrytype>legislation</bcf:entrytype> + <bcf:entrytype>letter</bcf:entrytype> + <bcf:entrytype>manual</bcf:entrytype> + <bcf:entrytype>misc</bcf:entrytype> + <bcf:entrytype>movie</bcf:entrytype> + <bcf:entrytype>music</bcf:entrytype> + <bcf:entrytype>online</bcf:entrytype> + <bcf:entrytype>patent</bcf:entrytype> + <bcf:entrytype>performance</bcf:entrytype> + <bcf:entrytype>periodical</bcf:entrytype> + <bcf:entrytype>proceedings</bcf:entrytype> + <bcf:entrytype>reference</bcf:entrytype> + <bcf:entrytype>report</bcf:entrytype> + <bcf:entrytype>review</bcf:entrytype> + <bcf:entrytype>set</bcf:entrytype> + <bcf:entrytype>software</bcf:entrytype> + <bcf:entrytype>standard</bcf:entrytype> + <bcf:entrytype>suppbook</bcf:entrytype> + <bcf:entrytype>suppcollection</bcf:entrytype> + <bcf:entrytype>thesis</bcf:entrytype> + <bcf:entrytype>unpublished</bcf:entrytype> + <bcf:entrytype>video</bcf:entrytype> + </bcf:entrytypes> + <bcf:fields> + <bcf:field fieldtype="field" datatype="literal">abstract</bcf:field> + <bcf:field fieldtype="field" datatype="literal">addendum</bcf:field> + <bcf:field fieldtype="list" datatype="name">afterword</bcf:field> + <bcf:field fieldtype="field" datatype="literal">annotation</bcf:field> + <bcf:field fieldtype="list" datatype="name">annotator</bcf:field> + <bcf:field fieldtype="list" datatype="name">author</bcf:field> + <bcf:field fieldtype="field" datatype="key">authortype</bcf:field> + <bcf:field fieldtype="list" datatype="name">bookauthor</bcf:field> + <bcf:field fieldtype="field" datatype="key">bookpagination</bcf:field> + <bcf:field fieldtype="field" datatype="literal">booksubtitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">booktitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">booktitleaddon</bcf:field> + <bcf:field fieldtype="field" datatype="literal">chapter</bcf:field> + <bcf:field fieldtype="list" datatype="name">commentator</bcf:field> + <bcf:field fieldtype="field" datatype="literal">crossref</bcf:field> + <bcf:field fieldtype="field" datatype="literal">day</bcf:field> + <bcf:field fieldtype="field" datatype="verbatim">doi</bcf:field> + <bcf:field fieldtype="field" datatype="literal">edition</bcf:field> + <bcf:field fieldtype="list" datatype="name">editor</bcf:field> + <bcf:field fieldtype="list" datatype="name">editora</bcf:field> + <bcf:field fieldtype="field" datatype="key">editoratype</bcf:field> + <bcf:field fieldtype="list" datatype="name">editorb</bcf:field> + <bcf:field fieldtype="field" datatype="key">editorbtype</bcf:field> + <bcf:field fieldtype="list" datatype="name">editorc</bcf:field> + <bcf:field fieldtype="field" datatype="key">editorctype</bcf:field> + <bcf:field fieldtype="field" datatype="key">editortype</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eid</bcf:field> + <bcf:field fieldtype="field" datatype="literal">endday</bcf:field> + <bcf:field fieldtype="field" datatype="literal">endmonth</bcf:field> + <bcf:field fieldtype="field" datatype="literal" nullok="true">endyear</bcf:field> + <bcf:field fieldtype="field" datatype="literal" skip_output="true">entryset</bcf:field> + <bcf:field fieldtype="field" datatype="literal">entrysubtype</bcf:field> + <bcf:field fieldtype="field" datatype="verbatim">eprint</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eprintclass</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eprinttype</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eventday</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eventendday</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eventendmonth</bcf:field> + <bcf:field fieldtype="field" datatype="literal" nullok="true">eventendyear</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eventmonth</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eventtitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eventyear</bcf:field> + <bcf:field fieldtype="field" datatype="literal">execute</bcf:field> + <bcf:field fieldtype="field" datatype="verbatim">file</bcf:field> + <bcf:field fieldtype="list" datatype="name">foreword</bcf:field> + <bcf:field fieldtype="field" datatype="literal">gender</bcf:field> + <bcf:field fieldtype="list" datatype="name">holder</bcf:field> + <bcf:field fieldtype="field" datatype="literal">howpublished</bcf:field> + <bcf:field fieldtype="field" datatype="literal">hyphenation</bcf:field> + <bcf:field fieldtype="field" datatype="literal">indexsorttitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">indextitle</bcf:field> + <bcf:field fieldtype="list" datatype="literal">institution</bcf:field> + <bcf:field fieldtype="list" datatype="name">introduction</bcf:field> + <bcf:field fieldtype="field" datatype="literal">isan</bcf:field> + <bcf:field fieldtype="field" datatype="literal">isbn</bcf:field> + <bcf:field fieldtype="field" datatype="literal">ismn</bcf:field> + <bcf:field fieldtype="field" datatype="literal">isrn</bcf:field> + <bcf:field fieldtype="field" datatype="literal">issn</bcf:field> + <bcf:field fieldtype="field" datatype="literal">issue</bcf:field> + <bcf:field fieldtype="field" datatype="literal">issuesubtitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">issuetitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">iswc</bcf:field> + <bcf:field fieldtype="field" datatype="literal">journalsubtitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">journaltitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">keywords</bcf:field> + <bcf:field fieldtype="field" datatype="literal">label</bcf:field> + <bcf:field fieldtype="list" datatype="key">language</bcf:field> + <bcf:field fieldtype="field" datatype="literal">library</bcf:field> + <bcf:field fieldtype="list" datatype="literal">lista</bcf:field> + <bcf:field fieldtype="list" datatype="literal">listb</bcf:field> + <bcf:field fieldtype="list" datatype="literal">listc</bcf:field> + <bcf:field fieldtype="list" datatype="literal">listd</bcf:field> + <bcf:field fieldtype="list" datatype="literal">liste</bcf:field> + <bcf:field fieldtype="list" datatype="literal">listf</bcf:field> + <bcf:field fieldtype="list" datatype="literal">location</bcf:field> + <bcf:field fieldtype="field" datatype="literal">mainsubtitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">maintitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">maintitleaddon</bcf:field> + <bcf:field fieldtype="field" datatype="integer">month</bcf:field> + <bcf:field fieldtype="list" datatype="name">namea</bcf:field> + <bcf:field fieldtype="field" datatype="literal">nameaddon</bcf:field> + <bcf:field fieldtype="field" datatype="key">nameatype</bcf:field> + <bcf:field fieldtype="list" datatype="name">nameb</bcf:field> + <bcf:field fieldtype="field" datatype="key">namebtype</bcf:field> + <bcf:field fieldtype="list" datatype="name">namec</bcf:field> + <bcf:field fieldtype="field" datatype="key">namectype</bcf:field> + <bcf:field fieldtype="field" datatype="literal">note</bcf:field> + <bcf:field fieldtype="field" datatype="literal">number</bcf:field> + <bcf:field fieldtype="field" datatype="literal">options</bcf:field> + <bcf:field fieldtype="list" datatype="literal">organization</bcf:field> + <bcf:field fieldtype="field" datatype="literal">origday</bcf:field> + <bcf:field fieldtype="field" datatype="literal">origendday</bcf:field> + <bcf:field fieldtype="field" datatype="literal">origendmonth</bcf:field> + <bcf:field fieldtype="field" datatype="literal" nullok="true">origendyear</bcf:field> + <bcf:field fieldtype="field" datatype="key">origlanguage</bcf:field> + <bcf:field fieldtype="list" datatype="literal">origlocation</bcf:field> + <bcf:field fieldtype="field" datatype="literal">origmonth</bcf:field> + <bcf:field fieldtype="list" datatype="literal">origpublisher</bcf:field> + <bcf:field fieldtype="field" datatype="literal">origtitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">origyear</bcf:field> + <bcf:field fieldtype="field" datatype="range">pages</bcf:field> + <bcf:field fieldtype="field" datatype="literal">pagetotal</bcf:field> + <bcf:field fieldtype="field" datatype="key">pagination</bcf:field> + <bcf:field fieldtype="field" datatype="literal">part</bcf:field> + <bcf:field fieldtype="field" datatype="literal" skip_output="true">presort</bcf:field> + <bcf:field fieldtype="list" datatype="literal">publisher</bcf:field> + <bcf:field fieldtype="field" datatype="key">pubstate</bcf:field> + <bcf:field fieldtype="field" datatype="literal">related</bcf:field> + <bcf:field fieldtype="field" datatype="literal">relatedtype</bcf:field> + <bcf:field fieldtype="field" datatype="literal">reprinttitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">series</bcf:field> + <bcf:field fieldtype="list" datatype="name">shortauthor</bcf:field> + <bcf:field fieldtype="list" datatype="name">shorteditor</bcf:field> + <bcf:field fieldtype="field" datatype="literal">shorthand</bcf:field> + <bcf:field fieldtype="field" datatype="literal">shorthandintro</bcf:field> + <bcf:field fieldtype="field" datatype="literal">shortjournal</bcf:field> + <bcf:field fieldtype="field" datatype="literal">shortseries</bcf:field> + <bcf:field fieldtype="field" datatype="literal">shorttitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal" skip_output="true">sortkey</bcf:field> + <bcf:field fieldtype="field" datatype="literal" skip_output="true">sortname</bcf:field> + <bcf:field fieldtype="field" datatype="literal" skip_output="true">sorttitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal" skip_output="true">sortyear</bcf:field> + <bcf:field fieldtype="field" datatype="literal">subtitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">title</bcf:field> + <bcf:field fieldtype="field" datatype="literal">titleaddon</bcf:field> + <bcf:field fieldtype="list" datatype="name">translator</bcf:field> + <bcf:field fieldtype="field" datatype="key">type</bcf:field> + <bcf:field fieldtype="field" datatype="verbatim">url</bcf:field> + <bcf:field fieldtype="field" datatype="literal">usera</bcf:field> + <bcf:field fieldtype="field" datatype="literal">userb</bcf:field> + <bcf:field fieldtype="field" datatype="literal">userc</bcf:field> + <bcf:field fieldtype="field" datatype="literal">userd</bcf:field> + <bcf:field fieldtype="field" datatype="literal">usere</bcf:field> + <bcf:field fieldtype="field" datatype="literal">userf</bcf:field> + <bcf:field fieldtype="field" datatype="literal">urlday</bcf:field> + <bcf:field fieldtype="field" datatype="literal">urlendday</bcf:field> + <bcf:field fieldtype="field" datatype="literal">urlendmonth</bcf:field> + <bcf:field fieldtype="field" datatype="literal" nullok="true">urlendyear</bcf:field> + <bcf:field fieldtype="field" datatype="literal">urlmonth</bcf:field> + <bcf:field fieldtype="field" datatype="literal">urlyear</bcf:field> + <bcf:field fieldtype="field" datatype="literal">venue</bcf:field> + <bcf:field fieldtype="field" datatype="verbatim">verba</bcf:field> + <bcf:field fieldtype="field" datatype="verbatim">verbb</bcf:field> + <bcf:field fieldtype="field" datatype="verbatim">verbc</bcf:field> + <bcf:field fieldtype="field" datatype="literal">version</bcf:field> + <bcf:field fieldtype="field" datatype="literal">volume</bcf:field> + <bcf:field fieldtype="field" datatype="literal">volumes</bcf:field> + <bcf:field fieldtype="field" datatype="literal">xref</bcf:field> + <bcf:field fieldtype="field" datatype="literal">year</bcf:field> + </bcf:fields> + <bcf:entryfields> + <bcf:entrytype>ALL</bcf:entrytype> + <bcf:field>abstract</bcf:field> + <bcf:field>annotation</bcf:field> + <bcf:field>authortype</bcf:field> + <bcf:field>bookpagination</bcf:field> + <bcf:field>crossref</bcf:field> + <bcf:field>entryset</bcf:field> + <bcf:field>entrysubtype</bcf:field> + <bcf:field>execute</bcf:field> + <bcf:field>file</bcf:field> + <bcf:field>gender</bcf:field> + <bcf:field>hyphenation</bcf:field> + <bcf:field>indextitle</bcf:field> + <bcf:field>indexsorttitle</bcf:field> + <bcf:field>isan</bcf:field> + <bcf:field>ismn</bcf:field> + <bcf:field>iswc</bcf:field> + <bcf:field>keywords</bcf:field> + <bcf:field>label</bcf:field> + <bcf:field>library</bcf:field> + <bcf:field>lista</bcf:field> + <bcf:field>listb</bcf:field> + <bcf:field>listc</bcf:field> + <bcf:field>listd</bcf:field> + <bcf:field>liste</bcf:field> + <bcf:field>listf</bcf:field> + <bcf:field>nameaddon</bcf:field> + <bcf:field>options</bcf:field> + <bcf:field>origday</bcf:field> + <bcf:field>origendday</bcf:field> + <bcf:field>origendmonth</bcf:field> + <bcf:field>origendyear</bcf:field> + <bcf:field>origmonth</bcf:field> + <bcf:field>origyear</bcf:field> + <bcf:field>origlocation</bcf:field> + <bcf:field>origpublisher</bcf:field> + <bcf:field>origtitle</bcf:field> + <bcf:field>pagination</bcf:field> + <bcf:field>presort</bcf:field> + <bcf:field>related</bcf:field> + <bcf:field>relatedtype</bcf:field> + <bcf:field>reprinttitle</bcf:field> + <bcf:field>shortauthor</bcf:field> + <bcf:field>shorteditor</bcf:field> + <bcf:field>shorthand</bcf:field> + <bcf:field>shorthandintro</bcf:field> + <bcf:field>shortjournal</bcf:field> + <bcf:field>shortseries</bcf:field> + <bcf:field>shorttitle</bcf:field> + <bcf:field>sortkey</bcf:field> + <bcf:field>sortname</bcf:field> + <bcf:field>sorttitle</bcf:field> + <bcf:field>sortyear</bcf:field> + <bcf:field>usera</bcf:field> + <bcf:field>userb</bcf:field> + <bcf:field>userc</bcf:field> + <bcf:field>userd</bcf:field> + <bcf:field>usere</bcf:field> + <bcf:field>userf</bcf:field> + <bcf:field>verba</bcf:field> + <bcf:field>verbb</bcf:field> + <bcf:field>verbc</bcf:field> + <bcf:field>xref</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>set</bcf:entrytype> + <bcf:field>ALL</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>article</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>journaltitle</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>annotator</bcf:field> + <bcf:field>commentator</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>editora</bcf:field> + <bcf:field>editorb</bcf:field> + <bcf:field>editorc</bcf:field> + <bcf:field>editoratype</bcf:field> + <bcf:field>editorbtype</bcf:field> + <bcf:field>editorctype</bcf:field> + <bcf:field>eid</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>issn</bcf:field> + <bcf:field>issue</bcf:field> + <bcf:field>issuetitle</bcf:field> + <bcf:field>issuesubtitle</bcf:field> + <bcf:field>journalsubtitle</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>origlanguage</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>series</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>translator</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>version</bcf:field> + <bcf:field>volume</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>book</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>afterword</bcf:field> + <bcf:field>annotator</bcf:field> + <bcf:field>chapter</bcf:field> + <bcf:field>commentator</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>edition</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>editora</bcf:field> + <bcf:field>editorb</bcf:field> + <bcf:field>editorc</bcf:field> + <bcf:field>editoratype</bcf:field> + <bcf:field>editorbtype</bcf:field> + <bcf:field>editorctype</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>foreword</bcf:field> + <bcf:field>introduction</bcf:field> + <bcf:field>isbn</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>maintitle</bcf:field> + <bcf:field>maintitleaddon</bcf:field> + <bcf:field>mainsubtitle</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>origlanguage</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>pagetotal</bcf:field> + <bcf:field>part</bcf:field> + <bcf:field>publisher</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>series</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>translator</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>volume</bcf:field> + <bcf:field>volumes</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>inbook</bcf:entrytype> + <bcf:entrytype>bookinbook</bcf:entrytype> + <bcf:entrytype>suppbook</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>booktitle</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>afterword</bcf:field> + <bcf:field>annotator</bcf:field> + <bcf:field>bookauthor</bcf:field> + <bcf:field>booksubtitle</bcf:field> + <bcf:field>booktitleaddon</bcf:field> + <bcf:field>chapter</bcf:field> + <bcf:field>commentator</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>edition</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>editora</bcf:field> + <bcf:field>editorb</bcf:field> + <bcf:field>editorc</bcf:field> + <bcf:field>editoratype</bcf:field> + <bcf:field>editorbtype</bcf:field> + <bcf:field>editorctype</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>foreword</bcf:field> + <bcf:field>introduction</bcf:field> + <bcf:field>isbn</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>mainsubtitle</bcf:field> + <bcf:field>maintitle</bcf:field> + <bcf:field>maintitleaddon</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>origlanguage</bcf:field> + <bcf:field>part</bcf:field> + <bcf:field>publisher</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>series</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>translator</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>volume</bcf:field> + <bcf:field>volumes</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>booklet</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>chapter</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>howpublished</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>pagetotal</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>type</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>collection</bcf:entrytype> + <bcf:entrytype>reference</bcf:entrytype> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>afterword</bcf:field> + <bcf:field>annotator</bcf:field> + <bcf:field>chapter</bcf:field> + <bcf:field>commentator</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>edition</bcf:field> + <bcf:field>editora</bcf:field> + <bcf:field>editorb</bcf:field> + <bcf:field>editorc</bcf:field> + <bcf:field>editoratype</bcf:field> + <bcf:field>editorbtype</bcf:field> + <bcf:field>editorctype</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>foreword</bcf:field> + <bcf:field>introduction</bcf:field> + <bcf:field>isbn</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>mainsubtitle</bcf:field> + <bcf:field>maintitle</bcf:field> + <bcf:field>maintitleaddon</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>origlanguage</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>pagetotal</bcf:field> + <bcf:field>part</bcf:field> + <bcf:field>publisher</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>series</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>translator</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>volume</bcf:field> + <bcf:field>volumes</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>incollection</bcf:entrytype> + <bcf:entrytype>suppcollection</bcf:entrytype> + <bcf:entrytype>inreference</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>booktitle</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>afterword</bcf:field> + <bcf:field>annotator</bcf:field> + <bcf:field>booksubtitle</bcf:field> + <bcf:field>booktitleaddon</bcf:field> + <bcf:field>chapter</bcf:field> + <bcf:field>commentator</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>edition</bcf:field> + <bcf:field>editora</bcf:field> + <bcf:field>editorb</bcf:field> + <bcf:field>editorc</bcf:field> + <bcf:field>editoratype</bcf:field> + <bcf:field>editorbtype</bcf:field> + <bcf:field>editorctype</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>foreword</bcf:field> + <bcf:field>introduction</bcf:field> + <bcf:field>isbn</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>mainsubtitle</bcf:field> + <bcf:field>maintitle</bcf:field> + <bcf:field>maintitleaddon</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>origlanguage</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>part</bcf:field> + <bcf:field>publisher</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>series</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>translator</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>volume</bcf:field> + <bcf:field>volumes</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>manual</bcf:entrytype> + <bcf:field>title</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>author</bcf:field> + <bcf:field>chapter</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>edition</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>isbn</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>organization</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>pagetotal</bcf:field> + <bcf:field>publisher</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>series</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>type</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>version</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>misc</bcf:entrytype> + <bcf:field>title</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>author</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>howpublished</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>organization</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>type</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>version</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>online</bcf:entrytype> + <bcf:field>title</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>author</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>organization</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>version</bcf:field> + <bcf:field>year</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>patent</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>holder</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>type</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>version</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>periodical</bcf:entrytype> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>editora</bcf:field> + <bcf:field>editorb</bcf:field> + <bcf:field>editorc</bcf:field> + <bcf:field>editoratype</bcf:field> + <bcf:field>editorbtype</bcf:field> + <bcf:field>editorctype</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>issn</bcf:field> + <bcf:field>issue</bcf:field> + <bcf:field>issuesubtitle</bcf:field> + <bcf:field>issuetitle</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>series</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>volume</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>proceedings</bcf:entrytype> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>chapter</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>eventday</bcf:field> + <bcf:field>eventendday</bcf:field> + <bcf:field>eventendmonth</bcf:field> + <bcf:field>eventendyear</bcf:field> + <bcf:field>eventmonth</bcf:field> + <bcf:field>eventyear</bcf:field> + <bcf:field>eventtitle</bcf:field> + <bcf:field>isbn</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>mainsubtitle</bcf:field> + <bcf:field>maintitle</bcf:field> + <bcf:field>maintitleaddon</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>organization</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>pagetotal</bcf:field> + <bcf:field>part</bcf:field> + <bcf:field>publisher</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>series</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>venue</bcf:field> + <bcf:field>volume</bcf:field> + <bcf:field>volumes</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>inproceedings</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>booktitle</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>booksubtitle</bcf:field> + <bcf:field>booktitleaddon</bcf:field> + <bcf:field>chapter</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>eventday</bcf:field> + <bcf:field>eventendday</bcf:field> + <bcf:field>eventendmonth</bcf:field> + <bcf:field>eventendyear</bcf:field> + <bcf:field>eventmonth</bcf:field> + <bcf:field>eventyear</bcf:field> + <bcf:field>eventtitle</bcf:field> + <bcf:field>isbn</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>mainsubtitle</bcf:field> + <bcf:field>maintitle</bcf:field> + <bcf:field>maintitleaddon</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>organization</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>part</bcf:field> + <bcf:field>publisher</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>series</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>venue</bcf:field> + <bcf:field>volume</bcf:field> + <bcf:field>volumes</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>report</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>type</bcf:field> + <bcf:field>institution</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>chapter</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>isrn</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>pagetotal</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>version</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>thesis</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>type</bcf:field> + <bcf:field>institution</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>chapter</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>pagetotal</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>unpublished</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>howpublished</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + </bcf:entryfields> + <bcf:constraints> + <bcf:entrytype>article</bcf:entrytype> + <bcf:entrytype>book</bcf:entrytype> + <bcf:entrytype>inbook</bcf:entrytype> + <bcf:entrytype>bookinbook</bcf:entrytype> + <bcf:entrytype>suppbook</bcf:entrytype> + <bcf:entrytype>booklet</bcf:entrytype> + <bcf:entrytype>collection</bcf:entrytype> + <bcf:entrytype>incollection</bcf:entrytype> + <bcf:entrytype>suppcollection</bcf:entrytype> + <bcf:entrytype>manual</bcf:entrytype> + <bcf:entrytype>misc</bcf:entrytype> + <bcf:entrytype>online</bcf:entrytype> + <bcf:entrytype>patent</bcf:entrytype> + <bcf:entrytype>periodical</bcf:entrytype> + <bcf:entrytype>suppperiodical</bcf:entrytype> + <bcf:entrytype>proceedings</bcf:entrytype> + <bcf:entrytype>inproceedings</bcf:entrytype> + <bcf:entrytype>reference</bcf:entrytype> + <bcf:entrytype>inreference</bcf:entrytype> + <bcf:entrytype>report</bcf:entrytype> + <bcf:entrytype>set</bcf:entrytype> + <bcf:entrytype>thesis</bcf:entrytype> + <bcf:entrytype>unpublished</bcf:entrytype> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>set</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>entryset</bcf:field> + <bcf:field>crossref</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>article</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>journaltitle</bcf:field> + <bcf:field>title</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>book</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>inbook</bcf:entrytype> + <bcf:entrytype>bookinbook</bcf:entrytype> + <bcf:entrytype>suppbook</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>booktitle</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>booklet</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:fieldor> + <bcf:field>author</bcf:field> + <bcf:field>editor</bcf:field> + </bcf:fieldor> + <bcf:field>title</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>collection</bcf:entrytype> + <bcf:entrytype>reference</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>incollection</bcf:entrytype> + <bcf:entrytype>suppcollection</bcf:entrytype> + <bcf:entrytype>inreference</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>booktitle</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>manual</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>title</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>misc</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>title</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>online</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>title</bcf:field> + <bcf:field>url</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>patent</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>number</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>periodical</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>proceedings</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>inproceedings</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>booktitle</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>report</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>type</bcf:field> + <bcf:field>institution</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>thesis</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>type</bcf:field> + <bcf:field>institution</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>unpublished</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + </bcf:constraint> + </bcf:constraints> + </bcf:structure> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">bibtex-aliases.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>alias1</bcf:citekey> + <bcf:citekey>alias2</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/bibtex-aliases.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/bibtex-aliases.bib new file mode 100644 index 00000000000..9dd1a1bf304 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/bibtex-aliases.bib @@ -0,0 +1,16 @@ +@PHDTHESIS{alias1, + AUTHOR = {Sammy Student}, + TITLE = {Four Years Later}, + INSTITUTION = {University of Life}, + ADDRESS = {Ivory Towers}, + DATE = {2003-10-01}, +} + +@THING{alias2, + AUTHOR = {Samuel Strange}, + TITLE = {Entitled}, + ADDRESS = {Ivory Towers}, + SCHOOL = {University of West Grantham}, + INSTITUTION = {University of East Grantham}, + DATE = {2004-03-03}, +} diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/crossrefs.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/crossrefs.bcf new file mode 100644 index 00000000000..e4d7508cebd --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/crossrefs.bcf @@ -0,0 +1,205 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <!-- INHERITANCE --> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + <bcf:type_pair source="*" target="incollection" inherit_all="false"/> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="*" target="*"/> + <bcf:field source="verba" target="verbb" override_target="true"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="*" target="inbook"/> + <bcf:field source="author" target="bookauthor" override_target="true"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:field source="title" target="booktitle" override_target="true"/> + <bcf:field source="titleaddon" target="booktitleaddon" override_target="true"/> + <bcf:field source="subtitle" target="booksubtitle" override_target="true"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle" override_target="false"/> + <bcf:field source="publisher" skip="true"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:field source="title" target="booktitle" override_target="true"/> + </bcf:inherit> + </bcf:inheritance> + <!-- SORTING --> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">crossrefs.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>cr1</bcf:citekey> + <bcf:citekey>cr2</bcf:citekey> + <bcf:citekey>cr3</bcf:citekey> + <bcf:citekey>cr4</bcf:citekey> + <bcf:citekey>cr6</bcf:citekey> + <bcf:citekey>cr7</bcf:citekey> + <bcf:citekey>cr8</bcf:citekey> + <bcf:citekey>crt</bcf:citekey> + <bcf:citekey>xr1</bcf:citekey> + <bcf:citekey>xr2</bcf:citekey> + <bcf:citekey>xr3</bcf:citekey> + <bcf:citekey>xr4</bcf:citekey> + <bcf:citekey>xrt</bcf:citekey> + <bcf:citekey>mxr</bcf:citekey> + <bcf:citekey>mcr</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> + <!-- SECTION 0 --> + <bcf:bibdata section="1"> + <bcf:datasource type="file" datatype="bibtex">crossrefs.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="1"> + <bcf:citekey>cr5</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/crossrefs.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/crossrefs.bib new file mode 100644 index 00000000000..d66d17bad8c --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/crossrefs.bib @@ -0,0 +1,205 @@ +% Testing mincrossrefs. cr1 and cr2 crossrefs should trigger inclusion of crm and also +% the crossref fields in both of them +% Also a test of some aliases +@INBOOK{cr1, + AUTHOR = {Graham Gullam}, + TITLE = {Great and Good Graphs}, + ORIGDATE = {1955}, + ARCHIVEPREFIX = {SomEPrFiX}, + PRIMARYCLASS = {SOMECLASS}, + CROSSREF = {crm} +} + +@INBOOK{cr2, + AUTHOR = {Frederick Fumble}, + TITLE = {Fabulous Fourier Forms}, + SCHOOL = {School}, + INSTITUTION = {Institution}, + ORIGDATE = {1943}, + CROSSREF = {crm} +} + +@BOOK{crm, + EDITOR = {Edgar Erbriss}, + TITLE = {Graphs of the Continent}, + PUBLISHER = {Grimble}, + YEAR = {1974} +} + +% Testing explicit cite of crossref parent. Should trigger inclusion of child crossref field +@INBOOK{cr3, + AUTHOR = {Arthur Aptitude}, + TITLE = {Arrangements of All Articles}, + ORIGDATE = {1934}, + ARCHIVEPREFIX = {SomEPrFiX}, + EPRINTTYPE = {sometype}, + CROSSREF = {crt} +} + +@BOOK{crt, + EDITOR = {Mark Monkley}, + TITLE = {Beasts of the Burbling Burns}, + PUBLISHER = {Rancour}, + YEAR = {1996} +} + +% Testing mincrossrefs not reached. cr4 is cited, cr5 isn't, therefore mincrossrefs (2) for +% crn not reached +@INBOOK{cr4, + AUTHOR = {Morris Mumble}, + TITLE = {Enterprising Entities}, + ORIGDATE = {1911}, + CROSSREF = {crn} +} + +@INBOOK{cr5, + AUTHOR = {Oliver Ordinary}, + TITLE = {Questionable Quidities}, + ORIGDATE = {1919}, + CROSSREF = {crn} +} + +@BOOK{crn, + EDITOR = {Jeremy Jermain}, + TITLE = {Vanquished, Victor, Vandal}, + PUBLISHER = {Pillsbury}, + YEAR = {1945} +} + +% Testing inheritance of event information +@PROCEEDINGS{cr6i, + AUTHOR = {Spurious Author}, + ADDRESS = {Address}, + TITLE = {Title of proceeding}, + EDITOR = {Editor}, + PUBLISHER = {Publisher of proceeding}, + EVENTDATE = {2009-08-21/2009-08-24}, + EVENTTITLE = {Title of the event}, + VENUE = {Location of event}, + YEAR = {2009} +} + +@INPROCEEDINGS{cr6, + AUTHOR = {Author, Firstname}, + CROSSREF = {cr6i}, + PAGES = {123--}, + TITLE = {Title of inproceeding}, + BOOKTITLE = {Manual booktitle}, + YEAR = {2009}, +} + +% Testing inheritance of special fields (booktitle, bookauthor etc.) +@BOOK{cr7i, + AUTHOR = {Brian Bookauthor}, + TITLE = {Book Title}, + SUBTITLE = {Book Subtitle}, + TITLEADDON = {Book Titleaddon}, + PUBLISHER = {Publisher of proceeding}, + YEAR = {2009}, + VERBA = {String}, +} + +@INBOOK{cr7, + AUTHOR = {Author, Firstname}, + CROSSREF = {cr7i}, + PAGES = {123--126}, + TITLE = {Title of Book bit}, + YEAR = {2010} +} + +% Testing supression of default inheritance +@COLLECTION{cr8i, + EDITOR = {Brian Editor}, + TITLE = {Book Title}, + SUBTITLE = {Book Subtitle}, + TITLEADDON = {Book Titleaddon}, + PUBLISHER = {Publisher of Collection}, + YEAR = {2009} +} + +@INCOLLECTION{cr8, + AUTHOR = {Smith, Firstname}, + CROSSREF = {cr8i}, + PAGES = {1--12}, + TITLE = {Title of Collection bit}, + YEAR = {2010} +} + + +% Testing mincrossrefs. xr1 and xr2 xrefs should trigger inclusion of xrm and also +% the xreffields in both of them +@INBOOK{xr1, + AUTHOR = {Zoe Zentrum}, + TITLE = {Moods Mildly Modified}, + ORIGDATE = {1921}, + XREF = {xrm} +} + +@INBOOK{xr2, + AUTHOR = {Ian Instant}, + TITLE = {Migraines Multiplying Madly}, + ORIGDATE = {1926}, + XREF = {xrm} +} + +@BOOK{xrm, + EDITOR = {Peter Prendergast}, + TITLE = {Calligraphy, Calisthenics, Culture}, + PUBLISHER = {Mainstream}, + YEAR = {1970} +} + +% Testing explicit cite of xref parent. Should trigger inclusion of child xref field +@INBOOK{xr3, + AUTHOR = {Norman Normal}, + TITLE = {Russion Regalia Revisited}, + ORIGDATE = {1923}, + XREF = {xrt} +} + +@BOOK{xrt, + EDITOR = {Lucy Lunders}, + TITLE = {Kings, Cork and Calculation}, + PUBLISHER = {Middling}, + YEAR = {1977} +} + +% Testing mincrossrefs not reached. cr4 is cited, cr5 isn't, therefore mincrossrefs (2) for +% crn not reached +@INBOOK{xr4, + AUTHOR = {Megan Mistrel}, + TITLE = {Lumbering Lunatics}, + ORIGDATE = {1933}, + XREF = {xrn} +} + +@INBOOK{xr5, + AUTHOR = {Kenneth Kunrath}, + TITLE = {Dreadful Dreary Days}, + ORIGDATE = {1900}, + XREF = {xrn} +} + +@BOOK{xrn, + EDITOR = {Victor Vivacious}, + TITLE = {Examples of Excellent Exaggerations}, + PUBLISHER = {Oxford}, + YEAR = {1935} +} + +% Testing missing xref +@INBOOK{mxr, + AUTHOR = {Megan Mistrel}, + TITLE = {Lumbering Lunatics}, + ORIGDATE = {1933}, + XREF = {missing1} +} + +% Testing missing crossref +@INBOOK{mcr, + AUTHOR = {Megan Mistrel}, + TITLE = {Lumbering Lunatics}, + ORIGDATE = {1933}, + CROSSREF = {missing1} +} + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/definitions.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/definitions.bib new file mode 100644 index 00000000000..003c6dd4b86 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/definitions.bib @@ -0,0 +1,690 @@ +% ABBREVIATIONS +% +% OF JOURNAL-NAMES +% + +@string{acmcs = "ACM Computing Surveys"} +@string{acmtalg = "ACM Transactions on Algorithms"} +@string{acmjea = "ACM Journal of Experimental Algorithms"} +@string{actacybernetica = "Acta Cybernetica"} +@string{adm = "Annals of Discrete Mathematics"} +@string{ai = "Acta Informatica"} +@string{alg = "Algorithmica"} +@string{amm = "American Mathematical Monthly"} +@string{amsuh = "Abh. Math. Sem. Univ. Hamburg"} +@string{aor = "Annals of Operations Research"} +@string{apal = "Annals of Pure and Applied Logic"} +@string{arscomb = "Ars Combinatoria"} +@string{artint = "Artificial Intelligence"} +@string{beatcs = "Bulletin of the EATCS"} +@string{bit = "BIT"} +@string{cacm = "Communications of the ACM"} +@string{canjm = "Canadian Journal of Mathematics"} +@string{cg = "Computational Geometry"} +@string{cm = "Contemporary Mathematics"} +@string{cn = "Congressus Numerantium"} +@string{cnet = "Computer Networks"} +@string{comb = "Combinatorica"} +@string{combinatorica = "Combinatorica"} +@string{comp = "Computing"} +@string{cor = "Computers \& Operations Research"} +@string{cpc = "Combinatorics, Probability, and Computing"} +@string{dm = "Discrete Mathematics"} +@string{dam = "Discrete Applied Mathematics"} +@string{dcg = "Discrete and Computational Geometry"} +@string{dmtcs = "Discrete Mathematics and Theoretical Computer Science"} +@string{do = "Discrete Optimization"} +@string{endm = "Electronic Notes in Discrete Mathematics"} +@string{elemmath = "Elem. Math."} +@string{ejc = "Electronic Journal of Combinatorics"} +@string{ejcom = "European Journal of Combinatorics"} +@string{ejor = "European Journal of Operational Research"} +@string{fundmath = "Fundamenta Mathematicae"} +@string{gc = "Graphs and Combinatorics"} +@string{ic = "Information and Control"} +@string{ic2 = "Information and Computation"} +@string{ietc = "IEEE Transations on Computers"} +@string{ieeetc = "IEEE Transactions on Computers"} +@string{ieeetcs = "IEEE Transactions on Circuits and Systems"} +@string{ieeetct = "IEEE Transactions on Circuit Theory"} +@string{ieeeted = "IEEE Transactions on Electronic Devices"} +@string{ieeetse = "IEEE Transactions on Software Engineering"} +@string{ijcis = "International Journal of Computer and System Sciences"} +@string{ijcm = "International Journal of Computer Mathematics"} +@string{ijfcs = "International Journal of Foundations of Computer Science"} +@string{informsjc = "INFORMS Journal on Computing"} +@string{ipl = "Information Processing Letters"} +@string{ita = "Informatique Th\'{e}orique et Applications"} +@string{ja = "Journal of Algorithms"} +@string{jair = "Journal of Artificial Intelligence Research"} +@string{jacm = "Journal of the ACM"} +@string{jct = "Journal of Combinatorial Theory"} +@string{jcta = "Journal of Combinatorial Theory, Series A"} +@string{jctb = "Journal of Combinatorial Theory, Series B"} +@string{jco = "Journal of Combinatorial Optimization"} +@string{jcss = "Journal of Computer and System Sciences"} +@string{jda = "Journal of Discrete Algorithms"} +@string{jgaa = "Journal of Graph Algorithms and Applications"} +@string{jgt = "Journal of Graph Theory"} +@string{jip = "Journal of Information Processing"} +@string{jise = "Journal of Information Science and Engineering"} +@string{jmaa = "Journal of Mathematical Analysis and Applications"} +@string{jpdc = "Journal of Parallel and Distributed Computing"} +@string{jucs = "Journal of Universal Computer Science"} +@string{math = "Mathematika"} +@string{mor = "Mathematics of Operations Research"} +@string{mp = "Mathematical Programming"} +@string{mst = "Mathematical Systems Theory"} +@string{netw = "Networks"} +@string{networks = "Networks"} +@string{nordicjc = "Nordic Journal of Computing"} +@string{or = "Operations Research"} +@string{orl = "Operations Research Letters"} +@string{pms = "Probability and Mathematical Statistics"} +@string{sam = "Studies in Applied Mathematics"} +@string{siamjc = "SIAM Journal on Computing"} +@string{siamjo = "SIAM Journal on Optimization"} +@string{sjam = "SIAM Journal on Applied Mathematics"} +@string{sjadm = "SIAM Journal on Algebraic and Discrete Methods"} +@string{sjdm = "SIAM Journal on Discrete Mathematics"} +@string{sjmaa = "SIAM Journal on Matrix Analysis and Applications"} +@string{sjna = "SIAM Journal on Numerical Analysis"} +@string{tcs = "Theoretical Computer Science"} +@string{tocs = "Theory of Computing Systems"} +@string{tcj = "The Computer Journal"} + +@string{vi= "Department of Computer Science, Utrecht University"} +@string{tr= "Technical Report"} + +%Abbreviations of Conference names + +@string{aaai92 = "Proceedings of the 10th National Conference on Artificial Intelligence, AAAI'92"} +@string{aaai93 = "Proceedings of the 11th National Conference on Artificial Intelligence, AAAI'93"} +@string{aaai94 = "Proceedings of the 12th National Conference on Artificial Intelligence, AAAI'94"} +@string{aaai95 = "Proceedings of the 13th National Conference on Artificial Intelligence, AAAI'95"} +@string{aaai96 = "Proceedings of the 14th National Conference on Artificial Intelligence, AAAI'96"} +@string{aaai97 = "Proceedings of the 15th National Conference on Artificial Intelligence, AAAI'97"} +@string{aaai98 = "Proceedings of the 16th National Conference on Artificial Intelligence, AAAI'98"} +@string{aaai07 = "Proceedings of the 25th National Conference on Artificial Intelligence, AAAI'07"} + +@string{acid05 = "Proceedings of the 1st Workshop on Algorithms and Complexity in Durham, ACiD 2005"} + +@string{alenex99 = "Proceedings of the 1st International Workshop on Algorithm Engineering and Experimentation, ALENEX'99"} +@string{alenex00 = "Proceedings of the 2nd International Workshop on Algorithm Engineering and Experimentation, ALENEX 2000"} +@string{alenex01 = "Proceedings of the 3rd International Workshop on Algorithm Engineering and Experimentation, ALENEX 2001"} +@string{alenex02 = "Proceedings of the 4th International Workshop on Algorithm Engineering and Experimentation, ALENEX 2002"} +@string{alenex03 = "Proceedings of the 5th Workshop on Algorithm Engineering and Experimentation, ALENEX 2003"} +@string{alenex04 = "Proceedings of the 6th Workshop on Algorithm Engineering and Experimentation and the +1st Workshop on Analytic Algorithmics and Combinatorics, ALENEX/ANALCO 2004"} +@string{alenex05 = "Proceedings of the 7th Workshop on Algorithm Engineering and Experimentation and the +2nd Workshop on Analytic Algorithmics and Combinatorics, ALENEX/ANALCO 2005"} +@string{alenex06 = "Proceedings of the 8th International Workshop on Algorithm Engineering and Experimentation, ALENEX 2006"} +@string{alenex07 = "Proceedings of the 9th Workshop on Algorithm Engineering and Experimentation, ALENEX 2007"} +@string{alenex08 = "Proceedings of the 10th Workshop on Algorithm Engineering and Experimentation, ALENEX 2008"} +@string{alenex09 = "Proceedings of the 11th Workshop on Algorithm Engineering and Experimentation, ALENEX 2009"} + +@string{ciac97 = "Proceedings of the 3rd Italian Conference on Algorithms and Complexity, CIAC'97"} +@string{ciac00 = "Proceedings of the 4th Italian Conference on Algorithms and Complexity, CIAC 2000"} +@string{ciac03 = "Proceedings of the 5th Italian Conference on Algorithms and Complexity, CIAC 2003"} +@string{ciac06 = "Proceedings of the 6th Italian Conference on Algorithms and Complexity, CIAC 2006"} +@string{ciac10 = "Proceedings of the 7th Italian Conference on Algorithms and Complexity, CIAC 2010"} + +@string{cocoon95 = "Proceedings of the 1st Annual International Conference on Computing and Combinatorics, COCOON'95"} +@string{cocoon96 = "Proceedings of the 2nd Annual International Conference on Computing and Combinatorics, COCOON'96"} +@string{cocoon97 = "Proceedings of the 3rd Annual International Conference on Computing and Combinatorics, COCOON'97"} +@string{cocoon98 = "Proceedings of the 4th Annual International Conference on Computing and Combinatorics, COCOON'98"} +@string{cocoon99 = "Proceedings of the 5th Annual International Conference on Computing and Combinatorics, COCOON'99"} +@string{cocoon00 = "Proceedings of the 6th Annual International Conference on Computing and Combinatorics, COCOON 2000"} +@string{cocoon01 = "Proceedings of the 7th Annual International Conference on Computing and Combinatorics, COCOON 2001"} +@string{cocoon02 = "Proceedings of the 8th Annual International Conference on Computing and Combinatorics, COCOON 2002"} +@string{cocoon03 = "Proceedings of the 9th Annual International Conference on Computing and Combinatorics, COCOON 2003"} +@string{cocoon04 = "Proceedings of the 10th Annual International Conference on Computing and Combinatorics, COCOON 2004"} +@string{cocoon05 = "Proceedings of the 11th Annual International Conference on Computing and Combinatorics, COCOON 2005"} +@string{cocoon06 = "Proceedings of the 12th Annual International Conference on Computing and Combinatorics, COCOON 2006"} +@string{cocoon07 = "Proceedings of the 13th Annual International Conference on Computing and Combinatorics, COCOON 2007"} +@string{cocoon08 = "Proceedings of the 14th Annual International Conference on Computing and Combinatorics, COCOON 2008"} +@string{cocoon09 = "Proceedings of the 15th Annual International Conference on Computing and Combinatorics, COCOON 2009"} + +@string{ecai2002 = "Proceedings of the 15th European Conference on Artificial Intelligence, ECAI 2002"} +@string{ecai2003 = "Proceedings of the 16th European Conference on Artificial Intelligence, ECAI 2003"} +@string{ecai2004 = "Proceedings of the 17th European Conference on Artificial Intelligence, ECAI 2004"} +@string{ecai2005 = "Proceedings of the 18th European Conference on Artificial Intelligence, ECAI 2005"} +@string{ecai2006 = "Proceedings of the 19th European Conference on Artificial Intelligence, ECAI 2006"} +@string{ecai2007 = "Proceedings of the 20th European Conference on Artificial Intelligence, ECAI 2007"} +@string{ecai2008 = "Proceedings of the 21st European Conference on Artificial Intelligence, ECAI 2008"} +@string{ecai2009 = "Proceedings of the 22nd European Conference on Artificial Intelligence, ECAI 2009"} + +@string{esa93 = "Proceedings of the 1st Annual European Symposium on Algorithms, ESA'93"} +@string{esa94 = "Proceedings of the 2nd Annual European Symposium on Algorithms, ESA'94"} +@string{esa95 = "Proceedings of the 3rd Annual European Symposium on Algorithms, ESA'95"} +@string{esa96 = "Proceedings of the 4th Annual European Symposium on Algorithms, ESA'96"} +@string{esa97 = "Proceedings of the 5th Annual European Symposium on Algorithms, ESA'97"} +@string{esa98 = "Proceedings of the 6th Annual European Symposium on Algorithms, ESA'98"} +@string{esa99 = "Proceedings of the 7th Annual European Symposium on Algorithms, ESA'99"} +@string{esa00 = "Proceedings of the 8th Annual European Symposium on Algorithms, ESA 2000"} +@string{esa01 = "Proceedings of the 9th Annual European Symposium on Algorithms, ESA 2001"} +@string{esa02 = "Proceedings of the 10th Annual European Symposium on Algorithms, ESA 2002"} +@string{esa03 = "Proceedings of the 11th Annual European Symposium on Algorithms, ESA 2003"} +@string{esa04 = "Proceedings of the 12th Annual European Symposium on Algorithms, ESA 2004"} +@string{esa05 = "Proceedings of the 13th Annual European Symposium on Algorithms, ESA 2005"} +@string{esa06 = "Proceedings of the 14th Annual European Symposium on Algorithms, ESA 2006"} +@string{esa07 = "Proceedings of the 15th Annual European Symposium on Algorithms, ESA 2007"} +@string{esa08 = "Proceedings of the 16th Annual European Symposium on Algorithms, ESA 2008"} +@string{esa09 = "Proceedings of the 17th Annual European Symposium on Algorithms, ESA 2009"} + +@string{fct85 = "Proceedings of the 5th International Conference on Fundamentals of Computation Theory, FCT'85"} +@string{fct87 = "Proceedings of the 6th International Conference on Fundamentals of Computation Theory, FCT'87"} +@string{fct89 = "Proceedings of the 7th International Conference on Fundamentals of Computation Theory, FCT'89"} +@string{fct91 = "Proceedings of the 8th International Symposium on Fundamentals of Computation Theory, FCT'91"} +@string{fct93 = "Proceedings of the 9th International Symposium on Fundamentals of Computation Theory, FCT'93"} +@string{fct95 = "Proceedings of the 10th International Symposium on Fundamentals of Computation Theory, FCT'95"} +@string{fct97 = "Proceedings of the 11th International Symposium on Fundamentals of Computation Theory, FCT'97"} +@string{fct99 = "Proceedings of the 12th International Symposium on Fundamentals of Computation Theory, FCT'99"} +@string{fct01 = "Proceedings of the 13th International Symposium on Fundamentals of Computation Theory, FCT 2001"} +@string{fct03 = "Proceedings of the 14th International Symposium on Fundamentals of Computation Theory, FCT 2003"} +@string{fct05 = "Proceedings of the 15th International Symposium on Fundamentals of Computation Theory, FCT 2005"} +@string{fct07 = "Proceedings of the 16th International Symposium on Fundamentals of Computation Theory, FCT 2007"} +@string{fct09 = "Proceedings of the 17th International Symposium on Fundamentals of Computation Theory, FCT 2009"} + +@string{focs75 = "Proceedings of the 16th Annual Symposium on Foundations of Computer Science, FOCS'75"} +@string{focs76 = "Proceedings of the 17th Annual Symposium on Foundations of Computer Science, FOCS'76"} +@string{focs77 = "Proceedings of the 18th Annual Symposium on Foundations of Computer Science, FOCS'77"} +@string{focs78 = "Proceedings of the 19th Annual Symposium on Foundations of Computer Science, FOCS'78"} +@string{focs79 = "Proceedings of the 20th Annual Symposium on Foundations of Computer Science, FOCS'79"} +@string{focs80 = "Proceedings of the 21st Annual Symposium on Foundations of Computer Science, FOCS'80"} +@string{focs81 = "Proceedings of the 22nd Annual Symposium on Foundations of Computer Science, FOCS'81"} +@string{focs82 = "Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, FOCS'82"} +@string{focs83 = "Proceedings of the 24th Annual Symposium on Foundations of Computer Science, FOCS'83"} +@string{focs84 = "Proceedings of the 25th Annual Symposium on Foundations of Computer Science, FOCS'84"} +@string{focs85 = "Proceedings of the 26th Annual Symposium on Foundations of Computer Science, FOCS'85"} +@string{focs86 = "Proceedings of the 27th Annual Symposium on Foundations of Computer Science, FOCS'86"} +@string{focs87 = "Proceedings of the 28th Annual Symposium on Foundations of Computer Science, FOCS'87"} +@string{focs88 = "Proceedings of the 29th Annual Symposium on Foundations of Computer Science, FOCS'88"} +@string{focs89 = "Proceedings of the 30th Annual Symposium on Foundations of Computer Science, FOCS'89"} +@string{focs90 = "Proceedings of the 31st Annual Symposium on Foundations of Computer Science, FOCS'90"} +@string{focs91 = "Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, FOCS'91"} +@string{focs92 = "Proceedings of the 33rd Annual Symposium on Foundations of Computer Science, FOCS'92"} +@string{focs93 = "Proceedings of the 34th Annual Symposium on Foundations of Computer Science, FOCS'93"} +@string{focs94 = "Proceedings of the 35th Annual Symposium on Foundations of Computer Science, FOCS'94"} +@string{focs95 = "Proceedings of the 36th Annual Symposium on Foundations of Computer Science, FOCS'95"} +@string{focs96 = "Proceedings of the 37th Annual Symposium on Foundations of Computer Science, FOCS'96"} +@string{focs97 = "Proceedings of the 38th Annual Symposium on Foundations of Computer Science, FOCS'97"} +@string{focs98 = "Proceedings of the 39th Annual Symposium on Foundations of Computer Science, FOCS'98"} +@string{focs99 = "Proceedings of the 40th Annual Symposium on Foundations of Computer Science, FOCS'99"} +@string{focs00 = "Proceedings of the 41st Annual Symposium on Foundations of Computer Science, FOCS 2000"} +@string{focs01 = "Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, FOCS 2001"} +@string{focs02 = "Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, FOCS 2002"} +@string{focs03 = "Proceedings of the 44th Annual Symposium on Foundations of Computer Science, FOCS 2003"} +@string{focs04 = "Proceedings of the 45th Annual Symposium on Foundations of Computer Science, FOCS 2004"} +@string{focs05 = "Proceedings of the 46th Annual Symposium on Foundations of Computer Science, FOCS 2005"} +@string{focs06 = "Proceedings of the 47th Annual Symposium on Foundations of Computer Science, FOCS 2006"} +@string{focs07 = "Proceedings of the 48th Annual Symposium on Foundations of Computer Science, FOCS 2007"} +@string{focs08 = "Proceedings of the 49th Annual Symposium on Foundations of Computer Science, FOCS 2008"} +@string{focs09 = "Proceedings of the 50th Annual Symposium on Foundations of Computer Science, FOCS 2009"} + +@string{fsttcs01 = "Proceedings 21st International Comference on Foundations of Software +Technology and Theoretical Computer Science, FSTTCS 2001"} +@string{fsttcs02 = "Proceedings 22nd International Comference on Foundations of Software +Technology and Theoretical Computer Science, FSTTCS 2002"} +@string{fsttcs03 = "Proceedings 23rd International Comference on Foundations of Software +Technology and Theoretical Computer Science, FSTTCS 2003"} +@string{fsttcs04 = "Proceedings 24th International Comference on Foundations of Software +Technology and Theoretical Computer Science, FSTTCS 2004"} +@string{fsttcs05 = "Proceedings 25th International Comference on Foundations of Software +Technology and Theoretical Computer Science, FSTTCS 2005"} +@string{fsttcs06 = "Proceedings 26th International Comference on Foundations of Software +Technology and Theoretical Computer Science, FSTTCS 2006"} +@string{fsttcs07 = "Proceedings 27th International Comference on Foundations of Software +Technology and Theoretical Computer Science, FSTTCS 2007"} +@string{fsttcs08 = "Proceedings 28th International Comference on Foundations of Software +Technology and Theoretical Computer Science, FSTTCS 2008"} +@string{fsttcs09 = "Proceedings 29th International Comference on Foundations of Software +Technology and Theoretical Computer Science, FSTTCS 2009"} + +@string{gd94 = "Proceedings of the 3rd International Symposium on Graph Drawing, GD'94"} +@string{gd95 = "Proceedings of the 4th International Symposium on Graph Drawing, GD'95"} +@string{gd96 = "Proceedings of the 5th International Symposium on Graph Drawing, GD'96"} +@string{gd97 = "Proceedings of the 6th International Symposium on Graph Drawing, GD'97"} +@string{gd98 = "Proceedings of the 7th International Symposium on Graph Drawing, GD'98"} +@string{gd99 = "Proceedings of the 8th International Symposium on Graph Drawing, GD'99"} +@string{gd00 = "Proceedings of the 9th International Symposium on Graph Drawing, GD 2000"} +@string{gd01 = "Proceedings of the 10th International Symposium on Graph Drawing, GD 2001"} +@string{gd02 = "Proceedings of the 11th International Symposium on Graph Drawing, GD 2002"} +@string{gd03 = "Proceedings of the 12th International Symposium on Graph Drawing, GD 2003"} +@string{gd04 = "Proceedings of the 13th International Symposium on Graph Drawing, GD 2004"} +@string{gd05 = "Proceedings of the 14th International Symposium on Graph Drawing, GD 2005"} +@string{gd06 = "Proceedings of the 15th International Symposium on Graph Drawing, GD 2006"} +@string{gd07 = "Proceedings of the 16th International Symposium on Graph Drawing, GD 2007"} +@string{gd08 = "Proceedings of the 17th International Symposium on Graph Drawing, GD 2008"} +@string{gd09 = "Proceedings of the 18th International Symposium on Graph Drawing, GD 2009"} + +@string{gragra86 = "Proceedings of the 3rd International Workshop on Graph-Grammars and Their Application to Computer Science"} +@string{gragra90 = "Proceedings of the 4th International Workshop on Graph-Grammars and Their Application to Computer Science"} + +@string{icalp74 = "Proceedings of the 1st International Colloquium on Automata, Languages and Programming, ICALP'74"} +@string{icalp75 = "Proceedings of the 2nd International Colloquium on Automata, Languages and Programming, ICALP'75"} +@string{icalp76 = "Proceedings of the 3rd International Colloquium on Automata, Languages and Programming, ICALP'76"} +@string{icalp77 = "Proceedings of the 4th International Colloquium on Automata, Languages and Programming, ICALP'77"} +@string{icalp78 = "Proceedings of the 5th International Colloquium on Automata, Languages and Programming, ICALP'78"} +@string{icalp79 = "Proceedings of the 6th International Colloquium on Automata, Languages and Programming, ICALP'79"} +@string{icalp80 = "Proceedings of the 7th International Colloquium on Automata, Languages and Programming, ICALP'80"} +@string{icalp81 = "Proceedings of the 8th International Colloquium on Automata, Languages and Programming, ICALP'82"} +@string{icalp82 = "Proceedings of the 9th International Colloquium on Automata, Languages and Programming, ICALP'83"} +@string{icalp83 = "Proceedings of the 10th International Colloquium on Automata, Languages and Programming, ICALP'81"} +@string{icalp84 = "Proceedings of the 11th International Colloquium on Automata, Languages and Programming, ICALP'84"} +@string{icalp85 = "Proceedings of the 12th International Colloquium on Automata, Languages and Programming, ICALP'85"} +@string{icalp86 = "Proceedings of the 13th International Colloquium on Automata, Languages and Programming, ICALP'86"} +@string{icalp87 = "Proceedings of the 14th International Colloquium on Automata, Languages and Programming, ICALP'87"} +@string{icalp88 = "Proceedings of the 15th International Colloquium on Automata, Languages and Programming, ICALP'88"} +@string{icalp89 = "Proceedings of the 16th International Colloquium on Automata, Languages and Programming, ICALP'89"} +@string{icalp90 = "Proceedings of the 17th International Colloquium on Automata, Languages and Programming, ICALP'90"} +@string{icalp91 = "Proceedings of the 18th International Colloquium on Automata, Languages and Programming, ICALP'91"} +@string{icalp92 = "Proceedings of the 19th International Colloquium on Automata, Languages and Programming, ICALP'92"} +@string{icalp93 = "Proceedings of the 20th International Colloquium on Automata, Languages and Programming, ICALP'93"} +@string{icalp94 = "Proceedings of the 21st International Colloquium on Automata, Languages and Programming, ICALP'94"} +@string{icalp95 = "Proceedings of the 22nd International Colloquium on Automata, Languages and Programming, ICALP'95"} +@string{icalp96 = "Proceedings of the 23rd International Colloquium on Automata, Languages and Programming, ICALP'96"} +@string{icalp97 = "Proceedings of the 24th International Colloquium on Automata, Languages and Programming, ICALP'97"} +@string{icalp98 = "Proceedings of the 25th International Colloquium on Automata, Languages and Programming, ICALP'98"} +@string{icalp99 = "Proceedings of the 26th International Colloquium on Automata, Languages and Programming, ICALP'99"} +@string{icalp00 = "Proceedings of the 27th International Colloquium on Automata, Languages and Programming, ICALP 2000"} +@string{icalp01 = "Proceedings of the 28th International Colloquium on Automata, Languages and Programming, ICALP 2001"} +@string{icalp02 = "Proceedings of the 29th International Colloquium on Automata, Languages and Programming, ICALP 2002"} +@string{icalp03 = "Proceedings of the 30th International Colloquium on Automata, Languages and Programming, ICALP 2003"} +@string{icalp04 = "Proceedings of the 31st International Colloquium on Automata, Languages and Programming, ICALP 2004"} +@string{icalp05 = "Proceedings of the 32nd International Colloquium on Automata, Languages and Programming, ICALP 2005"} +@string{icalp06 = "Proceedings of the 33rd International Colloquium on Automata, Languages and Programming, ICALP 2006"} +@string{icalp07 = "Proceedings of the 34th International Colloquium on Automata, Languages and Programming, ICALP 2007"} +@string{icalp08-1 = "Proceedings of the 35th International Colloquium on Automata, Languages and Programming, +ICALP 2008, Part I"} +@string{icalp09-1 = "Proceedings of the 36th International Colloquium on Automata, Languages and Programming, +ICALP 2009, Part I"} + +@string{isaac92 = "Proceedings of the 3rd International Symposium on Algorithms and Computation, ISAAC'92"} +@string{isaac93 = "Proceedings of the 4th International Symposium on Algorithms and Computation, ISAAC'93"} +@string{isaac94 = "Proceedings of the 5th International Symposium on Algorithms and Computation, ISAAC'94"} +@string{isaac95 = "Proceedings of the 6th International Symposium on Algorithms and Computation, ISAAC'95"} +@string{isaac96 = "Proceedings of the 7th International Symposium on Algorithms and Computation, ISAAC'96"} +@string{isaac97 = "Proceedings of the 8th International Symposium on Algorithms and Computation, ISAAC'97"} +@string{isaac98 = "Proceedings of the 9th International Symposium on Algorithms and Computation, ISAAC'98"} +@string{isaac99 = "Proceedings of the 10th International Symposium on Algorithms and Computation, ISAAC'99"} +@string{isaac00 = "Proceedings of the 11th International Symposium on Algorithms and Computation, ISAAC 2000"} +@string{isaac01 = "Proceedings of the 12th International Symposium on Algorithms and Computation, ISAAC 2001"} +@string{isaac02 = "Proceedings of the 13th International Symposium on Algorithms and Computation, ISAAC 2002"} +@string{isaac03 = "Proceedings of the 14th International Symposium on Algorithms and Computation, ISAAC 2003"} +@string{isaac04 = "Proceedings of the 15th International Symposium on Algorithms and Computation, ISAAC 2004"} +@string{isaac05 = "Proceedings of the 16th International Symposium on Algorithms and Computation, ISAAC 2005"} +@string{isaac06 = "Proceedings of the 17th International Symposium on Algorithms and Computation, ISAAC 2006"} +@string{isaac07 = "Proceedings of the 18th International Symposium on Algorithms and Computation, ISAAC 2007"} +@string{isaac08 = "Proceedings of the 19th International Symposium on Algorithms and Computation, ISAAC 2008"} +@string{isaac09 = "Proceedings of the 20th International Symposium on Algorithms and Computation, ISAAC 2009"} + +@string{iwpec04 = "Proceedings of the 1st International Workshop on Parameterized and Exact Computation, IWPEC 2004"} +@string{iwpec06 = "Proceedings of the 2nd International Workshop on Parameterized and Exact Computation, IWPEC 2006"} +@string{iwpec08 = "Proceedings of the 3rd International Workshop on Parameterized and Exact Computation, IWPEC 2008"} +@string{iwpec09 = "Proceedings of the 4th International Workshop on Parameterized and Exact Computation, IWPEC 2009"} + +@string{latin92 = "Proceedings of the 1st Latin American Symposium on Theoretical Informatics, LATIN'92"} +@string{latin95 = "Proceedings of the 2nd Latin American Symposium on Theoretical Informatics, LATIN'95"} +@string{latin98 = "Proceedings of the 3rd Latin American Symposium on Theoretical Informatics, LATIN'98"} +@string{latin00 = "Proceedings of the 4th Latin American Symposium on Theoretical Informatics, LATIN 2000"} +@string{latin02 = "Proceedings of the 5th Latin American Symposium on Theoretical Informatics, LATIN 2002"} +@string{latin04 = "Proceedings of the 6th Latin American Symposium on Theoretical Informatics, LATIN 2004"} +@string{latin06 = "Proceedings of the 7th Latin American Symposium on Theoretical Informatics, LATIN 2006"} +@string{latin08 = "Proceedings of the 8th Latin American Symposium on Theoretical Informatics, LATIN 2008"} + +@string{mfcs90 = "Proceedings of the 15th International Symposium on Mathematical Foundations of Computer Science, MFCS'90"} +@string{mfcs91 = "Proceedings of the 16th International Symposium on Mathematical Foundations of Computer Science, MFCS'91"} +@string{mfcs92 = "Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science, MFCS'92"} +@string{mfcs93 = "Proceedings of the 18th International Symposium on Mathematical Foundations of Computer Science, MFCS'93"} +@string{mfcs94 = "Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science, MFCS'94"} +@string{mfcs95 = "Proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science, MFCS'95"} +@string{mfcs96 = "Proceedings of the 21st International Symposium on Mathematical Foundations of Computer Science, MFCS'96"} +@string{mfcs97 = "Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science, MFCS'97"} +@string{mfcs98 = "Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science, MFCS'98"} +@string{mfcs99 = "Proceedings of the 24th International Symposium on Mathematical Foundations of Computer Science, MFCS'99"} +@string{mfcs00 = "Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science, MFCS 2000"} +@string{mfcs01 = "Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science, MFCS 2001"} +@string{mfcs02 = "Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002"} +@string{mfcs03 = "Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science, MFCS 2003"} +@string{mfcs04 = "Proceedings of the 29th International Symposium on Mathematical Foundations of Computer Science, MFCS 2004"} +@string{mfcs05 = "Proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science, MFCS 2005"} +@string{mfcs06 = "Proceedings of the 31st International Symposium on Mathematical Foundations of Computer Science, MFCS 2006"} +@string{mfcs07 = "Proceedings of the 32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007"} +@string{mfcs08 = "Proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2008"} +@string{mfcs09 = "Proceedings of the 34th International Symposium on Mathematical Foundations of Computer Science, MFCS 2009"} + +@string{soda90 = "Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'90"} +@string{soda91 = "Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'91"} +@string{soda92 = "Proceedings of the 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'92"} +@string{soda93 = "Proceedings of the 4th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'93"} +@string{soda94 = "Proceedings of the 5th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'94"} +@string{soda95 = "Proceedings of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'95"} +@string{soda96 = "Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'96"} +@string{soda97 = "Proceedings of the 8th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'97"} +@string{soda98 = "Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'98"} +@string{soda99 = "Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA'99"} +@string{soda00 = "Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2000"} +@string{soda01 = "Proceedings of the 12th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2001"} +@string{soda02 = "Proceedings of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002"} +@string{soda03 = "Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2003"} +@string{soda04 = "Proceedings of the 15th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2004"} +@string{soda05 = "Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2005"} +@string{soda06 = "Proceedings of the 16th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006"} +@string{soda07 = "Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2007"} +@string{soda08 = "Proceedings of the 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2008"} +@string{soda09 = "Proceedings of the 19th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2009"} + +@string{sofsem04 = "Proceedings of the 30th Conference on Current Trends in Theory and Practive of Computer Science, SOFSEM 2000"} +@string{sofsem05 = "Proceedings of the 31st Conference on Current Trends in Theory and Practive of Computer Science, SOFSEM 2005"} +@string{sofsem06 = "Proceedings of the 32nd Conference on Current Trends in Theory and Practive of Computer Science, SOFSEM 2006"} +@string{sofsem07 = "Proceedings of the 33rd Conference on Current Trends in Theory and Practive of Computer Science, SOFSEM 2007"} +@string{sofsem08 = "Proceedings of the 34th Conference on Current Trends in Theory and Practive of Computer Science, SOFSEM 2008"} +@string{sofsem09 = "Proceedings of the 35th Conference on Current Trends in Theory and Practive of Computer Science, SOFSEM 2009"} +@string{sofsem10 = "Proceedings of the 36th Conference on Current Trends in Theory and Practive of Computer Science, SOFSEM 2010"} + +@string{stacs84 = "Proceedings 1st International Symposium on Theoretical Aspects of Computer Science, STACS'84"} +@string{stacs85 = "Proceedings 2nd International Symposium on Theoretical Aspects of Computer Science, STACS'85"} +@string{stacs86 = "Proceedings 3rd International Symposium on Theoretical Aspects of Computer Science, STACS'86"} +@string{stacs87 = "Proceedings 4th International Symposium on Theoretical Aspects of Computer Science, STACS'87"} +@string{stacs88 = "Proceedings 5th International Symposium on Theoretical Aspects of Computer Science, STACS'88"} +@string{stacs89 = "Proceedings 6th International Symposium on Theoretical Aspects of Computer Science, STACS'89"} +@string{stacs90 = "Proceedings 7th International Symposium on Theoretical Aspects of Computer Science, STACS'90"} +@string{stacs91 = "Proceedings 8th International Symposium on Theoretical Aspects of Computer Science, STACS'91"} +@string{stacs92 = "Proceedings 9th International Symposium on Theoretical Aspects of Computer Science, STACS'92"} +@string{stacs93 = "Proceedings 10th International Symposium on Theoretical Aspects of Computer Science, STACS'93"} +@string{stacs94 = "Proceedings 11th International Symposium on Theoretical Aspects of Computer Science, STACS'94"} +@string{stacs95 = "Proceedings 12th International Symposium on Theoretical Aspects of Computer Science, STACS'95"} +@string{stacs96 = "Proceedings 13th International Symposium on Theoretical Aspects of Computer Science, STACS'96"} +@string{stacs97 = "Proceedings 14th International Symposium on Theoretical Aspects of Computer Science, STACS'97"} +@string{stacs98 = "Proceedings 15th International Symposium on Theoretical Aspects of Computer Science, STACS'98"} +@string{stacs99 = "Proceedings 16th International Symposium on Theoretical Aspects of Computer Science, STACS'99"} +@string{stacs00 = "Proceedings 17th International Symposium on Theoretical Aspects of Computer Science, STACS 2000"} +@string{stacs01 = "Proceedings 18th International Symposium on Theoretical Aspects of Computer Science, STACS 2001"} +@string{stacs02 = "Proceedings 19th International Symposium on Theoretical Aspects of Computer Science, STACS 2002"} +@string{stacs03 = "Proceedings 20th International Symposium on Theoretical Aspects of Computer Science, STACS 2003"} +@string{stacs04 = "Proceedings 21st International Symposium on Theoretical Aspects of Computer Science, STACS 2004"} +@string{stacs05 = "Proceedings 22nd International Symposium on Theoretical Aspects of Computer Science, STACS 2005"} +@string{stacs06 = "Proceedings 23rd International Symposium on Theoretical Aspects of Computer Science, STACS 2006"} +@string{stacs07 = "Proceedings 24th International Symposium on Theoretical Aspects of Computer Science, STACS 2007"} +@string{stacs08 = "Proceedings 25th International Symposium on Theoretical Aspects of Computer Science, STACS 2008"} +@string{stacs09 = "Proceedings 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009"} + +@string{stoc71 = "Proceedings of the 3rd Annual Symposium on Theory of Computing, STOC'71"} +@string{stoc72 = "Proceedings of the 4th Annual Symposium on Theory of Computing, STOC'72"} +@string{stoc73 = "Proceedings of the 5th Annual Symposium on Theory of Computing, STOC'73"} +@string{stoc74 = "Proceedings of the 6th Annual Symposium on Theory of Computing, STOC'74"} +@string{stoc75 = "Proceedings of the 7th Annual Symposium on Theory of Computing, STOC'75"} +@string{stoc76 = "Proceedings of the 8th Annual Symposium on Theory of Computing, STOC'76"} +@string{stoc77 = "Proceedings of the 9th Annual Symposium on Theory of Computing, STOC'77"} +@string{stoc78 = "Proceedings of the 10th Annual Symposium on Theory of Computing, STOC'78"} +@string{stoc79 = "Proceedings of the 11th Annual Symposium on Theory of Computing, STOC'79"} +@string{stoc80 = "Proceedings of the 12th Annual Symposium on Theory of Computing, STOC'80"} +@string{stoc81 = "Proceedings of the 13th Annual Symposium on Theory of Computing, STOC'81"} +@string{stoc82 = "Proceedings of the 14th Annual Symposium on Theory of Computing, STOC'82"} +@string{stoc83 = "Proceedings of the 15th Annual Symposium on Theory of Computing, STOC'83"} +@string{stoc84 = "Proceedings of the 16th Annual Symposium on Theory of Computing, STOC'84"} +@string{stoc85 = "Proceedings of the 17th Annual Symposium on Theory of Computing, STOC'85"} +@string{stoc86 = "Proceedings of the 18th Annual Symposium on Theory of Computing, STOC'86"} +@string{stoc87 = "Proceedings of the 19th Annual Symposium on Theory of Computing, STOC'87"} +@string{stoc88 = "Proceedings of the 20th Annual Symposium on Theory of Computing, STOC'88"} +@string{stoc89 = "Proceedings of the 21st Annual Symposium on Theory of Computing, STOC'89"} +@string{stoc90 = "Proceedings of the 22nd Annual Symposium on Theory of Computing, STOC'90"} +@string{stoc91 = "Proceedings of the 23rd Annual Symposium on Theory of Computing, STOC'91"} +@string{stoc92 = "Proceedings of the 24th Annual Symposium on Theory of Computing, STOC'92"} +@string{stoc93 = "Proceedings of the 25th Annual Symposium on Theory of Computing, STOC'93"} +@string{stoc94 = "Proceedings of the 26th Annual Symposium on Theory of Computing, STOC'94"} +@string{stoc95 = "Proceedings of the 27th Annual Symposium on Theory of Computing, STOC'95"} +@string{stoc96 = "Proceedings of the 28th Annual Symposium on Theory of Computing, STOC'96"} +@string{stoc97 = "Proceedings of the 29th Annual Symposium on Theory of Computing, STOC'97"} +@string{stoc98 = "Proceedings of the 30th Annual Symposium on Theory of Computing, STOC'98"} +@string{stoc99 = "Proceedings of the 31st Annual Symposium on Theory of Computing, STOC'99"} +@string{stoc00 = "Proceedings of the 32nd Annual Symposium on Theory of Computing, STOC 2000"} +@string{stoc01 = "Proceedings of the 33rd Annual Symposium on Theory of Computing, STOC 2001"} +@string{stoc02 = "Proceedings of the 34th Annual Symposium on Theory of Computing, STOC 2002"} +@string{stoc03 = "Proceedings of the 35th Annual Symposium on Theory of Computing, STOC 2003"} +@string{stoc04 = "Proceedings of the 36th Annual Symposium on Theory of Computing, STOC 2004"} +@string{stoc05 = "Proceedings of the 37th Annual Symposium on Theory of Computing, STOC 2005"} +@string{stoc06 = "Proceedings of the 38th Annual Symposium on Theory of Computing, STOC 2006"} +@string{stoc07 = "Proceedings of the 39th Annual Symposium on Theory of Computing, STOC 2007"} +@string{stoc08 = "Proceedings of the 40th Annual Symposium on Theory of Computing, STOC 2008"} +@string{stoc09 = "Proceedings of the 41st Annual Symposium on Theory of Computing, STOC 2009"} + +@string{swat88 = "Proceedings of the 1st Scandinavian Workshop on Algorithm Theory, SWAT'88"} +@string{swat90 = "Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory, SWAT'90"} +@string{swat92 = "Proceedings of the 3rd Scandinavian Workshop on Algorithm Theory, SWAT'92"} +@string{swat94 = "Proceedings of the 4th Scandinavian Workshop on Algorithm Theory, SWAT'94"} +@string{swat96 = "Proceedings of the 5th Scandinavian Workshop on Algorithm Theory, SWAT'96"} +@string{swat98 = "Proceedings of the 6th Scandinavian Workshop on Algorithm Theory, SWAT'98"} +@string{swat00 = "Proceedings of the 7th Scandinavian Workshop on Algorithm Theory, SWAT 2000"} +@string{swat02 = "Proceedings of the 8th Scandinavian Workshop on Algorithm Theory, SWAT 2002"} +@string{swat04 = "Proceedings of the 9th Scandinavian Workshop on Algorithm Theory, SWAT 2004"} +@string{swat06 = "Proceedings of the 10th Scandinavian Workshop on Algorithm Theory, SWAT 2006"} +@string{swat08 = "Proceedings of the 11th Scandinavian Workshop on Algorithm Theory, SWAT 2008"} + +@string{tamc08 = "Proceedings of the 5th Annual Conference on Theory and Applications +of Models of Computation, TAMC 2008"} +@string{tamc09 = "Proceedings of the 6th Annual Conference on Theory and Applications +of Models of Computation, TAMC 2009"} + +@string{uai90 = "Proceedings of the 6th Annual Conference on Uncertainty in Artificial Intelligence, UAI'90"} +@string{uai91 = "Proceedings of the 7th Annual Conference on Uncertainty in Artificial Intelligence, UAI'91"} +@string{uai92 = "Proceedings of the 8th Annual Conference on Uncertainty in Artificial Intelligence, UAI'92"} +@string{uai93 = "Proceedings of the 9th Annual Conference on Uncertainty in Artificial Intelligence, UAI'93"} +@string{uai94 = "Proceedings of the 10th Annual Conference on Uncertainty in Artificial Intelligence, UAI'94"} +@string{uai95 = "Proceedings of the 11th Annual Conference on Uncertainty in Artificial Intelligence, UAI'95"} +@string{uai96 = "Proceedings of the 12th Annual Conference on Uncertainty in Artificial Intelligence, UAI'96"} +@string{uai97 = "Proceedings of the 13th Annual Conference on Uncertainty in Artificial Intelligence, UAI'97"} +@string{uai98 = "Proceedings of the 14th Annual Conference on Uncertainty in Artificial Intelligence, UAI'98"} +@string{uai99 = "Proceedings of the 15th Annual Conference on Uncertainty in Artificial Intelligence, UAI'99"} +@string{uai00 = "Proceedings of the 16th Annual Conference on Uncertainty in Artificial Intelligence, UAI 2000"} +@string{uai01 = "Proceedings of the 17th Annual Conference on Uncertainty in Artificial Intelligence, UAI 2001"} +@string{uai02 = "Proceedings of the 18th Annual Conference on Uncertainty in Artificial Intelligence, UAI 2002"} +@string{uai03 = "Proceedings of the 19th Annual Conference on Uncertainty in Artificial Intelligence, UAI 2003"} +@string{uai04 = "Proceedings of the 20th Annual Conference on Uncertainty in Artificial Intelligence, UAI 2004"} +@string{uai05 = "Proceedings of the 21st Annual Conference on Uncertainty in Artificial Intelligence, UAI 2005"} +@string{uai06 = "Proceedings of the 22nd Annual Conference on Uncertainty in Artificial Intelligence, UAI 2006"} +@string{uai07 = "Proceedings of the 23rd Annual Conference on Uncertainty in Artificial Intelligence, UAI 2007"} +@string{uai08 = "Proceedings of the 24th Annual Conference on Uncertainty in Artificial Intelligence, UAI 2008"} +@string{uai09 = "Proceedings of the 25th Annual Conference on Uncertainty in Artificial Intelligence, UAI 2009"} + +@string{wads89 = "Proceedings of the 1st Workshop on Algorithms and Data Structures, WADS'89"} +@string{wads91 = "Proceedings of the 2nd Workshop on Algorithms and Data Structures, WADS'91"} +@string{wads93 = "Proceedings of the 3rd Workshop on Algorithms and Data Structures, WADS'93"} +@string{wads95 = "Proceedings of the 4th International Workshop on Algorithms and Data Structures, WADS'95"} +@string{wads97 = "Proceedings of the 5th International Workshop on Algorithms and Data Structures, WADS'97"} +@string{wads99 = "Proceedings of the 6th International Workshop on Algorithms and Data Structures, WADS'99"} +@string{wads01 = "Proceedings of the 7th International Workshop on Algorithms and Data Structures, WADS 2001"} +@string{wads03 = "Proceedings of the 8th International Workshop on Algorithms and Data Structures, WADS 2003"} +@string{wads05 = "Proceedings of the 9th International Workshop on Algorithms and Data Structures, WADS 2005"} +@string{wads07 = "Proceedings of the 10th International Workshop on Algorithms and Data Structures, WADS 2007"} +@string{wads09 = "Proceedings of the 11th International Symposium on Algorithms and Data Structures, WADS 2009"} + +@string{waoa03 = "Proceeings of the 1st International Workshop on Approximation and Online Algorithms, WAOA 2003"} +@string{waoa04 = "Proceeings of the 2nd International Workshop on Approximation and Online Algorithms, WAOA 2004"} +@string{waoa05 = "Proceeings of the 3rd International Workshop on Approximation and Online Algorithms, WAOA 2005"} +@string{waoa06 = "Proceeings of the 4th International Workshop on Approximation and Online Algorithms, WAOA 2006"} +@string{waoa07 = "Proceeings of the 5th International Workshop on Approximation and Online Algorithms, WAOA 2007"} +@string{waoa08 = "Proceeings of the 6th International Workshop on Approximation and Online Algorithms, WAOA 2008"} +@string{waoa09 = "Proceeings of the 7th International Workshop on Approximation and Online Algorithms, WAOA 2009"} + +@string{wea02 = "Proceedings of the 1st International Workshop on Experimental and Efficient Algorithms, WEA 2002"} +@string{wea03 = "Proceedings of the 2nd International Workshop on Experimental and Efficient Algorithms, WEA 2003"} +@string{wea04 = "Proceedings of the 3rd International Workshop on Experimental and Efficient Algorithms, WEA 2004"} +@string{wea05 = "Proceedings of the 4th International Workshop on Experimental and Efficient Algorithms, WEA 2005"} +@string{wea06 = "Proceedings of the 5th International Workshop on Experimental and Efficient Algorithms, WEA 2006"} +@string{wea07 = "Proceedings of the 6th International Workshop on Experimental and Efficient Algorithms, WEA 2007"} +@string{wea08 = "Proceedings of the 7th International Workshop on Experimental and Efficient Algorithms, WEA 2008"} +@string{sea09 = "Proceedings of the 8th International Symposium on Experimental and Efficient Algorithms, SEA 2009"} + +@string{wg82 = "Proceedings of the 8th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'82"} +@string{wg83 = "Proceedings of the 9th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'83"} +@string{wg84 = "Proceedings of the 10th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'84"} +@string{wg85 = "Proceedings of the 11th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'85"} +@string{wg86 = "Proceedings of the 12th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'86"} +@string{wg87 = "Proceedings of the 13th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'87"} +@string{wg88 = "Proceedings of the 14th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'88"} +@string{wg89 = "Proceedings of the 15th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'89"} +@string{wg90 = "Proceedings of the 16th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'90"} +@string{wg91 = "Proceedings of the 17th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'91"} +@string{wg92 = "Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'92"} +@string{wg93 = "Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'93"} +@string{wg94 = "Proceedings of the 20th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'94"} +@string{wg95 = "Proceedings of the 21st International Workshop on Graph-Theoretic Concepts in Computer Science, WG'95"} +@string{wg96 = "Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG'96"} +@string{wg97 = "Proceedings of the 23rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG'97"} +@string{wg98 = "Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'98"} +@string{wg99 = "Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science, WG'99"} +@string{wg00 = "Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2000"} +@string{wg01 = "Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2001"} +@string{wg02 = "Proceedings of the 28th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2002"} +@string{wg03 = "Proceedings of the 29th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2003"} +@string{wg04 = "Proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004"} +@string{wg05 = "Proceedings of the 31st International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2005"} +@string{wg06 = "Proceedings of the 32nd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2006"} +@string{wg07 = "Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2007"} +@string{wg08 = "Proceedings of the 34th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2008"} +@string{wg09 = "Proceedings of the 35th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2009"} + +% Stings for the names of Springer LNCS proceedings + +@string{lncs52 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 52"} +@string{lncs172 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 172"} +@string{lncs182 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 182"} +@string{lncs199 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 199"} +@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{lncs267 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 267"} +@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{lncs411 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 411"} +@string{lncs452 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 452"} +@string{lncs477 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 477"} +@string{lncs484 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 484"} +@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{lncs790 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 790"} +@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{lncs944 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 944"} +@string{lncs945 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 945"} +@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{lncs1018 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1018"} +@string{lncs1028 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1028"} +@string{lncs1046 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1046"} +@string{lncs1075 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1075"} +@string{lncs1090 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1090"} +@string{lncs1136 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1136"} +@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{lncs1295 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1295"} +@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{lncs1851 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1851"} +@string{lncs1893 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1893"} +@string{lncs1969 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 1969"} +@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{lncs2518 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2518"} +@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{lncs2719 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2719"} +@string{lncs2747 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2747"} +@string{lncs2751 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2751"} +@string{lncs2832 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2832"} +@string{lncs2880 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2880"} +@string{lncs2906 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2906"} +@string{lncs2996 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 2996"} +@string{lncs3153 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3153"} +@string{lncs3142 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3142"} +@string{lncs3162 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3162"} +@string{lncs3221 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3221"} +@string{lncs3353 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3353"} +@string{lncs3381 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3381"} +@string{lncs3404 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3404"} +@string{lncs3503 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3503"} +@string{lncs3580 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3580"} +@string{lncs3595 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3595"} +@string{lncs3608 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3608"} +@string{lncs3618 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3618"} +@string{lncs3624 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3624"} +@string{lncs3669 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3669"} +@string{lncs3787 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3787"} +@string{lncs3732 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3732"} +@string{lncs3709 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3709"} +@string{lncs3827 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3827"} +@string{lncs3831 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3831"} +@string{lncs3843 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3843"} +@string{lncs3879 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3879"} +@string{lncs3887 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 3887"} +@string{lncs4041 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 4041"} +@string{lncs4059 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 4059"} +@string{lncs4168 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 4168"} +@string{lncs4169 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 4169"} +@string{lncs4271 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 4271"} +@string{lncs4337 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 4337"} +@string{lncs4372 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 4372"} +@string{lncs4393 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 4393"} +@string{lncs4474 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 4474"} +@string{lncs4475 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 4475"} +@string{lncs4596 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 4596"} +@string{lncs4598 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 4598"} +@string{lncs4614 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 4614"} +@string{lncs4769 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 4769"} +@string{lncs4835 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 4835"} +@string{lncs4957 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 4957"} +@string{lncs4978 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 4978"} +@string{lncs5018 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 5018"} +@string{lncs5038 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 5038"} +@string{lncs5125 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 5125"} +@string{lncs5162 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 5162"} +@string{lncs5344 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 5344"} +@string{lncs5369 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 5369"} +@string{lncs5404 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 5404"} +@string{lncs5532 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 5532"} +@string{lncs5555 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 5555"} +@string{lncs5734 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 5734"} +@string{lncs5757 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 5757"} +@string{lncs5901 = "Springer Verlag, Lecture Notes in Computer Science, vol.\ 5901"} + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding1.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding1.bcf new file mode 100644 index 00000000000..cab77a44d3b --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding1.bcf @@ -0,0 +1,228 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">encoding1.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>*</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding1.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding1.bib new file mode 100644 index 00000000000..6c2467a70b0 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding1.bib @@ -0,0 +1,9 @@ +% -*- coding: latin-9-unix -*- +% This is a latin9 encoded file (Notice the "LATIN CAPITAL LETTER S WITH CARON"). +% The top line is a hint to Emacs to open in the right encoding +@BOOK{test¦, + YEAR = {1999}, + AUTHOR = {Edward Encalcer}, + TITLE = {¦ome title}, + PUBLISHER = {A press} +} diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding2.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding2.bcf new file mode 100644 index 00000000000..3c3032b2ef3 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding2.bcf @@ -0,0 +1,228 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">encoding2.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>*</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding2.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding2.bib new file mode 100644 index 00000000000..6c4e5cb21cd --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding2.bib @@ -0,0 +1,7 @@ +% This is a UTF-8 encoded file +@BOOK{testÅ , + YEAR = {1999}, + AUTHOR = {Edward Encalcer}, + TITLE = {Å ome title}, + PUBLISHER = {A press} +} diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding3.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding3.bcf new file mode 100644 index 00000000000..5cc417828db --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding3.bcf @@ -0,0 +1,228 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">encoding3.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>*</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding3.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding3.bib new file mode 100644 index 00000000000..9cb493e81c8 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding3.bib @@ -0,0 +1,9 @@ +% -*- coding: latin-1-unix -*- +% This is a latin1 encoded file (Notice the "LATIN SMALL LETTER O WITH DIAERESIS"). +% The top line is a hint to Emacs to open in the right encoding +@BOOK{test1, + YEAR = {1999}, + AUTHOR = {Edward Encalcer}, + TITLE = {Söme title}, + PUBLISHER = {A press} +} diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding4.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding4.bcf new file mode 100644 index 00000000000..fbab8926441 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding4.bcf @@ -0,0 +1,228 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">encoding4.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>*</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding4.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding4.bib new file mode 100644 index 00000000000..ccee48c625c --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding4.bib @@ -0,0 +1,9 @@ +% -*- coding: latin-2-unix -*- +% This is a latin2 encoded file (Notice the "LATIN CAPITAL LETTER Z WITH DOT ABOVE"). +% The top line is a hint to Emacs to open in the right encoding +@BOOK{test1, + YEAR = {1999}, + AUTHOR = {Edward Encalcer}, + TITLE = {¯ome title}, + PUBLISHER = {A press} +} diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding5.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding5.bcf new file mode 100644 index 00000000000..ea5c3b02ce8 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding5.bcf @@ -0,0 +1,228 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">encoding5.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>*</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding5.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding5.bib new file mode 100644 index 00000000000..daaa1aa51b3 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding5.bib @@ -0,0 +1,7 @@ +% This is a UTF-8 encoded file +@BOOK{test, + AUTHOR = {Edward Encalcer}, + YEAR = {1999}, + TITLE = {à titlé}, + PUBLISHER = {A press} +} diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding6.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding6.bcf new file mode 100644 index 00000000000..d11d154523f --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding6.bcf @@ -0,0 +1,228 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">encoding6.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>*</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding6.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding6.bib new file mode 100644 index 00000000000..3f4f8497def --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/encoding6.bib @@ -0,0 +1,7 @@ +% This is a UTF-8 encoded file +@BOOK{test, + AUTHOR = {Edward Encalcer}, + YEAR = {1999}, + TITLE = {↑à titlé}, + PUBLISHER = {A press} +} diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/examples.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/examples.bib new file mode 100644 index 00000000000..1af8356cd20 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/examples.bib @@ -0,0 +1,1397 @@ +@STRING{anch-ie = {Angew.~Chem. Int.~Ed.} } +@STRING{cup = {Cambridge University Press} } +@STRING{dtv = {Deutscher Taschenbuch-Verlag} } +@STRING{hup = {Harvard University Press} } +@STRING{jams = {J.~Amer. Math. Soc.} } +@STRING{jchph = {J.~Chem. Phys.} } +@STRING{jomch = {J.~Organomet. Chem.} } +@STRING{pup = {Princeton University Press} } + +@InCollection{westfahl:space, + crossref = {westfahl:frontier}, + hyphenation = {american}, + author = {Westfahl, Gary}, + indextitle = {True Frontier, The}, + title = {The True Frontier}, + subtitle = {Confronting and Avoiding the Realities of Space in American Science Fiction + Films}, + pages = {55--65}, + annotation = {A cross-referenced article from a \texttt{collection}. This is an + \texttt{incollection} entry with a \texttt{crossref} field. Note the + \texttt{subtitle} and \texttt{indextitle} fields} +} + +@Set{set, + crossref = {set:herrmann}, + entryset = {set:herrmann,set:aksin,set:yoon}, + annotation = {A \texttt{set} entry with three members. Note the \texttt{entryset} and + \texttt{crossref} fields. The cross-reference must point to the first member of + the set} +} + +@Set{stdmodel, + crossref = {stdmodel:glashow}, + entryset = {stdmodel:glashow,stdmodel:weinberg,stdmodel:salam}, + annotation = {A \texttt{set} entry with three members discussing the standard model of + particle physics.} +} + +@Set{stdmodel:ps_sc, + presort = {zs}, + crossref = {stdmodel:glashow}, + entryset = {stdmodel:glashow,stdmodel:weinberg,stdmodel:salam}, + annotation = {A \texttt{set} entry with three members discussing the standard model of + particle physics. Note the \texttt{entryset} and \texttt{crossref} fields. The + cross-reference must point to the first member of the set} +} + +@Article{angenendt, + hyphenation = {german}, + author = {Angenendt, Arnold}, + indextitle = {In Honore Salvatoris}, + title = {In Honore Salvatoris~-- Vom Sinn und Unsinn der Patrozinienkunde}, + shorttitle = {In Honore Salvatoris}, + journaltitle = {Revue d'Histoire Eccl{\'e}siastique}, + volume = {97}, + year = {2002}, + pages = {431--456, 791--823}, + annotation = {A German article in a French journal. Apart from that, a typical + \texttt{article} entry. Note the \texttt{indextitle} field} +} + +@Article{angenendtsk, + sortkey = {AATESTKEY}, + hyphenation = {german}, + author = {Angenendt, Arnold}, + indextitle = {In Honore Salvatoris}, + title = {In Honore Salvatoris~-- Vom Sinn und Unsinn der Patrozinienkunde}, + shorttitle = {In Honore Salvatoris}, + journaltitle = {Revue d'Histoire Eccl{\'e}siastique}, + volume = {97}, + year = {2002}, + pages = {431--456, 791--823}, + annotation = {A German article in a French journal. Apart from that, a typical + \texttt{article} entry. Note the \texttt{indextitle} field} +} + +@Article{angenendtsa, + hyphenation = {german}, + shortauthor = {AA}, + author = {Angenendt, Arnold}, + indextitle = {In Honore Salvatoris}, + title = {In Honore Salvatoris~-- Vom Sinn und Unsinn der Patrozinienkunde}, + shorttitle = {In Honore Salvatoris}, + journaltitle = {Revue d'Histoire Eccl{\'e}siastique}, + volume = {97}, + year = {2002}, + pages = {431--456, 791--823}, + annotation = {A German article in a French journal. Apart from that, a typical + \texttt{article} entry. Note the \texttt{indextitle} field} +} + +@Article{baez/article, + hyphenation = {american}, + author = {Baez, John C. and Lauda, Aaron D.}, + title = {Higher-Dimensional Algebra V: 2-Groups}, + journaltitle = {Theory and Applications of Categories}, + volume = {12}, + version = {3}, + date = {2004}, + pages = {423--491}, + eprint = {math/0307200v3}, + eprinttype = {arxiv}, + annotation = {An \texttt{article} with \texttt{eprint} and \texttt{eprinttype} fields. Note + that the arXiv reference is transformed into a clickable link if + \texttt{hyperref} support has been enabled. Compare \texttt{baez\slash online} + which is the same item given as an \texttt{online} entry} +} + +@Article{bertram, + hyphenation = {american}, + author = {Bertram, Aaron and Wentworth, Richard}, + title = {Gromov invariants for holomorphic maps on Riemann surfaces}, + shorttitle = {Gromov invariants}, + journaltitle = jams, + volume = {9}, + number = {2}, + year = {1996}, + pages = {529--571}, + annotation = {An \texttt{article} entry with a \texttt{volume} and a \texttt{number} field} +} + +@Article{gillies, + hyphenation = {british}, + author = {Gillies, Alexander}, + title = {Herder and the Preparation of Goethe's Idea of World Literature}, + journaltitle = {Publications of the English Goethe Society}, + volume = {9}, + series = {newseries}, + year = {1933}, + pages = {46--67}, + annotation = {An \texttt{article} entry with a \texttt{series} and a \texttt{volume} field. + Note that format of the \texttt{series} field in the database file} +} + +@Article{kastenholz, + hyphenation = {american}, + author = {Kastenholz, M. A. and H{\"u}nenberger, Philippe H.}, + indextitle = {Computation of ionic solvation free energies}, + title = {Computation of methodology\hyphen independent ionic solvation free energies + from molecular simulations}, + subtitle = {I. The electrostatic potential in molecular liquids}, + journaltitle = jchph, + volume = {124}, + eid = {124106}, + year = {2006}, + doi = {10.1063/1.2172593}, + annotation = {An \texttt{article} entry with an \texttt{eid} and a \texttt{doi} field. Note + that the \textsc{doi} is transformed into a clickable link if \texttt{hyperref} + support has been enabled}, + abstract = {The computation of ionic solvation free energies from atomistic simulations is + a surprisingly difficult problem that has found no satisfactory solution for + more than 15 years. The reason is that the charging free energies evaluated from + such simulations are affected by very large errors. One of these is related to + the choice of a specific convention for summing up the contributions of solvent + charges to the electrostatic potential in the ionic cavity, namely, on the basis + of point charges within entire solvent molecules (M scheme) or on the basis of + individual point charges (P scheme). The use of an inappropriate convention may + lead to a charge-independent offset in the calculated potential, which depends + on the details of the summation scheme, on the quadrupole-moment trace of the + solvent molecule, and on the approximate form used to represent electrostatic + interactions in the system. However, whether the M or P scheme (if any) + represents the appropriate convention is still a matter of on-going debate. The + goal of the present article is to settle this long-standing controversy by + carefully analyzing (both analytically and numerically) the properties of the + electrostatic potential in molecular liquids (and inside cavities within + them).} +} + +@Article{murray, + hyphenation = {american}, + author = {Hostetler, Michael J. and Wingate, Julia E. and Zhong, Chuan-Jian and Harris, + Jay E. and Vachet, Richard W. and Clark, Michael R. and Londono, J. David and + Green, Stephen J. and Stokes, Jennifer J. and Wignall, George D. and Glish, Gary + L. and Porter, Marc D. and Evans, Neal D. and Murray, Royce W.}, + indextitle = {Alkanethiolate gold cluster molecules}, + title = {Alkanethiolate gold cluster molecules with core diameters from 1.5 to 5.2~nm}, + subtitle = {Core and monolayer properties as a function of core size}, + shorttitle = {Alkanethiolate gold cluster molecules}, + journaltitle = {Langmuir}, + volume = {14}, + number = {1}, + year = {1998}, + pages = {17--30}, + annotation = {An \texttt{article} entry with \arabic{author} authors. By default, long author + and editor lists are automatically truncated. This is configurable} +} + +@Article{reese, + hyphenation = {american}, + author = {Reese, Trevor R.}, + title = {Georgia in Anglo-Spanish Diplomacy, 1736-1739}, + journaltitle = {William and Mary Quarterly}, + volume = {15}, + series = {3}, + year = {1958}, + pages = {168--190}, + annotation = {An \texttt{article} entry with a \texttt{series} and a \texttt{volume} field. + Note the format of the series. If the value of the \texttt{series} field is an + integer, this number is printed as an ordinal and the string \enquote*{series} + is appended automatically} +} + +@Article{set:aksin, + entryset = {set}, + author = {Aks{\i}n, {\"O}zge and T{\"u}rkmen, Hayati and Artok, Levent and + {\k{C}}etinkaya, Bekir and Ni, Chaoying and B{\"u}y{\"u}kg{\"u}ng{\"o}r, Orhan + and {\"O}zkal, Erhan}, + indextitle = {Effect of immobilization on catalytic characteristics}, + title = {Effect of immobilization on catalytic characteristics of saturated + Pd-N-heterocyclic carbenes in Mizoroki-Heck reactions}, + journaltitle = jomch, + volume = {691}, + number = {13}, + year = {2006}, + month = {02}, + pages = {3027--3036} +} + +@Article{set:herrmann, + entryset = {set}, + author = {Herrmann, Wolfgang A. and {\"O}fele, Karl and Schneider, Sabine K. and + Herdtweck, Eberhardt and Hoffmann, Stephan D.}, + indextitle = {Carbocyclic carbene as an efficient catalyst, A}, + title = {A carbocyclic carbene as an efficient catalyst ligand for C--C coupling + reactions}, + journaltitle = anch-ie, + volume = {45}, + number = {23}, + year = {2006}, + pages = {3859--3862} +} + +@Article{set:yoon, + entryset = {set}, + author = {Yoon, Myeong S. and Ryu, Dowook and Kim, Jeongryul and Ahn, Kyo Han}, + indextitle = {Palladium pincer complexes}, + title = {Palladium pincer complexes with reduced bond angle strain: efficient catalysts + for the Heck reaction}, + journaltitle = {Organometallics}, + volume = {25}, + number = {10}, + year = {2006}, + pages = {2409--2411} +} + +@Article{shore, + author = {Shore, Bradd}, + title = {Twice-Born, Once Conceived}, + subtitle = {Meaning Construction and Cultural Cognition}, + journaltitle = {American Anthropologist}, + volume = {93}, + series = {newseries}, + number = {1}, + month = mar, + year = {1991}, + pages = {9--27}, + annotation = {An \texttt{article} entry with \texttt{series}, \texttt{volume}, and + \texttt{number} fields. Note the format of the \texttt{series} which is a + localization key} +} + +@Article{sigfridsson, + hyphenation = {american}, + author = {Sigfridsson, Emma and Ryde, Ulf}, + indextitle = {Methods for deriving atomic charges}, + title = {Comparison of methods for deriving atomic charges from the electrostatic + potential and moments}, + journaltitle = {Journal of Computational Chemistry}, + volume = {19}, + number = {4}, + year = {1998}, + doi = {10.1002/(SICI)1096-987X(199803)19:4<377::AID-JCC1>3.0.CO;2-P}, + pages = {377--395}, + annotation = {An \texttt{article} entry with \texttt{volume}, \texttt{number}, and + \texttt{doi} fields. Note that the \textsc{doi} is transformed into a clickable + link if \texttt{hyperref} support has been enabled}, + abstract = { Four methods for deriving partial atomic charges from the quantum chemical + electrostatic potential (CHELP, CHELPG, Merz-Kollman, and RESP) have been + compared and critically evaluated. It is shown that charges strongly depend on + how and where the potential points are selected. Two alternative methods are + suggested to avoid the arbitrariness in the point-selection schemes and van der + Waals exclusion radii: CHELP-BOW, which also estimates the charges from the + electrostatic potential, but with potential points that are Boltzmann-weighted + after their occurrence in actual simulations using the energy function of the + program in which the charges will be used, and CHELMO, which estimates the + charges directly from the electrostatic multipole moments. Different criteria + for the quality of the charges are discussed.} +} + +@Article{spiegelberg, + hyphenation = {german}, + sorttitle = {Intention und Intentionalitat in der Scholastik, bei Brentano und Husserl}, + indexsorttitle = {Intention und Intentionalitat in der Scholastik, bei Brentano und Husserl}, + author = {Spiegelberg, Herbert}, + title = {\mkbibquote{Intention} und \mkbibquote{Intentionalit{\"a}t} in der Scholastik, bei + Brentano und Husserl}, + shorttitle = {Intention und Intentionalit{\"a}t}, + journaltitle = {Studia Philosophica}, + volume = {29}, + year = {1969}, + pages = {189--216}, + annotation = {An \texttt{article} entry. Note the \texttt{sorttitle} and + \texttt{indexsorttitle} fields and the markup of the quotes in the database file} +} + +@Article{springer, + hyphenation = {british}, + author = {Springer, Otto}, + title = {Mediaeval Pilgrim Routes from Scandinavia to Rome}, + shorttitle = {Mediaeval Pilgrim Routes}, + journaltitle = {Mediaeval Studies}, + volume = {12}, + year = {1950}, + pages = {92--122}, + annotation = {A plain \texttt{article} entry} +} + +@Article{stdmodel:glashow, + entryset = {stdmodel}, + author = {Glashow, Sheldon}, + title = {Partial Symmetries of Weak Interactions}, + journaltitle = {Nucl.~Phys.}, + volume = {22}, + year = {1961}, + pages = {579\psqq} +} + +@Article{stdmodel:weinberg, + entryset = {stdmodel}, + author = {Weinberg, Steven}, + title = {A Model of Leptons}, + journaltitle = {Phys.~Rev.~Lett.}, + volume = {19}, + year = {1967}, + pages = {1264\psqq} +} + +@Book{aristotle:anima, + keywords = {primary}, + hyphenation = {british}, + author = {Aristotle}, + editor = {Hicks, Robert Drew}, + title = {De Anima}, + publisher = cup, + location = {Cambridge}, + year = {1907}, + annotation = {A \texttt{book} entry with an \texttt{author} and an \texttt{editor}} +} + +@Book{aristotle:physics, + keywords = {primary}, + hyphenation = {american}, + author = {Aristotle}, + translator = {Wicksteed, P. H. and Cornford, F. M.}, + title = {Physics}, + shorttitle = {Physics}, + publisher = {G. P. Putnam}, + location = {New York}, + year = {1929}, + annotation = {A \texttt{book} entry with a \texttt{translator} field} +} + +@Book{aristotle:poetics, + keywords = {primary}, + hyphenation = {british}, + author = {Aristotle}, + editor = {Lucas, D. W.}, + title = {Poetics}, + shorttitle = {Poetics}, + series = {Clarendon Aristotle}, + publisher = {Clarendon Press}, + location = {Oxford}, + year = {1968}, + annotation = {A \texttt{book} entry with an \texttt{author} and an \texttt{editor} as well as + a \texttt{series} field} +} + +@Book{aristotle:rhetoric, + keywords = {primary}, + hyphenation = {british}, + sorttitle = {Rhetoric of Aristotle}, + author = {Aristotle}, + editor = {Cope, Edward Meredith}, + commentator = {Cope, Edward Meredith}, + indextitle = {Rhetoric of Aristotle, The}, + title = {The Rhetoric of Aristotle with a commentary by the late Edward Meredith Cope}, + shorttitle = {Rhetoric}, + volumes = {3}, + publisher = cup, + year = {1877}, + annotation = {A commented edition. Note the concatenation of the \texttt{editor} and + \texttt{commentator} fields as well as the \texttt{volumes}, \texttt{sorttitle}, + and \texttt{indextitle} fields} +} + +@Book{augustine, + hyphenation = {american}, + author = {Augustine, Robert L.}, + title = {Heterogeneous catalysis for the synthetic chemist}, + shorttitle = {Heterogeneous catalysis}, + publisher = {Marcel Dekker}, + location = {New York}, + year = {1995}, + annotation = {A plain \texttt{book} entry} +} + +@Book{averroes/bland, + keywords = {primary}, + hyphenation = {american}, + author = {Averroes}, + editor = {Bland, Kalman P.}, + translator = {Bland, Kalman P.}, + indextitle = {Epistle on the Possibility of Conjunction, The}, + title = {The Epistle on the Possibility of Conjunction with the Active Intellect by Ibn + Rushd with the Commentary of Moses Narboni}, + shorttitle = {Possibility of Conjunction}, + series = {Moreshet: Studies in Jewish History, Literature and Thought}, + number = {7}, + publisher = {Jewish Theological Seminary of America}, + location = {New York}, + year = {1982}, + annotation = {A \texttt{book} entry with a \texttt{series} and a \texttt{number}. Note the + concatenation of the \texttt{editor} and \texttt{translator} fields as well as + the \texttt{indextitle} field} +} + +@Book{averroes/hannes, + keywords = {primary}, + hyphenation = {german}, + sorttitle = {Uber die Moglichkeit der Conjunktion}, + indexsorttitle = {Uber die Moglichkeit der Conjunktion}, + author = {Averroes}, + editor = {Hannes, Ludwig}, + translator = {Hannes, Ludwig}, + annotator = {Hannes, Ludwig}, + indextitle = {{\"U}ber die M{\"o}glichkeit der Conjunktion}, + title = {Des Averro{\"e}s Abhandlung: \mkbibquote{{\"U}ber die M{\"o}glichkeit der + Conjunktion} oder \mkbibquote{{\"U}ber den materiellen Intellekt}}, + shorttitle = {M{\"o}glichkeit der Conjunktion}, + publisher = {C.~A. Kaemmerer}, + location = {Halle an der Saale}, + year = {1892}, + annotation = {An annotated edition. Note the concatenation of the \texttt{editor}, + \texttt{translator}, and \texttt{annotator} fields. Also note the + \texttt{shorttitle}, \texttt{indextitle}, \texttt{sorttitle}, and + \texttt{indexsorttitle} fields} +} + +@Book{averroes/hercz, + keywords = {primary}, + hyphenation = {german}, + indexsorttitle = {Drei Abhandlungen uber die Conjunction}, + author = {Averroes}, + editor = {Hercz, J.}, + translator = {Hercz, J.}, + indextitle = {Drei Abhandlungen {\"u}ber die Conjunction}, + title = {Drei Abhandlungen {\"u}ber die Conjunction des separaten Intellects mit dem + Menschen}, + subtitle = {Von Averroes (Vater und Sohn), aus dem Arabischen {\"u}bersetzt von Samuel Ibn + Tibbon}, + shorttitle = {Drei Abhandlungen}, + publisher = {S.~Hermann}, + location = {Berlin}, + year = {1869}, + annotation = {A \texttt{book} entry. Note the concatenation of the \texttt{editor} and + \texttt{translator} fields as well as the \texttt{indextitle} and + \texttt{indexsorttitle} fields} +} + +@Book{cicero, + hyphenation = {german}, + author = {Cicero, Marcus Tullius}, + editor = {Blank-Sangmeister, Ursula}, + translator = {Blank-Sangmeister, Ursula}, + afterword = {Thraede, Klaus}, + indextitle = {De natura deorum}, + title = {De natura deorum. {\"U}ber das Wesen der G{\"o}tter}, + shorttitle = {De natura deorum}, + language = {langlatin and langgerman}, + publisher = {Reclam}, + location = {Stuttgart}, + year = {1995}, + annotation = {A bilingual edition of Cicero's \emph{De natura deorum}, with a German + translation. Note the format of the \texttt{language} field in the database + file, the concatenation of the \texttt{editor} and \texttt{translator} fields, + and the \texttt{afterword} field} +} + +@Book{coleridge, + hyphenation = {british}, + author = {Coleridge, Samuel Taylor}, + editor = {Coburn, Kathleen and Engell, James and Bate, W. Jackson}, + indextitle = {Biographia literaria}, + title = {Biographia literaria, or Biographical sketches of my literary life and + opinions}, + shorttitle = {Biographia literaria}, + maintitle = {The collected works of Samuel Taylor Coleridge}, + part = {2}, + volume = {7}, + series = {Bollingen Series}, + number = {75}, + publisher = {Routledge and Kegan Paul}, + location = {London}, + year = {1983}, + annotation = {One (partial) volume of a multivolume book. This is a \texttt{book} entry with + a \texttt{volume} and a \texttt{part} field which explicitly refers to the + second (physical) part of the seventh (logical) volume. Also note the + \texttt{series} and \texttt{number} fields} +} + +@Book{companion, + hyphenation = {american}, + sorttitle = {LaTeX Companion}, + author = {Goossens, Michel and Mittelbach, Frank and Samarin, Alexander}, + indextitle = {LaTeX Companion, The}, + title = {The LaTeX Companion}, + shorttitle = {LaTeX Companion}, + edition = {1}, + publisher = {Addison-Wesley}, + location = {Reading, Mass.}, + year = {1994}, + annotation = {A book with three authors. Note the formatting of the author list. By default, + only the first name is reversed in the bibliography} +} + +@Book{cotton, + hyphenation = {british}, + author = {Cotton, Frank Albert and Wilkinson, Geoffrey and Murillio, Carlos A. and + Bochmann, Manfred}, + title = {Advanced inorganic chemistry}, + edition = {6}, + publisher = {Wiley}, + location = {Chichester}, + year = {1999}, + annotation = {A \texttt{book} entry with \arabic{author} authors and an \texttt{edition} + field. By default, long \texttt{author} and \texttt{editor} lists are + automatically truncated. This is configurable} +} + +@Book{gerhardt, + hyphenation = {american}, + sorttitle = {Federal Appointments Process}, + author = {Gerhardt, Michael J.}, + indextitle = {Federal Appointments Process, The}, + title = {The Federal Appointments Process}, + subtitle = {A Constitutional and Historical Analysis}, + shorttitle = {Federal Appointments Process}, + publisher = {Duke University Press}, + location = {Durham and London}, + year = {2000}, + annotation = {This is a \texttt{book} entry. Note the format of the \texttt{location} field + as well as the \texttt{sorttitle} and \texttt{indextitle} fields} +} + +@Book{gonzalez, + hyphenation = {american}, + sorttitle = {Ghost of John Wayne and Other Stories}, + author = {Gonzalez, Ray}, + indextitle = {Ghost of John Wayne and Other Stories, The}, + title = {The Ghost of John Wayne and Other Stories}, + shorttitle = {Ghost of John Wayne}, + publisher = {The University of Arizona Press}, + location = {Tucson}, + year = {2001}, + isbn = {0-816-52066-6}, + annotation = {A collection of short stories. This is a \texttt{book} entry. Note the + \texttt{sorttitle} and \texttt{indextitle} fields in the database file. There's + also an \texttt{isbn} field} +} + +@Book{hammond, + hyphenation = {british}, + sorttitle = {Basics of crystallography and diffraction}, + author = {Hammond, Christopher}, + indextitle = {Basics of crystallography and diffraction, The}, + title = {The basics of crystallography and diffraction}, + shorttitle = {Crystallography and diffraction}, + publisher = {International Union of Crystallography and Oxford University Press}, + location = {Oxford}, + year = {1997}, + annotation = {A \texttt{book} entry. Note the \texttt{sorttitle} and \texttt{indextitle} + fields as well as the format of the \texttt{publisher} field} +} + +@Book{iliad, + hyphenation = {german}, + sorttitle = {Ilias}, + author = {Homer}, + translator = {Schadewaldt, Wolfgang}, + introduction = {Latacz, Joachim}, + indextitle = {Ilias, Die}, + title = {Die Ilias}, + shorttitle = {Ilias}, + edition = {3}, + publisher = {Artemis \& Winkler}, + location = {D{\"u}sseldorf and Z{\"u}rich}, + year = {2004}, + annotation = {A German translation of the \emph{Iliad}. Note the \texttt{translator} and + \texttt{introduction} fields and the format of the \texttt{location} field in + the database file. Also note the \texttt{sorttitle} and \texttt{indextitle} fields} +} + +@Book{knuth:ct, + hyphenation = {american}, + sortyear = {1984-0}, + sorttitle = {Computers & Typesetting}, + indexsorttitle = {Computers & Typesetting}, + author = {Knuth, Donald E.}, + title = {Computers \& Typesetting}, + volumes = {5}, + publisher = {Addison-Wesley}, + location = {Reading, Mass.}, + date = {1984/1986}, + annotation = {A five-volume book cited as a whole. This is a \texttt{book} entry, note the + \texttt{volumes} field} +} + +@Book{knuth:ct:a, + hyphenation = {american}, + sortyear = {1984-1}, + sorttitle = {Computers & Typesetting A}, + indexsorttitle = {The TeXbook}, + author = {Knuth, Donald E.}, + indextitle = {\TeX book, The}, + title = {The \TeX book}, + shorttitle = {\TeX book}, + maintitle = {Computers \& Typesetting}, + volume = {A}, + publisher = {Addison-Wesley}, + location = {Reading, Mass.}, + year = {1984}, + annotation = {The first volume of a five-volume book. Note the \texttt{sorttitle} and + \texttt{sortyear} fields. We want this volume to be listed after the entry + referring to the entire five-volume set. Also note the \texttt{indextitle} and + \texttt{indexsorttitle} fields} +} + +@Book{knuth:ct:b, + hyphenation = {american}, + sortyear = {1984-2}, + sorttitle = {Computers & Typesetting B}, + indexsorttitle = {TeX: The Program}, + author = {Knuth, Donald E.}, + title = {\TeX: The Program}, + shorttitle = {\TeX}, + maintitle = {Computers \& Typesetting}, + volume = {B}, + publisher = {Addison-Wesley}, + location = {Reading, Mass.}, + year = {1986}, + annotation = {The second volume of a five-volume book. Note the \texttt{sorttitle} and + \texttt{sortyear} fields. Also note the \texttt{indexsorttitle} field} +} + +@Book{knuth:ct:c, + hyphenation = {american}, + sortyear = {1984-3}, + sorttitle = {Computers & Typesetting C}, + author = {Knuth, Donald E.}, + indextitle = {METAFONTbook, The}, + title = {The METAFONTbook}, + shorttitle = {METAFONTbook}, + maintitle = {Computers \& Typesetting}, + volume = {C}, + publisher = {Addison-Wesley}, + location = {Reading, Mass.}, + year = {1986}, + annotation = {The third volume of a five-volume book. Note the \texttt{sorttitle} and + \texttt{sortyear} fields as well as the \texttt{indextitle} field} +} + +@Book{knuth:ct:d, + hyphenation = {american}, + sortyear = {1984-4}, + sorttitle = {Computers & Typesetting D}, + author = {Knuth, Donald E.}, + title = {METAFONT: The Program}, + shorttitle = {METAFONT}, + maintitle = {Computers \& Typesetting}, + volume = {D}, + publisher = {Addison-Wesley}, + location = {Reading, Mass.}, + year = {1986}, + annotation = {The fourth volume of a five-volume book. Note the \texttt{sorttitle} and + \texttt{sortyear} fields} +} + +@Book{knuth:ct:e, + hyphenation = {american}, + sortyear = {1984-5}, + sorttitle = {Computers & Typesetting E}, + author = {Knuth, Donald E.}, + title = {Computer Modern Typefaces}, + maintitle = {Computers \& Typesetting}, + volume = {E}, + publisher = {Addison-Wesley}, + location = {Reading, Mass.}, + year = {1986}, + annotation = {The fifth volume of a five-volume book. Note the \texttt{sorttitle} and + \texttt{sortyear} fields} +} + +@Book{malinowski, + hyphenation = {british}, + author = {Malinowski, Bronis{\l}aw}, + title = {Argonauts of the Western Pacific}, + subtitle = {An account of native enterprise and adventure in the Archipelagoes of + Melanesian New Guinea}, + shorttitle = {Argonauts}, + edition = {8}, + publisher = {Routledge and Kegan Paul}, + location = {London}, + year = {1972}, + annotation = {This is a \texttt{book} entry. Note the format of the \texttt{publisher} and + \texttt{edition} fields as well as the \texttt{subtitle} field} +} + +@Book{maron, + hyphenation = {american}, + author = {Maron, Monika}, + translator = {Brigitte Goldstein}, + title = {Animal Triste}, + shorttitle = {Animal Triste}, + publisher = {University of Nebraska Press}, + location = {Lincoln}, + year = {2000}, + origlanguage = {german}, + annotation = {An English translation of a German novel with a French title. In other words: a + \texttt{book} entry with a \texttt{translator} field. Note the + \texttt{origlanguage} field which is concatenated with the \texttt{translator}} +} + +@Book{massa, + hyphenation = {british}, + author = {Werner Massa}, + title = {Crystal structure determination}, + edition = {2}, + publisher = {Spinger}, + location = {Berlin}, + year = {2004}, + annotation = {A \texttt{book} entry with an \texttt{edition} field} +} + +@Book{nietzsche:ksa, + hyphenation = {german}, + sortyear = {1988-00-000}, + sorttitle = {Werke-00-000}, + indexsorttitle = {Samtliche Werke}, + author = {Nietzsche, Friedrich}, + editor = {Colli, Giorgio and Montinari, Mazzino}, + title = {S{\"a}mtliche Werke}, + subtitle = {Kritische Studienausgabe}, + volumes = {15}, + edition = {2}, + publisher = dtv # { and Walter de Gruyter}, + location = {M{\"u}nchen and Berlin and New York}, + year = {1988}, + annotation = {The critical edition of Nietzsche's works. This is a \texttt{book} entry + referring to a 15-volume work as a whole. Note the \texttt{volumes} field and + the format of the \texttt{publisher} and \texttt{location} fields in the + database file. Also note the \texttt{sorttitle} and \texttt{sortyear} fields + which are used to fine-tune the sorting order of the bibliography. We want this + item listed first in the bibliography} +} + +@Book{nietzsche:ksa1, + hyphenation = {german}, + sortyear = {1988-01-000}, + sorttitle = {Werke-01-000}, + indexsorttitle = {Samtliche Werke I}, + author = {Nietzsche, Friedrich}, + bookauthor = {Nietzsche, Friedrich}, + editor = {Colli, Giorgio and Montinari, Mazzino}, + indextitle = {S{\"a}mtliche Werke I}, + title = {Die Geburt der Trag{\"o}die. Unzeitgem{\"a}{\ss}e Betrachtungen I--IV. + Nachgelassene Schriften 1870--1973}, + shorttitle = {S{\"a}mtliche Werke I}, + maintitle = {S{\"a}mtliche Werke}, + mainsubtitle = {Kritische Studienausgabe}, + volume = {1}, + edition = {2}, + publisher = dtv # { and Walter de Gruyter}, + location = {M{\"u}nchen and Berlin and New York}, + year = {1988}, + annotation = {A single volume from the critical edition of Nietzsche's works. This + \texttt{book} entry explicitly refers to the first volume only. Note the + \texttt{title} and \texttt{maintitle} fields. Also note the \texttt{sorttitle} + and \texttt{sortyear} fields. We want this entry to be listed after the entry + referring to the entire edition} +} + +@Book{nussbaum, + keywords = {secondary}, + hyphenation = {american}, + sorttitle = {Aristotle's De Motu Animalium}, + indexsorttitle = {Aristotle's De Motu Animalium}, + author = {Nussbaum, Martha}, + title = {Aristotle's \mkbibquote{De Motu Animalium}}, + publisher = pup, + location = {Princeton}, + year = {1978}, + annotation = {A \texttt{book} entry. Note the \texttt{sorttitle} and \texttt{indexsorttitle} + fields and the markup of the quotes in the database file} +} + +@Book{piccato, + hyphenation = {american}, + author = {Piccato, Pablo}, + title = {City of Suspects}, + subtitle = {Crime in Mexico City, 1900--1931}, + shorttitle = {City of Suspects}, + publisher = {Duke University Press}, + location = {Durham and London}, + year = {2001}, + annotation = {This is a \texttt{book} entry. Note the format of the \texttt{location} field + in the database file} +} + +@Book{vangennep, + options = {useprefix}, + hyphenation = {french}, + sorttitle = {Rites de passage}, + author = {van Gennep, Arnold}, + indextitle = {Rites de passage, Les}, + title = {Les rites de passage}, + shorttitle = {Rites de passage}, + publisher = {Nourry}, + location = {Paris}, + year = {1909}, + annotation = {A \texttt{book} entry. Note the format of the printed name and compare the + \texttt{useprefix} option in the \texttt{options} field as well as + \texttt{brandt} and \texttt{geer}} +} + +@Book{vangennepx, + hyphenation = {french}, + author = {van Gennep, Jean}, + title = {Il a neigé à Port-au-Prince}, + publisher = {Alhambra}, + location = {Montréal}, + year = {1999} +} + +@Book{vazques-de-parga, + hyphenation = {spanish}, + sorttitle = {Peregrinaciones a Santiago de Compostela}, + author = {V{\'a}zques{ de }Parga, Luis and Lacarra, Jos{\'e} Mar{\'i}a and Ur{\'i}a + R{\'i}u, Juan}, + indextitle = {Peregrinaciones a Santiago de Compostela, Las}, + title = {Las Peregrinaciones a Santiago de Compostela}, + shorttitle = {Peregrinaciones}, + volumes = {3}, + publisher = {Iberdrola}, + location = {Pamplona}, + year = {1993}, + note = {Ed. facs. de la realizada en 1948--49}, + annotation = {A multivolume book cited as a whole. This is a \texttt{book} entry with + \texttt{volumes}, \texttt{note}, \texttt{sorttitle}, and \texttt{indextitle} fields} +} + +@Book{worman, + hyphenation = {american}, + sorttitle = {Cast of Character}, + author = {Worman, Nancy}, + indextitle = {Cast of Character, The}, + title = {The Cast of Character}, + subtitle = {Style in Greek Literature}, + shorttitle = {Cast of Character}, + publisher = {University of Texas Press}, + location = {Austin}, + year = {2002}, + annotation = {A \texttt{book} entry. Note the \texttt{sorttitle} and \texttt{indextitle} + fields} +} + +@Book{wormanx, + hyphenation = {american}, + sorttitle = {Someone did it again}, + author = {Worman, Nana}, + indextitle = {Someone did it again}, + title = {Someone did it again}, + publisher = {University of Nowhere Press}, + location = {Somewhere}, + year = {2009} +} + +@Collection{britannica, + options = {useeditor=false}, + label = {EB}, + hyphenation = {british}, + sorttitle = {Encyclop{\ae}dia Britannica}, + editor = {Preece, Warren E.}, + indextitle = {Encyclop{\ae}dia Britannica, The New}, + title = {The New Encyclop{\ae}dia Britannica}, + shorttitle = {Encyclop{\ae}dia Britannica}, + volumes = {32}, + edition = {15}, + publisher = {Encyclop{\ae}dia Britannica}, + location = {Chicago, Ill.}, + year = {2003}, + annotation = {This is a \texttt{collection} entry for an encyclopedia. Note the + \texttt{useeditor} option in the \texttt{options} field as well as the + \texttt{sorttitle} field. We want this entry to be cited and alphabetized by + title even though there is an editor. In addition to that, we want the title to + be alphabetized under \enquote*{E} rather than \enquote*{T}. Also note the + \texttt{label} field which is provided for author-year citation styles} +} + +@Collection{gaonkar, + hyphenation = {american}, + editor = {Gaonkar, Dilip Parameshwar}, + title = {Alternative Modernities}, + publisher = {Duke University Press}, + location = {Durham and London}, + year = {2001}, + isbn = {0-822-32714-7}, + annotation = {This is a \texttt{collection} entry. Note the format of the \texttt{location} + field in the database file as well as the \texttt{isbn} field} +} + +@Collection{jaffe, + editor = {Jaff{\'e}, Philipp}, + editora = {Loewenfeld, Samuel and Kaltenbrunner, Ferdinand and Ewald, Paul}, + editoratype = {redactor}, + indextitle = {Regesta Pontificum Romanorum}, + title = {Regesta Pontificum Romanorum ab condita ecclesia ad annum post Christum natum + \textsc{mcxcviii}}, + shorttitle = {Regesta Pontificum Romanorum}, + volumes = {2}, + edition = {2}, + location = {Leipzig}, + date = {1885/1888}, + annotation = {A \texttt{collection} entry with \texttt{edition} and \texttt{volumes} fields. + Note the \texttt{editortype} field handling the redactor} +} + +@Collection{westfahl:frontier, + hyphenation = {american}, + editor = {Westfahl, Gary}, + title = {Space and Beyond}, + subtitle = {The Frontier Theme in Science Fiction}, + booktitle = {Space and Beyond}, + booksubtitle = {The Frontier Theme in Science Fiction}, + publisher = {Greenwood}, + location = {Westport, Conn. and London}, + year = {2000}, + annotation = {This is a \texttt{collection} entry. Note the format of the \texttt{location} + field as well as the \texttt{subtitle} and \texttt{booksubtitle} fields} +} + +@InBook{kant:kpv, + shorthand = {KpV}, + hyphenation = {german}, + author = {Kant, Immanuel}, + bookauthor = {Kant, Immanuel}, + title = {Kritik der praktischen Vernunft}, + shorttitle = {Kritik der praktischen Vernunft}, + booktitle = {Kritik der praktischen Vernunft. Kritik der Urtheilskraft}, + maintitle = {Kants Werke. Akademie Textausgabe}, + volume = {5}, + publisher = {Walter de Gruyter}, + location = {Berlin}, + year = {1968}, + pages = {1--163}, + annotation = {An edition of Kant's \emph{Collected Works}, volume five. This is an + \texttt{inbook} entry which explicitly refers to the \emph{Critique of Practical + Reason} only, not to the entire fifth volume. Note the \texttt{author} and + \texttt{bookauthor} fields in the database file. By default, the + \texttt{bookauthor} is omitted if the values of the \texttt{author} and + \texttt{bookauthor} fields are identical} +} + +@InBook{kant:ku, + shorthand = {KU}, + hyphenation = {german}, + author = {Kant, Immanuel}, + bookauthor = {Kant, Immanuel}, + title = {Kritik der Urtheilskraft}, + booktitle = {Kritik der praktischen Vernunft. Kritik der Urtheilskraft}, + maintitle = {Kants Werke. Akademie Textausgabe}, + volume = {5}, + publisher = {Walter de Gruyter}, + location = {Berlin}, + year = {1968}, + pages = {165--485}, + annotation = {An edition of Kant's \emph{Collected Works}, volume five. This is an + \texttt{inbook} entry which explicitly refers to the \emph{Critique of Judgment} + only, not to the entire fifth volume} +} + +@InBook{nietzsche:historie, + hyphenation = {german}, + sortyear = {1988-01-243}, + sorttitle = {Werke-01-243}, + indexsorttitle = {Vom Nutzen und Nachtheil der Historie fur das Leben}, + author = {Nietzsche, Friedrich}, + bookauthor = {Nietzsche, Friedrich}, + editor = {Colli, Giorgio and Montinari, Mazzino}, + indextitle = {Vom Nutzen und Nachtheil der Historie f{\"u}r das Leben}, + title = {Unzeitgem{\"a}sse Betrachtungen. Zweites St{\"u}ck}, + subtitle = {Vom Nutzen und Nachtheil der Historie f{\"u}r das Leben}, + shorttitle = {Vom Nutzen und Nachtheil der Historie}, + booktitle = {Die Geburt der Trag{\"o}die. Unzeitgem{\"a}{\ss}e Betrachtungen I--IV. + Nachgelassene Schriften 1870--1973}, + maintitle = {S{\"a}mtliche Werke}, + mainsubtitle = {Kritische Studienausgabe}, + volume = {1}, + publisher = dtv # { and Walter de Gruyter}, + location = {M{\"u}nchen and Berlin and New York}, + year = {1988}, + pages = {243--334}, + annotation = {A single essay from the critical edition of Nietzsche's works. This + \texttt{inbook} entry explicitly refers to an essay found in the first volume. + Note the \texttt{title}, \texttt{booktitle}, and \texttt{maintitle} fields. Also + note the \texttt{sorttitle} and \texttt{sortyear} fields. We want this entry to + be listed after the entry referring to the entire first volume} +} + +@InCollection{brandt, + options = {useprefix=false}, + hyphenation = {german}, + indexsorttitle = {Nordischen Lander von der Mitte des 11. Jahrhunderts bis 1448}, + author = {von Brandt, Ahasver and Erich Hoffmann}, + editor = {Ferdinand Seibt}, + indextitle = {Nordischen L{\"a}nder von der Mitte des 11.~Jahrhunderts bis 1448, Die}, + title = {Die nordischen L{\"a}nder von der Mitte des 11.~Jahrhunderts bis 1448}, + shorttitle = {Die nordischen L{\"a}nder}, + booktitle = {Europa im Hoch- und Sp{\"a}tmittelalter}, + series = {Handbuch der europ{\"a}ischen Geschichte}, + number = {2}, + publisher = {Klett-Cotta}, + location = {Stuttgart}, + year = {1987}, + pages = {884--917}, + annotation = {An \texttt{incollection} entry with a \texttt{series} and a \texttt{number}. + Note the format of the printed name and compare the \texttt{useprefix} option in + the \texttt{options} field as well as \texttt{vangennep}. Also note the + \texttt{indextitle, and \texttt{indexsorttitle} fields}} +} + +@InCollection{hyman, + keywords = {secondary}, + hyphenation = {american}, + author = {Arthur Hyman}, + editor = {O'Meara, Dominic J.}, + indextitle = {Aristotle's Theory of the Intellect}, + title = {Aristotle's Theory of the Intellect and its Interpretation by Averroes}, + shorttitle = {Aristotle's Theory of the Intellect}, + booktitle = {Studies in Aristotle}, + series = {Studies in Philosophy and the History of Philosophy}, + number = {9}, + publisher = {The Catholic University of America Press}, + location = {Washington, D.C.}, + year = {1981}, + pages = {161--191}, + annotation = {An \texttt{incollection} entry with a \texttt{series} and \texttt{number} field} +} + +@InCollection{pines, + keywords = {secondary}, + hyphenation = {american}, + author = {Pines, Shlomo}, + editor = {Twersky, Isadore}, + indextitle = {Limitations of Human Knowledge According to Al-Farabi, ibn Bajja, and + Maimonides, The}, + title = {The Limitations of Human Knowledge According to Al-Farabi, ibn Bajja, and + Maimonides}, + shorttitle = {Limitations of Human Knowledge}, + booktitle = {Studies in Medieval Jewish History and Literature}, + publisher = hup, + location = {Cambridge, Mass.}, + year = {1979}, + pages = {82--109}, + annotation = {A typical \texttt{incollection} entry. Note the \texttt{indextitle} field} +} + +@InProceedings{moraux, + keywords = {secondary}, + hyphenation = {french}, + indexsorttitle = {De Anima dans la tradition grecque}, + author = {Moraux, Paul}, + editor = {Lloyd, G. E. R. and Owen, G. E. L.}, + indextitle = {\emph{De Anima} dans la tradition gr{\`e}cque, Le}, + title = {Le \emph{De Anima} dans la tradition gr{\`e}cque}, + subtitle = {Quelques aspects de l'interpretation du trait{\'e}, de Theophraste {\`a} + Themistius}, + shorttitle = {\emph{De Anima} dans la tradition gr{\`e}cque}, + booktitle = {Aristotle on Mind and the Senses}, + booktitleaddon = {Proceedings of the Seventh Symposium Aristotelicum (1975)}, + publisher = cup, + location = {Cambridge}, + date = {1979-01-02/1980-04-08}, + origdate = {1924-06-07/1924-07-09}, + eventdate = {1924-02-03/1924-02-05}, + urldate = {1979-03-03/1979-03-04}, + url = {http://some/thing}, + pages = {281--324}, + annotation = {This is a typical \texttt{inproceedings} entry. Note the \texttt{booksubtitle}, + \texttt{shorttitle}, \texttt{indextitle}, and \texttt{indexsorttitle} fields} +} + +@InProceedings{stdmodel:salam, + entryset = {stdmodel}, + author = {Salam, Abdus}, + editor = {Svartholm, Nils}, + title = {Weak and Electromagnetic Interactions}, + booktitle = {Elementary particle theory}, + booksubtitle = {Relativistic groups and analyticity}, + booktitleaddon = {Proceedings of the Eighth Nobel Symposium, May 19--25, 1968}, + venue = {Aspen{\"a}sgarden, Lerum}, + publisher = {Almquist \& Wiksell}, + location = {Stockholm}, + year = {1968}, + pages = {367\psqq} +} + +@Manual{cms, + label = {CMS}, + hyphenation = {american}, + sorttitle = {Chicago Manual of Style}, + indextitle = {Chicago Manual of Style, The}, + title = {The Chicago Manual of Style}, + subtitle = {The Essential Guide for Writers, Editors, and Publishers}, + shorttitle = {Chicago Manual of Style}, + edition = {15}, + publisher = {University of Chicago Press}, + location = {Chicago, Ill.}, + year = {2003}, + isbn = {0-226-10403-6}, + annotation = {This is a \texttt{manual} entry without an \texttt{author} or \texttt{editor}. + Note the \texttt{label} field in the database file which is provided for + author-year citation styles. Also note the \texttt{sorttitle} and + \texttt{indextitle} fields. By default, all entries without an \texttt{author} + or \texttt{editor} are alphabetized by \texttt{title} but we want this entry to + be alphabetized under \enquote*{C} rather than \enquote*{T}. There's also an + \texttt{isbn} field} +} + +@Online{baez/online, + hyphenation = {american}, + author = {Baez, John C. and Lauda, Aaron D.}, + title = {Higher-Dimensional Algebra V: 2-Groups}, + version = {3}, + date = {2004-10-27}, + eprint = {math/0307200v3}, + eprinttype = {arxiv}, + annotation = {An \texttt{online} reference from arXiv. Note the \texttt{eprint} and + \texttt{eprinttype} fields. Also note that the arXiv reference is transformed + into a clickable link if \texttt{hyperref} support has been enabled. Compare + \texttt{baez\slash article} which is the same item given as an \texttt{article} + entry with eprint information} +} + +@Online{ctan, + label = {CTAN}, + hyphenation = {american}, + title = {CTAN}, + subtitle = {The Comprehensive TeX Archive Network}, + year = {2006}, + url = {http://www.ctan.org}, + urldate = {2006-10-01}, + annotation = {This is an \texttt{online} entry. The \textsc{url}, which is given in the + \texttt{url} field, is transformed into a clickable link if \texttt{hyperref} + support has been enabled. Note the format of the \texttt{urldate} field + (\texttt{yyyy-mm-dd}) in the database file. It is also possible to use the + fields \texttt{urlday}\slash \texttt{urlmonth}\slash \texttt{urlyear} instead. + Also note the \texttt{label} field which may be used as a fallback by citation + styles which need an \texttt{author} and\slash or a \texttt{year}} +} + +@Online{itzhaki, + hyphenation = {american}, + author = {Itzhaki, Nissan}, + title = {Some remarks on 't Hooft's S-matrix for black holes}, + version = {1}, + date = {1996-03-11}, + eprint = {hep-th/9603067}, + eprinttype = {arxiv}, + annotation = {An \texttt{online} reference from arXiv. Note the \texttt{eprint} and + \texttt{eprinttype} fields. Also note that the arXiv reference is transformed + into a clickable link if \texttt{hyperref} support has been enabled}, + abstract = {We discuss the limitations of 't Hooft's proposal for the black hole S-matrix. + We find that the validity of the S-matrix implies violation of the + semi-classical approximation at scales large compared to the Planck scale. We + also show that the effect of the centrifugal barrier on the S-matrix is crucial + even for large transverse distances.} +} + +@Online{markey, + hyphenation = {american}, + sorttitle = {Tame the Beast}, + author = {Markey, Nicolas}, + title = {Tame the BeaST}, + subtitle = {The B to X of BibTeX}, + version = {1.3}, + url = {http://tug.ctan.org/tex-archive/info/bibtex/tamethebeast/ttb_en.pdf}, + urldate = {2006-10-01}, + annotation = {An \texttt{online} entry for a tutorial. Note the format of the \texttt{date} + field (\texttt{yyyy-mm-dd}) in the database file. It is also possible to use the + fields \texttt{day}\slash \texttt{month}\slash \texttt{year} instead.} +} + +@Patent{almendro, + hyphenation = {german}, + author = {Almendro, Jos{\'e} L. and Mart{\'i}n, Jacinto and S{\'a}nchez, Alberto and + Nozal, Fernando}, + title = {Elektromagnetisches Signalhorn}, + number = {EU-29702195U}, + location = {countryes and countryfr and countryuk and countryde}, + year = {1998}, + annotation = {This is a \texttt{patent} entry with a \texttt{location} field. The number is + given in the \texttt{number} field. Note the format of the \texttt{location} + field in the database file. Compare \texttt{laufenberg}, \texttt{sorace}, and + \texttt{kowalik}} +} + +@Patent{kowalik, + hyphenation = {french}, + author = {Kowalik, F. and Isard, M.}, + indextitle = {Estimateur d'un d{\'e}faut de fonctionnement}, + title = {Estimateur d'un d{\'e}faut de fonctionnement d'un modulateur en quadrature et + {\'e}tage de modulation l'utilisant}, + type = {patreqfr}, + number = {9500261}, + date = {1995-01-11}, + annotation = {This is a \texttt{patent} entry for a French patent request with a full date. + The number is given in the \texttt{number} field. Note the format of the + \texttt{type} and \texttt{date} fields in the database file. Compare + \texttt{almendro}, \texttt{laufenberg}, and \texttt{sorace}} +} + +@Patent{laufenberg, + hyphenation = {german}, + author = {Laufenberg, Xaver and Eynius, Dominique and Suelzle, Helmut and Usbeck, Stephan + and Spaeth, Matthias and Neuser-Hoffmann, Miriam and Myrzik, Christian and + Schmid, Manfred and Nietfeld, Franz and Thiel, Alexander and Braun, Harald and + Ebner, Norbert}, + holder = {{Robert Bosch GmbH} and {Daimler Chrysler AG} and {Bayerische Motoren Werke + AG}}, + title = {Elektrische Einrichtung und Betriebsverfahren}, + type = {patenteu}, + number = {1700367}, + location = {countryde and countrywo}, + date = {2006-09-13}, + annotation = {This is a \texttt{patent} entry with a \texttt{holder} field. Note the format + of the \texttt{type} and \texttt{location} fields in the database file. Compare + \texttt{almendro}, \texttt{sorace}, and \texttt{kowalik}}, + abstract = {The invention relates to an electric device comprising a generator, in + particular for use in the vehicle electric system of a motor vehicle and a + controller for controlling the generator voltage. The device is equipped with a + control zone, in which the voltage is controlled and zones, in which the torque + is controlled. The invention also relates to methods for operating a device of + this type.}, + file = {http://v3.espacenet.com/textdoc?IDX=EP1700367} +} + +@Patent{sorace, + hyphenation = {american}, + author = {Sorace, Ronald E. and Reinhardt, Victor S. and Vaughn, Steven A.}, + holder = {{Hughes Aircraft Company}}, + title = {High-Speed Digital-to-RF Converter}, + type = {patentus}, + number = {5668842}, + date = {1997-09-16}, + annotation = {This is a \texttt{patent} entry with a \texttt{holder} field. Note the format + of the \texttt{type} and \texttt{date} fields in the database file. Compare + \texttt{almendro}, \texttt{laufenberg}, and \texttt{kowalik}} +} + +@Report{chiu, + hyphenation = {american}, + sorttitle = {Hybrid Hierarchical Model of a Multiple Virtual Storage (MVS) Operating + System}, + author = {Chiu, Willy W. and Chow, We Min}, + indextitle = {Hybrid Hierarchical Model, A}, + title = {A Hybrid Hierarchical Model of a Multiple Virtual Storage (MVS) Operating + System}, + institution = {IBM and HP and Sun and Sony}, + type = {resreport}, + number = {RC-6947}, + year = {1978}, + annotation = {This is a \texttt{report} entry for a research report. Note the format of the + \texttt{type} field in the database file which uses a localization key. The + number of the report is given in the \texttt{number} field. Also note the + \texttt{sorttitle} and \texttt{indextitle} fields} +} + +@Report{padhye, + hyphenation = {american}, + sorttitle = {A Stochastic Model of TCP Reno Congestion Avoidance and Control}, + author = {Padhye, Jitendra and Firoiu, Victor and Towsley, Don}, + indextitle = {Stochastic Model of TCP Reno Congestion Avoidance and Control, A}, + title = {A Stochastic Model of TCP Reno Congestion Avoidance and Control}, + institution = {University of Massachusetts}, + type = {techreport}, + number = {99-02}, + location = {Amherst, Mass.}, + year = {1999}, + annotation = {This is a \texttt{report} entry for a technical report. Note the format of the + \texttt{type} field in the database file which uses a localization key. The + number of the report is given in the \texttt{number} field. Also note the + \texttt{sorttitle} and \texttt{indextitle} fields}, + abstract = {The steady state performance of a bulk transfer TCP flow (i.e. a flow with a + large amount of data to send, such as FTP transfers) may be characterized by + three quantities. The first is the send rate, which is the amount of data sent + by the sender in unit time. The second is the throughput, which is the amount of + data received by the receiver in unit time. Note that the throughput will always + be less than or equal to the send rate due to losses. Finally, the number of + non-duplicate packets received by the receiver in unit time gives us the goodput + of the connection. The goodput is always less than or equal to the throughput, + since the receiver may receive two copies of the same packet due to + retransmissions by the sender. In a previous paper, we presented a simple model + for predicting the steady state send rate of a bulk transfer TCP flow as a + function of loss rate and round trip time. In this paper, we extend that work in + two ways. First, we analyze the performance of bulk transfer TCP flows using + more precise, stochastic analysis. Second, we build upon the previous analysis + to provide both an approximate formula as well as a more accurate stochastic + model for the steady state throughput of a bulk transfer TCP flow.}, + file = {ftp://gaia.cs.umass.edu/pub/Padhey99-markov.ps} +} + +@Thesis{geer, + options = {useprefix=false}, + hyphenation = {british}, + author = {de Geer, Ingrid}, + title = {Earl, Saint, Bishop, Skald~-- and Music}, + subtitle = {The Orkney Earldom of the Twelfth Century. A Musicological Study}, + institution = {Uppsala Universitet}, + type = {phdthesis}, + location = {Uppsala}, + year = {1985}, + annotation = {This is a typical \texttt{thesis} entry for a PhD thesis. Note the + \texttt{type} field in the database file which uses a localization key. Also + note the format of the printed name and compare the \texttt{useprefix} option in + the \texttt{options} field as well as \texttt{vangennep}} +} + +@Thesis{loh, + hyphenation = {american}, + author = {Loh, Nin C.}, + title = {High-Resolution Micromachined Interferometric Accelerometer}, + institution = {Massachusetts Institute of Technology}, + type = {mathesis}, + location = {Cambridge, Mass.}, + year = {1992}, + annotation = {This is a typical \texttt{thesis} entry for an MA thesis. Note the + \texttt{type} field in the database file which uses a localization key} +} + +@Thesis{Pimentel00, + author = {Pimentel, Jr.,Joseph J.}, + title = {Sociolinguistic Reflections of Privatization and Globalization: The {Arabic} of {Egyptian} newspaper advertisements}, + school = {University of Michigan}, + year = {2000}, +} + +@Book{luzzatto, + author = {Luzzatto, Moshe Ḥayyim}, + title = {ha-Lashon la-Ramḥal: u-vo sheloshah ḥiburim}, + location = {Yerushalayim}, + publisher = {Makhon Ramḥal}, + year = {2000} +} + +% Without braces round this prefixed lastname, T::B::N fails to get +% the lastname on Windows for some reason +@Book{hasan, + author = {{al-Hasan}, Ê¿AlÄ«}, + editor = {{al-Hasan}, Ê¿AlÄ«}, + translator = {{al-Hasan}, Ê¿AlÄ«}, + title = {Some title}, + publisher = {Some press}, + year = {2000} +} + +@misc{t1, + KEYWORDS = { primary, something,somethingelse}, + AUTHOR = {Bill Brown}, + TITLE = {Normal things {$^{3}$}}, + YEAR = {1992}, + PAGES = {100--} +} + +% SORTNAME should not be output +@misc{t2, + AUTHOR = {Bill Brown}, + SORTNAME = {Bill Brown}, + TITLE = {Signs of W$\frac{o}{a}$nder}, + YEAR = {1994}, + PAGES = {100} +} + +@misc{tvonb, + AUTHOR = {Terrence von Bobble}, + TITLE = {Things}, + YEAR = {1997} +} diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/extrayear.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/extrayear.bcf new file mode 100644 index 00000000000..738bf6489ca --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/extrayear.bcf @@ -0,0 +1,262 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="collection"> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shorteditor</bcf:value> + <bcf:value order="2">editor</bcf:value> + <bcf:value order="3">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <!-- CROSSREF --> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <!-- SORTING --> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">labelalpha</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5" sort_direction="descending"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem substring_side="right" substring_width="4" order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1" pad_char="0">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + <bcf:sort order="7"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">extrayear.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>l1</bcf:citekey> + <bcf:citekey>L2</bcf:citekey> + <bcf:citekey>L3</bcf:citekey> + <bcf:citekey>L4</bcf:citekey> + <bcf:citekey>L5</bcf:citekey> + <bcf:citekey>L6</bcf:citekey> + <bcf:citekey>L7</bcf:citekey> + <bcf:citekey>L8</bcf:citekey> + <bcf:citekey>L9</bcf:citekey> + <bcf:citekey>L10</bcf:citekey> + <bcf:citekey>LY1</bcf:citekey> + <bcf:citekey>LY2</bcf:citekey> + <bcf:citekey>companion1</bcf:citekey> + <bcf:citekey>companion2</bcf:citekey> + <bcf:citekey>companion3</bcf:citekey> + <bcf:citekey>vangennep</bcf:citekey> + <bcf:citekey>gennep</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/extrayear.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/extrayear.bib new file mode 100644 index 00000000000..789a895bfa8 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/extrayear.bib @@ -0,0 +1,109 @@ +@BOOK{L1, + AUTHOR = {John Doe}, + TITLE = {Title 1}, + PUBLISHER = {Oxford}, + YEAR = {1995}, +} + +@BOOK{L2, + AUTHOR = {John Doe}, + TITLE = {Title 2}, + PUBLISHER = {Oxford}, + YEAR = {1995}, +} + +@BOOK{L3, + AUTHOR = {John Doe}, + TITLE = {Title 3}, + PUBLISHER = {Oxford}, + YEAR = {1995}, +} + +@BOOK{L4, + AUTHOR = {John Doe and Albert Abrahams}, + TITLE = {Title 1}, + PUBLISHER = {Oxford}, + YEAR = {1995}, +} + +@BOOK{L5, + AUTHOR = {John Doe and Albert Abrahams}, + TITLE = {Title 2}, + PUBLISHER = {Oxford}, + YEAR = {1995}, +} + +@BOOK{L6, + AUTHOR = {John Doe and Albert Abrahams}, + TITLE = {Title 1}, + PUBLISHER = {Oxford}, + YEAR = {1996}, +} + +@BOOK{L7, + AUTHOR = {John Doe and Albert Abrahams}, + TITLE = {Title 2}, + PUBLISHER = {Oxford}, + YEAR = {1996}, +} + +@BOOK{L8, + AUTHOR = {Bill Shakespeare}, + TITLE = {Works}, + PUBLISHER = {Oxford}, + DATE = {1985}, +} + +@BOOK{L9, + TITLE = {Title with no author}, + DATE = {1985}, +} + +@BOOK{L10, + TITLE = {Another title with no author}, + DATE = {1985}, +} + +@BOOK{companion1, + AUTHOR = {Goossens, M. and Mittelbach, F. and Samarin, A.}, + DATE = {1994}, + TITLE = {Some title} +} + +@BOOK{companion2, + AUTHOR = {Goossens, M. and Mittelbach, F.}, + YEAR = {1994}, + TITLE = {Some title} +} + +@BOOK{companion3, + AUTHOR = {Goossens, M.}, + DATE = {1994}, + TITLE = {Some title} +} + +@BOOK{vangennep, + OPTIONS = {useprefix}, + AUTHOR = {van Gennep, Arnold}, + DATE = {1909}, + TITLE = {Some title} +} + +@BOOK{gennep, + AUTHOR = {van Gennep, Arnold}, + DATE = {1909}, + TITLE = {Some title} +} + +@BOOK{LY1, + AUTHOR = {Arthur Example}, + DATE = {2006/2009}, + TITLE = {Some title} +} + +@BOOK{LY2, + AUTHOR = {Arthur Example}, + DATE = {2006}, + TITLE = {Some title} +} + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/general1.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/general1.bcf new file mode 100644 index 00000000000..9eca6745acb --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/general1.bcf @@ -0,0 +1,248 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">author</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <!-- CROSSREF --> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:presort type="misc">ww</bcf:presort> + <bcf:sortexclusion type="misc"> + <bcf:exclusion>year</bcf:exclusion> + <bcf:exclusion>title</bcf:exclusion> + </bcf:sortexclusion> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">examples.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>stdmodel</bcf:citekey> + <bcf:citekey>knuth:ct</bcf:citekey> + <bcf:citekey>angenendtsk</bcf:citekey> + <bcf:citekey>angenendtsa</bcf:citekey> + <bcf:citekey>stdmodel:glashow</bcf:citekey> + <bcf:citekey>stdmodel:ps_sc</bcf:citekey> + <bcf:citekey>murray</bcf:citekey> + <bcf:citekey>aristotle:anima</bcf:citekey> + <bcf:citekey>aristotle:rhetoric</bcf:citekey> + <bcf:citekey>augustine</bcf:citekey> + <bcf:citekey>cotton</bcf:citekey> + <bcf:citekey>chiu</bcf:citekey> + <bcf:citekey>moraux</bcf:citekey> + <bcf:citekey>jaffe</bcf:citekey> + <bcf:citekey>luzzatto</bcf:citekey> + <bcf:citekey>hasan</bcf:citekey> + <bcf:citekey>t1</bcf:citekey> + <bcf:citekey>tvonb</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/general2.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/general2.bcf new file mode 100644 index 00000000000..7d5e5dfeaf7 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/general2.bcf @@ -0,0 +1,236 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <!-- CROSSREF --> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">examples.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>murray</bcf:citekey> + <bcf:citekey>t1</bcf:citekey> + <bcf:citekey>t2</bcf:citekey> + <bcf:citekey>kant:ku</bcf:citekey> + <bcf:citekey>kant:kpv</bcf:citekey> + <bcf:citekey>shore</bcf:citekey> + <bcf:citekey>missing1</bcf:citekey> + <bcf:citekey>missing2</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/labelalpha.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/labelalpha.bcf new file mode 100644 index 00000000000..7738247ef99 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/labelalpha.bcf @@ -0,0 +1,259 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="collection"> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shorteditor</bcf:value> + <bcf:value order="2">editor</bcf:value> + <bcf:value order="3">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <!-- CROSSREF --> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <!-- SORTING --> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1" substring_side="left" substring_width="2">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">labelalpha</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="7"> + <bcf:sortitem order="1" pad_side="left" pad_width="4" pad_char="0">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">labelalpha.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>L1</bcf:citekey> + <bcf:citekey>L2</bcf:citekey> + <bcf:citekey>L3</bcf:citekey> + <bcf:citekey>L4</bcf:citekey> + <bcf:citekey>L5</bcf:citekey> + <bcf:citekey>L6</bcf:citekey> + <bcf:citekey>L7</bcf:citekey> + <bcf:citekey>L8</bcf:citekey> + <bcf:citekey>L9</bcf:citekey> + <bcf:citekey>L10</bcf:citekey> + <bcf:citekey>knuth:ct</bcf:citekey> + <bcf:citekey>knuth:ct:a</bcf:citekey> + <bcf:citekey>knuth:ct:b</bcf:citekey> + <bcf:citekey>knuth:ct:c</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/labelalpha.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/labelalpha.bib new file mode 100644 index 00000000000..7897f409768 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/labelalpha.bib @@ -0,0 +1,145 @@ +@BOOK{L1, + AUTHOR = {John Doe}, + TITLE = {Title 1}, + PUBLISHER = {Oxford}, + YEAR = {1995}, +} + +@BOOK{L2, + AUTHOR = {John Doe and Albert Abrahams}, + TITLE = {Title 2}, + PUBLISHER = {Oxford}, + YEAR = {1995}, +} + +@BOOK{L3, + AUTHOR = {John Doe and Albert Abrahams}, + TITLE = {Title 3}, + PUBLISHER = {Oxford}, + YEAR = {1995}, +} + +@BOOK{L4, + AUTHOR = {John Doe and Albert Abrahams and Ernie Edwards}, + TITLE = {Title 4}, + PUBLISHER = {Oxford}, + YEAR = {1995}, +} + +@BOOK{L5, + AUTHOR = {John Doe and Albert Abrahams and Ernie Edwards}, + TITLE = {Title 5}, + PUBLISHER = {Oxford}, + YEAR = {1995}, +} + +@BOOK{L6, + AUTHOR = {John Doe and Simon Smith and Ernie Edwards}, + TITLE = {Title 6}, + PUBLISHER = {Oxford}, + YEAR = {1995}, +} + +@BOOK{L7, + AUTHOR = {John Doe and Simon Smith and James Jones}, + TITLE = {Title 7}, + PUBLISHER = {Oxford}, + YEAR = {1995}, +} + +@BOOK{L8, + AUTHOR = {Bill Shakespeare}, + TITLE = {Works}, + PUBLISHER = {Oxford}, + DATE = {1985/1992}, +} + +% For these two, the shorthand should prevent extraalpha being set for them as +% they are disambiguated by their shorthands and labelalpha is true +@BOOK{L9, + SHORTHAND = {SS1}, + AUTHOR = {Sam Smiley}, + TITLE = {Works}, + PUBLISHER = {Oxford}, + YEAR = {1922}, +} + +@BOOK{L10, + SHORTHAND = {SS2}, + AUTHOR = {Sam Smiley}, + TITLE = {UnWorks}, + PUBLISHER = {Oxford}, + YEAR = {1922}, +} + + +% Some examples from biblatex examples file of collection plus individual volumes +% The date ranges should be handled differently by extrayear and extraalpha +@BOOK{knuth:ct, + hyphenation = {american}, + sortyear = {1984-0}, + sorttitle = {Computers & Typesetting}, + indexsorttitle = {Computers & Typesetting}, + author = {Knuth, Donald E.}, + title = {Computers \& Typesetting}, + volumes = {5}, + publisher = {Addison-Wesley}, + location = {Reading, Mass.}, + date = {1984/1986}, + annotation = {A five-volume book cited as a whole. This is a \texttt{book} entry, note the + \texttt{volumes} field} +} + +@BOOK{knuth:ct:a, + hyphenation = {american}, + sortyear = {1984-1}, + sorttitle = {Computers & Typesetting A}, + indexsorttitle = {The TeXbook}, + author = {Knuth, Donald E.}, + indextitle = {\TeX book, The}, + title = {The \TeX book}, + shorttitle = {\TeX book}, + maintitle = {Computers \& Typesetting}, + volume = {A}, + publisher = {Addison-Wesley}, + location = {Reading, Mass.}, + date = {1984}, + annotation = {The first volume of a five-volume book. Note the \texttt{sorttitle} and + \texttt{sortyear} fields. We want this volume to be listed after the entry + referring to the entire five-volume set. Also note the \texttt{indextitle} and + \texttt{indexsorttitle} fields} +} + +@BOOK{knuth:ct:b, + hyphenation = {american}, + sortyear = {1986-1}, + sorttitle = {Computers & Typesetting B}, + indexsorttitle = {TeX: The Program}, + author = {Knuth, Donald E.}, + title = {\TeX: The Program}, + shorttitle = {\TeX}, + maintitle = {Computers \& Typesetting}, + volume = {B}, + publisher = {Addison-Wesley}, + location = {Reading, Mass.}, + date = {1986}, + annotation = {The second volume of a five-volume book. Note the \texttt{sorttitle} and + \texttt{sortyear} fields. Also note the \texttt{indexsorttitle} field} +} + +@BOOK{knuth:ct:c, + hyphenation = {american}, + sortyear = {1986-2}, + sorttitle = {Computers & Typesetting C}, + author = {Knuth, Donald E.}, + indextitle = {METAFONTbook, The}, + title = {The METAFONTbook}, + shorttitle = {METAFONTbook}, + maintitle = {Computers \& Typesetting}, + volume = {C}, + publisher = {Addison-Wesley}, + location = {Reading, Mass.}, + date = {1986}, + annotation = {The third volume of a five-volume book. Note the \texttt{sorttitle} and + \texttt{sortyear} fields as well as the \texttt{indextitle} field} +} diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/names-biblatexml.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/names-biblatexml.bcf new file mode 100644 index 00000000000..25951f4aadd --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/names-biblatexml.bcf @@ -0,0 +1,263 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="collection"> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shorteditor</bcf:value> + <bcf:value order="2">editor</bcf:value> + <bcf:value order="3">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <!-- DISPLAYMODES --> + <bcf:displaymodes> + <bcf:displaymode> + <bcf:target>*</bcf:target> + <bcf:mode>original</bcf:mode> + <bcf:mode>romanised</bcf:mode> + <bcf:mode>uniform</bcf:mode> + <bcf:mode>translated</bcf:mode> + </bcf:displaymode> + <bcf:displaymode> + <bcf:target>title</bcf:target> + <bcf:mode>translated</bcf:mode> + <bcf:mode>romanised</bcf:mode> + <bcf:mode>uniform</bcf:mode> + <bcf:mode>original</bcf:mode> + </bcf:displaymode> + </bcf:displaymodes> + <!-- CROSSREF --> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <!-- SORTING --> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">labelalpha</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5" sort_direction="descending"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem substring_side="right" substring_width="4" order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1" pad_char="0">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + <bcf:sort order="7"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="biblatexml">names.xml</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>*</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/names.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/names.bcf new file mode 100644 index 00000000000..d2232179809 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/names.bcf @@ -0,0 +1,246 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="collection"> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shorteditor</bcf:value> + <bcf:value order="2">editor</bcf:value> + <bcf:value order="3">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <!-- CROSSREF --> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <!-- SORTING --> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">labelalpha</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5" sort_direction="descending"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem substring_side="right" substring_width="4" order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1" pad_char="0">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + <bcf:sort order="7"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">names.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>*</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/names.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/names.bib new file mode 100644 index 00000000000..c7883f778c0 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/names.bib @@ -0,0 +1,130 @@ +@BOOK{L1, + AUTHOR = {Alfred Adler}, +} + +@BOOK{L2, + AUTHOR = {Bertie B. Bull}, +} + +@BOOK{L3, + AUTHOR = {C. Z. Crop}, +} + +@BOOK{L4, + AUTHOR = {Derek D Decket}, +} + +@BOOK{L5, + AUTHOR = {Egbert von Eel}, +} + +@BOOK{L6, + AUTHOR = {Francis van der valt Frome}, +} + +@BOOK{L7, + AUTHOR = {Gregory R. van Gloom}, +} + +@BOOK{L8, + AUTHOR = {Henry F. van Henkel}, +} + +@BOOK{L9, + AUTHOR = {Ian {Iliad Ipswich}}, +} + +@BOOK{L10, + AUTHOR = {Jolly, III, James}, +} + +@BOOK{L10a, + AUTHOR = {Pimentel, Jr. ,Joseph J.}, +} + +@BOOK{L11, + AUTHOR = {van Kluster, Jr., Kevin}, +} + +@BOOK{L12, + AUTHOR = {Charles Louis Xavier Joseph de la Vall{\'e}e Poussin} +} + +@BOOK{L13, + AUTHOR = {Van de Graaff, R. J.} +} + +@BOOK{L14, + AUTHOR = {St John-Mollusc, Oliver} +} + +@BOOK{L15, + AUTHOR = {Roger P.{\,}G. van Gompel} +} + +@BOOK{L16, + AUTHOR = {Roger {P.\,G.} van Gompel} +} + +@BOOK{L17, + AUTHOR = {Lovecraft, Bill H.{\,}P.}, +} + +@BOOK{L18, + AUTHOR = {Lovecraft, Bill {H.\,P.}}, +} + +@BOOK{L19, + AUTHOR = {Mustermann, Klaus-Peter}, +} + +@BOOK{L20, + AUTHOR = {{John Henry} Ford}, +} + +@BOOK{L21, + AUTHOR = {{\v S}omeone Smith}, +} + +@BOOK{L22, + AUTHOR = {Someone {\v S}mith}, +} + +@BOOK{L23, + AUTHOR = {Å omeone Smith}, +} + +@BOOK{L24, + AUTHOR = {Someone Å mith}, +} + +@BOOK{L25, + AUTHOR = {{American Psychological Association, Task Force on the Sexualization of Girls}}, +} +@BOOK{L26, + AUTHOR = {{Sci-Art Publishers}} +} + +% Should skip the first name as it has too many commas +@BOOK{L27, + AUTHOR = {Smith, Jr., Bill, Lee and James Smith} +} + +% This causes Text::BibTeX <=0.4 to segfault +@BOOK{L28, + AUTHOR = {Deux et al.,, O.} +} + +% Should be ok as escaped. Text::BibTeX < 0.41 has a bug however and replaces +% the third comma with a space. +@BOOK{L29, + AUTHOR = {{U.S. Department of Health and Human Services, National Institute of Mental Health, National Heart, Lung and Blood Institute}} +} + +% The protected {M} causes problems for the btparse library so we strip this in biber +@BOOK{L30, + AUTHOR = {E. S. El-{M}allah} +} + + + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/names.xml b/Master/texmf-dist/source/bibtex/biber/t/tdata/names.xml new file mode 100644 index 00000000000..69c79527765 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/names.xml @@ -0,0 +1,82 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/biblatexml.rnc" type="compact"?> +<bib:entries xmlns:bib="http://biblatex-biber.sourceforge.net/biblatexml"> + <bib:entry id="BulgakovRozenfeld:1983" entrytype="book"> + <bib:author> + <bib:person gender="sm"> + <bib:first> + <bib:namepart>Павел</bib:namepart> + <bib:namepart>Георгиевич</bib:namepart> + </bib:first> + <bib:firstinitial>П</bib:firstinitial> + <bib:last>Булгаков</bib:last> + </bib:person> + <bib:person> + <bib:first> + <bib:namepart>БориÑ</bib:namepart> + <bib:namepart>Ðбрамович</bib:namepart> + </bib:first> + <bib:firstinitial>Б. B.</bib:firstinitial> + <bib:last>Розенфельд</bib:last> + <bib:middle>Билл</bib:middle> + <bib:middleinitial>д</bib:middleinitial> + </bib:person> + <bib:person> + <bib:first> + <bib:namepart>Ðшраф</bib:namepart> + <bib:namepart>Ðхмедович</bib:namepart> + </bib:first> + <bib:last>Ðхмедов</bib:last> + </bib:person> + </bib:author> + <bib:author mode="uniform"> + <bib:person> + <bib:first> + <bib:namepart>Pavel</bib:namepart> + <bib:namepart>G.</bib:namepart> + </bib:first> + <bib:last>Bulgakov</bib:last> + </bib:person> + <bib:person> + <bib:first> + <bib:namepart>Boris</bib:namepart> + <bib:namepart>A.</bib:namepart> + </bib:first> + <bib:last>Rozenfeld</bib:last> + <bib:middle>Bill</bib:middle> + </bib:person> + <bib:person> + <bib:first> + <bib:namepart>Ashraf</bib:namepart> + <bib:namepart>A.</bib:namepart> + </bib:first> + <bib:last>Akhmedov</bib:last> + </bib:person> + </bib:author> + <bib:title>Мухаммад ибн муÑа ал-Хорезми. Около 783 – около 850</bib:title> + <bib:title mode="romanised">Mukhammad al-Khorezmi. Okolo 783 – okolo 850</bib:title> + <bib:title mode="translated" xml:lang="en">Mukhammad al-Khorezmi. Ca. 783 – ca. 850</bib:title> + <bib:location>МоÑква</bib:location> + <bib:location mode="romanised">Moskva</bib:location> + <bib:location mode="uniform">Moscow</bib:location> + <bib:publisher>Ðаука</bib:publisher> + <bib:publisher mode="romanised">Nauka</bib:publisher> + <bib:language>Russian</bib:language> + <bib:series>Ðаучно-биографичеÑÐºÐ°Ñ Ð»Ð¸Ñ‚ÐµÑ€Ð°Ñ‚ÑƒÑ€Ð°</bib:series> + <bib:series mode="romanised">Nauchno-biograficheskaya literatura</bib:series> + <bib:date>1983</bib:date> + <bib:date datetype="orig">1985-04-02</bib:date> + <bib:date datetype ="event"> + <bib:start>1990-05-16</bib:start> + <bib:end>1990-05-17</bib:end> + </bib:date> + <bib:date datetype="url"> + <bib:start>1991-07-01</bib:start> + <bib:end></bib:end> + </bib:date> + <bib:pagetotal>240</bib:pagetotal> + <bib:related> + <bib:item type="reprint" string="Somestring" ids="rel1,rel2"/> + </bib:related> + </bib:entry> +</bib:entries>
\ No newline at end of file diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/options.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/options.bcf new file mode 100644 index 00000000000..d11985a60c0 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/options.bcf @@ -0,0 +1,235 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>88</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">author</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="book"> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">author</bcf:value> + <bcf:value order="2">editor</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">options.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>*</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/options.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/options.bib new file mode 100644 index 00000000000..9160db881f0 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/options.bib @@ -0,0 +1,7 @@ +@BOOK{L1, + AUTHOR = {John Doe}, + TITLE = {Title 1}, + PUBLISHER = {Oxford}, + ORIGDATE = {1985-10-30}, + DATE = {1998-04-05}, +} diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/papers.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/papers.bib new file mode 100644 index 00000000000..31c1c675f23 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/papers.bib @@ -0,0 +1,15133 @@ +% +% THE PAPERS +% +% +% + +%A + +%Aa + +@article{AardalHLT02, +author = {K. I. Aardal and C. A. J. Hurkens and J. K. Lenstra and S. R. Tiourine}, +title = {Algorithms for radio link frequency assignment: The {CALMA} project}, +journal = or, volume = 50, year = 2003, number = 6, pages = {968 - 980}} + +@article{AardalHKMS03, +author = {K. Aardal and C. van Hoesel and A. Koster and C. Mannino and A. Sassano}, +title = {Models and solution techniques for the frequency assignment problem}, +journal = {4OR}, volume = 1, year = 2003, pages = {261-317}} + +%Ab + +%Abd + +@article{AbdelbarH98, +author = {A.M. Abdelbar and S.M. Hedetniemi}, +title = {Approximating {MAP}s for belief networks is {NP}-hard and other theorems}, +journal = artint, volume = 102, year = 1998, pages = {21-38}} + +%Abr + +%Abrahamson89 + +@article{AbrahamsonDKP89, +author = {Karl R. Abrahamson and N. Dadoun and D. G. Kirkpatrick and T. Przytycka}, +title = {A simple parallel tree contraction algorithm}, +journal = ja, volume = 10, year = 1989, pages = {287-302}} + +@inproceedings{AbrahamsonEFM89, +author = {Karl R. Abrahamson and John A. Ellis and Michael R. Fellows and Manuel E. Mata}, +title = {On the Complexity of Fixed-Parameter Problems}, +booktitle = focs89, year = 1989, pages = {210-215}} + +@inproceedings{AbrahamsonFLM89, +author = {Karl R. Abrahamson and Michael R. Fellows and Michael A. Langston and B. M. E. Moret}, +title = {Constructive Complexity}, +year = 1989, +booktitle = {Proceedings of the Capital City Conference on Combinatorics and Theoretical Computer Science}} + +%Abrahamson90 + +@techreport{AbrahamsonEFM90, +author = {Karl R. Abrahamson and John A. Ellis and Michael R. Fellows and Manuel E. Mata}, +title = {Completeness for Families of Fixed Parameter Problems}, +institution = {University of Victoria}, +address = {Victoria, B.C., Canada}, +number = {DCS-141-IR}, +year = 1990, +note = {Extended abstract in Proc. 30th ACM Foundations of Computer Science, 1989, p. 210-215}} + +%Abrahamson93 + +@inproceedings{AbrahamsonDF93, +author = {Karl R. Abrahamson and Rodney G. Downey and Michael R. Fellows}, +title = {Fixed-parameter intractability {II}}, +editor = {Patrice Enjalbert and Alain Finkel and Klaus W. Wagner}, +booktitle = stacs93, year = 1993, publisher = lncs665, pages = {374-385}} + +@inproceedings{AbrahamsonF93, +author = {Karl R. Abrahamson and Michael R. Fellows}, +title = {Finite Automata, Bounded Treewidth and Well-Quasiordering}, +year = 1993, +editor = {N. Robertson and P. Seymour}, +booktitle = {Proceedings of the AMS Summer Workshop on Graph Minors, Graph Structure Theory, Contemporary Mathematics vol. 147}, +publisher = {American Mathematical Society}, pages = {539-564}} + +%Abrahamson95 + +@article{AbrahamsonDF95, +author = {Karl A. Abrahamson and Rodney G. Downey and Michael R. Fellows}, +title = {Fixed-Parameter Tractability and Completeness {IV}: On Completeness for {$W[P]$} and {PSPACE} Analogues}, +journal = apal, volume = 73, year = 1995, pages = {235-276}} + +@article{Abramson89, +author = {Bruce Abramson}, +title = {Control strategies for two-player games}, +journal = acmcs, volume = 21, year = 1989, pages = {137-162}} + +%Abu + +@article{AbuKhzamL07, +author = {Faisal N. Abu-Khzam and Michael A. Langston}, +title = {Linear-time algorithms for problems on planar graphs with fixed disk dimension}, +journal = ipl, volume = 101, year = 2007, pages = {36-40}} + +@inproceedings{AbuKhzamCFLSS04, +author = {Faisal N. Abu-Khzam and R. L. Collins and Michael R. Fellows and Michael A. Langston and +W. Henry Suters and C. T. Symons}, +title = {Kernelization algorithms for the Vertex Cover problem: Theory and experiments}, +booktitle = alenex04, pages = {62-69}, publisher = {ACM-SIAM}, year = 2004} + +@inproceedings{AbuKhzamLS05, +author = {Faisal N. Abu-Khzam and Michael A. Langston and W. Henry Suters}, +title = {Fast, effective vertex cover kernelization: a tal of two algorithms}, +booktitle = {Proceedings of the IEEE International Conference on Computer Systems and Applications, AICCSA 2005}, +year = 2005, pages = 16} + +@article{AbuKhzamFLS07, +author = {Faisal N. Abu-Khzam and Michael R. Fellows and Michael A. Langston and W. Henry Suters}, +title = {Crown structures for vertex cover kernelization}, +journal = tocs, volume = 41, year = 2007, pages = {411-430}} + +%Ad + +%Ada + +@inproceedings{AdachiIK81, +author = {A. Adachi and S. Iwata and T. Kasai}, +title = {Low level complexity for combinatorial games}, +booktitle = stoc81, year = 1981, pages = {228-237}, publisher = {Assoc. Comp. Mach.}, +address = {New York}} + +@article{AdachiIK84, +author = {A. Adachi and S. Iwata and T. Kasai}, +title = {Some combinatorial game problems require {$\Omega (n^k) $} time}, +journal = jacm, volume = 31, year = 1984, pages = {361-376}} + +@article{AdachiIK87, +author = {A. Adachi and S. Iwata and T. Kasai}, +title = {Shogi on $n \times n$ board is complete in exponential time ({I}n {J}apanese)}, +journal = {Trans. IEICE}, volume = {J70-D}, year = 1987, pages = {1843-1852}} + +%Adh + +@article{AdharP90, +author = {Gur Saran Adhar and Shietung Peng}, +title = {Parallel algorithms for cographs and parity graphs with applications}, +journal = ja, volume = 11, year = 1990, pages = {252-284}} + +%Adl + +@article{Adler04, +author = {Isolde Adler}, +title = {Marshals, monotone marshals, and hypertree-width}, +journal = jgt, volume = 47, year = 2004, pages = {275-296}} + +@article{Adler07, +author = {Isolde Adler}, +title = {Directed tree-width examples}, +journal = jctb, volume = 97, year = 2007, pages = {718-725}} + +%Ag + +%Aga + +@article{AgarwalKS98, +author = {P. K. Agarwal and M. {van Kreveld} and S. Suri}, +title = {Label placement by maximum independent set in rectangles}, +journal = cg, volume = 11, year = 1998, pages = {209-218}} + +@inproceedings{AgarwalaF93, +author = {Richa Agarwala and David Fern{\'a}ndez-Baca}, +title = {A polynomial-time algorithm for the perfect phylogeny problem when the number of character states is fixed}, +booktitle = focs93, year = 1993, pages = {140-147}} + +@inproceedings{AgarwalaFS92, +author = {Richa Agarwala and David Fern{\'a}ndez-Baca and G. Slutzki}, +title = {Fast algorithms for inferring evolutionary trees}, +booktitle = {Proceedings of the 30th Alllerton Conference on Comm., Control, and Comput.}, +year = 1992, pages = {594-603}} + +%Age + +@unpublished{Ageev99, +author = {A. A. Ageev}, +title = {Approximation schemes for the planar graph cases of feedback vertex set and uncapacitated facility location}, +year = 1999, +note = {Unpublished manuscript}} + +%Agg + +@article{AggarwalKLLW91, +author = {A. Aggarwal and M. Klawe and D. Lichtenstein and N. Linial and A. Wigderson}, +title = {A lower bound on the area of permutation layents}, +journal = alg, volume = 6, year = 1991, pages = {241-255}} + +@article{AggarwalKS91, +author = {A. Aggarwal and M. Klawe and P. Shor}, +title = {Multilayer grid embeddings in {VLSI}}, +journal = alg, volume = 6, year = 1991, pages = {129-151}} + +%Agr + +@incollection{AgrawalKR93, +author = {Ajir Agrawal and Philip N. Klein and R. Ravi}, +title = {Cutting down on fill using nested dissection: provably good elimination orderings}, +booktitle = {Graph Theory and Sparse Matrix Computation}, +editor = {A. George and J. Gilbert and J. W. H. Liu}, +series = {IMA Volumes in Mathematics and its Applicatins}, +publisher = {Springer-Verlag}, year = 1993, volume = 56, pages = {31-55}} + +%Ah + +%Aho + +@book{AhoHU74, +author = {A. V. Aho and J. E. Hopcroft and J. D. Ullman}, +title = {The Design and Analysis of Computer Algorithms}, +year = 1974, publisher = {Addison-Wesley}} + +%Ahu + +@book{AhujaMO93, +author = {R. K. Ahuja and T. L. Magnanti and J. B. Orlin}, +title = {Network Flows: Theory, Algorithms, and Applications}, +address = {Upper Saddle River, NJ, USA}, +publisher = {Prentice Hall}, year = 1993} + +%Ai + +@article{AignerF84, +author = {M. Aigner and M. Fromme}, +title = {A game of cops and robbers}, +journal = dam, volume = 8, year = 1984, pages = {1-12}} + +%Ak + +@article{AkiyamaNS80, +author = {T. Akiyama and Takao Nishizeki and N. Saito}, +title = {{NP}-completeness of the {H}amiltonian cycle problem for bipartite graphs}, +journal = jip, volume = 3, year = 1980, pages = {73-76}} + +@article{AkiyamaEH83, +author = {Jin Akiyama and Hiroski Era and Frank Harary}, +title = {Regular graphs containing a given graph}, +journal = elemmath, volume = 83, year = 1983, pages = {15-17}} + +%Al + +%Alb + +%Alber 2001 + +@article{AlberFN01, +author = {Jochen Alber and Henning Fernau and Rolf Niedermeier}, +title = {Parameterized complexity: {E}xponential speed-up for planar graph problems}, +journal = {Electronic Colloquium on Computational Complexity (ECCC)}, +year = 2001} + +@inproceedings{AlberFN01a, +author = {Jochen Alber and Henning Fernau and Rolf Niedermeier}, +title = {Parameterized complexity: exponential speed-up for planar graph problems}, +editor = {Fernando Orejas and Paul G. Spirakis and Jan van Leeuwen}, +booktitle = icalp01, publisher = lncs2076, year = 2001, pages = {261-272}} + +@article{AlberGN01, +author = {Jochen Alber and J. Gramm and Rolf Niedermeier}, +title = {Faster exact algorithms for hard problems: {A} parameterized point of view}, +journal = dm, volume = 229, year = 2001, pages = {3-27}} + +%Alber 2002 + +@phdthesis{Alber02, +author = {Jochen Alber}, +title = {Exact Algorithms for {NP}-hard Problems on Networks: Design, Analysis, and Implementation}, +year = 2002, school = {Universit\"at T\"ubingen}, +address = {T\"ubingen, Germany}} + +@article{AlberBFKN02, +author = {Jochen Alber and Hans L. Bodlaender and Henning Fernau and Ton Kloks and Rolf Niedermeier}, +title = {Fixed parameter algorithms for dominating set and related problems on planar graphs}, +journal = alg, volume = 33, year = 2002, pages = {461-493}} + +@inproceedings{AlberN02, +author = {Jochen Alber and Rolf Niedermeier}, +title = {Improved tree decomposition based algorithms for domination-like problems}, +editor = {Sergio Rajsbaum}, +booktitle = latin02, publisher = lncs2286, year = 2002, pages = {613-627}} + +%Alber 2003 + +@article{AlberFN03, +author = {Jochen Alber and Henning Fernau and Rolf Niedermeier}, +title = {Graph separators: A parameterized view}, +journal = jcss, volume = 67, year = 2003, pages = {808-832}} + +%Alber 2004 + +@article{AlberDN04, +author = {Jochen Alber and F. Dorn and Rolf Niedermeier}, +title = {Experimental evaluation of a tree decomposition based algorithm for vertex cover on planar graphs}, +journal = dam, volume = 145, pages = {210-219}, year = 2005} + +@article{AlberFN04, +author = {Jochen Alber and Michael R. Fellows and Rolf Niedermeier}, +title = {Polynomial-time data reduction for dominating sets}, +journal = jacm, volume = 51, year = 2004, pages = {363-384}} + +@article{AlberFN04a, +author = {Jochen Alber and Henning Fernau and Rolf Niedermeier}, +title = {Parameterized complexity: Exponential speed-up for planar graph problems}, +journal = ja, volume = 52, year = 2004, pages = {26-56}} + +%Alber 2005 + +@article{AlberFFFNRS05, +author = {J. Alber and H. Fan and M. R. Fellows and H. Fernau and R. Niedermeier and F. A. Rosamond and U. Stege}, +title = {A refined search tree technique for dominating set on planar graphs}, +journal = jcss, volume = 71, year = 2005, pages = {385-405}} + +%Alber 2006 + +@article{AlberBN06, +author = {J. Alber and N. Betzler and R. Niedermeier}, +title = {Experiments in data reduction for optimal domination in networks}, +journal = aor, volume = 146, year = 2006, pages = {105-117}} + +@inproceedings{AlberDN06, +author = {Jochen Alber and Britta Dorn and Rolf Niedermeier}, +title = {A general data reduction scheme for domination in graphs}, +editor = {Jir\'{\i} Wiedermann and Gerard Tel and Jaroslav Pokorn{\'y} and M{\'a}ria Bielikov{\'a} and Julius Stuller}, +booktitle = sofsem06, year = 2006, publisher = lncs3831, pages = {137-147}} + +%All + +@article{AllanL78, +author = {R. B. Allan and R. C. Laskar}, +title = {On domination and independent domination number of graphs}, +journal = dm, volume = 23, year = 1978, pages = {73-76}} + +%Als + +@article{AlspachDHY08, +author = {Brian Alspach and Danny Dyer and Denis Hanson and Boting Yang}, +title = {Time constrained graph searching}, +journal = tcs, volume = 399, year = 2008, pages = {158-168}} + +@article{AlstrupLT00, +author = {S. Alstrup and P. W. Lauridsen and M. Thorup}, +title = {Generalized dominators for structured programs}, +journal = alg, volume = 27, pages = {244-253}, year = 2000} + +%Alt + +@inproceedings{AltBKRT07, +author = {Helmut Alt and Hans L. Bodlaender and Marc van Kreveld and G\"{u}nther Rote and Gerard Tel}, +title = {Wooden Geometric Puzzles: {D}esign and Hardness Proofs}, +editor = {Pierluigi Crescenzi and Giuseppe Prencipe and Geppino Pucci}, +booktitle = {Proceedings 4th International Conference on Fun with Algorithms, FUN 2007}, +publisher = lncs4475, year = 2007, pages = {16 - 29}} + + +%Alo + +%Alon 1986 + +@article{AlonBI86, +author = {Noga Alon and L. Babai and A. Itai}, +title = {A fast and simple randomized parallel algorithm for the maximal independent set problem}, +journal = ja, volume = 7, year = 1986, pages = {567-583}} + +%Alon 1989 + +@techreport{AlonST89, +author = {Noga Alon and Paul D. Seymour and Robin Thomas}, +title = {A separator theorem for non-planar graphs}, +year = 1989, institution = {DIMACS}, type = {Technical Report}, +number = {89-18}, pages = {1-9}, month = {11}} + +%Alon 1990 + +@inproceedings{AlonST90, +author = {Noga Alon and Paul D. Seymour and Robin Thomas}, +title = {A separator theorem for graphs with an excluded minor and applications}, +booktitle = stoc90, publisher = {ACM Press}, year = 1990, +address = {New York}} + +@article{AlonST90a, +author = {Noga Alon and Paul D. Seymour and Robin Thomas}, +title = {A separator theorem for non-planar graphs}, +journal = jacm, volume = 3, year = 1990, pages = {801-808}} + +%Alon 1994 + +@article{AlonST94, +author = {Noga Alon and Paul D. Seymour and Robin Thomas}, +title = {Planar separators}, +journal = sjdm, volume = 7, year = 1994, pages = {184-193}} + +%Alon 2002 + +@article{AlonHL02, +author = {N. Alon and S. Hoory and N. Linial}, +title = {The {M}oore bound for irregular graphs}, +journal = gc, volume = 18, year = 2002, pages = {53-57}} + +%Alon 2009 + +@article{AlonG09, +author = {Noga Alon and Shai Gutner}, +title = {Linear time algorithms for finding a dominating set of fixed size in degenerate graphs}, +journal = alg, volume = 54, year = 2009, pages = {544-556}} + +@article{AlonS09, +author = {Noga Alon and Uri Stav}, +title = {Hardness of edge-modification problems}, +journal = tcs, volume = 410, year = 2009, pages = {4920-4927}} + +%Am + +%Ame + +@article{AmestoyDD96, +author = {Patrick R. Amestoy and Timothy A. Davis and Iain S. Duff}, +title = {An Approximate Minimum Degree Ordering Algorithm}, +journal = sjmaa, volume = 17, year = 1996, pages = {886-905}} + +%Ami + +@inproceedings{Amir01, +author = {E. Amir}, +title = {Efficient approximation for triangulation of minimum treewidth}, +editor = {Jack S. Breese and Daphne Koller}, +booktitle = uai01, pages = {7-15}, year = 2001, publisher = {Morgan Kaufmann}} + +@article{Amir10, +author = {E. Amir}, +title = {Approximation algorithms for treewidth}, +journal = alg, volume = 56, year = 2010, pages = {448-479}} + +%An + +%And + +@article{Andrea84, +author = {T. Andrea}, +title = {Note on a pursuit game played on graphs}, +year = 1984, journal = dam, volume = 9, pages = {111-115}} + +@article{Andrea86, +author = {T. Andrea}, +title = {On a pursuit game played on graphs for which a minor is excluded}, +year = 1986, journal = jctb, volume = 41, pages = {37-47}} + +@article{Andres06, +author = {Stephan Dominique Andres}, +title = {The game chromatic index of forests of maximum degree}, +journal = dam, volume = 154, year = 2006, pages = {1317-1323}} + +@article{Andrzejak98, +author = {A. Andrzejak}, +title = {An algorithm for the {T}utte polynomials of graphs of bounded treewidth}, +journal = dm, volume = 190, year = 1998, pages = {39-54}} + +%Ans + +@article{Anstee85, +author = {R. P. Anstee}, +title = {An algorithmic proof of {T}utte's $f$-factor theorem}, +journal = ja, volume = 6, year = 1985, pages = {112-131}} + +%Ap + +%Apo + +@article{ApostolicoH87, +author = {Alberto Apostolico and Susanne E. Hambrusch}, +title = {Finding maximum cliques on circular-arc graphs}, +journal = ipl, volume = 26, year = 1987, pages = {209-215}} + +%App + +@article{AppelH77, +author = {K. Appel and W. Haken}, +title = {Every planar map is 4-colorable}, +journal = {Illinois Journal of Mathematics}, volume = 21, year = 1977, pages = {429-567}} + +@inproceedings{AppelgateBCC98, +author = {D. Appelgate and B. Bixby and V. CHv{\'{a}}tal and W. Cook}, +title = {On the solution of travelling salesman problems}, +booktitle = {Proceedings of the International Congress of Mathematicians}, +volume = {III}, address = {Berlin}, year = 1998, pages = {645-656}} + +%Ar + +%Ara + +@article{Araki09, +author = {Toru Araki}, +title = {Labeling bipartite permutation graphs with a condition at distance two}, +journal = dam, volume = 157, year = 2009, pages = {1677-1686}} + +%Arc + +@article{Archdeacon83, +author = {D. Archdeacon}, +title = {A {K}uratowski theorem for the projective plane}, +journal = jgt, volume = 7, year = 1983, pages = {325-334}} + +@unpublished{ArchdeaconFL88, +author = {D. Archdeacon and Michael R. Fellows and Michael A. Langston}, +title = {Fixed Genus Embedding in {$O(n^4)$} Time}, +note = {In preparation}, +year = 1988 +} + +%Ari + +@article{ArikatiCZ98, +author = {Srinivasa R. Arikati and Shiva Chaudhuri and Christos D. Zaroliagis}, +title = {All-pairs min-cut in sparse networks}, +journal = ja, volume = 29, year = 1998, pages = {82-110}} + +%Arn + +%Arnborg 1978 + +@article{Arnborg78, +author = {Stefan Arnborg}, +title = {Reduced State Enumeration --- Another Algorithm for Reliability Evaluation}, +journal = {IEEE Transactions on Reliability}, volume = {R-27}, year = 1978, pages = {101-105}} + +%Arnborg 1985 + +@article{Arnborg85, +author = {Stefan Arnborg}, +title = {Efficient algorithms for combinatorial problems on graphs with bounded decomposability -- {A} Survey}, +journal = bit, volume = 25, year = 1985, pages = {2-23}} + +@article{ArnborgP85, +author = {Stefan Arnborg and Andrzej Proskurowski}, +title = {Recognition of partial $k$-trees}, +journal = cn, volume = 47, year = 1985, pages = {69-75}} + +%Arnborg 1986 + +@article{ArnborgP86, +author = {Stefan Arnborg and Andrzej Proskurowski}, +title = {Characterization and recognition of partial 3-trees}, +journal = sjadm, volume = 7, year = 1986, pages = {305-314}} + +%Arnborg 1987 + +@article{ArnborgCP87, +author = {Stefan Arnborg and Derek G. Corneil and Andrzej Proskurowski}, +title = {Complexity of finding embeddings in a $k$-tree}, +journal = sjadm, volume = 8, year = 1987, pages = {277-284}} + +%Arnborg 1989 + +@article{ArnborgP89, +author = {Stefan Arnborg and Andrzej Proskurowski}, +title = {Linear time algorithms for {NP}-hard problems restricted to +partial $k$-trees}, +journal = dam, volume = 23, year = 1989, pages = {11-24}} + +%Arnborg 1990 + +@article{ArnborgPC90, +author = {Stefan Arnborg and Andrzej Proskurowski and Derek G. Corneil}, +title = {Forbidden minors characterization of partial 3-trees}, +journal = dm, volume = 80, year = 1990, pages = {1-19}} + +@inproceedings{ArnborgPS90, +author = {S. Arnborg and A. Proskurowski and D. Seese}, +title = {Monadic second order logic, tree automata and forbidden minors}, +editor = {E. B\"{o}rger and H. {Kleine B\"{u}ning} and M. M. Richter and W. Sch\"{o}nfeld}, +booktitle = {Proceedings 4th Workshop on Computer Science Logic, CSL'90}, +publisher = lncs533, year = 1991, pages = {1-16}} + +%Arnborg 1991 + +@unpublished{Arnborg91a, +author = {Stefan Arnborg}, +title = {Some {PSPACE}-Complete Logic Decision Problems that become +Linear Time Solvable on Formula Graphs of Bounded Treewidth}, +year = 1991, note = {Manuscript}} + +@article{ArnborgLS91, +author = {Stefan Arnborg and Jens Lagergren and Detlef Seese}, +title = {Easy problems for tree-decomposable graphs}, +journal = ja, year = 1991, volume = 12, pages = {308-340}} + +%Arnborg 1992 + +@unpublished{Arnborg92, +author = {Stefan Arnborg}, +title = {Decomposability helps for deciding logics of knowledge and belief}, +year = 1992, note = {Manuscript}} + +@article{ArnborgP92, +author = {S. Arnborg and A. Proskurowski}, +title = {Canonical representations of partial 2- and 3-trees}, +journal = bit, volume = 32, year = 1992, pages = {197-214}} + +%Arnborg 1993 + +@article{Arnborg93, +author = {Stefan Arnborg}, +title = {Graph Decompositions and Tree Automata in Reasoning with Uncertainty}, +journal = {Journal of Experimental \& Theoretical Artificial Intelligence}, +volume = 5, year = 1993, pages = {335-357}} + +@article{ArnborgCPS93, +author = {Stefan Arnborg and Bruno Courcelle and Andrzej Proskurowski and Detlef Seese}, +title = {An algebraic theory of graph reduction}, +journal = jacm, volume = 40, year = 1993, pages = {1134-1164}} + +%Aro + +@inproceedings{AroraKM95, +author = {S. Arora and D. Karger and M. Karpinski}, +title = {Polynomial time approximation schemes for dense instances of {NP}-hard problems}, +year = 1995, booktitle = stoc95, pages = {284-293}} + +@article{Arora03, +author = {S. Arora}, +title = {Approximation schemes for {NP}-hard geometric optimization problems: A survey}, +journal = mp, volume = 97, year = 2003, pages = {43-69}} + +%As + +%Asa + +@article{Asano85, +author = {T. Asano}, +title = {An approach to the subgraph homeomorphism problem}, +journal = tcs, volume = 38, year = 1985, pages = {249-267}} + +%Asp + +@article{AspvallH94, +author = {Bengt Aspvall and P. Heggernes}, +title = {Finding minimum height elimination trees for interval graphs in polynomial time}, +journal = bit, volume = 34, year = 1994, pages = {484-509}} + +@article{Aspvall95, +author = {Bengt Aspvall}, +title = {Minimizing elimination tree height can increase fill more than linearly}, +journal = ipl, volume = 56, year = 1995, pages = {115-120}} + +@article{AspvallPT00, +author = {B. Aspvall and A. Proskurowski and J. A. Telle}, +title = {Memory requirements for table computations in partial $k$-tree algorithms}, +journal = alg, volume = 27, year = 2000, pages = {382-394}} + +%Ass + +@article{AssmanPSZ81, +author = {S. F. Assman and G. W. Peck and Maciej M. Sys{\l}o and J. Zak}, +title = {The bandwidth of caterpillars with hairs of length 1 and 2}, +year = 1981, journal = sjadm, volume = 2, pages = {387-392}} + +%At + +%Ata + +@article{AtallahMJ88, +author = {M. J. Atallah and G. K. Manacher and J. Urrutia}, +title = {Finding a maximum independent dominating set in a permutation graph}, +journal = dam, volume = 21, year = 1988, pages = {177-183}} + +@inproceedings{AtallahCL93, +author = {M. J. Atallah and D. Z. Chen and D. T. Lee}, +title = {An optimal algorithm for shortest paths on weighted interval and +circular-arc graphs, with applications}, +editor = {Thomas Lengauer}, +year = 1993, booktitle = esa93, pages = {13-24}, publisher = lncs726} + +%Au + +%Aus + +@book{AusielloCGKMP99, +author = {Giorgio Ausiello and Pierluigi Crescenzi and Giorgio Gambosi and +Viggo Kann and Alberto {Marchetti-Spaccamela} and Marco Protasi}, +title = {Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties}, +publisher = {Springer}, +address = {Berlin}, +year = 1999} + +%B + +%Ba + +%Bab + +@article{Babel98, +author = {Luitpold Babel}, +title = {Triangulating graphs with few {$P_4$}'s}, +journal = dam, volume = 89, year = 1998, pages = {45-57}} + +@article{BabelO98, +author = {Luitpold Babel and S. Olariu}, +title = {On the structure of graphs with few {$P_4$}'s}, +journal = dam, volume = 84, year = 1998, pages = {1-13}} + +@article{Babel00, +author = {Luitpold Babel}, +title = {Recognition and isomorphism of tree-like {$P_4$}-connected graphs}, +journal = dam, volume = 99, year = 2000, pages = {295-315}} + +%Bac + +%Bachoore 2004 + +@misc{Bachoore04, +author = {Emgad Bachoore}, +note = {Work in progress}, +year = 2004} + +@techreport{BachooreB04, +author = {Emgad Bachoore and Hans L. Bodlaender}, +title = {New upper bound heuristics for treewidth}, +number = {UU-CS-2004-036}, +institution = {Institute for Information and Computing Sciences, Utrecht University}, +year = 2004, address = {Utrecht, The Netherlands}} + +%Bachoore 2005 + +@inproceedings{BachooreB05, +author = {Emgad H. Bachoore and Hans L. Bodlaender}, +title = {New upper bound heuristics for treewidth}, +editor = {Sotiris E. Nikoletseas}, +booktitle = wea05, publisher = lncs3503, year = 2005, pages = {217-227}} + +%Bachoore 2006 + +@inproceedings{BachooreB06, +author = {Emgad H. Bachoore and Hans L. Bodlaender}, +title = {A branch and bound algorithm for exact, upper, and lower bounds on treewidth}, +editor = {Siu-Wing Cheng and Chung Keung Poon}, +booktitle = {Proceedings of the 2nd International Conference on Algorithmic Aspects +in Information and Management, AAIM 2006}, +publisher = lncs4041, year = 2006, pages = {255-266}} + +@techreport{BachooreB06a, +author = {Emgad H. Bachoore and Hans L. Bodlaender}, +title = {Weighted Treewidth. Algorithmic Techniques and Results}, +number = {UU-CS-2006-012}, +institution = {Department of Information and Computing Sciences, Utrecht +University}, +year = 2006, address = {Utrecht, The Netherlands}, +note = {Available at http://www.cs.uu.nl/people/bachoore}} + +@techreport{BachooreB06b, +author = {Emgad H. Bachoore and Hans L. Bodlaender}, +title = {Convex recoloring of leaf-colored trees}, +number = {UU-CS-2006-010}, +institution = {Department of Information and Computing Sciences, Utrecht +University}, +year = 2006, address = {Utrecht, The Netherlands}} + +%Bad + +@inproceedings{BaderW97, +author = {M. Bader and R. Weibel}, +title = {Detecting and resolving size and proximity conflicts in the generalization of polygonal maps}, +booktitle = {Proceedings of the 18th International Cartographic Conference}, +address = {Stockholm}, +year = 1997} + +%Baf + +@article{BafnaBF99, +author = {V. Bafna and P. Berman and T. Fujito}, +title = {A 2-approximation algorithm for the undirected feedback vertex set problem}, +journal = sjdm, volume = 12, year = 1999, pages = {289-297}} + +%Bak + +@article{Baker94, +author = {B. S. Baker}, +title = {Approximation algorithms for {NP}-complete problems on planar graphs}, +journal = jacm, volume = 41, year = 1994, pages = {153-180}} + +@techreport{BakkerLT90, +author = {Erwin M. Bakker and Jan {van Leeuwen} and Richard B. Tan}, +title = {Perfect Colorings}, +number = {RUU-CS-90-35}, +year = 1990, +institution = {Department of Computer Science, Utrecht University}, +address = {Utrecht}, +type = {Technical Report}} + +@article{BakkerLT91, +author = {Erwin M. Bakker and Jan {van Leeuwen} and Richard B. Tan}, +title = {Linear Interval Routing Schemes}, +journal = {Algorithms Review}, volume = 2, year = 1991, pages = {45-61}} + +@misc{BakkerLT94, +author = {Erwin M. Bakker and Jan {van Leeuwen} and Richard B. Tan}, +note = {Work in progress}} + +@article{BalakrishnanD03, +author = {Hemant Balakrishnan and Narsingh Deo}, +title = {Parallel algorithm for radiocoloring a graph}, +journal = cn, volume = 160, year = 2003, pages = {193-204}} + +%Ban + +@article{BandeltM86, +author = {Hans-J{\"{u}}rgen Bandelt and Henry Martijn Mulder}, +title = {Distance-Hereditary Graphs}, +journal = jctb, volume = 41, year = 1986, pages = {182-208}} + +@techreport{BandeltDMMS88, +author = {Hans-J\"{u}rgen Bandelt and Allessandro D'Atri and Marina Moscarini +and Henry Martijn Mulder and Anselm Schultze}, +title = {Operations on Distance-Hereditary Graphs}, +year = 1988, number = {R.226}, +institution = {Istitutio di Analisi dei Sistemi ed Informatica}, +address = {Rome}} + +%Bar + +@article{BarYehudaE85, +author = {Reuven Bar-Yehuda and Simon Even}, +title = {A local-ratio theorem for approximating the weighted vertex cover problem}, +journal = adm, volume = 25, year = 1985, pages = {27-46}} + +@inproceedings{BarYehudaFR05, +author = {Reuven Bar-Yehuda and Ido Feldman and Dror Rawitz}, +title = {Improved approximation algorithm for convex recoloring of trees}, +editor = {Thomas Erlebach and Giuseppe Persiano}, +booktitle = waoa05, publisher = lncs3879, pages = {55-68}, year = 2006} + +@article{BarYehudaFR08, +author = {Reuven Bar-Yehuda and Ido Feldman and Dror Rawitz}, +title = {Improved approximation algorithm for convex recoloring of trees}, +journal = tocs, volume = 43, year = 2008, pages = {3-18}} + +@inproceedings{BarYehudaGNR94, +author = {Reuven Bar-Yehuda and D. Geiger and J. Naor and R. M. Roth}, +title = {Approximation algorithms for the vertex feedback set problem with +applications to constraint satisfaction and {B}ayesian inference}, +booktitle = soda94, year = 1994, pages = {344-354}} + +@article{BarrettJM00, +author = {Christopher L. Barrett and Riko Jacob and Madhav V. Marathe}, +title = {Formal-language-constrained path problems}, +journal = siamjc, volume = 30, year = 2000, pages = {809-837}} + +@article{BarrettHMRRS06, +author = {Christopher L. Barrett and Harry B. {Hunt III} and Madhav V. Marathe +and S. S. Ravi and Daniel J. Rosenkrantz and Richard E. Stearns}, +title = {Complexity of reachability problems for finite discrete dynamical systems}, +journal = jcss, year = 2006, volume = 72, pages = {1317-1345}} + +@article{BarthFH02, +author = {D. Barth and P. Fragopoulou and M.-C. Heydemann}, +title = {Uniform emulations of {C}artesian-product and {C}ayley graphs}, +journal = dam, volume = 116, year = 2002, pages = {37-54}} + +%Bat + +@inproceedings{BattistaN86, +author = {Di Battista, G. and E. Nardelli}, +title = {An Algorithm for Testing Planarity of Hierarchical Graphs}, +booktitle = wg86, publisher = lncs246, year = 1986, pages = {277-289}} + +@techreport{BattistaT89, +author = {Di Battista, Giuseppe and Roberto Tamassia}, +title = {On-Line Planarity Testing}, +number = {CS-89-31}, +institution = {???}, +year = 1989} + +@book{BattistaETT99, +author = {Di Battista, Giuseppe and Peter Eades and Roberto Tamassia and +Ioannis G. Tollis}, +title = {Graph Drawing. Algorithms for the Visualization of Graphs}, +publisher = {Prentice Hall}, +address = {Upper Saddle River, New Jersey, USA}, +year = 1999} + +%Bau + +@article{BauderonC87, +author = {M. Bauderon and Bruno Courcelle}, +title = {Graph expressions and graph rewritings}, +journal = mst, volume = 20, year = 1987, pages = {83-127}} + +%Bax + +@article{Bax93, +author = {E. T. Bax}, +title = {Inclusion and exclusion algorithm for the {H}amiltonian path problem}, +journal = ipl, volume = 47, year = 1993, pages = {203-207}} + +%Baz + +@article{BazganTV06, +author = {Christina Bazgan and Zsolt Tuza and Daniel Vanderpooten}, +title = {Degree-constrained decompositions of graphs: Bounded treewidth and planarity}, +journal = tcs, volume = 355, year = 2006, pages = {389-395}} + +%Be + +%Bec + +@inproceedings{BeckerG96, +author = {A. Becker and D. Geiger}, +title = {A sufficiently fast algorithm for finding close to optimal junction trees}, +editor = {Dan Geiger and Prakash P. Shenoy}, +booktitle = uai96, publisher = {Morgan Kaufmann}, year = 1996, pages = {81-96}} + +@article{BeckerG96a, +author = {A. Becker and D. Geiger}, +title = {Optimization of {P}earl's method of conditioning and greedy-like +approximation algorithms for the vertex feedback set problem}, +journal = artint, volume = 83, year = 1996, pages = {167-188}} + +@article{BeckerBG00, +author = {Ann Becker and Reuven Bar-Yehuda and Dan Geiger}, +title = {Randomized algorithms for the loop cutset problem}, +journal = jair, volume = 12, year = 2000, pages = {219-234}} + +@article{BeckerG01, +author = {Ann Becker and Dan Geiger}, +title = {A sufficiently fast algorithm for finding close to optimal clique trees}, +journal = artint, volume = 125, year = 2001, pages = {3-17}} + +%Beh + +@book{BehzadCL79, +author = {M. Behzad and G. Chartrand and L. Lesniak-Foster}, +title = {Graphs and Digraphs}, +year = 1979, +publisher = {Pindle, Weber \& Schmidt}, +address = {Boston}} + +%Bei + +@article{BeigelE05, +author = {R. Beigel and D. Eppstein}, +title = {3-coloring in {$O(1.3289^n)$} time}, +journal = ja, volume = 54, year = 2005, pages = {168-204}} + +@article{BeinBT85, +author = {W. W. Bein and P. Bruckner and A. Tamir}, +title = {Minimum cost flow algorithms for series-parallel networks}, +journal = dam, volume = 10, year = 1985, pages = {117-124}} + +@article{BeinekeP71, +author = {L. W. Beineke and R. E. Pippert}, +title = {Properties and characterizations of $k$-trees}, +journal = math, volume = 18, year = 1971, pages = {141-151}} + +@inproceedings{BeinlichSCC89, +author = {I. Beinlich and G. Suermondt and R. Chavez and G. Cooper}, +title = {The {ALARM} monitoring system: A case study with two probabilistic inference techniques for belief networks}, +booktitle = {Proceedings of the 2nd European Conference on AI and Medicine}, +publisher = {Springer-Verlag}, +year = 1989, pages = {247-256}} + +%Bel + +@article{BellenbaumD02, +author = {P. Bellenbaum and R. Diestel}, +title = {Two short proofs concerning tree-decompositions}, +journal = cpc, volume = 11, year = 2002, pages = {541-547}} + +@book{BellmanD62, +author = {R. E. Bellman and S. E. Dreyfus}, +title = {Applied Dynamic Programming}, +publisher = {Princeton University Press}, +address = {Princeton, N.J., USA}, +year = 1962} + +%Ben + +@article{Bentz08, +author = {C\'{e}dric Bentz}, +title = {On the complexity of the multicut problem in bounded tree-width graphs and digraphs}, +journal = dam, volume = 156, year = 2008, pages = {1908-1917}} + +%Ber + +%Berg + +@techreport{BergOK89, +author = {Mark de Berg and Mark Overmars and Marc van Kreveld}, +title = {Finding Complete Bipartite Subgraphs in Bipartite Graphs}, +institution = {Department of Computer Science, Utrecht University}, +number = {RUU-CS-89-30}, year = 1989, address = {Utrecht, The Netherlands}} + +@book{Berge73, +author = {C. Berge}, +title = {Graphs and Hypergraphs}, +publisher = {North-Holland}, address = {Amsterdam}, +year = 1973 } + +@book{Berge85, +author = {C. Berge}, +title = {Graphs}, +publisher = {North-Holland}, address = {Amsterdam}, +year = 1985 } + +@article{BergerFNP07, +author = {A. Berger and Takuro Fukunaga and Hiroshi Nagamochi and Ojas Parekh}, +title = {Approximability of the capacitated $b$-edge dominating set problem}, +journal = tcs, volume = 385, year = 2007, pages = {202-213}} + +%Berl + +@book{BerlekampCG82a, +author = {E. R. Berlekamp and J. H. Conway and R. K. Guy}, +title = {Winning Ways for your mathematical plays, Volume 1: Games in +General}, +publisher = {Academic Press}, +address = {New York}, +year = 1982 } + +@book{BerlekampCG82b, +author = {E. R. Berlekamp and J. H. Conway and R. K. Guy}, +title = {Winning Ways for your mathematical plays, Volume 2: Games in +Particular}, +publisher = {Academic Press}, +address = {New York}, +year = 1982 } + +%Berm + +@article{BermanJLSS90, +author = {Fran Berman and David Johnson and Tom Leighton and Peter W. Shor and Larry Snyder}, +title = {Generalized planar matching}, +journal = ja, volume = 11, year = 1990, pages = {153-185}} + +%Bern + +@article{BernLW87, +author = {M. W. Bern and Eugene L. Lawler and A. L. Wong}, +title = {Linear time computation of optimal subgraphs of decomposable graphs}, +journal = ja, volume = 8, year = 1987, pages = {216-235}} + +@article{BernP90, +author = {Marshall Bern and Paul Plassmann}, +title = {The {S}teiner problem with edge lengths 1 and 2}, +journal = ipl, volume = 32, year = 1989, pages = {171-176}} + +@inproceedings{BernH96, +author = {Marshall W. Bern and Barry Hayes}, +title = {The Complexity of Flat Origami}, +year = 1996, pages = {175-183}, +booktitle = soda96} + +@article{BernhartK79, +author = {F. Bernhart and B. Kainen}, +title = {The book thickness of a graph}, +journal = jctb, volume = 27, year = 1979, pages = {320-331}} + +%Berr + +%Berry 1997 + +@techreport{BerryB97, +author = {A. Bery and J.-P. Bordat}, +title = {Decomposition by clique minimal separators}, +type = {Research Report}, +institution = {LIM}, address = {Marseille}, year = 1997} + +%Berry 1998 + +@phdthesis{Berry98, +author = {A. Berry}, +title = {D\'{e}sarticulation d'un graphe}, +school = {Universit\'{e} Montpellier II}, +year = 1998} + +@article{BerryB98, +author = {A. Berry and J.-P. Bordat}, +title = {Separability generalizes {D}irac's theorem}, +journal = dam, volume = 84, year = 1998, pages = {43-53}} + +%Berry 1999 + +@inproceedings{Berry99, +author = {A. Berry}, +title = {A Wide-Range Efficient Algorithm for Minimal Triangulation}, +booktitle = "{SODA}'99: {ACM}-{SIAM} Symposium on Discrete Algorithms", +year = "1999", pages ={860-861}} + +@inproceedings{BerryBC99, +author = {A. Berry and J.-P. Bordat and O. Cogis}, +title = {Generating all the minimal separators of a graph}, +editor = {Peter Widmayer and Gabriele Neyer and Sephan Eidenbenz}, +booktitle = wg99, publsiher = lncs1665, year = 1999, pages = {167-172}} + +%Berry 2000 + +@article{BerryBC00, +author = {Anne Berry and Jean-Paul Bordat and Olivier Cogis}, +title = {Generating all the minimal separators of a graph}, +journal = ijfcs, volume = 11, year = 2000, pages = {397-404}} + +@article{BerryBH00, +author = {Anne Berry and Jean-Paul Bordat and Pinar Heggernes}, +title = {Recognizing weakly triangulated graphs by edge separability}, +journal = nordicjc, volume = 7, year = 2000, pages = {164-177}} + +%Berry 2001 + +@inproceedings{BerryB01, +author = {Anne Berry and Jean-Paul Bordat}, +title = {Moplex elimination orderings}, +editor = {Johann Hurink and Stefan Pickl and Hajo Broersma and Ulrich Faigle}, +booktitle = {Proceedings of the 1st Cologne-Twente Workshop on Graphs and Combinatorial +Optimization, Electronic Notes in Discrete Mathematics 8}, +year = 2001, pages = {6 -- 9}} + +%Berry 2002 + +@inproceedings{BerryBH02, +author = {Anne Berry and Jean R. S. Blair and Pinar Heggernes}, +title = {Maximum cardinality search for computing minimal triangulations}, +editor = {Lud\u{e}k Ku\u{c}era}, +booktitle = wg02, publisher = lncs2573, year = 2002, pages = {1-12}} + +%Berry 2003 + +@inproceedings{BerryHS03, +author = {Anne Berry and Pinar Heggernes and Genevi\`{e}ve Simonet}, +title = {The minimum degree heuristic and the minimal triangulation process}, +editor = {Hans L. Bodlaender}, +booktitle = wg03, publisher = lncs2880, year = 2003, pages = {58-70}} + +@inproceedings{BerryJV03, +author = {Anne Berry and Pinar Heggernes and Yngve Villanger}, +title = {A vertex incremental approach for dynamically maintaining chordal graphs}, +editor = {Toshihide Ibaraki and Naoki Katoh and Hirotaka Ono}, +booktitle = isaac03, publisher = lncs2906, pages = {47-57}, year = 2003} + +%Berry 2004 + +@article{BerryBHP04, +author = {Anne Berry and Jean Blair and Pinar Heggernes and Barry Peyton}, +title = {Maximum cardinality search for computing minimal triangulations of graphs}, +journal = alg, volume = 39, year = 2004, pages = {287-298}} + +%Berry 2005 + +@inproceedings{BerryKS05, +author = {Anne Berry and Richard Krueger and Genevi\`{e}ve Simonet}, +title = {Ultimate generalizations of {LexBFS} and {LEX M}}, +editor = {Dieter Kratsch}, +booktitle = wg05, year = 2005, publisher = lncs3787, pages = {199-213}} + +%Berry 2006 + +@article{BerryBHSV06, +author = {Anne Berry and Jean-Paul Bordat and Pinar Heggernes and Genevi\`{e}ve Simonet and Yngve Villanger}, +title = {A wide-range algorithm for minimal triangulation from an arbitrary ordering}, +journal = ja, volume = 58, year = 2006, pages = {33-66}} + +@article{BerryHV06, +author = {Anne Berry and Pinar Heggernes and Yngve Villanger}, +title = {A vertex incremental approach for maintaining chordality}, +journal = dm, volume = 306, year = 2006, pages = {318-336}} + +%Berry 2008 + +@article{BerryDHS08, +author = {Anne Berry and Elias Dahlhaus and Pinar Heggernes and Genevi\`{e}ve Simonet}, +title ={Sequential and parallel triangulating algorithms for {E}limination {G}ame and +new insights on {M}inimum {D}egree}, +journal = tcs, volume = 409, year = 2008, pages = {601-616}} + +%Bert + +@book{BerteleB72, +author = {U. Bertele and F. Brioschi}, +title = {Nonserial Dynamic Programming}, +publisher = {Academic Press}, address = {New York}, +year = 1972 } + +@inproceedings{BertolazziCDTT92, +author = {P. Bertolazzi and Robert F. Cohen and G. {Di Battista} and Roberto Tamassia and I. G. Tollis}, +title = {How to draw a series-parallel digraph}, +editor = {O. Nurmi and E. Ukkonen}, +booktitle = swat92, publisher = lncs621, year = 1992, pages = {272-283}} + +%Bertossi 1981 + +@article{Bertossi81, +author = {Alan A. Bertossi}, +title = {The edge {H}amiltonian path problem is {NP}-complete}, +journal = ipl, volume = 13, year = 1981, pages = {157-159}} + +%Bertossi 1983 + +@article{Bertossi83, +author = {Alan A. Bertossi}, +title = {Finding {H}amiltonian Circuits in Proper Interval Graphs}, +journal = ipl, volume = 17, year = 1983, pages = {97-102}} + +%Bertossi 1984 + +@article{Bertossi84, +author = {Alan A. Bertossi}, +title = {Dominating set for split and bipartite graphs}, +journal = ipl, volume = 19, year = 1984, pages = {37-40}} + +%Bertossi 1986 + +@article{Bertossi86, +author = {Alan A. Bertossi}, +title = {Total domination in interval graphs}, +journal = ipl, volume = 23, year = 1986, pages = {131-134}} + +@article{BertossiB86, +author = {Alan A. Bertossi and M. A. Bonucelli}, +title = {Hamiltonian circuits in interval graph generalizations}, +journal = ipl, volume = 23, year = 1986, pages = {195-200}} + +%Bertossi 1987 + +@article{BertossiB87, +author = {Alan A. Bertossi and M. A. Bonuccelli}, +title = {Some parallel algorithms on interval graphs}, +journal = dam, volume = 16, year = 1987, pages = {101-111}} + +%Bertossi 1988 + +@article{Bertossi88, +author = {Alan A. Bertossi}, +title = {On the domatic number of interval graphs}, +journal = ipl, volume = 28, year = 1988, pages = {275-280}} + +%Bes + +@unpublished{BessyFGPST09, +author = {St{\'e}phane Bessy and Fedor V. Fomin and Serge Gaspers and Christophe Paul and +Anthony Perez and Saket Saurabh and St{\'e}phan Thomass{\'e}}, +title = {Kernels for feedback arc set in tournaments}, +year = 2009, note = {The Computing Research Repository, abs/0907.2165. To appear in proceedings FSTTCS 2009.}} + +%Bet + +%Betzler 2006 + +@article{BetzlerNU06, +author = {Nadja Betzler and Rolf Niedermeier and Johannes Uhlmann}, +title = {Tree decompositions of graphs: Saving memory in dynamic programming}, +journal = do, volume = 3, year = 2006, pages = {220-229}} + +%Betzler 2009 + +@article{BetzlerFGNR09, +author = {Nadja Betzler and Michael R. Fellows and Jiong Guo and Rolf Niedermeier and Frances A. Rosamond}, +title = {Fixed-parameter algorithms for {K}emeny rankings}, +journal = tcs, volume = 410, year = 2009, pages = {4554-4570}} + +@article{BetzlerU09, +author = {Nadja Betzler and Johannes Uhlmann}, +title = {Parameterized complexity of candidate control in elections and related digraph problems}, +journal = tcs, volume = 410, year = 2009, pages = {5425-5442}} + +%Betzler 2010 + +@article{BetzlerGN10, +author = {Nadja Betzler and Jiong Guo and Rolf Niedermeier}, +title = {Parameterized computational complexity of {D}odgson and {Y}oung elections}, +journal = ic2, volume = 208, year = 2010, pages = {165-177}} + +%Bey + +@inproceedings{BeyerPHM77, +author = {T. Beyer and Andrzej Proskurowski and S. Hedetniemi and S. Mitchell}, +title = {Independent domination in trees}, +booktitle = {Proceedings of the 8th S. E. Conf. on Combinatorics, Graph Theory, and Computing}, +pages = {321-328}, publisher = {Utilitas Mathematica}, address = {Winnipeg}, +year = 1977 } + +@article{BeyerJM79, +author = {T. Beyer and W. Jones and S. Mitchell}, +title = {Linear algorithms for isomorphism of maximal outerplanar graphs}, +journal = jacm, volume = 26, year = 1979, pages = {603-610}} + +%Bi + +%Bia + +@inproceedings{BianG08, +author = {Zhengbing Bian and Qian-Ping Gu}, +title = {Computing branch decompositions of large planar graphs}, +editor = {Catherine C. McGeoch}, +booktitle = wea08, publisher = lncs5038, pages = {87-100}, year = 2008} + +%Bie + +@article{BiedlK98, +author = {Therese C. Biedl and Goos Kant}, +title = {A better heuristic for orthogonal graph drawings}, +journal = cg, volume = 9, year = 1998, pages = {159-180}} + +@article{BiedlCGHW05, +author = {Therese Biedl and Timothy Chan and Yashar Ganjali and Mohammad Taghi Hajiaghayi and David R. Wood}, +title = {Balanced vertex-orderings of graphs}, +journal = dam, volume = 148, year = 2005, pages = {27-48}} + +%Bienstock 1988 + +@article{BienstockM88, +author = {Daniel Bienstock and Clyde L. Monma}, +title = {On the complexity of covering vertices by faces in a planar graph}, +journal = siamjc, volume = 17, year = 1988, pages = {53-76}} + +%Bienstock 1989 + +@article{BienstockM89, +author = {Daniel Bienstock and Clyde L. Monma}, +title = {Optimal enclosing regions in planar graphs}, +journal = netw, volume = 19, year = 1989, pages = {79-94}} + +%Bienstock 1990 + +@article{Bienstock90, +author = {Daniel Bienstock}, +title = {Embedding graphs in trees}, +journal = jctb, volume = 49, year = 1990, pages = {103-136}} + +@article{BienstockM90, +author = {Daniel Bienstock and Clyde L. Monma}, +title = {On the complexity of embedding planar graphs to minimize certain distance measures}, +journal = alg, volume = 5, year = 1990, pages = {93-109}} + +%Bienstock 1991 + +@article{Bienstock91, +author = {Daniel Bienstock}, +title = {Graph searching, Path-width, Tree-width and Related Problems (A Survey)}, +journal = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science}, +volume = 5, year = 1991, pages = {33-49}} + +@article{BienstockRST91, +author = {Daniel Bienstock and Neil Robertson and Paul D. Seymour and Robin Thomas}, +title = {Quickly excluding a forest}, +journal = jctb, volume = 52, year = 1991, pages = {274-283}} + +@article{BienstockS91, +author = {Daniel Bienstock and Paul Seymour}, +title = {Monotonicity in Graph Searching}, +journal = ja, volume = 12, year = 1991, pages = {239 - 245}} + +%Bienstock 1992 + +@article{BienstockD92, +author = {Daniel Bienstock and N. Dean}, +title = {On obstructions to small face covers in planar graphs}, +journal = jctb, volume = 55, year = 1992, pages = {163-189}} + +%Bienstock 1995 + +@incollection{BienstockL95, +author = {Daniel Bienstock and Michael A. Langston}, +title = {Algorithmic implications of the graph minor theorem}, +booktitle = {Handbook of Operations Research and Management Science: Network Models}, +editor = {M. O. Ball and T. L. Magnanti and C. L. Monma and G. L. Nemhauser}, +year = 1995, pages = {481-502}, +publisher = {North-Holland}, +address = {Amsterdam, the Netherlands}} + +%Bienstock 2006 + +@article{BienstockO06, +author = {Daniel Bienstock and Nuri \"{O}zbay}, +title = {Tree-width and the {S}herali-{A}dams operator}, +journal = do, volume = 1, year = 2004, pages = {13-21}} + +%Bir + +@article{Birmele03, +author = {Etienne Birmele}, +title = {Tree-width and circumference of graphs}, +journal = jgt, volume = 43, year = 2003, pages = {24-25}} + +@article{BirmeleBR09, +author = {E. Birmel\'{e} and J. A. Bondy and B. A. Reed}, +title = {Tree-width of graphs without a 3$\times$3 grid minor}, +journal = dam, volume = 157, year = 2009, pages = {2577-2596}} + +%Bj + +@inproceedings{BjorklundHKK07, +author = {Andreas Bj\"orklund and Thore Husfeldt and Petteri Kaski and Mikko Koivisto}, +title = {Fourier meets {M}\"obius: {F}ast subset convolution}, +booktitle = stoc07, pages = {67-74}, year = 2007, punlisher = {ACM}} + +@article{BjorklundHK09, +author = {Andreas Bj{\"o}rklund and Thore Husfeldt and Mikko Koivisto}, +title = {Set Partitioning via Inclusion-Exclusion}, +journal = siamjc, volume = 39, year = 2009, pages = {546-563}} + +%Bl + +%Bla + +%Blair 1993 + +@inproceedings{BlairP93, +author = {Jean R. S. Blair and B. Peyton}, +title = {An introduction to chordal graphs and clique trees}, +booktitle = {Graph Theory and Sparse Matrix Computations}, +editor = {A. George and J. R. Gilbert and J. H. U. Liu}, +publisher = {Springer-Verlag}, address = {New York}, year = 1993, +pages = {1-29}} + +%Blair 1994 + +@article{BlairP94, +author = {J. R. S. Blair and B. W. Peyton}, +title = {On finding minimum-diameter clique trees}, +journal = nordicjc, volume = 1, year = 1994, pages = {173-201}} + +%Blair 2001 + +@article{BlairHT01, +author = {Jean R. S. Blair and Pinar Heggernes and {Jan Arne} Telle}, +title = {A practical algorithm for making filled graphs minimal}, +journal = tcs, volume = 250, year = 2001, pages = {125-141}} + +%Blair 2008 + +@article{BlairGHHJK08, +author = {Jean R. S. Blair and Wayne Goddard and Stephen T. Hedetniemi and +Steve Horton and Patrick Jones and Grzegorz Kubicki}, +title = {On domination and reinforcement numbers in trees}, +journal = dm, volume = 308, year = 2008, pages = {1165-1175}} + +%Bli + +@article{BlinFHV08, +author = {G. Blin and G. Fertin and D. Hermelin and S. Vialette}, +title = {Fixed-parameter algorithms for protein similarity search under {mRNA} structure constraints}, +journal = jda, volume = 6, year = 2008, pages = {618-626}} + +%Blo + +@article{BlokhuisK95, +author = {A. Blokhuis and T. Kloks}, +title = {On the equivalence covering number of splitgraphs}, +journal = ipl, volume = 54, year = 1995, pages = {301-304}} + +%Bo + +%Boc + +@article{BockerBBT09, +author = {S. B\"{o}cker and S. Briesemeister and Q. B. A. Bui and A. Truss}, +title = {Going weighted: parameterized algorithms for cluster editing}, +journal = tcs, volume = 410, year = 2009, pages = {5467-5480}} + +@unpublished{BockerBK09, +author = {Sebastian B\"{o}cker and Sebastian Briesemeister and Gunnar W. Klau}, +title = {Exact algorithms for cluster editing: Evaluation and experiments}, +note = {To appear in Algorithmica. Online publication: doi 10.1007/s00453-009-9339-7}, +year = 2009} + +%Bod + +%Bodlaender 1985 + +@article{Bodlaender85, +author = {Hans L. Bodlaender}, +title = {The complexity of finding uniform emulations on paths and ring networks}, +journal = ic2, volume = 86, year = 1990, pages = {87 - 106}} + +%Bodlaender 1986 + +@techreport{Bodlaender86, +author = {Hans L. Bodlaender}, +title = {Classes of Graphs with Bounded Treewidth}, +institution = {Dept. of Computer Science, Utrecht University}, +year = 1986, number = {RUU-CS-86-22}, address = {Utrecht, The Netherlands}} + +%Bodlaender 1987 + +@techreport{Bodlaender87-, +author = {Hans L. Bodlaender}, +title = {Dynamic Programming Algorithms on Graphs with Bounded Tree-width}, +institution = {Lab. for Computer Science, M.I.T.}, +type = {Tech. Rep.}, year = 1987} + +@inproceedings{Bodlaender87, +author = {Hans L. Bodlaender}, +title = {Dynamic programming algorithms on graphs with bounded tree-width}, +editor = {Timo Lepist\"{o} and Arto Salomaa}, +booktitle = icalp88, publisher = lncs317, year = 1988, pages = {105-119}} + +@techreport{Bodlaender87b, +author = {Hans L. Bodlaender}, +title = {The Maximum Cut and Minimum Cut Into Bounded Sets Problems on Cographs}, +institution = {Dept. of Computer Science, Utrecht University}, +year = 1987, address = {Utrecht, The Netherlands}, number = {RUU-CS-87-12}} + +%Bodlaender 1988 + +@inproceedings{Bodlaender88, +author = {Hans L. Bodlaender}, +title = {{NC}-algorithms for graphs with small treewidth}, +editor = {J. van Leeuwen}, +booktitle = wg88, publisher = lncs344, year = 1988, pages = {1-10}} + +@techreport{Bodlaender88a, +author = {Hans L. Bodlaender}, +title = {Planar Graphs with Bounded Treewidth}, +type = {Technical Report}, +number = {RUU-CS-88-14}, +institution = {Dept. of Computer Science, Utrecht University}, +address = {Utrecht, The Netherlands}, +year = 1988 } + +@article{Bodlaender88c, +author = {Hans L. Bodlaender}, +title = {Some classes of graphs with bounded treewidth}, +journal = beatcs, volume = 36, year = 1988, pages = {116-126}} + +@article{Bodlaender88d, +author = {Hans L. Bodlaender}, +title = {Improved self-reduction algorithms for graphs with bounded treewidth}, +journal = dam, volume = 54, year = 1994, pages = {101-115}} + +%Bodlaender 1989 + +@article{Bodlaender89, +author = {Hans L. Bodlaender}, +title = {On linear time minor tests with depth first search}, +journal = ja, volume = 14, year = 1993, pages = {1-23}} + +@article{Bodlaender89z, +author = {Hans L. Bodlaender}, +title = {On the complexity of some coloring games}, +journal = ijfcs, volume = 2, number = 2, year = 1991, pages = {133-147}} + +%Bodlaender 1990 + +@article{Bodlaender90b, +author = {Hans L. Bodlaender}, +title = {Polynomial algorithms for Graph Isomorphism and Chromatic Index on partial $k$-trees}, +journal = ja, volume = 11, year = 1990, pages = {631-643}} + +@techreport{BodlaenderK90, +author = {Hans L. Bodlaender and Ton Kloks}, +title = {Fast Algorithms for the {\sc Tron} Game on Trees}, +type = {Technical Report}, +institution = {Department of Computer Science, University of Utrecht}, +number = {RUU-CS-90-11}, +year = 1990 } + +%Bodlaender 1991 + +@inproceedings{BodlaenderK91, +author = {Hans L. Bodlaender and Ton Kloks}, +title = {Better algorithms for the pathwidth and treewidth of graphs}, +editor = {Javier Leach Albert and Burkhard Monien and Mario Rodr\'{\i}guez-Artalejo}, +booktitle = icalp91, publisher = lncs510, year = 1991, pages = {544-555}} + +%Bodlaender 1992 + +@inproceedings{Bodlaender92b, +author = {Hans L. Bodlaender}, +title = {Dynamic algorithms for graphs with treewidth 2}, +editor = {Jan van Leeuwen}, +booktitle = wg93, publisher = lncs790, year = 1994, pages = {112-124}} + +@article{Bodlaender92c, +author = {Hans L. Bodlaender}, +title = {A Tourist Guide through Treewidth}, +journal = actacybernetica, volume = 11, pages = {1-23}, year = 1993} + +@inproceedings{BodlaenderFW92, +author ={Hans L. Bodlaender and Michael R. Fellows and Tandy J. Warnow}, +title = {Two Strikes Against Perfect Phylogeny}, +editor = {W. Kuich}, +booktitle = icalp92, year = 1992, pages = {273-283}, publisher = lncs623} + +@misc{BodlaenderKKM92, +author = {Hans L. Bodlaender and Ton Kloks and Dieter Kratsch and Haiko M{\"u}ller}, +year = 1993, +note = {Unpublished results}} + +%Bodlaender 1993 + +@article{Bodlaender93, +author = {Hans L. Bodlaender}, +title = {Complexity of path-forming games}, +journal = tcs, volume = 110, year = 1993, pages = {215-245}} + +@inproceedings{Bodlaender93b, +author = {Hans L. Bodlaender}, +title = {On reduction algorithms for graphs with small treewidth}, +editor = {Jan van Leeuwen}, +booktitle = wg93, publisher = lncs790, year = 1994, pages = {45-56}} + +@inproceedings{Bodlaender93c, +author = {Hans L. Bodlaender}, +title = {Kayles on special classes of graphs --- {An} application of {S}prague-{G}rundy theory}, +editor = {Ernst W. Mayr}, +booktitle = wg92, publisher = lncs657, year = 1993, pages = {90-102}} + +@article{BodlaenderDFW93, +author = {Hans L. Bodlaender and Rodney G. Downey and Michael R. Fellows and Harold T. Wareham}, +title = {The parameterized complexity of sequence alignment and consensus }, +journal = tcs, volume = 147, year = 1995, pages = {31-54}} + +@inproceedings{BodlaenderG93, +author = {Hans L. Bodlaender and Jens Gustedt}, +title = {A Conjecture on the Pathwidth of $k$-Trees}, +booktitle = {Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint Summer Research Conference, Seattle WA, June 1991}, +publisher = {American Math. Soc.}, +address = {Providence, RI}, +editor = {Neil Robertson and Paul Seymour}, +note = {Contemp. Math. 147. In section ``Open Problems'', editor N. Dean}, +pages = {678-679}, +year = 1993} + +@article{BodlaenderK93, +author = {Hans L. Bodlaender and Ton Kloks}, +title = {A simple linear time algorithm for triangulating three-colored graphs}, +journal = ja, volume = 15, year = 1993, pages = {160-172}} + +@article{BodlaenderM93, +author = {Hans L. Bodlaender and Rolf H. M{\"{o}}hring}, +title = {The pathwidth and treewidth of cographs}, +journal = sjdm, volume = 6, year = 1993, pages = {181-188}} + +%Bodlaender 1994 + +@article{Bodlaender94, +author = {Hans L. Bodlaender}, +title = {Improved self-reduction algorithms for graphs with bounded treewidth}, +journal = dam, volume = 54, year = 1994, pages = {101-115}} + +@article{Bodlaender94c, +author = {Hans L. Bodlaender}, +title = {On disjoint cycles}, +journal = ijfcs, volume = 5, number = 1, year = 1994, pages = {59-68}} + +@inproceedings{BodlaenderFH94, +author = {Hans L. Bodlaender and Michael R. Fellows and Michael Hallett}, +title = {Beyond {{\it NP}}-Completeness for Problems of Bounded Width: Hardness for the {$W$} Hierarchy}, +year = 1994, +booktitle = stoc94, +address = {New York}, +pages = {449-458}, +publisher = {ACM Press}} + +@article{BodlaenderJW94, +author = {Hans L. Bodlaender and Klaus Jansen and Gerhard J. Woeginger}, +title = {Scheduling with incompatible jobs}, +journal = dam, volume = 55, year = 1994, pages = {219-232}} + +%Bodlaender 1995 + +@article{BodlaenderDFHW95, +author = {Hans L. Bodlaender and Rodney G. Downey and Michael R. Fellows and Michael T. Hallett and H. Todd Wareham}, +title = {Parameterized complexity analysis in computational biology}, +journal = {Computer Applications in the Biosciences}, volume = 11, year = 1995, pages = {49-57}} + +@article{BodlaenderDFW95, +author = {Hans L. Bodlaender and Rodney G. Downey and Michael R. Fellows and Harold T. Wareham}, +title = {The parameterized complexity of sequence alignment and consensus}, +journal = tcs, volume = 147, year = 1995, pages = {31-54}} + +@article{BodlaenderGHK95, +author = {Hans L. Bodlaender and John R. Gilbert and H. Hafsteinsson and Ton Kloks}, +title = {Approximating Treewidth, Pathwidth, Frontsize, and Minimum Elimination Tree Height}, +journal = ja, volume = 18, year = 1995, pages = {238-255}} + +@inproceedings{BodlaenderF95, +author = {Hans L. Bodlaender and Babette de Fluiter}, +title = {Intervalizing $k$-Colored Graphs}, +editor = {Zolt\'{a}n F\"{u}l\"{o}p and Ferenc G\'{e}cseg}, +booktitle = icalp95, publisher = lncs944, year = 1995, pages = {87-98}} + +@techreport{BodlaenderF95a, +author = {Hans L. Bodlaender and Babette de Fluiter}, +title = {Reduction Algorithms for Graphs with Small Treewidth}, +number = {UU-CS-1995-37}, +year = 1995, +institution = {Department of Computer Science, Utrecht University}, +address = {Utrecht}, +type = {Technical Report}} + +@article{BodlaenderF95b, +author = {Hans L. Bodlaender and Michael R. Fellows}, +title = {{$W[2]$}-hardness of precedence constrained {$K$}-processor scheduling}, +journal = orl, volume = 18, year = 1995, pages = {93-97}} + +@techreport{BodlaenderFHWW95, +author = {Hans L. Bodlaender and Michael R. Fellows and Michael T. Hallett and H. Todd Wareham and Tandy J. Warnow}, +title = {The hardness of problems on thin colored graphs}, +institution = vi, +address = {Utrecht}, +type = tr, +number = {UU-CS-1995-36}, +year = 1995 +} + +@article{BodlaenderKK95, +author = {Hans L. Bodlaender and Ton Kloks and Dieter Kratsch}, +title = {Treewidth and pathwidth of permutation graphs}, +journal = sjdm, volume = 8, number = 4, year = 1995, pages = {606-616}} + +%Bodlaender 1996 + +@article{Bodlaender96, +author = {Hans L. Bodlaender}, +title = {A linear time algorithm for finding tree-decompositions of small treewidth}, +journal = siamjc, year = 1996, volume = 25, pages = {1305-1317}} + +@inproceedings{BodlaenderF96, +author = {Hans L. Bodlaender and Babette de Fluiter}, +title = {Parallel Algorithms for Series Parallel Graphs}, +editor = {Joseph Diaz and Maria Serna}, +booktitle = esa96, year = 1996, publisher = lncs1136, pages = {277-289}} + +@inproceedings{BodlaenderF96a, +author = {Hans L. Bodlaender and Babette de Fluiter}, +title = {Reduction algorithms for constructing solutions in graphs with small treewidth}, +editor = {Jin-Yi Cai and Chak Kuen Wong}, +booktitle = cocoon96, publisher = lncs1090, year = 1996, pages = {199-208}} + +@article{BodlaenderF96b, +author = {Hans L. Bodlaender and Babette de Fluiter}, +title = {On intervalizing $k$-colored graphs for {DNA} physical mapping}, +journal = dam, volume = 71, year = 1996, pages = {55-77}} + +@inproceedings{BodlaenderFE96, +author = {Hans L. Bodlaender and Michael R. Fellows and Patricia A. Evans}, +title = {Finite-State Computability of Annotations of Strings and Trees}, +editor = {Daniel S. Hirshberg and Eugene W. Myers}, +booktitle = {Proceedings of the 7th Annual Symposium on Combinatorial Pattern Matching, CPM'96}, +publisher = lncs1075, year = 1996, pages = {384-391}} + +@article{BodlaenderK96, +author = {Hans L. Bodlaender and Ton Kloks}, +title = {Efficient and constructive algorithms for the pathwidth and treewidth of graphs}, +journal = ja, volume = 21, year = 1996, pages = {358-402}} + +%Bodlaender 1997 + +@inproceedings{Bodlaender97, +author = {Hans L. Bodlaender}, +title = {Treewidth: Algorithmic Techniques and Results}, +editor = {Igor Privara and Peter Ruzicka}, +booktitle = mfcs97, publisher = lncs1295, year = 1997, pages = {19-36}} + +@article{BodlaenderE97, +author = {Hans L. Bodlaender and Joost Engelfriet}, +title = {Domino treewidth}, +journal = ja, volume = 24, pages = {94-123}, year = 1997} + +@techreport{BodlaenderF97, +author = {Hans L. Bodlaender and Babette de Fluiter}, +title = {Parallel Algorithms for Series Parallel Graphs}, +institution = {Dept. of Computer Science, Utrecht University}, +year = 1997, number = {UU-CS-1997-21}, address = {Utrecht, The Netherlands}} + +@techreport{BodlaenderF97a, +author = {Babette de Fluiter and Hans L. Bodlaender}, +title = {Parallel algorithms for graphs of treewidth two}, +institution = {Dept. of Computer Science, Utrecht University}, +year = 1997, number = {UU-CS-1997-23}, address = {Utrecht, The Netherlands}} + +@inproceedings{BodlaenderT97, +author = {Hans L. Bodlaender and Dimitrios M. Thilikos}, +title = {Constructive Linear Time Algorithms for Branchwidth}, +editor = {Pierpaolo Degano and Roberto Gorrieri and Alberto Marchetti-Spaccamela}, +booktitle = icalp97, publisher = lncs1256, year = 1997, pages = {627-637}} + +@article{BodlaenderT97a, +author = {Hans L. Bodlaender and Dimitrios M. Thilikos}, +title = {Treewidth for graphs with small chordality}, +journal = dam, volume = 79, year = 1997, pages = {45-61}} + +@article{BodlaenderTTL97, +author = {Hans L. Bodlaender and Jan van Leeuwen and Richard Tan and Dimitrios Thilikos}, +title = {On interval routing schemes and treewidth}, +journal = ic2, volume = 139, number = 1, year = 1997, pages={92-109}} + +%Bodlaender 1998 + +@article{Bodlaender98, +author = {Hans L. Bodlaender}, +title = {A partial $k$-arboretum of graphs with bounded treewidth}, +journal = tcs, volume = 209, year = 1998, pages = {1-45}} + +@article{BodlaenderDJKKMT98, +author = {Hans L. Bodlaender and J. S. Deogun and K. Kansen and Ton Kloks and Dieter Kratsch and Haiko M{\"u}ller and Z. Tuza}, +title = {Rankings of graphs}, +journal = sjdm, volume = 11, year = 1998, pages = {168-181}} + +@inproceedings{BodlaenderGT98, +author = {Hans Bodlaender and Jens Gustedt and Telle, Jan Arne}, +title = {Linear-time register allocation for a fixed number of registers}, +booktitle = soda98, pages = {574--583}, +publisher = {ACM}, +year = {1998}} + +@article{BodlaenderH98, +author = {Hans L. Bodlaender and Torben Hagerup}, +title = {Parallel algorithms with optimal speedup for bounded treewidth}, +journal = comp, volume = 27, year = 1998, pages = {1725-1746}} + +@article{BodlaenderKKM98, +author = {Hans L. Bodlaender and Ton Kloks and Dieter Kratsch and Haiko Mueller}, +title = {Treewidth and minimum fill-in on $d$-trapezoid graphs}, +journal = jgaa, volume = 2, number = 5, year = 1998, pages = {1-23}} + +%Bodlaender 1999 + +@article{BodlaenderT99, +author = {Hans L. Bodlaender and Dimitrios M. Thilikos}, +title = {Graphs with branchwidth at most three}, +journal = ja, volume = 32, year = 1999, pages = {167-194}} + +%Bodlaender 2000 + +@article{BodlaenderFHWW00, +author = {Hans L. Bodlaender and Michael R. Fellows and Michael T. Hallett and H. Todd Wareham and Tandy J. Warnow}, +title = {The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs}, +journal = tcs, volume = 244, year = 2000, pages = {167-188}} + +%Bodlaender 2001 + +@article{BodlaendervA01, +author = {Hans L. Bodlaender and Babette van Antwerpen-de Fluiter}, +title = {Parallel algorithms for series parallel graphs and graphs with treewidth two}, +journal = alg, volume = 29, year = 2001, pages = {543-559}} + +@article{BodlaendervA01a, +author = {Hans L. Bodlaender and Babette van Antwerpen-de Fluiter}, +title = {Reduction algorithms for graphs of small treewidth}, +journal = ic2, volume = 167, year = 2001, pages = {86-119}} + +@inproceedings{BodlaenderEG01, +author = {Hans L. Bodlaender and Eijkhof, Frank {v}an {d}en and Linda C. van der Gaag}, +title = {On the complexity of the {MPA} problem in probabilistic networks}, +editor = {Frank van Harmelen}, +booktitle = {Proceedings of the 15th European Conference on Artificial Intelligence, ECAI 2001}, +publisher = {IOS Press}, address = {Amsterdam}, pages = {675-679}, +year = 2002} + +@inproceedings{BodlaenderKEG01, +author = {Hans L. Bodlaender and Arie M. C. A. Koster and Eijkhof, Frank {v}an {d}en and Linda C. van der Gaag}, +title = {Pre-processing for triangulation of probabilistic networks}, +editor = {Jack S. Breese and Daphne Koller}, +booktitle = uai01, publisher = {Morgan Kaufmann}, year = 2001, pages = {32-39}} + +%Bodlaender 2002 + +@inproceedings{BodlaenderEG02, +author = {Hans L. Bodlaender and Frank van den Eijkhof and Linda C. van der Gaag}, +title = {On the complexity of the {MPA} problem in probabilistic networks}, +editor = {Frank van Harmelen}, +booktitle = ecai2002, publisher = {IOS Press}, year = 2002, pages = {675-679}} + +@techreport{BodlaenderFT02, +author = {Hans L. Bodlaender and Michael R. Fellows and Dimitrios M. Thilikos}, +title = {Derivation of algorithms for cutwidth and related graph layout problems}, +type= {Technical Report}, +year = 2002, number = {UU-CS-2002-032}, +institution = {Institute of Information and Computing Sciences, Utrecht University}, +address = {Utrecht, The Netherlands}} + +@article{BodlaenderF02, +author = {Hans L. Bodlaender and Fedor V. Fomin}, +title = {Approximation of pathwidth of outerplanar graphs}, +journal = ja, volume = 43, year = 2002, pages = {190-200}} + +%Bodlaender 2003 + +@article{Bodlaender2003, +author = {Hans L. Bodlaender}, +title = {Necessary edges in $k$-chordalizations of graphs}, +journal = jco, volume = 7, year = 2003, pages = {283-290}} + +@article{BodlaenderR03, +author = {Hans L. Bodlaender and Udi Rotics}, +title = {Computing the treewidth and the minimum fill-in with the modular decomposition}, +journal = alg, volume = 36, year = 2003, pages = {375-408}} + +%Bodlaender 2004 + +@inproceedings{BodlaenderK04, +author = {Hans L. Bodlaender and Arie M. C. A. Koster}, +title = {On the {M}aximum {C}ardinality {S}earch lower bound for treewidth}, +editor = {J. Hromkovi\u{c} and M. Nagl and B. Westfechtel}, +booktitle = wg04, year = 2004, pages = {81-92}, publisher = lncs3353} + +@misc{BodlaenderK04a, +author = {Hans L. Bodlaender and Arie M. C. A. Koster}, +note = {Work in progress}, +year = 2004} + +@inproceedings{BodlaenderKW04, +author = {Hans L. Bodlaender and Arie M. C. A. Koster and Thomas Wolle}, +title = {Contraction and treewidth lower bounds}, +editor = {Susanne Albers and Tomasz Radzik}, +booktitle = esa04, year = 2004, pages = {628-639}, publisher = lncs3221} + +@article{BodlaenderKTvL04, +author = {Hans L. Bodlaender and Ton Kloks and Richard Tan and Jan {van Leeuwen}}, +title = {Approximations for $\lambda$-colorings of graphs}, +journal = tcj, volume = 47, year = 2004, pages = {193-204}} + +@techreport{BodlaenderKW2004vol, +author = {Hans L. Bodlaender and Arie M. C. A. Koster and Thomas Wolle}, +title = {Contraction and Treewidth Lower Bounds}, +institution = {Dept. of Computer Science, Utrecht University}, +year = 2004, +address = {Utrecht, The Netherlands}, +number = {UU-CS-2004-34} +} + +@techreport{BodlaenderW04, +author = {Hans L. Bodlaender and Thomas Wolle}, +title = {Contraction Degeneracy on Cographs}, +institution = {Institute for Information and Computing Sciences, Utrecht University}, +address = {Utrecht, The Netherlands}, +year = 2004, +number = {UU-CS-2004-031}} + +%Bodlaender 2005 + +@inproceedings{Bodlaender05, +author = {Hans L. Bodlaender}, +title = {Discovering treewidth}, +editor = {Peter Vojt\'{a}\u{s} and M\'{a}ria Bielikov\'{a} and Bernadette Charron-Bost}, +booktitle = sofsem05, year = 2005, publisher = lncs3381, pages = {1-16}} + +@misc{Bodlaender05a, +author = {Hans L. Bodlaender}, +year = 2005, +note = {Work in progress}} + +@article{BodlaenderF05, +author = {Hans L. Bodlaender and Fedor V. Fomin}, +title = {Tree decompositions with small cost}, +journal = dam, volume = 145, year = 2004, pages = {143-154}} + +@article{BodlaenderF05a, +author = {Hans L. Bodlaender and Fedor V. Fomin}, +title = {Equitable colorings of bounded treewidth graphs}, +journal = tcs, volume = 349, year = 2005, pages = {22-30}} + +@inproceedings{BodlaenderGK05, +author = {Hans L. Bodlaender and Alexander Grigoriev and Arie M. C. A. Koster}, +title = {Treewidth Lower Bounds with Brambles}, +editor = {G. S. Brodal and S. Leonardi}, +booktitle = esa05, year = 2005, pages = {391--402}, publisher = lncs3669} + +@article{BodlaenderKE05, +author = {Hans L. Bodlaender and Arie M. C. A. Koster and Eijkhof, Frank {v}an {d}en}, +title = {Pre-processing rules for triangulation of probabilistic networks}, +journal = {Computational Intelligence}, year = 2005, volume = 21, number = 3, pages = {286-305}} + +@unpublished{BodlaenderW05, +author = {Hans L. Bodlaender and Mark Weyer}, +title = {Convex and connected recolourings of trees and graphs of small treewidth}, +note = {Unpublished manuscript}, year = 2005} + +@article{BodlaenderKW05, +author = {Hans L. Bodlaender and Arie M. C. A. Koster and Thomas Wolle}, +title = {Contraction and treewidth lower bounds}, +journal = jgaa, volume = 10, year = 2006, pages = {5-49}} + +%Bodlaender 2006 + +@techreport{Bodlaender06, +author = {Hans L. Bodlaender}, +title = {A cubic kernel for Feedback Vertex Set}, +institution = {Department of Information and Computing Sciences, Utrecht University}, +address = {Utrecht, The Netherlands}, +year = 2006, +number = {UU-CS-2006-042}} + +@inproceedings{Bodlaender06a, +author = {Hans L. Bodlaender}, +title = {Treewidth: Characterizations, Applications, and Computations}, +editor = {Fedor V. Fomin}, +booktitle = wg06, year = 2006, pages = {1 - 14}, publisher = lncs4271} + +@techreport{BodlaenderCCFTM06, +author = {Hans L. Bodlaender and Leizhen Cai and Jianer Chen and Michael R. Fellows and Jan Arne Telle and D\'{a}niel Marx}, +title = {Open Problems in Parameterized and Exact Computation - {IWPEC} 2006}, +institution = {Department of Information and Computing Sciences, Utrecht University}, +address = {Utrecht, The Netherlands}, +year = 2006, +number = {UU-CS-2006-052}} + +@inproceedings{BodlaenderFKKT06, +author = {Hans L. Bodlaender and Fedor V. Fomin and Arie M. C. A. Koster and Dieter Kratsch and Dimitrios M. Thilikos}, +title = {On exact algorithms for treewidth}, +editor = {Y. Azar and T. Erlebach}, +booktitle = esa06, publisher = lncs4168, year = 2006, pages = {672-683}} + +@techreport{BodlaenderFKKT06a, +author = {Hans L. Bodlaender and Fedor V. Fomin and Arie M. C. A. Koster and +Dieter Kratsch and Dimitrios M. Thilikos}, +title = {On exact algorithms for treewidth}, +type = {Technical Report}, +institution = {Department of Information and Computing Sciences, Utrecht University}, +address = {Utrecht, the Netherlands}, +year = 2006, +number = {UU-CS-2006-032}} + +@unpublished{BodlaenderK06, +author = {Hans L. Bodlaender and Arie M. C. A. Koster}, +title = {Treewidth Computations {I}. {U}pper Bounds}, +year = 2008, +note = {http://www.cs.uu.nl/research/techreps/UU-CS-2008-032.html. To appear in Information and Computation}} + +@unpublished{BodlaenderK06a, +author = {Hans L. Bodlaender and Arie M. C. A. Koster}, +title = {Treewidth Computations {II}. {L}ower Bounds}, +year = 2009, +note = {Paper in preparation}} + +@unpublished{BodlaenderK06b, +author = {Hans L. Bodlaender and Arie M. C. A. Koster}, +title = {Treewidth Computations {III}. {E}xact Algorithms and Preprocessing}, +note = {Paper in preparation}, +year = 2010} + +@article{BodlaenderK06c, +author = {Hans L. Bodlaender and Arie M. C. A. Koster}, +title = {Safe separators for treewidth}, +journal = dm, volume = 306, year = 2006, pages = {337-350}} + +@article{BodlaenderWK06, +author = {Hans L. Bodlaender and Thomas Wolle and Arie M. C. A. Koster}, +title = {Contraction and treewidth lower bounds}, +journal = jgaa, volume = 10, year = 2006, pages = {5-49}} + +%Bodlaender 2007 + +@inproceedings{Bodlaender07, +author = {Hans L. Bodlaender}, +title = {A cubic kernel for feedback vertex set}, +editor = {W. Thomas and P. Well}, +booktitle = stacs07, publisher = lncs4393, year = 2007, pages = {320-331}} + +@inproceedings{Bodlaender07a, +author = {Hans L. Bodlaender}, +title = {Treewidth: {S}tructure and Algorithms}, +editor = {Giuseppe Prencipe and Shmuel Zaks}, +booktitle = {Proceedings of the 14th International Colloquium on Structural Information and +Communication Complexity, SIROCCO 2007}, +publisher = lncs4474, year = 2007, pages = {11-25}} + +@inproceedings{BodlaenderFLRRW07, +author = {Hans L. Bodlaender and Michael R. Fellows and Michael Langston and Mark Ragan and Frances Rosamond and Mark Weyer}, +title = {Quadratic kernelization for convex recoloring of trees}, +editor = {G. Lin}, +booktitle = cocoon07, publisher = lncs4598, year = 2007, pages = {86-96}} + +@article{BodlaenderK07, +author = {Hans L. Bodlaender and Arie M. C. A. Koster}, +title = {On the {M}aximum {C}ardinality {S}earch lower bound for treewidth}, +journal = dam, volume = 155, year = 2007, number = 11, pages = {1348-1372}} + +%Bodlaender 2008 + +@inproceedings{BodlaenderDFH08, +author = {Hans L. Bodlaender and Rodney G. Downey and Michael R. Fellows and Danny Hermelin}, +editor = {Luca Aceto and Ivan Damg{\aa}rd and Leslie Ann Goldberg and +Magn\'{u}s M. Halld\'{o}rsson and Anna Ing\'{o}lfsd\'{o}ttir and Igor Walukuewics}, +title = {On Problems Without Polynomial Kernels (Extended Abstract)}, +booktitle = icalp08-1, pages = {563-574}, year = 2008, publisher = lncs5125} + +@inproceedings{BodlaenderFHMPR08, +author = {Hans L. Bodlaender and Michael R. Fellows and Pinar Heggernes +and Federico Mancini and Charis Papadopoulos and Frances A. Rosamond}, +title = {Clustering with partial information}, +editor = {Edward Ochmanski and Jerzy Tyszkiewicz}, +booktitle = mfcs08, publisher = lncs5162, pages = {144-155}, year = 2008} + +@inproceedings{BodlaenderGGH08, +author = {Hans L. Bodlaender and Alexander Grigoriev and Nadejda V. Grigorieva and Albert Hendriks}, +title = {The Valve Location Problem in Simple Network Topologies}, +editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani\"{e}l Paulusma}, +booktitle = wg08, publisher = lncs5344, year = 2008, pages = {55-65}} + +@article{BodlaenderGK08, +author = {Hans L. Bodlaender and Alexander Grigoriev and Arie M. C. A. Koster}, +title = {Treewidth lower bounds with brambles}, +journal = alg, volume = 51, year = 2008, pages = {81-98}} + +@inproceedings{BodlaenderHV08, +author = {Hans L. Bodlaender and Pinar Heggernes and Yngve Villanger}, +title = {Faster parameterized algorithms for minimum fill-in}, +editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga}, +booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {282-293}} + +@article{BodlaenderK08, +author = {Hans L. Bodlaender and Arie M. C. A. Koster}, +title = {Combinatorial optimization on graphs of bounded treewidth}, +journal = tcj, volume = 51, number = 3, year = 2008, pages = {255-269}} + +@inproceedings{BodlaenderP08, +author = {Hans L. Bodlaender and Eelko Penninkx}, +title = {A linear kernel for planar feedback vertex set}, +editor = {Martin Grohe and Rolf Niedermeier}, +booktitle = iwpec08, year = 2008, pages = {160-171}, publisher = lncs5018} + +@inproceedings{BodlaenderPT08, +author = {Hans L. Bodlaender and Eelko Penninkx and Richard B. Tan}, +title = {A linear kernel for the $k$-disjoint cycle problem on planar graphs}, +editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga}, +booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {294-305}} + +@techreport{BodlaenderTDL08, +author = {Hans L. Bodlaender and Richard B. Tan and Thomas C. van Dijk and Jan van Leeuwen}, +title = {Integer Maximum Flow in Wireless Networks with Energy Constraint}, +number = {UU-CS-2008-005}, +institution = {Department of Information and Computing Sciences, Utrecht University}, +year = 2008, address = {Utrecht, The Netherlands}} + +@techreport{BodlaenderTY08, +author = {Hans L. Bodlaender and St\'{e}phan Thomass\'{e} and Anders Yeo}, +title = {Analysis of Data Reduction: Transformations give evidence for non-existence of polynomial kernels}, +institution = {Department of Information and Computer Sciences, Utrecht University}, +address = {Utrecht, the Netherlands}, +year = 2008, +number = {UU-CS-2008-030}} + +%Bodlaender 2009 + +@unpublished{Bodlaender09, +author = {Hans L. Bodlaender}, +title = {Kernelization: New upper and lower bound techniques}, +year = 2009, +note = {To appear in Proceedings IWPEC 2009}} + +@article{BodlaenderDFH09, +author = {Hans L. Bodlaender and Rodney G. Downey and Michael R. Fellows and Danny Hermelin}, +title = {On problems without polynomial kernels}, +journal = jcss, volume = 75, year = 2009, pages = {423-434}} + +@unpublished{BodlaenderFLPST09, +author = {Hans L. Bodlaender and Fedor V. Fomin and Daniel Lokshtanov and Eelko Penninkx and Saket Saurabh and Dimitrios M. Thilikos}, +title = {({M}eta) Kernelization}, +year = 2009, +note = {To appear in Proceedings FOCS 2009}} + +@techreport{BodlaenderFLPST09a, +author = {Hans L. Bodlaender and Fedor V. Fomin and Daniel Lokshtanov and Eelko Penninkx and Saket Saurabh and Dimitrios M. Thilikos}, +title = {({M}eta) Kernelization}, +institution = {Department of Information and Computer Sciences, Utrecht University}, +address = {Utrecht, the Netherlands}, +year = 2009, +number = {UU-CS-2009-012}} + +@techreport{BodlaenderKKTV09, +author = {Hans L. Bodlaender and Fedor V. Fomin and Arie M. C. A. Koster and Dieter Kratsch and Dimitrios M. Thilikos}, +title = {A note on exact algorithms for vertex ordering problems on graphs}, +institution = {Department of Information and Computer Sciences, Utrecht University}, +address = {Utrecht, the Netherlands}, +year = 2009, +number = {UU-CS-2009-???}} + +@unpublished{BodlaenderLP09, +author = {Hans L. Bodlaender and Daniel Lokshtanov and Eelko Penninkx}, +title = {Planar Capacitated Dominating Set is {$W[1]$}-hard}, +year = 2009, +note = {In Proceedings IWPEC 2009}} + +@inproceedings{BodlaenderTY09, +author = {Hans L. Bodlaender and St\'{e}phan Thomass\'{e} and Anders Yeo}, +title = {Kernel bounds for Disjoint Cycles and Disjoint Paths}, +editor = {Amos Fiat and Peter Sanders}, +booktitle = esa09, publisher = lncs5757, year = 2009, pages = {635-646}} + +%Bodlaender 2010 + +@article{BodlaendervD10, +author = {Hans L. Bodlaender and Thomas C. van Dijk}, +title = {A cubic kernel for feedback vertex set and loop cutset}, +journal = tocs, volume = 46, year = 2010, pages = {566-597}} + +@article{BodlaenderK10, +author = {Hans L. Bodlaender and Arie M. C. A. Koster}, +title = {Treewidth Computations {I}. {U}pper Bounds}, +journal = ic2, volume = 208, year = 2010, pages = {259-275}} + +@article{BodlaenderFHMPR10, +author = {Hans L. Bodlaender and Michael R. Fellows and Pinar Heggernes and Federico Mancini and Charis Papadopoulos and Frances Rosamond}, +title = {Clustering with partial information}, +journal = tcs, volume = 411, year = 2010, pages = {1202-1211}} + +%Boh + +@article{BohmeKMM09, +author = {Thomas B\"{o}hme and Ken-ichi Kawarabayashi and John Maharry and Bojan Mohar}, +title = {Linear connectivity forces large complete bipartite minors}, +journal = jctb, volume = 99, year = 2009, pages = {557-582}} + +@article{BohraCR06, +author = {Ankur Bohra and L. Sunil Chandran and J. Krishnam Raju}, +title = {Boxicity of series-parallel graphs}, +journal = dm, volume = 306, year = 2006, pages = {2219-2221}} + +%Bol + +@book{Bollobas78, +author = {B. Bollob\'{a}s}, +title = {Extremal Graph Theory}, +publisher = {Academic Press}, +address = {London}, +year = 1978 +} + +@book{Bollobas85, +author = {B. Bollob\'{a}s}, +title = {Random Graphs}, +address = {London}, +publisher = {Academic Press}, +year = 1985 +} + +@book{Bollobas98, +author = {B\'{e}la Bollob\'{a}s}, +title = {Modern Graph Theory}, +publisher = {Graduate Texts in Mathematics, Springer}, +address = {New York}, +year = 1998} + +%Bon + +%Bond + +@book{BondyM76, +author = {J. A. Bondy and U. S. R. Murty}, +title = {Graph Theory with Applications}, +publisher = {American Elsevier, MacMillan}, +address = {New York, London}, +year = 1976 } + +%Bone + +@unpublished{BonetB93, +author = {Maria Luisa Bonet and Samuel R. Buss}, +title = {The Serial Transitive Closure Problem for Trees}, +note = {Manuscript}, +year = 1993} + +%Bons + +@inproceedings{BonsmaBW03, +author = {P. Bonsma and T. Brueggemann and G. Woeginger}, +title = {A faster {FPT} algorithm for finding spanning trees with many leaves}, +booktitle = mfcs03, publisher = lncs2747, year = 2003, pages = {259-268}} + +@inproceedings{BonsmaZ08, +author = {Paul S. Bonsma and Florian Zickfeld}, +title = {Spanning trees with many leaves in graphs without diamonds and blossoms}, +editor = {Eduardo Sany Laber and Claudson F. Bornstein and Loana Tito Nogueira and Luerbio Faria}, +booktitle = latin08, year = 2008, publisher = lncs4957, pages = {531-543}} + +%Bonu + +@article{BonucelliB79, +author = {M. A. Bonucelli and D. P. Bovet}, +title = {Minimum node disjoint path covering for circular-arc graphs}, +journal = ipl, volume = 8, year = 1979, pages = {159-161}} + +@article{Bonuccelli85, +author = {M. A. Bonuccelli}, +title = {Dominating sets and domatic number of circular-arc graphs}, +journal = dam, volume = 12, year = 1985, pages = {203-213}} + +%Boo + +%Booth 1976 + +@article{BoothL76, +author = {Kellogg S. Booth and George S. Lueker}, +title = {Testing for the consecutive ones property, interval graphs, and graph planarity using {PQ}-tree algorithms}, +journal = jcss, volume = 13, year = 1976, pages = {335-379}} + +%Booth 1982 + +@article{BoothJ82, +author = {Kellogg S. Booth and J. H. Johnson}, +title = {Dominating sets in chordal graphs}, +journal = siamjc, volume = 11, year = 1982, pages = {191-199}} + +%Booth 1993 + +@article{BoothT93, +author = {H. Booth and R. E. Tarjan}, +title = {Finding the minimum-cost maximum flow in a series parallel network}, +journal = ja, volume = 15, year = 1993, pages = {416-446}} + +%Booth 1994 + +@techreport{BoothGLR94, +author = {H. Booth and R. Govindran and M. Langston and S. Ramachandramurthi}, +title = {Sequential and Parallel Algorithms for {$K_4$} Immersion Testing}, +institution = {Department of Computer Science, University of Tennessee}, +address = {Knoxville, Tennessee, USA}, +month = {2}, year = 1994} + +%Booth 1999 + +@article{BoothGLR99, +author = {Heather Booth and Rajeev Govindran and Michael A. Langston and Siddharthan Ramachandramurthi}, +title = {Fast algorithms for {$K_4$} immersion testing}, +journal = ja, volume = 30, year = 1999, pages = {344-378}} + +%Bor + +%Borg + +@book{Borger85, +author = {E. B\"{o}rger}, +title = {Berechenbarkeit, Komplexit\"{a}t, Logik}, +publisher = {Vieweg-Verlag}, +address = {Wiesbaden}, +year = 1985} + +%Bori + +%Borie 1988 + +@phdthesis{Borie88, +author = {Richard B. Borie}, +title = {Recursively Constructed Graph Families}, +school = {School of Information and Computer Science, Georgia Institute of Technology}, +year = 1988 } + +@unpublished{BoriePT88, +author = {Richard B. Borie and R. Gary Parker and Craig A. Tovey}, +title = {Unambiguous Factorization of Recursive Graph Classes}, +year = 1988, note = {Manuscript}} + +%Borie 1991 + +@article{BoriePT91, +author = {Richard B. Borie and R. Gary Parker and Craig A. Tovey}, +title = {Deterministic decomposition of recursive graph classes}, +journal = sjdm, volume = 4, year = 1991, pages = {481 - 501}} + +%Borie 1992 + +@article{BoriePT92, +author = {Richard B. Borie and R. Gary Parker and Craig A. Tovey}, +title = {Automatic generation of linear-time algorithms from predicate +calculus descriptions of problems on recursively constructed graph families}, +journal = alg, volume = 7, year = 1992, pages = {555-581}} + +%Borie 1993 + +@article{BorieG93, +author = {Richard Borie and Arobinda Gupta}, +title = {Balanced decompositions for partial $k$-trees}, +journal = cn, volume = 98, year = 1993, pages = {33-38}} + +@unpublished{BorieG93a, +author = {Richard Borie and Arobinda Gupta}, +title = {Balanced $2k$-Terminal Tree Decompositions for $k$-Terminal Recursive Graph Classes}, +year = 1993, note = {Manuscript}} + +%Borie 1995 + +@article{Borie95, +author = {Richard B. Borie}, +title = {Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs}, +journal = alg, volume = 14, year = 1995, pages = {123-137}} + +@article{BoriePT08, +author = {R. B. Borie and R. G. Parker and C. A. Tovey}, +title = {Solving problems on recursively constructed graphs}, +journal = acmcs, volume = 41, year = 2008, number = 4} + +%Born + +@article{BornsteinV04, +author = {Claudson F. Bornstein and Santosh Vempala}, +title = {Flow metrics}, +journal = tcs, volume = 321, year = 2004, pages = {13-24}} + +%Boro + +@article{BorowieckiS07, +author = {M. Borowiecki and E. Sidorowicz}, +title = {Generalised game colouring of graphs}, +journal = dm, volume = 307, year = 2007, pages = {1225-1231}} + +%Bou + +%Bouchitte 1998 + +@inproceedings{BouchitteT98, +author = {Vincent Bouchitt{\'{e}} and Ioan Todinca}, +title = {Minimal triangulations for graphs with ``few'' minimal separators}, +booktitle = esa98, publisher = lncs1461, pages = {344-355}, year = 1998} + +%Bouchitte 1999 + +@inproceedings{BouchitteT99, +author = {Vincent Bouchitt{\'{e}} and Ioan Todinca}, +title = {Treewidth and minimum fill-in of weakly triangulated graphs}, +booktitle = stacs99, publisher = lncs1563, pages = {197-208}, year = 1999} + +%Bouchitte 2000 + +@inproceedings{BouchitteT00, +author = {Vincent Bouchitt{\'{e}} and Ioan Todinca}, +title = {Listing all potential maximal cliques of a graph}, +editor = {H. Reidel and S. Tison}, +booktitle = stacs00, publisher = lncs1770, pages = {503-515}, year = 2000} + +%Bouchitte 2001 + +@article{BouchitteT01a, +author = {Vincent Bouchitt{\'{e}} and Ioan Todinca}, +title = {Treewidth and minimum fill-in: {G}rouping the minimal separators}, +journal = siamjc, volume = 31, year = 2001, pages = {212-232}} + +%Bouchitte 2002 + +@article{BouchitteT02, +author = {Vincent Bouchitt{\'{e}} and Ioan Todinca}, +title = {Listing all potential maximal cliques of a graph}, +journal = tcs, volume = 276, year = 2002, pages = {17-32}} + +%Bouchitte 2003 + +@article{BouchitteT03, +author = {Vincent Bouchitt{\'{e}} and Ioan Todinca}, +title = {Approximating the treewidth of {AT}-free graphs}, +journal = dam, volume = 131, pages = {11-37}, year = 2003} + +@article{BouchitteMT03, +author = {V. Bouchitt{\'{e}} and F. Mazoit and I. Todinca}, +title = {Chordal embeddings of planar graphs}, +journal = dm, volume = 273, year = 2003, pages = {85-102}} + +%Bouchitte 2004 + +@article{BouchitteKMT04, +author = {V. Bouchitt{\'{e}} and Dieter Kratsch and Haiko M\"{u}ller and Ioan Todinca}, +title = {On treewidth approximations}, +journal = dam, volume = 136, year = 2004, pages = {183-196}} + +%Bous + +@inproceedings{BousquetDTY09, +author = {Nicolas Bousquet and Jean Daligault and St\'{e}phan Thomass\'{e} and Anders Yeo}, +title = {A polynomial kernel for multicut in trees}, +editor = {Susanne Albers and Jean-Yves Marion}, +series = {Dagstuhl Seminar Proceedings}, +publisher = {Leibniz-Zentrum f\"{u}r Informatik}, +address = {Schloss Dagstuhl, Germany}, +volume = {09001}, +booktitle = stacs09, pages = {183-194}, year = 2009} + +%Boy + +@article{BoyarK87, +author = {J. Boyar and H. Karloff}, +title = {Coloring planar graphs in parallel}, +journal = ja, year = 1987, volume = 8, pages = {470-479}} + +%Br + +%Bra + +@techreport{Brandenburg88, +author = {Franz J. Brandenburg}, +title = {Nice Drawings of Graphs and of Trees are Computationally hard}, +number = {MIP 8820}, institution = {University Passau}, year = 1988 } + +%Brandstadt 1987 + +@article{Brandstadt87, +author = {Andreas Brandst\"{a}dt}, +title = {The computational complexity of feedback vertex set, {H}amiltonian circuit, dominating set, +{S}teiner tree, and bandwidth on special perfect graphs}, +journal = {J. Inf. Process. Cybern. EIK}, +year = 1987, pages = {471-477}, volume = 23 } + +@article{BrandstadtK87, +author = {Andreas Brandst\"{a}dt and Dieter Kratsch}, +title = {On domination problems for permutation and other graphs}, +journal = tcs, volume = 54, year = 1987, pages = {181-198}} + +%Brandstadt 1991 + +@article{Brandstadt91, +author = {Andreas Brandst\"{a}dt}, +title = {Classes of bipartite graphs related to chordal graphs}, +journal = dam, volume = 32, year = 1991, pages = {51-60}} + +@techreport{Brandstadt91a, +author = {Andreas Brandst\"{a}dt}, +title = {Special Graph Classes --- A Survey (preliminary version)}, +institution = {University of Duisburg}, +year = 1991} + +%Brandstadt 1993 + +@inproceedings{Brandstadt93, +author = {Andreas Brandst\"{a}dt}, +title = {On improved time bounds for permutation graph classes}, +editor = {Ernst W. Mayr}, +booktitle = wg92, year = 1993, publisher = lncs657, pages = {1-10}} + +@techreport{BrandstadtDCV93, +author = {Andreas Brandst\"{a}dt and Feodor F. Dragan and Victor D. Chepoi and Vitaly I. Voloshin}, +title = {Dually chordal graphs}, +institution = {University of Duisburg}, +number = {SM-DU-225}, year = 1993} + +%Brandstadt 1999 + +@book{BrandstadtLS99, +author = {Andreas Brandst\"{a}dt and {Van Bang} Le and Jeremy P. Spinrad}, +title = {Graph Classes. {A} Survey}, +year = 1999, +series = {SIAM Monographs on Discrete Mathematics and Applications}, +publisher = {SIAM}, address = {Philadelphia, USA}} + +%Brandstadt 2002 + +@inproceedings{BrandstadtDL02, +author = {Andreas Brands\"{a}dt and Feodor F. Dragan and Ho\`{a}ng-Oanh Le and Raffaele Mosca}, +title = {New graph classes of bounded clique-width}, +editor = {Lud\u{e}k Ku\u{c}era}, +booktitle = wg02, publisher = lncs2573, year = 2002, pages = {57-67}} + +%Brandstadt 2003 + +@article{BrandstadtL03, +author = {Andreas Brands\"{a}dt and Vadim Lozin}, +title = {On the linear structure and clique-width of bipartite permutation graphs}, +journal = arscomb, year = 2003, volume = 67, pages = {273-281}} + +%Brandstadt 2004 + +@article{BrandstadtLM04, +author = {Andreas Brandst\"{a}dt and Ho\`{a}ng-Oanh Le and Raffaele Mosca}, +title = {Chordal co-gem-free and (${P_5}$,gem)-free graphs have bounded clique-width}, +journal = dam, volume = 145, year = 2004, pages = {232-241}} + +@article{BrandstadtDLL04, +author = {Andreas Brandst\"{a}dt and F. F. Dragan and Ho\`{a}ng-Oanh Le and V. B. Le}, +title = {Tree spanners on chordal graphs: complexity and algorithms}, +journal = tcs, volume = 310, year = 2004, pages = {329-354}} + +%Brandstadt 2006 + +@article{BrandstadtB06, +author = {Andreas Brandst\"{a}dt and Van Bang Le}, +title = {Structure and linear time recognition of 3-leaf powers}, +journal = ipl, volume = 98, year = 2006, pages = {133-138}} + +%Brandstadt 2008, + +@article{BrandstadtH08, +author = {Andreas Brandst\"{a}dt and Ch{\'{\i}}nh T. Ho\'{a}ng}, +title = {On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem}, +journal = tcs, volume = 389, year = 2008, pages = {295-306}} + +@article{BrandstadtH08a, +author = {Andreas Brandst\"{a}dt and Ch{\'{\i}}nh T. Ho\'{a}ng}, +title = {Maximum induced matchings for chordal graphs in linear time}, +journal = alg, volume = 52, year = 2008, pages = {440-447}} + +%Brandstadt 2009 + +@article{BrandstadtB09, +author = {Andreas Brandst\"{a}dt and Van {Bang Le}}, +title = {Simplicial powers of graphs}, +journal = tcs, volume = 410, year = 2009, pages = {5443-5454}} + +%Bre + +@inproceedings{BretscherCHP2003, +author = {Anna Bretscher and Derek Corneil and Michel Habib and Christophe Paul}, +title = {A simple linear time {LexBFS} cograph recognition algorithm}, +editor = {Hans L. Bodlaender}, +booktitle = wg03, publisher = lncs2880, year = 2003, pages = {119-130}} + +%Bri + +@article{BrinkmannKM01, +author = {Gunnar Brinkmann and Jack H. Koolen and V. Moulton}, +title = {On the hyperbolicity of chordal graphs}, +journal = {Annals of Combinatorics}, volume = 5, year = 2001, pages = {61-69}} + +%Bro + +%Broersma 1997 + +@inproceedings{BroersmaDK97a, +author = {H. Broersma and Elias Dahlhaus and Ton Kloks}, +title = {Algorithms for the treewidth and minimum fill-in of {HHD}-free graphs}, +editor = {Rolf H. M\"{o}hring}, +booktitle = wg97, publisher = lncs1335, pages = {109-117}, year = 1997} + +%Broersma 1998 + +@inproceedings{BroersmaKKM98, +author = {Hajo Broersma and Ton Kloks and Dieter Kratsch and Haiko M\"{u}ller}, +title = {A generalization of {AT}-free graphs and a generic algorithm for solving treewidth, minimum fill-in, and vertex ranking}, +editor = {Juraj Hromkovic and Ondrej S\'{y}kora}, +booktitle = wg98, publisher = lncs1517, year = 1998, pages = {88-99}} + +%Broersma 1999 + +@article{BroersmaKKM99, +author = {Hajo Broersma and Ton Kloks and Dieter Kratsch and Haiko M\"{u}ller}, +title = {Independent sets in asteroidal triple-free graphs}, +journal = sjdm, volume = 12, year = 1999, pages = {276-287}} + +%Broersma 2000 + +@article{BroersmaDK00, +author = {H. Broersma and Elias Dahlhaus and Ton Kloks}, +title = {A linear time algorithm for minimum fill in and tree width for distance hereditary graphs}, +journal = dam, volume = 99, year = 2000, pages = {367-400}} + +%Broersma 2002 + +@article{BroersmaKKM02, +author = {Hajo Broersma and Ton Kloks and Dieter Kratsch and Haiko M\"{u}ller}, +title = {A generalization of {AT}-free graphs and a generic algorithm for solving triangulation problems}, +journal = alg, volume = 32, year = 2002, pages = {594-610}} + +%Broersma 2007 + +@article{BroersmaL07, +author = {Hajo Broersma and Xueliang Li}, +title = {On the complexity of dominating set problems related to the minimum all-ones problem}, +journal = tcs, volume = 385, year = 2007, pages = {60-70}} + +%Broersma 2009 + +@article{BroersmaJP09, +author = {Hajo Broersma and Matthew Johnson and Dani\"{e}l Paulusma}, +title = {Upper bounds and algorithms for parallel knock-out numbers}, +journal = tcs, volume = 410, year = 2009, pages = {1319-1327}} + +%Brown + +@article{BrownFL89, +author = {D. J. Brown and Michael R. Fellows and Michael A. Langston}, +title = {Polynomial-time self-reducibility: Theoretical motivations and practical results}, +journal = ijcm, volume = 31, year = 1989, pages = {1-9}} + +%Bru + +@article{BruglieriME04, +author = {Maurizio Bruglieri and Francesco Maffioli and Matthias Ehrgott}, +title = {Cardinality constrained minimum cut problems: complexity and algorithms}, +journal = dam, volume = 137, year = 2004, pages = {311-341}} + +@article{BruglieriEHM06, +author = {Maurizio Bruglieri and Matthias Ehrgott and Horst W. Hamacher and Francesco Maffioli}, +title = {An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints}, +journal = dam, volume = 154, year = 2006, pages = {1344-1357}} + +@article{BrunoW70, +author = {John Bruno and Louis Weinberg}, +title = {A Constructive Graph-Theoretic Solution of the {S}hannon Switching Game}, +journal = ieeetct, volume = {CT-17}, year = 1970, pages = {74-81}} + +%Bry + +@inproceedings{BryantFKL87, +author = {R. L. Bryant and Michael R. Fellows and N. G. Kinnersley and Michael A. Langston}, +title = {On finding obstruction sets and polynomial-time algorithms for gate matrix layout}, +booktitle = {Proceedings of the 25th Allerton Conference on Communication, Control and Computing}, +year = 1987, pages = {397-398}} + +@article{BryantL06, +author = {David Bryant and Jens Lagergren}, +title = {Compatibility of unrooted phylogenetic trees is {FPT}}, +journal = tcs, volume = 351, year = 2006, pages = {296-302}} + +%Bu + +%Bub + +@article{BubeckB09, +author = {Uwe Bubeck and Hans {Kleine B\"{u}ning}}, +title = {A new {3-CNF} transformation by parallel-serial graphs}, +journal = ipl, volume = 109, year = 2009, pages = {376-379}} + +%Buc + +@article{Buchi60, +author = {J. R. B\"{u}chi}, +title = {Weak second order logic and finite automata}, +journal = {S. Math. Grundlagen Math.}, volume = 5, year = 1960, pages = {66-92}} + +%Bue + +@article{BuerM83, +author = {Hermann Buer and Rolf H. M{\"{o}}hring}, +title = {A fast algorithm for the decomposition of graphs and posets}, +journal = mor, volume = 8, number = 2, year = 1983, pages = {170-184}} + +%Bui + +@article{BuiXuanHLM09, +author = {B.-M. Bui-Xuan and M. Habib and V. Limouzy and F. {de Montgolfier}}, +title = {Algorithmic aspects of a general modular decomposition theory}, +journal = dam, volume = 157, year = 2009, pages = {1993-2009}} + +@article{BuiXuanTV10, +author = {Binh-Minh Bui-Xuan and Jan Arne Telle and Martin Vatshelle}, +title = {$H$-join decomposable graphs and algorithms with runtime single exponential in rankwidth}, +journal = dam, volume = 158, year = 2010, pages = {809-819}} + +%Bul + +@article{BultW08, +author = {Fokko J. {van de Bult} and Gerhard J. Woeginger}, +title = {The problem of the moody chess players}, +journal = ipl, volume = 108, pages = {336-337}, year = 2008} + +%Bun + +@article{Buneman74, +author = {P. Buneman}, +title = {A characterization of rigid circuit graphs}, +journal = dm, volume = 9, year = 1974, pages = {205-212}} + +%Bur + +@inproceedings{BurgstallerBS04, +author = {Bernd Burgstaller and Johann Blieberger and Bernhard Scholz}, +title = {On the Tree Width of {A}da Programs}, +booktitle = {Ada-Europe 2004}, year = 2004, pages = {78-90}} + +@article{Burke10, +author = {Edmund K. Burke and Jakub Mare\u{c}ek and Andrew J. Parkes and Hana Rudov\'{a}}, +title = {Decomposition, reformulation, and diving in university course timetabling}, +journal = cor, volume = 37, year = 2010, pages = {582-597}} + +@inproceedings{BurrageEFLMR06, +author = {Kevin Burrage and Vladimir Estivill-Castro and Michael R. Fellows and Michael A. Langston and Shev Mac +and Frances A. Rosamond}, +title = {The undirected feedback vertex set problem has a poly($k$) kernel}, +editor = {Hans L. Bodlaender and Michael A. Langston}, +booktitle = iwpec06, publisher = lncs4169, year = 2006, pages = {192-202}} + +%Bus + +@book{BusackerS65, +author = {R. G. Busacker and U. S. R. Murty}, +title = {Finite Graphs and Networks: an Introduction with Applications}, +publisher = {McGraw-Hill}, address = {New York}, year = 1965 } + +@unpublished{BussFM89, +author = {S. R. Buss and Michael R. Fellows and Burkhard Monien}, +title = {Linear-Time Algorithms for Some Well-Known Fixed Parameter Problems}, +note = {Manuscript, Department of Computer Science, University of Idaho}, +year = 1989 } + +@article{BussG93, +author = {Jonathan F. Buss and Judy Goldsmith}, +title = {Nondeterminism within {P}}, +journal = siamjc, volume = 22, year = 1993, pages = {560-572}} + +%By + +%Byl + +@article{BylanderATJ91, +author = {T. Bylander and D. Allemang and M.C. Tanner and J.R. Josephson}, +title = {The computational complexity of abduction}, +journal = artint, volume = 49, pages = {25-60}, year = 1991} + +%Bys + +@article{Byskov04, +author = {Jesper Makholm Byskov}, +title = {Enumerating maximal independent sets with applications to graph coloring}, +journal = orl, year = 2004, pages = {547-556}, volume = 32} + +@phdthesis{Byskov04a, +author = {Jesper Makholm Byskov}, +title = {Exact Algorithms for Graph Colouring and Exact Satisfiability}, +type = {PhD thesis}, +school = {University of Aarhus}, +address = {Aarhus, Denmark}, +year = {August, 2005}} + +%C + +%Ca + +%Cai + +%Cai 1989 + +@unpublished{CaiC89, +author = {Leizhen Cai and Derek G. Corneil}, +title = {Cycle Double Covers of Line Graphs}, +year = 1989, note = {Manuscript}} + +@unpublished{CaiE89, +author = {Leizhen Cai and John A. Ellis}, +title = {Linear time algorithms for edge colouring line graphs of trees and of unicyclic graphs}, +year = 1989, note = {Manuscript}} + +@unpublished{CaiE89a, +author = {Leizhen Cai and John A. Ellis}, +title = {{NP}-completeness of edge coloring some restricted graphs}, +year = 1989, note = {Manuscript}} + +%Cai 1993 + +@techreport{CaiCDF93, +author = {L. Cai and J. Chen and Rodney G. Downey and Michael R. Fellows}, +title = {The parameterized complexity of short computations and factorizations}, +institution = {Department of Computer Science, University of Victoria}, +type = {Technical Report}, +year = 1993, month = {7}} + +%Cai 1996 + +@article{Cai96, +author = {Leizhen Cai}, +title = {Fixed-parameter tractability of graph modification problems for heriditary properties}, +journal = ipl, volume = 58, year = 1996, pages = {171-176}} + +%Cai 1997 + +@article{CaiC97, +author = {Liming Cai and Jianer Chen}, +title = {On Fixed-Parameter Tractability and Approximability of {NP} Optimization Problems}, +journal = jcss, volume = 54, year = 1997, pages = {465-474}} + +@article{CaiCDF97, +author = {L. Cai and J. Chen and R. G. Downey and M. R. Fellows}, +title = {Advice classes of parameterized tractability}, +journal = apal, volume = 84, year = 1997, pages = {119-138}} + +%Cai 2000 + +@unpublished{Cai00, +author = {Leizhen Cai}, +title = {The complexity of colouring parameterized graphs}, +year = 2000, note = {Manuscript}} + +%Cai 2001 + +@article{CaiZ01, +author = {Leizhen Cai and Xuding Zhu}, +title = {Game chromatic index of $k$-degenerate graphs}, +journal = jgt, volume = 36, pages = {144-155}, year = 2001} + +@article{CaiJ03, +author = {Leitzhen Cai and D. Juedes}, +title = {On the existence of subexponential parameterized algorithms}, +journal = jcss, volume = 67, year = 2003, pages = {789-807}} + +%Cai 2006 + +@unpublished{Cai06, +author = {Leizhen Cai}, +title = {Parameterized complexity of cardinality constrained optimization problems}, +note = {Manuscript}, +year = {2006}} + +@inproceedings{CaiCC06, +author = {Leizhen Cai and S. M. Chan and S. O. Chan}, +title = {Random separation: a new method for solving fixed-cardinality +optimization problems}, +editor = {Hans L. Bodlaender and Michael A. Langston}, +booktitle = iwpec06, publisher = lncs4169, year = 2006, pages = {239-250}} + +%Cai 2009 + +@article{Cai09, +author = {Xuan Cai}, +title = {Linear kernelizations for restricted {3-Hitting Set} problems}, +journal = ipl, volume = 109, year = 2009, pages = {730-738}} + +%Cai 2010 + +@article{CaiH10, +author = {Liming Cai and Xiuzhen Huang}, +title = {Fixed-parameter approximation: Conceptual framework and approximability results}, +journal = alg, volume = 57, year = 2010, pages = {398-412}} + +%Cal + +@article{CalamoneriPP06, +author = {Tiziana Calamoneri and Andrzej Pelc and Rossella Petreschi}, +title = {Labeling trees with a condition at distance two}, +journal = dm, volume = 306, pages = {1534-1539}, year = 2006} + +%Can + +@inproceedings{CanoM94, +author = {A. Cano and S. Moral}, +title = {Heuristic algorithms for the triangulation of graphs}, +editor = {B. Bouchon-Meunier and R. R. Yager and I. A. Zadeh}, +booktitle = {Advances in Intelligent Computing, Selected Papers from the 5th +International Conference on Precessing and Management of Uncertainty in +Knowledge-Based Systems IPMU94}, +year = 1994, pages = {98-107}, +publisher = lncs945} + +%Car + +@article{CaragiannisFKP06, +author = {Ioannis Caragiannis and Aleksei V. Fishkin and +Christos Kaklamanis and Evi Papaioannou}, +title = {Randomized on-line algorithms and lower bounds for computing large +independent sets in disk graphs}, +journal = dam, volume = 155, pages = {119-136}, year = 2007} + +%Cas + +@article{CastelinoHS96, +author = {D. Castelino and S. Hurley and N. M. Stephens}, +title = {A tabu search algorithm for frequency assignment}, +journal = aor, volume = 63, pages = {301-319}, year = 1996} + +%Cat + +@inproceedings{CattellD94, +author = {Kevin Cattell and Michael J. Dinneen}, +title = {A characterization of graphs with vertex cover up to five}, +booktitle = {Proceedings International Workshop on Orders, Algorithms, and Applications, ORDAL'94}, +publisher = lncs831, year = 1994, pages = {86-99}} + +@article{CattellDF96, +author = {Kevin Cattell and Michael J. Dinneen and Michael R. Fellows}, +title = {A simple linear-time algorithm for finding path-decompositions of +small width}, +journal = ipl, volume = 57, year = 1996, pages = {197-204}} + +@inproceedings{CattellDF95, +author = {Kevin Cattell and Michael J. Dinneen and Michael R. Fellows}, +title = {Obstructions to Within a Few Vertices or Edges of Acyclic}, +editor = {Selim G. Akl and Frank K. H. A. Dehne and J\"{o}rg-R\"{u}diger Sack and Nicola Santoro}, +booktitle = wads95, pages = {415-427}, publisher = lncs955, year = 1995} + +@article{CattellDDFL00, +author = {Kevin Cattell and Michael J. Dinneen and Rodney G. Downey and +Michael R. Fellows and Michael A. Langston}, +title = {On computing graph minor obstruction sets}, +journal = tcs, volume = 233, year = 2000, pages = {107-127}} + +%Ce + +%Cer + +@article{CeraDGV07, +author = {M. Cera and A. Dianez and P. Garcia-Vazquez and J.C. Valenzuela}, +title = {Graphs without minor complete subgraphs}, +journal = dm, volume = 307, year = 2007, pages = {1276-1284}} + +%Ces + +@article{Cesati02, +author = {M. Cesati}, +title = {Perfect code is {$W[1]$}-complete}, +journal = ipl, volume = 81, year = 2002, pages = {163-168}} + +%Ch + +%Cha + +%Chan + +@inproceedings{ChanD06, +author = {Hei Chan and Adnan Darwiche}, +title = {On the robustness of most probable explanations}, +booktitle = uai06, year = 2006, pages = {63-71}, publisher = {AUAI Press}} + +@article{ChandraKS81, +author = {A. K. Chandra and D. C. Kozen and L. J. Stockmeyer}, +title = {Alternation}, +journal = jacm, volume = 28, pages = {114-133}, year = 1981 } + +@article{ChandranS03, +author = {L. {Sunil Chandran} and C. R. Subramanian}, +title = {A spectral lower bound for the treewidth of a graph and its consequences}, +journal = ipl, volume = 87, year = 2003, pages = {195-200}} + +@article{ChandranS05, +author = {L. {Sunil Chandran} and C. R. Subramanian}, +title = {Girth and treewidth}, +journal = jctb, volume = 93, year = 2005, pages = {23-32}} + +@article{ChandraG06, +author = {L. {Sunil Chandran} and Fabrizio Grandoni}, +title = {A linear time algorithm to list the minimal separators of chordal graphs}, +journal = dm, volume = 306, pages = {351-358}, year = 2006} + +@article{ChandranK06, +author = {L. {Sunil Chandran} and T. Kavitha}, +title = {The treewidth and pathwidth of hypercubes}, +journal = dm, volume = 306, pages = {359-365}, year = 2006} + +@article{ChandranS07, +author = {L. {Sunil Chandran} and Naveen Sivadasan}, +title = {Boxicity and treewidth}, +journal = jctb, volume = 97, pages = {733-744}, year = 2007} + +%Chandrasekharan 1980 + +@article{ChandrasekharanT80, +author = {R. Chandrasekharan and A. Tamir}, +title = {An {$O((n \log p)^2 )$ } Algorithm for the Continuous +$p$-Center Problem on a Tree}, +journal = sjadm, volume = 1, pages = {370-375}, year = 1980 } + +%Chandrasekharan 1982 + +@article{ChandrasekharanT82, +author = {R. Chandrasekharan and A. Tamir}, +title = {Polynomially Bounded Algorithms for Locating $p$-Centers on a +Tree}, +journal = mp, volume = 22, year = 1982, pages = {304-315}} + +%Chandrasekharan 1988 + +@article{ChandrasekharanI88, +author = {Narayanan Chandrasekharan and S. Sitharama Iyengar}, +title = {{NC} algorithms for recognizing chordal graphs and +$k$-Trees}, +journal = ietc, volume = 37, year = 1988, pages = {1178-1183}} + +@article{ChandrasekhasanLI88, +author = {Narayanan Chandrasekharan and R. Laskar and S. S. Iyengar}, +title = {Maximal clique separators of chordal graphs}, +journal = cn, volume = 62, year = 1988, pages = {203-215}} + +@inproceedings{ChandrasekharanH88, +author = {Narayanan Chandrasekharan and S. T. Hedetniemi}, +title = {Fast parallel algorithms for tree decomposing and parsing partial $k$-Trees}, +booktitle = {Proceedings of the 26th Annual Allerton Conference on Communication, Control, and Computing}, +year = 1988, +pages={283-292}, +address = {Urbana-Champaign, Illinois}} + +%Chandrasekharan 1989 + +@phdthesis{Chandrasekharan89, +author = {Narayanan Chandrasekharan}, +title = {Fast Parallel Algorithms and Enumeration Techniques for Partial $k$-Trees}, +school = {Clemson University}, +year = 1989} + +%Chandrasekharan 1990 + +@article{Chandrasekharan90a, +author = {Narayanan Chandrasekharan}, +title = {Isomorphism testing of $k$-trees is in {NC}, for fixed $k$}, +journal = ipl, volume = 34, year = 1990, pages = {283-287}} + +%Chang + +@article{ChangD87, +author = {K. Chang and D. Du}, +title = {Efficient algorithms for the layer assignment problem}, +journal = {IEEE Trans CAD}, volume = 6, year = 1987, pages = {67-78}} + +@article{ChangK96, +author = {G. J. Chang and D. Kuo}, +title = {The {$L(2,1)$}-labelling problem on graphs}, +journal = sjdm, volume = 9, year = 1996, pages = {309-316}} + +@article{Chang98, +author = {M.-S. Chang}, +title = {Efficient algorithms for the domination problems on interval and +circular arc-graphs}, +journal = siamjc, volume = 27, year = 1998, pages = {1671-1694}} + +@article{ChangKKLY00, +author = {G. J. Chang and W.-T. Ke and D. Kuo and D.D.-F. Liu and R. K. Yeh}, +title = {On {$L(d,1)$}-labelings of graphs}, +journal = dm, volume = 220, pages = {57-66}, year = 2000} + +@inproceedings{ChangT00, +author = {J. Chang and L. Tassiulas}, +title = {Fast Approximate Algorithms for Maximum Lifetime Routing +in Wireless Ad-hoc Networks}, +booktitle = {Proceedings Networking 2000}, year = 2000, +pages = {702-713}} + +@article{ChangL03, +author = {G. J. Chang and C. Lu}, +title = {Distance-two labelings of graphs}, +journal = ejcom, year = 2003, volume = 24, pages = {53-58}} + +@article{ChangT04, +author = {J. Chang and L. Tassiulas}, +title = {Maximum lifetime routing in wireless sensor networks}, +journal = {IEEE/ACM Transaction on Networking}, +volume = 12, number = 4, year = 2004, pages = {609-619}} + +%Chap + +@inproceedings{ChapelleMT09, +author = {Mathieu Chapelle and Fr{\'e}d{\'e}ric Mazoit and Ioan Todinca}, +title = {Constructing brambles}, +editor = {Rastislav Kr{\'a}lovic and Damian Niwinski}, +booktitle = mfcs09, year = 2009, publisher = lncs5734, pages = {223-234}} + +%Char + +@article{CharniakS94, +author = {Eugene Charniak and Solomon Eyal Shimony}, +title = {Cost-based abduction and {MAP} explanation}, +journal = ai, volume = 66, year = 1994, pages = {345-374}} + +%Chau + +@inproceedings{ChaudhuriZ95, +author = {Shiva Chaudhuri and Christos D. Zaroliagis}, +title = {Optimal parallel shortest paths in small treewidth digraphs}, +booktitle = esa95, +editor = {Paul Spirakis}, +publisher = lncs979, year = 1995, pages = {31-45}} + +@article{ChaudhuriZ98, +author = {Shiva Chaudhuri and Christos D. Zaroliagis}, +title = {Shortest paths in digraphs of small treewidth. {P}art {II}: {O}ptimal +parallel algorithms}, +journal = tcs, volume = 203, year = 1998, pages = {205-223}} + +@article{ChaudhuriZ00, +author = {Shiva Chaudhuri and Christos D. Zaroliagis}, +title = {Shortest paths in digraphs of small treewidth. {P}art {I}: +{S}equential Algorithms}, +journal = alg, volume = 27, year = 2000, pages = {212-226}} + + +@article{ChavezT98, +author = {J. D. Chavez and R. Trapp}, +title = {The cyclic cutwidth of trees}, +journal = dam, volume = 87, year = 1998, pages = {25-32}} + +%Che + +%Chek + +@article{ChekuriK05, +author = {C. Chekuri and S. Khanna}, +title = {A Polynomial Time Approximation Scheme for the Multiple +Knapsack Problem}, +journal = siamjc, volume = 35, number = 3, year = 2005, +pages = {713-728}} + + +%Chen 1988 + +@article{ChenKS88, +author = {G. H. Chen and M. T. Kuo and J. P. Sheu}, +title = {An optimal time algorithm for finding a maximum weight +independent set in a tree}, +journal = bit, year = 1988 } + +%Chen 1992 + +@inproceedings{ChenL92, +author = {Maw-Hwa Chen and Sing-Ling Lee}, +title = {Linear time algorithms for $k$-cutwidth problem}, +editor = {Toshihide Ibaraki and Yasuyoshi Inagaki and Kazuo Iwama and Takao Nishizeki and Masafumi Yamashita}, +booktitle = isaac92, year = 1992, publisher = lncs650, pages = {21-30}} + +%Chen 1993 + +@inproceedings{Chen93, +author = {J. Chen}, +title = {A linear time algorithm for isomorphism of graphs of bounded average genus}, +editor = {Ernst W. Mayr}, +booktitle = wg92, year = 1993, publisher = lncs657, pages = {103-113}} + +%Chen 1995 + +@article{ChenMS95, +author = {Guantao Chen and Lisa R. Markus and R. H. Schelp}, +title = {Vertex Disjoint Cycles for Star Free Graphs}, +journal = {Australasian Journal of Combinatorics}, volume = 11, year = 1995, +pages = {157-167}} + +%Chen 1998 + +@article{Chen98, +author = {Z.-Z. Chen}, +title = {Efficient approximation schemes for maximization problems on +{$K_{3,3}$}-free or {$K_5$}-free graphs}, +journal = ja, volume = 26, year = 1998, pages = {166-187}} + +%Chen 2001 + +@article{Chen01, +author = {Z.-Z. Chen}, +title = {Approximation algorithms for independent sets in map graphs}, +journal = ja, volume = 41, pages = {20-40}, year = 2001} + +@inproceedings{ChenFJK01, +author = {Jianer Chen and Donald K. Friesen and Weijia Jia and Iyad Kanj}, +title = {Using nondeterminism to design deterministic algorithms}, +booktitle = fsttcs01, year = 2001, pages = {120-131}, publisher = lncs2245} + +@article{ChenKJ01, +author = {J. Chen and I. A. Kanj and W. Jia}, +title = {Vertex cover: Further observations and further improvements}, +journal = ja, volume = 41, year = 2001, pages = {280-301}} + +%Chen 2003 + +@inproceedings{ChenKPSX03, +author = {Jianer Chen and Iyad A. Kanj and Ljubomir Perkovic and Eric Sedgwick and Ge Xia}, +title = {Genus characterizes the complexity of graph problems: Some tight results}, +editor = {Jos Baeten and Jan Karel Lenstra and Joachim Parrow and Gerhard J. Woeginger}, +booktitle = icalp03, publisher = lncs2719, year = 2003, pages = {845-856}} + +%Chen 2004 + +@inproceedings{Chen04, +author = {Hubie Chen}, +editor = {Ramon L\'{o}pez {de M\'{a}ntaras} and Lorenza Saitta}, +title = {Quantified Constraint Satisfaction and Bounded Treewidth}, +booktitle = ecai2004, pages = {161-165}, year = 2004} + +@inproceedings{ChenCFHJKX04, +author = {J. Chen and B. Chor and M. Fellows and X. Huang and D. Juedes and I. Kanj and G. Xia}, +title= {Tight Lower Bounds for Certain Parameterized {N}{P}-hard Problems}, +booktitle={Proceedings of 19th Annual IEEE Conference on Computational Complexity}, +year = {2004}, +pages = {150--160}, +location = {Amherst, Massachusetts, United States}} + +%Chen 2005 + +@article{Chen05, +author = {J.-E. Chen}, +title = {Parameterized computation and complexity: A new approach dealing with +{NP}-hardness}, +journal = jcss, volume = 20, pages = {18-37}, year = 2005} + +@article{ChenCMXJKX05, +author = {Jianer Chen and Benny Chor and Mike Fellows and Xiuzhen Huang and +David W. Juedes and Iyad A. Kanj and Ge Xia}, +title = {Tight lower bounds for certain parameterized {NP}-hard problems}, +journal = ic2, volume = {201}, year = {2005}, pages = {216-231}} + +%Chen 2006 + +@article{ChenHS06, +author = {Xujin Chen and Xiaodong Hu and Tianping Shuai}, +title = {Inapproximability and approximability of maximal tree routing and coloring}, +journal = jco, volume = 11, year = 2006, pages = {219-229}} + +@article{ChenHKX06, +author = {Jianer Chen and X. Huang and I. A. Kanj and G. Xia}, +title = {On the computational hardness based on linear {FPT}-reductions}, +journal = jco, volume = 11, year = 2006, pages = {231-247}} + +@article{ChenHKX06a, +author = {Jianer Chen and X. Huang and I. A. Kanj and G. Xia}, +title = {Strong computational lower bounds via parameterized complexity}, +journal = jcss, volume = 72, year = 2006, pages = {1346-1367}} + +%Chen 2007 + +@article{ChenFKX07, +author = {Jianer Chen and Henning Fernau and Iyad A. Kanj and Ge Xia}, +title = {Parametric duality and kernelization: Lower bounds and upper bounds on kernel size}, +journal = siamjc, volume = 37, year = 2007, pages = {1077-1106}} + +@article{ChenHKX07, +author = {Jianer Chen and Xiuzhen Huang and Iyad A. Kanj and Ge Xia}, +title = {Polynomial time approximation schemes and parameterized complexity}, +journal = dam, volume = 155, year = 2007, pages = {180-193}} + +@article{ChenLLLW07, +author = {Mingxia Chen and Jianbo Li and Jianping Li and Weidong Li +and Lusheng Wang}, +title = {Some approximation algorithms for the clique partition problem +in weighted interval graphs}, +journal = tcs, volume = 381, year = 2007, pages = {124-133}} + +@inproceedings{ChenLSZ07, +author = {Jianer Chen and Songjian Lu and Sing-Hoi Sze and Fenghui Zhang}, +title = {Improved algorithms for path, matching, and packing problems}, +booktitle = soda07, +editor = {Nikhil Bansal and Kirk Pruhs and Clifford Stein}, +pages = {298-307}, year = 2007} + +%Chen 2008 + +@article{ChenFLLV08, +author = {Jianer Chen and Fedor V. Fomin and Yang Liu and Songjian Lu and Yngve Villanger}, +title = {Improved algorithms for feedback vertex set problems}, +journal = jcss, volume = 74, year = 2008, pages = {1188-1198}} + +@inproceedings{ChenLLSR08, +author = {Jianer Chen and Yang Liu and Songjian Lu and Barry {O'Sullivan} and Igor Razgon}, +title = {A fixed-parameter algorithm for the directed feedback vertex set problem}, +editor = {Richard E. Ladner and Cynthia Dwork}, +booktitle = stoc08, pages = {177-186}, year = 2008} + +%Chen 2009 + +@article{ChenKX09, +author = {Jianer Chen and Iyad A. Kanj and Ge Xia}, +title = {On parameterized exponential time complexity}, +journal = tcs, year = 2009, volume = 410, pages = {2641-2648}} + +@article{ChenLL09, +author = {Jianer Chen and Yang Liu and Songjian Lu}, +title = {An improved parameterized algorithm for the minimum node multiway cut problem}, +journal = alg, year = 2009, volume = 55, pages = {1-13}} + +@article{ChenL09, +author = {Jianer Chen and Songjian Lu}, +title = {Improved parameterized set splitting algorithms: A probabilistic approach}, +journal = alg, volume = 54, year = 2009, pages = {472-489}} + +%Cher + +@article{CheritonT76, +author = {D. Cheriton and R. E. Tarjan}, +title = {Finding minimum spanning trees}, +journal = siamjc, year = 1976, pages = {724-742}} + +@article{CheriyanM88, +author = {J. Cheriyan and S. N. Maheshwari}, +title = {Finding nonseparating induced cycles and independent spanning +trees in 3-connected graphs}, +journal = ja, volume = 9, pages = {507-537}, year = 1988 } + +%Chi + +@article{ChibaNS81, +author = {N. Chiba and Takao Nishizeki and N. Saito}, +title = {A linear algorithm for five-coloring a planar graph}, +journal = ja, year = 1981, volume = 2, pages = {317-327}} + +@article{ChibaN85, +author = {N. Chiba and Takao Nishizeki}, +title = {Arboricity and Subgraph Listing Algorithms}, +journal = siamjc, volume = 14, pages = {210-223}, year = 1985} + +@article{ChibaN89, +author = {N. Chiba and Takao Nishizeki}, +title = {The {H}amiltonian Cycle problem is linear-time solvable for +4-connected planar graphs}, +journal = ja, volume = 10, pages = {187-211}, year = 1989} + +@article{ChinnCDG82, +author = {P. Z. Chinn and J. Chv\'{a}talov\'{a} and A. K. Dewdney and N. E. +Gibbs}, +title = {The bandwidth problem for graphs and matrices --- A survey}, +journal = jgt, volume = 6, year = 1982, pages = {223-254}} + +%Chl + +@article{Chlebik08, +author = {Miroslav Chleb{\'\i}k and Janka Chleb{\'\i}kov{\'{a}}}, +title = {Crown reductions for the {M}inimum {W}eighted {V}ertex {C}over problem}, +journal = dam, volume = 156, year = 2008, pages = {292-312}} + +@article{Chlebikova92, +author = {J. Chleb{\'\i}kov{\'{a}}}, +title = {On the tree width of a graph}, +journal = {Acta Mathematica Universitatis Comenianae}, +volume = {LXI}, number = 2, pages = {225-236}, year = 1992} + +@article{Chlebikova02, +author = {J. Chleb{\'\i}kov{\'{a}}}, +title = {The structure of obstructions to treewidth and pathwidth}, +journal = dam, volume = 120, pages = {61-71}, year = 2002} + +@article{ChlebikovaJ07, +author = {Janka Chleb{\'\i}kov{\'{a}} and Klaus Jansen}, +title = {The $d$-precoloring problem for $k$-degenerate graphs}, +journal = dm, volume = 307, year = 2007, pages = {2082-2093}} + +%Cho + +@inproceedings{ChorFRRRS07, +author = {B. Chor and M. Fellows and M. Ragan and F. Rosamond and I. Razgon and S. Snir}, +title = {Connected coloring completion for general graphs: algorithms and complexity}, +editor = {Guohui Lin}, +booktitle = cocoon07, publisher = lncs4598, pages = {75-85}, year = 2007} + +@article{ChouWZ03, +author = {C. Chou and W. Wang and X. Zhu}, +title = {Relaxed game chromatic number of graphs}, +journal = dm, year = 2007, volume = 262, pages = {89-98}} + +@article{ChouKHC07, +author = {Hsin-Hung Chou and Ming-Tat Ko and Chin-Wen Ho and Gen-Huey Chen}, +title = {Node-searching problem on block graphs}, +journal = dam, volume = 156, year = 2007, pages = {55-75}} + +%Chr + +@book{Christofides75, +author = {N. Christofides}, +title = {Graph Theory: An Algorithmic Approach}, +publisher = {Academic Press}, +address = {New York}, +year = 1975 } + +@article{ChrobakN90, +author = {Marek Chrobak and Takao Nishizeki}, +title = {Improved Edge-Coloring Algorithms for Planar Graphs}, +journal = ja, volume = 102, year = 1990, pages = {102 - 116}} + +@techreport{ChrobakK93, +author = {M. Chrobak and G. Kant}, +title = {Convex Grid Drawings of 3-Connected Planar Graphs}, +type = tr, institution = vi, number = {RUU-CS-93-45}, year = 1993} + +%Chu + +%Chud + +@article{ChudakGHW98, +author = {F. A. Chudak and M. X. Goemans and D. S. Hochbaum and D. P. Williamson}, +title = {A primal--dual interpretation of two 2-approximation algorithms +for the feedback vertex set problem in undirected graphs}, +journal = orl, volume = 22, year = 1998, pages = {111-118}} + +@article{ChudnovskyRST06, +author = {Maria Chudnovsky and Neil Robertson and Paul D. Seymour and Robin Thomas}, +title = {The strong perfect graph theorem}, +journal = {Annals of Mathematics}, volume = 164, pages = {51-229}, year = 2006} + +@article{ChudnovskyRST10, +author = {Maria Chudnovsky and Neil Robertson and Paul D. Seymour and Robin Thomas}, +title = {$K_4$-free graphs with no odd holes}, +journal = jctb, volume = 100, year = 2010, pages = {313-331}} + +%Chung 1984 + +@article{Chung84, +author = {F. R. K. Chung}, +title = {On Optimal Linear Arrangement of Trees}, +journal = {Computers \& Mathematics with Applications}, volume = 10, year = 1984, pages = {43-60}} + +%Chung 1985 + +@article{Chung85, +author = {F. R. K. Chung}, +title = {On the Cutwidth and Topological Bandwidth of a Tree}, +journal = sjadm, volume = 6, year = 1985, pages = {268-277}} + +@article{ChungMST85, +author = {M.-J. Chung and F. S. Makedon and Ivan Hal Sudborough and J. +Turner}, +title = {Polynomial Time Algorithms for the Min Cut Problem on Degree +Restricted Trees}, +journal = siamjc, year = 1985, volume = 14, pages = {158-177}} + +%Chung 1986 + +@article{ChungLR86, +author = {F. R. K. Chung and F. T. Leighton and A. L. Rosenberg}, +title = {Embedding graphs in books: {A} graph layout problem with +applications to {VLSI} design}, +year = 1986, journal = sjadm } + +%Chung 1989 + +@article{ChungS89, +author = {F. R. K. Chung and Paul D. Seymour}, +title = {Graphs with small bandwidth and cutwidth}, +journal = dm, volume = 75, pages = {113-119}, year = 1989} + +%Chung 1994 + +@article{ChungM94, +author = {F. R. K. Chung and David Mumford}, +title = {Chordal Completions of Planar Graphs}, +journal = jctb, volume = {62}, pages = {96-106}, year = 1994} + +%Cl + +%Cla + +@inproceedings{ClautiauxCMN03, +author = {F. Clautiaux and J. Carlier and A. Moukrim and S. N\'{e}gre}, +title = {New lower and upper bounds for graph treewidth}, +editor = {J. D. P. Rolim}, +booktitle = wea03, publisher = lncs2647, year = 2003, pages = {70-80}} + +@article{ClautiauxMNC04, +author = {F. Clautiaux and A. Moukrim and S. N{\'e}gre and J. Carlier}, +title = {Heuristic and Meta-Heuristic Methods for Computing Graph Treewidth}, +journal = {RAIRO Operations Research}, volume = 38, year = 2004, pages = {13-26}} + +%Cle + +@article{ClearyJ09, +author = {Sean Cleary and Katherine {St. John}}, +title = {Rotation distance is fixed-parameter tractable}, +journal = ipl, volume = 109, year = 2009, pages = {918-922}} + +%Co + +%Coc + +%Cockayne 1975 + +@article{CockayneGH75, +author = {E. J. Cockayne and S. E. Goodman and S. T. Hedetniemi}, +title = {A Linear Algorithm for the Domination Number of a Tree}, +journal = ipl, volume = 4, year = 1975, pages = {41-44}} + +%Cockayne 1981 + +@article{CockayneFPT81, +author = {E. J. Cockayne and O. Favaron and C. Payan and A. Thomason}, +title = {Contributions to the Theory of Domination, Independence, and +Irredundance in Graphs}, +journal = dm, vol = 33, year = 1981, pages = {249-258}} + +%Cockayne 1986 + +@article{CockayneH86, +author = {E. J. Cockayne and D. E. Hewgill}, +title = {Exact computation of {S}teiner minimal trees in the plane}, +journal = ipl, volume = 2, year = 1986, pages = {151-156}} + +%Cockayne 2004 + +@article{CockayneDHH04, +author = {E. J. Cockayne and P. A. Dreyer and S. M. Hedetniemi and S. T. +Hedetniemi}, +title = {Roman domination in graphs}, +journal = dm, volume = 278, year = 2004, pages = {11-22}} + +%Cockayne 2007 + +@article{Cockayne07, +author = {E. J. Cockayne}, +title = {Irredundance, secure domination and maximum degree in trees}, +journal = dm, volume = 307, year = 2007, pages = {12-17}} + + +%Coh + +@techreport{CohenSTV92, +author = {Robert F. Cohen and S. Sairam and Roberto Tamassia and J. S. Vitter}, +title = {Dynamic Algorithms for Bounded Tree-Width Graphs}, +type = {Technical Report}, +number = {CS-92-19}, +institution = {Department of Computer Science, Brown University}, +year = 1992} + +@inproceedings{CohenSTV93, +author = {Robert F. Cohen and S. Sairam and Roberto Tamassia and J. S. Vitter}, +title = {Dynamic Algorithms for Optimization Problems in Bounded Tree-Width Graphs}, +editor = {Giovanni Rinaldi and Laurence A. Wolsey}, +booktitle = {Proceedings of the 3rd Conference on Integer Programming and Combinatorial Optimization, IPCO'93}, +pages = {99-112}, +year = 1993} + +@inproceedings{CohenT93, +author = {Robert F. Cohen and Roberto Tamassia}, +title = {Combine and Conquer}, +booktitle = esa93, +editor = {Thomas Lengauer}, +year = 1993, +pages = {97-108}, +publisher = lncs726, +} + +%Col + +%Colb + +@article{ColbournB81, +author = {Charles J. Colbourn and K. S. Booth}, +title = {Linear time automorphism algorithms for trees, interval graphs, and +planar graphs}, +journal = siamjc, volume = 10, pages = {203-225}, year = 1981} + +@inproceedings{ColbournP84, +author = {Charles J. Colbourn and Andrzej Proskurowski}, +title = {Concurrent transmissions in broadcast networks}, +editor = {Jan Paredaens}, +booktitle = icalp84, publisher = lncs172, pages = {128-136}, year = 1984} + +@article{ColbournS85, +author = {Charles J. Colbourn and L. K. Stewart}, +title = {Dominating cycles in series-parallel graphs}, +journal = arscomb, volume = {19A}, year = 1985, pages = {107-112}} + +@article{ColbournDN89, +author = {Charles J. Colbourn and Robert P. J. Day and Louis D. Nel}, +title = {Unranking and ranking spanning trees of a graph}, +journal = ja, volume = 10, year = 1989, pages = {271-286}} + +%Cole + +@article{ColeV88, +author = {Richard Cole and Uzi Vishkin}, +title = {The Accelerated Centroid Decomposition Technique for Optimal +Parallel Tree Evaluation in Logarithmic Time}, +journal = alg, year = 1988, volume = 3, pages = {329-346}} + +@article{ColeV91, +author = {Richard Cole and Uzi Vishkin}, +title = {Approximate Parallel Scheduling {II}. {A}pplications to +Logarithmic-Time Optimal Parallel Graph Algorithms}, +journal = ic2, volume = 92, pages = {1-47}, year = 1991} + +@article{ColeZ95, +author = {Richard Cole and Ofer Zajicek}, +title = {An asynchronous parallel algorithm for undirected graph +connectivity}, +journal = ja, volume = 18, pages = {50-97}, year = 1995} + +@article{ColeK08, +author = {Richard Cole and {\L}ukasz Kowalik}, +title = {New linear-time algorithms for edge-coloring planar graphs}, +journal = alg, volume = 50, year = 2008, pages = {351-368}} + +%Coli + +@article{Colin98, +author = {Y. {Colin de Verdi\`{e}re}}, +title = {Multiplicities of eigenvalues and tree-width of graphs}, +journal = jctb, volume = 74, pages = {121-146}, year = 1998} + +%Com + +@unpublished{ComptonH83, +author = {K. Compton and C. W. Henson}, +title = {A simple method for proving lower bounds on the complexity of logical +theories}, +note = {Extended abstract, preprint}, year = 1983} + +@techreport{ComptonH87, +author = {K. Compton and C. W. Henson}, +title = {A Uniform Method for Proving Lower Bounds on the Computational +Complexity of Logical Theories}, +number = {CRL-TR-04-87}, +institution = {The University of Michigan, Computing Research +Laboratory}, +pages = 53, +year = 1987, month = {4}, type = {Report}} + +%Con + +@techreport{CondonFLS93, +author = {Anne Condon and Joan Feigenbaum and Casten Lund and Peter Shor}, +title = {Probabilistic Checkable Debate Systems and Approximation Algorithms +for {PSPACE}-hard Functions}, +institution = {DIMACS}, +year = 1993} + +@unpublished{CondonFLS93a, +author = {Anne Condon and Joan Feigenbaum and Casten Lund and Peter Shor}, +title = {Random Debaters and the Hardness of Approximating Stochastic +Functions (Extended Abstract)}, +note = {Manuscript}, +year = 1993} + +@book{Conway76, +author = {J. H. Conway}, +title = {On Numbers and Games}, +publisher = {Academic Press}, +address = {London}, year = 1976 } + +%Coo + +@inproceedings{Cook71, +author = {S. A. Cook}, +title = {The complexity of theorem-proving procedures}, +booktitle = stoc71, +publisher = {ACM}, address = {New York}, year = 1971, pages = {151-158}} + +@techreport{CookS93, +author = {William Cook and Paul D. Seymour}, +title = {An Algorithm for the Ring-Routing Problem}, +institution = {Bellcore}, +year = 1993, +type = {Bellcore Technical Memorandum}} + +@misc{Cook96, +author = {William Cook}, +year = 1996, note = {Personal communication}} + +@article{CookS03, +author = {William Cook and Paul D. Seymour}, +title = {Tour merging via branch-decomposition}, +year = 2003, number = 3, volume = 15, pages = {233-248}, +journal = informsjc} + +@article{Cooper90, +author = {Gregory F. Cooper}, +title = {The computational complexity of probabilistic inference using +{B}ayesian belief networks}, +journal = artint, volume = 42, pages = {393--405}, year = 1990} + +@techreport{Cooper93, +author = {Gregory F. Cooper}, +title = {Bayesian Belief-Network Inference Using Recursive Decomposition}, +number = {KSL 90-05}, +year = 1990, +institution = {Knowledge Systems Laboratory, Medical Computer Science, +Stanford}} + +@techreport{Cooper93a, +author = {Gregory F. Cooper}, +title = {A Recursive-Decomposition Method for Solving {AI} Graph Problems}, +number = {SMI-91-2}, +institution = {Section of Medical Informatics, University of Pittsburgh}, +year = 1993} + +%Cop + +@article{CoppersmithV85, +author = {D. Coppersmith and Uzi Vishkin}, +title = {Solving {NP}-Hard Problems in 'Almost Trees': Vertex Cover}, +journal = dam, year = 1985, volume = 10, pages = {27-45}} + +@article{CoppersmithW90, +author = {D. Coppersmith and S. Winograd}, +title = {Matrix multiplication via arithmetic progression}, +journal = {Journal of Symbolic Computation}, volume = 9, year = 1990, pages = {251-280}} + +%Cor + +@book{CormenLR89, +author = {Thomas H. Cormen and Charles E. Leiserson and Ronald L. Rivest}, +title = {Introduction to Algorithms}, +publisher = {MIT Press}, address = {Cambridge, Mass., USA}, year = 1989} + +@book{CormenLRS01, +author = {Thomas H. Cormen and Charles E. Leiserson and Ronald L. Rivest +and Clifford Stein}, +title = {Introduction to Algorithms, Second Edition}, +publisher = {MIT Press}, address = {Cambridge, Mass., USA}, year = 2001} + +%Corneil 1981 + +@article{CorneilLS81, +author = {Derek G. Corneil and H. Lerchs and L. {Stewart Burlingham}}, +title = {Complement reducible graphs}, +journal = adm, volume = 1, year = 1981, pages = {145-162}} + +%Corneil 1983 + +@article{CorneilK83, +author = {Derek G. Corneil and D. G. Kirkpatrick}, +title = {Families of recursively defined perfect graphs}, +journal = cn, volume = 39, year = 1983, pages = {237-246}} + +%Corneil 1984 + +@article{CorneilP84, +author = {Derek G. Corneil and Y. Perl}, +title = {Clustering and domination in perfect graphs}, +journal = dam, volume = 9, year = 1984, pages = {27-39}} + +@article{CorneilPS84, +author = {Derek G. Corneil and Y. Perl and L. K. Stewart}, +title = {Cographs: recognition, applications and algorithms}, +journal = cn, volume = 43, year = 1984, pages = {249-258}} + +%Corneil 1985 + +@article{CorneilPS85, +author = {Derek G. Corneil and Y. Perl and L. K. Stewart}, +title = {A linear recognition algorithm for cographs}, +journal = siamjc, year = 1985, pages = {926-934}, volume = 14 } + +%Corneil 1987 + +@article{CorneilK87, +author = {Derek G. Corneil and J. Mark Keil}, +title = {A Dynamic Programming Approach to the Dominating Set Problem on $k$-trees}, +journal = sjadm, pages = {535-543}, volume = 8, year = 1987 } + +%Corneil 1992 + +@techreport{CorneilOS92, +author = {Derek G. Corneil and Stephan Olariu and Lorna Stewart}, +title = {Asteroidal Triple-Free Graphs}, +number = {262/92}, +year = 1992, type = {Technical Report}, +institution = {Dept. of Computer Science, University of Toronto}} + +@unpublished{CorneilOS??, +author = {Derek G. Corneil and Stephan Olariu and Lorna Stewart}, +title = {The linear structure of graphs: asteroidal triple-free graphs}, +note = {Manuscript}} + +%Corneil 1995 + +@article{CorneilKNOS95, +author = {Derek G. Corneil and Hiryoung Kim and Sridhar Natarajan and +Stephan Olariu and Alan P. Sprague}, +title = {Simple Linear Time Recognition of Unit Interval Graphs}, +year = 1995, journal = ipl, volume = 55, pages = {99-104}} + +%Corneil 1997 + +@article{CorneilOS97, +author = {Derek G. Corneil and S. Olariu and L. Stewart}, +title = {Asteroidal triple-free graphs}, +journal = sjdm, volume = 10, year = 1997, pages = {399-430}} + +@unpublished{CorneilS??, +author = {Derek G. Corneil and L. K. Stewart}, +title = {Dominating Sets in Perfect Graphs}, +note = {preprint}} + +%Corneil 2000 + +@inproceedings{CorneilHLRR00, +author = {Derek G. Corneil and M. Habib and J. M. Lanlignel and Bruce Reed and Udi Rotics}, +title = {Polynomial time recognition of clique-width $\leq 3$ graphs (Extended Abstract)}, +editor = {Gaston H. Gonnet and Daniel Panario and Alfredo Viola}, +booktitle = latin00, publisher = lncs1776, year = 2000, pages = {126-134}} + +@article{CorneilOS00, +author = {Derek G. Corneil and Stephan Olariu and Lorna Stewart}, +title = {Linear time algorithms for dominating pairs in asteroidal +triple-free graphs}, +journal = siamjc, volume = 28, year = 2000, pages = {1284-1297}} + +%Corneil 2004 + +@article{Corneil04, +author = {Derek G. Corneil}, +title = {A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs}, +journal = dam, volume = 138, pages = {371-379}, year = 2004} + +%Corneil 2010 + +@article{CorneilKL10, +author = {Derek G. Corneil and Ekkehard K\"{o}hler and Jean-Marc Lanlignel}, +title = {On end-vertices of {L}exicographic {B}readth {F}irst {S}earches}, +journal = dam, volume = 158, year = 2010, pages = {434-443}} + +%Cornuejols + +@article{CornuejolsNP83, +author = {G. Cornu\'{e}jols and D. Naddef and W. R. Pulleyblank}, +title = {{H}alin graphs and the Traveling Salesman problem}, +journal = mp, volume = 26, year = 1983, pages = {287-294}} + + +%Cos + +@article{CosmadakisP84, +author = {Stavros S. Cosmadakis and Christos H. Papadimitriou}, +title = {The Travelling Salesman Problem with Many Visits to Few +Cities}, +journal = siamjc, volume = 13, pages = {99-108}, year = 1984 } + +%Cou + +%Courcelle 1983 + +@article{Courcelle83, +author = {Bruno Courcelle}, +title = {Fundamental properties of infinite trees}, +journal = tcs, volume = 25, year = 1983, pages = {375-393}} + +%Courcelle 1986 + +@article{Courcelle86, +author = {Bruno Courcelle}, +title = {Equivalence and transformation of regular systems. {A}pplications to +recursive program schemes and grammars}, +journal = tcs, volume = 42, pages = {1-22}, year=1986} + +%Courcelle 1987 + +@inproceedings{Courcelle87, +author = {Bruno Courcelle}, +title = {A representation of graphs by algebraic expressions and its use for graph rewriting systems}, +editor = {Hartmut Ehrig and Manfred Nagl and Grzegorz Rozenberg and Azriel Rosenfeld}, +booktitle = gragra86, publisher = lncs291, pages = {112-132}, year = 1987} + +@inproceedings{Courcelle87a, +author = {Bruno Courcelle}, +title = {On context-free sets of graphs and their monadic second-order theory}, +editor = {Hartmut Ehrig and Manfred Nagl and Grzegorz Rozenberg and Azriel Rosenfeld}, +booktitle = gragra86, publisher = lncs291, pages = {133-146}, year = 1987} + +@article{Courcelle87b, +author = {Bruno Courcelle}, +title = {An axiomatic definition of context-free rewriting and its +application to {NLC} graph grammars}, +journal = tcs, volume = 55, pages = {141-181}, year = 1987 } + +%Courcelle 1988 + +@inproceedings{Courcelle88a, +author = {Bruno Courcelle}, +title = {On using context-free graph grammars for analysing recursive definitions}, +booktitle = {Proceedings of the 2nd French-Japanese seminal on Artificial Intelligence}, +publisher = {North-Holland Pub. Co.}, +year = 1988} + +@article{Courcelle88c, +author = {Bruno Courcelle}, +title = {The Monadic Second-order Logic of Graphs {III}: {T}reewidth, Forbidden Minors and Complexity Issues}, +journal = {Informatique Th\'{e}orique}, volume = 26, pages = {257-286}, year = 1992} + +@article{Courcelle88d, +author = {Bruno Courcelle}, +title = {Some applications of logic of universal algebra, and of category theory to the theory of graph transformations}, +journal = beatcs, volume = 36, year = 1988, pages = {161-218}} + +@article{Courcelle88e, +author = {Bruno Courcelle}, +title = {Corrections and Additions to ``Some applications of +logic of universal algebra, and of category +theory to the theory of graph transformations''}, +journal = beatcs, volume = 37, year = {1988??}, pages = {194-195}} + +%Courcelle 1989 + +@article{Courcelle89, +author = {Bruno Courcelle}, +title = {The monadic second-order logic of graphs {II}: Infinite graphs of +bounded width}, +journal = mst, volume = 21, pages = {187-221}, year = 1989} + +%Courcelle 1990 + +@article{Courcelle90, +author = {Bruno Courcelle}, +title = {The monadic second-order logic of graphs {I}: {R}ecognizable sets of finite graphs}, +journal = ic2, volume = 85, year = 1990, pages = {12-75}} + +@inproceedings{Courcelle90a, +author = {Bruno Courcelle}, +title = {Graph rewriting: an algebraic and logical approach}, +booktitle = {Handbook of Theoretical Computer Science, volume {B}}, +editor = {Jan van Leeuwen}, +address = {Amsterdam}, year = 1990, +publisher = {North Holland Publ. Comp.}, +pages = {192-242} +} + +@article{Courcelle90b, +author = {Bruno Courcelle}, +title = {The monadic second-order logic of graphs {IV}: {D}efinable properties +of equational graphs}, +journal = apal, volume = 49, year = 1990, pages = {193-255}} + +%Courcelle 1991 + +@article{Courcelle91, +author = {Bruno Courcelle}, +title = {The monadic second-order logic of graphs {V}: {O}n closing +the gap between definability and recognizability}, +journal = tcs, volume = 80, year = 1991, pages = {153-202}} + +%Courcelle 1992 + +@article{Courcelle92, +author = {Bruno Courcelle}, +title = {The monadic second-order logic of graphs {VII}: Tree-decompositions, minor and complexity issues}, +journal = ita, volume = 101, year = 1992, pages = {257-286}} + +@techreport{CourcelleL92, +author = {Bruno Courcelle and Jens Lagergren}, +title = {Recognizable sets of graphs with bounded treewidth}, +number = {92-68}, +institution = {LaBRI, Bordeaux}, year = 1992} + +@article{CourcelleM93, +author = {Bruno Courcelle and M. Mosbah}, +title = {Monadic second-order evaluations on tree-decomposable graphs}, +journal = tcs, volume = {109}, year = 1993, pages = {49-82}} + +%Courcelle 1993 + +@inproceedings{Courcelle93, +author = {Bruno Courcelle}, +title = {Graph Grammars, Monadic Second-Order Logic and the Theory of Graph Minors}, +booktitle = {Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint +Summer Research Conference, Seattle WA, June 1991}, +publisher = {American Math. Soc.}, +address = {Providence, RI}, +editor = {Neil Robertson and Paul Seymour}, +note = {Contemp. Math. 147.}, +pages = {565 - 590}, +year = 1993} + +%Courcelle 1994 + +@article{Courcelle94, +author = {Bruno Courcelle}, +title = {The Monadic Second-Order Logic of Graphs {VI}: On several representations of graphs by relational structures}, +journal = dam, volume = 54, year = 1994, pages = {117-149}} + +%Courcelle 1995 + +@article{Courcelle95, +author = {Bruno Courcelle}, +title = {The Monadic Second-Order Logic of Graphs {VIII}: {O}rientations}, +journal = apal, volume = 72, year = 1995, pages = {103-143}} + +@article{Courcelle95a, +author = {Bruno Courcelle}, +title = {The Monadic Second-Order Logic of Graphs {VI}: {O}n several representations of graphs by relational structures, Erratum}, +journal = dam, volume = 63, year = 1995, pages = {199-200}} + +@misc{CourcelleS95, +author = {Bruno Courcelle and G. S{\'{e}}nizergues}, +title = {The obstructions of a minor-closed set of graphs defined by hyperedge replacement can be constructed}, +year = 1995} + +%Courcelle 1996 + +@article{CourcelleL96, +author = {Bruno Courcelle and Jens Lagergren}, +title = {Equivalent definitions of recognizability for sets of graphs of bounded tree-width}, +journal = {Mathematical Structures in Computer Science}, volume = 6, year = {1996}, pages = {141-166}} + +%Courcelle 1998 + +@inproceedings{CourcelleMR98, +author = {Bruno Courcelle and J. A. Makowsky and U. Rotics}, +title = {Linear time solvable optimization problems on graphs of bounded clique width}, +editor = {Juraj Hromkovic and Ondrej S\'{y}kora}, +booktitle = wg98, publisher = lncs1517, year = 1998, pages = {1-16}} + +%Courcelle 2000 + +@article{CourcelleO00, +author = {Bruno Courcelle and S. Olariu}, +title = {Upper bounds to the clique-width of graphs}, +journal = dam, volume = 101, year = 2000, pages = {77-114}} + +@article{CourcelleMR00, +author = {Bruno Courcelle and J. A. Makowsky and U. Rotics}, +title = {Linear time solvable optimization problems on graphs of bounded +clique width}, +journal = tcs, volume = 33, year = 2000, pages = {125-150}} + +%Courcelle 2001, + +@article{CourcelleMR01, +author = {Bruno Courcelle and J. A. Makowsky and U. Rotics}, +title = {On the fixed parameter complexity of graph enumeration problems definable in monadic second order logic}, +journal = dam, volume = 108, year = 2001, pages = {23-52}} + +%Courcelle 2003 + +@article{Courcelle03, +author = {Bruno Courcelle}, +title = {The monadic second-order logic of graphs {XIV}: Uniformly +sparse graphs and edge set quantifications}, +journal = tcs, volume = 299, pages = {1-36}, year = 2003} + +%Courcelle 2005 + +@article{CourcelleW05, +author = {Bruno Courcelle and Pascal Weil}, +title = {The recognizability of sets of graphs is a robust property}, +journal = tcs, volume = 342, pages = {173-228}, year = 2005} + +%Courcelle 2006 + +@article{Courcelle06, +author = {Bruno Courcelle}, +title = {The monadic second-order logic of graphs {XV}: On a conjecture by {D.} {S}eese}, +journal = {Journal of Applied Logic}, volume = 4, year = 2006, pages = {79-114}} + +%Courcelle 2007 + +@article{CourcelleO07, +author = {Bruno Courcelle and Sang-il Oum}, +title = {Vertex-minors, monadic second-order logic, and a conjecture by {S}eese}, +journal = jctb, volume = 97, year = 2007, pages = {91-126}} + +%Courcelle 2009 + +@article{CourcelleK09, +author = {Bruno Courcelle and Mamadou Moustapha Kant\'{e}}, +title = {Graph operations characterizing rank-width}, +journal = dam, volume = 157, year = 2009, pages = {627-640}} + +%Cournier + +@inproceedings{CournierH93, +author = {A. Cournier and M. Habib}, +title = {An efficient algorithm to recognize prime undirected graphs}, +editor = {Ernst W. Mayr}, +booktitle = wg92, year = 1993, publisher = lncs657, pages = {212-224}} + +@inproceedings{CournierH94, +author = {A. Cournier and M. Habib}, +title = {A new linear algorithm for modular decomposition}, +booktitle = {Trees in algebra and programming, CAAP'94}, +editor = {Tison Sophie}, +year = 1994, +pages = {68-84}, +publisher = lncs787} + +%Cu + +%Cur + +@article{CurtisIJLM10, +author = {Andrew R. Curtis and Clemente Izurieta and Benson Joeris and Scott Lundberg and Ross M. McConnell}, +title = {An implicit representation of chordal comparability graphs in linear time}, +journal = dam, volume = 158, year = 2010, pages = {869-875}} + +%Cy + +%Cyg + +@article{CyganKW09, +author = {Marek Cygan and {\L}ukasz Kowalik and Mateusz Wykurz}, +title = {Exponential-time approximation of weighted set cover}, +journal = ipl, volume = 109, year = 2009, pages = {957-961}} + +%Cz + +@article{CzumajHLN05, +author = {Artur Czumaj and Magn\'{u}s M. Halld\'{o}rsson and Andrzej Lingas and Johan Nilsson}, +title = {Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth}, +journal = ipl, volume = 94, year = 2005, pages = {49-53}} + +%D + +%Da + +%Dah + +%Dahlhaus 1986 + +@techreport{DahlhausK86, +author = {Elias Dahlhaus and Marek Karpinski}, +title = {The Matching Problem for Strongly Chordal Graphs is in {NC}}, +type = {Research Report}, +number = {855-CS}, +institution = {University of Bonn}, address = {Bonn}, +year = 1986 } + +%Dahlhaus 1988 + +@article{DahlhausK88, +author = {Elias Dahlhaus and Marek Karpinski}, +title = {Parallel Construction of Perfect Matchings and {H}amiltonian +Cycles on Dense Graphs}, +year = 1988, journal = tcs, volume = 61, pages = {112-136}} + +%Dahlhaus 1993 + +@inproceedings{Dahlhaus93, +author = {Elias Dahlhaus}, +title = {Optimal (parallel) algorithms for the all-to-all vertices distance problem for certain graph classes}, +editor = {Ernst W. Mayr}, +booktitle = wg92, year = 1993, publisher = lncs657, pages = {60-69}} + +%Dahlhaus 1995 + +@article{Dahlhaus95, +author = {Elias Dahlhaus}, +title = {Efficient parallel recognition algorithms of cographs and distance +hereditary graphs}, +journal = dam, volume = 57, year = 1995, pages = {29-44}} + +%Dahlhaus 1997 + +@inproceedings{Dahlhaus97, +author = {Elias Dahlhaus}, +title = {Minimal elimination ordering inside a given chordal graph}, +editor = {Rolf H. M\"{o}hring}, +booktitle = wg97, pages = {132-143}, year = 1997, publisher = lncs1335} + +%Dahlhaus 1998 + +@inproceedings{Dahlhaus98, +author = {Elias Dahlhaus}, +title = {Minimum fill-in and treewidth for graphs modularly decomposable into +chordal graphs}, +editor = {Juraj Hromkovic and Ondrej S\'{y}kora}, +booktitle = wg98, pages = {351-358}, year = 1998, publisher = lncs1517} + +%Dahlhaus 2001 + +@article{DahlhausGM01, +author = {E. Dahlhaus and J. Gustedt and R. M. Mc{C}onnell}, +title = {Efficient and practical modular decomposition}, +journal = ja, volume = 41, pages = {360-387}, year = 2001} + +%Dahlof + +@article{DahlofJB04, +author = {V. Dahl\"{o}f and P. Johnsson and R. Beigel}, +title = {Algorithms for four variants of the exact satisfiability problem}, +journal = tcs, volume = 320, year = 2004, pages = {373-394}} + +%Dag + +@article{DagnumL93, +author = {Paul Dagnum and Michael Luby}, +title = {Approximating probabilistic inference in {B}ayesian belief networks is +{NP}-hard}, +journal = artint, volume = 60, year = 1993, pages = {141-153}} + +%Dai + +@inproceedings{DaiS90, +author = {W. W. Dai and M. Sato}, +title = {Minimal forbidden minor characterization of planar partial +3-trees and application to circuit layout}, +booktitle = {Proceedings IEEE International Symposium on Circuits and Systems}, +year = 1990, pages = {2677-2681}} + +@article{DaiY09, +author = {Decheng Dai and Changyuan Yu}, +title = {A $5+\epsilon$-approximation algorithm for minimum weighted +dominating set in unit disk graphs}, +journal = tcs, volume = 410, year = 2009, pages = {756-765}} + +%Dal + +@unpublished{DaligaultT09, +author = {Jean Daligault and St\'{e}phan Thomass\'{e}}, +title = {On finding directed trees with many leaves}, +year = 2009, +note = {In proceedings IWPEC 2009}} + +@inproceedings{DalmauKV02, +author = {Victor Dalmau and Phokion G. Kolaitis and Moshe Y. Vardi}, +title = {Constraint satisfaction, bounded treewidth, and finite-variable +logics}, +booktitle = {Proceedings of the 8th International Conference on Principles and +Practice of Constraint Programming}, +pages = {310-326}, +publisher = lncs2470, year = 2002} + +%Dam + +%Damaschke 1989 + +@techreport{Damaschke89, +author = {Peter Damaschke}, +title = {Paths in Interval Graphs and Circular Arc Graphs}, +number = {N/89/4}, +institution = {Friedrich-Schiller-University Jena, GDR}, +year = 1989 } + +@article{Damaschke89a, +author = {Peter Damaschke}, +title = {The Hamiltonian circuit problem for circle graphs is +{NP}-complete}, +journal = ipl, volume = 32, year = 1989, pages = {1-2}} + +%Damaschke 1990 + +@unpublished{Damaschke90, +author = {Peter Damaschke}, +title = {Subgraph Isomorphism for Cographs is {NP}-Complete}, +year = 1990, +note = {Manuscript}} + +@unpublished{Damaschke90a, +author = {Peter Damaschke}, +title = {Hamilton-hereditary Graphs}, +year = 1990, note = {Manuscript}} + +@unpublished{DamaschkeK90, +author = {Peter Damaschke and Dieter Kratsch}, +title = {Finding {H}amiltonian Paths in Cocomparability Graphs Using the Bump Number Algorithm}, +year = 1990, note = {Manuscript}} + +@article{Damaschke90b, +author = {Peter Damaschke}, +title = {Induced subgraphs and well-quasi-ordering}, +journal = jgt, volume = 14, number = 4, year = 1990, pages = {427-435}} + +@article{DamaschkeMK90, +author = {Peter Damaschke and Haiko M\"{u}ller and Dieter Kratsch}, +title = {Domination in convex and chordal bipartite graphs}, +journal = ipl, volume = 36, year = 1990, pages = {231-236}} + +%Damaschke 1991 + +@unpublished{DamaschkeDKS91, +author = {Peter Damaschke and Jitender S. Deogun and Dieter Kratsch and George Steiner}, +title = {Finding {H}amiltonian Paths in Cocomparability Graphs Using The Bump Number Algorithm}, +note = {Manuscript. Submitted to Order}, +year = 1991} + +%Damaschke 2006 + +@article{Damaschke06, +author = {Peter Damaschke}, +title = {Parameterized enumeration, transversals, and imperfect phylogeny reconstruction}, +journal = tcs, volume = 351, year = 2006, pages = {337-350}} + +%Damaschke 2010 + +@article{Damaschke10, +author = {Peter Damaschke}, +title = {Fixed-parameter enumerability of cluster editing and related problems}, +journal = tocs, volume = 46, year = 2010, pages = {261-283}} + +%Dan + +@article{DankelmannGK09, +author = {Peter Dankelmann and Gregory Gutin and Eun Jung Kim}, +title = {On complexity of minimum leaf out-branching problem}, +journal = dam, volume = 157, year = 2009, pages = {3000-3004}} + +%Dar + +@article{Darwiche01, +author = {A. Darwiche}, +title = {Decomposable negation normal form}, +journal = jacm, volume = 48, pages = {608-647}, year = 2001} + +@article{Darwiche03, +author = {A. Darwiche}, +title = {A differential approach to inference in {B}ayesian networks}, +journal = jacm, volume = 50, year = 2003, pages = {280-305}} + +%Dav + +@article{DavisP60, +author = {Martin David and Hillary Putnam}, +title = {A computing procedure for quantification theory}, +journal = jacm, volume = 7, year = 1960, pages = {201-215}} + +%Daw + +@article{Dawid92, +author = {A. P. Dawid}, +title = {Applications of a general propagation algorithm for probabilistic expert systems}, +journal = {Statistics and Computing}, volume = 2, year = 1992, pages = {25-36}} + +%Day + +@article{DaykinN66, +author = {D. E. Daykin and C. P. Ng}, +title = {Algorithms for generalized stability numbers of tree graphs}, +journal = {Journal of the Australian Mathematical Society}, volume = 6, year = 1966, pages = {89-100}} + +%De + +@article{DeSimoneG08, +author = {Caterina {De Simone} and Anna Galluccio}, +title = {Edge-colouring of regular graphs of large degree}, +journal = tcs, volume = 389, year = 2008, pages = {91-99}} + +%Dec + +@article{DechterP89, +author = {R. Dechter and J. Pearl}, +title = {Tree clustering for constraint networks}, +journal = ai, volume = 38, year = 1989, pages = {353-366}} + +@article{Dechter99, +author = {R. Dechter}, +title = {Bucket elimination: a unifying framework for reasoning}, +journal = ai, volume = 113, year = 1999, pages = {41-85}} + +%DeF + +@article{deFraysseixPP90, +author = {H. de Fraysseix and J. Pach and R. Pollack}, +title = {How to draw a planar graph on a grid}, +journal = combinatorica, volume = 10, year = 1990, pages = {41-51}} + +%Deh + +@inproceedings{DehneFLRS05, +author = {Frank Dehne and Michael Fellows and Michael Langston and Frances Rosamond and Kim Stevens}, +title = {An {$O(2^{O(k)}n^3)$} {FPT} algorithm for the undirected feedback vertex set problem}, +editor = {Lusheng Wang}, +booktitle = cocoon05, pages = {859-869}, year = 2005, publisher = lncs3595} + +@inproceedings{DehneFFPR06, +author = {Frank Dehne and Michael Fellows and Henning Fernau and Elena Prieto and Frances Rosamond}, +title = {NONBLOCKER: Parameterized algorithms for minimum dominating set}, +editor = {Jir\'{\i} Wiedermann and Gerard Tel and Jaroslav Pokorn{\'y} and M{\'a}ria Bielikov{\'a} and Julius Stuller}, +booktitle = sofsem06, year = 2006, publisher = lncs3831, pages = {237-245}} + +@inproceedings{DehneLLPSZ06, +author = {Frank Dehne and Michael A. Langston and Xuemei Luo and Syvain Pitre +and Peter Shaw and Yun Zhang}, +title = {The {C}luster {E}diting problem: Implementations and experiments}, +booktitle = iwpec06, publisher = lncs4169, year = 2006, pages = {13-24}} + +%Dei + +@article{DeinekoKW06, +author = {Vladimir G. Deineko and Bettina Klintz and Gerhard J. Woeginger}, +title = {Exact algorithms for the {H}amiltonian cycle problem in planar graphs}, +journal = orl, volume = 34, year = 2006, pages = {269-274}} + +%Del + +@unpublished{DellM09, +author = {Holger Dell and Dieter van Melkebeek}, +title = {Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses}, +year = 2009, +note = {To appear in: Electronic Colloquium on Computational Complexity (ECCC), volume 16}} + + +%Dem + +%Demaine 2001 + +@inproceedings{DemaineO01, +author = {Erik D. Demaine and Joseph {O'Rourke}}, +title = {Open problems from {CCCG} 2000}, +booktitle = {Proceedings of the 13th Canadian Conference on Computational Geometry, CCCG 2001}, +address = {Waterloo, Ontario, Canada}, year = 2001, pages = {185-187}} + +%Demaine 2002 + +@inproceedings{DemaineHT02, +author = {E. D. Demaine and M. Hajiaghayi and Dimitrios M. Thilikos}, +title = {Exponential speedup of fixed parameter algorithms on {$K_{3,3}$}-minor-free or {$K_5$}-minor-free graphs}, +booktitle = soda02, pages = {262-273}, year = 2002} + +%Demaine 2003 + +%Demaine 2004 + +@article{DemaineFHT04, +author = {Erik D. Demaine and Fedor V. Fomin and M. Hajiaghayi and Dimitrios M. Thilikos}, +title = {Bidimensional parameters and local treewidth}, +journal = sjdm, volume = 18, year = 2004, pages = {501-511}} + +@article{DemaineH04, +author = {Erik D. Demaine and M. Hajiaghayi}, +title = {Diameter and treewidth in minor-closed graph families, revisited}, +journal = alg, volume = 40, year = 2004, pages = {211-215}} + +@article{DemaineHNRT04, +author = {Erik Demaine and Mohammadtaghi Hajiaghayi and Naomi Nishimura and Prabhakar Ragde and Dimitrios M. Thilikos}, +title = {Approximation algorithms for classes of graphs excluding single-crossing graphs as minors}, +journal = jcss, volume = 69, year = 2004, pages = {166-195}} + +%Demaine 2005 + +@article{DemaineFHT05, +author = {Erik D. Demaine and Fedor V. Fomin and MohammadTaghi Hajiaghayi and Dimitrios M. Thilikos}, +title = {Fixed-Parameter Algorithms for ($k$,$r$)-center in Planar Graphs and Map Graphs}, +journal = acmtalg, volume = 1, year = 2005, pages = {33-47}} + +@article{DemaineFHT05a, +author = {Erik D. Demaine and Fedor V. Fomin and Mohammadtaghi Hajiaghayi and Dimitrios M. Thilikos}, +title = {Subexponential Parameterized Algorithms on Graphs of Bounded Genus and {$H$}-minor-free Graphs}, +journal = jacm, volume = 52, year = 2005, pages = {866--893}} + +@inproceedings{DemaineH05, +author = {Erik D. Demaine and Mohammadtaghi Hajiaghayi}, +title = {Graphs excluding a fixed minor have grids as large as treewidth, with combinatorial and algorithmic applications through bidimensionality}, +booktitle = soda05, year = 2005, pages = {682-689}} + +@inproceedings{DemaineH05a, +author = {Erik D. Demaine and Mohammadtaghi Hajiaghayi}, +title = {Bidimensionality: {N}ew connections between {FPT} algorithms and {PTASs}}, +booktitle = soda05, year = 2005, pages = {590-601}} + +@article{DemaineHT05, +author = {Erik D. Demaine and Mohammadtaghi Hajiaghayi and Dimitrios M. Thilikos}, +title = {Exponential speedup of fixed-parameter algorithms for classes of graphs excluding single-crossing graphs as minors}, +journal = alg, volume = 41, year = 2005, pages = {245-267}} + +%Demaine 2006 + +@article{DemaineHT06, +author = {Erik D. Demaine and MohammadTaghi Hajiaghayi and Dimitrios M. Thilikos}, +title = {The bidimensional theory of bounded-genus graphs}, +journal = sjdm, volume = 20, year = 2006, pages = {357-371}} + +%Demaine 2008 + +@article{DemaineH08, +author = {Erik D. Demaine and MohammadTaghi Hajiaghayi}, +title = {The bidimensionality theory and its algorithmic applications}, +journal = tcj, volume = 51, year = 2008, pages = {292-302}} + +@article{DemaineH08a, +author = {Erik D. Demaine and MohammadTaghi Hajiaghayi}, +title = {Linearity of grid minors in treewidth with applications through bidimensionality}, +journal = comb, volume = 28, year = 2008, pages = {19-36}} + +%Demaine 2009 + +@article{DemaineHK09, +author = {Erik D. Demaine and MohammadTaghi Hajiaghayi and Ken-ichi Kawarabayashi}, +title = {Algorithmic graph minor theory: Improved grid minor bounds and {W}agner's contraction}, +journal = alg, volume = 54, year = 2009, pages = {142-180}} + +%Den + +@article{DendrisKT97, +author = {Nick D. Dendris and Lefteris M. Kirousis and Dimitrios M. Thilikos}, +title = {Fugitive-search games on graphs and related parameters}, +journal = tcs, volume = 172, year = 1997, pages = {233-254}} + +%Deo + +@book{Deo74, +author = {N. Deo}, +title = {Graph Theory with Applications to Engineering and Computer Science}, +publisher = {Prentice Hall}, address = {Englewood Cliffs, NJ}, +year = 1974} + +@article{DeoKL87, +author = {N. Deo and M. S. Krishnamoorty and Michael A. Langston}, +title = {Exact and approximate solutions for the gate matrix layout problem}, +journal = {IEEE Transactions on Computer Aided Design}, volume = 6, year = 1987, pages = {79-84}} + +@article{DeogunP90, +author = {Jitender S. Deogun and Y. Peng}, +title = {Edge ranking of trees}, +journal = cn, volume = 79, year = 1990, pages = {19-28}} + +@unpublished{DeogunKT93, +author = {Jitender S. Deogon and Dieter Kratsch and Zsolt Tuza}, +title = {Some new results on rankings of graphs}, +year = 1993, note = {Manuscript}} + +@techreport{DeogunKKM93, +author = {Jitender S. Deogun and Ton Kloks and Dieter Kratsch and Haiko M\"{u}ller}, +title = {On Vertex Ranking for Permutation and other Graphs}, +type = {Computing Science Notes}, number = {93-30}, +institution = {Eindhoven University of Technology}, +address = {Eindhoven, The Netherlands}, year = 1993} + +@article{DeogunKKM99, +author = {Jitender S. Deogun and Ton Kloks and Dieter Kratsch and Haiko M\"{u}ller}, +title = {On the vertex ranking problem for trapezoid, circular-arc and other graphs}, +journal = dam, volume = 98, year = 1999, pages = {39-63}} + +%Der + +@article{DereniowskiK056, +author = {Dariusz Dereniowski and M. Kubale}, +title = {Efficient parallel query processing by graph ranking}, +journal = {Fundamenta Informormaticae}, volume = 69, pages = {273-285}, year = {2005/06}} + +@article{Dereniowski06, +author = {Dariusz Dereniowski}, +title = {Edge ranking of weighted trees}, +journal = dam, volume = 154, year = 2006, pages = {1198-1209}} + +@article{DereniowskiN06, +author = {Dariusz Dereniowski and Adam Nadolski}, +title = {Vertex rankings of chordal graphs and weighted trees}, +journal = ipl, volume = 98, pages = {96-100}, year = 2006} + +%Des + +@article{DessmarkLP00, +author = {A. Dessmark and A. Lingas and A. Proskurowski}, +title = {Faster algorithms for subgraph isomorphism of $k$-connected partial +$k$-trees}, +journal = alg, volume = 27, pages = {337-347}, year = 2000} + +%Dev + +%DeV + +@article{DeVosDOSRSV04, +author = {Matt DeVos and Guoli Ding and Bogdan Oporowski and Daniel P. Sanders +and Bruce Reed and Paul Seymour and Dirk Vertigan}, +title = {Excluding any graph as a minor allows a low tree-width 2-coloring}, +journal = jctb, volume = 91, year = 2004, pages = {25-41}} + +%Di + +%Dia + +@inproceedings{DiazST93, +author = {J. D\'{\i}az and M. J. Serna and J. T\'{o}ran}, +title = {Parallel approximation schemes for problems on planar graphs}, +booktitle = esa93, +editor = {Thomas Lengauer}, +year = 1993, +pages = {145-156}, +publisher = lncs726, +} + +@article{DiazPS02, +author = {Josep D\'{\i}az and J. Petit and Maria Serna}, +title = {A survey of graph layout problems}, +journal = acmcs, volume = 34, pages = {313-356}, year = 2002} + +@article{DiazST02, +author = {Josep D\'{\i}az and Maria Serna and Dimitrios M. Thilikos}, +title = {Counting {$H$}-colorings of partial $k$-trees}, +journal = tcs, volume = 281, year = 2002, pages = {291-309}} + +%Die + +@book{Diestel90, +author = {Reinhard Diestel}, +title = {Graph Decompositions. A Study in Infinite Graph Theory}, +publisher = {Oxford Science Publications, Clarendon Press}, +address = {Oxford}, year = 1990} + +@article{DiestelJGT99, +author = {Reinhard Diestel and Tommy R. Jensen and Konstantin Yu. Gorbunov and +Carsten Thomassen}, +title = {Highly connected sets and the excluded grid theorem}, +year = 1999, pages = {61-73}, journal = jctb, volume = 75} + +@article{DiestelT99, +author = {Reinhard Diestel and R. Thomas}, +title = {Excluding a countable clique}, +journal = jctb, volume = 76, year = 1999, pages = {41-67}} + +@book{Diestel00, +author = {Reinhard Diestel}, +title = {Graph theory}, +publisher = {Springer-Verlag}, +note = {2nd edition}, +year = 2000} + +@article{DiestelK04, +author = {Reinhard Diestel and Daniela K\"{u}hn}, +title = {Graph minor hierarchies}, +journal = dam, volume = 145, pages = {167-182}, year = 2004} + +@phdthesis{Dietz84, +author = {P. F. Dietz}, +title = {Intersection Graph Algorithms}, +year = 1984, +school = {Computer Science Dept., Cornell University}, +address = {Ithaca, N.Y.}} + +@inproceedings{DietzfelbingerKMMRT88, +author = {M. Dietzfelbinger and A. Karlin and K. Mehlhorn and F. +{Meyer auf der Heide} and H. Rohnert and R. E. Tarjan}, +title = {Dynamic Perfect Hashing: Upper and Lower Bounds}, +year = 1988, pages = {524-531}, booktitle = focs88 } + +%Dij + +@misc{DijkHS06, +author = {Thomas C. {van Dijk} and Jan-Pieter {van den Heuvel} and Wouter Slob}, +title = {Treewidth.com}, +year = 2006} + +@mastersthesis{Dijk07, +author = {Thomas C. {van Dijk}}, +title = {Fixed parameter complexity of feedback problems}, +school = {Utrecht University}, +year = 2007} + +@article{Dijkstra59, +author = {E. Dijkstra}, +title = {A note on two problems in connection with graphs}, +journal = {Numerische Mathematik}, volume = 1, year = 1959, pages = {269-271}} + +%Din + +%Ding 1992 + +@article{DingSS92, +author = {Guoli Ding and A. Schrijver and Paul D. Seymour}, +title = {Disjoint paths in a planar graph --- {A} general theorem}, +journal = sjdm, volume = 5, year = 1992, pages = {112-116}} + +%Ding 1995 + +@article{DingO95, +author = {Guoli Ding and Bogdan Oporowski}, +title = {Some results on tree decomposition of graphs}, +journal = jgt, volume = 20, pages = {481-499}, year = 1995} + +%Ding 1998 + +@article{DingOSV98, +author = {Guoli Ding and Bogdan Oporowski and Daniel P. Sanders and D. +Vertigan}, +title = {Partitioning graphs of bounded tree-width}, +journal = combinatorica, volume = 18, year = 1998, pages = {1-12}} + +%Ding 2000 + +@article{DingOSV00, +author = {Guoli Ding and Bogdan Oporowski and Daniel P. Sanders and D. +Vertigan}, +title = {Surfaces, tree-width, clique-minors, and partitions}, +journal = jctb, volume = 79, year = 2000, pages = {221-246}} + +%Ding 2001 + +@article{DingJS01, +author = {Guoli Ding and Thor Johnson and Paul Seymour}, +title = {Spanning trees with many leaves}, +journal = jgt, volume = 37, year = 2001, pages = {189-197}} + +%Dinitz 1993 + +@inproceedings{Dinitz93, +author = {E. Dinitz}, +title = {The 3-edge-components and a structural description of all 3-edge cuts in a graph}, +editor = {Ernst W. Mayr}, +booktitle = wg92, year = 1993, publisher = lncs657, pages = {145-157}} + +%Dinitz 1994 + +@unpublished{Dinitz94, +author = {E. Dinitz}, +title = {The connectivity carcass of a vertex subset in a graph and its +incremental maintenance}, +year = 1994, +note = {Manuscript}} + +@unpublished{Dinneen92, +author = {Michael J. Dinneen}, +title = {A Linear Feedback Vertex Set Algorithm for Bounded Pathwidth Graphs}, +note = {Manuscript}, year = 1992} + +@phdthesis{Dinneen95, +author = {Michael John Dinneen}, +title = {Bounded Combinatorial Width and Forbidden Substructures}, +school = {University of Victoria}, +year = 1995 } + +@inproceedings{DinneenK00, +author = {Michael J. Dinneen and Bakhadyr Khoussainov}, +title = {Update networks and their routing strategies}, +booktitle = {Preproceedings WG'2000}, +pages = {65-74}, year = 2000} + +@article{DinneenCF01, +author = {M. J. Dinneen and K. Cattell and M. R. Fellows}, +title = {Forbidden minors to graphs with small feedback sets}, +journal = dm, volume = 130, pages = {215-252}, year = 2001} + +@article{DinskiZ99, +author = {Thomas Dinski and Xuding Zhu}, +title = {A bound for the game chromatic number of graphs}, +journal = dm, volume = 196, pages = {109-115}, year = 1999} + +%Dir + +@article{Dirac61, +author = {G.A. Dirac}, +title = {On rigid circuit graphs}, +journal = amsuh, volume = 25, year = 1961, pages = {71-76}} + +%Diw + +@article{Diwan00, +author = {A. Diwan}, +title = {Decomposing graphs with girth at least five under degree +constraints}, +journal = jgt, volume = 33, pages = {237-239}, year = 2000} + +%Dj + +%Dje + +@article{Djelloul09, +author = {Selma Djelloul}, +title = {Treewidth and logical definability of graph products}, +journal = tcs, volume = 410, pages = {696-710}, year = 2009} + +%Dji + +@article{Djidjev82, +author = {Hristo N. Djidjev}, +title = {On the problem of partititioning planar graphs}, +journal = sjadm, volume = 3, year = 1982, pages = {229-240}} + +@inproceedings{Djidjev88, +author = {Hristo N. Djidjev}, +title = {Linear algorithms for graph separation problems}, +editor = {Rolf G. Karlsson and Andzej Lingas}, +booktitle = swat88, publisher = lncs318, year = 1988, pages = {216-222}} + +@techreport{DjidjevG90, +author = {Hristo N. Djidjev and John R. Gilbert}, +title = {Separators in Graphs with Negative or Multiple Vertex +Weights}, +number = {CSL-90-8}, institution = {Xerox Corporation, Palo Alto}, +year = 1990 } + +@article{DjidjevV97, +author = {Hristo N. Djidjev and S. M. Venkatesan}, +title = {Reduced constants for simple cycle graph separation}, +journal = ai, volume = 34, pages = {231-243}, year = 1997} + +%Do + +%Doh + +@article{DohmenPT03, +author = {Klaus Dohmen and Andr\'{e} P\"{o}nitz and Peter Tittmann}, +title = {A new two-variable generalization of the chromatic polynomial}, +journal = dmtcs, year = 2004, pages = {69-90}, volume = 6} + +%Dol + +@article{DolamaS06, +author = {Mohammad Hosseini Dolama and \'{E}ric Sopena}, +title = {On the oriented chromatic number of {H}alin graphs}, +journal = ipl, volume = 98, year = 2006, pages = {247-252}} + +@techreport{DolevT82, +author = {D. Dolev and H. Trickey}, +title = {Embedding a Tree on a Line}, +institution = {IBM San Jose}, +year = 1982, +type = {IBM Techn. Report}, +number = {RJ3368} +} + +@article{DolevLT84, +author = {D. Dolev and T. Leighton and H. Trickey}, +title = {Planar embeddings of planar graphs}, +journal = {Adv. in Comput. Res.}, volume = 2, pages = {53-76}, year = 1984 } + +%Dom + +@inproceedings{DomLS09, +author = {Michael Dom and Daniel Lokshtanov and Saket Saurabh}, +title = {Incompressibility through colors and {IDs}}, +editor = {Susanne Albers and Alberto Marchetti-Spaccamela and Yossi Matias and Sotiris E. Nikoletseas and Wolfgang Thomas}, +booktitle = icalp09-1, year = 2009, pages = {378-389}, publisher = lncs5555} + +@inproceedings{DomLSV08, +author = {Michael Dom and Daniel Lokshtanov and Saket Saurabh and Yngve Villanger}, +title = {Capacitated domination and covering: A parameterized perspective}, +editor = {Martin Grohe and Rolf Niedermeier}, +booktitle = iwpec08, publisher = lncs5018, year = 2008, pages = {78-91}} + +@article{DomFHN08, +author = {Michael Dom and Jiong Guo and Falk H\"{u}ffner and Rolf +Niedermeier}, +title = {Closest 4-leaf power is fixed-parameter tractable}, +journal = dam, volume = 156, year = 2008, pages = {3345-3361}} + +%Don + +@article{Doner70, +author = {J. Doner}, +title = {Tree acceptors and some of their applications}, +journal = jcss, volume = 4, year = 1970, pages = {406-451}} + +%Dor + +%Dorn 2005 + +@inproceedings{DornPBF05, +author = {Frederic Dorn and Eelko Penninkx and Hans L. Bodlaender and Fedor V. Fomin}, +title = {Efficient exact algorithms on planar graphs: {E}xploiting sphere cut branch decompositions}, +booktitle = esa05, publisher = lncs3669, pages = {95-106}, year = 2005} + +%Dorn 2006 + +@inproceedings{Dorn06, +author = {Frederic Dorn}, +title = {Dynamic Programming and Fast Matrix Multiplication}, +booktitle = esa06, +publisher = lncs4168, pages = {280-291}, year = 2006} + +@inproceedings{DornT06, +author = {Frederic Dorn and Jan Arne Telle}, +title = {Two birds with one stone: the best of branchwidth and treewidth with one algorithm}, +editor = {Jos\'{e} R. Correa and Alejandro Hevia and Marcos A. Kiwi}, +booktitle = latin06, publisher = lncs3887, year = 2006, pages = {386-397}} + +%Dorn 2007 + +@inproceedings{Dorn07, +author = {Frederic Dorn}, +title = {How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms}, +editor = {Andreas Brandst\"{a}dt and Dieter Kratsch and Haiko M\"{u}ller}, +booktitle = wg07, publisher = lncs4769, year = 2007, pages = {280-291}} + +%Dorn 2008 + +@inproceedings{DornFT08, +author = {Frederic Dorn and Fedor V. Fomin and Dimitrios M. Thilikos}, +title = {Catalan structures and dynamic programming in $H$-minor-free graphs}, +booktitle = soda08, year = 2008, pages = {631-640}} + +%Dorn 2009 + +@article{DornT09, +author = {Frederic Dorn and Jan Arne Telle}, +title = {Semi-nice tree-decompositions: The best of branchwidth, treewidth and pathwidth with one algorithm}, +journal = dam, volume = 157, year = 2009, pages = {2737-2746}} + +%Dorn 2010 + +@article{Dorn10, +author = {Frederic Dorn}, +title = {Dynamic programming and planarity: Improved tree-decomposition based algorithms}, +journal = dam, volume = 158, year = 2010, pages = {800-808}} + +%Dou + +@article{DourisboureG07, +author = {Yon Dourisboure and Cyril Gavoille}, +title = {Tree-decompositions with bags of small diameter}, +journal = dm, volume = 307, year = 2007, pages = {2008-2029}} + +%Dow + +@inproceedings{DowK07, +author = {P. Alex Dow and Richard E. Korf}, +title = {Best-First search for treewidth}, +booktitle = aaai07, pages = {1146-1151}, publisher = {AAAI Press}, year = 2007} + +%Downey 1991 + +@article{DowneyF91b, +author = {Rodney G. Downey and Michael R. Fellows}, +title = {Fixed-Parameter Tractability and Completeness {II}: {O}n completeness for {$W[1]$}}, +journal = tcs, volume = 141, pages = {109-131}, year = 1995} + +%Downey 1992 + +@incollection{DowneyF92, +author = {Rodney G. Downey and Michael R. Fellows}, +title = {Fixed-Parameter Tractability and Completeness {III}: Some Structural +Aspects of the {$W$} Hierarchy}, +booktitle = {Complexity Theory}, year = 1993, editor = {K. Ambos-Spies and +S. Homer and U. Sch\"{o}ning}, publisher = {Cambridge University Press}, +pages = {191-226}} + +@article{DowneyF92a, +author = {Rodney G. Downey and Michael R. Fellows}, +title = {Fixed-Parameter Tractability and Completeness}, +year = 1992, journal = cn, volume = 87, pages = {161-178}} + +@inproceedings{DowneyF92b, +author = {Rodney G. Downey and Michael R. Fellows}, +title = {Fixed parameter intractability}, +booktitle = {Proceedings of the 7th Annual IEEE Conference on Structure in Complexity Theory}, +pages = {36-49}, year = 1992} + +%Downey 1993 + +@inproceedings{DowneyEF93, +author = {Rodney G. Downey and P. A. Evans and Michael R. Fellows}, +title = {Parameterized learning complexity}, +booktitle = {Proceedings 6th ACM Workshop on Computational Learning Theory, COLT'93}, +pages = {51-57}, year = 1993} + +@techreport{DowneyFKHW93, +author = {Rodney G. Downey and Michael R. Fellows and B. M. Kapron and +Michael T. Hallett and H. Todd Wareham}, +title = {The parameterized complexity of some problems in logic and linguistics}, +institution = {Department of Computer Science, University of Victoria}, +address = {Victoria, B.C., Canada}, +year = 1993, +type = {Technical Report}} + +@unpublished{DowneyF-1, +author = {Rodney G. Downey and Michael R. Fellows}, +title = {Parameterized computational feasibility}, +note = {To appear in Proc. Second Cornell Workshop on Feasible Mathematics (Birkhauser, Boston)}} + +%Downey 1995 + +@article{DowneyF95, +author = {Rodney G. Downey and Michael R. Fellows}, +title = {Fixed-Parameter Tractability and Completeness {I}: Basic Results}, +journal= siamjc, volume = 24, pages = {873-921}, year = 1995} + +@article{DowneyF95a, +author = {Rodney G. Downey and Michael R. Fellows}, +title = {Fixed-Parameter Tractability and Completeness {II}: On completeness for {$W[1]$}}, +journal = tcs, volume = 141, year = 1995, pages = {109-131}} + +%Downey 1997 + +@incollection{DowneyFS97, +author = {Rodney G. Downey and Michael R. Fellows and Ulrike Stege}, +title = {Parameterized Complexity: A Framework for Systematically Confronting Computational Intractability}, +booktitle = {DIMACS Series in Discrete Mathematics and Theoretical Computer Science}, +publisher = {American Mathematical Society}, +year = {1997}, +pages = {49--99}} + + +%Downey 1998 + +@book{DowneyF98, +author = {Rodney G. Downey and Michael R. Fellows}, +title = {Parameterized Complexity}, +publisher = {Springer}, +year = 1999} +%Remark: change year in 1999 + +@article{DowneyF98a, +author = {Rodney G. Downey and Michael R. Fellows}, +title = {Threshold dominating sets and an improved characterization of {$W[2]$}}, +journal = tcs, volume = 209, pages = {123-140}, year = 1998} + +%Downey 1999 + +@article{DowneyFS99, +author = {Rodney G. Downey and Michael R. Fellows and Ulrike Stege}, +title = {Computational Tractability: The View From Mars}, +journal = beatcs, volume = 69, year = 1999, pages = {73-97}} + +@book{DowneyF99, +author = {Rodney G. Downey and Michael R. Fellows}, +title = {Parameterized Complexity}, +publisher = {Springer}, +year = 1999} + +@article{DowneyFVW99, +author = {Rodney G. Downey and Michael R. Fellows and A. Vardi and G. Whitte}, +title = {The parameterized complexity of some fundamental problems in coding theory}, +journal = siamjc, volume = 29, year = 1999, pages = {545-570}} + +%Downey 2007 + +@article{DowneyM07, +author = {Rodney G. Downey and Catherine McCartin}, +title = {Online promise problems with online width metrics}, +journal = jcss, volume = 73, year = 2007, pages = {56-72}} + +%Downey 2008 + +@article{DowneyFMR08, +author = {Rodney G. Downey and Michael R. Fellows and Catherine McCartin and Frances A. Rosamond}, +title = {Paramterized approximation of dominating set problems}, +journal = ipl, volume = 109, year = 2008, pages = {68-70}} + +%Dr + +%Dra + +@techreport{DraganB93, +author = {Feodor F. Dragan and Andreas Brandst\"{a}dt}, +title = {$r$-{D}ominating cliques in {H}elly graphs and chordal graphs}, +institution = {Universit\"{a}t Duisburg GH}, +number = {SM-DU-228}, year = 1993} + +@article{DraganT10, +author = {Feodor F. Dragan and Chenyu Yan}, +title = {Collective tree spanners in graphs with bounded parameters}, +journal = alg, volume = 57, year = 2010, pages = {22-43}} + +%Dre + +@inproceedings{Dress??, +author = {A. W. M. Dress}, +title = {On the computational complexity of composite systems}, +editor = {L. Garrido}, +booktitle = {Fluctuations and stochastic phenomena +in condensed matter, Springer Lecture Notes in Physics 268}, +year = {???}} + +@inproceedings{DrewesK90, +author = {F. Drewes and {H.-J.} Kreowski}, +title = {A note on hyperedge replacement}, +editor = {Hartmut Ehrig and Manfred Nagl and Grzegorz Rozenberg}, +booktitle = gragra90, publisher = lncs532, pages = {1-12}, year = 1990} + +%Du + +%Duc + +@article{DuchonHLS06, +author = {Philippe Duchon and Nicolas Hanusse and Emmanuelle Lebhar and Nicolas Schabanel}, +title = {Can any graph be turned into a small-world}, +journal = tcs, volume = 355, pages = {96-103}, year = 2006} + +%Duf + +@article{DuffR83, +author = {Iain S. Duff and J. K. Reid}, +title = {The multifrontal solution of indefinite sparse symmetric linear equations}, +journal = {ACM Transactions on Mathematical Software}, +volume = 9, year = 1983, pages = {302-325}} + +@article{Duffin65, +author = {R. J. Duffin}, +title = {Topology of series-parallel graphs}, +journal = jmaa, volume = 10, year = 1965, pages = {303-318}} + +%Duj + +@article{DujmovicMW05, +author = {V. Dujmovi\'{c} and P. Morin and D. R. Wood}, +title = {Layout of graphs with bounded tree-width}, +journal = siamjc, volume = 34, year = 2005, pages = {554-579}} + +@article{DujmovicW05, +author = {V. Dujmovi\'{c} and D. R. Wood}, +title = {Stacks, queues and tracks: Layouts of graph subdivisions}, +journal = dmtcs, volume = 7, year = 2005, pages = {155-202}} + +@inproceedings{DujmovicW06, +author = {Vida Dujmovi\'{c} and David R. Wood}, +title = {Graph treewidth and geometric thickness parameters}, +editor = {Patrick Healy and Nikola S. Nikolov}, +booktitle = gd05, publisher = lncs3843, year = 2006, pages = {129 - 140}} + +%Dum + +@article{DumitrescuSZ08, +author = {Adrian Dumitrescu and Ichiro Suzuki and Pawel Zylinski}, +title = {Offline variants of the ''lion and man'' problem --- {S}ome problems +and techniques for measuring crowdedness and for safe path planning ---}, +journal = tcs, volume = 399, year = 2008, pages = {220-235}} + +%Dun + +@article{DunnK04, +author = {Charles Dunn and H. A. Kierstead}, +title = {A simple competitive graph coloring algorithm {II}}, +journal = jctb, volume = 90, year = 2004, pages = {93-106}} + +@article{DunnK04a, +author = {Charles Dunn and H. A. Kierstead}, +title = {A simple competitive graph coloring algorithm {III}}, +journal = jctb, volume = 90, year = 2004, pages = {137-150}} + +@article{DunnK04b, +author = {Charles Dunn and H. A. Kierstead}, +title = {The relaxed game chromatic number of outerplanar graphs}, +journal = jgt, volume = 46, year = 2004, pages = {69-78}} + +@article{Dunn07, +author = {Charles Dunn}, +title = {The relaxed game chromatic index of $k$-degenerate graphs}, +journal = dm, volume = 307, year = 2007, pages = {1767-1775}} + +%Dy + +@article{DyerF86, +author = {M. E. Dyer and A. M. Frieze}, +title = {Planar {3DM} is {NP}-complete}, +journal = ja, volume = 7, year = 1986, pages = {174-184}} + +%E + +%Ea + +%Ead + +@article{EadesLS93, +author = {P. Eades and X. Lin and W. F. Smyth}, +title = {A fast and effective heuristic for the feedback arc set problem}, +journal = ipl, volume = 47, year = 1993, pages = {319-323}} + +%Eas + +@article{EaswarakumarPC94, +author = {K. S. Easwarakumar and C. {Pandu Rangan} and G. A. Cheston}, +title = {A linear algorithm for centering a spanning tree of a biconnected graph}, +journal = ipl, volume = 51, year = 1994, pages = {121-124}} + +%Eb + +@book{Ebert81, +author = {J. Ebert}, +title = {Efficiente Graphenalgorithmen}, +publisher = {Akademische Verlagsgesellschaft}, +address = {Wiesbaden}, +year = 1981 } + +%Ed + +@article{Edenbrandt87, +author = {A. Edenbrandt}, +title = {Chordal graph recognition is in {NC}}, +journal = ipl, volume = 24, year = 1987, pages = {239-241}} + +@article{Edmonds65, +author = {J. Edmonds}, +title = {Paths, trees, and flowers}, +journal = canjm, volume = 17, pages = {445-467}, year = 1965} + +@article{Edwards86, +author = {K. Edwards}, +title = {The complexity of Coloring Problems on Dense Graphs}, +journal = tcs, volume = 16, year = 1986, pages = {337-343}} + +%Eh + +@techreport{EhrenfeuchtER93, +author = {Andrzej Ehrenfeucht and Joost Engelfriet and Grzegorz Rozenberg}, +title = {Finite Languages for the Representation of Graphs}, +year=1993, number = {93-03}, +institution = {Department of Computer Science, Leiden University}, address = {Leiden, The Netherlands}} + +%Ei + +%Eij + +@article{EijkhofBK07, +author = {Eijkhof, Frank {v}an {d}en and Hans L. Bodlaender and Arie M. C. A. Koster}, +title = {Safe reduction rules for weighted treewidth}, +journal = alg, volume = 47, year = 2007, pages = {138-158}} + +%Eil + +@article{EilamMZ02, +author = {T. Eilam and S. Moran and S. Zaks}, +title = {The complexity of the characterization of networks supporting shortest-path interval routing}, +journal = tcs, volume = 289, year = 2002, pages = {85-104}} + +%El + +%Ellis 1987 + +@techreport{EllisST87a, +author = {John A. Ellis and Ivan Hal Sudborough and J. Turner}, +title = {Graph Separation and Search Number}, +type = {Report}, +number = {DCS-66-IR}, institution = {University of Victoria}, +year = 1987 +} + +%Ellis 1989 + +@article{EllisMM89, +author = {John A. Ellis and Manrique Mata and Gary Mac{G}illivray}, +title = {A linear time algorithm for longest $(s,t)$-paths in weighted outerplanar graphs}, +journal = ipl, volume = 32, year = 1989, pages = {199-204}} + +%Ellis 1994 + +@article{EllisST94, +author = {John A. Ellis and Ivan Hal Sudborough and J. Turner}, +title = {The vertex separation and search number of a graph}, +journal =ic2, volume = 113, year = 1994, pages = {50-79}} + +%Ellis 2002 + +@inproceedings{EllisFF02, +author = {J. Ellis and H. Fan and M. R. Fellows}, +title = {The dominating set problem is fixed parameter tractable for graphs of bounded genus}, +booktitle = swat02, publisher = lncs2368, pages = {180-189}, year = 2002} + +%Ellis 2004 + +@article{EllisM04, +author = {John Ellis and Minko Markov}, +title = {Computing the vertex separation of unicyclic graphs}, +journal = ic2, volume = 192, year = 2004, pages = {123-161}} + +@article{EllisFF04, +author = {J. Ellis and H. Fan and M. R. Fellows}, +title = {The dominating set problem is fixed parameter tractable for graphs of bounded genus}, +journal = ja, year = 2004, volume = 52, pages = {152-168}} + +%Ellis 2008 + +@article{EllisW08, +author = {John Ellis and Robert Warren}, +title = {Lower bounds on the pathwidth of some grid-like graphs}, +journal = dam, volume = 156, year = 2008, pages = {545-555}} + +%ElM +%Elm + +@phdthesis{ElMallah87, +author = {E. S. El-{M}allah}, +title = {Decomposition and Embedding Problems for Restricted Networks}, +school = {University of Waterloo}, +year = 1987} + +@article{ElMallahC88, +author = {E. S. El-{M}allah and Charles J. Colbourn}, +title = {Partial $k$-tree algorithms}, +journal = cn, volume = 64, year = 1988, pages = {105-119}} + +%Em + +@inproceedings{EmdeBoas75, +author = {Peter {van Emde Boas}}, +title = {Preserving order in a forest in less than logarithmic time}, +booktitle = focs75, year = 1975, pages = {75-84}} + +@inproceedings{EmdeBoas82, +author = {Peter {van Emde Boas}}, +title = {Dominoes are forever}, +editor = {L. Priese}, +booktitle = {Proceedings of the 1st GTI Workshop, Paderborn Oct. 1982, Rheie Theoretische Informatik UGH}, +year = 1982, pages = {75-95}} + +@inproceedings{EmdeBoas97, +author = {Peter {van Emde Boas}}, +title = {The convenience of tilings}, +booktitle = {Complexity, Logic and Recursion Theory}, +editor = {A. Sorbi}, +publisher = {Lecture Notes in Pure and Applied Mathematics, vol. 187, Marcel +Dekker Inc.}, +year = 1997, +pages = {331-363}} + +%En + +@article{EngelG03, +author = {Konrad Engel and Sven Guttmann}, +title = {Testing bandwidth for $k$-connected graphs}, +journal = sjdm, volume = 16, year = 2003, pages = {301-312}} + +%Engelfriet 1987 + +@unpublished{EngelfrietLW87, +author = {Joost Engelfriet and George Leih and Emo Welzl}, +title = {Characterization and Complexity of Boundary Graph Languages}, +year = 1987, +note = {Manuscript}, +remark = {Among many other results, it is shown that for given $k$ and +$d$, the set of all (connected) graphs of tree-width $\leq k$ and degree +$leq d$ is in LOG(CF)} +} + +%Engelfriet 1991 + +@article{EngelfrietH91, +author = {Joost Engelfriet and Linda Heyker}, +title = {The String Generating Power of Context-Free Hypergraph Grammars}, +journal = jcss, volume = 43, number = 2, year = 1991, pages = {328-360}} + +@article{EngelfrietHL91, +author = {Joost Engelfriet and Linda M. Heyker and G. Leih}, +title = {Context-free graph languages of bounded degree are generated by {A}pex graph grammars}, +journal = ai, volume = 31, year = 1994, pages = {341-378}} + +%Engelfriet 1992 + +@inproceedings{Engelfriet92, +author = {Joost Engelfriet}, +title = {A {G}reibach normal form for context-free graph grammars}, +editor = {W. Kuich}, +booktitle = icalp92, publisher = lncs623, pages = {138-149}, year = 1992} + +@article{EngelfrietH92, +author = {Joost Engelfriet and Linda Heyker}, +title = {Context-free hypergraph grammars have the same term-generating power as attribute grammars}, +journal = ai, volume = 29, pages = {161-210}, year = 1992} + +%Engelfriet 1993 + +@techreport{EngelfrietHPG93, +author = {Joost Engelfriet and T. Harju and Andrzej Proskurowski and G. +Rozenberg}, +title = {Survey on Graphs as 2-structures and Parallel Complexity of +Decomposition}, +type = {Technical Report}, +institution ={Department of Computer Science, Leiden University}, +year = 1993, number = {93-06}} + +@techreport{EngelfrietV93, +author = {Joost Engelfriet and Jan Joris Vereijken}, +title = {Context-Free Graph Grammars and Concatenation of Graphs}, +type = {Technical Report}, +institution ={Department of Computer Science, Leiden University}, +year = 1993, number = {93-06}} + +%Engelfriet 1996 + +@techreport{Engelfriet96, +author = {Joost Engelfriet}, +title = {Context-Free Graph Grammars}, +type = {Technical Report}, +institution ={Department of Computer Science, Leiden University}, +year = 1996, number = {96-32}} + +%Enr + +@article{EnrightS07, +author = {Jessica Enright and Lorna Stewart}, +title = {Subtree filament graphs are subtree overlap graphs}, +journal = ipl, volume = 104, year = 2007, pages = {228-232}} + +%Ep + +%Epp + +%Eppstein 1992 + +@article{Eppstein92, +author = {David Eppstein}, +title = {Parallel recognition of series parallel graphs}, +journal = ic2, volume = 98, pages = {41-55}, year = 1992} + +%Eppstein 1999 + +@article{Eppstein99, +author = {David Eppstein}, +title = {Subgraph isomorphism in planar graphs and related problems}, +journal = jgaa, volume = 3, pages = {1-27}, year = 1999} + +%Eppstein 2000 + +@article{Eppstein00, +author = {David Eppstein}, +title = {Diameter and treewidth in minor-closed graph families}, +journal = alg, volume = 27, year = 2000, pages = {275-291}} + +%Eppstein 2001 + +@inproceedings{Eppstein01, +author = {David Eppstein}, +title = {Small maximal independent sets and faster exact graph coloring}, +editor = {Frank K. H. A. Dehne and J\"{o}rg-R\"{u}diger Sack and Roberto Tamassia}, +booktitle = wads01, publisher = lncs2125, year = 2001, pages = {462-470}} + +%Eppstein 2003 + +@article{Eppstein03, +author = {David Eppstein}, +title = {Small maximal independent sets and faster exact graph +coloring}, +xJOURNAL = {J. Graph Algorithms Appl.}, +journal = jgaa, volume = 7, year = 2003, pages = {131-140}} + +%Eppstein 2003 + +@inproceedings{Eppstein04, +author = {David Eppstein}, +title = {Quasiconvex analysis of backtracking algorithms}, +booktitle = soda04, year = 2004, pages = {781-790}} + +%Er + +%Erd + +@article{ErdosS35, +author = {Paul Erd\"{o}s and G. Szekeres}, +title = {A combinatorial problem in geometry}, +journal = {Compos. Math.}, volume = 2, year = 1935, pages = {464-470}} + +@article{ErdosK63, +author = {Paul Erd\"{o}s and Paul Kelly}, +title = {The minimal regular graph containing a given graph}, +journal = amm, volume = 70, pages = {1074-1075}, year = 1963} + +@article{ErdosP65, +author = {Paul Erd\"{o}s and L. P\'{o}sa}, +title = {On the independent circuits contained in a graph}, +journal = canjm, volume = 17, pages = {347-352}, year = 1965} + +@article{ErdosGK91, +author = {Paul Erd\"{o}s and John Gimbel and Dieter Kratsch}, +title = {Some extremal results in cochromatic and dichromatic theory}, +year = 1991, journal = jgt, volume = 15, number = 6, pages = {579-585}} + +%Erl + +@inproceedings{ErlebachL08, +author = {Thomas Erlebach and Erik Jan van Leeuwen}, +title = {Domination in geometric intersection graphs}, +editor = {Eduardo Sany Laber and Claudson F. Bornstein and Loana Tito Nogueira and Luerbio Faria}, +booktitle = latin08, year = 2008, publisher = lncs4957, pages = {747-758}} + +%Es + +%Esp + +@inproceedings{EspelageGW01, +author = {Wolfgang Espelage and Frank Gurski and Egon Wanke}, +title = {Deciding clique-width for graphs of bounded treewidth}, +editor = {Frank K. H. A. Dehne and J\"{o}rg-R\"{u}diger Sack and Roberto Tamassia}, +year = 2001, pages = {87-98}, booktitle = wads01, publisher = lncs2125} + +@article{EspelageGW03, +author = {Wolfgang Espelage and Frank Gurski and Egon Wanke}, +title = {Deciding clique-width for graphs of bounded treewidth}, +journal = jgaa, volume = 7, year = 2003, pages = {141-180}} + +%Est + +@inproceedings{Estivill-CastroFLR05, +author = {Vladimir Estivill-Castro and Michael R. Fellows and Michael A. Langston and Frances A. Rosamond}, +title = {FPT is {P}-time extremal structure {I}}, +editor = {Hajo Broersma and Matthew Johnson and Stefan Szeider}, +booktitle = acid05, publisher = {King's College, London}, +series = {Text in Algorithms}, volume = 4, year = 2005, pages = {1-41}} + +%Esw + +@article{EswaranT76, +author = {Kapali P. Eswaran and R. Endre Tarjan}, +title = {Augmentation Problems}, +journal = siamjc, volume = 5, year = 1976, pages = {653-665}} + +%Ev + +@article{Evans91, +author = {G. A. Evans}, +title = {Combinatoric strategies for genome mapping}, +journal = {Bioassays}, volume = 13, year = 1991, pages = {39-44}} + +@inproceedings{EvenK75, +author = {Simon Even and O. Kariv}, +title = {An {O}($n^{2.5}$) Algorithm for Maximum Matching in General +Graphs}, +booktitle = focs75, year = 1975, pages = {100-112}} + +@article{EvenT75, +author = {Simon Even and Robert Endre Tarjan}, +title = {Network flow and testing graph connectivity}, +journal = siamjc, volume = 4, year = 1975, pages = {507-518}} + +@article{EvenT76, +author = {S. Even and R. E. Tarjan}, +title = {A combinatorial problem which is complete in polynomial +space}, +journal = jacm, volume = 23, year = 1976, pages = {710-719}} + +@article{EvenT76a, +author = {S. Even and R. E. Tarjan}, +title = {Computing an $st$-numbering}, +journal = tcs, volume = 2, year = 1976, pages = {339-344}} + +@book{Even79, +title = {Graph Algorithms}, +author = {Simon Even}, +year = 1979, +publisher = {Pitman}, +address = {London} +} + +@article{EvenNRS99, +author = {G. Even and J. Naor and S. Rao and B. Schieber}, +title = {Fast approximate graph partitioning algorithms}, +journal = siamjc, volume = 28, year = 1999, pages = {2187-2214}} + +%F + +%Fa + +%Fai + +@techreport{FaigleK90, +author = {U. Faigle and W. Kern}, +title = {The Game Chromatic Number of Trees is 4}, +type = {Memorandum}, number = {871}, year = 1990, +institution = {Department of Applied Mathematics, University of +Twente}, address = {Enschede, The Netherlands}} + +@article{FaigleKKT93, +author = {U. Faigle and W. Kern and H. Kierstead and W. T. Trotter}, +title = {On the Game Chromatic Number of Some Classes of Graphs}, +journal = arscomb, volume = 35, pages = {143-150}, year = 1993} + +%Far + +@article{Farber82, +author = {M. Farber}, +title = {Independent domination in chordal graphs}, +journal = orl, volume = 1, year = 1982, pages = {134-138}} + +@article{Farber83, +author = {M. Farber}, +title = {Characterizations of strongly chordal graphs}, +journal = dm, volume = 43, pages = {173-189}, year = 1983 } + +@article{Farber84, +author = {M. Farber}, +title = {Domination, independent domination, and duality in strongly +chordal graphs}, +journal = dam, volume = 7, year = 1984, pages = {115-130}} + +@article{FarberK85, +author = {M. Farber and J. Mark Keil}, +title = {Domination in permutation graphs}, +journal = ja, volume = 6, year = 1985, pages = {309-321}} + +@article{FarberHHM86, +author = {Martin Farber and Ge\~na Hahn and Pavol Hell and Donald Miller}, +title = {Concerning the achromatic number of graphs}, +journal = jctb, volume = 40, year = 1986, pages = {21-39}} + +@article{FarleyP80, +author = {A. M. Farley and A. Proskurowski}, +title = {Computation of the Center and Diameter of Outerplanar Graphs}, +journal = dam, volume = 2, year = 1980, pages = {185-191}} + +@article{Farley81, +author = {A. M. Farley}, +title = {Networks immune to isolated failures}, +journal = netw, volume = 11, pages = {255-268}, year = 1981} + +@article{FarleyHP81, +author = {A. M. Farley and S. Hedetniemi and A. Proskurowski}, +title = {Partitioning Trees: Matching, Domination, and Maximum diameter}, +journal = ijcis, volume = 10, pages = {55-61}, number = 1, year = 1985} + +@article{FarleyP82, +author = {A. M. Farley and A. Proskurowski}, +title = {Networks immune to isolated line failures}, +journal = netw, volume = 12, pages = {393-403}, year = 1982} + +%Fat + +@article{FathFS02, +author = {K. Fath and P. Flocchini and S. Pierre}, +title = {Compact routing in chordal grids and other networks}, +journal = {INFOR: Information Systems and Operational Research}, +volume = 40, year = 2002, pages = {119-130}} + +%Fe + +%Fed + +@article{FederHKNP05, +author = {Tom\'{a}s Feder and Pavol Hell and Sulamita Klein and Loana Tito Nogueira and F\'{a}bio Protti}, +title = {List partitions of chordal graphs}, +journal = tcs, volume = 349, pages = {52-66}, year = 2005} + +%Fei + +%Feige 2000 + +@inproceedings{Feige00, +author = {U. Feige}, +title = {Coping with the {NP}-hardness of the graph bandwidth problem}, +editor = {Magn\'{u}s M. Halld\'{o}rsson}, +booktitle = swat00, publisher = lncs1851, year = 2000, pages = {10-19}} + +%Feige 2005 + +@inproceedings{FeigeHL05, +author = {U. Feige and M. Hajiaghayi and J. R. Lee}, +title = {Improved approximation algorithms for minimum-weight vertex separators}, +booktitle = stoc05, pages = {563-572}, publisher = {ACM Press}, +year = 2005} + +%Feige 2006 + +@inproceedings{FeigeM06, +author = {Uriel Feige and Mohammad Mahdian}, +title = {Finding small balanced separators}, +year = 2006, pages = {375-384}, booktitle = stoc06, +publisher = {ACM Press}, addres = {New York}} + +%Feige 2009 + +@article{FeigeT09, +author = {Uriel Feige and Kunal Talwar}, +title = {Approximating the bandwidth of caterpillars}, +journal = alg, volume = 55, year = 2009, pages = {190-204}} + +%Fel + +%Fellows + +@misc{FellowsPC, +author = {Michael R. Fellows}, +note = {Personal communication}} + +%Fellows 1987 + +@unpublished{FellowsHS87, +author = {Michael R. Fellows and F. Hickling and Maciej M. Sys{\l}o}, +title = {A Topological Parameterization and Hard Graph Problems}, +year = 1987, +note = {Presented at Boca Raton, Florida. Final paper in preparation.}} + +@article{FellowsL87, +author = {Michael R. Fellows and Michael A. Langston}, +title = {Nonconstructive advances in polynomial-time complexity}, +year = 1987, journal = ipl, volume = 26, pages = {157-162}} + +@article{FellowsL87a, +author = {Michael R. Fellows and Michael A. Langston}, +title = {Nonconstructive tools for proving polynomial-Time +decidability}, +year = 1988, +journal = jacm, volume = 35, pages = {727-739}} + +@inproceedings{FellowsL87b, +author = {Michael R. Fellows and Michael A. Langston}, +title = {Layout Permutation Problems and Well-Partially-Ordered Sets}, +year = 1988, +booktitle = {5th MIT Conf. on Advanced Research in VLSI}, +address = {Cambridge, MA}, +publisher = lncs319, +editor = {J. Reif}, +pages = {315-327} +} + +%Fellows 1988 + +@article{FellowsFL88, +author = {Michael R. Fellows and Donald K. Friesen and Michael A. +Langston}, +title = {On finding optimal and near-optimal lineal spanning trees}, +journal = alg, volume = 3, year = 1988, pages = {549-560}} + +@inproceedings{FellowsL88, +author = {Michael R. Fellows and Michael A. Langston}, +title = {On search, decision and the efficiency of polynomial-time algorithms}, +booktitle = stoc89, pages = {501-512}, year = 1989 } + +@inproceedings{FellowsL88a, +author = {Michael R. Fellows and Michael A. Langston}, +title = {Fast self-reduction algorithms for combinatorial problems of {VLSI} design}, +editor = {John H. Reif}, +booktitle = {Proceedings of the 3rd Aegean Workshop on Computing, AWOC'88}, +year = 1988, pages = {278-287}, publisher = lncs319} + +@techreport{FellowsL88a+, +author = {Michael R. Fellows and Michael A. Langston}, +title = {Fast Search Algorithms for Graph Layout Permutation Problems}, +number = {CS-88-189}, +institution = {Dept. of Computer Science, Washington State University}, +year = 1988 +} + +%Fellows 1989 + +@misc{Fellows89, +author = {Michael R. Fellows}, +note = {Personal communication}, +year = 1989 } + +@article{Fellows89a, +author = {Michael R. Fellows}, +title = {The {R}obertson-{S}eymour theorems: {A} survey of applications}, +journal = {Contemporary Mathematics}, volume = 89, year = 1989, pages = {1-18}} + +@unpublished{FellowsA89, +author = {Michael R. Fellows and Karl R. Abrahamson}, +title = {Cutset-Regularity Beats Well-Quasi-Ordering for Bounded Treewidth}, +note = {Manuscript}, +year = 1989 } + +@inproceedings{FellowsKL89, +author = {Michael R. Fellows and N. G. Kinnersley and Michael A. Langston}, +title = {Finite-basis theorems, and a computational integrated approach to obstruction set isolation}, +editor = {E. Kaltofen and S. M. Watt}, +booktitle = {Proceedings of the 3rd Conference on Computers and Mathematics}, +publisher = {Springer Verlag}, address = {New York}, +pages = {37-45}, +year = 1989 } + +@inproceedings{FellowsL89, +author = {Michael R. Fellows and Michael A. Langston}, +title = {An analogue of the {M}yhill-{N}erode theorem and its use in computing finite-basis characterizations}, +booktitle = focs89, year = 1989, pages = {520-525}} + +@unpublished{FellowsL89a, +author = {Michael R. Fellows and Michael A. Langston}, +title = {Exploiting {RS}-posets: Constructive Algorithms from Nonconstructive tools}, +note = {Preprint}, year = 1989, month = {2}, 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 = {4}, pages = {1-10}} + +@unpublished{FellowsS89, +author = {Michael R. Fellows and Sam Stueckle}, +title = {The Immersion Order, Forbidden Subgraphs and the Complexity of Network Integrity}, +year = 1989, +note = {Manuscript, to appear in J. Comb. Math. Comb. Comput.} +} + +%Fellows 1991 + +@incollection{FellowsKMP91, +author = {Michael R. Fellows and Jan Kratochv{\'{\i}}l and Matthias +Middendorf and Frank Pfeiffer}, +title = {Induced Minors and Related Problems}, +booktitle = {Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint +Summer Research Conference, Seattle WA, June 1991}, +publisher = {American Math. Soc.}, +address = {Providence, RI}, +editor = {Neil Robertson and Paul Seymour}, +note = {Contemp. Math. 147.}, +pages = {179-182}, +year = 1993} + +@article{FellowsL91, +author = {Michael R. Fellows and Michael A. Langston}, +title = {Fast search algorithms for layout permutation problems}, +journal = {International Journal on Computer Aided VLSI Design}, volume = 3, year = 1991, +pages = {325-340}} + +@inproceedings{FellowsL91a, +author = {Michael R. Fellows and Michael A. Langston}, +title = {Constructivity Issues in Graph Algorithms}, +booktitle = {Conference on Constructivity in Computer Science, San Antonio, Texas}, +year = 1991} + +%Fellows 1992 + +@article{FellowsL92, +author = {Michael R. Fellows and Michael A. Langston}, +title = {On Well-Partial-Order Theory and Its Application to +Combinatorial Problems of {VLSI} Design}, +journal = sjdm, volume = 5, year = 1992, pages = {117-126}} + +%Fellows 1993 + +@inproceedings{FellowsHW93, +author = {Michael R. Fellows and Michael T. Hallett and H. Todd Wareham}, +title = {{DNA} Physical Mapping: Three Ways Difficult (extended abstract)}, +editor = {Thomas Lengauer}, +booktitle = esa93, year = 1993, pages = {157-168}, publisher = lncs726} + +@techreport{FellowsH93, +author = {Michael R. Fellows and Donovan R. Hare}, +title = {Vertex Transversals That Dominate}, +institution = {University of Victoria}, +year = 1993} + +@article{FellowsK91, +author = {Michael R. Fellows and P. Kaschube}, +title = {Searching for {$K_{3,3}$} in Linear Time}, +journal = {Linear and Multilinear Algebra}, volume = 29, year = 1991, pages = {279-290}} + +@inproceedings{FellowsK93, +author = {Michael R. Fellows and N. Koblitz}, +title = {Fixed-parameter complexity and cryptography}, +booktitle = {Proceedings of the 10th International +Conference on Algebraic Algorithms and Error-Correcting Codes, AAECC 10, +Lecture Notes in Computer Science}, +year = 1993} + +%Fellows 1994 + +@article{FellowsL94, +author = {Michael R. Fellows and Michael A. Langston}, +title = {On search, decision and the efficiency of polynomial-time +algorithms}, +journal = jcss, year = 1994, volume = 49, pages = {769-779}} + +%Fellows 2006 + +@inproceedings{Fellows06, +author = {Micahel R. Fellows}, +title = {The lost continent of polynomial time: Preprocessing and kernelization}, +editor = {Hans L. Bodlaender and Michael A. Langston}, +booktitle = iwpec06, publisher = lncs4169, year = 2006, pages = {267-277}} + +@inproceedings{FellowsRRS06, +author = {Michael R. Fellows and Frances A. Rosamond and Udi Rotics and Stefan +Szeider}, +title = {Clique-width minimization is {NP}-hard}, +booktitle = stoc06, +pages = {354-362}, year = 2006} + +@unpublished{FellowsLRR06, +author = {Michael R. Fellows and Michael A. Langston and M. Ragan and +Frances A. Rosamond}, +title = {Kernelization for Convex Recoloring of Trees}, +year = 2006, +note = {Unpublished manuscript}} + +%Fellows 2008 + +@article{FellowsKNRRSTW08, +author = {Michael R. Fellows and Christian Knauer and Naomi Nishimura and Prabhakar Ragde and Frances A. Rosamond +and Ulrike Stege and Dimitrios M. Thilikos and Sue Whitesides}, +title = {Faster fixed-parameter tractable algorithms for matching and packing problems}, +journal = alg, volume = 52, year = 2008, pages = {167-176}} + +@inproceedings{FellowsLMRS08, +author = {Michael R. Fellows and Daniel Lokshtanov and Neeldhara Misra and Frances A. Rosamond and Saket Saurabh}, +title = {Graph layout problems parameterized by vertex cover}, +editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga}, +booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {294-305}} + +%Fellows 2009 + +@article{FellowsHRV09, +author = {Michael R. Fellows and Danny Hermelin and Frances Rosamond and St\'{e}phane Vialette}, +title = {On the parameterized complexity of multiple-interval graph problems}, +journal = tcs, volume = 410, year = 2009, pages = {53-61}} + +%Fels + +@article{Felsenstein82, +author = {J. Felsenstein}, +title = {Numerical methods for inferring evolutionary trees}, +journal = {The Quaterly Review of Biology}, volume = 57, number = 4, year = 1982} + +@inproceedings{Felsner93, +author = {S. Felsner}, +title = {Tolerance graphs and orders}, +editor = {Ernst W. Mayr}, +booktitle = wg92, year = 1993, publisher = lncs657, pages = {17-26}} + +%Fer + +%Feremans + +@phdthesis{Feremans01, +author = {C. Feremans}, +title = {Generalized Spanning Trees and Extensions}, +school = {Universit\'{e} Libre de Bruxelles}, +address = {Brussels, Belgium}, year = 2001} + +@article{FeremansLL03, +author = {C. Feremans and M. Labb\'{e} and G. Laporte}, +title = {Generalized network design problems}, +journal = ejor, volume = 148, year = 2003, pages = {1-13}} + +@techreport{FeremansG04, +author = {C. Feremans and A. Grigoriev}, +title = {Approximation schemes for the generalized geometric problems with +geographic clustering}, +type = {METEOR Research Memoranda}, +number = {RM/04/034}, +institution = {FdEWB, University of Maastricht}, +address = {Maastricht, the Netherlands}, +year = 2004, +note = {http://www.personeel/unimaas.nl/a.grigoriev/research/curved.pdf}} + +%Fern + +@article{FernandesLW09, +author = {Cristina G. Fernandes and Orlando Lee and Yoshiko Wakabayashi}, +title = {Minimum cycle cover and {C}hinese postman problems on mixed graphs of +bounded treewidth}, +journal = dam, volume = 157, year = 2009, pages = {272-279}} + +%Fernandez-Baca 1988 + +@unpublished{FernandezBacaS88, +author = {David Fern\'{a}ndez-Baca and Giora Slutzki}, +title = {Algorithms for Counting and Enumeration in Decomposable Graphs}, +year = 1988, +note = {Manuscript}} + +%Fernandez-Baca 1989 + +@article{FernandezBaca89, +author = {David Fern\'{a}ndez-Baca}, +title = {Allocating modules to processors in a distributed system}, +journal = ieeetse, volume = {15}, year = 1989, pages = {1427-1436}} + +@article{FernandezBacaM89, +author = {David Fern\'{a}ndez-Baca and Charles U. Martel}, +title = {On the efficiency of maximum-flow algorithms on networks with +small integer capacities}, +journal = alg, year = 1989, volume = 4, pages = {173-189}} + +@article{FernandezBacaS89, +author = {David Fern\'{a}ndez-Baca and Giora Slutzki}, +title = {Solving parametric problems on trees}, +journal = ja, year = 1989, volume = 10, pages = {381-402}} + +%Fernandez-Baca 1993 + +@article{FernandezBacaM93, +author = {David Fern\'{a}ndez-Baca and A. Medipalli}, +title = {Parametric Module Allocation on Partial $k$-Trees}, +journal = ieeetc, year = 1993, volume = 42, pages = {738-742}} + +%Fernandez-Baca 1994 + +@article{FernandezBacaS94, +author = {David Fern\'{a}ndez-Baca and Giora Slutzki}, +title = {Parametic Problems on Graphs of Bounded Treewidth}, +journal = ja, volume = 16, pages = {408-430}, year = 1994} + +@inproceedings{FernandezBacaS94a, +author = {David Fern\'{a}ndez-Baca and Giora Slutzki}, +title = {Optimal parametric search on graphs of bounded treewidth}, +editor = {Erik Meineche Schmidt and Sven Skyum}, +booktitle = swat94, pages = {155-166}, publisher = lncs824, year = 1994} + +%Fernandez-Baca 1997 + +@article{FernandezBacaS97, +author = {David Fern\'{a}ndez-Baca and Giora Slutzki}, +title = {Optimal parametric search on graphs of bounded treewidth}, +journal = ja, volume = 22, pages = {212-240}, year = 1997} + +@inproceedings{FerranteR79, +author = {J. Ferrante and C. Rackoff}, +title = {The computational complexity of logical theories}, +booktitle = {Lecture Notes in Mathematics 718}, +publisher = {Springer-Verlag}, address = {Berlin}, year = 1979} + +%Fernau 2001 + +@article{FernauN01, +author = {Henning Fernau and Rolf Niedermeier}, +title = {An efficient exact algorithm for constraint bipartite vertex +cover}, +journal = ja, volume = 38, pages = {374-410}, year = 2001} + +%Fernau 2004 + +@inproceedings{FernauJ04, +author = {Henning Fernau and David W. Juedes}, +title = {A Geometric Approach to Parameterized Algorithms for Domination Problems on Planar Graphs}, +editor = {Jir\'{\i} Fiala and V{\'a}clav Koubek and Jan Kratochv\'{\i}l}, +booktitle = mfcs04, year = 2004, publisher = lncs3153, pages = {488-499}} + +%Fernau 2006 + +@inproceedings{Fernau06, +author = {Henning Fernau}, +title = {Edge Dominating Set: Efficient enumeration-based exact algorithms}, +editor = {Hans L. Bodlaender and Michael A. Langston}, +booktitle = iwpec06, publisher = lncs4169, year = 2006, pages = {140-151}} + +%Fernau 2008 + +@article{Fernau08, +author = {Henning Fernau}, +title = {Parameterized algorithms for linear arrangement problems}, +journal = dam, volume = 156, year = 2008, pages = {3166-3177}} + +%Fernau 2009 + +@inproceedings{FernauFLRSV09, +author = {Henning Fernau and Fedor V. Fomin and Daniel Lokshtanov and Daniel Raible and Saket Saurabh and Yngve Villanger}, +title = {Kernel(s) for problems with no kernel: On out-trees with many leaves (Extended abstract)}, +editor = {Susanne Albers and Jean-Yves Marion}, +series = {Dagstuhl Seminar Proceedings}, +publisher = {Leibniz-Zentrum f\"{u}r Informatik}, +address = {Schloss Dagstuhl, Germany}, +volume = {09001}, +booktitle = stacs09, pages = {421-432}, year = 2009} + +@article{FernauRS09, +author = {Henning Fernau and Juan A. Rodr{\'{\i}}guez and Jos\'{e} M. Sigarreta}, +title = {Offensive $r$-alliances in graphs}, +journal = dam, volume = 157, year = 2009, pages = {177-182}} + +%Fernau 2010 + +@article{Fernau10, +author = {Henning Fernau}, +title = {Minimum dominating set of queens: A trivial programming exercise?}, +journal = dam, volume = 157, year = 2010, pages = {308-318}} + +@article{Fernau10a, +author = {Henning Fernau}, +title = {Parameterized algorithms for {$d$-Hitting Set}: The weighted case}, +journal = tcs, volume = 411, year = 2010, pages = {1698-1713}} + +%Fert + +@article{FertinR07, +author = {Guillaume Fertin and Andr\'{e} Raspaud}, +title = {$L(p,q)$ labeling of $d$-dimensional grids}, +journal = dm, volume = 307, year = 2007, pages = {2132-2140}} + +%Fes + +@inproceedings{FestaPR99, +author = {P. Festa and P. M. Pardalos and M. G. C. Resende}, +title = {Feedback set problems}, +editor = {D. Z. Du and P. M. Pardalos}, +booktitle = {Handbook of Combinatorial Optimization, Vol. A.}, +publisher = {Kluwer}, address = {Amsterdam, the Netherlands}, +year = 1999, pages = {209-258}} + +%Fi + +%Fia + +@article{FialaKK01, +author = {J. Fiala and Ton Kloks and J. Kratochv{\'{\i}}l}, +title = {Fixed-parameter complexity of $\lambda$-labelings}, +journal = dam, volume = 113, year = 2001, pages = {59-72}} + +@article{FialaJLS03, +author = {J. Fiala and K. Jansen and V. B. Le and E. Seidel}, +title = {Graph subcolorings: {C}omplexity and algorithms}, +journal = sjdm, volume = 16, pages = {635-650}, year = 2003} + +%Fig + +@article{deFigueiredoFKS07, +author = {C.M.H. {de Figueiredo} and L. Faria and S. Klein and R. Sritharan}, +title = {On the complexity of the sandwich problems for strongly chordal +graphs and chordal bipartite graphs}, +journal = tcs, volume = 381, year = 2007, pages = {57-67}} + +%Fil + +@inproceedings{FilottiMR79, +author = {I. S. Filotti and Gary L. Miller and John Reif}, +title = {On determining the Genus of a Graph in {$O(V^{O(g)})$} Steps}, +publisher = {ACM Press}, address = {New York}, +booktitle = stoc79, year = 1979, pages = {27-37}} + +%Fio + +@article{Fiorini75, +author = {S. Fiorini}, +title = {On the chromatic index of outerplanar graphs}, +journal = jctb, volume = 18, year = 1975, pages = {35-38}} + +@book{FioriniW77, +author = {S. Fiorini and R. J. Wilson}, +title = {Edge-colorings of Graphs}, +publisher = {Pitman}, +address = {London}, +year = 1977 +} + +%Fis + +@article{FishburnF82, +author = {J. P. Fishburn and R. A. Finkel}, +title = {Quotient networks}, +journal = ieeetc, volume = {C-31}, year = 1982, pages = {288-295}} + +@article{FishburnR03, +author = {Peter C. Fishburn and Fred S. Roberts}, +title = {No-hole {$L$}(2,1)-colorings}, +journal = dam, volume = 130, year = 2003, pages = {513-519}} + +@article{FischerMR08, +author = {E. Fischer and J.A. Makowsky and E.V. Ravve}, +title = {Counting truth assignments of formulas of bounded tree-width +or clique-width}, +journal = dam, volume = 156, year = 2008, pages = {511-529}} + +%Fit + +@article{Fitch81, +author = {W. M. Fitch}, +title = {A non-sequential method for constructing trees and hierarchical classifications}, +journal = {Journal of Molecular Evolution}, volume = 18, year = 1981, pages = {30-37}} + +%Fl + +%Fla + +@techreport{FlamminiLM95, +author = {M. Flammini and J. {van Leeuwen} and A. Marchetti-Spaccamela}, +title = {The Complexity of Interval Routing on Random Graphs}, +type = {Technical Report}, +number = {UU-CS-1995-16}, +institution = {Utrecht University}, +year = 1991} + +%Fle + +@article{FleinerIM07, +author = {Tamas Fleiner and Robert W. Irving and David F. Manlove}, +title = {Efficient algorithms for generalized Stable Marriage and +Roommates problems}, +journal = tcs, volume = 381, year = 2007, pages = {162-176}} + +@inproceedings{FleischerWY09, +author = {Rudolf Fleischer and Xi Wu and Liwei Yuan}, +title = {Experimental study of {FPT} algorithms for the directed feedback +vertex set problem}, +editor = {Amos Fiat and Peter Sanders}, +booktitle = esa09, publisher = lncs5757, year = 2009, +pages = {611-622}} + +%Flo + +@inproceedings{FlocchiniMS08, +author = {Paola Flocchini and Bernard Mans and Nicola Santoro}, +title = {Tree decontamination with temporary immunity}, +editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga}, +booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {330-341}} + +@article{FloreenKKO05, +author = {P. Flor\'een and P. Kaski and J. Kohonen and P. Orponen}, +title = {Exact and approximate balanced data gathering in +energy-constrained sensor networks}, +journal = tcs, volume = 344, number = 1, year = 2005, pages = {30-46}} + +%Flu + +@phdthesis{Fluiter97, +author = {Babette de Fluiter}, +title = {Algorithms for Graphs of Small Treewidth}, +school = {Utrecht University}, +year = 1997} + +@misc{FluiterB97, +author = {Babette de Fluiter and Hans L. Bodlaender}, +title = {Parallel algorithms for treewidth two}, +editor = {Rolf H. M\"{o}hring}, +booktitle = wg97, year = 1997, publisher = lncs1335, pages = {157-170}} + +@article{FlumFG02, +author = {J\"{o}rg Flum and M. Frick and Martin Grohe}, +title = {Query evaluation via tree-decomposition}, +journal = jacm, volume = 49, pages = {716-751}, year = 2002} + +@book{FlumG06, +author = {J\"{o}rg Flum and Martin Grohe}, +title = {Parameterized Complexity Theory}, +publisher = {Springer}, year = 2006} + +%Fo + +%Fom + +%Fomin 1998 + +@article{Fomin98, +author = {Fedor V. Fomin}, +title = {Helicopter search problems, bandwidth and pathwidth}, +journal = dam, volume = 85, year = 1998, pages = {59-70}} + +%Fomin 1999 + +@article{Fomin99, +author = {Fedor V. Fomin}, +title = {Note on a helicopter search problem on graphs}, +journal = dam, volume = 95, year = 1999, pages = {241-249}} + +%Fomin 2000 + +@article{FominG00, +author = {Fedor V. Fomin and Petr A. Golovach}, +title = {Interval completion and graph searching}, +journal = sjdm, volume = 13, year = 2000, pages = {454-464}} + +%Fomin 2002 + +@techreport{FominT02, +author = {F. V. Fomin and D. M. Thilikos}, +title = {New upper bounds on the decomposability of planar graphs and fixed +paramater algorithms}, +year = 2002, +institution = {Universitat Polit\`ecnica de Catalunya}, +number = {LSI-02-56-R}, +type = {Technical Report}, +address = {Spain}} + +%Fomin 2003 + +@article{Fomin03, +author = {Fedor V. Fomin}, +title = {Pathwidth of planar and line graphs}, +journal = gc, volume = 19, year = 2003, pages = {91-99}} + +@article{FominG03, +author = {Fedor V. Fomin and Petr A. Golovach}, +title = {Interval degree and bandwidth of a graph}, +journal = dam, volume = 129, pages = {345-359}, year = 2003} + +@inproceedings{FominHT03, +author = {Fedor V. Fomin and Pinar Heggernes and Jan Arne Telle}, +title = {Graph searching, elimination trees, and a generalization of bandwidth}, +editor = {Andrzej Lingas and Bengt J. Nilsson}, +booktitle = fct03, year = 2003, publisher = lncs2751, pages = {73-85}} + +@article{FominT03, +author = {Fedor V. Fomin}, +title = {On the monotonicity of games generated by symmetric submodular functions}, +journal = dam, volume = 131, pages = {323-335}, year = 2003} + +@inproceedings{FominT03a, +author = {Fedor V. Fomin and Dimitrios M. Thilikos}, +title = {Dominating sets and local treewidth}, +booktitle = esa03, publisher = lncs2832, year = 2003, pages = {221-229}} + +@techreport{FominT03b, +author = {F. V. Fomin and D. M. Thilikos}, +title = {A Simple and Fast Approach for Solving Problems on Planar Graphs}, +year = 2003, +institution = {Department of Informatics, University of Bergen}, +number = {258}, +type = {Technical Report}, +address = {Bergen, Norway}} + +@inproceedings{FominT03c, +author = {Fedor V. Fomin and Dimitrios M. Thilikos}, +title = {Dominating sets in planar graphs: Branch-width and exponential speedup}, +booktitle = soda03, year = 2003, pages = {168-177}} + +%Fomin 2004 + +@techreport{FominFT04, +author = {F. V. Fomin and P. Fraigniaud and D. M. Thilikos}, +title = {The Price of Connectedness in Expansions}, +year = 2004, +institution = {Universitat Polit\`ecnica de Catalunya}, +number = {LSI-04-28-R}, +type = {Technical Report}, +address = {Spain}} + +@inproceedings{FominKT04, +author = {Fedor V. Fomin and Dieter Kratsch and Ioan Todinca}, +title = {Exact (exponential) algorithms for treewidth and minimum fill-in}, +editor = {Josep D{\'{\i}}az and Juhani Karhum\"{a}ki and Arto Lepist\"{o} and Donald Sanella}, +booktitle = icalp04, publisher = lncs3142, pages = {568-580}, year = 2004} + +@article{FominKM04, +author = {Fedor V. Fomin and Dieter Kratsch and Haiko M\"{u}ller}, +title = {Algorithms for graphs with small octopus}, +journal = dam, volume = 134, year = 2004, pages = {105-128}} + +@inproceedings{FominKW04, +author = {Fedor V. Fomin and Dieter Kratsch and Gerhard J. Woeginger}, +title = {Exact (exponential) algorithms for the dominating set problem}, +editor = {Juraj Hromkovi\u{c} and Manfred Nagl and Bernhard Westfechtel}, +booktitle = wg04, pages = {245-256}, year = 2004, publisher = lncs3353} + +@inproceedings{FominMT05, +author = {Fedor V. Fomin and F. Mazoit and Ioan Todinca}, +title = {Computing branchwidth via efficient triangulations and blocks}, +editor = {Dieter Kratsch}, +booktitle = wg05, year = 2005, publisher = lncs3787, pages = {374-384}} + +@inproceedings{FominT04, +author = {Fedor V. Fomin and Dimitrios M. Thilikos}, +title = {A simple and fast approach for solving problems on planar graphs}, +booktitle = stacs04, year = 2004, publisher = lncs2996, pages = {56-67}} + +@inproceedings{FominT04b, +author = {Fedor V. Fomin and Dimitrios M. Thilikos}, +title = {Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speedup}, +editor = {Josep D{\'{\i}}az and Juhani Karhum\"{a}ki and Arto Lepist\"{o} and Donald Sanella}, +booktitle = icalp04, year = 2004, publisher = lncs3142, pages = {581-592}} + +%Fomin 2005 + +@inproceedings{FominGPS05, +author = {Fedor V. Fomin and Fabrizio Grandoni and A. Pyatkin and A. A. Stepanov}, +title = {Bounding the number of minimal dominating sets: a measure and conquer approach}, +editor = {Xiaotie Deng and Ding-Zhu Du}, +booktitle = isaac05, publisher = lncs3827, year = 2005, pages = {192-203}} + +@article{FominGK05, +author = {Fedor V. Fomin and Fabrizio Grandoni and Dieter Kratsch}, +title = {Some new techniques in design and analysis of exact (exponential) algorithms}, +journal = beatcs, volume = 87, year = 2005, pages = {47-77}} + +@inproceedings{FominGK05a, +author = {Fedor V. Fomin and Fabrizio Grandoni and Dieter Kratsch}, +title = {Measure and conquer: Domination --- a case study}, +editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and +Catuscia Palamidessi and Moti Yung}, +booktitle = icalp05, publisher = lncs3580, year = 2005, pages = {191-203}} + +%Fomin 2006 + +@inproceedings{FominGK06, +author = {Fedor V. Fomin and Fabrizio Grandoni and Dieter Kratsch}, +title = {Measure and conquer: a simple {$O(2^{0.288n})$} independent set algorithm}, +booktitle = soda06, year = 2006, pages = {18-25}} + +@inproceedings{FominGK06a, +author = {Fedor V. Fomin and Fabrizio Grandoni and Dieter Kratsch}, +title = {Solving connected dominating set faster than $2^n$}, +editor = {S. Arun-Kumar and Naveen Garg}, +booktitle = fsttcs06, year = 2006, pages = {152-163}, +publisher = lncs4337} + +@inproceedings{FominGP06, +author = {Fedor V. Fomin and Serge Gaspers and Christian Knauer}, +title = {Finding a minimum feedback vertex set in time {$O(1.7548^n)$}}, +editor = {Hans L. Bodlaender and Michael A. Langston}, +booktitle = iwpec06, publisher = lncs4169, year = 2006, pages = {183-191}} + +@article{FominH06, +author = {Fedor V. Fomin and Kjartan H{\o}ie}, +title = {Pathwidth of cubic graphs and exact algorithms}, +journal = ipl, volume = 97, year = 2006, pages = {191-196}} + +@article{FominT06, +author = {Fedor V. Fomin and Dimitrios M. Thilikos}, +title = {New upper bounds on the decomposability of planar graphs}, +journal = jgt, volume = 51, year = 2006, pages = {53-81}} + +@article{FominT06a, +author = {Fedor V. Fomin and Dimitrios M. Thilikos}, +title = {Approximation of pathwidth of outerplanar graphs}, +journal = jda, volume = 4, year = 2006, pages = {499-510}} + +@article{FominT06c, +author = {Fedor V. Fomin and Dimitrios M. Thilikos}, +title = {Dominating sets in planar graphs: Branch-width and exponential speedup}, +journal = siamjc, volume = 36, year = 2006, pages = {281-309}} + +%Fomin 2008 + +@inproceedings{FominGHMEW08, +author = {Fedor V. Fomin and Petr A. Golovach and Alexander Hall and Mat\'{u}s Mihal\'{a}k and Elias Vicari and Peter Widmayer}, +title = {How to guard a graph}, +editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga}, +booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {318-329}} + +@article{FominKTV08, +author = {Fedon V. Fomin and Dieter Kratsch and Ioan Todinca and Yngve Villanger}, +title = {Exact algorithms for treewidth and minimum fill-in}, +journal = siamjc, volume = 38, year = 2008, pages = {1058-1079}} + +@article{FominT08, +author = {Fedor V. Fomin and Dimitrios M. Thilikos}, +title = {An annotated bibliography on guaranteed graph searching}, +journal = tcs, volume = 399, year = 2008, pages = {236-245}} + +@inproceedings{FominV08, +author = {Fedor V. Fomin and Yngve Villanger}, +title = {Treewidth computation and extremal combinatorics}, +editor = {Luca Aceto and Ivan Damg{\aa}rd and Leslie Ann Goldberg and +Magn\'{u}s M. Halld\'{o}rsson and Anna Ing\'{o}lfsd\'{o}ttir and Igor Walukuewics}, +booktitle = icalp08-1, year = 2008, publisher = lncs5125, pages = {210-221}} + +%Fomin 2009 + +@article{FominFN09, +author = {Fedor V. Fomin and Pierre Fraigniaud and Nicolas Nisse}, +title = {Nondeterministic graph searching: From pathwidth to treewidth}, +journal = alg, volume = 53, year = 2009, pages = {358-373}} + +@article{FominGK09, +author = {Fedon V. Fomin and Fabrizio Grandoni and Dieter Kratsch}, +title = {A measure {\&} conquer approach for the analysis of exact algorithms}, +journal = jacm, volume = 56, year = 2009, number = 5} + +@article{FominGKKL09, +author = {Fedor V. Fomin and Petr A. Golovach and Jan Kratochv\'il and Dieter Kratsch and Mathieu Liefloff}, +title = {Sort and Search: Exact algorithms for generalized domination}, +journal = ipl, volume = 109, year = 2009, pages = {795-798}} + +@article{FominGSS09, +author = {Fedor V. Fomin and Serge Gaspers and Saket Saurabh and Alexey A. Stepanov}, +title = {On two techniques of combining branching and treewidh}, +journal = alg, volume = 54, year = 2009, pages = {181-207}} + +@unpublished{FominV09, +author = {Fedor V. Fomin and Yngve Villanger}, +title = {Finding induced subgraphs via minimal triangulations}, +year = 2009, +note = {Report, published on http://arxiv.org/abs/0909.5278}} + +%Fomin 2010 + +@article{FominGKLS10, +author = {Fedor V. Fomin and Serge Gaspers and Dieter Kratsch and Mathieu Liedloff and Saket Saurabh}, +title = {Iterative compression and exact algorithms}, +journal = tcs, volume = 411, year = 2010, pages = {1045-1053}} + +@article{FominGKNS10, +author = {Fedor V. Fomin and Petr A. Golovach and Jan Kratochv\'il and Nicolas Nisse and Karol Suchan}, +title = {Pursuing a fast robber on a graph}, +journal = tcs, volume = 411, year = 2010, pages = {1167-1181}} + +@unpublished{FominGLS10, +author = {Fedor V. Fomin and Petr A. Golovach and Daniel Lokshtanov and Saket Saurabh}, +title = {Algorithmic lower bounds for problems parameterized by clique-width}, +year = 2009, +note = {To appear in Proceedings SODA 2010}} + +@unpublished{FominLST10, +author = {Fedor V. Fomin and Daniel Lokshtanov and Saket Saurabh and Dimitrios M. Thilikos}, +title = {Bidimensionality and Kernels}, +year = 2009, +note = {To appear in Proceedings SODA 2010}} + +%For + +@inproceedings{Fortnow97, +author = {L. Fortnow}, +title = {Counting complexity}, +booktitle = {Complexity Theory Retrospective II}, +editor = {L. A. Hemaspaandra and A. Selman}, +publisher = {Springer-Verlag}, +year = 1997, +pages = {81-107}} + +@inproceedings{FortnowS08, +author = {Lance Fortnow and Rahul Santhanam}, +title = {Infeasibility of instance compression and succinct {PCPs} for {NP}}, +booktitle = stoc08, year = 2008, pages = {133-142}, +publisher = {ACM Press}, addres = {New York}} + +@article{FortuneHW80, +author = {S. Fortune and J. E. Hopcroft and J. Wyllie}, +title = {The directed subgraph homeomorphism problem}, +journal = {J. Theoret. Comput. Sci. ??????}, volume = 10, +pages = {111-121}, year = 1980} +%Check the journal. Is is TCS? + +%Fot + +@inproceedings{FotakisNPS00, +author = {D. A. Fotakis and S. E. Nikoletseas and V. G. Papadopoulou and P. G. Spirakis}, +title = {{NP}-completeness results and efficient approximations for radiocoloring in planar graphs}, +editor = {Mogens Nielsen and Branislav Rovan}, +booktitle = mfcs00, publisher = lncs1893, year = 2000, pages = {363-372}} + +@article{FotatisNPS05, +author = {D. A. Fotakis and S. E. Nikoletseas and V. G. Papadopoulou and P. G. Spirakis}, +title = {Radiocoloring in planar graphs: {C}omplexity and approximations}, +journal = tcs, volume = 340, year = 2005, pages = {457-644}} + +%Fr + +%Fra + +%Fraenkel 1978 + +@inproceedings{FraenkelGJSY78, +author = {A. S. Fraenkel and M. R. Garey and D. S. Johnson and T. Schaefer and Y. Yesha}, +title = {The complexity of checkers on an $n \times n$ board --- preliminary version}, +booktitle = focs78, year = 1978, pages = {55-64}} + +%Fraenkel 1979 + +@article{FraenkelY79, +author = {A. S. Fraenkel and Y. Yesha}, +title = {Complexity of problems in games, graphs and algebraic equations}, +year = 1979, journal = dam, volume = 1, pages = {15-30}} + +%Fraenkel 1981 + +@article{FraenkelL81, +author = {A. S. Fraenkel and D. Lichtenstein}, +title = {Computing a perfect strategy for $n$ by $n$ chess requires time exponential in $n$}, +journal = jctA, volume = 31, year = 1981, pages = {199-214}} + +%Fraenkel 1982 + +@article{FraenkelY82, +author = {A. S. Fraenkel and Y. Yesha}, +title = {Theory of annihilation games {I}}, +journal = jctb, volume = 33, year = 1982, pages = {60-86}} + +%Fraenkel 1987 + +@article{FraenkelG87, +author = {A. S. Fraenkel and E. Goldschmidt}, +title = {Pspace-hardness of some combinatorial games}, +journal = jctA, volume = 46, year = 1987, pages = {21-38}} + +%Fraenkel 1988 + +@misc{Fraenkel88, +author = {A. S. Fraenkel}, +title = {Selected bibliography on two-player combinatorial games and some related material}, +year = 1988 } + +%Fraenkel 1992 + +@unpublished{FraenkelSU92, +author = {Aviezri S. Fraenkel and Edward R. Scheinerman and Daniel Ullman}, +title = {Undirected Edge Geography}, +year = 1992, +note = {Manuscript}} + +@techreport{FraenkelKS92, +author = {A. S. Fraenkel and A. Kotzig and G. Sabidussi}, +title = {Modular Nim}, +year = 1992, +institution = {The Weizmann Institute of Science}, +address = {Rehovot, Israel}, +number = {CS92-02}, +type = {Technical Report}} + +%Fraenkel 1993 + +@article{FraenkelS93, +author = {A. S. Fraenkel and S. Simonson}, +title = {Geography}, +journal = tcs, volume = 110, year = 1993, pages = {197-214}} + +%Fraigniaud + +@techreport{FraigniaudG94, +author = {P. Fraigniaud and C. Gavoille}, +title = {Interval Routing Schemes}, +institution = {Centre de Recerca Matem\`{a}tica, Institut d'Estudes Catalans}, +address = {Barcelona, Spain}, +number = {251}, +year = 1994} + +@article{FraigniaudG06, +author = {Pierre Fraigniaud and Cyril Gavoille}, +title = {Header-size lower bounds for end-to-end communication in memoryless networks}, +journal = cnet, volume = 50, year = 2006, pages = {1630-1638}} + +@article{FraigniaudN08, +author = {Pierre Fraigniaud and Nicolas Nisse}, +title = {Monotony properties of connected visible graph searching}, +journal = ic2, volume = 206, year = 2008, pages = {1383-1393}} + +%Fran + +@inproceedings{Frank90, +author = {Andr\'{a}s Frank}, +title = {Augmenting graphs to meet edge-connectivity requirements}, +booktitle = focs90, pages = {708-718}, year = 1990} + +@article{Frankl87, +author = {P. Frankl}, +title = {Cops and robbers in graphs with large girth and {C}ayley graphs}, +pages = {301-305}, year = 1987, journal = dam, volume = 17 } + +@article{FranklinGY00, +author = {Matthew Franklin and Zvi Galil and Moti Yung}, +title = {Eavesdropping games: A graph-theoretic approach to privacy in distributed systems}, +journal = jacm, volume = 47, year = 2000, pages = {225-243}} + +%Fre + +%Frederickson 1981 + +@article{FredericksonJ81, +author = {Greg N. Frederickson and J. {Ja'Ja}}, +title = {Approximation algorithms for several graph augmentation problems}, +journal = siamjc, volume = 10, year = 1981, pages = {270-283}} + +%Frederickson 1983 + +@article{FredericksonJ83, +author = {Greg N. Frederickson and D. B. Johnson}, +title = {Finding $k$th path and $p$-centers by generating and searching good data structures}, +journal = ja, volume = 4, year = 1983, pages = {61-80}} + +%Frederickson 1987 + +@article{Frederickson87, +author = {Greg N. Frederickson}, +title = {Fast algorithms for shortest paths in planar graphs}, +journal = siamjc, volume = 16, year = 1987, pages = {1004-1022}} + +@unpublished{FredericksonH87, +author = {Greg N. Frederickson and Suzanne E. Hambrusch}, +title = {Planar Linear Arrangement of Outerplanar Graphs}, +year = 1987, +note = {Manuscript}, +address = {Dept. of Computer Sciences, Purdue University} +} + +%Frederickson 1988 + +@article{FredericksonJ88, +author = {Greg N. Frederickson and R. Janardan}, +title = {Designing networks with compact routing tables}, +journal = alg, volume = 3, year = 1988, pages = {171-190}} + +%Frederickson 1992 + +@unpublished{Frederickson92, +author = {Greg N. Frederickson}, +title = {Ambivalent data structures for dynamic 2-edge-connectivity and $k$ smallest spanning trees}, +note = {Manuscript}, year = 1992} + +%Frederickson 1993 + +@inproceedings{Frederickson93a, +author = {Greg N. Frederickson}, +title = {A data structure for dynamically maintaining rooted trees}, +booktitle = soda93, pages = {175-184}, year = 1993} + +%Frederickson 1997 + +@article{Frederickson97, +author = {Greg N. Frederickson}, +title = {A data structure for dynamically maintaining rooted trees}, +journal = ja, volume = 24, pages = {37-65}, year = 1997} + +%Frederickson 1998 + +@article{Frederickson98, +author = {Greg N. Frederickson}, +title = {Maintaining regular properties dynamically in $k$-terminal graphs}, +journal = ja, volume = 33, year = 1999, pages = {244-266}} + +@article{FrederikssonM06, +author = {Kimmo Fredriksson and Maxim Mozgovoy}, +title = {Efficient parameterized string matching}, +journal = ipl, volume = 100, year = 2006, pages = {91-96}} + +@article{Fredman76, +author = {M. L. Fredman}, +title = {New bounds on the complexity of the shortest path problem}, +journal = siamjc, volume = 5, year = 1976, pages = {276-287}} + +%Fren + +@article{FrendrupHRV09, +author = {Allan Frendrup and Michael A. Henning and Bert Randerath and Preben +Dahl Vestergaard}, +title = {An upper bound on the domination number of a graph with minimum +degree 2}, +journal = dm, volume = 309, year = 2009, pages = {639-646}} + +%Fri + +@article{FrickG01, +author = {M. Frick and M. Grohe}, +title = {Deciding first-order properties of locally tree-decomposable +structures}, +journal = jacm, volume = 48, year = 2001, pages = {1184-1206}} + +@article{Frick04, +author = {Markus Frick}, +title = {Generalized model-checking over locally tree-decomposable classes}, +journal = tcs, volume = 37, year = 2004, pages = {157-191}} + +@article{FriedmanRS87, +author = {Harvey Friedman and Neil Robertson and Paul D. Seymour}, +title = {The Metamathematics of the Graph Minor Theorem}, +year = 1987, +journal = cm, volume = 65, pages = {229-261}} + +@article{Frieze87, +author = {A. M. Frieze}, +title = {Parallel Algorithms for Finding {H}amiltonian Cycles in +Random Graphs}, +journal = ipl, year = 1987, pages = {111-117}} + +%Fu + +%Fuj + +@article{FujiiKN69, +author = {M. Fujii and T. Kasami and K. Ninomiya}, +title = {Optimal sequencing of two equivalent processors}, +journal = sjam, volume = 17, year = 1969, pages = {784-789}, +note = {Erratum. SIAM J. Appl. Math. 20 (1971) 141.}} + +@article{FujitaN08, +author = {Shinya Fujita and Tomoki Nakamigawa}, +title = {Balanced decomposition of a vertex-colored graph}, +journal = dam, volume = 156, year = 2008, pages = {3339-3344}} + +%Ful + +@article{FulkersonG65, +author = {D. R. Fulkerson and O. A. Gross}, +title = {Incidence matrices and interval graphs}, +journal = {Pacific Journal of Mathetics}, volume = 15, year = 1965, pages = {835-855}} + +%Fur + +@inproceedings{Furer07, +author = {Martin F\"{u}rer}, +title = {Faster integer multiplication}, +year = 2007, +booktitle = stoc07} + +@article{FurstGM88, +author = {Merrick L. Furst and Jonathan L. Gross and Lyle A. +{McGeoch}}, +title = {Finding a Maximum-Genus Graph Imbedding}, +journal = jacm, volume = 35, year = 1988, pages = {523-534}} + +%G + +%Ga + +%Gaa + +@phdthesis{Gaag90, +author = {Linda C. {van der Gaag}}, +title = {Probability-Based Models for Plausible Reasoning}, +school = {University of Amsterdam}, +year = 1990 } + +@inproceedings{GaagBF04, +author = {Linda C. {van der Gaag} and Hans L. Bodlaender and Ad Feelders}, +title = {Monotonicity in {B}ayesian Networks}, +editor = {David Maxwell Chickering and Joseph Y. Halpern}, +booktitle = uai04, pages = {569-576}, year = 2004, publisher = {AUAI Press}} + +%Gab + +@article{GaborHS89, +author = {C. P. Gabor and W. L. Hsu and K. J. Supowit}, +title = {Recognizing circle graphs in polynomial time}, +journal = jacm, volume = 36, year = 1989, pages = {435-473}} + +%Gabow 1982 + +@article{GabowK82, +author = {H. Gabow and O. Kariv}, +title = {Algorithms for edge coloring bipartite graphs and multigraphs}, +journal = siamjc, volume = 11, year = 1982, pages = {117-129}} + +%Gabow 1983 + +@inproceedings{Gabow83, +author = {Harold N. Gabow}, +title = {An efficient reduction technique for degree-constrained subgraph and bidirected network flow problems}, +booktitle = stoc83, year = 1983, pages = {448-456}} + +%Gabow 1986 + +@article{GabowGST86, +author = {H. N. Gabow and Z. Galil and T. Spencer and R. E. Tarjan}, +title = {Efficient algorithms for finding minimum spanning trees in undirected and directed graphs}, +journal = comb, volume = 6, year = 1986, pages = {106-122}} + +%Gabow 1992 + +@article{GabowW92, +author = {H. N. Gabow and H. H. Westermann}, +title = {Forests, Frames, and Games: Algorithms for Matroid Sums and Applications}, +journal = alg, volume = 7, pages = {465-498}, year = 1992} + +%Gabow 2000 + +@inproceedings{Gabow00, +author = {H. N. Gabow}, +title = {Using expander graphs to find vertex connectivity}, +booktitle = focs00, year = 2000, pages = {410-420}} + +%Gabow 2004 + +@inproceedings{Gabow04, +author = {Harold N. Gabow}, +title = {Finding paths and cycles of superpolylogarithmic length}, +booktitle = stoc04, year = 2004, pages = {407-416}} + +%Gabow 2008 + +@inproceedings{GabowN08, +author = {Harold N. Gabow and Shuxin Nie}, +title = {Finding long paths, cycles, and circuits}, +editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga}, +booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {752-763}} + +%Gal + +@article{GaleS62, +author = {D. Gale and L. Shapley}, +title = {College admissions and the stability of marriage}, +journal = amm, volume = 69, year = 1962, pages = {9-15}} + +@article{GaleS85, +author = {D. Gale and M. Sotomayor}, +title = {Some remarks on the stable matching problem}, +journal = dam, volume = 11, year = 1985, pages = {223-232}} + +@article{GalilKS89, +author = {Zvi Galil and Ravi Kannan and Endre Szemer\'{e}di}, +title = {On nontrivial separators for $k$-page graphs and simulations by nondeterministic one-tape {T}uring machines}, +journal = jcss, volume = 38, year = 1989, pages = {134-149}} + +@article{GalloGT89, +author = {Giorgio Gallo and Michael D. Grigoriadis and Robert Endre Tarjan}, +title = {A fast parametric maximum flow algorithm and applications}, +journal = siamjc, volume = 18, year = 1989, pages = {30-55}} + +%Gan + +@article{GanianH10, +author = {Robert Ganian and Petr Hlin\v{e}n\'{y}}, +title = {On parse trees and {M}yhill-{N}erode-type tools for handling graphs of bounded rank-width}, +journal = dam, volume = 158, year = 2010, pages = {851-867}} + +@article{Ganjali03, +author = {Y. Ganjali}, +title = {Optimum multi-dimensional interval routing schemes on networks with dynamic cost links}, +journal = {Computing and Informatics}, volume = 22, year = 2003, pages = {1-17}} + +@techreport{GanleyH95, +author = {Joseph L. Ganley and Lenwood S. Heath}, +title = {The pagenumber of \mbox{$k$-trees} is {$O(k)$}}, +institution = {Department of Computer Science, Virginia Tech}, +number = {TR--95--17}, +address = {Blacksburg, Virginia}, +year = 1995} + +@article{GanleyH01, +author = {Joseph L. Ganley and Lenwood S. Heath}, +title = {The pagenumber of {$k$}-trees is {$O(k)$}}, +journal = dam, volume = 109, year = 2001, pages = {215-221}} + +%Gar + +@inproceedings{Garbe95, +author = {Renate Garbe}, +title = {Tree-width and path-width of comparability graphs of interval orders}, +editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, +booktitle = wg94, publisher = lncs903, year = 1995, pages = {26-37}} + +%Garey 1976 + +@article{GareyJ76, +author = {Michael R. Garey and David S. Johnson}, +title = {The complexity of near-optimal graph coloring}, +journal = jacm, volume = 23, pages = {43-49}, year = 1976} + +@article{GareyJS76, +author = {Michael R. Garey and David S. Johnson and L. Stockmeyer}, +title = {Some simplified {NP}-complete graph problems}, +journal = tcs, volume = 1, year = 1976, pages = {237-267}} + +%Garey 1977 + +@article{GareyJ77, +author = {Michael R. Garey and David S. Johnson}, +title = {The rectilinear {S}teiner tree problem is {NP}-complete}, +journal = sjam, volume = 32, year = 1977, pages = {826-834}} + +%Garey 1978 + +@article{GareyGJK78, +author = {Michael R. Garey and R. L. Graham and David S. Johnson and D. E. Knuth}, +title = {Complexity Results for Bandwidth Minimization}, +year = 1978, journal = sjam, volume = 34, pages = {477-495}} + +%Garey 1979 + +@book{GareyJ79, +author = {Michael R. Garey and David S. Johnson}, +title = {Computers and Intractability, A Guide to the Theory of {NP}-Completeness}, +publisher = {W.H. Freeman and Company}, +year = 1979, +address = {New York} +} + +%Garey 1980 + +@article{GareyJMP80, +author = {Michael R. Garey and David S. Johnson and Gary L. Miller and Christos H. Papadimitriou}, +title = {The complexity of coloring circular arcs and chords}, +journal = sjadm, volume = 1, year = 1980, pages = {216-227}} + +%Garey 1983 + +@article{GareyJ83, +author = {Michael R. Garey and David S. Johnson}, +title = {Crossing number is {NP}-complete}, +journal = sjadm, volume = 4, year = 1983, pages = {312-316}} + +%Garg + +@inproceedings{Garg95, +author = {A. Garg}, +title = {On drawing angle graphs}, +editor = {R. Tamassia and I. G. Tollis}, +booktitle = gd94, publisher = lncs894, year = 1995, pages = {84-95}} + +@phdthesis{Garg96, +author = {Ashim Garg}, +title = {Where to Draw the Line}, +school = {Department of Computer Science, Brown University}, +year = 1996} + +@inproceedings{GargK98, +author = {N. Garg and J. K\"onemann}, +title = {Faster and Simpler Algorithms for Multi-commodity Flow and +Other Fractional Packing Problems}, +booktitle = focs98, year = 1998, pages = {300-309}} + +%Gas + +@inproceedings{GaspersKL06, +author = {Serge Gaspers and Dieter Kratsch and Mathieu Liedloff}, +title = {Exponential time algorithms for the minimum dominating set problem on some graph classes}, +editor = {Lars Arge and Rusins Freivalds}, +booktitle = swat06, pages = {148-159}, year = 2006, publisher = lncs4059} + +@inproceedings{GaspersL06, +author = {Serge Gaspers and Mathieu Liedloff}, +title = {A branch-and-reduce algorithm for finding a minimum independent dominating Set in graphs}, +editor = {Fedor V. Fomin}, +booktitle = wg06, year = 2006, pages = {78-89}, publisher = lncs4271} + +%Gav + +@inproceedings{Gavoille97, +author = {Cyril Gavoille}, +title = {On the dilation of interval routing}, +editor = {Igor Privara and Peter Ruzicka}, +booktitle = mfcs97, publisher = lncs1295, pages = {259-268}, year = 1997} + +@article{Gavoille00, +author = {Cyril Gavoille}, +title = {A survey on interval routing}, +journal = tcs, volume = 245, pages = {217-253}, year = 2000} + +@article{Gavril72, +author = {F{\u{a}}nic\u{a} Gavril}, +title = {Algorithms for minimum coloring, maximum clique, minimum +covering by cliques, and maximum independent set of a chordal graph}, +journal = siamjc, volume = 1, year = 1972, pages = {180-187}} + +@article{Gavril74, +author = {F{\u{a}}nic\u{a} Gavril}, +title = {The intersection graphs of subtrees in trees are exactly + the chordal graphs}, +journal = jctb, year = 1974, volume = 16, pages = {47-56}} + +@article{Gavril74b, +author = {F{\u{a}}nic\u{a} Gavril}, +title = {An algorithm for testing chordiality of graphs}, +journal = ipl, volume = 3, pages = {110-112}, year = 1974 } + +@article{Gavril75, +author = {F{\u{a}}nic\u{a} Gavril}, +title = {A recognition algorithm for the intersection graphs of +directed paths in directed trees}, +journal = dm, volume = 13, year = 1975, pages = {237-249}} + +@article{Gavril78, +author = {F{\u{a}}nic\u{a} Gavril}, +title = {A recognition algorithm for the intersection graphs of paths + in trees}, +journal = dm, volume = 23, pages = {211-227}, year = 1978 } + +@unpublished{Gavril88, +author = {F{\u{a}}nic\u{a} Gavril}, +title = {A Graph Partition Problem Related to {2-CNFSAT}}, +year = 1988, +note = {Draft paper} +} + +@article{Gavril08, +author = {F{\u{a}}nic\u{a} Gavril}, +title = {Minimum weight feedback vertex sets in circle graphs}, +journal = ipl, volume = 107, year = 2008, pages = {1-6}} + +%Ge + +%Gee + +%Geelen 2000 + +@article{Geelen00, +author = {James F. Geelen}, +title = {An algebraic matching algorithm}, +journal = comb, volume = 20, year = 2000, pages = {61-70}} + +%Geelen 2002 + +@article{GeelenGW02, +author = {J. F. Geelen and A. M. H. Gerards and G. Whittle}, +title = {Branch width and well-quasi-ordering in matroids and graphs}, +journal = jctb, volume = 84, pages = {270-290}, year = 2002} + +%Geelen 2003 + +@article{GeelenGRW03, +author = {J. F. Geelen and A. M. H. Gerards and N. Robertson and G. Whittle}, +title = {On the excluded minors for the matroids of branch-width $k$}, +journal = jctb, volume = 88, pages = {261-265}, year = 2003} + +%Geelen 2006 + +@article{GeelenGRW06, +author = {J. Geelen and B. Gerards and N. Robertson and G. Whittle}, +title = {Obstructions to branch-decomposition of matroids}, +journal = jctb, volume = 96, year = 2006, pages = {560-570}} + +%Geelen 2007 + +@article{GeelenGW07, +author = {Jim Geelen and Bert Gerards and Geoff Whittle}, +title = {Excluding a planar graph from {GF($q$)}-representable matroids}, +journal = jctb, volume = 97, year = 2007, pages = {971-998}} + +%Geelen 2009 + +@article{GeelenG09, +author = {Jim Geelen and Bert Gerards}, +title = {Excluding a group-labelled graph}, +journal = jctb, volume = 99, year = 2009, pages = {247-253}} + +@article{GeelenGW09, +author = {Jim Geelen and Bert Gerards and Geoff Whittle}, +title = {Tangles, tree-decompositions and grids in matroids}, +journal = jctb, volume = 99, year = 2009, pages = {657-667}} + +%Geo + +@article{George73, +author = {J. A. George}, +title = {Nested dissection of a regular finite element mesh}, +journal = sjna, volume = 10, year = 1973, pages = {345-367}} + +@book{GeorgeL81, +author = {J. A. George and J. W. H. Liu}, +title = {Computer Solution of Large Sparse Positive Definite Systems}, +publisher = {Prentice-Hall Inc.}, address = {Englewood Cliffs, New Yersey}, +year = 1981} + +@article{GeorgeL89, +author = {A. George and J. W. H. Liu}, +title = {The evolution of the minimum degree ordering algorithm}, +journal = {SIAM Review}, volume = 31, year = 1989, pages = {1-19}} + +@article{GeorgesMW94, +author = {J. P. Georges and D. W. Mauro and M. A. Whittlesey}, +title = {Relating path coverings to vertex labelings with a condition at +distance two}, +journal = dm, volume = 135, year = 1994, pages = {103-111}} + +@article{GeorgesM96, +author = {J. P. Georges and D. W. Mauro}, +title = {On the size of graphs labeled with a condition at distance two}, +journal = jgt, volume = 22, pages = {47-57}, year = 1996} + +%Ger + +@incollection{Gerards95, +author = {A. M. H. Gerards}, +title = {Matching}, +booktitle = {Handbooks in Operations Research and Management Sciences, +Volume 7, Network Models}, +pages = {135-224}, +chapter = 3, +editor = {{M. O. Ball et al.}}, +year = 1995, +address = {Amsterdam}, +publisher = {Elsevier Science}} + +@article{GerberK03, +author = {Michael U. Gerber and Daniel Kobler}, +title = {Algorithms for vertex-partitioning problems on graphs with fixed +clique-width}, +journal = tcs, volume = 299, year = 2003, pages = {719-734}} + +@inproceedings{GerstelZ93, +author = {O. Gerstel and S. Zaks}, +title = {A new characterization of tree medians with applications to distributed algorithms}, +editor = {Ernst W. Mayr}, +booktitle = wg92, year = 1993, publisher = lncs657, pages = {135-144}} + +%Gi + +%Gia + +@inproceedings{GiammarresiI92, +author = {Dora Giammarresi and Giuseppe F. Italiano}, +title = {Dynamic 2- and 3-connectivity on planar graphs}, +editor = {O. Nurmi and E. Ukkonen}, +booktitle = swat92, publisher = lncs621, year = 1992, pages = {221-232}} + +%Gib + +%Gibbons 1985 + +@book{Gibbons85, +author = {Alan M. Gibbons}, +title = {Algorithmic Graph Theory}, +publisher = {Cambridge Univ. Press}, +address = {Cambridge, UK}, +year = 1985} + +%Gibbons 1986 + +@techreport{GibbonsR86, +author = {A. M. Gibbons and W. Rytter}, +title = {A Fast Parallel Algorithm for Optimally Edge-coloring of Outerplanar Graphs}, +year = 1986, +number = {80}, +institution = {Dept. of Computer Science, University of Warwick} +} + +%Gibbons 1988 + +@article{GibbonsIR88, +author = {Alan M. Gibbons and Amos Israeli and Wojciech Rytter}, +title = {Parallel {$O(\log n)$} time edge-coloring of trees and {H}alin +Graphs}, +journal = ipl, volume = 27, year = 1988, pages = {43-52}} + +@unpublished{GibbonsR88, +author = {Alan Gibbons and Wojciech Rytter}, +title = {Fast Parallel Algorithms for Optimal Edge-Coloring of Some Tree-Structured Graphs}, +year = 1988, +note = {Manuscript} +} + +@inproceedings{GibbonsKMS88, +author = {P. Gibbons and R. M. Karp and Gary L. Miller and D. Soroker}, +title = {Subtree isomorphism is in random {NC}}, +editor = {John H. Reif}, +booktitle = {Proceedings of the 3rd Aegean Workshop on Computing, AWOC'88}, +publisher = lncs319, year = 1988, pages = {43-52}} + +%Gibbons 1990 + +@article{GibbonsR90, +author = {Alan M. Gibbons and W. Rytter}, +title = {Optimally edge-colouring outerplanar graphs is in {NC}}, +journal = tcs, volume = 71, pages = {401-411}, year = 1990} + +%Gibbons 1991 + +@article{GibbonsKRST91, +author = {Phillip Gibbons and Richard Karp and Vijaya Ramachandran and Danny Soroker and Robert Tarjan}, +title = {Transitive compaction in parallel via branchings}, +journal = ja, year = 1991, volume = 12, pages = {110-125}} + +%Gil + +@article{GilbertHT84, +author = {John R. Gilbert and J. P. Hutchinson and Robert Endre Tarjan}, +title = {A separator theorem for graphs of bounded genus}, +journal = ja, volume = 5, year = 1984, pages = {391-407}} + +@article{GilbertLT80, +author = {J. R. Gilbert and T. Lengauer and R. E. Tarjan}, +title = {The pebbling problem is complete in polynomial space}, +journal = siamjc, volume = 9, pages = {513-524}, year = 1980 } + +@article{GilbertRE84, +author = {John R. Gilbert and Donald J. Rose and Anders Edenbrandt}, +title = {A separator theorem for chordal graphs}, +journal = sjadm, volume = 5, year = 1984, pages = {306-313}} + +@article{Gill77, +author = {J. Gill}, +title = {Computational complexity of probabilistic complexity classes}, +journal = siamjc, volume = 6, year = 1977, pages = {675-695}} + +@article{GilmoreH64, +author = {P. C. Gilmore and A. J. Hoffman}, +title = {A characterization of comparability graphs and of interval graphs}, +journal = canjm, volume = 16, year = 1964, pages = {539-548}} + +%Gim + +@article{GimenezHN06, +author = {Omer Gim\'{e}nez and Petr Hlin\v{e}n\'{y} and Marc Noy}, +title = {Computing the {T}utte polynomial on graphs of bounded clique-width}, +journal = sjdm, volume = 20, year = 2006, pages = {932-946}} + +%Gl + +%Glo + +@article{GloverHW79, +author = {H. H. Glover and P. Huneke and C. Wang}, +title = {103 graphs that are irreducible for the projective plane}, +journal = jctb, volume = 27, year = 1979, pages = {332-370}} + +%Go + +%Goe + +@article{GoemansW97, +author = {Michel X. Goemans and David P. Williamson}, +title = {Primal-Dual Approximation Algorithms for Feedback Problems in +Planar Graphs}, +journal = combinatorica, volume = 17, year = 1997, pages = {1-23}} + +%Gog + +@inproceedings{GogateD04, +author = {Vibhav Gogate and Rina Dechter}, +title = {A complete anytime algorithm for treewidth}, +editor = {David Maxwell Chickering and Joseph Y. Halpern}, +booktitle = uai04, publisher = {AUAI Press}, pages = {201-208}, year = 2004} + +%Gol + +%Gold + +@inproceedings{GoldbergPV88, +author = {Andrew V. Goldberg and Serge A. Plotkin and Pravin M. +Vaidya}, +title = {Sublinear-Time Parallel Algorithms for Matching and Related +Problems}, +booktitle = focs88, pages = {174-185}, year = 1988 } + +@article{GoldbergT88, +author = {Andrew V. Goldberg and Robert Endre Tarjan}, +title = {A new approach to the maximum-flow problem}, +journal = jacm, volume = 35, pages = {921-940}, year = 1988 } + +@article{GoldbergGKS95, +author = {P. W. Goldberg and M. C. Golumbic and H. Kaplan and R. Shamir}, +title = {Four strikes against physical mapping of {DNA}}, +journal = {Journal of Computational Biology}, volume = 2, number = 1, pages = {139-152}, year = 1995} + +@article{GoldbergGPSW96, +author = {L. A. Goldberg and P. W. Goldberg and C. A. Philips and E. Sweedyk and T. Warnow}, +title = {Minimizing phylogenetic number to find good evolutionary trees}, +journal = dam, volume = 71, pages = {111-136}, year = 1996} + +@article{GoldbergK04, +author = {Andrew V. Goldberg and Alexander V. Karzanov}, +title = {Maximum skew-symmetric flows and matchings}, +journal = mp, volume = 100, year = 2004, pages = {537-568}} + +@inproceedings{GoldschmidthH88, +author = {Olivier Goldschmidt and Dorit S. Hochbaum}, +title = {Polynomial algorithm for the $k$-cut problem}, +booktitle = focs88, pages = {444-451}, year = 1988 } + +%Golo + +@article{Golovach93, +author = {Petr A. Golovach}, +title = {The cutwidth of a graph and the vertex separation number of the line graph}, +journal = dam, volume = 3, year = 1993, pages = {517-521}} + +@inproceedings{GolovachV08, +author = {Petr A. Golovach and Yngve Villanger}, +title = {Parameterized complexity for domination problems on degenerate graphs}, +editor = {Hajo Broersma and Thomas Erlebach and Tom Friedetzky and Dani\"{e}l Paulusma}, +booktitle = wg08, publisher = lncs5344, year = 2008, pages = {195-205}} + +%Golumbic 1980 + +@book{Golumbic80, +author = {Martin Charles Golumbic}, +year = 1980, +title = {Algorithmic Graph Theory and Perfect Graphs}, +publisher = {Academic Press}, +address = {New York}} + +%Golumbic 1983 + +@article{GolumbicRU83, +author = {Martin Charles Golumbic and Doron Rotem and Jorge Urrutia}, +title = {Comparability graphs and intersection graphs}, +journal = dm, volume = 43, year = 1983, pages = {37-46}} + +%Golumbic 1985 + +@article{GolumbicJ85, +author = {Martin Charles Golumbic and R. E. Jamison}, +title = {The edge intersection graphs of paths in a tree}, +journal = jctb, volume = 38, year = 1985, pages = {8-22}} + +@article{GolumbicJ85b, +author = {Martin Charles Golumbic and R. E. Jamison}, +title = {Edge and vertex intersections of paths in a tree}, +journal = dm, volume = 55, year = 1985, pages = {151-159}} + +%Golumbic 1987 + +@article{Golumbic87, +author = {Martin Charles Golumbic}, +title = {A general method for avoiding cycling in a network}, +journal = ipl, volume = 24, pages = {251-253}, year = 1987 } + +%Golumbic 1988 + +@article{GolumbicH88, +author = {Martin Charles Golumbic and P. L. Hammer}, +title = {Stability in circular-arc graphs}, +journal = ja, volume = 9, pages = {314-320}, year = 1988} + +%Golumbic 1993 + +@article{GolumbicS93, +author = {Martin Charles Golumbic and R. Shamir}, +title = {Complexity and algorithms for reasoning about time: {A} +graph-theoretic approach}, +journal = jacm, volume = 40, year = 1993, pages = {1108 - 1133}} + +%Golumbic 1994 + +@article{GolumbicKS94, +author = {Martin Charles Golumbic and H. Kaplan and R. Shamir}, +title = {On the complexity of {DNA} physical mapping}, +journal = {Advances in Applied Mathematics}, volume = 15, year = 1994, pages = {251-261}} + +%Golumbic 1995 + +@article{GolumbicKS95, +author = {Martin Charles Golumbic and H. Kaplan and R. Shamir}, +title = {Graph Sandwich Problems}, +journal = ja, volume = 19, year = 1995, pages = {449-472}} + +%Golumbic 2000 + +@article{GolumbicR00, +author = {Martin Charles Golumbic and Udi Rotics}, +title = {On the clique-width of some perfect graph classes}, +journal = ijfcs, volume = 11, year = 2000, pages = {423-443}} + +%Golumbic 2006 + +@article{GolumbicMR06, +author = {Martin Charles Golumbic and Aviad Mintz and Udi Rotics}, +title = {Factoring and recognition of read-once functions using cographs and +normality and the readability of functions associated with partial $k$-trees}, +journal = dam, volume = 154, year = 2006, pages = {1465-1477}} + +%Golumbic 2008 + +@article{GolumbicLS08, +author = {Martin Charles Golumbic and Marina Lipshteyn and Michal Stern}, +title = {The $k$-edge intersection graphs of paths in a tree}, +journal = dam, volume = 156, year = 2008, pages = {451-461}} + +%Gon + +@book{GondranM84, +author = {M. Gondran and M. Minoux}, +title = {Graphs and Algorithms}, +year = 1984, +publisher = {Wiley}, address = {Chichester, UK}} + +%Gor + +@inproceedings{Gorbunov93, +author = {K. {Yu.} Gorbunov}, +title = {An Estimate of the Tree-Width of a Graph Which has not a Given Planar Grid as a Minor}, +editor = {Juraj Hromkovic and Ondrej S\'{y}kora}, +booktitle = wg98, year = 1998, pages = {372-383}, publisher = lncs1517} + +%Got + +%Gottlob 2000 + +@article{GottlobLS00, +author = {Georg Gottlob and Nicola Leone and Francesco Scarcello}, +title = {A comparison of structural {CSP} decomposition methods}, +year = 2000, pages = {243-282}, journal = ai, volume = 124} + +%Gottlob 2002 + +@article{GottlobLS02, +author = {Georg Gottlob and Nicola Leone and Francesco Scarcello}, +title = {Hypertree decompositions and tractable queries}, +journal = jcss, volume = 64, pages = {579-627}, year = 2002} + +@article{GottlobSS02, +author = {G. Gottlob and F. Scarcello and M. Sideri}, +title = {Fixed-parameter complexity in {AI} and nonmonotonic reasoning}, +journal = ai, volume = 138, pages = {55-86}, year = 2002} + +%Gottlob 2004 + +@article{GottlobP04, +author = {G. Gottlob and R. Pichler}, +title = {Hypergraphs in model checking: {A}cyclicity and hypertree-width +versus clique-width}, +journal = siamjc, volume = 33, pages = {351-378}, year = 2004} + +%Gottlob 2005 + +@inproceedings{GottlobGMSS05, +author = {G. Gottlob and M. Grohe and N. Musliu and M. Samer and F. Scarcello}, +title = {Hypertree decompositions: Structure, algorithms, and applications}, +editor = {Dieter Kratsch}, +booktitle = wg05, publisher = lncs3787, year = 2005, pages = {1-15}} + +%Gottlob 2009 + +@article{GottlobMS09, +author = {Georg Gottlob and Zolt{\'a}n Mikl{\'o}s and Thomas Schwentick}, +title = {Generalized hypertree decompositions: {NP}-hardness and tractable variants}, +journal = jacm, volume = 56, year = 2009, number = 6} + +%Gottlob 2010 + +@article{GottlobPW10, +author = {Georg Gottlob and R. Pichler and F. Wei}, +title = {Bounded treewidth as a key to tractability of knowledge representation and reasoning}, +journal = ai, volume = 174, year = 2010, pages = {105-132}} + +@article{GottlobPW10a, +author = {Georg Gottlob and R. Pichler and F. Wei}, +title = {Tractable database design and datalog abduction through bounded treewidth}, +journal = {Information Systems}, volume = 35, year = 2010, pages = {278-298}} + +%Gov + +@inproceedings{GovindanLR93, +author = {R. Govindran and M. A. Langston and S. Ramachandramurthi}, +title = {A practical approach to layout optimization}, +booktitle = {Proceedings of the 6th International Conference on VLSI Design}, +address = {Bombay, India}, year = 1993, pages = {222-225}} + +@article{GovindranLY98, +author = {Rajeev Govindran and Michael A. Langston and Xudong Yan}, +title = {Approximating the pathwidth of outerplanar graphs}, +journal = ipl, year = 1998, volume = 68, pages = {17-23}} + +@article{GovindranR01, +author = {Rajeev Govindran and S. Ramachandramurthi}, +title = {A weak immersion relation on graphs and its applications}, +journal = dm, volume = 230, pages = {189-206}, year = 2001} + +%Gr + +%Gra + +%Grab + +@techreport{Grabe91, +author = {A. Grabe}, +title = {Zur Berechnung der Grundzustandsenergie und der +Zustandssumme von Spin-Glas-Hamiltonfunktionen}, +type = {Diplomarbeit}, +institution = {Bielefeld University}, +month = {3}, year = 1991, pages = {1-155}} + +%Grae + +@techreport{Graef93, +author = {Albert Gr{\"{a}}f}, +title = {Complete Difference Sets and {$T$}-Colorings of Complete Graphs}, +institution = {University of Mainz}, year = 1993} + +%Grah + +@book{GrahamKP94, +author = {R. L. Graham and D. E. Knuth and O. Patashnik}, +title = {Concrete Mathematics}, +year = 1994, +publisher = {Addison-Wesley}} + +%Gram + +@article{GrammGHN04, +author = {Jens Gramm and Jiong Guo and Falk H\"{u}ffner and Rolf Niedermeier}, +title = {Automated generation of search tree algorithms for hard graph-modification problems}, +journal = alg, volume = 29, pages = {321-347}, year = 2004} + +@inproceedings{GrammGHN06, +author = {Jens Gramm and Jiong Guo and Falk H\"{u}ffner and Rolf Niedermeier}, +title = {Data reduction, exact, and heuristic algorithms for clique cover}, +booktitle = alenex06, year = 2006, publisher = {SIAM}, pages = {86-94}} + +@article{GrammFHN08, +author = {Jens Gramm and Jiong Guo and Falk H\"{u}ffner and Rolf Niedermeier}, +title = {Data reduction and exact algorithms for clique cover}, +journal = acmjea, year = 2008, volume = 13, number = {2.2}} + +@article{GrammNT08, +author = {J. Gramm and A. Nickelsen and T. Tantau}, +title = {Fixed-parameter algorithms in phylogenetics}, +journal = tcj, volume = 51, year = 2008, pages = {79-101}} + +%Gran + +@article{Grandoni06, +author = {Fabrizio Grandoni}, +title = {A note on the complexity of minimum dominating set}, +journal = jda, volume = 4, year = 2006, pages = {209-214}} + +@techreport{GranotS90, +author = {Daniel Granot and Darko Skorin-Kapov}, +title = {A Fixed Cost Spanning-Forest Problem On Series-Parallel Graphs}, +institution = {SUNY at Stony-Brook}, +type = {Harriman School Working Paper}, +number = {HAR-90-009}, year = 1990} + +@article{GranotS91, +author = {Daniel Granot and Darko Skorin-Kapov}, +title = {{NC} algorithms for recognizing partial 2-trees and 3-trees}, +journal = sjdm, volume = 4, number = 3, pages = {342-354}, year = 1991} + +@article{GranotS94, +author = {Daniel Granot and Darko Skorin-Kapov}, +title = {On some optimization problems on $k$-trees and partial $k$-trees}, +journal = dam, volume = 48, year = 1994, pages = {129-145}} + +%Gri + +@article{GriggsY92, +author = {J. R. Griggs and R. K. Yeh}, +title = {Labeling graphs with a condition at distance 2}, +journal = sjdm, volume = 5, year = 1992, pages = {586-595}} + +@article{GrigoriadisK88, +author = {M. D. Grigoriades and B. Kalantari}, +title = {A new class of heuristic algorithms for weighted perfect +matching}, +journal = jacm, volume = 35, year = 1988, pages = {769-776}} + +@article{GrigorievMU09, +author = {Alexander Grigoriev and Bert Marchal and Natalya Usotskaya}, +title = {On planar graphs with large tree-width and small grid minors}, +journal = endm, volume = 32, year = 2009, pages = {35-42}} + +%Gro + +%Grohe 2003 + +@article{Grohe03, +author = {Martin Grohe}, +title = {Local tree-width, excluded minors, and approximation algorithms}, +journal = combinatorica, volume = 23, year = 2003, pages = {613-632}} + +%Grohe 2004 + +@article{Grohe04, +author = {Martin Grohe}, +title = {Computing crossing numbers in quadratic time}, +journal = jcss, volume = 68, pages = {285-302}, year = 2004} + +%Grohe 2009 + +@article{GroheM09, +author = {Martin Grohe and D\'{a}niel Marx}, +title = {On tree width, bramble size, and expansion}, +journal = jctb, year = 2009, volume = 99, pages = {218-228}} + +%Gros + +@book{GrossT87, +author = {Jonathan L. Gross and Thomas W. Tucker}, +title = {Topological Graph Theory}, +series = {Wiley Interscience Series in Discrete Mathematics and Optimization}, +publisher = {J. Wiley \& Sons}, +address = {New York}, +year = 1987} + +@book{GrossY99, +title = {Graph Theory and Its Applications}, +author = {Jonathan Gross and Jay Yellen}, +year = {1999}, +address = {CRC Press}, +publisher = {New York}} + +@article{GrotschelLA85, +author = {M. L. Gr\"{o}tschel and L. Lovasz and A. Schrijver}, +title = {Polynomial algorithms for perfect graphs}, +journal = adm, volume = 21, year = 1985, pages = {325-327}} + +%Gu + +@inproceedings{GuT05, +author = {Qian-Ping Gu and Hisao Tamaki}, +title = {Optimal branch-decomposition of planar graphs in {$O(n^3)$} time}, +editor = {Lu{\'{\i}}s Caires and Giuseppe F. Italiano and Lu{\'{\i}}s Monteiro and +Catuscia Palamidessi and Moti Yung}, +booktitle = icalp05, publisher = lncs3580, pages = {373-384}, year = 2005} + +@article{GuT08, +author = {Qian-Ping Gu and Hisao Tamaki}, +title = {Optimal branch-decomposition of planar graphs in {$O(n^3)$} time}, +journal = acmtalg, volume = 4, year = 2008, pages = {Article No. 30}} + +%Gua + +@article{GuanZ99, +author = {D. Guan and X. Zhu}, +title = {Game chromatic number of outerplanar graphs}, +journal = jgt, volume = 30, pages = {67-70}, year = 1999} + +%Guo + +%Guo 2005 + +@inproceedings{GuoGHNW05, +author = {Jiong Guo and Jens Gramm and Falk H\"{u}ffner and Rolf +Niedermeier and Sebastian Wernicke}, +title = {Improved fixed-parameter algorithms for two feedback set +problems}, +editor = {Frank K. H. A. Dehne and Alejandro L\'{o}pez-Ortiz and +J\"{o}rg-R\"{u}dinger Sack}, +booktitle = wads05, pages = {158-168}, publisher = lncs3608, year = 2005} + +%Guo 2006 + +@phdthesis{Guo06, +author = {Jiong Guo}, +title = {Algorithm Design Techniques for Parameterized Graph Modification +Problems}, +year = 2006, +school = {Institut f\"{u}r Informatik, Friedrich-Schiller-Universit\"{a}t}, +address = {Jena, Germany}} + +@inproceedings{GuoNW06, +author = {Jiong Guo and Rolf Niedermeier and Sebastian Wernicke}, +title = {Fixed-Parameter Tractability Results for Full-Degree Spanning Tree and Its Dual}, +editor = {Hans L. Bodlaender and Michael A. Langston}, +booktitle = iwpec06, publisher = lncs4169, year = 2006, pages = {203-214}} + +%Guo 2007 + +@inproceedings{Guo07, +author = {Jiong Guo}, +title = {A more effective linear kernelization for Cluster Editing}, +editor = {Bo Chen and Mike Paterson and Guochan Zhang}, +booktitle = {Proceedings 1st International Symposium on Combinatorics, +Algorithms, Probabilistic and Experimental Methodologies, ESCAPE 2007}, +year = 2007, publisher = lncs4614, pages = {36-47}} + +@article{GuoHM07, +author = {Jiong Guo and Falk Hueffner and Hannes Moser}, +title = {Feedback arc set in bipartite tournaments is {NP}-complete}, +journal = ipl, volume = 102, year = 2007, pages = {62-65}} + +@article{GuoN07, +author = {Jiong Guo and Rolf Niedermeier}, +title = {Invitation to Data Reduction and Problem Kernelization}, +journal = {ACM SIGACT News}, volume = 38, pages = {31-45}, year = 2007} + +@inproceedings{GuoN07a, +author = {Jiong Guo and Rolf Niedermeier}, +title = {Linear problem kernels for {NP}-hard problems on planar graphs}, +editor = {Lars Arge and Christian Cachin and Tomasz Jurdzinski and Andrzej Tarlecki}, +booktitle = icalp07, publisher = lncs4596, pages = {375-386}, year = 2007} + +@article{GuoNW07, +author = {Jiong Guo and Rolf Niedermeier and Sebastian Wernicke}, +title = {Parameterized complexity of vertex cover variants}, +journal = tocs, volume = 41, year = 2007, pages = {501-520}} + +@article{GuoNU07, +author = {Jiong Guo and Rolf Niedermeier and Johannes Uhlmann}, +title = {Two fixed-parameter algorithms for {Vertex Covering by Paths on +Trees}}, +journal = ipl, volume = 106, year = 2008, pages = {81-86}} + +%Guo 2009 + +@article{Guo09, +author = {Jiong Guo}, +title = {A more effective linear kernelization for cluster editing}, +journal = tcs, volume = 410, year = 2009, pages = {718-726}} + +%Gupta 1982 + +@article{GuptaLL82, +author = {U. I. Gupta and D. T. Lee and Joseph Y.-T. Leung}, +title = {Efficient algorithms for interval graphs and circular-arc graphs}, +journal = netw, volume = 12, year = 1982, pages = {459-467}} + +%Gupta 1993 + +@inproceedings{Gupta93, +author = {Arvind Gupta}, +title = {Finite automata as characterizations of minor closed tree families (Extended Abstract)}, +editor = {Andrzej Lingas and Rolf G. Karlsson and Svante Carlsson}, +booktitle = icalp93, pages = {359-370}, year = 1993, publisher = lncs700} + +%Gupta 1994 + +@techreport{GuptaN94, +author = {Arvind Gupta and Naomi Nishimura}, +title = {Sharp Divisions in Complexity of Subgraph Isomorphism for Graphs of +Bounded Path- and Tree- Width}, +number = {CS-94-45}, year = 1994, +institution = {University of Waterloo, Computer Science Department}, +address = {Waterloo, Ontario, Canada}, +remark = {Contained an error. Corrected as GuptaN95.}} + +@inproceedings{GuptaN94a, +author = {Arvind Gupta and Naomi Nishimura}, +title = {Sequential and parallel algorithms for embedding problems on classes of partial $k$-trees}, +editor = {Erik Meineche Schmidt and Sven Skyum}, +booktitle = swat94, publisher = lncs824, pages = {172-182}, year = 1994} + +%Gupta 1995 + +@unpublished{GuptaKMS95, +author = {Arvind Gupta and Damon Kaller and S. Mahajan and T. Shermer}, +title = {Vertex partitioning problems on partial $k$-trees}, +note = {Manuscript}, year = 1995} + +@techreport{GuptaN95, +author = {Arvind Gupta and Naomi Nishimura}, +title = {The Complexity of Subgraph Isomorphism: Duality Results for Graphs of +Bounded Path- and Tree-Width}, +number = {CS-95-14}, year = 1995, +institution = {University of Waterloo, Computer Science Department}, +address = {Waterloo, Ontario, Canada}} + +@article{GuptaN95a, +author = {Arvind Gupta and Naomi Nishimura}, +title = {The parallel complexity of tree embedding problems}, +journal = ja, volume = 18, pages = {176-200}, year = 1995} + +%Gupta 1996 + +@article{GuptaN96, +author = {Arvind Gupta and Naomi Nishimura}, +title = {The complexity of subgraph isomorphism for classes of +partial $k$-trees}, +journal = tcs, volume = 164, year = 1996, pages = {287-298}} + +%Gupta 1999 + +@article{GuptaS99, +author = {Srabani Sen Gupta and Bhabani P. Sinha}, +title = {A simple {$O(\log N)$} time parallel algorithm for testing +isomorphism of maximal outerplanar graphs}, +journal = jpdc, volume = 56, year = 1999, pages = {144-155}} + +%Gupta 2000 + +@article{GuptaKS00, +author = {A. Gupta and D. Kaller and T. Shermer}, +title = {Linear-time algorithms for partial $k$-tree complements}, +journal = alg, volume = 27, year = 2000, pages = {254-274}} + +%Gupta 2005 + +@article{GuptaNPR05, +author = {Arvind Gupta and Naomi Nishimura and Andrzej Proskurowski and +Prabhakar Ragda}, +title = {Embeddings of $k$-connected graphs of pathwidth $k$}, +journal = dam, volume = 145, pages = {242-265}, year = 2005} + +%Gur + +@article{GurariS84, +author = {E. M. Gurari and Ivan Hal Sudborough}, +title = {Improved Dynamic Programming Algorithms for Bandwidth Minimization and +the Mincut Linear Arrangement Problem}, +journal = ja, year = 1984, volume = 5, pages = {531-546}} + +@article{GurevichSV84, +author = {Y. Gurevich and L. Stockmeyer and Uzi Vishkin}, +title = {Solving {NP}-hard Problems on Graphs that are Almost Trees +and an Application to Facility Location Problems}, +journal = jacm, year = 1984, volume = 31, pages = {459-473}} + +@article {GurevichS87, +author = {Yuri Gurevich and Saharon Shelah}, +title = {Expected computation time for {H}amiltonian path problem}, +journal = siamjc, volume = 16, year = 1987, pages = {486-502}} + +@article{Gurski06, +author = {Frank Gurski}, +title = {Linear layouts measuring neighbourhoods in graphs}, +journal = dm, volume = 306, pages = {1637-1650}, year = 2006} + +@article{GurskiW06, +author = {Frank Gurski and Egon Wanke}, +title = {Vertex disjoint paths on clique-width bounded graphs}, +journal = tcs, volume = {359}, year = 2006, pages = {188-199}} + +@article{GurskiW07, +author = {Frank Gurski and Egon Wanke}, +title = {A local characterization of bounded clique-width for line graphs}, +journal = dm, volume = 307, year = 2007, pages = {756-759}} + +@article{GurskiW07a, +author = {Frank Gurski and Egon Wanke}, +title = {Line graphs of bounded clique width}, +journal = dm, volume = 307, pages = {2734-2754}, year = 2007} + +@article{GurskiW09, +author = {Frank Gurski and Egon Wanke}, +title = {The {NLC}-width and clique-width for powers of graphs of bounded +tree-width}, +journal = dam, volume = 157, pages = {583-595}, year = 2009} + +%Gus + +%Gusfield 1986 + +@article{GusfieldP86, +author = {D. Gusfield and L. Pitt}, +title = {Equivalent approximation algorithms for node cover}, +journal = ipl, year = 1986, volume = 22, pages = {291-294}} + +%Gusfield 1987 + +@article{Gusfield87, +author = {D. Gusfield}, +title = {Three fast algorithms for four problems in stable marriage}, +journal = siamjc, volume= 16, year = 1987, pages = {111-128}} + +%Gusfield 1988 + +@article{Gusfield88, +author = {D. Gusfield}, +title = {The structure of the stable roommates problem: {E}fficient representation and enumeration of all stable assignments}, +journal = siamjc, volume = 17, year = 1988, pages = {742-769}} + +%Gusfield 1991 + +@article{Gusfield91, +author = {D. Gusfield}, +title = {Efficient algorithms for inferring evolutionary trees}, +journal = networks, volume = 21, year = 1991, pages = {19-28}} + +%Gusfield 1992 + +@article{GusfieldM92, +author = {D. Gusfield and C. Martel}, +title = {A fast algorithm for the generalized parametric minimum cut problem and applications}, +journal = alg, volume = 7, year = 1992, pages = {499-520}} + +%Gustedt 1991 + +@techreport{Gustedt91, +author = {Jens Gustedt}, +title = {Well Quasi Ordering Finite Posets and Formal Languages}, +number = {290/1991}, year = 1991, +institution = {Fachbereich Mathematik, Technische Universit\"{a}t Berlin}} + +%Gustedt 1992 + +@unpublished{GustedtS92, +author = {Jens Gustedt and Angelika Steger}, +title = {Testing Hereditary Properties Efficiently}, +year = 1992, +note = {Manuscript}} + +%Gustedt 1993 + +@article{Gustedt93, +author = {Jens Gustedt}, +title = {On the pathwidth of chordal graphs}, +journal = dam, year = 1993, volume = 45, number = 3, pages = {233-248}} + +%Gustedt 1998 + +@article{Gustedt98, +author = {Jens Gustedt}, +title = {Efficient {Union-Find} for planar graphs and other sparse graph +classes}, +journal = tcs, volume = 203, pages = {123-141}, year = 1998} + +%Gustedt 2002 + +@inproceedings{GustedtMT02, +author = {J. Gustedt and O. A. M{\ae}hle and J. A. Telle}, +title = {The treewidth of {J}ava programs}, +editor = {David M. Mount and Clifford Stein}, +booktitle = wea02, publisher = lncs2409, year = 2002, pages ={86-97}} + +%Gut + +@article{GutinKLY05, +author = {G. Gutin and T. Kloks and C. M. Lee and A. Yeo}, +title = {Kernels in planar digraphs}, +journal = jcss, volume = 71, pages = {174-184}, year = 2005} + +@article{GutinRK09, +author = {Gregory Gutin and Igor Razgon and Eun Jung Kim}, +title = {Minimum leaf out-branching and related problems}, +journal = tcs, volume = 410, year = 2009, pages = {4571-4579}} + +@inproceedings{GutjahrWW89, +author = {Wolfgang Gutjahr and Emo Welzl and Gerhart Woeginger}, +title = {Polynomial Graph-Colorings}, +booktitle = stacs89, +pages = {108-119}, +year = 1989} + +@unpublished{Gutner09, +author = {Shai Gutner}, +title = {Polynomial kernels and faster algorithms for the dominating set problem on graphs with an excluded minor}, +year = 2009, +note = {In Proceedings IWPEC 2009}} + +%H + +%Ha + +%Haa + +@article{HaasH06, +author = {Robert Haas and Michael Hoffmann}, +title = {Chordless paths through three vertices}, +journal = tcs, volume = 351, year = 2006, pages = {360-371}} + +%Hab + +%Habel 1987 + +@inproceedings{HabelK87, +author = {Annegret Habel and Hans-J\"{o}rg Kreowski}, +title = {May we introduce to you: hyperedge replacement}, +editor = {Hartmut Ehrig and Manfred Nagl and Grzegorz Rozenberg and Azriel Rosenfeld}, +booktitle = gragra86, publisher = lncs291, pages = {15-26}, year = 1987} + +@article{HabelK87a, +author = {Annegret Habel and Hans-J\"{o}rg Kreowski}, +title = {Characteristics of Graph Languages generated by Edge Replacement}, +journal = tcs, volume = 51, year = 1987, pages = {81-115}} + +%Habel 1988 + +@inproceedings{Habel88, +author = {Annegret Habel}, +title = {Graph-Theoretic Properties Compatible with Graph Derivations}, +editor = {Jan van Leeuwen}, +booktitle = wg88, pages = {11-29}, publisher = lncs344, year = 1988 } + +%Habel 1989 + +@article{HabelKV89, +author = {Annegret Habel and Hans-J\"{o}rg Kreowski and W. Vogler}, +title = {Metatheorems for decision problems on hyperedge-replacement graph languages}, +journal = ai, volume = 26, year = 1989, pages = {657-677}} + +%Habel 1990 + +@inproceedings{HabelK90, +author = {Annegret Habel and Hans-J\"{o}rg Kreowski}, +title = {Filtering hyperedge-replacement languages through compatible properties}, +editor = {Manfred Nagl}, +booktitle = wg89, year = 1990, publisher = lncs411, pages = {107-120}} + +%Habel 1992 + +@book{Habel92, +author = {Annegret Habel}, +title = {Hyperedge Replacement: Grammars and Languages}, +publisher = {Springer-Verlag}, +address = {Berlin}, +series = {Lecture Notes in Computer Science, Vol. 643}, +year = 1992} + +@inproceedings{HabelK92, +author = {Annegret Habel and Hans-J\"{o}rg Kreowski}, +title = {Collage Grammars}, +booktitle = lncs532, +pages = {411-429}, +year = 1991} + +@unpublished{HabelKT92, +author = {Annegret Habel and Hans-J\"{o}rg Kreowski and Stefan Taubenberger}, +title = {Collage and Patterns Generated by Hyperedge Replacement}, +year = 1992, +note = {Manuscript, to appear in Languages and Design 1992}} + +%Habib + +@article{HabibM87, +author = {Michel Habib and Rolf H. M{\"{o}}hring}, +title = {On some complexity properties of {N}-free posets and posets with +bounded decomposition diameter}, +journal = dm, volume = 63, year = 1987, pages = {157-182}} + +@article{HabibM94, +author = {Michel Habib and Rolf H. M{\"{o}}hring}, +title = {Treewidth of Cocomparability Graphs and a New Order-theoretic Parameter}, +journal = {ORDER}, volume = 1, pages = {47-60}, year = 1994} + +@article{HabibP04, +author = {Michel Habib and Christophe Paul}, +title = {A simple linear time algorithm for cograph recognition}, +journal = dam, volume = 145, pages = {183-197}, year = 2004} + +%Hac + +@article{Hackbusch97, +author = {W. Hackbusch}, +title = {On the feedback vertex set problem for a planar graph}, +journal = {Computing}, volume = 58, year = 1997, pages = {129-155}} + +%Hag + +%Hagerup 1988 + +@article{Hagerup88, +author = {Torben Hagerup}, +title = {On Saving Space in Parallel Computation}, +journal = ipl, volume = 29, pages = {327-329}, year = 1988 } + +%Hagerup 1990 + +@article{Hagerup90, +author = {Torben Hagerup}, +title = {Optimal parallel algorithms on planar graphs}, +journal = ic2, volume = 84, pages = {71-96}, year = 1990 } + +@article{Hagerup90a, +author = {Torben Hagerup}, +title = {Planar Depth-First Search in ${O}(\log n)$ Parallel Time}, +journal = siamjc, volume = 19, pages = {678-704}, year = 1990 } + +%Hagerup 1995 + +@inproceedings{HagerupKNR95, +author = {Torben Hagerup and Jyrki Katajainen and Naomi Nishimura and Prabhakar Ragde}, +title = {Characterizations of $k$-Terminal Flow Networks and Computing Network Flows in Partial $k$-Trees}, +booktitle = soda95, year = 1995, pages = {641-649}} + +%Hagerup 1997 + +@inproceedings{Hagerup97, +author = {Torben Hagerup}, +title = {Dynamic algorithms for graphs of bounded treewidth}, +editor = {Pierpaolo Degano and Roberto Gorrieri and Alberto Marchetti-Spaccamela}, +booktitle = icalp97, publisher = lncs1256, year = 1997, pages = {292-302}} + +%Hagerup 1998 + +@article{HagerupKNR98, +author = {Torben Hagerup and Jyrki Katajainen and Naomi Nishimura and +Prabhakar Ragde}, +title = {Characterizing multiterminal flow networks and computing flows in +networks of small treewidth}, +journal = jcss, volume = 57, pages = {366-375}, year = 1998} + +%Hagerup 2000 + +@article{Hagerup00, +author = {Torben Hagerup}, +title = {Dynamic algorithms for graphs of bounded treewidth}, +journal = alg, volume = 27, year = 2000, pages = {292-315}} + +%Haj + +%Hal + +@article{HalldorssonKT00, +author = {Magn\'us M. Halld\'orsson and Jan Kratochv\'il and Jan Arne Telle}, +title = {Independent Sets with Domination Constraints}, +journal = dam, volume = 99, year = 2000, pages = {39-54}} + +@article{HalldorssonK02, +author = {Magn{\'{u}}s Halld{\'{o}}rsson and Guy Kortsarz}, +title = {Tools for Multicoloring with Applications to Planar Graphs and Partial +$k$-Trees}, +journal = ja, volume = 42, pages = {334-366}, year = 2002} + +%Han + +@article{Han08, +author = {Yijie Han}, +title = {A note of an {$O(n^3 / \log n)$} time algorithm for all pairs shortest paths}, +journal = ipl, volume = 105, year = 2008, pages = {114-116}} + +%Hao + +@article{HaoO94, +author = {Jianxiu Hao and James B. Orlin}, +title = {A faster algorithm for finding the minimum cut in a directed graph}, +journal = ja, volume = 17, pages = {424-446}, year = 1994} + +%Har + +@article{HaralamidesMM91, +author = {J. Haralamides and F. Makedon and B. Monien}, +title = {Bandwidth minimization: an approximation algorithm for caterpillars}, +journal = mst, volume = 24, year = 1991, pages = {169-177}} + +@book{Harary69, +author = {F. Harary}, +title = {Graph Theory}, +publisher = {Addison-Wesley}, +address = {Reading, MA}, +year = 1969 } + +@unpublished{HararyT??, +author = {Frank Harary and Zsolt Tuza}, +title = {Two graph-coloring games}, +note = {Manuscript}} + +@article{HareHH86, +author = {E. O. Hare and S. T. Hedetniemi and W. R. Hare}, +title = {Algorithms for computing the domination number of $k \times +n$ complete grid graphs}, +journal = cn, volume = 55, year = 1986, pages = {81-92}} + +@article{HareH87, +author = {E. O. Hare and S. T. Hedetniemi}, +title = {A linear algorithm for computing the knight's domination +number of a $k \times n$ chessboard}, +journal = cn, volume = 59, year = 1987, pages = {115-130}} + +@inproceedings{HareHLPW87, +author = {E. Hare and S. Hedetniemi and R. Laskar and K. Peters and T. Wimer}, +title = {Linear-time Computability of Combinatorial Problems on +Generalized-Series-Parallel Graphs}, +booktitle = {Proceedings of the Japan-US Joint Seminar on Discrete Algorithms and Complexity}, +publisher = {Academic Press, Inc.}, +address = {Orlando, Florida}, +editor = {David S. Johnson and Takao Nishizeki and Akihiro Nozaki and +Herbert S. Wilf}, +year = 1987 +} + +%Has + +@article{HassinT86, +author = {R. Hassin and A. Tamir}, +title = {Efficient Algorithms for Optimization and Selection on +Series-Parallel Graphs}, +journal = sjadm, volume = 7, year = 1986, pages = {379-389}} + +@article{HasunumaIOU09, +author = {Toru Hasunuma and Toshimasa Ishii and Hirotaka Ono and Yuski Uno}, +title = {An {$O(n^{1.75})$} algorithm for {$L(2,1)$}-labeling of trees}, +journal = tcs, volume = 410, year = 2009, pages = {3702-3710}} + +%Hat + +@article{HattinghJJP07, +author = {Johannes H. Hattingh and Elizabeth Jonck and Ernst J. Joubert and Andrew R. Plummer}, +title = {Total restrained domination in trees}, +journal = dm, volume = 307, pages = {1643-1650}, year = 2007} + +%He + +%He 1987 + +@article{HeY87, +author = {Xin He and Yaacov Yesha}, +title = {Parallel recognition and decomposition of two terminal series +parallel graphs}, +journal = ic2, year = 1987, pages = {15-38}, volume = 75 } + +%He 1988 + +@article{HeY88, +author = {Xin He and Yaacov Yesha}, +title = {Binary Tree Algebraic Computation and Parallel Algorithms for Simple Graphs}, +journal = ja, volume = 9, pages = {92-113}, year = 1988 } + +%He 1990 + +@article{HeY90, +author = {Xin He and Yaacov Yesha}, +title = {Efficient Parallel Algorithms for $r$-Dominating Set and $p$-Center Problems on Trees}, +journal = alg, volume = 5, year = 1990, pages = {129-145}} + +%He 1991 + +@article{He91a, +author = {Xin He}, +title = {An improved algorithm for the planar 3-cut problem}, +journal = ja, volume = 12, pages = {23-37}, year = 1991} + +@article{He91, +author = {Xin He}, +title = {Efficient parallel algorithms for series-parallel graphs}, +journal = ja, volume = 12, pages = {409-430}, year = 1991} + +%He 1992 + +@inproceedings{He92, +author = {Xin He}, +title = {Parallel Algorithms for Cograph Recognition with Applications}, +editor = {O. Nurmi and E. Ukkonen}, +booktitle = swat92, publisher = lncs621, year = 1992, pages = {94-105}} + +%He 1993 + +@article{He93, +author = {Xin He}, +title = {Parallel algorithms for cograph recognition with applications}, +journal = ja, volume = 15, year = 1993, pages = {284-313}} + +@article{HeZL05, +author = {P. R. He and W. J. Zhang and Q. Li}, +title = {Some further development on the eigensystem approach for graph isomorphism detection}, +journal = {Journal of the Franklin Institute}, volume = 342, year = 2005, pages = {657-673}} + +%Hea + +@article{Heath87, +author = {Lenwood S. Heath}, +title = {Embedding outerplanar graphs in small books}, +journal = sjadm, volume = 8, year = 1987, pages = {198-218}} + +%Hec + +@article{HechtU74, +author = {M. S. Hecht and J. D. Ullman}, +title = {Characterization of Reducible Flow Graphs}, +journal = jacm, volume = 21, year = 1974, pages = {367-375}} + +%Hed + +@inproceedings{HedetniemiHL85, +author = {S. M. Hedetniemi and S. T. Hedetniemi and R. Laskar}, +title = {Domination in trees: models and algorithms}, +booktitle = {Graph Theory with Applications to Algorithms and Computer +Science}, +publisher = {Wiley}, +address = {New York}, +year = 1985, pages = {423-442}} + +@article{HedetniemiPS85, +author = {S. M. Hedetniemi and A. Proskurowski and M. M. Sys{\l}o}, +title = {Interior graphs of maximal outerplanar graphs}, +journal = jctb, volume = 38, pages = {156-167}, number = 2, year = 1985} + +@article{HedetniemiLP86, +author = {S. T. Hedetniemi and R. Laskar and J. Pfaff}, +title = {A linear algorithm for the domination number of a cactus}, +journal = dam, volume = 13, year = 1986, pages = {287-292}} + +%Heg + +%Heggernes 1998 + +@article{HeggernesT98, +author = {Pinar Heggernes and Jan Arne Telle}, +title = {Partitioning Graphs into Generalized Dominating Sets}, +journal = nordicjc, volume = 5, year = 1998, pages = {128-142}} + +%Heggernes 2001 + +@inproceedings{HeggernesEKP01, +author = {P. Heggernes and S. Eisenstat and G. Kumfert and A. Pothen}, +title = {The computational complexity of the minimum degree algorithm}, +booktitle = {Proceedings of the 14th Norwegian Computer Science Conference, NIK 2001}, +pages = {98-109}, year = 2001} + +%Heggernes 2002 + +@inproceedings{HeggernesV02, +author = {Pinar Heggernes and Yngve Villanger}, +title = {Efficient implementation of a minimal triangulation algorithm}, +editor = {Rolf M{\"{o}}hring and Rajeev Raman}, +booktitle = esa02, publisher = lncs2461, year = 2002, pages = {550-561}} + +%Heggernes 2005 + +@article{HeggernesTV05, +author = {Pinar Heggernes and Jan Arne Telle and Yngve Villanger}, +title = {Computing minimal triangulations in time {${O}(n^\alpha \log n) = o(n^{2.376})$}}, +journal = sjdm, volume = 19, year = 2005, pages = {900-913}} + +@inproceedings{HeggernesSTV05, +author = {Pinar Heggernes and K. Suchan and I. Todinca and Yngve Villanger}, +title = {Minimal interval completions}, +booktitle = esa05, year = 2005, publisher = lncs3669, pages = {403-414}} + +%Heggernes 2006 + +@article{Heggernes06, +author = {Pinar Heggernes}, +title = {Minimal triangulations of graphs: {A} survey}, +journal = dm, volume = 306, pages = {297-317}, year = 2006} + +@article{HeggernesL06, +author = {Pinar Heggernes and Daniel Lokshtanov}, +title = {Optimal broadcast domination in polynomial time}, +journal = dm, volume = 306, pages = {3267-3280}, year = 2006} + +@inproceedings{HeggernesV06, +author = {Pinar Heggernes and Yngve Villanger}, +title = {Simple and efficient modifications of elimination orderings}, +booktitle = {Proceedings of the 7th International Conference on Appied Parallel Computing, PARA 2004}, +year = 2006, publisher = lncs3732, pages = {788-797}} + +%Heggernes 2008 + +@inproceedings{HeggernesKM08, +author = {Pinar Heggernes and Dieter Kratsch and Daniel Meister}, +title = {Bandwidth of bipartite permutation graphs in polynomial time}, +editor = {Eduardo Sany Laber and Claudson F. Bornstein and Loana Tito Nogueira and Luerbio Faria}, +booktitle = latin08, year = 2008, publisher = lncs4957, pages = {216-227}} + +%Heggernes 2009 + +@article{HeggernesKM09, +author = {Pinar Heggernes and Dieter Kratsch and Daniel Meister}, +title = {Bandwidth of bipartite permutation graphs in polynomial time}, +journal = jda, volume = 7, year = 2009, pages = {533-544}} + +@article{HeggernesM09, +author = {Pinar Heggernes and Federico Mancini}, +title = {Dynamically maintaining split graphs}, +journal = dam, volume = 157, year = 2009, pages = {2057-2069}} + +@article{HeggernesP09, +author = {Pinar Heggernes and Charis Papadopoulos}, +title = {Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions}, +journal = tcs, volume = 410, year = 2009, pages = {1-15}} + +@article{HeggernesP09a, +author = {Pinar Heggernes and Barry W. Peyton}, +title = {Fast computation of minimal fill inside a given elimination orering}, +journal = sjmaa, volume = 30, year = 2009, pages = {1424-1444}} + +%Hei + +@inproceedings{HeinzelmanCB00, +author = {W. R. Heinzelman and A. Chandrakasan and H. Balakrishnan}, +title = {Energy-Efficient Communication Protocol for Wireless Microsensor Networks}, +booktitle = {Proceedings of the 33rd Hawaii International Conference on System Sciences, HICSS-33}, +year = 2000} + +%Hel + +@article{HeldK62, +author = {M. Held and R. Karp}, +title = {A dynamic programming approach to sequencing problems}, +journal = {Journal of the Society for Industrial and Applied Mathematics}, volume = 10, year = 1962, pages = {196-210}} + +@unpublished{HelmbergMPR93, +author = {Christoph Helmberg and Bojan Mohar and Svatopluk Poljak and +Franz Rendl}, +title = {A spectral approach to Bandwidth and Separator Problems in Graphs}, +note = {Manuscript}, year = 1993} + +@article{HellM76, +author = {P. Hell and D. Miller}, +title = {Graphs with given achromatic number}, +journal = dm, volume = 16, year = 1976, pages = {195-207}} + +%Hen + +%Henning 2003 + +@article{Henning03, +author = {M. A. Henning}, +title = {Defending the {R}oman Empire from multiple attacks}, +journal = dm, volume = 271, year = 2003, pages = {101-115}} + +@article{HenningH03, +author = {M. A. Henning and S. T. Hedetniemi}, +title = {Defending the {R}oman Empire --- {A} new strategy}, +journal = dm, volume = 271, year = 2003, pages = {239-251}} + +%Henning 2009 + +@article{Henning09, +author = {Michael A. Henning}, +title = {A survey or selected recent results on total domination in graphs}, +journal = dm, volume = 309, year = 2009, pages = {32-63}} + +%Henning 2010 + +@article{HenningK10, +author = {Michael A. Henning and Adel P. Kazemi}, +title = {$k$-Tuple total domination in graphs}, +journal = dam, volume = 158, year = 2010, pages = {1006-1011}} + +@inproceedings{HenzingerK97, +author = {Monika R. Henzinger and Valerie King}, +title = {Maintaining minimum spanning trees in dynamic graphs}, +editor = {Pierpaolo Degano and Roberto Gorrieri and Alberto Marchetti-Spaccamela}, +booktitle = icalp97, publisher = lncs1256, year = 1997, pages = {594-604}} + +%Her + +@inproceedings{HershbergerRS92, +author = {J. Herschberger and M. Rauch and S. Suri}, +title = {Fully Dynamic 2-Connectivity in Planar Graphs}, +editor = {O. Nurmi and E. Ukkonen}, +booktitle = swat92, publisher = lncs621, year = 1992, pages = {233-244}} + +%Heu + +@inproceedings{HeunM96, +title={Embedding Graphs with Bounded Treewidth into Optimal Hypercubes}, +author={Volker Heun and Ernst W. Mayr}, +editor = {Claude Puech and R{\"u}diger Reischuk}, +booktitle = stacs96, publisher = lncs1046, pages = {157-168}, year = 1996} + +@techreport{HeuvelM99, +author = {Jan van den Heuvel and Sean McGuinness}, +title = {Colouring the square of a planar graph}, +institution = {Centre for Discrete and Applicable Mathematics, London School +of Economics, London, U.K.}, +type = {Report}, +number = {LSE-CDAM-99-06}, +year = 1999} + +%Hi + +%Hic + +%Hicks 2000 + +@phdthesis{Hicks00, +author = {Illya V. Hicks}, +title = {Branch Decompositions and their Applications}, +school = {Rice University}, +address = {Houston, Texas}, +year = 2000} + +%Hicks 2002 + +@article{Hicks02, +author = {Illya V. Hicks}, +title = {Branchwidth heuristics}, +journal = cn, volume = 159, year = 2002, pages = {31-50}} + +%Hicks 2004 + +@article{Hicks04, +author = {Illya V. Hicks}, +title = {Branch decompositions and minor containment}, +journal = networks, volume = 43, year = 2004, pages = {1-9}} + +%Hicks 2005 + +@article{Hicks05a, +author = {Illya V. Hicks}, +title = {Planar branch decompositions {I}: {T}he ratcatcher}, +journal = informsjc, volume = 17, year = 2005, pages = {402-412}} + +@article{Hicks05b, +author = {Illya V. Hicks}, +title = {Planar branch decompositions {II}: {T}he cycle method}, +journal = informsjc, volume = 17, year = 2005, pages = {413-421}} + +@article{Hicks05, +author = {Illya V. Hicks}, +title = {Graphs, Branchwidth, and Tangles! {O}h My!}, +journal = networks, volume = 45, year = 2005, pages = {55-60}} + +@InCollection{HicksKK05, +author = {Hicks, Illya V. and Koster, Arie M. C. A. and Elif Koloto\u{g}lu}, +title = {Branch and Tree Decomposition Techniques for Discrete Optimization}, +booktitle = {TutORials 2005}, +editor = {J. Cole Smith}, +publisher = {INFORMS Annual Meeting}, +series = {INFORMS Tutorials in Operations Research Series}, +chapter = {1}, year = {2005}, pages = {1--29}, +} + +%Hicks 2007 + +@article{HicksM07, +author = {Illya V. Hicks and Nolan B. {McMurray Jr.}}, +title = {The branchwidth of graphs and their cycle matroids}, +journal = jctb, volume = 97, year = 2007, pages = {681-692}} + +%Hii + +@mastersthesis{Hiim97m, +author = {Bj\"orn Hiim}, +title = {Implementing and testing of algorithms for tree-like graphs}, +school = {University of Bergen}, +address = {Bergen, Norway}, +year = 1997} + +%Hir + +@article{HirschbergCS79, +author = {D. S. Hirschberg and A. K. Chandra and D. V. Sarwate}, +title = {Computing connected components on parallel computers}, +journal = cacm, volume = 22, year = 1979, pages = {461-464}} + +%Hl + +%Hli + +%Hlineny 2002 + +@article{Hlineny02, +author = {Petr Hlin\v{e}n\'{y}}, +title = {On the excluded minors for matroids of branch-width tree}, +journal = ejc, volume = 9, number = 1, year = 2002} + +%Hlineny 2003 + +@article{Hlineny03, +author = {Petr Hlin\v{e}n\'{y}}, +title = {Crossing-number critical graphs have bounded path-width}, +journal = jctb, volume = 88, pages = {347-367}, year = 2002} + +@techreport{HlinenyW03, +author = {Petr Hlin\v{e}n{\'y} and G. Whittle}, +title = {Matroid Tree-width}, +year = 2003, +address = {Ostrava, Czech Republic}, +institution = {Technical University Ostrava}, +note = {Extended abstract in Eurocomb'03, ITI Series 2003-145, Charles University}} + +%Hlineny 2005 + +@article{Hlineny05, +author = {Petr Hlin\v{e}n\'{y}}, +title = {A parameterized algorithm for matroid branch-width}, +journal = siamjc, volume = 35, year = 2005, pages = {259-277}} + +%Hlineny 2006 + +@article{Hlineny06, +author = {Petr Hlin\v{e}n\'{y}}, +title = {Branch-width, parse trees, and monadic second-order logic for matroids}, +journal = jctb, volume = 96, year = 2006, pages = {325-351}} + +@article{Hlineny06a, +author = {Petr Hlin\v{e}n\'{y}}, +title = {A parameterized algorithm for matroid branchwidth}, +journal = siamjc, volume = 35, year = 2006, pages = {259-277}} + +@article{Hlineny06b, +author = {Petr Hlin\v{e}n\'{y}}, +title = {Crossing number is hard for cubic graphs}, +journal = jctb, volume = 96, year = 2006, pages = {455-471}} + +@article{Hlineny06c, +author = {Petr Hlin\v{e}n\'{y}}, +title = {The {T}utte polynomial for matroids of bounded branch-width}, +journal = cpc, volume = 15, year = 2006, pages = {397-409}} + +@article{HlinenyS06, +author = {Petr Hlin\v{e}n{\'y} and Detlef Seese}, +title = {Trees, grids, and {MSO} decidability: From graphs to matroids}, +journal = tcs, volume = 351, pages = {425-436}, year = 2006} + +@article{HlinenyW06, +author = {Petr Hlin\v{e}n{\'y} and Geoff Whittle}, +title = {Matroid tree-width}, +journal = ejcom, volume = 27, year = 2006, pages = {1117-1128}} + +%Hlineny08 + +@article{HlinenyO08, +author = {Petr Hlin\v{e}n{\'y} and {Sang-il} Oum}, +title = {Finding branch-decompositions and rank-decompositions}, +journal = siamjc, volume = 38, year = 2008, pages = {1012-1032}} + +@article{HlinenyOSG08, +author = {Petr Hlin\v{e}n{\'y} and {Sang-il} Oum and Detlef Seese and Georg Gottlob}, +title = {Width parameters beyond tree-width and their applications}, +journal = tcj, volume = 51, year = 2008, pages = {326-362}} + +%Ho + +@article{HoL88, +author = {Chin-Wen Ho and Richard C. T. Lee}, +title = {Efficient parallel algorithms for finding maximal cliques, +clique trees, and minimum coloring on chordal graphs}, +journal = ipl, volume = 28, year = 1988, pages = {301-309}} + +@article{HoL89, +author = {Chin-Wen Ho and Richard C. T. Lee}, +title = {Counting clique trees and computing perfect elimination +schemes in parallel}, +journal = ipl, volume = 31, pages = {61-68}, year = 1989} + +%Hoe + +@article{HoeselM09, +author = {Hoesel, C. P. M. {v}an and B. Marchal}, +title = {Finding good tree decompositions by local search}, +journal = endm, volume = 32, year = 2009, pages = {43--50}} + +%Hof + +@article{HofPW09, +author = {Pim {van 't Hof} and Dani\"{e}l Paulusma and Gerhard J. Woeginger}, +title = {Partitioning graphs into connected parts}, +journal = tcs, volume = 410, year = 2009, pages = {4834-4843}} + +@article{HofP10, +author = {Pim {van 't Hof} and Dani\"{e}l Paulusma}, +title = {A new characterization of {$P_6$}-free graphs}, +journal = dam, volume = 158, year = 2010, pages = {731-740}} + +%Hoh + +@unpublished{HohbergR89, +author = {Walter Hohberg and R\"udiger Reischuk}, +title = {Decomposition of Graphs --- A Uniform Approach for the Design +of Fast Sequential and Parallel Algorithms on Graphs}, +year = 1989, note = {Preprint}} + +@mastersthesis{Hohberg89, +author = {Walter Hohberg}, +title = {Zerlegung von {G}raphen --- ein allgemeines, sequentielles und +paralleles {L}\"{o}sungsverfahren f\"{u}r Graphprobleme}, +school = {TH Darmstadt}, +note = {Dissertation}, +year = 1989} + +@unpublished{HohbergR90, +author = {Walter Hohberg and R\"udiger Reischuk}, +title = {A Framework to Design Algorithms for Optimization Problems on Graphs}, +note = {Preprint}, year = 1990, month = {4}} + +%Hol + +@article{Holst02, +author = {Hein {van der Holst}}, +title = {On the ''Largeur d'Arborescence''}, +journal = jgt, volume = 41, pages = {24-52}, year = 2002} + +@article{Holst09, +author = {Hein {van der Holst}}, +title = {A polynomial-time algorithm to find a linkless embedding of a graph}, +journal = jctb, volume = 99, year = 2009, pages = {512-530}} + +@article{Holyer81, +author = {Ian Holyer}, +title = {The {NP}-Completeness of Edge-coloring}, +journal = siamjc, volume = 10, year = 1981, pages = {718-720}} + +%Hon + +@article{HongR82, +author = {J. Hong and A. Rosenberg}, +title = {Graphs that are almost binary trees}, +journal = siamjc, volume = 11, year = 1982, pages = {227-242}} + +@article{HongMR83, +author = {J. Hong and K. Mehlhorn and A. Rosenberg}, +title = {Cost trade-offs in graph embeddings, with applications}, +journal = jacm, volume = 30, year = 1983, pages = {709-728}} + +@article{HongP06, +author = {B. Hong and V. K. Prasanna}, +title = {Maximum lifetime data sensing and extraction in energy +constrained networked sensor systems}, +journal = jpdc, volume = 66, number = 4, year = 2006, pages = {566-577}} + +%Hoo + +@phdthesis{Hoover90, +author = {Mark Hoover}, +title = {Complexity, Structure and Algorithms for Edge-Partition +Problems}, +school = {University of New Mexico}, +address = {Albuquerque, New Mexico, USA}, +year = 1990} + +%Hop + +@article{HopcroftT73, +author = {J. E. Hopcroft and Robert Endre Tarjan}, +title = {Dividing a graph into triconnected components}, +journal = siamjc, volume = 2, pages = {135-158}, year = 1973} + +@article{HopcroftT74, +author = {J. E. Hopcroft and Robert Endre Tarjan}, +title = {Efficient planarity testing}, +journal = jacm, volume = 21, pages = {549-568}, year = 1974 } + +@article{HopcroftK75, +author = {J. E. Hopcroft and R. M. Karp}, +title = {An $n^{5/2}$ Algorithm for Maximum Matching in Bipartite +Graphs}, +journal = siamjc, volume = 2, year = 1973, pages = {225-231}} + +@article{HopcroftPV77, +author = {J. E. Hopcroft and W. Paul and L. Valiant}, +title = {On time versus space}, +journal = jacm, volume = 24, year = 1977, pages = {332-337}} + +%Hor + +@book{HorowitzS78, +author = {Ellis Horowitz and Sartaj Sahni}, +title = {Fundamentals of Computer Algorithms}, +publisher = {Pitman}, address = {London}, year = 1978} + +%Hou + +@article{HougardyPS94, +author = {S. Hougardy and H. J. Pr\"{o}mel and A. Steger}, +title = {Probabilistically checkable proofs and their consequences for +approximation algorithms}, +journal = dm, volume = 136, year = 1994, pages = {175-223}} + +%Hs + +%Hsi + +@article{HsiehHHKC02, +author = {Sun-Yuan Hsieh and Chin-Wen Ho and Tsan-Sheng Hsu and Ming-Tat Ko +and Gen-Huey Chen}, +title = {Characterization of efficiently parallel solvable problems on +distance-hereditary graphs}, +journal = sjdm, volume = 15, year = 2002, pages = {488-518}} + +@article{Hsieh05, +author = {Sun-Yuan Hsieh}, +title = {Efficiently parallelizable problems on a class of decomposable +graphs}, +journal = jcss, volume = 70, year = 2005, pages = {140-156}} + +%Hsu + +@article{Hsu85, +author = {Wen-Lian Hsu}, +title = {Maximum weight clique algorithms for circular-arc graphs and +circle graphs}, +journal = siamjc, volume = 14, year = 1985, pages = {224-231}} + +@article{Hsu87, +author = {Wen-Lian Hsu}, +title = {Decomposition of perfect graphs}, +journal = jctb, volume = 43, year = 1987, pages = {70-94}} + +@article{Hsu87a, +author = {Wen-Lian Hsu}, +title = {Recognizing planar perfect graphs}, +journal = jacm, volume = 34, year = 1987, pages = {255-288}} + +@article{Hsu88, +author = {Wen-Lian Hsu}, +title = {The Coloring and Maximum Independent Set problems on planar +perfect graphs}, +journal = jacm, volume = 35, year = 1988, pages = {535-563}} + +@inproceedings{Hsu93, +author = {Wen-Lian Hsu}, +title = {A simple test for interval graphs}, +editor = {Ernst W. Mayr}, +booktitle = wg92, year = 1993, publisher = lncs657, pages = {11-16}} + +%Hu + +%Hua + +@article{Huang06, +author = {Jing Huang}, +title = {Representation characterizations of chordal bipartite graphs}, +journal = jctb, volume = 96, year = 2006, pages = {673-683}} + +%Huf + +@phdthesis{Huffner08, +author = {Falk H\"{u}ffner}, +title = {Algorithms and Experiments for Parameterized Approaches to Hard Graph Problems}, +year = {2008}, +school = {Friedrich-Schiller University}, +address = {Jena, Germany}} + +@inproceedings{HuffnerKMN08, +author = {Falk H\"{u}ffner and Christian Komusiewicz and Hannes Moser and Rolf Niedermeier}, +title = {Fixed-parameter algorithms for cluster vertex deletion}, +editor = {Eduardo Sany Laber and Claudson F. Bornstein and Loana Tito Nogueira and Luerbio Faria}, +booktitle = latin08, year = 2008, publisher = lncs4957, pages = {711-722}} + +@article{HuffnerKMN09, +author = {Falk H\"{u}ffner and Christian Komusiewicz and Hannes Moser and Rolf Niedermeier}, +title = {Isolation concepts for clique enumeration: Comparison and computational experiments}, +journal = tcs, volume = 410, year = 2009, pages = {5384-5397}} + +%Hun + +@book{Hungerford74, +author = {Thomas W. Hungerford}, +title = {Algebra}, +publisher = {Springer-Verlag, New York}, +series = {Graduate Texts in Mathematics 73}, +year = 1974 } + +@techreport{HuntMRRRS93, +author = {H. B. {Hunt, III} and Madhav V. Marathe and Venkatesh Radhakrishnan and S. S. +Ravi and D. J. Rosenkrantz and Richard E. Stearns}, +title = {Every Problem in {MAX SNP} has a Parallel Approximation Algorithm}, +number = {TR 93-8}, +institution = {Dept. of Computer Science, University at Albany - SUNY}, +address = {Albany, NY}, +year = 1993} + +@article{HunterK08, +author = {Paul Hunter and Stephan Kreutzer}, +title = {Digraph measures: {K}elly decompositions, games, and orderings}, +journal = tcs, volume = 399, year = 2008, pages = {206-219}} + +%Hur + +@article{HurinkN08, +author = {Johann L. Hurink and Tim Nieberg}, +title = {Approximating minimum independent dominating sets in wireless +networks}, +journal = ipl, volume = 109, year = 2008, pages = {155-160}} + +%I + +%Ib + +%Iba + +@article{Ibarra09, +author = {Louis Ibarra}, +title = {The clique-separator graph for chordal graphs}, +journal = dam, volume = 157, year = 2009, pages = {1737-1749}} + +@article{Ibarra10, +author = {Oscar H. Ibarra and Igor Potapov and Hsu-Chun Yen}, +title = {On decision problems for parameterized machines}, +journal = tcs, volume = 411, year = 2010, pages = {1192-1201}} + +%Id + +%Idu + +@article{IduryS93, +author = {R. Idury and A. Schaffer}, +title = {Triangulating three-colored graphs in linear time and linear space}, +journal = sjdm, volume = 2, pages = {289-293}, year = 1993} + +%Ih + +@inproceedings{Ihler93, +author = {E. Ihler}, +title = {Minimum rectilinear {S}teiner trees for intervals on two parallel lines}, +editor = {Ernst W. Mayr}, +booktitle = wg92, year = 1993, publisher = lncs657, pages = {123-134}} + +%Im + +%Imp + +@article{ImpagliazzoPZ01, +author = {Russell Impagliazzo and Ramamohan Paturi and Francis Zane}, +title = {Which problems have strongly exponential complexity?}, +journal = jcss, volume = 63, year = 2001, pages = {512-530}} + +%In + +%Inm + +@manual{Inmos91, +title = {The T9000 Transputer Products Overview Manual}, +organization = {Inmos}, year = 1991} + +%Ir + +%Irv + +@article{Irving85, +author = {Robert W. Irving}, +title = {An efficient algorithm for the stable roommates problem}, +journal = ja, volume = 6, year = 1985, pages = {577-595}} + +@article{IrvingL86, +author = {Robert W. Irving and P. Leather}, +title = {The complexity of counting stable marriages}, +journal = siamjc, volume = 15, year = 1986, pages = {655-667}} + +@article{IrvingLG87, +author = {Robert W. Irving and P. Leather and D. Gusfield}, +title = {An efficient algorithm for the ``optimal'' stable marriage}, +journal = jacm, volume = 34, year = 1987, pages = {532-543}} + +@article{Irving91, +author = {Robert W. Irving}, +title = {On approximating the minimum independent dominating set}, +journal = ipl, volume = 37, year = 1991, pages = {197-200}} + +%Is + +%Isl + +@article{IslerK08, +author = {Volkan Isler and Nikhil Karnad}, +title = {The role of information in the cop-robber game}, +journal = tcs, volume = 399, year = 2008, pages = {169-178}} + +%Iso + +@article{IsobeZN99, +author = {Shuji Isobe and Xiao Zhou and Takao Nishizeki}, +title = {A polynomial-time algorithm for finding total colorings of partial +$k$-trees}, +journal = ijfcs, volume = 10, pages = {171-194}, year = 1999} + +%It + +%Ita + +@article{ItaiR78, +author = {A. Itai and M. Rodeh}, +title = {Finding a Minimum Circuit in a Graph}, +journal = siamjc, volume = 7, year = 1978, pages = {413-423}} + +@article{ItaiPS94, +author = {A. Itai abd C. H. Papadimitriou and J. L. Szwartzfiter}, +title = {Hamiltonian paths in grid graphs}, +journal = siamjc, volume = 11, year = 1984, pages = {676-684}} + +@inproceedings{ItalianoMN89, +author = {G. F. Italiano and A. {Marchetti Spaccamela} and U. Nanni}, +title = {Dynamic data structures for series parallel digraphs}, +editor = {Frank K. H. A. Dehne and J\"{o}rg-R\"{u}diger Sach and Nicola Santoro}, +booktitle = wads89, pages = {352-372}, year = 1989, publisher = lncs382} + +%Ito + +@article{ItoNZ03, +author = {T. Ito and T. Nishizeki and X. Zhou}, +title = {Algorithms for multicolorings of partial $k$-trees}, +journal = {IEICE Transactions on Information and Systems}, volume = {E86-D}, year = 2003, pages = {191-200}} + +@article{ItoZN06, +author = {Takehiro Ito and Xiao Zhou and Takao Nishizeki}, +title = {Partitioning a graph of bounded tree-width to connected subgraphs of almost uniform size}, +journal = jda, volume = 4, year = 2006, pages = {142-154}} + +%Iy + +@article{IyerRV88, +author = {A. V. Iyer and H. D. Ratliff and G. Vijayan}, +title = {Optimal node ranking of trees}, +journal = ipl, volume = 28, year = 1988, pages = {225-229}} + +@article{IyerRV91, +author = {A. V. Iyer and H. D. Ratliff and G. Vijayan}, +title = {On an edge-ranking problem of trees and graphs}, +journal = dam, volume = 30, year = 1991, pages = {43-52}} + +%J + +%Ja + +%Jai + +@unpublished{JainC??, +author = {Amit Jain and N. Chandrasekharan}, +title = {An efficient parallel algorithm for min-cost flow on directed +series-parallel networks}, +note = {Manuscript}} + +%Jaj + +@book{Jaja92, +author = {Joseph J{\'{a}}J{\'{a}}}, +title = {An Introduction to Parallel Algorithms}, +year = 1992, publisher = {Addison-Wesley}} + +%Jak + +@article{JakobyLR06, +author = {Andreas Jakoby and Maciej Li\'{s}kiewicz and R\"{u}diger Reischuk}, +title = {Space efficient algorithms for directed series-parallel graphs}, +journal = ja, volume = 60, year = 2006, pages = {85-114}} + +%Jam + +@article{JamisonO89, +author = {B. Jamison and S. Olariu}, +title = {$P_4$-reducible graphs, a class of uniquely tree representable graphs}, +journal = sam, volume = 81, year = 1989, pages = {79-87}} + +@article{JamisonO89b, +author = {B. Jamison and S. Olariu}, +title = {On a Class of {$P_5$}-Free Graphs}, +journal = sam, volume = 81, year = 1989, pages = {33-39}} + +@article{JamisonO91, +author = {B. Jamison and S. Olariu}, +title = {On a unique tree representation for {$P_4$}-extendible graphs}, +journal = dam, volume = 34, year = 1991, pages = {151-164}} + +@article{JamisonO92, +author = {B. Jamison and S. Olariu}, +title = {A tree representation for {$P_4$}-sparse graphs}, +journal = dam, volume = 35, year = 1992, pages = {115-129}} + +@unpublished{JamisonO92a, +author = {B. Jamison and S. Olariu}, +title = {P-components and the Homogeneous Decomposition of Graphs}, +note = {Manuscript}, +year = {1992}} + +@article{JamisonO92b, +author = {B. Jamison and S. Olariu}, +title = {Recognizing $P_4$-sparse graphs in linear time}, +journal = siamjc, volume = 21, number = 2, year = 1992, pages = {381-406}} + +@inproceedings{JamisonO93, +author = {B. Jamison and S. Olariu}, +title = {On the homogeneous decomposition of graphs}, +editor = {Ernst W. Mayr}, +booktitle = wg92, year = 1993, publisher = lncs657, pages = {170-183}} + +%Jan + +%Jansen 1990 + +@techreport{Jansen90, +author = {Klaus Jansen}, +title = {An Assignment Problem for Hardware Design}, +type = {Arbeitsberichte}, +number = 27, year = 1990, +institution = {Universit\"{a}t Trier, Mathematik}} + +@techreport{Jansen90a, +author = {Klaus Jansen}, +title = {Interval Union of Graphs}, +type = {Arbeitsberichte}, +number = 27, year = 1990, +institution = {Universit\"{a}t Trier, Mathematik}} + +%Jansen 1993 + +@inproceedings{Jansen93, +author = {Klaus Jansen}, +title = {On scheduling problems restricted to interval orders}, +editor = {Ernst W. Mayr}, +booktitle = wg92, year = 1993, publisher = lncs657, pages = {27-36}} + +@inproceedings{JansenS93, +author = {Klaus Jansen and Petra Scheffler}, +title = {Generalized Coloring for Tree-like Graphs}, +editor = {Ernst W. Mayr}, +booktitle = wg92, year = 1993, publisher = lncs657, pages = {50-59}} + +%Jansen 1997 + +@article{JansenS97, +author = {Klaus Jansen and Petra Scheffler and Gerhard Woeginger}, +title = {The disjoint cliques problem}, +journal = {RAIRA Recherhe Operationelle}, volume = 31, year = 1997, pages = {45-66}} + +%Jansen 2006 + +@article{JansenKLS06, +author = {K. Jansen and M. Karpinski and A. Lingas and E. Seidel}, +title = {Polynomial time approximation schemes for max-bisection on planar and +geometric graphs}, +journal = siamjc, volume = 35, year = 2006, pages = {110-119}} + +%Jansen 2009 + +@mastersthesis{Jansen09, +author = {Bart Jansen}, +title = {Fixed parameter complexity of the weighted max leaf problem}, +year = 2009, +school = {Department of Computer Science, Utrecht University}} + +%Je + +%Jeg + +@article{JegouT03, +author = {Philippe J\'{e}gou and Cyril Terrioux}, +title = {Hybrid backtracking bounded by tree-decomposition of constraint networks}, +journal = ai, volume = 146, year = 2003, pages = {43-75}} + +@inproceedings{JegouNT05, +author = {Philippe J\'{e}gou and Samba Ndiaye and Cyril Terrioux}, +title = {Computing and Exploiting Tree-Decompositions for Solving Constraint Networks}, +booktitle = {Proceedings of the 11th International Conference on Principles and Practice of Constraint Programming, CP 2005}, +publisher = lncs3709, year = 2005, pages = {777-781}} + +%Jel + +@article{Jelinek10, +author = {V\'{\i}t Jel\'{\i}nek}, +title = {The rank-width of the square grid}, +journal = dam, volume = 158, year = 2010, pages = {841-850}} + +%Jen + +@book{Jensen01, +author = {F. V. Jensen}, +title = {Bayesian Networks and Decision Graphs}, +publisher = {Statistics for Engineering and Information Science, +Springer-Verlag}, +address = {New York}, +year = 2001} + +%Ji + +%Jin + +@article{JinL06, +author = {Zemin Jin and Xueliang Li}, +title= {On the $k$-path cover problem for cacti}, +journal = tcs, pages = {354-363}, year = 2006, volume = 355} + +%Jo + +%Joh + +@article{Johansson98, +author = {{\"{O}}jvind Johansson}, +title = {Clique-decomposition, {NLC}-decomposition, and modular +decomposition-relationships and results for random graphs}, +journal = cn, volume = 132, pages = {39-60}, year = 1998} + +@article{Johansson00, +author = {{\"{O}}jvind Johansson}, +title = {NLC$_2$-decomposition in polynomial time}, +journal = ijfcs, volume = 11, year = 2000, pages = {373-395}} + +%Johnson 1983 + +@article{Johnson83, +author = {D. S. Johnson}, +title = {The {NP}-completeness column: {An} ongoing guide}, +journal = ja, volume = 4, year = 1983, pages = {397-411}} + +%Johnson 1985 + +@article{Johnson85, +author = {David S. Johnson}, +title = {The {NP}-completeness Column: An Ongoing Guide}, +journal = ja, year = 1985, volume = 6, pages = {434-451}} + +%Johnson 1987 + +@article{Johnson87, +author = {David S. Johnson}, +title = {The {NP}-completeness Column: An Ongoing Guide}, +journal = ja, year = 1987, volume = 8, pages = {285-303}} + +@article{JohnsonP87, +author = {David S. Johnson and H. O. Pollak}, +title = {Hypergraph planarity and the complexity of drawing Venn diagrams}, +journal = jgt, volume = 11, year = 1987, pages = {309-326}} + +%Johnson 1988 + +@article{JohnsonYP88, +author = {David S. Johnson and Mihalis Yannakakis and +Christos H. Papadimitriou}, +title = {On generating all maximal independent sets}, +journal = ipl, year = 1988, volume = 27, pages = {119-123}} + +%Johnson 2001 + +@article{JohnsonRST01, +author = {T. Johnson and N. Robertson and P. D. Seymour and R. Thomas}, +title = {Directed tree-width}, +journal = jctb, volume = 82, year = 2001, pages = {138-154}} + +%Ju + +@article{JungckDD82, +author = {John R. Jungck and Gregg Dick and Amy Gleason Dick}, +title = {Computer-assisted sequencing, interval graphs, and molecular evolution}, +journal = {BioSystems}, volume = 15, year = 1982, pages = {259-273}} + +%K + +%Ka + +%Kab + +@inproceedings{Kabanets97, +author = {Valentine Kabanets}, +title = {Recognizability Equals Definability for Partial $k$-Paths}, +editor = {Pierpaolo Degano and Roberto Gorrieri and Alberto Marchetti-Spaccamela}, +booktitle = icalp97, year = 1997, publisher = lncs1256, pages = {805-815}} + +%Kai + +@article{Kaiser09, +author = {T. Kaiser}, +title = {Minors of simplicial complexes}, +journal = dam, volume = 157, year = 2009, pages = {2597-2602}} + +%Kaj + +@article{KajitaniIU86, +author = {Y. Kajitani and A. Ishizuka and S. Ueno}, +title = {Characterization of partial 3-trees in terms of three structures}, +journal = gc, volume = 2, year = 1986, pages = {233-246}} + +%Kal + +%Kall + +@inproceedings{Kaller95, +author = {Damon Kaller}, +title = {Definability equals recognizability of partial 3-trees}, +editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti-Spaccamela}, +booktitle = wg96, pages = {239-253}, year = 1997, publisher = lncs1197} + +@inproceedings{KallerGS95, +author = {Damon Kaller and A. Gupta and T. Shermer}, +title = {Regular-factors in the complement of partial $k$-trees}, +editor = {Selim G. Akl and Frank K. H. A. Dehne and J\"{o}rg-R\"{u}diger Sack and Nicola Santoro}, +booktitle = wads95, publisher = lncs955, pages = {403-414}, year = 1995} + +@inproceedings{KallerGS95a, +author = {Damon Kaller and A. Gupta and T. Shermer}, +title = {The $\chi_t$-coloring problem}, +editor = {Ernst W. Mayr and Claude Puech}, +booktitle = stacs95, publisher = lncs900, pages = {409-420}, year = 1995} + +@article{Kaller00, +author = {Damon Kaller}, +title = {Definability equals recognizability of partial 3-trees and +$k$-connected partial $k$-trees}, +journal = alg, volume = 27, year = 2000, pages = {348-381}} + +%Kalp + +@article{KalpakisDN03, +author = {K. Kalpakis and K. Dasgupta and P. Namjoshi}, +title = {Efficient algorithms for maximum lifetime data gathering +and aggregation in wireless sensor networks}, +journal = cnet, volume = 42, number = 6, year = 2003, pages = {697-716}} + +%Kam + +@article{MainskiLM09, +author = {Marcin Kami\'{n}ski and Vadim V. Lozin and Martin Milani\v{c}}, +title = {Recent developments on graphs of bounded clique-width}, +journal = dam, volume = 157, year = 2009, pages = {2747-2761}} + +@inproceedings{KammerT08, +author = {Frank Kammer and Torsten Tholey}, +title = {The complexity of minimum convex coloring}, +editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga}, +booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {16-27}} + +%Kan + +@article{KanevskyR91, +author = {A. Kanevsky and V. Ramachandran}, +title = {Improved algorithms for graph four-connectivity}, +journal = jcss, volume = 42, year = 1991, pages = {288-306}} + +@inproceedings{KanjPS04, +author = {Iyad A. Kanj and Michael J. Pelsmajer and Marcus Schaefer}, +title = {Parameterized algorithms for feedback vertex set}, +editor = {R. G. Downey and M. R. Fellows}, +booktitle = iwpec04, year = 2004, publisher = lncs3162, pages = {235-248}} + +@article{KannanW92, +author = {Sampath Kannan and Tandy Warnow}, +title = {Triangulating 3-colored graphs}, +journal = sjdm, volume = 5, year = 1992, pages = {249-258}} + +@article{KannanW94, +author = {Sampath Kannan and Tandy Warnow}, +title = {Inferring Evolutionary History from {DNA} sequences}, +journal = siamjc, volume = 23, year = 1994, pages = {713-737}} + +@article{KannanW97, +author = {Sampath Kannan and Tandy Warnow}, +title = {A fast algorithm for the computation and enumeration of perfect phylogenies}, +journal = siamjc, volume = 26, year = 1997, pages = {1749-1763}} + +@techreport{Kant91, +author = {Goos Kant}, +title = {Linear Planar Augmentation Algorithms for Outerplanar +Graphs}, +type = {Technical Report}, +number = {RUU-CS-91-47}, +institution = {Utrecht University}, +year = 1991} + +@inproceedings{Kant93, +author = {Goos Kant}, +title = {Hexagonal grid drawings}, +editor = {Ernst W. Mayr}, +booktitle = wg92, year = 1993, publisher = lncs657, pages = {263-276}} + +@phdthesis{Kant93a, +author = {Goos Kant}, +title = {Algorithms for Drawing Planar Graphs}, +school = {Utrecht University}, year = 1993} + +@article{Kant96, +author = {Goos Kant}, +title = {Augmenting Outerplanar Graphs}, +journal = ja, volume = 21, pages = {1-25}, year = 1996} + +@article{KantB97, +author = {Goos Kant and Hans L. Bodlaender}, +title = {Triangulating Planar Graphs While Minimizing the Maximum +Degree}, +journal = ic2, volume = 135, pages = {1-14}, year = 1997} + + +%Kap + +%Kaplan 1994 + +@inproceedings{KaplanST94, +author = {Haim Kaplan and Ron Shamir and Robert Endre Tarjan}, +title = {Tractability of parameterized completion problems on +chordal and interval graphs: Minimum Fill-in and Physical Mapping}, +booktitle = focs94, pages = {780-791}, year = 1994} + +%Kaplan 1996 + +@article{KaplanS96, +author = {Haim Kaplan and Ron Shamir}, +title = {Pathwidth, Bandwidth and Completion Problems to Proper Interval +Graphs with Small Cliques}, +journal = siamjc, volume = 25, pages = {540-561}, year = 1996} + +%Kaplan 1999 + +@article{KaplanST99, +author = {Haim Kaplan and Ron Shamir and Robert Endre Tarjan}, +title = {Tractability of parameterized completion problems on chordal, +strongly chordal, and proper interval graphs}, +journal = siamjc, volume = 28, year = 1999, pages = {1906-1922}} + +%Kaplan 2009 + +@inproceedings{KaplanN09, +author = {Haim Kaplan and Yahav Nussbaum}, +title = {Maximum flow in directed planar graphs with vertex capacities}, +editor = {Amos Fiat and Peter Sanders}, +booktitle = esa09, publisher = lncs5757, year = 2009, +pages = {397-407}} + +%Kar + +@inproceedings{Karp72, +author = {Richard M. Karp}, +title = {Reducibility among combinatorial problems}, +booktitle = {Complexity of Computer Computations}, +publisher = {Plenum Press}, year = 1972, +editor = {R. E. Miller and J. W. Thatcher}, +pages = {85 - 104}} + +@article{Karp75, +author = {Richard M. Karp}, +title = {On the complexity of combinatorial problems}, +journal = networks, year = 1975, volume = 5, pages = {45-68}} + +@article{KarpUW86, +author = {R. M. Karp and E. Upfal and A. Wigderson}, +title = {Constructing a maximum matching is in random {NC}}, +journal = comb, volume = 6, year = 1986, pages = {35-48}} + +@inproceedings{Karp93, +author = {Richard M. Karp}, +title = {Mapping the Genome: Some Combinatorial Problems Arising in +Molecular Biology}, +year = 1993, +booktitle = stoc93, pages = {278-285}, publisher = {ACM Press}, +address = {New York} +} + +@techreport{KarpinskiWZ97, +author = {Marek Karpinski and J\"{u}rgen Wirtgen and Alex Zelikovsky}, +title = {An approximation algorithm for the bandwidth problem on dense graphs}, +number = {TR97-017}, +type = {Electronic Colloquium on Computational Complexity Report}, +year = 1997} + +@article{Karonski82, +author = {M. Karonski}, +title = {On the number of $k$-trees in a random graph}, +journal = pms, volume = 2, year = 1982, pages = {197-205}, +something = {Fasc. 2}} + +%Kas + +@article{KashemZN00, +author = {Md. Abul Kashem and Xiao Zhou and Takao Nishizeki}, +title = {Algorithms for generalized vertex-rankings of partial $k$-trees}, +journal = tcs, volume = 240, year = 2000, pages = {407-427}} + +@inproceedings{KashiwabaraF79, +author = {T. Kashiwabara and T. Fujisawa}, +title = {An {NP}-complete problem on interval graphs}, +booktitle = {Proc. IEEE Symp. on Circuits and Systems}, +year = 1979, pages = {82-83}} + +%Kav + +@techreport{KavvadiasPSZ94, +author = {D. Kavvadias and G. Pantziou and P. Spirakis and C. Zaroliagis}, +title = {Hammock-on-Ears Decomposition: A Technique for the Efficient Parallel +Solution of Shortest Paths and Other Problems}, +number = {MPI-I-94-131}, +year = 1994, +institution = {Max-Planck-Institut f\"{u}r Informatik}, +address = {Saarbr\"{u}cken, Germany}} + +%Kaw + +@inproceedings{KawarabayashiM08, +author = {Ken-ichi Kawarabayashi and Bojan Mohar}, +title = {Graph and map isomorphism and all polyhedral embeddings in linear time}, +booktitle = stoc08, year = 2008, pages = {471-480}} + +@article{KawarabayashiT09, +author = {Ken-ichi Kawarabayashi and Carsten Thomassen}, +title = {Decomposing a planar graph into an independent set and a forest}, +journal = jctb, volume = 99, year = 2009, pages = {674-684}} + +%Kay + +@article{Kaye00, +author = {Richard Kaye}, +title = {Minesweeper is {NP}-complete}, +journal = {The Mathematical Intelligencer}, volume = 22, year = 2000, pages = {9-15}} + +%Ke + +@article{KeijsperPS06, +author = {J. C. M. Keijsper and R. A. Pendavingh and L. Stougie}, +title = {A linear programming formulation of {M}ader's edge-disjoint paths problem}, +journal = jctb, volume = 96, pages = {159-163}, year = 2006} + +@article{Keil85, +author = {J. Mark Keil}, +title = {Finding {H}amiltonian Circuits in Interval Graphs}, +journal = ipl, year = 1985, volume = 20, pages = {201-206} +} + +@article{Keil86, +author = {J. Mark Keil}, +title = {Total domination in interval graphs}, +journal = ipl, year = 1986, volume = 22, pages = {171-174}} + +%Kh + +@article{Khuller90, +author = {Samir Khuller}, +title = {Extending planar graph algorithms to {$K_{3,3}$}-free +graphs}, +journal = ic2, volume = 84, year = 1990 , pages = {13-25}} + +@article{Khuller90a, +author = {Samir Khuller}, +title = {Coloring algorithms for {$K_5$}-minor free graphs}, +journal = ipl, volume = 34, year = 1990, pages = {203-208}} + +@article{KhullerS91, +author = {Samir Khuller and Baruch Schieber}, +title = {Efficient parallel algorithms for testing $k$-connectivity +and finding disjoint $s$-$t$ paths in graphs}, +journal = siamjc, volume = 20, year = 1991, pages = {353-375}} + +%Ki + +%Kie + +@article{KiersteadT94, +author = {H. A. Kierstead and W. T. Trotter}, +title = {Planar graph coloring with an uncooperative partner}, +year=1994, +journal = jgt, volume = 18, number = 6, pages = {569-584}} + +@article{Kierstead00, +author = {H. A. Kierstead}, +title = {A simple competitive graph coloring algorithm}, +journal = jctb, volume = 78, pages = {57-68}, year = 2000} + +@article{KiersteadT01, +author = {H. A. Kierstead and W. T. Trotter}, +title = {Competive colorings of oriented graphs}, +journal = ejc, volume = 8, number = 2, year = 2001, pages={R12}} + +%Kik + +@article{KikunoYK83, +author = {T. Kikuno and N. Yoshida and Y. Kakuda}, +title = {A Linear Algorithm for the Domination Number of a Series-Parallel +Graph}, +journal = dam, volume = 5, year = 1983, pages = {299-311}} + +%Kim + +@article{Kim90, +author = {S. K. Kim}, +title = {A parallel algorithm for finding a maximum clique in a set of +circular arcs of a circle}, +journal = ipl, volume = 34, year = 1990, pages = {235-242}} + +@article{Kim90a, +author = {H. Kim}, +title = {Finding a maximum independent set in a permutation graph}, +journal = ipl, volume = 36, year = 1990, pages = {19-24}} + +%Kin + +@article{KindervaterLS89, +author = {Gerard A. P. Kindervater and Jan Karel Lenstra and David B. +Schmoys}, +title = {The parallel complexity of {TSP} heuristics}, +journal = ja, volume = 10, year = 1989, pages = {249-270}} + +%Kinnersley 1989 + +@phdthesis{Kinnersley89, +author = {Nancy G. Kinnersley}, +title = {Obstruction Set Isolation for Layout Permutation Problems}, +school = {Washington State University}, +year = 1989, month = {5}, pages = {i-x,1-217}} + +%Kinnersley 1992 + +@article{Kinnersley92, +author = {Nancy G. Kinnersley}, +title = {The vertex separation number of a graph equals its path width}, +journal = ipl, volume = 42, pages = {345-350}, year = 1992} + +%Kinnersley 1994 + +@techreport{Kinnersley94, +author = {Nancy G. Kinnersley}, +title = {Construction obstruction set isolation for min cut linear +arrangement}, +type = {Technical Report}, +number = {94-1}, +institution = {Department of Computer Science, University of Kansas}, +address = {Lawrence, Kansas, USA}, +year = 1994} + +@article{KinnersleyK94, +author = {Nancy G. Kinnersley and William M. Kinnersley}, +title = {Tree automata for cutwidth recognition}, +journal = cn, volume = 104, year = 1994, pages = {129-142}} + +@article{KinnersleyK94a, +author = {Nancy G. Kinnersley and William M. Kinnersley}, +title = {An efficient polynomial-time algorithm for three-track gate matrix layout}, +journal = tcj, volume = 37, year = 1994, pages = {449- 462}} + +@article{KinnersleyL94, +author = {Nancy G. Kinnersley and Michael A. Langston}, +title = {Obstruction Set Isolation for the Gate Matrix Layout Problem}, +journal = dam, volume = 54, year = 1994, pages = {169-213}} + +%Kir + +@article{Kirchhoff1847, +author = {G. Kirchhoff}, +title = {\"{U}ber die {A}ufl\"{o}sung der {G}leichugen, auf welche man bei der +{U}ntersuchung der Linearen {V}erteilung Galvanischer {S}tr\"{o}me gef\"{u}hrt wird}, +journal = {Ann. Phys. Chem.}, volume = 71, year = 1847, pages = {497-508}} + +@article{KirousisP85, +author = {Lefteris M. Kirousis and Christos H. Papadimitriou}, +title = {Interval graphs and searching}, +journal = dm, volume = 55, year = 1985, pages = {181-184}} + +@article{KirousisP86, +author = {Lefteris M. Kirousis and Christos H. Papadimitriou}, +title = {Searching and pebbling}, +journal = tcs, volume = 47, year = 1986, pages = {205-218}} + +@unpublished{KirousisT94, +author = {Lefteris M. Kirousis and Dimitrios M. Thilikos}, +title = {The linkage of a graph}, +note = {Manuscript}, +year = 1994} + +%Kj + +@techreport{Kjaerulff90, +author = {U. Kj{\ae}rulff}, +title = {Triangulation of Graphs --- Algorithms Giving Small Total State Space}, +type = {Research Report}, number = {R-90-09}, +institution = {Dept. of Mathematics and Computer Science, Aalborg University}, +year = 1990} + +@article{Kjaerulff92, +author = {U. Kj{\ae}rulff}, +title = {Optimal decomposition of probabilistic networks by simulated annealing}, +journal = {Statistics and Computing}, volume = 2, year = 1992, pages = {2-17}} + +%Kl + +%Kla + +@article{KlaweCP82, +author = {M. M. Klawe and Derek G. Corneil and Andrzej Proskurowski}, +title = {Isomorphism testing in hookup classes}, +journal = sjadm, volume = 3, pages = {260-274}, year = 1982 } + +%Kle + +@inproceedings{Klein88, +author = {Philip N. Klein}, +title = {Efficient parallel algorithms for chordal graphs}, +booktitle = focs88, pages = {150-161}, year = 1988 } + +@article{KleinS90, +author = {Philip Klein and Clifford Stein}, +title = {A parallel algorithm for eliminating cycles in undirected +graphs}, +journal = ipl, volume = 34, year = 1990, pages = {307-312}} + +@inproceedings{KleinARR90, +author = {Philip Klein and Ajit Agrawal and R. Ravi and Satish Rao}, +title = {Approximation through multicommodity flow}, +booktitle = focs90, year = 1990, pages = {726-737}} + +@inproceedings{Kleinberg00, +author = {Jon Kleinberg}, +title = {The small-world phenomenon: An algorithmic perspective}, +booktitle = stoc00, +pages = {163-170}, year = 2000} + +@book{KleinbergT05, +author = {Jon Kleinberg and \'{E}va Tardos}, +title = {Algorithm Design}, +publisher = {Addison-Wesley}, +address = {Boston}, +year = 2005} + +@article{KleitmanV90, +author = {Daniel J. Kleitman and Rakesh V. Vohra}, +title = {Computing the bandwidth of interval graphs}, +journal = sjdm, volume = 3, year = 1990, pages = {373-375}} + +%Klo + +%Kloks 1992 + +@inproceedings{KloksB92, +author = {Ton Kloks and Hans Bodlaender}, +title = {Approximating Treewidth and Pathwidth of Some Classes of Perfect Graphs}, +editor = {Toshihide Ibaraki and Yasuyoshi Inagaki and Kazuo Iwama and Takao Nishizeki and Masafumi Yamashita}, +booktitle = isaac92, year = 1992, publisher = lncs650, pages = {116-125}} + +%Kloks 1993 + +@phdthesis{Kloks93+, +author = {Ton Kloks}, +title = {Treewidth}, +school = {Utrecht University, Utrecht, The Netherlands}, +year = 1993} + +@book{Kloks93, +author = {Ton Kloks}, +title = {Treewidth. Computations and Approximations}, +publisher = {Springer-Verlag}, +address = {Berlin}, +series = {Lecture Notes in Computer Science, Vol. 842}, +year = 1994} + +@techreport{KloksKS93, +author = {Ton Kloks and Dieter Kratsch and J. Spinrad}, +title = {Treewidth and pathwidth of cocomparability graphs of bounded +dimension}, +type = {Computing Science Notes}, number = {93-46}, +institution = {Eindhoven University of Technology}, year = 1993} + +%Kloks 1994 + +@article{Kloks94, +author = {Ton Kloks}, +title = {{$K_{1,3}$}-free and {$W_4$}-free graphs}, +journal = ipl, volume = 60, year = 1996, pages = {221-223}} + +@techreport{KloksK94, +author = {Ton Kloks and Dieter Kratsch}, +title = {Computing a perfect edge without vertex elimination ordering of a +chordal bipartite graph}, +type = {Computing Science Notes}, number = {94-41}, +institution = {Eindhoven University of Technology}, year = 1994} + +@techreport{KloksKM94, +author = {Ton Kloks and Dieter Kratsch and Haiko M\"{u}ller}, +title = {Dominoes}, +type = {Computing Science Notes}, number = {94-12}, +institution = {Eindhoven University of Technology}, year = 1994} + +%Kloks 1995 + +@article{KloksK95, +author = {Ton Kloks and Dieter Kratsch}, +title = {Treewidth of chordal bipartite graphs}, +journal = ja, volume = 19, pages = {266-281}, year = 1995} + +%Kloks 1996 + +@article{Kloks96, +author = {Ton Kloks}, +title = {Treewidth of circle graphs}, +journal = ijfcs, volume = 7, year = 1996, pages = {111-120}} + +@misc{Kloks, +author = {Ton Kloks}, +note = {Personal communication}} + +@article{Kloks96a, +author = {Ton Kloks}, +title = {{$K_{1,3}$}-free and {$W_4$}-free graphs}, +journal = ipl, volume = 60, year = 1996, pages = {221-223}} + +@techreport{KloksKM96, +author = {Ton Kloks and Dieter Kratsch and Haiko M\"{u}ller}, +title = {Asteroidal sets in graphs}, +type = {Memorandum}, number = {1347}, +institution = {Dep. Appl. Math, University of Twente}, +address = {Enschede, The Netherlands}, +year = 1996} + +%Kloks 1997 + +@article{KloksKS97, +author = {Ton Kloks and Dieter Kratsch and Jeremy Spinrad}, +title = {On treewidth and minimum fill-in of asteroidal triple-free graphs}, +journal = tcs, volume = 175, pages = {309-335}, year = 1997} + +@inproceedings{KloksKM97, +author = {Ton Kloks and Dieter Kratsch and Haiko M\"{u}ller}, +title = {Asteroidal sets in graphs}, +editor = {Rolf H. M\"{o}hring}, +booktitle = wg97, publisher = lncs1335, year = 1997, pages = {229-241}} + +%Kloks 1998 + +@article{KloksK98, +author = {T. Kloks and D. Kratsch}, +title = {Listing all minimal separators of a graph}, +journal = siamjc, volume = 27, number = 3, pages = {605-613},year = 1998} + +@article{KloksKW98, +author = {Ton Kloks and Dieter Kratsch and C. K. Wong}, +title = {Minimum fill-in of circle and circular-arc graphs}, +journal = ja, volume = 28, pages ={272-289}, year = 1998} + +@article{KloksMW98, +author = {Ton Kloks and Haiko M{\"u}ller and C. K. Wong}, +title = {Vertex ranking of asteroid triple-free graphs}, +journal = ipl, volume = 68, year = 1998, pages = {201-206}} + +%Kloks 1999 + +@article{KloksKM99, +author = {Ton Kloks and Dieter Kratsch and Haiko M\"{u}ller}, +title = {Approximating the Bandwidth for Asteroidal Triple-free Graphs}, +journal = ja, volume = 32, pages = {41-57}, year = 1999} + +%Kloks 2001 + +@article{KloksKM01, +author = {Ton Kloks and Dieter Kratsch and Haiko M\"{u}ller}, +title = {On the structure of graphs with bounded asteroidal number}, +journal = {Graphs. Combin.}, year = 2001, volume = 17, pages = {295-306}} + +@article{KloksT01, +author = {Ton Kloks and Richard B. Tan}, +title = {Bandwidth and topological bandwidth of graphs with few $P_4$'s}, +journal = dam, volume = 115, year = 2001, pages = {117-133}} + +@misc{KloksLL01, +author = {Ton Kloks and C. M. Lee and Jim Liu}, +title = {Feedback vertex sets and disjoint cycles in planar (di)graphs}, +note = {Optimization Online}, year = 2001} + +%Kloks 2002 + +@inproceedings{KloksLL02, +author = {Ton Kloks and C. M. Lee and Jim Liu}, +title = {New algorithms for $k$-face cover, $k$-feedback vertex set, and $k$-disjoint cycles on plane and planar graphs}, +editor = {Lud\u{e}k Ku\u{c}era}, +booktitle = wg02, publisher = lncs2573, year = 2002, pages = {282-295}} + +%Kloks 2004 + +@article{KloksKM05, +author = {Ton Kloks and Jan Kratochv{\'{\i}}l and Haiko M\"{u}ller}, +title = {Computing the branchwidth of interval graphs}, +journal = dam, volume = 145, pages = {266-275}, year = 2005} + +%Kloks 2006 + +@article{KloksKLL06, +author = {Ton Kloks and Dieter Kratsch and Chuan-Min Lee and Jiping Liu}, +title = {Improved bottleneck domination algorithms}, +journal = dam, volume = 154, pages = {1578-1592}, year = 2006} + +%Kn + +%Kna + +@inproceedings{KnauerS06, +author = {Christiaan Knauer and Andreas Spillner}, +title = {A fixed-parameter algorithm for the minimum weight triangulation problem based on small graph separators}, +editor = {Fedor V. Fomin}, +booktitle = wg06, year = 2006, pages = {1-14}, publisher = lncs4271} + +%Kne + + + +@inproceedings{KneisMRR05, +author = {Joachim Kneis and Daniel M\"{o}lle and Stefan Richter and Peter Rossmanith}, +title = {On the parameterized complexity of exact satisfiability problems}, +editor = {Joanna Jedrzejowicz and Andrzej Szepietowski}, +booktitle = mfcs05, publisher = lncs3618, year = 2005, pages = {568-579}} + +@article{KneisMRR06, +author = {Joachim Kneis and Daniel M\"{o}lle and Stefan Richter and Peter Rossmanith}, +title = {Parameterized power domination complexity}, +journal = ipl, volume = 98, year = 2006, pages = {145-149}} + +@inproceedings{KneisMRR06a, +author = {Joachim Kneis and Daniel M{\"o}lle and Stefan Richter and Peter Rossmanith}, +title = {Divide-and-Color}, +editor = {Fedor V. Fomin}, +booktitle = wg06, publisher = lncs4271, year = 2006, pages = {58-67}} + +@inproceedings{KneisLR08, +author = {Joachim Kneis and Alexander Langer and Peter Rossmanith}, +title = {A new algorithm for finding trees with many leaves}, +editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga}, +booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {270-281}} + +@inproceedings{KneisLR09, +author = {Joachim Kneis and Alexander Langer and Peter Rossmanith}, +title = {A fine-grained analysis of a simple independent set algorithm}, +publisher = {LIPIcs, volume 4}, +booktitle = fsttcs09, year = 2009, pages = {287-298}} + +%Ko + +%Kob + +@article{Kobayashi09, +author = {Yusuke Kobayashi}, +title = {Induced disjoint paths problem in a planar graph}, +journal = dam, volume = 157, year = 2009, pages = {3231-3238}} + +@article{KoblerR03, +author = {Daniel Kobler and Udi Rotics}, +title = {Edge dominating set and colorings on graphs with fixed clique-width}, +journal = dam, volume = 126, pages = {197-221}, year = 2003} + +%Koe + +@book{Koenig36, +author = {D. K{\"{o}}nig}, +title = {Theorie der endlichen und unendlichen {G}raphen}, +year = 1936, publisher = {Akademische Verlagsgesellschaft}, +address = {Leipzig}} + +%Koh + +@article{KohlSTV05, +author = {A. Kohl and J. Schreyer and Z. Tuza and M. Voigt}, +title = {List versions of {$L(d,s)$}-labelings}, +journal = tcs, volume = 349, year = 2005, pages = {92-98}} + +%Koi + +@unpublished{KoivistoP10, +author = {Mikko Koivisto and Pekka Parviainen}, +title = {A space-time tradeoff for permutation problems}, +year = 2010, +note = {To appear in Proceedings SODA 2010}} + +%Kor + +@techreport{KorachO89, +author = {Ephraim Korach and Z. Ostfeld}, +title = {Recognition of {DFS} Trees: Sequential and Parallel +Algorithms with Refined Verifications}, +number = 582, type = {Technical Report}, +year = 1989, institution = {Technion, Haifa, Israel}} + +@techreport{KorachO90, +author = {Ephraim Korach and Z. Ostfeld}, +title = {On the Existence of Special {DFS}-trees}, +number = 612, type = {Technical Report}, +year = 1990, institution = {Technion, Haifa, Israel}} + +@unpublished{KorachS90, +author = {Ephraim Korach and Nir Solel}, +title = {Linear Time Algorithm for Minimum Weight {S}teiner Tree in Graphs with Bounded Treewidth}, +year = 1990, +note = {Manuscript}} + +@article{KorachS93, +author = {Ephraim Korach and Nir Solel}, +title = {Tree-width, Path-width and Cutwidth}, +journal = dam, volume = 43, pages = {97-101}, year = 1993} + +@article{KorachT93, +author = {Ephraim Korach and A. Tal}, +title = {Generalized vertex disjoint paths in series-parallel graphs}, +journal = dam, volume = 41, year = 1993, pages = {147-164}} + +@article{KornaiT92, +author = {Andr/'{a}s Kornai and Zsolt Tuza}, +title = {Narrowness, Pathwidth, and their Application in Natural Language +Processing}, +journal = dam, volume = 36, year = 1992, pages = {87-92}} + +@phdthesis{deKort92, +author = {Jeroen {de Kort}}, +title = {Edge-disjointness in Combinatorial Optimization}, +school = {University of Amsterdam}, +year = 1992} + +@article{KorteM89, +author = {Norbert Korte and Rolf H. M{\"{o}}hring}, +title = {An incremental linear-time algorithm for recognizing interval +graphs}, +journal = siamjc, volume = 18, year = 1989, pages = {68-81}} + +%Kos + +%Koster 1999 + +@phdthesis{Koster99, +author = {Arie M. C. A. Koster}, +title = {Frequency Assignment - Models and Algorithms}, +year = 1999, +school = {Univ. Maastricht}, +address = {Maastricht, The Netherlands}} + +@techreport{KosterHK99, +author = {Arie M. C. A. Koster and Stan P. M. van Hoesel and Antoon W. J. Kolen}, +title = {Solving frequency assignment problems via tree-decomposition}, +institution = {Faculty of Economics and Business Administration, +Universiteit Maastricht}, +address = {Maastricht, The Netherlands}, +number = {RM/99/011}, year = 1999} + +%Koster 2001 + +@inproceedings{KosterBH01, +author = {Arie M. C. A. Koster and Hans L. Bodlaender and Stan P. M. van Hoesel}, +title = {Treewidth: Computational Experiments}, +booktitle = {Electronic Notes in Discrete Mathematics}, +volume = 8, +pages = {54-57}, +publisher = {Elsevier Science Publishers}, +editor = {Hajo Broersma and Ulrich Faigle and Johann Hurink and Stefan Pickl}, +year = 2001} + +%Koster 2002 + +@article{KosterHK02, +author = {Arie M. C. A. Koster and Stan P. M. van Hoesel and Antoon W. J. Kolen}, +title = {Solving partial constraint satisfaction problems with tree decomposition}, +journal = networks, volume = 40, number = 3, year = 2002, pages = {170-180}} + +%Koster 2004 + +@techreport{KosterWB04, +author = {Arie M. C. A. Koster and Thomas Wolle and Hans L. Bodlaender}, +title = {Degree-Based Treewidth Lower Bounds}, +institution = {Institute for Information and Computing +Sciences, Utrecht University}, +number = {UU-CS-2004-050}, +year = {2004}, +address = {Utrecht, The Netherlands}} + +%Koster 2005 + +@inproceedings{KosterWB05, +author = {Arie M. C. A. Koster and Thomas Wolle and Hans L. Bodlaender}, +title = {Degree-based treewidth lower bounds}, +editor = {Sotiris E. Nikoletseas}, +booktitle = wea05, publisher = lncs3503, year = 2005, pages = {101-112}} + +%Koster 2006 + +@unpublished{KosterMvH06, +author = {Arie M. C. A. Koster and Bert Marchal and C. P. M. van Hoesel}, +title = {Local search algorithms for treewidth}, +note = {Work in progress}, year = 2006} + +%Kr + +%Kra + +%Kram + +@article{KramerK07, +author = {Florica Kramer and Horst Kramer}, +title = {A survey on the distance-colouring of graphs}, +journal = dm, volume = 308, year = 2007, pages = {422-426}} + +%Krat + +@article{KratochvilN89, +author = {Jan Kratochv{\'{\i}}l and Jaroslav Ne\~{s}et\~{r}il}, +title = {{NP}-hardness results for intersection graphs}, +journal = {Comment. Math. Univ. Carolinae}, volume = 30, number = 4, year = 1989, pages = {761-773}} + +@article{KratochvilN90, +author = {Jan Kratochv{\'{\i}}l and Jaroslav Ne\~{s}et\~{r}il}, +title = {{\sc independent set} and {\sc clique} problems in intersection-defined classes of graphs}, +journal = {Comment. Math. Univ. Carolinae}, volume = 31, number = 1, year = 1990, pages = {85-93}} + +@inproceedings{KratochvilT98, +author = {Jan Kratochv{\'{\i}}l and Zsolt Tusa}, +title = {Rankings of directed graphs}, +editor = {Juraj Hromkovic and Ondrej S\'{y}kora}, +booktitle = wg98, publisher = lncs1517, year = 1998, pages = {114-123}} + +%Kratsch 1987 + +@article{Kratsch87, +author = {Dieter Kratsch}, +title = {Finding the Minimum Bandwidth of an Interval Graph}, +journal = ic2, volume = 74, year = 1987, pages = {140-158}} + +%Kratsch 1990 + +@article{Kratsch90, +author = {Dieter Kratsch}, +title = {Finding dominating cliques efficiently, in strongly chordal graphs +and undirected path graphs}, +journal = dm, volume = 86, year = 1990, pages = {225-238}} + +@techreport{Kratsch90a, +author = {Dieter Kratsch}, +title = {Cardinality {S}teiner Tree and Connected Dominating Set for +Undirected Path Graphs}, +institution = {Friedrich Schiller Universit\"{a}t Jena, GDR}, +year = 1990, number = {N/90/91}} + +@unpublished{KratschH90, +author = {Dieter Kratsch and L. A. Hemachandra}, +title = {On the Complexity of Graph Reconstruction}, +year = 1990, note = {Manuscript}} + +%Kratsch 2003 + +@inproceedings{KratschS03, +author = {Dieter Kratsch and Jeremy Spinrad}, +title = {Between {$O(nm)$} and {$O(n^\alpha)$}}, +booktitle = soda03, pages = {709-716}, year = 2003} + +%Kratsch 2004 + +@misc{Kratsch04, +author = {Dieter Kratsch}, +note = {Personal communication}, year = 2004} + +%Kratsch 2006 + +@inproceedings{KratschL06, +author = {Dieter Kratsch and Mathieu Liedloff}, +title = {An exact algorithm for the minimum dominating clique problem}, +editor = {Hans L. Bodlaender and Michael A. Langston}, +booktitle = iwpec06, publisher = lncs4169, year = 2006, pages = {128-139}} + +@article{KratschS06, +author = {Dieter Kratsch and Jeremy Spinrad}, +title = {Minimal fill in {$O(n^{2.69})$} time}, +journal = dm, volume = 206, year = 2006, pages = {366-371}} + +%Kratsch 2007, + +@article{KratschL07, +author = {Dieter Kratsch and Mathieu Liedloff}, +title = {An exact algorithm for the minimum dominating clique problem}, +journal = tcs, volume = 385, year = 2007, pages = {226-240}} + +%Kratsch 2008 + +@article{KratschMT08, +author = {Dieter Kratsch and Haiko M\"{u}ller and Ioan Todinca}, +title = {Feedback vertex set on {AT}-free graphs}, +journal = dam, volume = 156, year = 2008, pages = {1936-1947}} + +%Kratsch 2009 + +@inproceedings{Kratsch09, +author = {Stephan Kratsch}, +title = {Polynomial kernelizations for {MIN F$^+\Pi_1$} and {MAX NP}}, +editor = {Susanne Albers and Jean-Yves Marion}, +series = {Dagstuhl Seminar Proceedings}, +publisher = {Leibniz-Zentrum f\"{u}r Informatik}, +address = {Schloss Dagstuhl, Germany}, +volume = {09001}, +booktitle = stacs09, pages = {601-612}, year = 2009} + +@article{KratschM09, +author = {Dieter Kratsch and Haiko M\"{u}ller}, +title = {On a property of minimal triangulations}, +journal = dm, volume = 309, year = 2009, pages = {1724-1729}} + +@unpublished{KratschW09, +author = {Stephan Kratsch and Magnus Wahlstr\"{o}m}, +title = {Two edge modification problems without polynomial kernels}, +year = 2009, +note = {In Proceedings IWPEC 2009}} + +%Kre + +@unpublished{KreidlerS96, +author = {Martin Kreidler and Detlef Seese}, +title = {Monadic {NP} and built-in Trees}, +note = {Manuscript}, year = 1996} + +@article{Krentel88, +author = {M. W. Krentel}, +title = {The complexity of optimization problems}, +journal = jcss, volume = 36, year = 1988, pages = {490-509}} + +@article{Kreweras72, +author = {G. Kreweras}, +title = {Sur les partition non crois\'ees d'un circle}, +year = 1972, +journal = dm, volume = 1, number = 4, pages = {333 - 350}} + +%Kru + +@article{KruskalRS90, +author = {Clyde P. Kruskal and Larry Rudolph and Marc Snir}, +title = {Efficient Parallel Algorithms for Graph Problems}, +journal = alg, volume = 5, year = 1990, pages = {43-64}} + +%Ku + +%Kun + +@article{KundgrenP08, +author = {Andr\'{e} K\"{u}ndgren and Michael J. Pelsmajer}, +title = {Nonrepetitive colorings of graphs of bounded tree-width}, +journal = dm, volume = 308, year = 2008, pages = {4473-4478}} + +%Kuo + +@article{KuoY04, +author = {David Kuo and Jing-Ho Yan}, +title = {On {$L(2,1)$}-labelings of {C}artesian products of paths and cycles}, +journal = dm, volume = 283, year = 2004, pages = {136-144}} + +%Kus + +@article{KuskeL05, +author = {D. Kuske and M. Lohrey}, +title = {Logical aspects of {C}ayley-graphs: The group case}, +journal = apal, volume = 131, year = 2005, pages = {263-286}} + +%Kw + +@inproceedings{Kwisthout08, +author = {Johan H. P. Kwisthout}, +title = {Complexity Results for Enumerating {MPE} and Partial {MAP}}, +editor = {M. Jaeger and T. Nielsen}, +booktitle = {Proceedings of the 4th European Workshop on Probabilistic Graphical Models, PGM 2008}, +year = 2008, pages = {161-168}} + +@phdthesis{Kwisthout09, +author = {Johan H. P. Kwisthout}, +title = {The Computational Complexity of Probabilistic Networks}, +school = {Utrecht University}, +address = {Utrecht, the Netherlands}, +year = 2009} + +%L + +%La + +%Lag + +%Lagergren 1990 + +@inproceedings{Lagergren90, +author = {Jens Lagergren}, +title = {Efficient Parallel Algorithms for Tree-Decomposition and Related +Problems}, +year = 1990, booktitle = focs90, pages = {173-182}} + +%Lagergren 1991 + +@phdthesis{Lagergren91, +author = {Jens Lagergren}, +title = {Algorithms and Minimal Forbidden Minors for Tree-decomposable +Graphs}, +school = {Royal Institute of Technology, Stockholm, Sweden}, +year = 1991 } + +@inproceedings{LagergrenA91, +author = {Jens Lagergren and Stefan Arnborg}, +title = {Finding minimal forbidden minors using a finite congruence}, +editor = {Javier Leach Albert and Burkhard Monien and Mario Rodr\'{\i}guez-Artalejo}, +booktitle = icalp91, publisher = lncs510, year = 1991, pages = {532-543}} + +%Lagergren 1993 + +@inproceedings{Lagergren93, +author = {Jens Lagergren}, +title = {An uppern bound on the size of an obstruction}, +booktitle = {Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint +Summer Research Conference, Seattle WA, June 1991}, +publisher = {American Math. Soc.}, +address = {Providence, RI}, +editor = {Neil Robertson and Paul Seymour}, +note = {Contemp. Math. 147.}, +pages = {601-621}, +year = 1993} + +@article{Lagergren93a, +author = {Jens Lagergren}, +title = {An upper bound on the size of a minimal forbidden minor}, +journal = {AMS Contemporary Mathematics series}, volume = 147, year = 1993, pages = {601-621}} + +%Lagergren 1994 + +@article{Lagergren94, +author = {Jens Lagergren}, +title = {The nonexistence of reduction rules giving an embedding into a $k$-tree}, +journal = dam, volume = 54, pages = {219-223}, year = 1994} + +%Lagergren 1995 + +@unpublished{Lagergren95, +author = {Jens Lagergren}, +title = {Upper Bounds on the Size of Obstructions and Intertwines}, +year = 1995, note = {Manuscript}} + +%Lagergren 1996 + +@article{Lagergren96, +author = {Jens Lagergren}, +title = {Efficient parallel algorithms for graphs of bounded tree-width}, +journal = ja, volume = 20, pages = {20-44}, year = 1996} + +%Lai + +@article{Laing07, +author = {Kofi A. Laing}, +title = {Name-independent compact routing in trees}, +journal = ipl, volume = 103, year = 2007, pages = {57-60}} + +%Lam + +@article{LamY98, +author = {T. W. Lam and F. L. Yue}, +title = {Edge ranking of graphs is hard}, +journal = dam, volume = 85, pages = {71-86}, year = 1998} + +%Lan + +@book{LandoZ2004, +author = {Sergei K. Lando and Alexander K. Zvonkin}, +title = {Graphs on Surfaces and Their Applications}, +year = 2004, +publisher = {Springer-Verlag}, +address = {Heidelberg}} + +@techreport{Langston90, +author = {Michael A. Langston}, +title = {Fast Search Algorithms for Layout Permutation Problems}, +institution = {University of Tennessee}, +number = {CS-90-107}, month = {5}, year = 1990} + +@inproceedings{Langston93, +author = {Michael A. Langston}, +title = {An obstruction-based approach to layout optimization}, +booktitle = {Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint +Summer Research Conference, Seattle WA, June 1991}, +publisher = {American Math. Soc.}, +address = {Providence, RI}, +editor = {Neil Robertson and Paul Seymour}, +note = {Contemp. Math. 147.}, +pages = {623 - 629}, +year = 1993} + +%Lap + +@inproceedings{Lapoire98, +author = {D. Lapoire}, +title = {Recognizability equals definability, for every set of graphs of bounded tree-width}, +booktitle = stacs98, pages = {618-628}, publisher=lncs1373, year = 1998} + +%Lar + +@article{LarranagaKPM97, +author = {Pedro {Larra\~{n}aga} and Cindy M. H. Kuijpers and Mikel Poza and Roberto H. Murga}, +title = {Decomposing {B}ayesian networks: triangulation of the moral graph with genetic algorithms}, +journal = {Statistics and Computing}, volume = 7, number = 1, year = 1997, pages = {19-34}} + +%Las + +@techreport{LaskarP83, +author = {R. Laskar and J. Pfaff}, +title = {Domination and irredundance in graphs}, +number = 434, type = {Technical Report}, institution = {Clemson University, +Dept. of Math. Sc.}, year = 1983} + +@article{LaskarPHH84, +author = {R. Laskar and J. Pfaff and S. M. Hedetniemi and S. T. Hedetniemi}, +title = {On the Algorithmic Complexity of Total Domination}, +journal = sjadm, volume = 5, year = 1984, pages = {420-425}} + +%Lau + +@article{LauritzenS88, +author = {S. J. Lauritzen and D. J. Spiegelhalter}, +title = {Local computations with probabilities on graphical structures and their application to expert systems}, +journal = {The Journal of the Royal Statistical Society. Series B (Methodological)}, volume = 50, year = 1988, pages = {157-224}} + +@techreport{Lautemann87, +author = {Clemens Lautemann}, +title = {Efficient Algorithms on Graphs Represented by Decomposition Trees}, +number = {6/87}, +year = 1987, +institution = {Fachbereich Mathematik/Informatik, Universit\"{a}t Bremen} +} + +@inproceedings{Lautemann88, +author = {Clemens Lautemann}, +title = {Efficient algorithms on context-free graph languages}, +editor = {Timo Lepist\"{o} and Arto Salomaa}, +booktitle = icalp88, publisher = lncs317, pages = {362-378}, year = 1988} + +@inproceedings{Lautemann88a, +author = {Clemens Lautemann}, +title = {Decomposition trees: structured graph representation and efficient algorithms}, +editor = {Max Dauchet and Maurice Nivat}, +booktitle = {Proceedings of the 13th Colloquium on Trees in Algebra and Programming, CAAP'88}, +publisher = lncs299, pages = {28-39}, year = 1988} + +@techreport{Lautemann90, +author = {Clemens Lautemann}, +title = {Tree Automata, Tree Decomposition and Hyperedge Replacement}, +number = {2/90}, +type = {Informatik-Bericht}, +institution = {Johannes Gutenberg-Universit\"{a}t Mainz}, +year = 1990} + +@article{Lautemann90a, +author = {Clemens Lautemann}, +title = {The complexity of graph languages generated by hyperedge +replacement}, +journal = ai, volume = 27, year = 1990, pages = {399-421}} + +%Law + +@book{Lawler76, +author = {E. Lawler}, +title = {Combinatorial Optimization: Networks and Matroids}, +publisher = {Holt, Rinehart and Winston}, +address = {New York}, +year = 1976 } + +@article{Lawler76a, +author = {E. Lawler}, +title = {A note on the complexity of the chromatic number problem}, +journal = ipl, volume = 5, year = 1976, pages = {66-67}} + +@inproceedings{LawlerS85, +author = {Eugene L. Lawler and P. J. Slater}, +title = {A Linear Time Algorithm for Finding an Optimal Dominating Subforest of a Tree}, +booktitle = {Proc. Graph Theory and its Applications to Algorithms and Computer Science}, +pages = {501-506}, +editor = {Y. Alavi et al.}, +year = 1985 +} + +@incollection{LawlerLRS93, +author = {Eugene L. Lawler and Jan Karel Lenstra and Alexander H. G. {Rinnooy +Kan} and David B. Shmoys}, +title = {Sequencing and Scheduling: Algorithms and Complexity}, +booktitle = {Handbooks in OR \& MS, Vol. 4}, +editor = {S.C. Graves et al}, +publisher = {Elsevier Science Publishers}, +year = 1993, pages = {445-522}} + +@article{LawsonK98, +author = {Nancy Lawson and M. S. Krishnamoorthy}, +title = {Bridge obstructions to circular-tree gate matrix +layout}, +journal = gc, volume = 14, year = 1998, pages = {143-153}} + +%LaP + +@article{LaPaugh93, +author = {A. S. LaPaugh}, +title = {Recontamination Does Not Help to Search a Graph}, +journal = jacm, volume = 40, year = 1993, pages = {224-245}} + +%Le + +@article{LeLM03, +author = {H.-O. Le and V. B. Le and H. M\"{u}ller}, +title = {Splitting a graph into disjoint induced paths or cycles}, +journal = dam, volume = 131, pages = {199-212}, year = 2003} + +%Lea + +@inproceedings{LeaverFayLS04, +author = {Andrew {Leaver-Fay} and Yuanxin Liu and Jack Snoeyink}, +title = {Faster placement of hydrogen atoms in protein structures by dynamic programming}, +booktitle = alenex04, year = 2004, pages = {39-48}} + +%Lee + +@article{Lee09, +author = {Chuan-Min Lee}, +title = {On the complexity of signed and minus total domination in graphs}, +journal = ipl, volume = 109, year = 2009, pages = {1177-1181}} + +@incollection{LeeuwenT86, +author = {Jan {van Leeuwen} and Richard B. Tan}, +title = {Computer Networks with Compact Routing Tables}, +editor = {G. Rozenberg and A. Salomaa}, +booktitle = {The Book of {L}}, +publisher = {Springer-Verlag}, address = {Berlin}, year = 1986, +pages = {298-307}} + +@article{LeeuwenT87, +author = {Jan {van Leeuwen} and Richard B. Tan}, +title = {Interval Routing}, +journal = tcj, volume = 30, year = 1987, pages = {298-307}} + +@inproceedings{Leeuwen90, +author = {Jan {van Leeuwen}}, +title = {Graph Algorithms}, +booktitle = {Handbook of Theoretical Computer Science, {A}: {A}lgorithms and +Complexity Theory}, +address = {Amsterdam}, year = 1990, +publisher = {North Holland Publ. Comp.}, +pages = {527-631} +} + +@inproceedings{LeeuwenT95, +author = {Jan {van Leeuwen} and Richard B. Tan}, +title = {Compact Routing Methods: A Survey}, +booktitle = {Proc 1st +Colloquium on Structural Information and Communication Complexity +(SIROCCO'94)}, +publisher = {Carleton Univ. Press}, address={Ottawa}, year = 1994, +pages = {71-93}} + +@inproceedings{Leeuwen05, +author = {E.J. van Leeuwen}, +title = {Approximation Algorithms for Unit Disk Graphs}, +editor = {Dieter Kratsch}, +booktitle = wg05, publisher = lncs3787, year = 2005, pages = {351-361}} + +%Leh + +@article{Lehot74, +author = {P. G. H. Lehot}, +title = {An optimal algorithm to detect a line graph and output its +root graph}, +journal = jacm, volume = 21, pages = {569-575}, year = 1974 } + +%Lei + +@inproceedings{LeightonR88, +author = {F. T. Leighton and S. Rao}, +title = {An approximate max-flow min-cut theorem for uniform multi-commodity +flow problems with applications to approximate algorithms}, +booktitle = focs88, publisher = {IEEE}, pages = {422-431}, +year = 1988, +note = {Full version: submitted manuscript} +} + +@article{Leimer93, +author = {H.-G. Leimer}, +title = {Optimal decomposition by clique separators}, +journal = dm, volume = 113, pages = {99-123}, year=1993} + +%Lek + +@article{LekkerkerkerB62, +author = {C. G. Lekkerkerker and J. C. Boland}, +title = {Representation of a finite graph by a set of intervals on the real line}, +journal = fundmath, volume = 51, year = 1962, pages = {45-64}} + +@unpublished{LeisersonP87, +author = {Charles E. Leiserson and Cynthia A. Philips}, +title = {Parallel Contraction of Planar Graphs}, +year = 1987, +note = {MIT, manuscript} +} + +@article{Lengauer81, +author = {Thomas Lengauer}, +title = {Black-White Pebbles and Graph Separation}, +journal = ai, volume = 16, year = 1981, pages = {465-475}} + +@article{Lengauer82, +author = {Thomas Lengauer}, +title = {Upper and Lower Bounds on the Complexity of the Min-Cut +Linear Arrangement Problem on Trees}, +journal = sjadm, volume = 3, pages = {99-113}, year = 1982 } + +@article{Lengauer87, +author = {Thomas Lengauer}, +title = {Efficient algorithms for finding minimum spanning forests in +hierarchically defined graphs}, +journal = ja, volume = 8, year = 1987, pages = {260-284}} + +@article{LengauerW88, +author = {Thomas Lengauer and Egon Wanke}, +title = {Efficient solutions of connectivity problems on +hierarchically defined graphs}, +journal = siamjc, volume = 17, year = 1988, pages = {1063-1080}} + +@inproceedings{LengauerW88a, +author = {Thomas Lengauer and Egon Wanke}, +title = {Efficient analysis of graph properties on context-free graph languages}, +editor = {Timo Lepist\"{o} and Arto Salomaa}, +booktitle = icalp88, publisher = lncs317, pages = {379-393}, year = 1988} + +@article{LeungVW84, +author = {Joseph Y.-T. Leung and Oliver Vornberger and James D. Witthoff}, +title = {On Some Variants of The Bandwidth Minimization Problem}, +journal = siamjc, year = 1984, volume = 13, pages = {650-667}} + +@article{LevenG83, +author = {D. Leven and Zvi Galil}, +title = {{NP}-completeness of finding the chromatic index of regular +graphs}, +journal = ja, volume = 4, year = 1983, pages = {35-44}} + +@inproceedings{Levin84, +author = {L. A. Levin}, +title = {Problems, complete in ``average'' instance}, +booktitle = stoc84, +year = 1984} + +%Li + +@article{LiZ07, +author = {Xueliang Li and Xiaoyan Zhang}, +title = {On the minimum monochromatic or multicolored subgraph partition +problems}, +journal = tcs, volume = 385, year = 2007, pages = {1-10}} + + +%Lia + +@article{LiangRDS91, +author = {Y. Liang and C. Rhee and S. K. Dhall and S. Lakshmivarahan}, +title = {A new approach for the domination problem on permutation +graphs}, +journal = ipl, volume = 37, year = 1991, pages = {219-224}} + +%Lic + +@article{LichtensteinS80, +author = {D. Lichtenstein and M. Sipser}, +title = {Go is polynomial-space hard}, +journal = jacm, volume = 27, year = 1980, pages = {393-401}} + +@article{Lichtenstein82, +author = {David Lichtenstein}, +title = {Planar formulae and their uses}, +journal = siamjc, volume = 11, year = 1982, pages = {185-225}} + +@article{LickW70, +author = {D. R. Lick and A. T. White}, +title = {$k$-Degenerate graphs}, +journal = canjm, volume = 22, year = 1970, pages = {1082--1096}} + +%Lie + +@article{Liedloff08, +author = {Mathieu Liedloff}, +title = {Finding a dominating set on bipartite graphs}, +journal = ipl, volume = 107, year = 2008, pages = {154-157}} + +@article{LiedloffKLP08, +author = {Mathieu Liedloff and Ton Kloks and Jiping Liu and Sheng-Lung Peng}, +title = {Efficient algorithms for {R}oman domination on some classes of graphs}, +journal = dam, volume = 156, year = 2008, pages = {3400-3415}} + +%Lin + +@article{LinO91, +author = {R. Lin and S. Olariu}, +title = {An {NC} Recognition Algorithm for Cographs}, +journal = jpdc, volume = 13, year = 1991, pages = {76-90}} + +@article{LinCL06, +author = {Guohui Lin and Zhipeng Cai and Dekang Lin}, +title = {Vertex covering by paths on trees with its applications in machine translation}, +journal = ipl, year = 2006, volume = 97, pages = {73-81}} + +%Lingas 1985 + +@inproceedings{Lingas85, +author = {Andrzej Lingas}, +title = {Subgraph Isomorphism for easily separable graphs with bounded valence}, +booktitle = wg85, year = 1985, pages = {217-229}} + +%Lingas 1987 + +@techreport{Lingas87, +author = {Andrzej Lingas}, +title = {On Parallel Complexity of the Subgraph Isomorphism Problem}, +number = {LITH-IDA-R-87-10}, +institution = {Link\"{o}ping University}, +year = 1987 +} + +%Lingas 1988 + +@unpublished{Lingas88, +author = {Andrzej Lingas}, +title = {Subgraph Isomorphism for Connected Graphs of Bounded Valence and Bounded Separator is in {NC}}, +note = {Ext. abstract}, +year = 1988 +} + +@inproceedings{LingasS88, +author = {Andrzej Lingas and Maciej M. Sys{\l}o}, +title = {A polynomial-time algorithm for subgraph isomorphism of two-connected series-parallel graphs}, +editor = {Timo Lepist\"{o} and Arto Salomaa}, +booktitle = icalp88, year = 1988, pages = {394-409}, publisher = lncs317} + +%Lingas 1989 + +@article{Lingas89, +author = {Andrzej Lingas}, +title = {Subgraph Isomorphism for biconnected outerplanar graphs in cubic time}, +journal = tcs, volume = 63, year = 1989, pages = {295-302}} + +@article{LingasK89, +author = {Andrzej Lingas and Marek Karpinski}, +title = {Subtree Isomorphism is {NC} reducible to Bipartite Perfect Matching}, +journal = ipl, volume = 30, year = 1989, pages = {27-32}} + +@article{LingasP89, +author = {Andrzej Lingas and Andrzej Proskurowski}, +title = {Fast parallel algorithms for the subgraph homeomorphism and the subgraph isomorphism problems for classes of planar graphs}, +journal = tcs, volume = 68, year = 1989, pages = {155-174}} + +@article{LingerPS95, +author = {Gerard T. Linger and Themistocles Politof and A. Satyanarayana}, +title = {A forbidden minor characterization and reliability of a class of partial 4-trees}, +journal = networks, volume = 25, pages = {139-146}, year = 1995} + +%Lip + +@article{LiptonRT79, +author = {Richard J. Lipton and Donald J. Rose and Robert Endre Tarjan}, +title = {Generalized nested dissection}, +journal = sjna, volume = 16, year = 1979, pages = {346-358}} + +@article{LiptonT79, +author = {Richard J. Lipton and Robert Endre Tarjan}, +title = {A separator theorem for planar graphs}, +journal = sjam, volume = 36, year = 1979, pages = {177-189}} + +@article{LiptonT80, +author = {Richard J. Lipton and Robert Endre Tarjan}, +title = {Applications of a planar separator theorem}, +journal = siamjc, volume = 9, year = 1980, pages = {615-627}} + +%Lit + +@inproceedings{LitovskiMZ93, +author = {I. Litovsky and Y. M{\'{e}}tivier and W. Zielonka}, +title = {The power and the limitations of local computations on graphs}, +editor = {Ernst W. Mayr}, +booktitle = wg92, year = 1993, publisher = lncs657, pages = {333-345}} + +%Liu + +%Liu 1980 + +@article{LiuG80, +author = {P. C. Liu and R. C. Geldmacher}, +title = {An {$O(\max(m,n))$} algorithm for finding a subgraph +homeomorphic to $K_4$}, +journal = cn, volume = 29, year = 1980, pages = {597-609}} + +%Liu 1990 + +@article{Liu90, +author = {J. W. H. Liu}, +title = {The role of elimination trees in sparse factorization}, +journal = sjmaa, volume = 11, year = 1990, pages = {134-172}} + +%Liu 1997 + +@article{LiuY97, +author = {D.D.-F. Liu and R. K. Yeh}, +title = {On distance two labellings of graphs}, +journal = arscomb, volume = 47, year = 1997, pages = {13-22}} + +%Liu 1998 + +@article{LiuY98, +author = {Chuan-Ming Liu and Ming-Shing Yu}, +title = {An optimal parallel algorithm for node ranking of cographs}, +journal = dam, volume = 87, year = 1998, pages = {187-201}} + +%Liu 2006 + +@inproceedings{LiuLCS06, +author = {Yang Liu and Songjian Lu and Jianer Chen and Sing-Hoi Sze}, +title = {Greedy localization and color-coding: Improved matching and packing algorithms}, +editor = {Hans L. Bodlaender and Michael A. Langston}, +booktitle = iwpec06, publisher = lncs4169, year = 2006, pages = {83-94}} + +%Liu 2008 + +@article{Liu08, +author = {Daphne Der-Fen Liu}, +title = {Radio number for trees}, +journal = dm, volume = 308, year = 2008, pages = {1153-1164}} + +%Liu 2009 + +@article{Liu09, +author = {Hong Liu and Haodi Feng and Daming Zhu and Junfeng Luan}, +title = {Parameterized computational complexity of control problems in voting systems}, +journal = tcs, volume = 410, year = 2009, pages = {2746-2753}} + +%Liu 2010 + +@article{Liu10, +author = {Hong Liu and Daming Zhu}, +title = {Parameterized complexity of control problems in Maximin election}, +journal = ipl, volume = 110, year = 2010, pages = {383-388}} + +%Ll + +%Llo + +@article{LloydSW88, +author = {Errol L. Lloyd and Mary Lou Soffa and Ching-Chy Wang}, +title = {On locating minimum feedback vertex sets}, +journal = jcss, volume = 37, pages = {292-311}, year = 1988} + +%Lo + +%Lok + +%Lokshtanov 2009 + +@inproceedings{LokshtanovMS09, +author = {Daniel Lokshtanov and Matthias Mnich and Saket Saurabh}, +title = {Linear kernel for planar connected dominating set}, +editor = {Jianer Chen and S. Barry Cooper}, +booktitle = tamc09, publisher = lncs5532, year = 2009, pages = {281-290}} + +%Lokshtanov 2010 + +@article{Lokshtanov10, +author = {Daniel Lokshtanov}, +title = {On the complexity of computing treelength}, +journal = dam, volume = 158, year = 2010, pages = {820-827}} + +@article{LokshtanovMP10, +author = {Daniel Lokshtanov and Federico Mancini and Charis Papadopoulos}, +title = {Characterizing and computing minimal cograph completions}, +journal = dam, volume = 158, year = 2010, pages = {755-764}} + +%Lop + +@article{LopezL80, +author = {A. D. Lopez and H. F. S. Law}, +title = {A dense gate matrix layout method for {MOS VLSI}}, +journal = ieeeted, +volume = 27, year = 1980, pages = {1671-1675}} + +%Loz + +@article{LozinR04, +author = {Vadim Lozin and Dieter Rautenbach}, +title = {On the band-, tree-, and clique-width of graphs with +bounded vertex degree}, +journal = sjdm, volume = 18, year = 2004, pages = {195-206}} + +@article{LozinR04a, +author = {Vadim Lozin and Dieter Rautenbach}, +title = {Chordal bipartite graphs of bounded tree- and clique-width}, +journal = dm, volume = 283, pages = {151-158}, year = 2004} + +@article{LozinR07, +author = {Vadim Lozin and Dieter Rautenbach}, +title = {The relative clique-width of a graph}, +journal = jctb, volume = 97, pages = {846-858}, year = 2007} + +@inproceedings{Lozin08, +author = {Vadim Lozin}, +title = {From tree-width to clique-width: {E}xcluding a unit interval graph}, +editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga}, +booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {871-882}} + +%Lu + +@article{LuKT02, +author = {Ching Lung Lu and Ming-Tat Ko and Chuan Yi Tang}, +title = {Perfect edge domination and efficient edge domination in graphs}, +journal = dam, volume = 119, year = 2002, pages = {227-250}} + +%Lub + +@article{Luby86, +author = {Michael Luby}, +title = {A simple parallel algorithm for the maximal independent set +problem}, +journal = siamjc, volume = 4, year = 1986 , pages = {1036-1053}} + +@misc{Luby88, +author = {Michael Luby}, +title = {Removing randomness in parallel computation without a processor +penalty}} + +%Luc + +@article{LuccioS07, +author = {Flaminia L. Luccio and Jop F. Sibeyn}, +title = {Feedback vertex sets in mesh-based networks}, +journal = tcs, volume = 383, year = 2007, pages = {86-101}} + +@phdthesis{Lucena02, +author = {Brian Lucena}, +title = {Dynamic Programming, Tree-Width, and Computation on Graphical +Models}, +school = {Brown University}, +address = {Providence, RI, USA}, +year = 2002} + +@article{Lucena03, +author = {Brian Lucena}, +title = {A new lower bound for tree-width using maximum cardinality search}, +journal = sjdm, volume = 16, year = 2003, pages = {345-353}} + +@article{Lucena07, +author = {Brian Lucena}, +title = {Achievable sets, brambles, and sparse treewidth obstructions}, +journal = dam, volume = 155, pages = {1055-1065}, year = 2007} + +@article{LucetMC00, +author = {C. Lucet and J.-F. Manouvrier and J. Carlier}, +title = {Evaluating network reliability and 2-edge-connected reliability in +linear time for bounded pathwidth graphs}, +journal = alg, volume = 27, year = 2000, pages = {316-336}} + +@article{LucetMM06, +author = {C. Lucet and F. Mendes and A. Moukrim}, +title = {An exact method for graph coloring}, +journal = cor, volume = 33, year = 2006, pages = {2189-2207}} + +@article{LuekerB79, +author = {G. S. Lueker and K. S. Booth}, +title = {A linear-time algorithm for deciding interval graph isomorphism}, +journal = jacm, volume = 26, year = 1979, pages = {183-195}} + +%M + +%Ma + +%Maa + +@article{MaamounM87, +author = {M. Maamoun and H. Meyniel}, +title = {On a game of policemen and robbers}, +journal = dam, volume = 17, year = 1987, pages = {307-309}} + +%Mad + +@article{MadelaineS08, +author = {Florent R. Madelaine and Iain A. Stewart}, +title = {Improved upper and lower bounds on the feedback vertex numbers of +grids and butterflies}, +journal = dm, year = 2008, volume = 308, pages = {4144-4164}} + +%Mah + +%Mahajan 1987 + +@inproceedings{MahajanP87, +author = {Sanjeev Mahajan and Joseph G. Peters}, +title = {Algorithms for Regular Properties in Recursive Graphs}, +booktitle = {Proceedings of the 25th Annual Allerton Conference on +Communication, Control, and Computing}, +pages = {14-23}, +year = 1987} + +%Mahajan 1994 + +@article{MahajanP94, +author = {Sanjeev Mahajan and Joseph G. Peters}, +title = {Regularity and locality in $k$-terminal graphs}, +journal = dam, volume = 54, pages = {229-250}, year = 1994} + +%Mahajan 1999 + +@article{MahajanR99, +author = {M. Mahajan and V. Raman}, +title = {Parameterizing Above Guaranteed Values: MaxSat and MaxCut}, +journal = ja, volume = 31, issue = 2, year = 1999, pages = {335-354}} + +%Mahajan 2006 + +@article{MahajanRS09, +author = {Meena Mahajan and Venkatesh Raman and Somnath Sikdar}, +title = {Parameterizing problems above or below guaranteed values}, +journal = jcss, volume = 72, year = 2009, pages = {137-153}} + +@article{Maharry99, +author = {J. Maharry}, +title = {An excluded minor theorem for the octahedron}, +journal = jgt, volume = 31, year = 1999, pages = {95-100}} + +@article{MaheshRS91, +author = {R. Mahesh and C. P. Rangan and A. Srinivasan}, +title = {On finding the minimum bandwidth of interval graphs}, +journal = ic2, volume = 95, year = 1991, pages = {218-224}} + +@inproceedings{MaheshwariZ01, +author = {A. Maheshwari and N. Zeh}, +title = {I/O-Efficient Algorithms for Bounded Treewidth Graphs}, +booktitle = soda01, pages = {89-90}, year = 2001} + +%Mak + +@article{MakedonS89, +author = {F. S. Makedon and Ivan Hal Sudborough}, +title = {On minimizing width in linear layouts}, +journal = dam, volume = 23, pages = {201-298}, year = 1989 } + +@article{MakedonSW93, +author = {F. Makedon and D. Sheinwald and Y. Wolfsthal}, +title = {A simple linear-time algorithm for the recognition of bandwidth-2 +biconnected graphs}, +journal = ipl, volume = 46, year = 1993, pages = {103-107}} + +@article{MakedonPS85, +author = {F. S. Makedon and Christos H. Papadimitriou and Ivan Hal Sudborough}, +title = {Topological Bandwidth}, +journal = sjadm, volume = 6, year = 1985, pages = {418-444}} + +@article{MakinoUI01, +author = {K. Makino and Y. Uno and T. Ibaraki}, +title = {On minimum edge ranking spanning trees}, +journal = ja, volume = 38, year = 2001, pages = {411-437}} + +%Makowsky + +@article{MakowskyR99, +author = {J. A. Makowsky and Udi Rotics}, +title = {On the clique-width of graphs with few {$P_4$}'s}, +journal = ijfcs, volume = 10, year = 1999, pages = {329-348}} + +@inproceedings{Makowsky01, +author = {J. A. Makowsky}, +title = {Colored {T}utte polynomials and {K}auffman brackets for graphs of +bounded treewidth}, +booktitle = soda01, pages = {487-495}, year = 2001} + +@article{MakowskyM03, +author = {J. A. Makowsky and J. P. Mari\~{n}o}, +title = {The parameterized complexity of knot polynomials}, +journal = jcss, volume = 67, year = 2003, pages = {742-756}} + +@article{Makowsky04, +author = {J. A. Makowsky}, +title = {Coloured {T}utte polynomials and {K}auffman brackets for graphs of +bounded tree width}, +journal = dam, volume = 145, pages = {276-290}, year = 2004} + +%Mal + +@article{Malitz94, +author = {Seth M. Malitz}, +title = {Graphs with {$E$} edges have pagenumber {$O(\sqrt{E})$}}, +journal = ja, volume = 17, year = 1994, pages = {71-84}} + +@article{Malitz94a, +author = {Seth M. Malitz}, +title = {Genus $g$ graphs have pagenumber {$O(\sqrt{g})$}}, +journal = ja, volume = 17, year = 1994, pages = {85-109}} + +%Man + +%Manb + +@article{ManberT84, +author = {Udi Manber and Martin Tompa}, +title = {The effect of number of {H}amiltonian paths on the complexity of a vertex coloring problem}, +journal = siamjc, volume = 13, year = 1984, pages = {109-115}} + +%Manc + +@article{Mancini10, +author = {Federico Mancini}, +title = {Minimum fill-in and treewidth of split$+ke$ and split$+kv$ graphs}, +journal = dam, volume = 158, year = 2010, pages = {747=754}} + +%Mann + +@article{ManninoORC07, +author = {Carlo Mannino and Gianpaolo Oriolo and Federico Ricci and Sunil Chandran}, +title = {The stable set problem and the thinness of a graph}, +journal = orl, volume = 35, year = 2007, pages = {1-9}} + +%Mans + +@article{Mansfield82, +author = {A. Mansfield}, +title = {Determining the thickness of graphs is {NP}-hard}, +journal = {Mathematical Proceedings of the Cambridge Philosophical Society}, volume = 93, year = 1982, pages = {9-23}} + +@article{MansourS89, +author = {Yishay Mansour and Baruch Schieber}, +title = {Finding the edge connectivity of directed graphs}, +volume = 10, year = 1989, journal = ja, pages = {76-85}} + +%Mar + +@unpublished{MarchalHK08, +author = {B. Marchal and Hoesel, C.P.M. {v}an and Koster, A. M. C. A.}, +title = {A local search algorithm for determining tree decompositions of graphs}, +note = {Presented on the International Symposium on Combinatorial Optimization}, +month = 3, year = 2008} + +@article{Marcotte90, +author = {O. Marcotte}, +title = {Exact edge-colorings of graphs without prescribed minors}, +journal = {DIMACS Ser. Discrete Math. Theoretc. Comput. Sci.}, +volume = 1, year = 1990, pages = {235-243}} + +@techreport{Marecek09, +author = {Jakub Mare\u{c}ek}, +title = {Some probabilistic results on width measures of graphs}, +type = {Report}, +number = {arXiv:0908.1772v5}, +year = 2009} + +@article{Markowitz57, +author = {H. M. Markowitz}, +title = {The elimination form of the inverse and its application to linear programming}, +journal = {Management Science}, volume = 3, year = 1957, pages = {255-269}} + +%Marx 2005 + +@article{Marx05, +author = {D\'{a}niel Marx}, +title = {Parameterized complexity of constraint satisfaction problems}, +journal = {Computational Complexity}, volume = 14, year = 2005, pages = {153-183}} + +%Marx 2006 + +@article{Marx06, +author = {D\'{a}niel Marx}, +title = {Parameterized graph separation problems}, +journal = tcs, volume = 351, year = 2006, pages = {394-406}} + +@article{Marx06a, +author = {D\'{a}niel Marx}, +title = {Parameterized coloring problems on chordal graphs}, +journal = tcs, volume = 351, year = 2006, pages = {407-424}} + +@article{Marx06b, +author = {D\'{a}niel Marx}, +title = {Precoloring extension on unit interval graphs}, +journal = dam, volume = 154, year = 2006, pages = {995-1002}} + +@article{Marx06c, +author = {D\'{a}niel Marx}, +title = {Minimum sum multicoloring on the edges of trees}, +journal = tcs, volume = 361, year = 2006, pages = {133-149}} + +@inproceedings{Marx06d, +author = {D\'{a}niel Marx}, +title = {Chordal deletion is fixed-parameter tractable}, +editor = {Fedor V. Fomin}, +booktitle = wg06, year = 2006, pages = {37-48}, publisher = lncs4271} + +%Marx 2009 + +@article{Marx09, +author = {D\'{a}niel Marx}, +title = {A parameterized view on matroid optimization problems}, +journal = tcs, volume = 410, year = 2009, pages = {4471-4479}} + +@article{MarxR09, +author = {D\'{a}niel Marx and Igor Razgon}, +title = {Constant ratio fixed-parameter approximation of the edge multicut problem}, +journal = ipl, volume = 109, year = 2009, pages = {1161-1166}} + +@article{MarxS09, +author = {D\'{a}niel Marx and Marcus Schaefer}, +title = {The complexity of nonrepetive coloring}, +journal = dam, volume = 157, year = 2009, pages = {13-18}} + +@article{MarxS09a, +author = {D\'{a}niel Marx and Ildik\'{o} Schlotter}, +title = {Parameterized graph cleaning problems}, +journal = dam, volume = 157, year = 2009, pages = {3258-3267}} + +%Marz + +@article{MarzbanGJ09, +author = {Marjan Marzban and Qian-Ping Gu and Xiaohua Jia}, +title = {Computational study on planar dominating set problem}, +journal = tcs, volume = 410, year = 2009, pages = {5455-5466}} + +%Mas + +@article{MasudaN88, +author = {S. Masuda and N. Nakajima}, +title = {An optimal algorithm for finding a maximum independent set of +a circular-arc graphs}, +journal = siamjc, volume = 17, pages = {41-52}, year = 1988 } + +%Mat + +%Mata + +@phdthesis{Mata-Montero90, +author = {E. Mata-Montero}, +title = {Reliability of Partial $k$-Tree Networks}, +school = {University of Oregon}, +number = {UO-CIS-TR-90-14}, +year = 1990} + +@article{Mata-Montero91, +author = {E. Mata-Montero}, +title = {Resilience of partial $k$-tree networks with edge and node failures}, +journal = networks, volume = 21, year = 1991, pages = {321-344}} + +%Mate + +@article{Mate81, +author = {A. M\'at\'e}, +title = {A lower estimate for the achromatic number of irreducible graphs}, +journal = dm, volume = 2, year = 1981, pages = {128-145}} + +%Math + +@inproceedings{MathiesonPS04, +author = {Luke Mathieson and Elena Prieto and Peter Shaw}, +title = {Packing Edge Disjoint Triangles: A Parameterized View}, +editor = {R. G. Downey and M. R. Fellows}, +booktitle = iwpec04, year = 2004, publisher = lncs3162, pages = {127-137}} + +%Mato + +@article{MatousekT91, +author = {Ji{\u{r}}\'{\i} Matou{\v{s}}ek and Robin Thomas}, +title = {Algorithms for finding tree-decompositions of graphs}, +year = 1991, journal = ja, volume = 12, pages = {1-22}} + +@article{MatousekT92, +author = {Ji{\u{r}}\'{\i} Matou{\v{s}}ek and Robin Thomas}, +title = {On the Complexity of Finding Iso- and Other Morphisms for +Partial $k$-Trees}, +journal = dm, volume = 108, year = 1992, pages = {343-364}} + +%Mats + +@inproceedings{MatsuiUU08, +author = {Yasuko Matsui and Ryuhei Uehara and Takeaki Uno}, +title = {Enumeration of perfect sequences of chordal graph}, +editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga}, +booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {859-870}} + +%Mau + +@article{MauerSW81, +author = {H. A. Mauer and Ivan Hal Sudborough and E. Welzl}, +title = {On the complexity of the general coloring problem}, +journal = ic, volume = 51, year = 1981, pages = {128-145}} + +%May + +@article{MayhewNW09, +author = {Dillon Mayhew and Mike Newman and Geoff Whittle}, +title = {On excluded minors for real-representability}, +journal = jctb, volume = 99, year = 2009, pages = {685-689}} + +%Maz + +@phdthesis{Mazoit04, +author = {Fr\'{e}d\'{e}ric Mazoit}, +title = {D\'{e}compositions algorithmiques des graphes}, +school = {Ecole Normale Sup\'{e}rieure de Lyon}, +year = 2004} + +@article{Mazoit06, +author = {F. Mazoit}, +title = {Listing all the minimal separators of a 3-connected planar graph}, +journal = dm, volume = 306, pages = {372 - 380}, year = 2006} + +@inproceedings{Mazoit06a, +author = {F. Mazoit}, +title = {The branch-width of circular-arc graphs}, +editor = {Jos\'{e} R. Correa and Alejandro Hevia and Marcos A. Kiwi}, +booktitle = latin06, publisher = lncs3887, year = 2006, pages = {727-736}} + +@article{MazoitN08, +author = {Fr\'{e}d\'{e}ric Mazoit and Nicolas Nisse}, +title = {Monotonicity of non-deterministic graph searching}, +journal = tcs, volume = 399, year = 2008, pages = {169-178}} + +%Mc + +%McC + +@article{McConnellS99, +author = {R.~M. Mc{C}onnell and J. Spinrad}, +title = {Modular decomposition and transitive orientation}, +journal = dm, volume = 201, year = 1999, pages = {189-241}} + +@article{McConnellM04, +author = {Ross M. Mc{C}onnell and Fabien {de Montgolfier}}, +title = {Linear-time modular decomposition of directed graphs}, +journal = dam, volume = 145, pages = {198-209}, year = 2004} + +%McD + +@inproceedings{McDiarmidRSS92, +author = {C. McDiarmid and Bruce Reed and A. Schrijver and B. Shepherd}, +title = {Non-Interfering Network Flows}, +editor = {O. Nurmi and E. Ukkonen}, +booktitle = swat92, publisher = lncs621, year = 1992, pages = {245-257}} + +@article{McDiarmidR03, +author = {C. McDiarmid and B. Reed}, +title = {Channel assignment on graphs of bounded treewidth}, +journal = dm, volume = 273, pages = {183-192}, year = 2003} + +%McG + +@inproceedings{McGuinnessK92, +author = {Patrick J. McGuinness and Andr{\'{e}} E. K{\'{e}}zdy}, +title = {An Algorithm to Find a {$K_5$} Minor}, +booktitle = soda92, year = 1992, pages = {345-356}} + +%McH + +@article{McHughP90, +author = {J. McHugh and Y. Perl}, +title = {Best location of service centers in a tree-like network under budget +constraints}, +journal = dm, year = 1990, volume = 86, pages = {199-214}} + +%McK + +@article{McKayW90, +author = {Brendan D. {McKay} and Nicholas C. Wormald}, +title = {Uniform generation of random regular graphs of moderate +degree}, +journal = ja, volume = 11, year = 1990, pages = {52-67}} + +%McM + +@article{McMorrisWW94, +author = {F. R. McMorris and Tandy Warnow and T. Wimer}, +title = {Triangulating Vertex-Colored Graphs}, +journal = sjdm, volume = 7, number = 2, year = 1994, pages = {296-306}} + +%McN + +@article{McNaughton93, +author = {R. McNaughton}, +title = {Infinite games played on finite graphs}, +journal = apal, volume = 65, pages={149-184}, year = 1993} + +%McV + +@article{McVitieW71, +author = {D. {McVitie} and L. B. Wilson}, +title = {The stable marriage problem}, +journal = cacm, volume = 14, year = 1971, pages = {486-490}} + +%Me + +%Mee + +@inproceedings{MeerR06, +author = {Klaus Meer and Dieter Rautenbach}, +title = {On the {OBDD} size for graphs of bounded tree- and clique-width}, +editor = {Hans L. Bodlaender and Michael A. Langston}, +booktitle = iwpec06, publisher = lncs4169, year = 2006, pages = {71-82}} + +@article{MeerR09, +author = {Klaus Meer and Dieter Rautenbach}, +title = {On the {OBDD} size for graphs of bounded tree- and clique-width}, +journal = dm, volume = 309, year = 2009, pages = {843-851}} + +%Meg + +@article{MegiddoHGJP88, +author = {Nimrod Megiddo and S. L. Hakimi and Michael R. Garey and David S. Johnson +and Christos H. Papadimitriou}, +title = {The Complexity of Searching a Graph}, +journal = jacm, volume = 35, pages = {18-44}, year = 1988 } + +@article{MegiddoV88, +author = {Nimrod Megiddo and Uzi Vishkin}, +title = {On finding a minimum dominating set in a tournament +({N}ote)}, +journal = tcs, volume = 61, year = 1988, pages = {307-316}} + +%Meh + +@book{Mehlhorn84a, +author = {Kurt Mehlhorn}, +title = {Sorting and Searching}, +series = {Data Structures and Algorithms}, +volume = 1, +publisher = {Springer Verlag}, +address = {Berlin}, +year = 1984 } + +@book{Mehlhorn84, +author = {K. Mehlhorn}, +title = {Graph Algorithms and {NP}-Completeness}, +series = {Data Structures and Algorithms}, +volume = 2, +publisher = {Springer Verlag}, +address = {Berlin}, +year = 1984 } + +@inproceedings{MehlhornNR89, +author = {K. Mehlhorn and S. N\"{a}her and M. Rauch}, +title = {On the complexity of a game related to the dictionary +problem}, +booktitle = focs89, year = 1989, pages = {546-548}} + +@book{MehlhornN95, +author = {Kurt Mehlhorn and Stefan N\"aher}, +title = {{LEDA}: A Platform for Combinatorial and Geometric Computing}, +publisher = {Cambridge University Press}, +year = 1995 +} + + +%Mei + +%Meister 2006 + +@article{Meister06, +author = {Daniel Meister}, +title = {Two characterisations of minimal triangulations of {$2K_2$}-free graphs}, +journal = dm, volume = 306, year = 2006, pages = {3327-3333}} + +%Meister 2010 + +@article{MeisterTV10, +author = {Daniel Meister and Jan Arne Telle and Martin Vatshelle}, +title = {Recognizing digraphs of {K}elly-width 2}, +journal = dam, volume = 158, year = 2010, pages = {741-746}} + +%Men + +@article{Menger27, +author = {K. Menger}, +title = {Zur Allgemeinen {K}urventheorie}, +journal = fundmath, volume = 10, year = 1927, pages = {96-115}} + +%Mes + +@article{MessingerNP08, +author = {M. E. Messinger and R. J. Nowakowski and P. Pra{\l}at}, +title = {Cleaning a network with brushes}, +journal = tcs, volume = 399, year = 2008, pages = {191-205}} + +%Mez + +@article{MezziniM10, +author = {Mauro Mezzini and Marina Moscarini}, +title = {Simple algorithms for minimal triangulation of a graph and backward selection of a decomposable {M}arkov network}, +journal = tcs, volume = 411, year = 2010, pages = {958-966}} + +%Mi + +%Mil + +@article{Miller83, +author = {Gary L. Miller}, +title = {Isomorphism of $k$-contractible graphs: A generalization of bounded valence and bounded genus}, +journal = ic, volume = 56, year = 1983, pages = {1-23}} + +@inproceedings{MillerR85, +author = {Gary L. Miller and John Reif}, +title = {Parallel Tree Contraction and its Application}, +booktitle = focs85, year = 1985, pages = {478-489}} + +@article{Miller86, +author = {Gary L. Miller}, +title = {Finding small simple cycle separators for 2-connected planar graphs}, +journal = jcss, volume = 32, year = 1986, pages = {265-279}} + +@inproceedings{MillerS86, +author = {Z. Miller and Ivan Hal Sudborough}, +title = {Polynomial Algorithms for Recognizing Small Cutwidth in Hypergraphs}, +booktitle = {Proc. Aegean Workshop on Computing, VLSI algorithms and +architecture AWOC '86, Springer Verlag Lecture Notes in Computer +Science, Vol. 227}, +year = 1986, +pages = {252-260} +} + +@article{Miller88, +author = {Z. Miller}, +title = {A linear algorithm for topological bandwidth in degree 3 trees}, +journal = siamjc, volume = 17, year = 1988, pages = {1018-1035}} + +@incollection{MillerR89, +author = {Gary L. Miller and John Reif}, +title = {Parallel Tree Contraction. {P}art 1: {F}undamentals}, +booktitle = {Advances in Computing Research 5: Randomness and Computation}, +editor = {S. Micali}, +publisher = {JAI Press, Greenwich, CT}, +pages = {47-72}, +year = 1989} + +@article{MillerR91, +author = {Gary L. Miller and John Reif}, +title = {Parallel Tree Contraction. {P}art 2: {F}urther applications}, +journal = siamjc, year = 1991, pages = {1128 - 1147}, volume = 20} + +%Mis + +@inproceedings{MishraRSS07, +author = {S. Mishra and V. Raman and S. Saurabh and S. Sikdar and C. R. Subramanian}, +title = {The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number}, +editor = {Takeshi Tokuyama}, +booktitle = isaac07, publisher = lncs4835, year = 2007, pages = {268-279}} + +%Mit + +@article{Mitchell79, +author = {S. L. Mitchell}, +title = {Linear algorithms to recognize outerplanar and maximal +outerplanar graphs}, +journal = ipl, volume = 9, pages = {229-232}, year = 1979 } + +@article{MitchellCH79, +author = {S. L. Mitchell and E. J. Cockayne and S. T. Hedetniemi}, +title = {Linear algorithms on recursive representations of trees}, +journal = jcss, volume = 18, year = 1979, pages = {76-85}} + +@article{MitchellH79, +author = {Sandra L. Mitchell and Stephen T. Hedetniemi}, +title = {Linear algorithms for edge-coloring trees and unicyclic graphs}, +journal = ipl, volume = 9, year = 1979, pages = {110-112}} + +@article{Mittal88, +author = {Hari Ballabh Mittal}, +title = {A fast backtrack algorithm for graph isomorphism}, +journal = ipl, volume = 29, year = 1988, pages = {105-110}} + +@inproceedings{Miyano87, +author = {Satoru Miyano}, +title = {The lexicographically first maximal subgraph problems: {P}-completeness and {NC} algorithms}, +booktitle = icalp87, publisher = lncs267, year = 1987, pages = {425-234}} + +@article{Miyano88, +author = {Satoru Miyano}, +title = {A Parallelizable Lexicographically First Maximal Edge-Induced Subgraph Problem}, +journal = ipl, volume = 27, pages = {75-78}, year = 1988 } + +%Mo + +%Moe + +@article{MoehringR84, +author = {Rolf H. M{\"{o}}hring and F. J. Radermacher}, +title = {Substitution decomposition and connections with combinatorial +optimization}, +journal = adm, volume = 19, year = 1984, pages = {257-356}} + +@inproceedings{Moehring85, +author = {Rolf H. M{\"{o}}hring}, +title = {Algorithmic aspects of comparability graphs and interval graphs}, +booktitle = {Graphs and Order}, +editor = {I. Rival}, +pages = {41-101}, +year = 1985, +publisher = {Reidel}, +address = {Dordrecht} +} + +@article{Moehring856, +author = {Rolf H. M{\"{o}}hring}, +title = {Algorithmic aspects of the substitution decomposition in optimization +over relations, set systems and boolean functions}, +journal = aor, volume = 4, year = {1985/1986}, pages = {195-225}} + +@inproceedings{Moehring89, +author = {Rolf H. M{\"{o}}hring}, +title = {Computationally tractable classes of ordered sets}, +booktitle = {Algorithms and Order}, +editor = {I. Rival}, +publisher = {Kluwer Acad. Publ.}, +address = {Dordrecht}, +year = 1989} + +@inproceedings{Moehring90, +author = {Rolf H. M{\"{o}}hring}, +title = {Graph Problems Related to Gate Matrix Layout and {PLA} +Folding}, +booktitle = {Computational Graph Theory, Comuting Suppl. 7}, +editor = {E. Mayr and H. Noltemeier and M. Sys{\l}o}, +publisher = {Springer Verlag}, pages = {17-51}, year = 1990} + +@article{Moehring96, +author = {Rolf H. M{\"{o}}hring}, +title = {Triangulating graphs without asteroidal triples}, +journal = dam, volume = 64, year = 1996, pages = {281-287}} + +%Moh + +@article{MoharR96, +author = {Bojan Mohar and Neil Robertson}, +title = {Disjoint Essential Cycles}, +journal = jctb, volume = 68, year = 1996, pages = {324-349}} + +@article{MoharR96a, +author = {Bojan Mohar and Neil Robertson}, +title = {Planar Graphs on Nonplanar Surfaces}, +journal = jctb, volume = 68, year = 1996, pages = {87-111}} + +@book{MoharT2001, +author = {Bojan Mohar and Carsten Thomassen}, +title = {Graphs on Surfaces}, +year = {2001}, +publisher = {The Johns Hopkins University Press}, +address = {Baltimore} +} + +%Mon + +@article{Monien85, +author = {Burkhard Monien}, +title = {How to find long paths efficiently}, +journal = adm, volume = 25, pages = {239-254}, year = 1985 } + +@article{MonienS85, +author = {Burkhard Monien and Ival Hal Sudborough}, +title = {Bandwidth-Constrained {NP}-Complete Problems}, +journal = tcs, volume = 41, year = 1985, pages = {141-167}} + +@article{Monien86, +author = {Burkhard Monien}, +title = {The Bandwidth Minimization Problem for Caterpillars with Hair +Length 3 is {NP}-complete}, +journal = sjadm, volume = 7, year = 1986, pages = {505-512}} + +@article{MonienS88, +author = {Burkhard Monien and Ival Hal Sudborough}, +title = {Min Cut is {NP}-complete for Edge Weighted Trees}, +journal = tcs, volume = 58, year = 1988, pages = {209-229}} + +@article{MonmaW86, +author = {Clyde L. Monma and Victor K. Wei}, +title = {Intersection Graphs of Paths in a Tree}, +journal = jctb, volume = 41, year = 1986, pages = {141-181}} + +%Mor + +@article{MoranW91, +author = {Shlomo Moran and Yaron Wolfstahl}, +title = {Optimal covering of cacti by vertex-disjoint paths}, +journal = tcs, volume = 84, year = 1991, pages = {179-187}} + +@inproceedings{MoranS05, +author = {Shlomo Moran and Sagi Snir}, +title = {Convex recolorings of strings and trees: Definitions, hardness results, and algorithms}, +editor = {Frank K. H. A. Dehne and Alejandro L\'{o}pez-Ortiz and J\"{o}rg-R\"{u}dinger Sack}, +booktitle = wads05, publisher = lncs3608, year = 2005, pages = {218-232}} + +@inproceedings{MoranS05a, +author = {Shlomo Moran and Sagi Snir}, +title = {Efficient Approximation of Convex Recolorings}, +booktitle = {Proceedings APPROX 2005: 8th International Workshop on +Approximation Algorithms for Combinatorial Optimization Problems, published +with Proceedings RANDOM 2005}, +publisher = lncs3624, +pages = {192-208}, year = 2005} + +@article{MoranS07, +author = {Shlomo Moran and Sagi Snir}, +title = {Efficient approximation of convex recolorings}, +journal = jcss, volume = 73, year = 2007, pages = {1078-1089}} + +@article{MoranS08, +author = {Shlomo Moran and Sagi Snir}, +title = {Convex recolorings of strings and trees: {D}efinitions, hardness results and algorithms}, +journal = jcss, volume = 74, year = 2008, pages = {850-869}} + +%Mos + +@phdthesis{Mosbah92, +author = {Mohamed H\'{e}di Mosbah}, +title = {Constructions d'Algorithmes Pour les Graphes Structur\'{e}s par des M{\'e}thodes Alg\'{e}briques et Logiques}, +year = 1992, +school = {Universit{\'e} Bordeaux-I}} + +@inproceedings{Mosbah93, +author = {Mohamed H\'{e}di Mosbah}, +title = {Probabilistic graph grammars}, +editor = {Ernst W. Mayr}, +booktitle = wg92, year = 1993, publisher = lncs657, pages = {236-247}} + +@inproceedings{Moser09, +author = {Hannes Moser}, +title = {A problem kernelization for graph packing}, +editor = {Mogens Nielsen and Anton{\'{\i}}n Kucera and Peter Bro Miltersen and Catuscia Palamidessi and Petr Tuma and Frank D. Valencia}, +booktitle = sofsem09, publisher = lncs5404, year = 2009, pages = {401-412}} + +@article{MoserS09, +author = {Hannes Moser and Somnath Sikdar}, +title = {The parameterized complexity of the induced matching problem}, +journal = dam, volume = 157, year = 2009, pages = {715-727}} + +%Mot + +@mastersthesis{Motte93, +author = {Nikolas Motte}, +title = {Algorithmen zur Berechnung der Baumweite von Graphen}, +school = {University of Passau, Germany}, +year = 1993} + +@inproceedings{MotwaniRS88, +author = {Rajeev Motwani and Arvind Raghunathan and Huzur Saran}, +title = {Constructive results from graph minors: {L}inkless embeddings}, +booktitle = focs88, year = 1988, pages = {398-407}} + +%Mu + +@article{MullerB87, +author = {H. M\"{u}ller and A. Brandst\"{a}dt}, +title = {The {NP}-completeness of {Steiner Tree} and {Dominating Set} for chordal bipartite graphs}, +journal = tcs, volume = 53, year = 1987, pages = {157-165}, +remark = {The page number may be wrong}} + +@article{MullerS89, +author = {John H. Muller and Jeremy Spinrad}, +title = {Incremental Modular Decomposition}, +journal = jacm, volume = 36, year = 1989, pages = {1-19}} + +@article{MullerU10, +author = {Haiko M\"{u}ller and Ruth Urner}, +title = {On a disparity between relative cliquewidth and relative {NLC}-width}, +journal = dam, volume = 158, year = 2010, pages = {828-840}} + +%Mv + +%Mx + +%My + +@article{MyungLT95, +author = {Y. S. Myung and C. H. Lee and D. W. Tcha}, +title = {On the generalized minimum spanning tree problem}, +journal = networks, year = 1995, volume = 26, pages = {231-241}} + +%Mz + +%N + +%Na + +%Nag + +@article{NagamochiI92, +author = {Hiroshi Nagamochi and T. Ibaraki}, +title = {A linear-time algorithm for finding a sparse $k$-connected spanning +subgraph of a $k$-connected graph}, +journal = alg, volume = 7, year = 1992, pages = {583-596}} + +@article{NagamochiK06, +author = {Hiroshi Nagamochi and Taizo Kawada}, +title = {Minmax subtree cover problem on cacti}, +journal = dam, volume = 154, year = 2006, pages = {1254-1263}} + +%Nak + +@article{NakanoON94, +author = {Shin-Ichi Nakano and Takashi Oguma and Tako Nishizeki}, +title = {A linear time algorithm for c-triangulating three-colored graphs}, +journal = {Trans. Institute of Electronics, Information and Communication, +Eng., A.}, volume = {377-A}, number = 3, pages = {543-546}, year = 1994, +note = {In Japanese}} + +@article{NakayamaM07, +author = {Shin-Ichi Nakayama and Shigeru Masuyama}, +title = {A polynomial time algorithm for obtaining minimum edge ranking on +two-connected outerplanar graphs}, +journal = ipl, volume = 103, year = 2007, pages = {211-250}} + +%Nao + +@article{NaorNS87, +author = {Joseph Naor and Moni Naor and Alejandro A. Sch\"{a}ffer}, +title = {Fast Parallel Algorithms for Chordal Graphs}, +journal = siamjc, volume = 18, year = 1989, pages = {327-349}} + +@article{NaorN90, +author = {Joseph Naor and Mark B. Novick}, +title = {An efficient reconstruction of a graph from its line graph in +parallel}, +journal = ja, year = 1990, volume = 11, pages = {132-143}} + +@inproceedings{NaorGM90, +author = {Dalit Naor and Dan Gusfield and Charles Martel}, +title = {A Fast Algorithm for Optimally Increasing the +Edge-Connectivity}, +booktitle = focs90, pages = {698-707}, year = 1990 } + +%Nar + +@techreport{NarasimhanM88, +author = {Giri Narasimhan and Rachel Manber}, +title = {A Generalization of {L}ovasz's Sandwich Theorem}, +number = 800, +institution = {Computer Science Dept., University of Wisconsin-Madison}, +year = 1988 +} + +@techreport{NarasimhanM88a, +author = {Giri Narasimhan and Rachel Manber}, +title = {Stability Number and Chromatic Number of Tolerance Graphs}, +number = 788, +institution = {Computer Science Dept., University of Wisconsin-Madison}, +year = 1988 +} + +@article{Narasimhan89, +author = {Giri Narasimhan}, +title = {A note on the Hamiltonian Circuit problem on Directed Path +Graphs}, +journal = ipl, volume = 32, year = 1989, pages = {167-170}} + +@phdthesis{Narayanan89, +author = {{Ch.} Narayanan}, +title = {Fast Parallel Algorithms and Enumeration Techniques for Partial $k$-Trees}, +school = {The Clemson University}, +month = {8}, year = 1989, pages = {i-vii,1-116}, +note = {Report No. URI-071}} + +@article{NarayananN98, +author = {Lata Narayanan and Naomi Nishimura}, +title = {Interval routing on $k$-trees}, +journal = ja, volume = 26, year = 1998, pages = {325-369}} + +%Nas + +@article{NashW65, +author = {C. {Nash-Williams}}, +title = {On well-quasi ordering infinite trees}, +journal = {Proceedings of the Cambridge Philosophical Society}, volume = 61, year = 1965, pages = {697-720}} + +%Nat + +@article{NatanzonSS00, +author = {Assaf Natanzon and Ron Shamir and Roded Sharan}, +title = {A Polynomial Approximation Algorithm for the Minimum Fill-In +Problem}, +journal = sjdm, volume = 30, pages = {1067-1079}, year = 2000} + +@article{NatarajanW78, +author = {K. S. Natarajan and L. J. White}, +title = {Optimum domination in weighted trees}, +journal = ipl, volume = 7, year = 1978, pages = {261-265}} + +%Nau + +@techreport{Naumann94, +author = {Valeska Naumann}, +title = {Measuring the distance to series-parallel graphs by path +expressions}, +number = {376/1994}, year = 1994, +institution = {Technische Universit\"{a}t Berlin}, +address = {Berlin, Germany}} + +%Ne + +%Nem + +@article{NemhauserT75, +author={G. L. Nemhauser and L. E. Trotter}, +title = {Vertex packing: Structural properties and algorithms}, +journal = mp, year = 1975, volume = 8, pages = {232-248}} + +%Ner + +@article{NerodeRY96, +author = {Anil Nerode and Jeffrey B. Remmel and Alexander Yakhnis}, +title = {McNaughton games and extracting strategies for concurrent programs}, +journal = apal, volume = 78, year = 1996, pages = {203-242}} + +%Nes + +@article{NesetrilZ96, +author = {Jaroslav Ne\~{s}et\~{r}il and Xuding Zhu}, +title = {On bounded treewidth duality of graphs}, +journal = jgt, volume = 23, pages = {151-162}, year = 1996} + +@article{NesetrilS01, +author = {Jaroslav Ne\~{s}et\~{r}il and E. Sopena}, +title = {On the oriented game chromatic number}, +journal = ejc, volume = 8, year = 2001, number = 2, pages = {R14}} + +@article{NesetrilM06, +author = {Jaroslav Ne\~{s}et\~{r}il and Patrice Ossona de Mendez}, +title = {Tree-depth, subgraph coloring and homomorphism bounds}, +journal = ejcom, volume = 27, year = 2006, pages = {1022-1041}} + +%Neu + +@article{NeufeldtC85, +author = {E. M. Neufeldt and C. J. Colbourn}, +title = {The most reliable series-parallel networks}, +journal = networks, volume = 15, year = 1985, pages = {27-32}} + +%Ni + +%Nie + +@booklet{Niedermeier02, +author = {R. Niedermeier}, +title = {Invitation to fixed-parameter algorithms}, +year = 2002, +note = {Habilitation Thesis}, +address = {Universit\"{a}t T\"{u}bingen}} + +@book{Niedermeier06, +author = {Rolf Niedermeier}, +title = {Invitation to fixed-parameter algorithms}, +publisher = {Oxford University Press}, +series = {Oxford Lecture Series in Mathematics and Its Applications}, +year = 2006} + +%Nik + +@article{NikolopoulosP06, +author = {Stavros D. Nikolopoulos and Leonidas Palios}, +title = {Minimal separators in {$P_4$}-sparse graphs}, +journal = dm, volume = 306, pages = {381-392}, year = 2006} + +%Nis + +@article{NishimuraRT00, +author = {Naomi Nishimura and Prabhakar Ragde and Dimitrios M. Thilikos}, +title = {Finding smallest supertrees under minor containment}, +journal = ijfcs, volume = 11, year = 2000, pages = {445-466}} + +@inproceedings{NishimuraRT04, +author = {Naomi Nishimura and Prabhakar Ragde and Dimitrios M. Thilikos}, +title = {Smaller kernels for hitting set problems of constant arity}, +editor = {R. G. Downey and M. R. Fellows}, +booktitle = iwpec04, year = 2004, publisher = lncs3162, pages = {239-250}} + +@article{Nisse09, +author = {Nicolas Nisse}, +title = {Connected graph searching in chordal graphs}, +journal = dam, volume = 157, year = 2009, pages = {2603-2610}} + +@article{NisseS09, +author = {Nicolas Nisse and David Soguet}, +title = {Graph searching with advice}, +journal = tcs, volume = 410, year = 2009, pages = {1307-1318}} + +%No + +%Nob + +@article{Noble98, +author = {S. D. Noble}, +title = {Evaluating the {T}utte polynomial for graphs of bounded tree-width}, +journal = cpc, year = 1998, pages = {307-321}, volume = 7} + +%Nog + +@article{NogaYZ95, +author = {Noga Alon and Raphael Yuster and Uri Zwick}, +title = {Color-coding}, +journal = jacm, volume = 42, year = 1995, pages = {855-856}} + +%Nor + +@article{NorineSTW06, +author = {Serguei Norine and Paul Seymour and Robin Thomas and Paul Wollan}, +title = {Proper minor-closed families are small}, +journal = jctb, volume = 96, year = 2006, pages = {754-757}} + +%Nov + +@techreport{Novick89, +author = {Mark B. Novick}, +title = {Fast Parallel Algorithms for the Modular Decomposition}, +institution = {Department of Computer Science, Cornell University}, +number = {TR 89-1016}, year = 1989 } + +%O + +%Oc + +@article{OchemP08, +author = {Pascal Ochem and Alexandre Pinlou}, +title = {Oriented colorings of partial 2-trees}, +journal = ipl, volume = 108, year = 2008, pages = {82-86}} + +%Og + +@article{OgawaHS03, +author = {M. Ogawa and Z. Hu and I. Sasano}, +title = {Iterative-free program analysis}, +journal = {ACM SIGPLAN Notices}, volume = 38, year = 2003, pages = {111-123}} + +%Oh + +%Ohs + +@article{Ohsugi10, +author = {Hidefumi Ohsugi}, +title = {Normality of cut polytopes of graphs is a minor closed property}, +journal = dm, volume = 310, year = 2010, pages = {1160-1166}} + +%Oht + +@article{Othsuki76, +author = {T. Ohtsuki}, +title = {A fast algorithm for finding an optimal ordering in the +vertex elimination ordering of a graph}, +journal = siamjc, volume = 5, year = 1976, pages = {133-145}} + +@article{OthsukiCF76, +author = {T. Ohtsuki and L. K. Cheung and T. Fujisawa}, +title = {Minimal triangulation of a graph and optimal pivoting ordering +in a sparse matrix}, +journal = jmaa, volume = 54, pages = {622-633}, year = 1976} + +@article{OhtsukiMKF81, +author = {T. Ohtsuki and H. Mori and T. Kashiwabara and T. Fujisawa}, +title = {On minimal augmentation of a graph to obtain an interval graph}, +journal = jcss, volume = 22, year = 1981, pages = {60-97}} + +%Ol + +%Ola + +@article{Olariu89, +author = {Stephan Olariu}, +title = {A decomposition for strongly perfect graphs}, +journal = jgt, volume = 13, number = 3, year = 1989, pages = {301-311}} + +@article{Olariu91, +author = {Stephan Olariu}, +title = {On the structure of unbreakable graphs}, +journal = jgt, volume = 15, number = 4, year = 1991, pages = {349-373}} + +@article{OlariuSZ92, +author = {Stephan Olariu and James L. Schwing and Jingyuan Zhang}, +title = {Optimal parallel encoding and decoding algorithms for trees}, +journal = ijfcs, volume = 3, number = 1, year = 1992, pages = {1-10}} + +%Ole + +@article{OlesenM02, +author = {Kristian G. Olesen and Anders L. Madsen}, +title = {Maximal prime subgraph decomposition of {B}ayesian networks}, +journal = {IEEE Trans. on Systems, Man, and Cybernetics, Part B}, +volume = 32, year = 2002, pages = {21-31}} + +%Or + +%Ord + +%author = {F. Ord\'o\~nez and B. Krishnamachari}, + +@article{OrdonezK04, +author = {F. Ordonez and B. Krishnamachari}, +title = {Optimal information extraction in energy-limited wireless sensor networks}, +journal = {IEEE Journal on Selected Areas in Communications}, +volume = 22, year = 2004, number = 6, pages = {1121-1129}} + +%Orl + +@article{OrlinBB81, +author = {James B. Orlin and Maurizio A. Bonucelli and Daniel P. Bovet}, +title = {An {$O(n^2)$} algorithm for coloring proper circular arc graphs}, +journal = sjadm, volume = 2, year = 1981, pages = {88-93}} + +%Os + +%Ost + +@article{Ostrovskii10, +author = {M. I. Ostrovskii}, +title = {Minimum congestion spanning trees in planar graphs}, +journal = dm, volume = 310, year = 2010, pages = {1204-1209}} + +%Ou + +%Oum + +%Oum 2005 + +@article{Oum05, +author = {{Sang-il} Oum}, +title = {Rank-width and vertex-minors}, +journal = jctb, volume = 95, year = 2005, pages = {79-100}} + +%Oum 2006 + +@article{OumS06, +author = {{Sang-il} Oum and Paul Seymour}, +title = {Approximating clique-width and branch-width}, +journal = jctb, volume = 96, year = 2006, pages = {514-528}} + +%Oum 2007 + +@article{OumS07, +author = {{Sang-il} Oum and Paul Seymour}, +title = {Testing branch-width}, +journal = jctb, volume = 97, year = 2007, pages = {385-393}} + +%Oum 2008 + +@article{Oum08, +author = {{Sang-il} Oum}, +title = {Rank-width and well-quasi ordering}, +journal = sjdm, volume = 22, year = 2008, pages = {666-682}} + +@article{Oum08a, +author = {{Sang-il} Oum}, +title = {Rank-width is less than or equal to branch-width}, +journal = jgt, volume = 57, year = 2008, pages = {239-244}} + +@article{Oum08b, +author = {{Sang-il} Oum}, +title = {Approximating rank-width and clique-width quickly}, +journal = acmtalg, volume = 5, number = 1, year = 2008} + +%Oum 2009 + +@article{Oum09, +author = {Sang-il Oum}, +title = {Computing rank-width exactly}, +journal = ipl, volume = 109, year = 2009, pages = {730-738}} + +%P + +%Pa + +%Pan + +@article{PandaD03, +author = {B. S. Panda and S. K. Das}, +title = {A linear time recognition algorithm for proper interval graphs}, +journal = ipl, volume = 87, year = 2003, pages = {153-161}} + +%Pap + +%Papadimitriou 1975 + +@article{Papadimitriou75, +author = {Christos H. Papadimitriou}, +title = {Games Against Nature}, +journal = jcss, volume = 31, year = 1985, pages = {288-301}} + +%Papadimitriou 1976 + +@article{Papadimitriou76, +author = {Christos H. Papadimitriou}, +title = {The {NP}-completeness of the bandwidth minimization problem}, +journal = comp, volume = 16, year = 1976, pages = {263-270}} + +%Papadimitriou 1981 + +@article{PapadimitriouY81, +author = {Christos H. Papadimitriou and Mihalis Yannakakis}, +title = {The clique problem for planar graphs}, +journal = ipl, volume = 13, year = 1981, pages = {131-133}} + +%Papadimitriou 1982 + +@book{PapadimitriouS82, +author = {Christos H. Papadimitriou and K. Steiglitz}, +title = {Combinatorial Optimization: Algorithms and Complexity}, +publisher = {Prentice Hall}, +address = {Englewoods Cliffs, NJ}, +year = 1982 } + +%Papadimitriou 1984 + +@article{Papadimitriou84, +author = {Christos H. Papadimitriou}, +title = {On the complexity of unique solutions}, +journal = jacm, volume = 31, year = 1984, pages = {392-400}} + +%Papadimitriou 1989 + +@techreport{PapadimitriouS89, +author = {Christos H. Papadimitriou and Martha Sideris}, +title = {The Bisection Width of Grid Graphs}, +number = {89.0584}, +institution = {CTI Patras}, +year = 1989} + +%Papadimitriou 1994 + +@book{Papadimitriou94, +author = {Christos H. Papadimitriou}, +title = {Computational Complexity}, +year = 1994, +publisher = {Addison-Wesley}, +address = {Reading, Mass.}} + +@article{PapakostasT98, +author = {Achilleas Papakostas and Ioannis G. Tollis}, +title = {Algorithms for area-efficient orthogonal drawings}, +journal = {Computation Geometry: Theory and Applications}, volume = 9, year = 1998, pages = {83-110}} + +%Par + +%Park + +@inproceedings{Park02, +author = {J. D. Park}, +title = {MAP complexity results and approximation methods}, +editor = {A. Darwiche and N. Friedman}, +booktitle = uai02, publisher = {Morgan Kaufmann}, pages = {388-396}, year = 2002} + +@article{ParkD04, +author = {J. D. Park and A. Darwiche}, +title = {Complexity results and approximation settings for {MAP} explanations}, +journal = jair, volume = 21, year = 2004, pages = {101-133}} + +%Parn + +@article{ParnasR07, +author = {Michal Parnas and Dana Ron}, +title = {Approximating the minimum vertex cover in sublinear time and a +connection to distributed algorithms}, +journal = tcs, volume = 381, year = 2007, pages = {183-196}} + +%Parr + +@unpublished{Parra94, +author = {Andreas Parra}, +title = {Triangulating bitolerance graphs}, +note = {Manuscript}, +year = 1994} + +@misc{Parra95, +author = {Andreas Parra}, +note = {Personal communication}, year = 1995} + +@phdthesis{Parra96, +author = {Andreas Parra}, +title = {Structural and Algorithmic Aspects of Chordal Graph Embeddings}, +year = 1996, +school = {Technical University Berlin}} + +@article{ParraS97, +author = {Andreas Parra and Petra Scheffler}, +title = {Characterizations and algorithmic applications of chordal graph +embeddings}, +journal = dam, volume = 79, pages = {171-188}, year = 1997} + +@article{Parra98, +author = {Andreas Parra}, +title = {Triangulating multitolerance graphs}, +journal = dam, volume = 84, year = 1998, pages = {183-197}} + +%Pars + +@inproceedings{Parsons76, +author = {T. D. Parsons}, +title = {Pursuit Evasion in a Graph}, +booktitle = {Theory and Application of Graphs}, +editor = {Y. Alavi and D. R. Lick}, +publisher = {Springer Verlag}, +address = {Berlin}, +year = 1976, pages = {426-441}} + +%Part + +@article{Parter61, +author = {S. Parter}, +title = {The use of linear graphs in {Gauss} elimination}, +journal = {SIAM Review}, volume = 3, pages = {119-130}, year = 1961} + +%Pau + +%Paul 1978 + +@article{Paul78, +author = {J. L. Paul}, +title = {Tic-Tac-Toe in $n$-dimensions}, +journal = {Math. Mag.}, year = 1978, pages = {45-49}, volume = 51 } + +%Paul 1980 + +@article{PaulPR80, +author = {W. J. Paul and E. J. Prauss and R. Reischuk}, +title = {On alternation}, +journal = ai, volume = 14, pages = {243-255}, year = 1980 } + +@article{PaulR80, +author = {W. J. Paul and R. Reischuk}, +title = {On alternation {II}}, +journal = ai, volume = 14, pages = {391-403}, year = 1980 } + +%Paul 2005 + +@inproceedings{PaulT05, +author = {Christophe Paul and Jan Arne Telle}, +title = {New tools and simpler algorithms for branchwidth}, +booktitle = esa05, publisher = lncs3669, year = 2005, pages = {379-390}} + +%Paul 2009 + +@article{PaulT09, +author = {Christophe Paul and Jan Arne Telle}, +title = {Branchwidth of chordal graphs}, +journal = dam, volume = 157, year = 2009, pages = {2718-2725}} + +%Paw + +@article{PawagiGR87, +author = {Shaunak R. Pawagi and P. S. Gopalakrishnan and I. V. +Ramakrishnan}, +title = {Computing dominators in parallel}, +journal = ipl, volume = 24, year = 1987, pages = {217-221}} + +%Pe + +%Pea + +@book{Pearl88, +author = {J. Pearl}, +title = {Probablistic Reasoning in Intelligent Systems: Networks of Plausible +Inference}, +publisher = {Morgan Kaufmann}, year = 1988, address = {Palo Alto}} + +%Pec + +@article{PeckS92, +author = {G. W. Peck and A. Shastri}, +title = {Bandwidth of theta graphs with short paths}, +journal = dm, volume = 103, pages = {177-187}, year = 1992} + +%Pen + +@article{PengHHKT00, +author = {Sheng-Lung Peng and Chin-Wen Ho and Tsan-Shen Hsu and Ming-Tat Ko +and {Chuan Yi} Tang}, +title = {Edge and node searching problems on trees}, +journal = tcs, volume = 240, pages = {429-446}, year = 2000} + +@article{PengKHHT00, +author = {S.-L. Peng and M.-T. Ko and C.-W. Ho and T.-S. Hsu and C. Y. Tang}, +title = {Graph searching on some subclasses of chordal graphs}, +journal = alg, volume = 27, pages = {395-426}, year = 2000} + +@article{PengC06, +author = {Sheng-Lung Peng and Chi-Kang Chen}, +title = {On the interval completion of chordal graphs}, +journal = dam, volume = 154, pages = {1003-1010}, year = 2006} + +%Per + +@inproceedings{PerkovicR99, +author = {Ljubomir Perkovi{\'{c}} and Bruce Reed}, +title = {An improved algorithm for finding tree decompositions of small width}, +editor = {Peter Widmayer and Gabriele Neyer and Sephan Eidenbenz}, +booktitle = wg99, publisher = lncs1665, year = 1999, pages = {148-154}} + +@article{PerkovicR00, +author = {Ljubomir Perkovi{\'{c}} and Bruce Reed}, +title = {An improved algorithm for finding tree decompositions of small width}, +journal = ijfcs, volume = 11, year = 2000, pages = {365-371}} + +%Per + +@article{PerlS78, +author = {Y. Perl and Y. Shiloach}, +title = {Finding two disjoint paths between two pairs of vertices in a +graph}, +journal = jacm, year = 1978, volume = 23, pages = {1-9}} + +%Pey + +@article{Peyton01, +author = {B. W. Peyton}, +title = {Minimal orderings revisited}, +journal = sjmaa, volume = 23, year = 2001, pages = {271-294}} + +%Pf + +@article{PfaffLH84, +author = {J. Pfaff and R. Laskar and S. T. Hedetniemi}, +title = {Linear algorithms for independent domination and total +domination in series-parallel graphs}, +journal = cn, volume = 45, year = 1984, pages = {71-82}} + +%Ph + +%Phi + +@inproceedings{PhilipRS09, +author = {Geevarghese Philip and Venkatesh Raman and Somnath Sikdar}, +title = {Solving Dominating Set in larger classes of graphs: {FPT} algorithms +and polynomial kernels}, +editor = {Amos Fiat and Peter Sanders}, +booktitle = esa09, publisher = lncs5757, year = 2009, pages = {694-705}} + +%Pl + +@inproceedings{PlehnV90, +author = {J\"{u}rgen Plehn and Bernd Voigt}, +title = {Finding minimally weighted subgraphs}, +editor = {Rolf H. M\"{o}hring}, +booktitle = wg90, publisher = lncs484, year = 1991, pages = {18-29}} + +%Pi + +%Pie + +@article{Pietrzak03, +author = {Krzysztof Pietrzak}, +title = {On the parameterized complexity of the fixed alphabet {\em shortest +common supersequence} and {\em longest common subsequence} problems}, +journal = jcss, volume = 67, year = 2003, pages = {757-771}} + +%Pin + +@article{PinlouS06, +author = {Alexandre Pinlou and \'{E}ric Sopena}, +title = {Oriented vertex and arc colorings of outerplanar graphs}, +journal = ipl, volume = 100, year = 2006, pages = {97-104}} + +%Po + +%Pon + +@inproceedings{PontaHN08, +author = {Oriana Ponta and Falk H\"{u}ffner and Rolf Niedermeier}, +title = {Speeding up Dynamic Programming for Some {NP}-Hard Graph Recoloring +Problems}, +editor = {M. Agrawal and D.-Z. Du and Z. Duan and A. Li}, +booktitle = tamc08, publisher = lncs4978, year = 2008, pages = {490-501}} + +%Pr + +%Pri + +@phdthesis{Prieto05, +author = {Elena Prieto}, +title = {Systematic Kernelization in {FPT} Algorithm Design}, +school = {University of Newcastle}, +address = {Australia}, year = 2005} + +@article{PrietoS06, +author = {Elena Prieto and Christian Sloper}, +title = {Looking at the stars}, +journal = tcs, volume = 351, pages = {437-445}, year = 2006} + +%Pro + +%Proskurowski 1979 + +@article{Proskurowski79, +author = {Andrzej Proskurowski}, +title = {Minimum dominating cycles in two-trees}, +journal = ijcis, volume = 8, number = 5, year = 1979, pages = {405-417}} + +%Proskurowski 1980 + +@article{Proskurowski80, +author = {Andrzej Proskurowski}, +title = {Centers of maximal outerplanar graphs}, +journal = jgt, year = 1980, volume = 4, number = 2, pages = {75-79}} + +@article{Proskurowski80a, +author = {Andrzej Proskurowski}, +title = {Centers of 2-trees}, +journal = adm, volume = 9, year = 1980, pages = {1-5}} + +%Proskurowski 1981 + +@article{Proskurowski81, +author = {Andrzej Proskurowski}, +title = {Recursive graphs, recursive labelings and shortest paths}, +journal = siamjc, volume = 16, year = 1981, pages = {391-397}} + +@article{ProskurowskiS81, +author = {Andrzej Proskurowski and Maciej M. Sys{\l}o}, +title = {Minimum dominating cycles in outerplanar graphs}, +journal = ijcis, volume = 10, year = 1981, pages = {127-139}} + +%Proskurowski 1984 + +@article{Proskurowski84, +author = {Andrzej Proskurowski}, +title = {Separating subgraphs in $k$-trees: {C}ables and Caterpillars}, +journal = dm, volume = 49, year = 1984, pages = {275-285}} + +%Proskurowski 1986 + +@article{ProskurowskiS86, +author = {Andrzej Proskurowski and Maciej M. Sys{\l}o}, +title = {Efficient Vertex- and Edge-colorings of Outerplanar Graphs}, +journal =sjadm, volume = 7, year = 1986, pages = {131-136}} + +%Proskurowski 1989 + +@techreport{Proskurowski89, +author = {Andrzej Proskurowski}, +title = {Maximal Graphs of Pathwidth $k$ or Searching a Partial +$k$-caterpillar}, +number = {CIS-TR-89-17}, +institution = {Dept. of Computer and Information Science, University +of Oregon}, +year = 1989} + +%Proskurowski 1990 + +@article{ProskurowskiS90, +author = {Andrzej Proskurowski and Maciej M. Sys{\l}o}, +title = {Efficient Computations in Tree-like Graphs}, +journal = {Comput. Suppl.}, volume = 7, year = 1990, pages = {1 - 15}} + +%Proskurowski 1993 + +@inproceedings{Proskurowski93, +author = {Andrzej Proskurowski}, +title = {Graph reductions, and techniques for finding minimal forbidden minors}, +booktitle = {Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint +Summer Research Conference, Seattle WA, June 1991}, +publisher = {American Math. Soc.}, +address = {Providence, RI}, +editor = {Neil Robertson and Paul Seymour}, +note = {Contemp. Math. 147.}, +pages = {591-600}, +year = 1993} + +@article{ProvanB83, +author = {{J. Scott} Provan and Michael O. Ball}, +title = {The complexity of counting cuts and of computing the probability that +a network remains connected}, +journal = siamjc, volume = 12, number = 4, year = 1983, pages = {777-788}} + +%Prz + +@article{PrzytyckaC91, +author = {T. Przytycka and D. G. Corneil}, +title = {Parallel algorithms for parity graphs}, +journal = ja, volume = 12, pages = {96-109}, year = 1991} + +%Pu + +%Pul + +@article{Pullman84, +author = {Normal J. Pullman}, +title = {Clique covering of graphs {IV}. {A}lgorithms}, +journal = siamjc, volume = 13, year = 1984, pages = {57-75}} + +%Pun + +@article{PunnenN94, +author = {Abraham P. Punnen and K. P. K. Nair}, +title = {A fast and simple algorithm for the bottleneck biconnected spanning +subgraph problem}, +journal = ipl, volume = 50, year = 1994, pages = {283-286}} + +%Q + +%Qu + +@article{Quilliot85, +author = {A. Quilliot}, +title = {A short note about pursuit games played on a graph with a given genus}, +journal = jctb, volume = 38, year = 1985, pages = {89-92}} + +%R + +%Ra + +%Rab + +@article{RabinS59, +author = {M. O. Rabin and D. S. Scott}, +title = {Finite automata and their decision problems}, +journal = {IBM Journal of Research and Development}, volume = 3, year = 1959, pages = {114-125}} + +@inproceedings{Rabin65, +author = {M. O. Rabin}, +title = {A simple method for undecidability proofs and some applications}, +publisher = {North-Holland Publishing Company}, +booktitle = {Logic, Methodology and Philosophy of Science}, +year = 1965, editor = {Y. {Bar-Hillel}}, pages = {58-68}} + +@article{Rabin69, +author = {M. O. Rabin}, +title = {Decidability of second-order theories and automata on infinite trees}, +journal = {Transactions of the American Mathematical Society}, volume = 141, year = 1969, pages = {1-35}} + +@incollection{Rabin77, +author = {M. O. Rabin}, +title = {Decidable theories}, +booktitle = {Handbook of Mathematical Logic}, +editor = {K. J. Barwise}, +publisher = {North-Holland Publishing Company}, +year = 1977, pages = {595-629}} + +@article{RabinV89, +author = {Michael O. Rabin and Vijay V. Vazirani}, +title = {Maximum matchings in general graphs through randomization}, +journal = ja, volume = 10, year = 1989, pages = {557-567}} + +%Rad + +@techreport{RadhakrishnanHS92, +author = {Venkatesh Radhakrishnan and Harry B. {Hunt III} and Richard E. Stearns}, +title = {On Solving Systems of Linear Equations and Path Problems for Bounded Treewidth Graphs}, +institution = {Dept. of Computer Science, SUNY Albany}, +number = {92-5}, +year = 1992} + +@techreport{RadhakrishnanHS93, +author = {Venkatesh Radhakrishnan and Harry B. {Hunt III} and Richard E. Stearns}, +title = {Efficient Algorithms for Hierarchical Descriptions with Bounded Treewidth}, +institution = {Dept. of Computer Science, SUNY Albany}, +number = {93-7}, +year = 1993} + +%Rai + +@inproceedings{RaibleF08, +author = {Daniel Raible and Henning Fernau}, +title = {Power domination in {$O^\ast(1.7448^n)$} using reference search trees}, +editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga}, +booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {136-147}} + +%Raj + +@unpublished{RajaramanBP93, +author = {Anand Rajaraman and Hari Balakrishnan and C. {Pandu Rangan}}, +title = {Modular Decomposition Techniques for Distance-Hereditary Graphs}, +note = {Manuscript}, year = 1993} + +%Ram + +@phdthesis{Ramachandramurthi94, +author = {Siddharthan Ramachandramurthi}, +title = {Algorithms for {VLSI} Layout Based on Graph Width Metrics}, +school = {Computer Science Department, University of Tennessee}, +address = {Knoxville, Tennessee, USA}, +year = 1994} + +@inproceedings{Ramachandramurthi95, +author = {Siddharthan Ramachandramurthi}, +title = {A Lower Bound for Treewidth and its Consequences}, +editor = {Ernst W. Mayr and Gunther Schmidt and Gottfried Tinhofer}, +booktitle = wg94, publisher = lncs903, year = 1995, pages = {14-25}} + +@article{Ramachandramurthi97, +author = {Siddharthan Ramachandramurthi}, +title = {The structure and number of obstructions to treewidth}, +journal = sjdm, volume = 10, year = 1997, pages = {146-157}} + +@article{Ramachandran88, +author = {Vijaya Ramachandran}, +title = {Finding a minimum feedback arc set in reducible flow graphs}, +journal = ja, volume = 9, pages = {299-313}, year = 1988 } + +@article{RamalingamP88, +author = {G. Ramalingam and C. {Pandu Rangan}}, +title = {Total Domination in Interval Graphs Revisited}, +journal = ipl, volume = 27, year = 1988, pages = {17-22}} + +@article{RamalingamP88a, +author = {G. Ramalingam and C. {Pandu Rangan}}, +title = {A unified approach to domination problems on interval graphs}, +journal = ipl, volume = 27, year = 1988, pages = {271-274}} + +@article{RamalingamP90, +author = {G. Ramalingam and C. {Pandu Rangan}}, +title = {New sequential and parallel algorithms for interval graph +recognition}, +journal = ipl, volume = 34, year = 1990, pages = {215-219}} + +%Raman + +@inproceedings{RamanSS02, +author = {Venkatesh Raman and Saket Saurabh and C. R. Subramanian}, +title = {Faster fixed parameter tractable algorithms for undirected feedback vertex set}, +editor = {P. Bose and P. Morin}, +booktitle = isaac02, year = 2002, pages = {241 - 248}, publisher = lncs2518} + +@article{RamanSS05, +author = {Venkatesh Raman and Saket Saurabh and C. R. Subramanian}, +title = {Faster algorithms for feedback vertex set}, +journal = {Proceedings 2nd Brazilian Symposium on Graphs, Algorithms, and Combinatorics, GRACO 2005, +Electronic Notes in Discrete Mathematics}, +volume = 19, year = 2005, pages = {273-279}} + +@article{RamanS06, +author = {Venkatesh Raman and Saket Saurabh}, +title = {Parameterized algorithms for feedback set problems and their duals in +tournaments}, +journal = tcs, volume = 351, pages = {446-458}, year = 2006} + +@article{RamanS07, +author = {Venkatesh Raman and Somnath Sikdar}, +title = {Parameterized complexity of the induced subgraph problem in +directed graphs}, +journal = ipl, volume = 104, pages = {79-85}, year = 2007} + +%Ran + +@techreport{RanderathS05, +author = {B. Randerath and I. Schiermeyer}, +title = {Exact Algorithms for Minimum Dominating Set}, +type = {Technical Report}, +number = {zaik2005-501}, +institution = {Universit\"{a}t zu K\"{o}ln, Cologne, Germany}, +year = 2005} + +%Rao + +@article{RaoR89, +author = {A. {Srinivasa Rao} and C. {Pandu Rangan}}, +title = {Linear algorithm for domatic number on interval graphs}, +journal = ipl, volume = 33, year = 1989, pages = {29-33}} + +@article{RaoR89a, +author = {A. {Srinivasa Rao} and C. {Pandu Rangan}}, +title = {Optimal parallel algorithms on circular-arc graphs}, +journal = ipl, volume = 33, year = 1989, pages = {147-156}} + +@article{RaoR90, +author = {Srinivasa {Rao Arikati} and C. {Pandu Rangan}}, +title = {Linear algorithm for optimal path cover problem on interval +graphs}, +journal = ipl, volume = 34, year = 1990, pages = {149-153}} + +%Rau + +@article{Rautenbach07, +author = {Dieter Rautenbach}, +title = {Dominating and large induced trees in regular graphs}, +journal = dm, volume = 307, year = 2007, pages = {3177-3186}} + +%Rav + +@article{RaviSMRR96, +author = {R. Ravi and R. Sundaram and Madhav V. Marathe and D. J. Rosenkrantz and +S. S. Ravi}, +title = {Spanning trees---Short or Small}, +journal = sjdm, volume = 9, pages = {178 - 200}, year = 1996} + +%Raz + +@inproceedings{Razgon06, +author = {Igor Razgon}, +title = {Exact Computation of Maximum Induced Forest}, +editor = {Lars Arge and Rusins Freivalds}, +booktitle = swat06, publisher = lncs4059, year = 2006, pages = {160-171}} + +@article{Razgon07, +author = {Igor Razgon}, +title = {A {$2^{O(k)}$}poly($n$) algorithm for +the parameterized Convex Recoloring problem}, +journal = ipl, volume = 104, pages = {53-58}, year = 2007} + +@inproceedings{RazgonS08, +author = {Igor Razgon and B. O'Sullivan}, +title = {Almost $2$-{SAT} is Fixed-Parameter Tractable (Extended Abstract)}, +editor = {Luca Aceto and Ivan Damg{\aa}rd and Leslie Ann Goldberg and +Magn\'{u}s M. Halld\'{o}rsson and Anna Ing\'{o}lfsd\'{o}ttir and Igor Walukuewics}, +booktitle = icalp08-1, year = 2008, publisher = lncs5125, pages = {551-562}} + +%Re + +%Rea + +@inbook{Read93, +author = {Ronald C. Read}, +title = {Prospects for Graph Theory Algorithms}, +booktitle = {Quo Vadis, Graph Theory}, +Xeditor = {J. Gimbel and J. W. Kennedy and L. V, Quintas}, +publisher = {Elsevier Science Publishers}, +series = {Annals of Discrete Mathematics}, +volume = {55}, +pages = {201-210}, +year = 1993} + +%Ree + +%Reed 1992 + +@inproceedings{Reed92, +author = {Bruce Reed}, +title = {Finding approximate separators and computing tree-width +quickly}, +publisher = {ACM Press}, address = {New York}, +booktitle = stoc92, pages = {221-228}, +year = 1992} + +%Reed 1993 + +@inproceedings{ReedRSS93, +author = {Bruce A. Reed and N. Robertson and A. Schrijver and Raul D. +Seymour}, +title = {Finding disjoint trees in planar graphs in linear time}, +booktitle = {Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint +Summer Research Conference, Seattle WA, June 1991}, +publisher = {American Math. Soc.}, +address = {Providence, RI}, +editor = {Neil Robertson and Paul Seymour}, +note = {Contemp. Math. 147.}, +pages = {295 - 301 }, +year = 1993} + +%Reed 1997 + +@incollection{Reed97, +author = {Bruce A. Reed}, +title = {Tree width and tangles, a new measure of connectivity and some +applications}, +booktitle = {Surveys in Combinatorics}, +series = {LMS Lecture Note Series}, +volume = 241, pages = {87-162}, year = 1997, +publisher = {Cambridge University Press}, address = {Cambridge, UK}} + +%Reed 2003 + +@incollection{Reed03, +author = {Bruce A. Reed}, +title = {Algorithmic aspects of tree width}, +booktitle = {Recent advances in algorithms and combinatorics}, +series = {CMS Books Math. / Ouvrages Math. SMC, 11}, +publisher = {Springer}, address = {New York}, pages = {85-107}, +year = 2003} + +%Reed 2008 + +@inproceedings{ReedL08, +author = {Bruce A. Reed and Zhentao Li}, +title = {Optimization and recognition for {$K_5$}-minor free graphs in linear time}, +editor = {Eduardo Sany Laber and Claudson F. Bornstein and Loana Tito Nogueira and Luerbio Faria}, +booktitle = latin08, year = 2008, publisher = lncs4957, pages = {206-215}} + +%Rei + +@article{Reisch80, +author = {S. Reisch}, +title = {Gobang ist {PSPACE}-vollst{\"{a}}ndig}, +journal = ai, volume = 13, year = 1980, pages = {59-66}} + +@article{Reisch81, +author = {S. Reisch}, +title = {Hex ist {PSPACE}-vollst{\"{a}}ndig}, +journal = ai, volume = 15, year = 1981, pages = {167-191}} + +%Ren + +@article{RenooijGP02, +author = {Slija Renooij and Linda C. van der Gaag and Simon Parsons}, +title = {Context-specific sign-propogation in qualitative probabilistic networks}, +journal = ai, volume = 140, year = 2002, pages = {207-230}} + +%Ri + +%Ric + +@article{RichardsL85, +author = {D. Richards and A. L. Liestman}, +title = {Finding Cycles of a Given Length}, +journal = adm, volume = 27, pages = {249-256}, year = 1985 } + +@article{Richards86, +author = {D. Richards}, +title = {Finding Short Cycles in Planar Graphs Using Separators}, +journal = ja, volume = 7, year = 1986, pages = {249-256}} + +@phdthesis{Richey85, +author = {M. B. Richey}, +title = {Combinatorial optimization on series-parallel graphs: algorithms and complexity}, +school = {School of Industrial and Systems Engineering, Georgia Institute of +Technology}, +year = 1985} + +%Rie + +@article{RiegeRSY07, +author = {Tobias Riege and J\"{o}rg Rothe and Holger Spakowski and Masaki Yamamoto}, +title = {An improved exact algorithm for the domatic number problem}, +journal = ipl, volume = 101, year = 2007, pages = {101-106}} + +%Ro + +%Rob + +@article{Robson86, +author = {J. M. Robson}, +title = {Algorithms for maximum independent sets}, +journal = ja, volume = 7, year = 1986, pages = {425-440}} + +@techreport{Robson01, +author = {J. M. Robson}, +title = {Finding an independent set in time {$O(2^{n/4})$}}, +note = {Technical report 1251-01}, +institution = {LaBRi, Universit\'{e} Bordeaux}, +year = 2001} + +%Robertson + +%Exception to rule: The graph minors papers are numbered to their +%number in the series + +@article{RobertsonS1, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {I}. {E}xcluding a Forest}, +journal = jctb, year = 1983, volume = 35, pages = {39-61}} + +@article{RobertsonS2, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {II}. {A}lgorithmic Aspects of Tree-Width}, +journal = ja, year = 1986, volume = 7, pages = {309-322}} + +@article{RobertsonS85, +author = {Neil Robertson and Paul D. Seymour}, +title = {Disjoint Paths -- A Survey}, +journal = sjadm, volume = 6, year = 1985, pages = {300-305}} + +@article{RobertsonS3, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {III}. {P}lanar Tree-Width}, +journal = jctb, volume = 36, year = 1984, pages = {49-64}} + +@article{RobertsonS4, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {IV}. {T}ree-Width and Well-Quasi-Ordering}, +journal = jctb, volume = 48, year = 1990, pages = {227-254}} + +@article{RobertsonS5, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {V}. {E}xcluding a planar graph}, +journal = jctb, volume = 41, year = 1986, pages = {92-114}} + +@article{RobertsonS6, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {VI}. {D}isjoint Paths across a Disc}, +journal = jctb, volume = 41, year = 1986, pages = {115-138}} + +@article{RobertsonS7, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {VII}. {D}isjoint paths on a surface}, +journal = jctb, volume = 45, pages = {212-254}, year = 1988} + +@article{RobertsonS8, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {VIII}. {A} {K}uratowski theorem for general +surfaces}, +journal = jctb, volume = 48, pages = {255-288}, year = 1990} + +@article{RobertsonS9, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {IX}. {D}isjoint crossed paths}, +journal = jctb, volume = 49, pages = {40-77}, year = 1990} + +@article{RobertsonS10, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {X}. {O}bstructions to tree-decomposition}, +journal = jctb, volume = 52, year = 1991, pages = {153-190}} + +@article{RobertsonS11, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {XI}. {D}istance on a Surface}, +journal = jctb, volume = 60, year = 1994, pages = {72-106}} + +@article{RobertsonS12, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {XII}. {E}xcluding a Non-planar Graph}, +journal = jctb, volume = 64, year = 1995, pages = {240-272}} + +@article{RobertsonS13, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {XIII}. {T}he Disjoint Paths Problem}, +journal = jctb, volume = 63, year = 1995, pages = {65-110}} + +@article{RobertsonS14, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {XIV}. {E}xtending an Embedding}, +journal = jctb, volume = 65, year = 1995, pages = {23-50}} + +@article{RobertsonS15, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {XV}. {G}iant Steps}, +journal = jctb, volume = 68, year = 1996, pages = {112-148}} + +@article{RobertsonS16, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {XVI}. {E}xcluding a non-planar graph}, +journal = jctb, volume = 89, year = 2003, pages = {43-76}} + +@article{RobertsonS17, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {XVII}. {T}aming a vortex}, +journal = jctb, volume = 77, year = 1999, pages = {162-210}} + +@article{RobertsonS18, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {XVIII}. {T}ree-decompositions and well-quasi ordering}, +journal = jctb, volume = 89, year = 2003, pages = {77-108}} + +@article{RobertsonS19, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {XIX}. {W}ell-quasi-ordering on a surface}, +journal = jctb, volume = 90, year = 2004, pages = {325-385}} + +@article{RobertsonS20, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {XX}. {W}agner's conjecture}, +journal = jctb, volume = 92, year = 2004, pages = {325-357}} + +@article{RobertsonS21, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {XXI}. {G}raphs with unique linkages}, +journal = jctb, volume = 99, year = 2009, pages = {583-616}} + +@unpublished{RobertsonS22, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph Minors. {XXII}. {I}rrelevant vertices in linkage problems}, +note = {Manuscript}, +year = 1992 +} + +@article{RobertsonS23, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph minors {XXIII}. {N}ash-{W}illiams' immersion conjecture}, +journal = jctb, volume = 100, year = 2010, pages = {181-205}} + + + +%Robertson 1984 + +@article{RobertsonS84, +author = {Neil Robertson and Paul D. Seymour}, +title = {Generalizing {K}uratowskis Theorem}, +journal = cn, volume = 45, year = 1984, pages = {129-138}} + +@inproceedings{RobertsonS84a, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph width and well-quasi ordering: a survey}, +booktitle = {Progress in Graph Theory}, +editor = {J. A. Bondy and U. S. R. Murty}, +publisher = {Academic Press}, +address = {Toronto}, +year = 1984, pages = {399-406}} + +%Robertson 1985 + +@inproceedings{RobertsonS85a, +author = {Neil Robertson and Paul D. Seymour}, +title = {Graph minors --- A survey}, +editor = {I. Anderson}, +booktitle = {Surveys in Combinatorics}, +publisher = {Cambridge Univ.\ Press}, +year = 1985, pages = {153--171}} + +%Robertson 1988 + +@unpublished{RobertsonS88, +author = {Neil Robertson and Paul D. Seymour}, +title = {An Outline of a Disjoint Path Algorithm}, +note = {Preprint}, year = 1988, month = {5}} + +%Robertson 1993 + +@inproceedings{RobertsonS93, +author = {Neil Robertson and Paul D. Seymour}, +title = {Excluding a graph with one crossing}, +booktitle = {Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint +Summer Research Conference, Seattle WA, June 1991}, +publisher = {American Math. Soc.}, +address = {Providence, RI}, +editor = {Neil Robertson and Paul Seymour}, +note = {Contemp. Math. 147.}, +pages = {669-675}, +year = 1993} + +@inproceedings{RobertsonST93, +author = {Neil Robertson and Paul D. Seymour and Robin Thomas}, +title = {A survey of linkless embeddings}, +booktitle = {Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint +Summer Research Conference, Seattle WA, June 1991}, +publisher = {American Math. Soc.}, +address = {Providence, RI}, +editor = {Neil Robertson and Paul Seymour}, +note = {Contemp. Math. 147.}, +pages = {125-136}, +year = 1993} + +@inproceedings{RobertsonST93a, +author = {Neil Robertson and Paul D. Seymour and Robin Thomas}, +title = {Structural Description of Lower Ideals of Trees}, +booktitle = {Graph Structure Theory, Proceedings of the AMS-IMS-SIAM Joint +Summer Research Conference, Seattle WA, June 1991}, +publisher = {American Math. Soc.}, +address = {Providence, RI}, +editor = {Neil Robertson and Paul Seymour}, +note = {Contemp. Math. 147.}, +pages = {525-538}, +year = 1993} + +%Robertson 1994 + +@article{RobertsonST94, +author = {Neil Robertson and Paul D. Seymour and Robin Thomas}, +title = {Quickly Excluding a Planar Graph}, +journal = jctb, volume = 62, year = 1994, pages = {323-348}} + +%Robertson 1997 + +@article{RobertsonSST97, +author = {Neil Robertson and Daniel Sanders and Paul Seymour and Robin +Thomas}, +title = {The Four-Colour Theorem}, +journal = jctb, volume = 70, year = 1997, pages = {2-44}} + +@article{RobinsonG89, +author = {A. G. Robinson and A. J. Goldman}, +title = {The set coincidence game: Complexity, Attainability, and +Symmetric Strategies}, +journal = jcss, volume = 39, year = 1989, pages = {376-387}} + +@article{Robson84, +author = {J. M. Robson}, +title = {{$N$} by {$N$} {Checkers} is {Exptime} complete}, +journal = siamjc, volume = 13, year = 1984, pages = {252-267}} + +@article{Robson85, +author = {J. M. Robson}, +title = {Alternation with restrictions on looping}, +journal = ic, volume = 67, pages = {2-11}, year = 1985 } + +%Roc + +@book{Rockafellar84, +author = {R. T. Rockafellar}, +title = {Network Flows and Monotronic Optimization}, +publisher = {Wiley}, +address = {New York}, +year = 1984} + +%Rod + +@article{Rodriguez-VelazquezS09, +author = {J. A. Rodr\'{\i}guez-Vel\'{a}zquez and J. M. Sigarreta}, +title = {Global defensive $k$-alliances in graphs}, +journal = dam, volume = 157, year = 2009, pages = {211-218}} + +%Roh + +@mastersthesis{Rohrig98, +author = {Hein R{\"{o}}hrig}, +title = {Tree decomposition: A feasibility study}, +school = {Max-Planck-Institut f{\"{u}}r Informatik}, +address = {Saarbr{\"{u}}cken, Germany}, +year = 1998} + +%Ron + +@article{Ronn90, +author = {Eytan Ronn}, +title = {{NP}-complete stable matching problems}, +journal = ja, volume = 11, year = 1990, pages = {285 - 304}} + +%Roo + +%van Rooij 2006 + +@mastersthesis{vanRooij06, +author = {Johan M. M. {van Rooij}}, +title = {Design by Measure and Conquer: An {$O(1.5086^n)$} Algorithm for Minimum Dominating Set and Similar Problems}, +school = {Institute for Information and Computing Sciences, Utrecht University}, +number = {INF/SRC-06-05}, year = 2006} + +%van Rooij 2008 + +@inproceedings{vanRooijB08, +author = {Johan M. M. van Rooij and Hans L. Bodlaender}, +title = {Design by Measure and Conquer --- A faster exact algorithm for Dominating Set}, +booktitle = stacs08, +year = 2008, pages = {657-668}} + +@inproceedings{vanRooijB08a, +author = {Johan M. M. van Rooij and Hans L. Bodlaender}, +title = {Exact algorithms for Edge Domination}, +booktitle = {Proceedings of the 3rd International Workshop on Parameterized and Exact Computation, IWPEC 2008}, +editor = {Martin Grohe and Rolf Niedermeier}, +year = 2008, +pages = {214-225}, +publisher = {Springer, Lecture Notes in Computer Science, volume 5018}, +address = {Berlin}} + +%van Rooij 2009 + +@inproceedings{vanRooijBR09, +author = {Johan M. M. van Rooij and Hans L. Bodlaender and Peter Rossmanith}, +title = {Dynamic programming on tree decompositions using generalised fast subset convolution}, +editor = {Amos Fiat and Peter Sanders}, +booktitle = esa09, publisher = lncs5757, year = 2009, +pages = {566-577}} + +@inproceedings{vanRooijNvD09, +author = {Johan M. M. van Rooij and Jesper Nederlof and Thomas C. van Dijk}, +title = {Inclusion/Exclusion meets Measure and Conquer: Exact algorithms for counting dominating sets}, +editor = {Amos Fiat and Peter Sanders}, +booktitle = esa09, publisher = lncs5757, year = 2009, +pages = {554-565}} + +%Ros + +@article{Rose70, +author = {Donald J. Rose}, +title = {Triangulated graphs and the elimination process}, +journal = jmaa, volume = 32, year = 1970, pages = {597-609}} + +@inproceedings{Rose72, +author = {Donald J. Rose}, +title = {A graph-theoretic study of the numerical solution of sparse positive definite systems of linear equations}, +booktitle = {Graph Theory and Computing}, +editor = {R. C. Reed}, +publisher = {Academic Press}, year = 1972, pages = {183-217}} + +@article{Rose74, +author = {Donald J. Rose}, +title = {On simple characterization of $k$-trees}, +journal = dm, volume = 7, year = 1974, pages = {317-322}} + +@article{RoseTL76, +author = {Donald J. Rose and Robert Endre Tarjan and George S. Lueker}, +title = {Algorithmic aspects of vertex elimination on graphs}, +journal = siamjc, volume = 5, year = 1976, pages = {266-283}} + +@article{RosenbergS81, +author = {A. Rosenberg and Ivan Hal Sudborough}, +title = {Bandwidth and pebbling}, +journal = comp, volume = 31, year = 1981, pages = {115-139}} + +@article{RosentalG77, +author = {A. Rosental and A. Goldner}, +title = {Smallest augmentations to biconnect a graph}, +journal = siamjc, volume = 6, year = 1977, pages = {55-66}} + +%Rot + +@article{Roth96, +author = {D. Roth}, +title = {On the hardness of approximate reasoning}, +journal = artint, volume = 82, pages = {273-302}, year = 1996} + +@techreport{Rote89, +author = {G\"{u}nther Rote}, +title = {Path Problems in Graphs}, +number = {B-89-11}, +year = 1989, +institution = {Freie Universit\"{a}t Berlin}} + +%Ru + +%Rub + +@article{RubalcabaS08, +author = {Robert R. Rubalcaba and Peter J. Slater}, +title = {Roman dominating influence parameters}, +journal = dm, volume = 307, year = 2007, pages = {3194-3200}} + +%Ruz + +@article{Ruzzo80, +author = {W. L. Ruzzo}, +title = {Tree-size bounded alternation}, +journal = jcss, volume = 21, year = 1980, pages = {218-235}} + +%S + +%Sa + +%Sak + +@article{Sakai94, +author = {D. Sakai}, +title = {Labeling chordal graphs: {D}istance two condition}, +journal = sjdm, volume = 7, year = 1994, pages = {133-140}} + +%Sal + +@article{SalamonW08, +author = {G. Salamon and G. Wiener}, +title = {On finding spanning trees with few leaves}, +journal = ipl, volume = 105, year = 2008, pages = {164-169}} + +@article{Salavatipour04, +author = {Mohammad R. Salavatipour}, +title = {A polynomial time algorithm for strong edge coloring of partial $k$-trees}, +journal = dam, volume = 143, year = 2004, pages = {285-291}} + +%Sam + +@article{SamerS10, +author = {Marko Samer and Stefan Szeider}, +title = {Algorithms for propositional model counting}, +journal = jda, volume = 8, year = 2010, pages = {50-64}} + +@article{SamerS10a, +author = {Marko Samer and Stefan Szeider}, +title = {Constraint satisfaction with bounded treewidth revisited}, +journal = jcss, volume = 76, year = 2010, pages = {103-114}} + +%San + +@article{Sanders96, +author = {Daniel P. Sanders}, +title = {On Linear Recognition of Tree-Width at Most Four}, +journal = sjdm, volume = 9, number = 1, year = 1996, pages = {101-117}} + +@article{SantoroK85, +author = {N. Santoro and R. Khatib}, +title = {Labelling and Implicit Routing in Networks}, +journal = tcj, volume = 28, year = 1985, pages = {5-8}} + +@inproceedings{Santos91, +author = {Eugene Santos Jr.}, +title = {On the generation of alternative explanations with implications for belief revision}, +editor = {Bruce D'Ambrosio and Philippe Smets}, +booktitle = uai91, year = 1991, pages = {339-347}, publisher = {Morgan Kaufmann}} + +%Sas + +@article{Sasatte08, +author = {Prashant Sasatte}, +title = {Improved {FPT} algorithm for feedback vertex set problem in bipartite tournament}, +journal = ipl, volume = 105, year = 2008, pages = {79-82}} + +%Sat + +@techreport{SatyanP92, +author = {C. R. Satyan and C. {Pandu Rangan}}, +title = {Treewidth of bipartite permutation graphs}, +number = {TR-TCS-92-8}, +institution = {Indian Institute of Technology, Madras, India}, +year = 1992} + +@article{SatyanarayanaT90, +author = {A. Satyanarayana and L. Tung}, +title = {A characterization of partial 3-trees}, +journal = netw, volume = 20, year = 1990, pages = {299-322}} + +%Sau + +@misc{Saurabh09, +author = {Saket Saurabh}, +note = {Personal communication}, +year = 2009} + +%Sax + +@article{Saxe80, +author = {J. B. Saxe}, +title = {Dynamic programming algorithms for recognizing small-bandwidth graphs in polynomial time}, +journal = sjadm, volume = 1, year = 1980, pages = {363-369}} + +%Sc + +%Sch + +%Scha + +@article{Schaefer78a, +author = {T. J. Schaefer}, +title = {On the complexity of some two-person perfect-information games}, +journal = jcss, volume = 16, year = 1978, pages = {185-225}} + +@inproceedings{Schaefer78b, +author = {T. J. Schaefer}, +title = {The complexity of satisfiability problems}, +booktitle = stoc78, year = 1978, pages = {216-226}} + +@article{Schaffer89, +author = {A. A. Sch\"{a}ffer}, +title = {Optimal node ranking of trees in linear time}, +journal = ipl, volume = 33, year = 1989, pages = {91-99}} + +%Sche + +%Scheffler 1986 + +@unpublished{SchefflerS86, +author = {Petra Scheffler and Detlef Seese}, +title = {A Combinatorial and Logical Approach to Linear-Time Computability }, +note = {Extended abstract}, +year = 1986 } + +%Scheffler 1987 + +@techreport{Scheffler87, +author = {Petra Scheffler}, +title = {Linear-time Algorithms for {NP}-complete Problems Restricted +to Partial $k$-Trees}, +type = {Report}, +number = {R-MATH-03/87}, +institution = {Karl-Weierstrass-Institut F\"ur Mathematik}, +address = {Berlin, GDR}, +year = 1987 +} + +%Scheffler 1988 + +@inproceedings{Scheffler88, +author = {Petra Scheffler}, +title = {What graphs have bounded treewidth?}, +year = 1988, +booktitle = {Proc. 7th Fishland Coll. Discr. Math. and Appl.}, +address = {Wustrow, Rostocker Mathematisches Kolloquium} +} + +@unpublished{Scheffler88a, +author = {Petra Scheffler}, +title = {Linear-time Algorithms for Graphs of Bounded Tree-width. {T}he DISJOINT-PATHS-problem}, +year = 1988, +note = {Manuscript, to appear in Graphentheorie und Anwendungen} +} + +%Scheffler 1989 + +@phdthesis{Scheffler89, +author = {Petra Scheffler}, +title = {Die {B}aumweite von {G}raphen als ein {M}a\ss \ f\"{u}r die +{K}ompliziertheit algorithmischer {P}robleme}, +school = {Akademie der Wissenschaften der DDR}, +address = {Berlin}, year = 1989 } + +%Scheffler 1990 + +@inproceedings{Scheffler90, +author = {Petra Scheffler}, +title = {A linear algorithm for the pathwidth of trees}, +booktitle = {Topics in combinatorics and graph theory}, +editor = {R. Bodendiek and R. Henn}, +publisher = {Physica-Verlag}, address = {Heidelberg}, year = {1990}, +pages = {613-620}} + +%Scheffler 1994 + +@techreport{Scheffler94, +author = {Petra Scheffler}, +title = {A practical linear time algorithm for disjoint paths in graphs with +bounded tree-width}, +institution = {TU Berlin, Fachbereich Mathematik}, +type={Report}, +number = {396/1994}, +address={Berlin}, year = 1994} + +%Schi + +@article{SchieberM89, +author = {Baruch Schieber and Shlomo Moran}, +title = {Parallel algorithms for maximum bipartite matchings and +maximum 0-1 flows}, +journal = jpdc, volume = 6, year = 1989 } + +@article{Schiermeyer08, +author = {Ingo Schiermeyer}, +title = {Efficiency in exponential time for domination-type problems}, +journal = dam, volume = 156, year = 2008, pages = {3291-3297}} + +%Scho + +@inproceedings{Schoening05, +author = {Uwe Sch\"{o}ning}, +title = {Algorithmics in Exponential Time}, +booktitle = stacs05, +publisher = lncs3404, year = 2005, pages = {36-43}} + +@article{Schoening06, +author = {Uwe Sch\"{o}ning}, +title = {Smaller superconcentrators of density 28}, +journal = ipl, volume = 28, pages = {127-129}, year = 2006} + +%Schr + +@book{Schrijver86, +author = {Alexander Schrijver}, +title = {Theory of Linear and Integer Programming}, +publisher = {John Wiley \& Sons}, +address = {Chichester}, year = 1986} + +@article{Schrijver91, +author = {A. Schrijver}, +title = {Disjoint Homotopic Paths and Trees in a Planar Graph}, +journal = dcg, volume = 6, year = 1991, pages = {527-574}} + +@book{Schrijver03, +author = {Alexander Schrijver}, +title = {Combinatorial Optimization. Polyhedra and Efficiency}, +year = 2003, +publisher = {Springer}, address = {Berlin}} + +%Schw + +@article{SchwarzT06, +author = {C. Schwarz and D. S. Troxell}, +title = {{$L(2,1)$}-labelings of {C}artesian products of two cycles}, +journal = dam, volume = 154, year = 2006, pages = {1522-1540}} + +@article{SchwikowskiS02, +author = {Benno Schwikowski and Ewald Speckenmeyer}, +title = {On enumerating all minimal solutions of feedback problems}, +journal = dam, volume = 117, year = 2002, pages = {253-265}} + +%Se + +%See + +%Seese 1975 + +@article{Seese75, +author = {Detlef Seese}, +title = {Zur {E}ntscheidbarkeit der monadische {T}heorie 2. {S}tufe baumartiger {G}raphen}, +journal = {W.Z. der Humbolt-Universit\"{a}t zu Berlin}, +volume = {Math.-Nat. R. XXIV}, +year = 1975, number = 6, pages = {768-772}} + +@article{Seese75a, +author = {Detlef Seese}, +title = {Ein {U}nentscheidbarkeitskriterium}, +journal = {W.Z. der Humbolt-Universit\"{a}t zu Berlin}, +volume = {Math.-Nat. R. XXIV}, +year = 1975, number = 6, pages = {772-780}} + +%Seese 1979 + +@article{Seese79, +author = {Detlef Seese}, +title = {Some graph theoretical operations and decidability}, +journal = {Mathematische Nachrichten}, volume = 87, year = 1979, pages = {15-21}} + +%Seese 1985 + +@inproceedings{Seese85, +author = {Detlef Seese}, +title = {Tree-partite graphs and the complexity of algorithms}, +editor = {L. Budach}, +year = 1985, booktitle = fct85, publisher = lncs199, pages = {412-421}} + +%Seese 1989 + +@unpublished{Seese89, +author = {Detlef Seese}, +title = {Interpretability and Tree Automata: A Simple Way to Solve Algorithmic Problems Closely Related to Graphs}, +year = 1989, note = {Preprint}, pages = {1-63}} + +@unpublished{SeeseW89a, +author = {Detlef G. Seese and W. Wessel}, +title = {Graphminoren und Gitter, Zu einigen Arbeiten +von N. Robertson und P. D. Seymour}, +note = {Preprint}, pages = {1-77}, year = 1989} + +@article{SeeseW89, +author = {Detlef G. Seese and W. Wessel}, +title = {Grids and their minors}, +journal = jctb, volume = 47, year = 1989, pages = {349-360}} + +%Seese 1991 + +@article{Seese91, +author = {Detlef Seese}, +title = {The structure of the models of decidable monadic theories of +graphs}, +journal = apal, volume = 53, year = 1991, pages = {169-195}} + +@unpublished{Seese91a, +author = {Detlef Seese}, +title = {Interpretability and Tree Automata: a Simple Way to Solve +Algorithmic Problems on Graphs Closely Related to Trees}, +year = 1991, +note = {Manuscript}} + +%Seg + +@article{Segawa94, +author = {Tomomi Segawa}, +title = {Radius increase caused by edge deletion}, +journal = {SUT Journal of Mathematics}, volume = 30, year = 1994, pages = {159-162}} + +%Set + +@article{Sethi75, +author = {R. Sethi}, +title = {Complete register allocation problems}, +journal = siamjc, volume = 4, year = 1975, pages = {226-248}} + +%Sey + +%Seymour 1980 + +@article{Seymour80, +author = {Paul D. Seymour}, +title = {Disjoint paths in graphs}, +journal = dm, volume = 29, year = 1980, pages = {293-309}} + +%Seymour 1989 + +%Seymour 1990 + +@article{Seymour90, +author = {Paul D. Seymour}, +title = {Colouring series-parallel graphs}, +journal = comb, volume = 85, pages = {12-75}, year = 1990} + +%Seymour 1993 + +@article{SeymourT93, +author = {Paul D. Seymour and Robin Thomas}, +title = {Graph Searching and a Minimax Theorem for Tree-width}, +journal = jctb, volume = 58, year = 1993, pages = {239-257}} + +%Seymour 1994 + +@article{SeymourT94, +author = {Paul D. Seymour and Robin Thomas}, +title = {Call routing and the ratcatcher}, +journal = combinatorica, volume = 14, number = 2, year = 1994, pages = {217-241}} + +%Seymour 2006 + +%Note: this is a reissue of Seymour80: +@article{Seymour06, +author = {P. D. Seymour}, +title = {Disjoint paths in graphs}, +journal = dm, volume = 306, pages = {979-991}, year = 2006} + +%Sh + +%Sha + +@article{ShamirS04, +author = {Ron Shamir and Roded Sharan}, +title = {A fully dynamic algorithm for modular decomposition and recognition +of cographs}, +journal = dam, volume = 136, pages = {329-340}, year = 2004} + +@article{Shannon88, +author = {Gregory E. Shannon}, +title = {A Linear-Processor Algorithm for Depth-First Search in Planar +Graphs}, +journal = ipl, volume = 29, year = 1988, pages = {119-123}} + +@article{ShashaZ90, +author = {Dennis Shasha and Kaizhong Zhang}, +title = {Fast algorithms for the unit cost editing distance between +trees}, +journal = ja, volume = 11, year = 1990, pages = {581-621}} + +%Shc + +@Article{Shcherbina07, + author = {O. A. Shcherbina}, + title = {Tree Decompositions and Discrete Optimization + Problems: {A} Survey}, + journal = {Cybernetics and Systems Analysis}, + year = {2007}, + volume = {43}, + number = {4}, + pages = {549--562}, +} + +%Shi + +@article{ShihH89, +author = {W.-K. Shih and W.-L. Hsu}, +title = {An $O(n log n + m log log n)$ maximum weight clique algorithm +for circular-arc graphs}, +journal = ipl, volume = 31, year = 1989, pages = {129-134}} + +@article{Shiloach79, +author = {Y. Shiloach}, +title = {A Minimum Linear Arrangement Algorithms for Undirected +Trees}, +journal = siamjc, volume = 8, pages = {15-32}, year = 1979 } + +@article{Shiloach79a, +author = {Y. Shiloach}, +title = {A polynomial solution to the undirected two paths problem}, +journal = jacm, volume = 27, year = 1980, pages = {445-456}} + +@article{ShiloachV82, +author = {Y. Shiloach and U. Vishkin}, +title = {An {${O}(n \log n )$} parallel connectivity algorithm}, +journal = ja, year = 1982, pages = {57-67}} + +@article{Shimony94, +author = {S. E. Shimony}, +title = {Finding {MAPs} for belief networks is {NP}-hard}, +journal = artint, volume = 68, pages = {399-410}, year = 1994} + +%Sho + +@unpublished{ShoikhetG97a, +author = {Kirill Shoikhet and Dan Geiger}, +title = {Finding optimal triangulations via minimal vertex separators}, +note = {Manuscript}, year = 1997} + +@inproceedings{ShoikhetG97, +author = {Kirill Shoikhet and Dan Geiger}, +title = {A practical algorithm for finding optimal triangulations}, +booktitle = aaai97, publisher = {Morgan Kaufmann}, year = 1997, pages = {185-190}} + +%Si + +%Sid + +@article{Sidorowicz07, +author = {E. Sidorowicz}, +title = {The game chromatic number and the game colouring number of cactuses}, +journal = ipl, volume = 102, year = 2007, pages = {147-151}} + +%Sie + +@Book{SiekLL01, +author = {Jeremy G. Siek and Lie-Quan Lee and Andrew Lumsdaine}, +title = {{The Boost Graph Library: User Guide and Reference Manual}}, +publisher = {Addison-Wesley Professional}, +year = {2001}, +note = {Software available on \url{http://www.boost.org}}} + +%Sig + +@article{SigarretaR09, +author = {J. M. Sigarreta and J. A. Rodr\'{\i}guez}, +title = {On the global offensive alliance number of a graph}, +journal = dam, volume = 157, year = 2009, pages = {219-226}} + +%Sim + +@phdthesis{Simon75, +author = {J. Simon}, +title = {On Some Central Problems in Computational Complexity}, +school = {Cornell University}, +address = {Ithaca, N.Y.}, +year = 1975} + +@inproceedings{Simon77, +author = {Janos Simon}, +title = {On the difference between one and many}, +booktitle = icalp77, publisher = lncs52, year = 1977, pages = {480-491}} + +@article{Simonovits67, +author = {M. Simonovits}, +title = {A new proof and generalizations of a theorem of {E}rd\"{o}s and {P}\'{o}sa on graphs without $k+1$ independent circuits}, +journal = {Acta Mathematica Academiae Scientiarum Hungaricae}, volume = 18, year = 1976, pages = {191-206}} + +@phdthesis{Simonson86, +author ={Shai Simonson}, +title = {Layout Problems on Graphs}, +school = {EECS Department, Northwestern University}, +year = 1986} + +@article{Simonson87, +author ={Shai Simonson}, +title = {A variation on the Min Cut Linear Arrangement Problem}, +journal = mst, volume = 20, year = 1987, pages = {235-252}} + +@article{SimonsonS92, +author = {Shai Simonson and I. Hal Sudborough}, +title = {On the complexity of tree embedding problems}, +journal = ipl, volume = 44, year = 1992, pages = {323-328}} + +%Sk + +%Sko + +@article{Skodinis01, +author = {Konstantin Skodinis}, +title = {The complexity of the {$K_{n,n}$}-problem for node replacement graph +languages}, +journal = ic2, volume = 168, pages = {95-112}, year = 2001} + +@article{Skodinis03, +author = {Konstantin Skodinis}, +title = {Construction of linear tree-layouts which are optimal with respect to +vertex separation in linear time}, +journal = ja, volume = 47, pages = {40-59}, year = 2003} + +@inproceedings{Skowronska82, +author = {M. Skoronska}, +title = {Efficient vertex- and edge-coloring of {H}alin Graphs}, +booktitle = {Proceedings of the 3rd Czechoslovak Symposium on Graph Theory}, +address = {Prague}, +year = 1982 +} + +%Sl + +@article{Slisenko82, +author = {A. O. Slisenko}, +title = {Context-free graph grammars as a tool for describing +polynomial-time subclasses of hard problems}, +journal = ipl, year = 1982, pages = {52-56}, volume = 14} + +%Sn + +@phdthesis{Snir04, +author = {S. Snir}, +title = {Computational Issues in Phylogenetic Reconstruction: Analytic Maximum +Likelihood Solutions, and Convex Recoloring}, +school = {Department of Computer Science, Technion}, +address = {Haifa, Israel}, +year = 2004} + +%So + +@inproceedings{SongLMPC05, +author = {Y. Song and C. Liu and R. Malmberg and F. Pan and L. Cai}, +title = {Tree Decomposition Based Fast Search of {RNA} Structures Including Pseudoknots in Genomes}, +booktitle = {Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference, CSB'05}, +year = {2005}, +isbn = {0-7695-2344-7}, +pages = {223--234}, +doi = {http://dx.doi.org/10.1109/CSB.2005.52}, +publisher = {IEEE Computer Society}, +address = {Washington, DC, USA}, +} + +%Sp + +%Spi + +@article{Spinrad91, +author = {Jeremy P. Spinrad}, +title = {Finding large holes}, +journal = ipl, volume = 39, year = 1991, pages = {227-229}} + +@article{Spinrad94, +author = {Jeremy P. Spinrad}, +title = {Recognition of circle graphs}, +journal = ja, volume = 16, year = 1994, pages = {264-282}} + +%Spr + +@article{Sprague94, +author = {A. P. Sprague}, +title = {An {$O(n \log n)$} algorithm for the bandwidth of interval graphs}, +journal = sjdm, volume = 7, year = 1994, pages = {213-220}} + +%Sr + +%Sre + +@article{Srebo03, +author = {N. Srebo}, +title = {Maximum likelihood bounded tree-width Markov networks}, +journal = ai, volume = 143, pages = {123-138}, year = 2003} + +%Sri + +@inproceedings{SrinivasN96, +author = {Shenoy Srinivas and Pandurang Nayak}, +title = {Efficient enumeration of instantiations of {B}ayesian networks}, +editor = {Eric Horvitz and Finn Verner Jensen}, +booktitle = uai96, year = 1996, pages = {500-508}, publisher = {Morgan Kaufmann}} + +%St + +%Sta + +@inproceedings{Stamm90, +author = {Hermann Stamm}, +title = {On feedback problems in planar digraphs}, +editor = {Rolf M\"{o}hring}, +booktitle = wg90, publisher = lncs484, pages = {79-89}, year = 1991} + +%Ste + +@article{StearnsH96, +author = {Richard E. Stearns and Harry B. {Hunt III}}, +title = {An algebraic model for combinatorial problems}, +journal = siamjc, volume = 25, year = 1996, pages = {448-476}} + +@article{StearnsH02, +author = {Richard E. Stearns and Harry B. {Hunt III}}, +title = {Exploiting structure in quantified formulas}, +journal = ja, volume = 43, year = 2002, pages = {220-263}} + +@article{Steel92, +author="M. Steel", +title="The complexity of reconstructing trees from +qualitative characters and subtrees", +journal="J. of Classification", +volume="9", +year="1992", +pages="91--116" } + +@unpublished{Stewart88?, +author = {Iain A. Stewart}, +title = {Colouring perfect planar graphs in parallel}, +year = 1988, +note = {Manuscript} +} + +%Sto + +@article{Stockmeyer76, +author = {L. J. Stockmeyer}, +title = {The polynomial-time hierarchy}, +journal = tcs, year = 1976, volume = 3, pages = {1-22}} + +@article{StockmeyerC79, +author = {L. J. Stockmeyer and A. K. Chandra}, +title = {Provably difficult combinatorial games}, +journal = siamjc, volume = 8, pages = {151-174}, year = 1979 } + +@article{Storer83, +author = {J. A. Storer}, +title = {On the complexity of chess}, +journal = jcss, volume = 27, pages = {77-100}, year = 1983} + +%Str + +@article{Strassen69, +author = {V. Strassen}, +title = {Gaussian elimination is not optimal}, +journal = {Numerische Mathematik}, volume = 14, year = 1969, pages = {354-356}} + +%Su + +%Suc + +@article{SuchanT07, +author = {Karol Suchan and Ioan Todinca}, +title = {On powers of graphs of bounded NLC-width (clique-width)}, +journal = dam, volume = 155, year = 2007, pages = {1885-1893}} + +@article{SuchanT09, +author = {Karol Suchan and Ioan Todinca }, +title = {Minimal interval completion through graph exploration}, +journal = tcs, volume = 410, year = 2009, pages = {35-43}} + +@unpublished{SuchanV09, +author = {Karol Suchan and Yngve Villanger}, +title = {Computing pathwidth faster than $2^n$}, +year = 2009, +note = {To appear in Proceedings IWPEC 2009}} + +%Sud + +@article{Sudborough87, +author = {Ivan Hal Sudborough}, +title = {``{C}utwidth'' and Related Graph Problems}, +journal = beatcs, +pages = {79-110}, +year = 1987, +month = 2 +} + +%Sug + +@article{SugiharaS89, +author = {Kazuo Sugihara and Ichiro Suzuki}, +title = {Optimal algorithms for a pursuit-evasion problem in grids}, +journal = sjdm, volume = 2, year = 1989, pages = {126-143}} + +%Sun + +@article{SundaramSR94, +author = {Ravi Sundaram and Karan {Sher Singh} and C. {Pandu Rangan}}, +title = {Treewidth of circular-arc graphs}, +year = 1994, journal = sjdm, volume = 7, pages = {647-655}} + +%Suz + +@article{SuzukiTN90, +author = {H. Suzuki and N. Takahashi and Takao Nishizeki}, +title = {A linear algorithm for bipartition of biconnected graphs}, +journal = ipl, volume = 33, pages = {227-231}, year = 1990 } + +%Sy + +@inproceedings{Sy92, +author = {Bon K. Sy}, +title = {Reasoning {MPE} to multiply connected belief networks using message passing}, +booktitle = aaai92, publisher = {AAAI Press}, year = 1992, pages = {570-576}} + +%Sys + +@article{Syslo79, +author = {Maciej M. Sys{\l}o}, +title = {Characterisations of outerplanar graphs}, +journal = dm, volume = 26, year = 1979, pages = {47-53}} + +@article{Syslo82, +author = {Maciej M. Sys{\l}o}, +title = {The subgraph isomorphism problem for outerplanar graphs}, +journal = tcs, volume = 17, year = 1982, pages = {91-97}} + +@article{Syslo82b, +author = {Maciej M. Sys{\l}o}, +title = {A labeling algorithm to recognize a line graph and output its root graph}, +journal = ipl, volume = 15, year = 1982, pages = {28-30}} + +@inproceedings{Syslo83, +author = {Maciej M. Sys{\l}o}, +title = {{NP}-Complete Problems On Some Tree-Structured Graphs: A Review}, +editor = {M. Nagl and J. Perl}, +booktitle = wg83, year = 1983, pages = {342-353}, +publisher = {University Verlag Rudolf Trauner}, +address = {Linz, West Germany}} + +@inproceedings{SysloP83, +author = {Maciej M. Sys{\l}o and Andrzej Proskurowski}, +title = {On {H}alin graphs}, +booktitle = {Graph Theory, Lagow, 1981}, +publisher = lncs1018, pages = {248-256}, year = 1983} + +@article{Syslo84, +author = {Maciej M. Sys{\l}o}, +title = {Series-parallel graphs and depth-first search trees}, +journal = ieeetcs, +volume = {CAS-31}, number = 12, year = 1984, month = {12}, pages = +{1029-1033}} + +@inproceedings{Syslo86, +author = {Maciej M. Sys{\l}o}, +title = {On Some Generalizations of Outerplanar Graphs: Results and Open Problems}, +editor = {G. Tinhofer and G. Schmidt}, +booktitle = wg86, publisher = lncs246, year = 1986, pages = {146-164}} + +%Sz + +@article{SzekeresW68, +author = {G. Szekeres and H. S. Wilf}, +title = {An inequality for the chromatic number of a graph}, +journal = jct, volume = 4, year = 1968, pages = {1-3}} + +%T + +%Ta + +%Tak + +@article{TakahashiUK91, +author = {Atsushi Takahashi and Shuichi Ueno and Yoji Kajitani}, +title = {Minimal Acyclic Forbidden Minors for the Family of Graphs +with Bounded Path-Width}, +journal = dm, pages={293 - 304}, volume = 127, number = {1/3}, year = 1994} + +@article{TakahashiUK91a, +author = {Atsushi Takahashi and Shuichi Ueno and Yoji Kajitani}, +title = {Mixed-Searching and Proper-Path-Width}, +journal = tcs, volume = 137, year = 1995, pages = {253-268}} + +@article{TakahashiUK95, +author = {Atsushi Takahashi and Shuichi Ueno and Yoji Kajitani}, +title = {Mixed-Searching and Proper-Path-Width}, +journal = tcs, volume = 137, year = 1995, pages = {253-268}} + +@article{TakahashiUK95a, +author = {Atsushi Takahashi and Shuichi Ueno and Yoji Kajitani}, +title = {Minimal forbidden minors for the family of graphs with proper-path-width at most two}, +journal = {IEICE Trans. Fund.}, volume = {E78-A}, year = 1995, pages = {1828-1839}} + +@article{TakamizawaNS82, +author = {K. Takamizawa and Takao Nishizeki and N. Saito}, +title = {Linear-time computability of combinatorial problems on series-parallel graphs}, +journal = jacm, volume = 29, year = 1982, pages = {623-641}} + +@article{Takaoka92, +author = {Tadao Takaoka}, +title = {A new upper bound on the complexity of the all pairs shortest path problem}, +journal = ipl, volume = 43, year = 1992, pages = {195-199}} + + +%Tam + +@article{Tamassia87, +author = {R. Tamassia}, +title = {On embedding a graph in the grid with the minimum number of bends}, +journal = siamjc, volume = 16, pages = {421-444}, year = 1987} + +%Tan + +@article{Tan91, +author = {Jimmy J. M. Tan}, +title = {A necessary and sufficient condition for the existence of a complete stable matching}, +journal = ja, volume = 12, year = 1991, pages = {154-178}} + +%Tar + +%Tarjan 1972 + +@article{Tarjan72, +author = {Robert Endre Tarjan}, +title = {Depth first search and linear graph algorithms}, +journal = siamjc, volume = 1, year = 1972, pages = {146-160}} + +@techreport{Tarjan72a, +author = {Robert Endre Tarjan}, +title = {Finding a maximum clique}, +type = {Technical report}, +institution = {Department of Computer Science, Cornell University, Ithaca, NY}, +year = 1972} + +%Tarjan 1974 + +@article{Tarjan74, +author = {Robert Endre Tarjan}, +title = {A note on finding the bridges of a graph}, +journal = ipl, volume = 2, year = 1974, pages = {160-161}} + +%Tarjan 1975 + +@article{Tarjan75, +author = {R. E. Tarjan}, +title = {Efficiency of a good but not linear set union algorithm}, +journal = jacm, volume = 22, year = 1975, pages = {215-225}} + +%Tarjan 1975 + +@article{TarjanT77, +author = {R. E. Tarjan and A. Trojanowski}, +title = {Finding a maximum independent set}, +journal = siamjc, volume = 6, year = 1977, pages = {537-546}} + +%Tarjan 1983 + +@book{Tarjan83, +author = {Robert Endre Tarjan}, +title = {Data Structures and Network Algorithms}, +publisher = {SIAM}, +address = {Philadelphia, PA}, +year = 1983 } + +%Tarjan 1984 + +@article{TarjanY84, +author = {Robert Endre Tarjan and Mihalis Yannakakis}, +title = {Simple linear time algorithms to test chordiality of graphs, test acyclicity of graphs, and selectively reduce acyclic hypergraphs}, +journal = siamjc, volume = 13, pages = {566-579}, year = 1984 } + +%Tarjan 1985 + +@article{Tarjan85, +author = {Robert Endre Tarjan}, +title = {Decomposition by clique separators}, +journal = dm, volume = 55, year = 1985, pages = {221-232}} + +@article{TarjanV85, +author = {Robert Endre Tarjan and Uzi Vishkin}, +title = {An efficient parallel biconnectivity algorithm}, +journal = siamjc, volume = 14, number = 4, year = 1985, pages = {862-874}} + +@book{TarskiMR53, +author = {A. Tarski and A. Mostowski and R. M. Robinson}, +title = {Undecidable Theories}, +publisher = {North-Holland Publishing Company}, +year = 1953, pages = {xi+98 pp.}} + +%Taz + +@article{TazariM09, +author = {Siamak Tazari and Matthias M\"{u}ller-Hannemann}, +title = {Shortest paths in linear time on minor-closed graph classes, with an +application to {S}teiner tree approximation}, +journal = dam, volume = 157, year = 2009, pages = {673-684}} + +%Te + +%Tel + +%Telle 1993 + +@article{TelleP93, +author = {Jan Telle and Andrzej Proskurowski}, +title = {Efficient Sets in Partial $k$-Trees}, +journal = dam, volume = 44, year = 1993, pages = {109-117}} + +@inproceedings{TelleP93a, +author = {Jan Telle and Andrzej Proskurowski}, +title = {Practical algorithms on partial $k$-trees with an application to domination-like problems}, +editor = {Frank K. H. A. Dehne and J\"{o}rg-R\"{u}diger Sack and Nicola Santoro and Sue Whitesides}, +booktitle = wads93, publisher = lncs709, year = 1993, pages = {610-621}} + +%Telle 1994 + +@phdthesis{Telle94, +author = {Jan Arne Telle}, +title = {Vertex Partitioning Problems: Characterization, Complexity and Algorithms on Partial $k$-Trees}, +school = {Department of Computer and Information Science, University of +Oregon}, address = {Eugene, Oregon, USA}, +year = 1994} + +@article{Telle94a, +author = {Jan Arne Telle}, +title = {Complexity of Domination-Type Problems in Graphs}, +journal = nordicjc, volume = 1, year = 1994, pages = {157-171}} + +%Telle 1997 + +@article{TelleP97, +author = {Jan Arne Telle and Andrzej Proskurowski}, +title = {Algorithms for vertex partitioning problems on partial $k$-trees}, +journal = sjdm, volume = 10, year = 1997, pages = {529 - 550}} + +%Telle 2005 + +@article{Telle01, +author = {Jan Arne Telle}, +title = {Tree-decompositions of small pathwidth}, +journal = dam, volume = 145, year = 2005, pages = {210-218}} + +%Th + +%Tha + +@article{ThatcherW68, +author = {J. W. Thatcher and J. B. Wright}, +title = {Generalized Finite Automata Theory with an Application to a Decision Problem in Second-Order Logic}, +journal = mst, volume = 2, year = 1988, pages = {57-81}} + +%Thi + +%Thilikos 1997 + +@techreport{Thilikos97, +author = {Dimitrios M. Thilikos}, +title = {Algorithms and Obstructions for Linear-Width and Related Search Parameters}, +number = {UU-CS-97-35}, +year = 1997, +institution = {Department of Computer Science, Utrecht University}, +address = {Utrecht}, +type = {Technical Report}} + +@article{ThilikosB97, +author = {Dimitrios M. Thilikos and Hans L. Bodlaender}, +title = {Fast partitioning $l$-apex graphs with applications to approximating +maximum induced-subgraph problems}, +journal = ipl, volume = 61, pages = {227-232}, year = 1997} + +%Thilikos 1999 + +@article{Thilikos99, +author = {Dimitrios M. Thilikos}, +title = {Quickly excluding $K_{2,r}$ from planar graphs}, +journal = {Electronic Notes in Discrete Mathematics}, year = 1999, volume = 3, pages = {189-194}} + +%Thilikos 2000 + +@article{Thilikos00, +author = {Dimitrios M. Thilikos}, +title = {Algorithms and obstructions for linear-width and related search parameters}, +journal = dam, volume = 105, year = 2000, pages = {239-271}} + +@techreport{ThilikosSB00, +author = {Dimitrios M. Thilikos and Maria J. Serna and Hans L. Bodlaender}, +title = {A constructive linear time algorithm for small cutwidth}, +institution = {Departament de Llenguatges i Sistemes Informatics, +Universitat Politecnica de Catalunya}, +address = {Barcelona, Spain}, +number = {LSI-00-48-R}, +year = 2000 +} + +@inproceedings{ThilikosSB00a, +author = {Dimitrios M. Thilikos and Maria J. Serna and Hans L. Bodlaender}, +title = {Constructive linear time algorithms for small cutwidth and carving-width}, +editor = {D.T. Lee and Shang-Hua Teng}, +booktitle = isaac00, publisher = lncs1969, pages = {192--203}, year = {2000}} + +%Thilikos 2005 + +@article{ThilikosSB05, +author = {Dimitrios M. Thilikos and Maria J. Serna and Hans L. Bodlaender}, +title = {Cutwidth {I}: {A} linear time fixed parameter algorithm}, +journal = ja, volume = 56, pages = {1-24}, year = 2005} + +@article{ThilikosSB05a, +author = {Dimitrios M. Thilikos and Maria J. Serna and Hans L. Bodlaender}, +title = {Cutwidth {II}: {Algorithms} for partial $w$-trees of bounded degree}, +journal = ja, volume = 56, pages = {25-49}, year = 2005} + +%Tho + +@article{Thomas85, +author = {Robin Thomas}, +title = {Graphs without {$K_4$} and well-quasi-ordering}, +journal = jctb, volume = 38, pages = {240-247}, year = 1985} + +@article{Thomas90, +author = {Robin Thomas}, +title = {A {M}enger-like property of tree-width. {T}he finite case}, +journal = jctb, volume = 48, pages = {67-76}, year = 1990} + +@article{Thomason84, +author = {Andrew Thomason}, +title = {An extremal function for contraction of graphs}, +journal = {Mathematical Proceedings of the Cambridge Philosophical Society}, year = 1984, volume = 95, pages = {261-265}} + +@inproceedings{Thomasse09, +author = {St\'{e}phan Thomass\'{e}}, +title = {A quadratic kernel for Feedback Vertex Set}, +booktitle = soda09, +pages = {115-119}, +year = 2009} + +@unpublished{Thomassen87, +author = {C. Thomassen}, +title = {Embeddings and Minors}, +note = {Manuscript, to appear in Handbook of Combinatorics, ed. by R. L. Graham, M. +Gr\"{o}tschel and L. Lovasz, North Holland}, +year = 1987, +something = {Mat-Report No. 1987-10, pp. 1-63}} + +@article{Thomassen89, +author = {Carsten Thomassen}, +title = {The graph genus problem is {NP}-complete}, +journal = ja, volume = 10, year = 1989, pages = {568-576}} + +@article{Thomassen97, +author = {Carsten Thomassen}, +title = {A Simpler Proof of the Excluded Minor Theorem for Higher Surfaces}, +journal = jctb, volume = 70, year = 1997, pages = {306-311}} + +@article{Thorup98, +author = {Mikkel Thorup}, +title = {Structured Programs have Small Tree-Width and Good Register Allocation}, +journal = ic2, volume = 142, year=1998, pages = {159-181}} + +%To + +%Tod + +@article{Toda91, +author = {S. Toda}, +title = {PP is as hard as the polynomial-time hierarchy}, +journal = siamjc, volume = 20, year = 1991, pages = {865-877}} + +@article{TodaO92, +author = {S. Toda and M. Ogiwara}, +title = {Counting classes are at least as hard as the polynomial-time hierarchy}, +journal = siamjc, volume = 21, year = 1992, pages = {316-328}} + +@article{Toda94, +author = {Seinosuke Toda}, +title = {Simple characterizations of {P($\#$P)} and complete problems}, +journal = jcss, volume = 49, year = 1994, pages = {1-17}} + +%Tog + +@article{TogasakiY02, +author = {Mitsunori Togasaki and Koichi Yamazaki}, +title = {Pagenumber of pathwidth-$k$ graphs and strong pathwidth-$k$ graphs}, +journal = dm, volume = 259, year = 2002, pages = {361-368}} + +%Tor + +@article{Toran91, +author = {S. Toran}, +title = {Complexity classes defined by counting quantifiers}, +journal = jacm, volume = 38, year = 1991, pages = {752-773}} + +@article{TorreGS92, +author = {Pilar {de la Torre} and Raymond Greenlaw and Alejandro A. Sch\"{a}ffer}, +title = {Optimal Tree Ranking is in {{\cal NC}}}, +journal = ipl, volume = 2, number = 1, year = 1992, pages = {31-41}} + +@techreport{TorreGS93, +author = {Pilar {de la Torre} and Raymond Greenlaw and Alejandro A. Sch\"{a}ffer}, +title = {A Note on {D}eogun and {P}eng's Edge Ranking Algorithm}, +type = {Technical Report}, +number = {93-13}, +institution = {Department of Computer Science, University of New Hampshire}, +address = {Durham, New Hampshire, USA}, +year = 1993} + +@article{TorreGS95, +author = {Pilar {de la Torre} and Raymond Greenlaw and Alejandro A. Sch\"{a}ffer}, +title = {Optimal edge ranking of trees in polynomial time}, +journal = alg, volume = 13, year = 1995, pages = {592-618}} + +%Tr + +%Tra + +@article{Traldi06, +author = {Lorenzo Traldi}, +title = {On the colored {T}utte polynomial of a graph of bounded treewidth}, +journal = dam, volume = 154, year = 2006, pages = {1032-1036}} + +%Ts + +@article{TsinC84, +author = {Yung H. Tsin and Franciss Y. Chin}, +title = {Efficient parallel algorithms for a class of graph theoretic problems}, +journal = siamjc, volume = 13, year = 1984, pages = {580-599}} + +%Tu + +%Tuc + +@article{Tucker80, +author = {A. Tucker}, +title = {An efficient test for circular-arc graphs}, +journal = siamjc, volume = 9, pages = {1-24}, year = 1980 } + +@article{Tucker84, +author = {A. Tucker}, +title = {An ${O}(n^2)$ algorithm for coloring perfect planar graphs}, +journal = ja, volume = 5, year = 1984, pages = {60-68}} + +%Tur + +@article{Turing36, +author = {Alan Turing}, +title = {On computable numbers, with an application to the {E}ntscheidungsproblem}, +journal = {Proceedings of the London Mathematical Society Series 2}, volume = 42, year = 1936, pages = {230-265}} + +%Tut + +@article{Tutte54, +author = {W. T. Tutte}, +title = {A short proof of the factor theorem for finite graphs}, +journal = {Canadian Journal of Mathematics}, volume = 6, year = 1954, pages = {347-352}} + +@article{Tutte60, +author = {W. T. Tutte}, +title = {Convex representations of graphs}, +journal = {Proceedings of the London Mathematical Society}, volume = 10, year = 1960, pages = {304-320}} + +@book{Tutte84, +author = {W. T. Tutte}, +title = {Graph Theory}, +series = {Encyclopedia of Mathematics and Its Applications}, +volume = 21, +year = 1984, +publisher = {Addison-Wesley}, +address = {Menlo Park, CA}} + +%Tuz + +@unpublished{TuzaL??, +author = {Zsolt Tuza and Aristid Lindenmayer}, +title = {Locally Generated Colourings of Hexagonal Cell Division Patterns: +Application to Retinal Cell Differentiation}, +note = {Manuscript. +To appear in: Memorial Vol.? for A. Lindenmayer}} + +@article{Tuza04, +author = {Zsolt Tuza}, +title = {Strong branchwidth and local transversals}, +journal = dam, volume = 145, pages = {291-296}, year = 2004} + +%U + +%Ue + +%Ueh + +@article{UeharaU07, +author = {Ryuhei Uehara and Yushi Uno}, +title = {On computing longest paths in small graph classes}, +journal = ijfcs, year = 2007, volume = 18, pages = {911-930}} + +@inproceedings{Uehara08, +author = {Ryuhei Uehara}, +title = {Bandwidth of bipartite permutation graphs}, +editor = {Seok-Hee Hong and Hiroshi Nagamochi and Takuro Fukunaga}, +booktitle = isaac08, year = 2008, publisher = lncs5369, pages = {824-835}} + +%Un + +%Ung + +@article{Ungar51, +author = {P. Ungar}, +title = {A theorem on planar graphs}, +journal = {Journal of the London Mathematical Society}, volume = 26, year = 1951, pages = {256-262}} + +%V + +%Va + +%Val + +@article{ValdesTL82, +author = {J. Valdes and Robert Endre Tarjan and Eugene L. Lawler}, +title = {The recognition of series parallel digraphs}, +journal = siamjc, volume = 11, pages = {298-313}, year = 1982 } + +@article{Valiant79, +author = {Leslie Valiant}, +title = {The complexity of enumeration and reliability problems}, +journal = siamjc, volume = 6, year = 1979, pages = {410-421}} + +@article{Valiant79a, +author = {Leslie Valiant}, +title = {The complexity of computing the permanent}, +journal = tcs, volume = 8, year = 1979, pages = {189-201}} + +%Van + +@article{VanEmdeBoasKZ84, +author = {P. {van {Emde Boas}} and R. Kaas and E. Zijlstra}, +title = {Design and implementation of an efficient priority queue}, +journal = mst, volume = 10, year = 1984, pages = {99-127}} + +%Vas + +@article{Vassilevska09, +author = {Virginia Vassilevska}, +title = {Efficient algorithms for clique problems}, +journal = ipl, year = 2009, volume = 109, pages = {254-257}} + +%Vaz + +@article{Vazirani89, +author = {Vijay V. Vazirani}, +title = {{NC} Algorithms for Computing the Number of Perfect Matchings +in {$K_{3,3}$}-Free Graphs and Related Problems}, +journal = ic2, volume = 80, year = 1989, pages = {152-164}} + +%Vi + +%Vil + +@techreport{Villanger05, +author = {Yngve Villanger}, +title = {Counting and listing all potential maximal cliques of a graph}, +institution = {Department of Informatics, University of Bergen}, +address = {Bergen, Norway}, +type = {Reports in Informatics}, +number = {302}, +year = 2005} + +@article{Villanger06, +author = {Yngve Villanger}, +title = {{Lex M versus MCS-M}}, +journal = dm, volume = 306, year = 2006, pages = {393-400}} + +@inproceedings{Villanger06a, +author = {Yngve Villanger}, +title = {Improved exponential-time algorithms for treewidth and minimum fill-in}, +editor = {Jos\'{e} R. Correa and Alejandro Hevia and Marcos A. Kiwi}, +booktitle = latin06, publisher = lncs3887, year = 2006, pages = {800--811}} + +@article{VillangerHPT09, +author = {Yngve Villanger and Pinar Heggernes and Christophe Paul and Jan Arne Telle}, +title = {Interval completion is fixed parameter tractable}, +journal = siamjc, volume = 38, year = 2009, pages = {2007-2020}} + +%Vo + +@article{Vogler93, +author = {Walter Vogler}, +title = {On Hyperedge Replacement and {BNLC} Graph Grammars}, +journal = dam, volume = 46, pages = {253-273}, year = 1993} + +%W + +%Wa + +%Wag + +@article{Wagner37a, +author = {K. Wagner}, +title = {{\"U}ber eine {E}rweiterung eines {S}atzes von {K}uratowski}, +journal = {Deut.\ Math.}, volume = 2, year = 1937, pages = {280-285}} + +@article{Wagner37, +author = {K. Wagner}, +title = {{\"U}ber eine {E}igenshaft der Ebenen {C}omplexe}, +journal = {Math. Ann.}, volume = 14, year = 1937, pages = {570-590}} + +@inproceedings{WagnerW93, +author = {D. Wagner and K. Weihe}, +title = {A linear-time algorithm for edge-disjoint paths in planar graphs}, +editor = {Thomas Lengauer}, +booktitle = esa93, year = 1993, pages = {384-395}, publisher = lncs726} + +%Wal + +@article{WaldC83, +author = {J. A. Wald and Charles J. Colbourn}, +title = {Steiner Trees, Partial 2-Trees, and Minimum {IFI} Networks}, +journal = netw, year = 1983, volume = 13, pages = {159-167}} + +@inproceedings{WaldC82, +author = {J. A. Wald and Charles J. Colbourn}, +title = {Steiner trees in outerplanar graphs}, +booktitle = {Proceedings of the 13th Southeastern Conf. on Combinatorics, Graph Theory, and Computing}, +publisher = {Utilitas Mathematica Publishing, Winnipeg, Ont.}, +year = 1982 +} + +@article{Walter78, +author = {J. Walter}, +title = {Representations of chordal graphs as subgraphs of a tree}, +journal = jgt, volume = 2, year = 1978, pages = {265-267}} + +%Wan + +%Wang + +%Wang 2008 + +@article{WangLL08, +author = {Rui Wang and Francis C. M. Lau and Yan Yan Liu}, +title = {On the hardness of minimizing space for all-shortest-path interval routing schemes}, +journal = tcs, volume = 389, year = 2008, pages = {250-264}} + +%Wang 2010 + +@article{WangNFC10, +author = {Jianxin Wang and Dan Ning and Qilong Feng and Jianer Chen}, +title = {An improved kernelization for {$P_2$}-packing}, +journal = ipl, volume = 110, year = 2010, pages = {188-192}} + + +%Wank + +@article{WankeW89, +author = {Egon Wanke and Manfred Wiegers}, +title = {Undecidability of the bandwidth problem on linear graph languages}, +journal = ipl, volume = 33, year = 1989, pages = {193-197}} + +@techreport{Wanke91, +author = {Egon Wanke}, +title = {$k$-{NLC} Graphs and polynomial algorithms}, +number = {80}, +type = {Bericht, Reihe Informatik}, +institution = {Universit\"{a}t Paderborn}, +year = 1991, pages = {1-19}} + +@article{Wanke94, +author = {Egon Wanke}, +title = {Bounded Tree-width and {LOGCFL}}, +journal = ja, volume = 16, year = 1994, pages = {470-491}} + +@article{Wanke94a, +author = {Egon Wanke}, +title = {$k$-NLC graphs and polynomial algorithms}, +journal = dam, volume = 54, year = 1994, pages = {251-266}} + +@article{Wanless01, +author = {I. M. Wanless}, +title = {Path achievement games}, +journal = {Austalasian Journal of Combinatorics}, volume = 23, year = 2001, pages = {9-18}} + +%Wax + +@article{WaxmanI88, +author = {Bernard M. Waxman and Makoto Imase}, +title = {Worst-case performance of {R}ayward-{S}mith's {S}teiner tree heuristic}, +journal = ipl, volume = 29, year = 1988, pages = {283-287}} + +%We + +%Wei + +@article{WeifanY06, +author = {Wang Weifan and Wang Yiqiao}, +title = {$L(p,q)$-labeling of {$K_4$}-minor free graphs}, +journal = ipl, volume = 98, year = 2006, pages = {169-173}} + +%Wen + +@inproceedings{Wen90, +author = {W. X. Wen}, +title = {Optimal decomposition of belief networks}, +editor = {P. P. Bonissone and M. Henrion and L. N. Kanal and J. F. Lemmer}, +booktitle = uai90, year = 1990, pages = {245--256}, publisher = {Elsevier}} + +%Wes + +@book{West01, +author = {D. B. West}, +title = {Introduction to graph theory}, +publisher = {Prentice Hall}, +year = {2001}} + +@article{WestbrookT92, +author = {J. Westbrook and R. E. Tarjan}, +title = {Maintaining bridge-connected and biconnected components on line}, +journal = alg, volume = 7, year = 1992, pages = {433-464}} + +%Wh + +%Whi + +@article{WhiteFP85, +author = {K. White and M. Farber and W. Pulleyblank}, +title = {Steiner tress, connected domination and strongly chordal graphs}, +journal = networks, volume = 15, year = 1985, pages = {109-124}} + +@article{Whitesides81, +author = {S. Whitesides}, +title = {An algorithm for finding clique cutsets}, +journal = ipl, volume = 12, year = 1981, pages = {31-32}} + +%Wi + +%Wid + +@inproceedings{Widmayer86, +author = {P. Widmayer}, +title = {On approximation algorithm for {S}teiner's problem in graphs}, +editor = {G. Tinhofer and G. Schmidt}, +booktitle = wg86, publisher = lncs246, year = 1986, pages = {17-28}} + +%Wie + +@inproceedings{Wiegers86, +author = {Manfred Wiegers}, +title = {Recognizing Outerplanar Graphs in Linear Time}, +editor = {G. Tinhofer and G. Schmidt}, +booktitle = wg86, publisher = lncs246, year = 1986, pages = {165-176}} + +@inproceedings{WiegersM88, +author = {Manfred Wiegers and Burkhard Monien}, +title = {Bandwidth and Profile Minimization}, +editor = {J. van Leeuwen}, +booktitle = wg88, publisher = lncs344, pages = {378-393}, year = 1988} + +@inproceedings{Wiegers90, +author = {Manfred Wiegers}, +title = {The $k$-section of treewidth restricted graphs}, +editor = {B. Rovan}, +booktitle = mfcs90, publisher = lncs452, year = 1990, pages = {530-537}} + +%Wil + +@article{Wilf87, +author = {H. Wilf}, +title = {Finite Lists of Obstructions}, +journal = amm, volume = 94, year = 1987, pages = {267-271}} + +@article{Williams09, +author = {Ryan Williams}, +title = {Finding paths of length $k$ in {$O^\ast(2^k)$} time}, +journal = ipl, volume = 109, year = 2009, pages = {315-318}} + +@article{Williamson84, +author = {S. G. Williamson}, +title = {Depth-first search and {K}uratowski subgraphs}, +journal = jacm, volume = 31, year = 1984, pages = {681-693}} + +%Wim + +@article{WimerHL85, +author = {T. V. Wimer and S. T. Hedetniemi and R. Laskar}, +title = {A methodology for constructing linear graph algorithms}, +journal = cn, volume = 50, year = 1985, pages = {43-60}} + +@techreport{WimerH86, +author = {T. V. Wimer and S. T. Hedetniemi}, +title = {$k$-Terminal Recursive Families of Graphs}, +institution = {Clemson University}, +year = 1986 +} + +@phdthesis{Wimer87, +author = {T. V. Wimer}, +title = {Linear Algorithms on $k$-Terminal Graphs}, +school = {Dept. of Computer Science, Clemson University}, +year = 1987 +} + +@article{Wimer87a, +author = {T. V. Wimer}, +title = {Linear algorithms for the dominating cycle problems in series-parallel graphs, 2-trees and {H}alin graphs}, +year = 1987, journal = cn, volume = 56 } + +%Win + +@article{Winter85, +author = {Pawel Winter}, +title = {Generalized {S}teiner problem in outerplanar graphs}, +journal = bit, volume = 25, year = 1985, pages = {485-496}} + +@article{Winter86, +author = {Pawel Winter}, +title = {Generalized Steiner problem in {H}alin networks}, +journal = ja, volume = 7, year = 1986, pages = {549-566}} + +@article{Winter87, +author = {P. Winter}, +title = {Steiner problem in networks: {A} survey}, +journal = netw, volume = 17, year = 1987, pages = {129-167}} + +%Wo + +%Woe + +@inproceedings{Woeginger03, +author = {Gerhard J. Woeginger}, +title = {Exact algorithms for {NP}-hard problems: {A} survey}, +booktitle = {Combinatorial Optimization: ''Eureka, you shrink''}, +publisher = {Springer Lecture Notes in Computer Science, vol.~2570}, +address = {Berlin}, year = 2003, pages = {185-207}} + +@inproceedings{Woeginger04, +author = {Gerhard J. Woeginger}, +title = {Space and time complexity of exact algorithms: some open problems +(invited talk)}, +editor = {R. G. Downey and M. R. Fellows}, +booktitle = iwpec04, publisher = lncs3162, year = 2004, pages = {281-290}} + +@article{Woeginger08, +author = {Gerhard J. Woeginger}, +title = {Open problems around exact algorithms}, +journal = dam, volume = 156, year = 2008, pages = {397-405}} + +%Wol + +@techreport{WolleKB04, +author = {Thomas Wolle and Arie M. C. A. Koster and Hans L. Bodlaender}, +title = {A Note on Contraction Degeneracy}, +institution = {Institute of Information and Computing Sciences, Utrecht University}, +address = {Utrecht, The Netherlands}, +year = 2004, +type = {Technical Report}, +number = {UU-CS-2004-042}} + +@techreport{WolleB04, +author = {Thomas Wolle and Hans L. Bodlaender}, +title = {A Note on Edge Contraction}, +institution = {Institute of Information and Computing Sciences, Utrecht University}, +address = {Utrecht, The Netherlands}, +year = 2004, +type = {Technical Report}, +number = {UU-CS-2004-028}} + +@phdthesis{Wolle05, +author = {Thomas Wolle}, +title = {Computational Aspects of Treewidth. {L}ower Bounds and Network +Reliability}, +school = {Faculty of Science, Utrecht University}, +address = {Utrecht, the Netherlands}, +year = 2005} + +%Woo + +@inproceedings{Wood02, +author = {David R. Wood}, +title = {Queue layouts, tree-width, and three-dimensional graph drawing}, +booktitle = fsttcs02, pages = {348-359}, year = 2002, publisher = lncs2556} + +@inproceedings{WoodT06, +author = {David R. Wood and Jan Arne Telle}, +title = {Planar decompositions and the crossing number of graphs with an excluded minor}, +editor = {Michael Kaufmann and Dorothea Wagner}, +booktitle = gd06, year = 2006, publisher = lncs4372, pages = {150-161}} + +%Wu + +@article{WuZ08, +author = {Jiaojiao Wu and Xuding Zhu}, +title = {Lower bounds for the game colouring number of partial $k$-trees +and planar graphs}, +journal = dm, volume = 308, year = 2008, pages = {2637-2642}} + +%Wul + +@article{WuDJLH06, +author = {Weili Wul and Hongwei Dul and Xiaohua Jial and Yingshu Li and +Scott C.-H. Huang}, +title = {Minimum connected dominating sets and maximal independent sets in +unit disk graphs}, +journal = tcs, volume = 352, pages = {1-7}, year = 2006} + + +%X + +%Xi + +%Xin + +@article{XingCC06, +author = {Hua-Ming Xing and Xin Chen and Xue-Gang Chen}, +title = {A note on {R}oman domination in graphs}, +journal = dm, volume = 306, year = 2006, pages = {3338-3340}} + +%Xu + +%Xue + +@article{XueCN05, +author = {Y. Xue and Y. Cui and K. Nahrstedt}, +title = {Maximizing Lifetime for Data Aggregation in Wireless Sensor Networks}, +journal = {Mobile Networks and Applications}, +volume = 10, pages = {853-864}, year = {2005}} + +%Y + +%Ya + +%Yam + +@article{YamaguchiAM03, +author = {Atsuko Yamaguchi and Kiyoko F. Aoki and Hiroshi Mamitsuka}, +title = {Graph complexity of chemical compounds in biological pathways}, +journal = {Genome Informatics}, volume = 14, year = 2003, pages = {376-377}} + +@article{YamaguchiAM04, +author = {Atsuko Yamaguchi and Kiyoko F. Aoki and Hiroshi Mamitsuka}, +title = {Finding the maximum common subgraph of a partial $k$-tree and a graph with a polynomially bounded number of spanning trees}, +journal = ipl, volume = 92, year = 2004, pages = {57-63}} + +@inproceedings{YamazakiBFT97, +author = {Koichi Yamazaki and Hans L. Bodlaender and Babette {de Fluiter} and Dimitrios Thilikos}, +title = {Isomorphism for graphs of bounded distance width}, +booktitle = ciac97, publisher = lncs1203, year = 1997, pages = {276-287}} + +@article{Yamazaki01, +author = {Koichi Yamazaki}, +title = {On approximation intractability of the path-distance-width problem}, +journal = dam, volume = 110, pages = {317-325}, year = 2001} + +@article{YamazakiBFT99, +author = {Koichi Yamazaki and Hans L. Bodlaender and Babette {de Fluiter} and +Dimitrios Thilikos}, +title = {Isomorphism for graphs of bounded distance width}, +journal = alg, volume = 24, pages = {105-127}, year = 1999} + +%Yan + +@mastersthesis{Yan89, +author = {X. Yan}, +title = {A relative approximation algorithm for computing the pathwidth of outerplanar graphs}, +type = {Master thesis}, +school = {Department of Computer Science, Washington State University}, +address = {Pullman, WA, USA}, +year = 1989} + +@article{YangC08, +author = {Boting Yang and Yi Cao}, +title = {Digraph searching, directed vertex separation and directed pathwidth}, +journal = dam, volume = 156, year = 2008, pages = {1822-1837}} + +@article{YannakakisG80, +author = {Mihalis Yannakakis and Fanica Gavril}, +title = {Edge dominating sets in graphs}, +journal = sjam, volume = 38, year = 1980, PAGES = {364-372}} + +@article{Yannakakis81, +author = {Mihalis Yannakakis}, +title = {Computing the minimum fill-in is {NP}-complete}, +journal = sjadm, volume = 2, year = 1981, pages = {77-79}} + +@article{Yannakakis85, +author = {Mihalis Yannakakis}, +title = {A polynomial algorithm for the Min-Cut Linear Arrangement +of trees}, +journal = jacm, volume = 32, year = 1985, pages = {950-988}} + +@article{YannakakisG87, +author = {Mihalis Yannakakis and Fanica Gavril}, +title = {The maximum $k$-colorable subgraph problem for chordal graphs}, +journal = ipl, volume = 24, year = 1987, pages = {133-137}} + +@article{Yannakakis89, +author = {Mihalis Yannakakis}, +title = {Embedding Planar Graphs in Four Pages}, +journal = jcss, volume = 38, year = 1989, pages = {36-67}} + +%Yap + +@book{Yap86, +author = {H. P. Yap}, +title = {Some Topics in Graph Theory}, +address = {Cambridge, UK}, +series = {London Mathematical Society Lecture Note Series}, +volume = 108, +year = 1986, +publisher = {Cambridge Univ. Press}} + +%Ye + +%Yeh + +@article{Yeh06, +author = {Roger K. Yeh}, +title = {A survey on labeling graphs with a condition at distance two}, +journal = dm, volume = 306, pages = {1217-1231}, year = 2006} + +%Yen + +@article{Yen02, +author = {W. C. K. Yen}, +title = {Bottleneck domination and bottleneck independent domination on +graphs}, +journal = jise, volume = 18, year = 2002, pages = {311-331}} + +%Yu + +@article{YuC94, +author = {Chang-Wu Yu and Gen-Huey Chen}, +title = {A theorem on permutation graphs with applications}, +journal = {Information Sciences}, volume = 77, year = 1994, pages = {177-193}} + +%Z + +%Ze + +%Zei + +@article{ZeitlhoferW03, +author = {Thomas Zeitlhofer and Bernhard Wess}, +title = {List-coloring of interval graphs with application to register assignment for heterogeneous register-set architectures}, +journal = {Signal Processing}, volume = 83, year = 2003, pages = {1411-1525}} + +%Zh + +%Zha + +@article{ZhangGW09, +author = {Zhao Zhang and Xiaofeng Gao and Weili Wu}, +title = {{PTAS} for connected vertex cover in unit disk graphs}, +journal = tcs, volume = 410, year = 2009, pages = {5398-5402}} + +@book{ZhaoG04, +author = {F. Zhao and L. Guibas}, +title = {Wireless Sensor Networks: An Information Processing Approach}, +publisher = {Morgan Kaufman}, +year = 2004} + +@inproceedings{ZhaoCC07, +author = {Jizhen Zhao and Dongsheng Che and Liming Cai}, +title = {Comparative pathway annotation with protein-{DNA} interaction and operon information via graph tree decomposition}, +booktitle = {Proceedings of Pacific Symposium on Biocomputing, PSB 2007}, +pages = {496-507}, year = {2007}, volume ={12}} + +@Article{ZhaoMC08, +author = {Jizhen Zhao and Russell L. Malmberg and Liming Cai}, +title = {Rapid ab initio Prediction of {RNA} Pseudoknots via Graph Tree Decomposition}, +journal = {Journal of Mathematical Biology}, year = {2008}, volume = 56, number = {1--2}, pages = {145--159}} + +%Zho + +%Zhou 1992 + +@inproceedings{ZhouNSN92, +author = {X. Zhou and S. Nakano and H. Suzuki and T. Nishizeki}, +title = {An efficient algorithm for edge-coloring series-parallel multigraphs}, +editor = {I. Simon}, +year = 1992, booktitle = latin92, publisher = lncs583, pages = {516-529}} + +@unpublished{ZhouNSN92a, +author = {X. Zhou and S. Nakano and H. Suzuki and T. Nishizeki}, +title = {Efficient Algorithm for Edge-Coloring Partial $k$-Trees}, +year = 1992, +institution = {Department of Information Engineering, Tohoku University}, +address ={Sendai, Japan}, +note = {Manuscript}} + +%Zhou 1993 + +@inproceedings{ZhouNN93, +author = {X. Zhou and S. Nakano and T. Nishizeki}, +title = {A linear algorithm for edge-coloring partial $k$-trees}, +editor = {Thomas Lengauer}, +booktitle = esa93, year = 1993, pages = {409-418}, publisher = lncs726 } + +%Zhou 1994 + +@inproceedings{ZhouN94, +author = {X. Zhou and T. Nishizeki}, +title = {An efficient algorithm for edge-ranking trees}, +editor = {Jan van Leeuwen}, +booktitle = esa94, year = 1994, pages = {118-129}, publisher = lncs855} + +%Zhou 1995 + +@inproceedings{ZhouN95, +author = {X. Zhou and T. Nishizeki}, +title = {Finding optimal edge-rankings of trees}, +booktitle = soda95, year = 1995, pages = {122-131}} + +@article{ZhouN95a, +author = {X. Zhou and T. Nishizeki}, +title = {Optimal parallel algorithms for edge-coloring partial $k$-trees with bounded degrees}, +journal = {IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science}, +volume = {E78-A}, pages = {463-469}, year = 1995} + +@article{ZhouNN95, +author = {Xiao Zhou and Nobuaki Nagai and Takao Nishizeki}, +title = {Generalized vertex-rankings of trees}, +year = 1995, journal = ipl, volume = 56, pages = {321-328}} + +%Zhou 1996 + +@article{ZhouNN96, +author = {Xiao Zhou and S. Nakano and Takao Nishizeki}, +title = {Edge-coloring partial $k$-trees}, +journal = ja, volume = 21, year = 1996, pages = {598-617}} + +@article{ZhouSN96, +author = {Xiao Zhou and Hitoshi Suzuki and Takao Nishizeki}, +title = {A linear algorithm for edge-coloring series-parallel multigraphs}, +journal = ja, volume = 20, year = 1996, pages = {174-201}} + +@inproceedings{ZhouTN96, +author = {Xiao Zhou and Syurei Tamura and Takao Nishizeki}, +title = {Finding edge-disjoint paths in partial $k$-trees}, +editor = {Tetsuo Asano and Yoshidie Igarashi and Hiroshi Nagamochi and Satoru Miyano and Subhash Suri}, +booktitle = isaac96, publisher = lncs1178, year = 1996, pages = {203-212}} + +%Zhou 1997 + +@inproceedings{ZhouKN97, +author = {Xiao Zhou and Md. Abul Kashem and Takao Nishizeki}, +title = {Generalized edge-ranking of trees}, +editor = {Fabrizio d'Amore and Paolo Giulio Franciosa and Alberto Marchetti-Spaccamela}, +booktitle = wg96, pages = {390-404}, year = 1997, publisher = lncs1197} + +%Zhou 2000 + +@article{ZhouFN00, +author = {X. Zhou and K. Fuse and Takao Nishizeki}, +title = {A linear algorithm for finding $[g,f]$-colorings of partial $k$-trees}, +journal = alg, volume = 27, pages = {227-243}, year = 2000} + +@article{ZhouKN00, +author = {X. Zhou and Y. Kanari and Takao Nishizeki}, +title = {Generalized vertex-colorings of partial $k$-trees}, +journal = {IEICE Trans E.83-A}, volume = 4, year = 2000, pages = {671-677}} + +%Zhu + +@article{Zhu00, +author = {Xuding Zhu}, +title = {The game coloring number of pseudo partial $k$-trees}, +journal = dam, volume = 215, year = 2000, pages = {245-262}} + +%Zm + +@article{ZmazekZ04, +author = {Bla \~{Z}mazek and Janez \~{Z}erovnik}, +title = {The obnoxious center problem on weighted cactus graphs}, +journal = dam, volume = 136, pages = {377-386}, year = 2004} + +%%%% REFERENCES WITHOUT AUTHOR NAMES %%%% + +@misc{TreewidthLIB, +key = {TreewidthLIB}, +title= {TreewidthLIB}, +year = {2004-- \ldots}, +url = {http://www.cs.uu.nl/people/hansb/treewidthlib}, +howpublished = {http://www.cs.uu.nl/people/hansb/treewidthlib} +} + +@Misc{DIMACS_challenge2, +key = {DIMACS}, +title = {The Second {DIMACS} Implementation Challenge: {NP-Hard Problems: +Maximum Clique, Graph Coloring, and Satisfiability}}, +howpublished = {See http://dimacs.rutgers.edu/Challenges/}, +year = {1992--1993} +} + +@misc{Boost, +key = {Boost}, +title = {Boost {C}++ Libraries}, +howpublished = {http://www.boost.org/}, +year = {1999--2009} +} + +@misc{Koster2008, + key={ComputeTW}, + author = {Arie M. C. A. Koster}, + title={{ComputeTW} -- {A}n interactive platform for computing Treewidth of graphs}, + year={2009}, + note = {http://www.math2.rwth-aachen.de/{$\sim$}koster/ComputeTW} +} diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/related.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/related.bcf new file mode 100644 index 00000000000..1f455dc583e --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/related.bcf @@ -0,0 +1,210 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <!-- CROSSREF --> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <!-- SORTING --> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">citeorder</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">related.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>key1</bcf:citekey> + <bcf:citekey>key2</bcf:citekey> + <bcf:citekey>key3</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/related.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/related.bib new file mode 100644 index 00000000000..c56530cefd6 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/related.bib @@ -0,0 +1,52 @@ +@Article{key1, + RELATED = {key2,key3,key4,missing1}, + RELATEDTYPE = {reprintas}, + AUTHOR = {Author}, + TITLE = {Original Title}, + JOURNALTITLE = {Journal Title}, + VOLUME = {12}, + NUMBER = {5}, + DATE = {1998}, + PAGES = {125--150}, + SHORTHAND = {RK1} +} + +@InBook{key2, + RELATED = {key1}, + RELATEDTYPE = {reprintof}, + RELATEDSTRING = {First}, + AUTHOR = {Author}, + TITLE = {Reprint Title}, + BOOKTITLE = {Booktitle}, + LOCATION = {Location}, + PUBLISHER = {Publisher}, + DATE = {2009}, + PAGES = {34--60}, + SHORTHAND = {RK2} +} + +@InBook{key3, + RELATED = {key1}, + RELATEDTYPE = {reprintof}, + RELATEDSTRING = {Second}, + AUTHOR = {Author}, + TITLE = {Reprint Title}, + BOOKTITLE = {Booktitle}, + LOCATION = {Location}, + PUBLISHER = {Publisher2}, + DATE = {2010}, + PAGES = {33--57}, + SHORTHAND = {RK3} +} + +@InBook{key4, + AUTHOR = {Author}, + TITLE = {Reprint Title}, + BOOKTITLE = {Booktitle}, + LOCATION = {Location}, + PUBLISHER = {Publisher2}, + DATE = {2011}, + PAGES = {33--57}, + SHORTHAND = {RK4} +} + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/sections-complex.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/sections-complex.bcf new file mode 100644 index 00000000000..c5e3e947e03 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/sections-complex.bcf @@ -0,0 +1,262 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="collection"> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shorteditor</bcf:value> + <bcf:value order="2">editor</bcf:value> + <bcf:value order="3">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <!-- CROSSREF --> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <!-- SORTING --> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">labelalpha</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5" sort_direction="descending"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem substring_side="right" substring_width="4" order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1" pad_char="0">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + <bcf:sort order="7"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">labelalpha.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>L1</bcf:citekey> + <bcf:citekey>L2</bcf:citekey> + <bcf:citekey>L3</bcf:citekey> + <bcf:citekey>L4</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> + <bcf:bibdata section="1"> + <bcf:datasource type="file" datatype="bibtex">labelalpha.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="1"> + <bcf:citekey>L5</bcf:citekey> + <bcf:citekey>L6</bcf:citekey> + <bcf:citekey>L7</bcf:citekey> + <bcf:citekey>L8</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/sections.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/sections.bcf new file mode 100644 index 00000000000..525bda96229 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/sections.bcf @@ -0,0 +1,292 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="collection"> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shorteditor</bcf:value> + <bcf:value order="2">editor</bcf:value> + <bcf:value order="3">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <!-- CROSSREF --> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <!-- SORTING --> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2"> + <bcf:sortitem order="1">labelalpha</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5" sort_direction="descending"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem substring_side="right" substring_width="4" order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1" pad_char="0">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + <bcf:sort order="7"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">sections1.bib</bcf:datasource> + <bcf:datasource type="file" datatype="bibtex">sections2.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>sect1</bcf:citekey> + <bcf:citekey>sect2</bcf:citekey> + <bcf:citekey>sect3</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> + <!-- SECTION 1 --> + <bcf:bibdata section="1"> + <bcf:datasource type="file" datatype="bibtex">sections3.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="1"> + <bcf:citekey>sect4</bcf:citekey> + <bcf:citekey>sect5</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> + <!-- SECTION 2 --> + <bcf:bibdata section="2"> + <bcf:datasource type="file" datatype="bibtex">sections4.bib</bcf:datasource> + <bcf:datasource type="file" datatype="bibtex">sections1.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="2"> + <bcf:citekey>sect1</bcf:citekey> + <bcf:citekey>sect6</bcf:citekey> + <bcf:citekey>sect7</bcf:citekey> + <bcf:citekey>sect3</bcf:citekey> <!-- Bad key for section 2, should be dropped in tests --> + <bcf:citekey>sectx</bcf:citekey> <!-- Bad key for section 2, should be dropped in tests --> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> + <!-- SECTION 3 --> + <bcf:bibdata section="3"> + <bcf:datasource type="file" datatype="bibtex">sections1.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="3"> + <bcf:citekey>*</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> + <!-- SECTION 0 --> + <bcf:section number="0"> + <bcf:citekey>sect8</bcf:citekey> + </bcf:section> +</bcf:controlfile> + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/sections1.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/sections1.bib new file mode 100644 index 00000000000..877b01c7ee1 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/sections1.bib @@ -0,0 +1,34 @@ +@PREAMBLE{"Å tring for Preamble 1"} + +@STRING{STRING1 = {value1}} + +@ARTICLE{sect1, + SHORTHAND = {AA}, + AUTHOR = {Aaron Adamson}, + TITLE = {Artificial Advice}, + PUBLISHER = {Aardvark Press}, + LOCATION = {Arlington}, + VOLUME = {4}, + YEAR = {1995}, + NOTE = STRING1 +} + +@ARTICLE{sect2, + SHORTHAND = {BB}, + AUTHOR = {Brian Britherthwaite}, + TITLE = {Best Barnacled Boat Bottoms}, + PUBLISHER = {British Bulldog Press}, + LOCATION = {Bridlington}, + YEAR = {2004}, +} + +@ARTICLE{sectall1, + AUTHOR = {Alan All}, + TITLE = {Alternative Alternations}, + PUBLISHER = {Average Aunt Press}, + LOCATION = {Allertron}, + YEAR = {2004}, +} + + +@PREAMBLE{"String for Preamble 2"}
\ No newline at end of file diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/sections2.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/sections2.bib new file mode 100644 index 00000000000..1b9f3ff5be4 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/sections2.bib @@ -0,0 +1,19 @@ +@ARTICLE{sect3, + AUTHOR = {Clive Clumberton}, + TITLE = {Clumsy Cultural Caveats}, + SUBTITLE = {Counter-cultural Concepts}, + PUBLISHER = {Clapp and Clopp Press}, + LOCATION = {Cambridge}, + YEAR = {1914}, +} + +@ARTICLE{sect8, + SHORTHAND = {JJ}, + AUTHOR = {Jimmy Johnson}, + TITLE = {Jovial Jamborees}, + PUBLISHER = {Jasper and Jiff}, + LOCATION = {Johannesburg}, + YEAR = {1938}, +} + +@PREAMBLE{"String for Preamble 3"}
\ No newline at end of file diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/sections3.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/sections3.bib new file mode 100644 index 00000000000..a2e365f6a88 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/sections3.bib @@ -0,0 +1,22 @@ +@STRING{STRING1 = {value2}} + +@BOOK{sect4, + SHORTHAND = {DDDD}, + AUTHOR = {Derek Ditherington and David Dumpton}, + TITLE = {Dangerous Dames}, + SUBTITLE = {Don't Dally Dude!}, + PUBLISHER = {Dright and Drought Press}, + LOCATION = {Dunbar}, + YEAR = {2003}, + NOTE = STRING1 +} + +@BOOK{sect5, + SHORTHAND = {EE}, + SORTKEY = {aaaaaaa}, + AUTHOR = {Edward E. Ethoxon}, + TITLE = {Eating Evil Enemies}, + PUBLISHER = {Ethical Encouragement Press}, + LOCATION = {Edinburgh}, + YEAR = {2007}, +} diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/sections4.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/sections4.bib new file mode 100644 index 00000000000..41bb6ee5cfa --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/sections4.bib @@ -0,0 +1,19 @@ +@BOOK{sect6, + SHORTHAND = {MMMM}, + AUTHOR = {Michael Mumford and Millie Mutherington}, + TITLE = {Malodourous Muffins}, + PUBLISHER = {Ming and Mink Press}, + LOCATION = {Manchester}, + YEAR = {2003}, +} + +@PREAMBLE{"String for Preamble 4"} + +@BOOK{sect7, + SHORTHAND = {PP}, + AUTHOR = {Percy Pilkington}, + TITLE = {Perhaps Penguins Prance}, + PUBLISHER = {Possible Prattle Press}, + LOCATION = {Pimlico}, + YEAR = {2007}, +} diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/set-dynamic.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/set-dynamic.bcf new file mode 100644 index 00000000000..9e4713abebd --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/set-dynamic.bcf @@ -0,0 +1,220 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <!-- CROSSREF --> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <!-- SORTING --> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">citeorder</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">sets.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey type="set" members="Dynamic1,Dynamic2,Dynamic3,missing1">DynSet</bcf:citekey> + <bcf:citekey>DynSet</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> + <!-- SECTION 1 --> + <bcf:bibdata section="1"> + <bcf:datasource type="file" datatype="bibtex">sets.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="1"> + <bcf:citekey>Dynamic3</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/set-legacy.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/set-legacy.bcf new file mode 100644 index 00000000000..8526c5a421d --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/set-legacy.bcf @@ -0,0 +1,208 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <!-- CROSSREF --> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <!-- SORTING --> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">citeorder</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">sets.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>Elias1955</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/set-static.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/set-static.bcf new file mode 100644 index 00000000000..c5eec22b50f --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/set-static.bcf @@ -0,0 +1,222 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <!-- CROSSREF --> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <!-- SORTING --> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">citeorder</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">sets.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>Static2</bcf:citekey> + <bcf:citekey>Static1</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> + <!-- SECTION 1 --> + <bcf:bibdata section="1"> + <bcf:datasource type="file" datatype="bibtex">sets.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="1"> + <bcf:citekey>Static2</bcf:citekey> + <bcf:citekey>Static3</bcf:citekey> + <bcf:citekey>Static4</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/sets.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/sets.bib new file mode 100644 index 00000000000..882248de313 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/sets.bib @@ -0,0 +1,80 @@ +@SET{Elias1955, + ENTRYSET = {Elias1955a,Elias1955b}, + CROSSREF = {Elias1955a} +} + +% Also test of month hacking - should be forced to "03" by the bibtex driver +@ARTICLE{Elias1955a, + AUTHOR = {Elias, P.}, + TITLE = {Predictive coding--I}, + JOURNAL = {IRE Transactions on Information Theory}, + YEAR = {1955}, + VOLUME = {1}, + PAGES = {16-24}, + NUMBER = {1}, + MONTH = {March}, + DOI = {10.1109/TIT.1955.1055126}, + ENTRYSET = {Elias1955}, + ISSN = {0096-1000}, +} + +% Also test of month hacking - should be forced to "03" by the bibtex driver +@ARTICLE{Elias1955b, + AUTHOR = {Elias, P.}, + TITLE = {Predictive coding--II}, + JOURNAL = {IRE Transactions on Information Theory}, + YEAR = {1955}, + VOLUME = {1}, + PAGES = {24-33}, + NUMBER = {1}, + MONTH = {Mar.}, + DOI = {10.1109/TIT.1955.1055116}, + ENTRYSET = {Elias1955}, + ISSN = {0096-1000}, +} + +@SET{Static1, + ENTRYSET = {Static2, Static3, Static4, missing1}, + ANNOTATION = {Some notes} +} + +@BOOK{Static2, + AUTHOR = {Brian Bumble}, + TITLE = {Blessed Brains}, + YEAR = {2001}, + ANNOTATION = {Some Blessed Note} +} + +@BOOK{Static3, + AUTHOR = {Clive Crenellation}, + TITLE = {Castles and Crime}, + YEAR = {2002} +} + +@BOOK{Static4, + AUTHOR = {Derek Dingle}, + TITLE = {Dungeons, Dark and Dangerous}, + YEAR = {2005} +} + +@BOOK{Dynamic1, + AUTHOR = {Derek Dynamism}, + TITLE = {Doing Daring Deeds}, + YEAR = {2002}, + ANNOTATION = {Some Dynamic Note}, + SHORTHAND = {d1} +} + +@BOOK{Dynamic2, + AUTHOR = {Brian Bunting}, + TITLE = {Beautiful Birthdays}, + YEAR = {2010}, + SHORTHAND = {d2} +} + +@BOOK{Dynamic3, + AUTHOR = {Roger Regardless}, + TITLE = {Reckless Ravishings}, + YEAR = {2000}, + SHORTHAND = {d3} +}
\ No newline at end of file diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/skips.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/skips.bcf new file mode 100644 index 00000000000..e1a29d86543 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/skips.bcf @@ -0,0 +1,253 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="collection"> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shorteditor</bcf:value> + <bcf:value order="2">editor</bcf:value> + <bcf:value order="3">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <!-- CROSSREF --> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <!-- SORTING --> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">labelalpha</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5" sort_direction="descending"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem substring_side="right" substring_width="4" order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1" pad_char="0">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + <bcf:sort order="7"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">skips.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>skip1</bcf:citekey> + <bcf:citekey>skip2</bcf:citekey> + <bcf:citekey>skip3</bcf:citekey> + <bcf:citekey>skip4</bcf:citekey> + <bcf:citekey>seta</bcf:citekey> + <bcf:citekey>noseta</bcf:citekey> + <bcf:citekey>nosetb</bcf:citekey> + <bcf:citekey>nosetc</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/skips.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/skips.bib new file mode 100644 index 00000000000..9dea603f097 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/skips.bib @@ -0,0 +1,81 @@ +@ARTICLE{skip1, + OPTIONS = {skipbib}, + AUTHOR = {John Doe}, + SHORTHAND = {AFS}, + TITLE = {Algorithms For Sorting}, + PUBLISHER = {A press}, + LOCATION = {Cambridge}, + YEAR = {1994}, +} + +@ARTICLE{skip2, + OPTIONS = {skiplos}, + SHORTHAND = {SA}, + AUTHOR = {John Doe}, + TITLE = {Sorting Algorithms}, + PUBLISHER = {A press}, + LOCATION = {Cambridge}, + YEAR = {1995}, +} + +@ARTICLE{skip3, + OPTIONS = {skiplos,skiplab}, + SHORTHAND = {SWA}, + AUTHOR = {John Doe}, + TITLE = {Sorting With Algorithms}, + PUBLISHER = {A press}, + LOCATION = {Cambridge}, + YEAR = {1934}, +} + +@ARTICLE{skip4, + OPTIONS = {dataonly}, + SHORTHAND = {AWS}, + AUTHOR = {John Doe}, + TITLE = {Algorithms Which Sort}, + PUBLISHER = {A press}, + LOCATION = {Cambridge}, + YEAR = {1932}, +} + +@SET{seta, + ENTRYSET = {set:membera,set:memberb,set:memberc} +} + +@BOOK{set:membera, + KEYWORDS = {key1, key2}, + AUTHOR = {Doe, John}, + TITLE = {Set Member A}, + DATE = {2010}, +} + +@BOOK{set:memberb, + AUTHOR = {Doe, John}, + TITLE = {Set Member B}, + DATE = {2010}, +} + +@BOOK{set:memberc, + AUTHOR = {Doe, John}, + TITLE = {Set Member C}, + DATE = {2010}, +} + +@BOOK{noseta, + AUTHOR = {Doe, John}, + TITLE = {Stand-Alone A}, + DATE = {2010}, +} + +@BOOK{nosetb, + AUTHOR = {Doe, John}, + TITLE = {Stand-Alone B}, + DATE = {2010}, +} + +@BOOK{nosetc, + AUTHOR = {Doe, John}, + TITLE = {Stand-Alone C}, + DATE = {2010}, +} + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/sort-case.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/sort-case.bcf new file mode 100644 index 00000000000..8b97e698103 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/sort-case.bcf @@ -0,0 +1,233 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <!-- CROSSREF --> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <!-- SORTING --> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5" sortcase="1" sortupper="0"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">sort-case.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>CS1</bcf:citekey> + <bcf:citekey>CS2</bcf:citekey> + <bcf:citekey>CS3</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/sort-case.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/sort-case.bib new file mode 100644 index 00000000000..49c8366846c --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/sort-case.bib @@ -0,0 +1,15 @@ +% Test of U::C case sensitivity and case ordering +@BOOK{CS1, + AUTHOR = {Albert, Edwin}, + TITLE = {TITLE} +} + +@BOOK{CS2, + AUTHOR = {albert, Edwin}, + TITLE = {title} +} + +@BOOK{CS3, + AUTHOR = {Albert, edwin}, + TITLE = {The title} +} diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/sort-complex.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/sort-complex.bcf new file mode 100644 index 00000000000..0da52f388bf --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/sort-complex.bcf @@ -0,0 +1,248 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="collection"> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shorteditor</bcf:value> + <bcf:value order="2">editor</bcf:value> + <bcf:value order="3">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <!-- CROSSREF --> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <!-- SORTING --> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">labelalpha</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="7"> + <bcf:sortitem order="1" pad_side="left" pad_width="4" pad_char="0">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">sort.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>L1</bcf:citekey> + <bcf:citekey>L2</bcf:citekey> + <bcf:citekey>L3</bcf:citekey> + <bcf:citekey>L4</bcf:citekey> + <bcf:citekey>L5</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"/> + </bcf:section> +</bcf:controlfile> + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/sort-order.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/sort-order.bcf new file mode 100644 index 00000000000..785bb1512a2 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/sort-order.bcf @@ -0,0 +1,218 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <!-- CROSSREF --> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <!-- SORTING --> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">citeorder</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">sort-order.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>L2</bcf:citekey> + <bcf:citekey>L1B</bcf:citekey> + <bcf:citekey>L1</bcf:citekey> + <bcf:citekey>L4</bcf:citekey> + <bcf:citekey>L3</bcf:citekey> + <bcf:citekey>L5</bcf:citekey> + <bcf:citekey>L1A</bcf:citekey> + <bcf:citekey>L7</bcf:citekey> + <bcf:citekey>L8</bcf:citekey> + <bcf:citekey>L6</bcf:citekey> + <bcf:citekey>L9</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/sort-order.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/sort-order.bib new file mode 100644 index 00000000000..81ef2f64eb1 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/sort-order.bib @@ -0,0 +1,91 @@ +@ARTICLE{L1, + AUTHOR = {Aaron Adamson}, + TITLE = {Artificial Advice}, + PUBLISHER = {Aardvark Press}, + LOCATION = {Arlington}, + VOLUME = {4}, + YEAR = {1995}, +} + +@ARTICLE{L1A, + AUTHOR = {Aaron Adamson}, + TITLE = {Anarchic Ambidexstrous Anomalies}, + PUBLISHER = {Aardvark Press}, + LOCATION = {Arlington}, + VOLUME = {40}, + YEAR = {1995}, +} + +@ARTICLE{L1B, + AUTHOR = {Aaron Adazki}, + TITLE = {Average Attitudes Are Awful}, + PUBLISHER = {Aardvark Press}, + LOCATION = {Arlington}, + YEAR = {1984}, +} + +@ARTICLE{L2, + AUTHOR = {Brian Britherthwaite}, + TITLE = {Best Barnacled Boat Bottoms}, + PUBLISHER = {British Bulldog Press}, + LOCATION = {Bridlington}, + YEAR = {2004}, +} + +@ARTICLE{L3, + AUTHOR = {Clive Clumberton}, + TITLE = {Clumsy Cultural Caveats}, + SUBTITLE = {Counter-cultural Concepts}, + PUBLISHER = {Clapp and Clopp Press}, + LOCATION = {Cambridge}, + YEAR = {1914}, +} + +@BOOK{L4, + AUTHOR = {Derek Ditherington and David Dumpton}, + TITLE = {Dangerous Dames}, + SUBTITLE = {Don't Dally Dude!}, + PUBLISHER = {Dright and Drought Press}, + LOCATION = {Dunbar}, + YEAR = {2003}, +} + +@BOOK{L5, + SORTKEY = {aaaaaaa}, + AUTHOR = {Edward E. Ethoxon}, + TITLE = {Eating Evil Enemies}, + PUBLISHER = {Ethical Encouragement Press}, + LOCATION = {Edinburgh}, + YEAR = {2007}, +} + +@BOOK{L6, + AUTHOR = {Richard F. Rank}, + TITLE = {Ruminating on Rhubarb}, + PUBLISHER = {Red, Raw and Raucous}, + LOCATION = {edinburgh}, + YEAR = {2011}, +} + +@BOOK{L7, + AUTHOR = {Peter Pettigrew}, + TITLE = {The Pretending Peanuts Pout}, + PUBLISHER = {Nut Press}, + LOCATION = {Edinburgh}, + YEAR = {2010}, +} + +@BOOK{L8, + AUTHOR = {Lawrence Langour}, + TITLE = {Why Walnuts Won't}, + PUBLISHER = {Nut Press}, + LOCATION = {Edinburgh}, + YEAR = {2009}, +} + +@BOOK{L9, + AUTHOR = {Steven Sensible}, + TITLE = {Sorting Sucks Eggs}, + PUBLISHER = {Yolk Enterprises}, + LOCATION = {London} +} diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/sort-uc.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/sort-uc.bcf new file mode 100644 index 00000000000..a5dbb7d234b --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/sort-uc.bcf @@ -0,0 +1,239 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <!-- CROSSREF --> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <!-- SORTING --> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">sort-uc.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>LS1</bcf:citekey> + <bcf:citekey>LS2</bcf:citekey> + <bcf:citekey>LS3</bcf:citekey> + <bcf:citekey>LS4</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + <bcf:sorting> + <bcf:sort order="1"> + <bcf:sortitem order="1">shorthand</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/sort-uc.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/sort-uc.bib new file mode 100644 index 00000000000..08bd995afb5 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/sort-uc.bib @@ -0,0 +1,37 @@ +% Test of U::C tailoring - Swedish - in UCA, å is sorted after ä but should be before +@BOOK{LS1, + AUTHOR = {Slippery, Zänny}, + TITLE = {Silent Slippers}, + PUBLISHER = {Footwear Folios}, + LOCATION = {London}, + YEAR = {1932}, + SHORTHAND = {SZä} +} + +@BOOK{LS2, + AUTHOR = {Slippery, Zånny}, + TITLE = {People Prefer Packages to Post}, + PUBLISHER = {Terrible Typists}, + LOCATION = {Grimsby}, + YEAR = {1945}, + SHORTHAND = {SZå} +} + +@BOOK{LS3, + AUTHOR = {Slippery, Zönny}, + TITLE = {Last Lingering Lemons}, + PUBLISHER = {Fruit Folios}, + LOCATION = {Catterick}, + YEAR = {1966}, + SHORTHAND = {SZo} +} + +% Upper before lower false +@BOOK{LS4, + AUTHOR = {Slippery, Zönny}, + TITLE = {last lingering lemons}, + PUBLISHER = {Fruit Folios}, + LOCATION = {Catterick}, + YEAR = {1966}, + SHORTHAND = {SZo} +} diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/sort.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/sort.bib new file mode 100644 index 00000000000..38384d53b18 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/sort.bib @@ -0,0 +1,39 @@ +@BOOK{L1, + AUTHOR = {John Doe}, + TITLE = {Algorithms For Sorting}, + PUBLISHER = {A press}, + LOCATION = {Cambridge}, + YEAR = {1995}, +} + +@BOOK{L2, + AUTHOR = {John Doe}, + TITLE = {Sorting Algorithms}, + PUBLISHER = {A press}, + LOCATION = {Cambridge}, + YEAR = {1995}, +} + +@BOOK{L3, + AUTHOR = {John Doe}, + TITLE = {More and More Algorithms}, + PUBLISHER = {A press}, + LOCATION = {Cambridge}, + YEAR = {1995}, +} + +@BOOK{L4, + AUTHOR = {John Doe and others}, + TITLE = {Some title about sorting}, + PUBLISHER = {Another press}, + LOCATION = {Cambridge}, + YEAR = {1995}, +} + +@BOOK{L5, + AUTHOR = {John Doe and others}, + TITLE = {Some other title about sorting}, + PUBLISHER = {Another press}, + LOCATION = {Cambridge}, + YEAR = {1995}, +} diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/sortlists.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/sortlists.bcf new file mode 100644 index 00000000000..ca553f09f5a --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/sortlists.bcf @@ -0,0 +1,282 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <!-- CROSSREF --> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <!-- SORTING --> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">citeorder</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">sortlists.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>K1</bcf:citekey> + <bcf:citekey>K2</bcf:citekey> + <bcf:citekey>K3</bcf:citekey> + <bcf:citekey>K4</bcf:citekey> + <bcf:sectionlist label="lname" type="entry"> + <bcf:sorting> + <bcf:sort order="1"> + <bcf:sortitem order="1">author</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + </bcf:sectionlist> + <bcf:sectionlist label="lnamef1" type="entry"> + <bcf:filter type="field">publisher</bcf:filter> + <bcf:filter type="notfield">verba</bcf:filter> + <bcf:sorting> + <bcf:sort order="1"> + <bcf:sortitem order="1">author</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + </bcf:sectionlist> + <bcf:sectionlist label="lnamef2" type="entry"> + <bcf:filter type="keyword">key2</bcf:filter> + <bcf:sorting> + <bcf:sort order="1"> + <bcf:sortitem order="1">author</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + </bcf:sectionlist> + <bcf:sectionlist label="lnamef3" type="entry"> + <bcf:filter type="nottype">thesis</bcf:filter> + <bcf:filter type="notkeyword">key1</bcf:filter> + <bcf:sorting> + <bcf:sort order="1"> + <bcf:sortitem order="1">author</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + </bcf:sectionlist> + <bcf:sectionlist label="lnamef4" type="entry"> + <bcf:filter type="notfield">verba</bcf:filter> + <bcf:filter type="subtype">rubbish</bcf:filter> + <bcf:sorting> + <bcf:sort order="1"> + <bcf:sortitem order="1">author</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + </bcf:sectionlist> + <bcf:sectionlist label="lnamef5" type="entry"> + <bcf:filter type="field">author</bcf:filter> + <bcf:orfilter> + <bcf:filter type="field">verba</bcf:filter> + <bcf:filter type="subtype">rubbish</bcf:filter> + </bcf:orfilter> + <bcf:sorting> + <bcf:sort order="1"> + <bcf:sortitem order="1">author</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + </bcf:sectionlist> + <bcf:sectionlist label="lyear" type="entry"> + <bcf:sorting> + <bcf:sort order="1" sort_direction="descending"> + <bcf:sortitem order="1">year</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + </bcf:sectionlist> + <bcf:sectionlist label="ltitle" type="entry"> + <bcf:sorting> + <bcf:sort order="1"> + <bcf:sortitem order="1">title</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + </bcf:sectionlist> + <bcf:sectionlist label="ltitle" type="entry"> + <bcf:sorting> + <bcf:sort order="1"> + <bcf:sortitem order="1">publisher</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/sortlists.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/sortlists.bib new file mode 100644 index 00000000000..5703ab37c98 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/sortlists.bib @@ -0,0 +1,33 @@ +@ARTICLE{K1, + AUTHOR = {Aaron Adamson}, + TITLE = {Artificial Advice}, + PUBLISHER = {Aardvark Press}, + LOCATION = {Arlington}, + YEAR = {1995}, + VERBA = {String} +} + +@BOOK{K2, + AUTHOR = {Brian Bully}, + TITLE = {Lucid Lamas}, + PUBLISHER = {Aardvark Press}, + LOCATION = {Arlington}, + YEAR = {1971}, +} + +@PHDTHESIS{K3, + ENTRYSUBTYPE = {rubbish}, + AUTHOR = {Richard Radiator}, + TITLE = {Zenos Things}, + LOCATION = {Cambridge}, + YEAR = {1953}, +} + +@BOOK{K4, + AUTHOR = {Linda Lucid}, + TITLE = {Decrepit Delineations}, + PUBLISHER = {Stuff and Nonesense Press}, + LOCATION = {London}, + YEAR = {1999}, + KEYWORDS = {key1, key2} +} diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/structure-constraints.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/structure-constraints.bcf new file mode 100644 index 00000000000..38583e10010 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/structure-constraints.bcf @@ -0,0 +1,630 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">author</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <!-- CROSSREF --> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <bcf:structure> + <bcf:datetypes> + <bcf:datetype>date</bcf:datetype> + <bcf:datetype>origdate</bcf:datetype> + <bcf:datetype>eventdate</bcf:datetype> + <bcf:datetype>urldate</bcf:datetype> + </bcf:datetypes> + <bcf:entrytypes> + <bcf:entrytype>eta</bcf:entrytype> + <bcf:entrytype>etb</bcf:entrytype> + <bcf:entrytype>etc</bcf:entrytype> + <bcf:entrytype>etd</bcf:entrytype> + <bcf:entrytype>misc</bcf:entrytype> + </bcf:entrytypes> + <bcf:fields> + <bcf:field fieldtype="field" datatype="literal">abstract</bcf:field> + <bcf:field fieldtype="field" datatype="literal">addendum</bcf:field> + <bcf:field fieldtype="list" datatype="name">afterword</bcf:field> + <bcf:field fieldtype="field" datatype="literal">annotation</bcf:field> + <bcf:field fieldtype="list" datatype="name">annotator</bcf:field> + <bcf:field fieldtype="list" datatype="name">author</bcf:field> + <bcf:field fieldtype="field" datatype="key">authortype</bcf:field> + <bcf:field fieldtype="list" datatype="name">bookauthor</bcf:field> + <bcf:field fieldtype="field" datatype="key">bookpagination</bcf:field> + <bcf:field fieldtype="field" datatype="literal">booksubtitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">booktitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">booktitleaddon</bcf:field> + <bcf:field fieldtype="field" datatype="literal">chapter</bcf:field> + <bcf:field fieldtype="list" datatype="name">commentator</bcf:field> + <bcf:field fieldtype="field" datatype="literal">crossref</bcf:field> + <bcf:field fieldtype="field" datatype="literal">day</bcf:field> + <bcf:field fieldtype="field" datatype="verbatim">doi</bcf:field> + <bcf:field fieldtype="field" datatype="literal">edition</bcf:field> + <bcf:field fieldtype="list" datatype="name">editor</bcf:field> + <bcf:field fieldtype="list" datatype="name">editora</bcf:field> + <bcf:field fieldtype="field" datatype="key">editoratype</bcf:field> + <bcf:field fieldtype="list" datatype="name">editorb</bcf:field> + <bcf:field fieldtype="field" datatype="key">editorbtype</bcf:field> + <bcf:field fieldtype="list" datatype="name">editorc</bcf:field> + <bcf:field fieldtype="field" datatype="key">editorctype</bcf:field> + <bcf:field fieldtype="field" datatype="key">editortype</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eid</bcf:field> + <bcf:field fieldtype="field" datatype="literal">endday</bcf:field> + <bcf:field fieldtype="field" datatype="literal">endmonth</bcf:field> + <bcf:field fieldtype="field" datatype="literal" nullok="true">endyear</bcf:field> + <bcf:field fieldtype="field" datatype="literal" skip_output="true">entryset</bcf:field> + <bcf:field fieldtype="field" datatype="literal">entrysubtype</bcf:field> + <bcf:field fieldtype="field" datatype="verbatim">eprint</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eprintclass</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eprinttype</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eventday</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eventendday</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eventendmonth</bcf:field> + <bcf:field fieldtype="field" datatype="literal" nullok="true">eventendyear</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eventmonth</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eventtitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eventyear</bcf:field> + <bcf:field fieldtype="field" datatype="literal">execute</bcf:field> + <bcf:field fieldtype="field" datatype="verbatim">file</bcf:field> + <bcf:field fieldtype="list" datatype="name">foreword</bcf:field> + <bcf:field fieldtype="field" datatype="literal">gender</bcf:field> + <bcf:field fieldtype="list" datatype="name">holder</bcf:field> + <bcf:field fieldtype="field" datatype="literal">howpublished</bcf:field> + <bcf:field fieldtype="field" datatype="literal">hyphenation</bcf:field> + <bcf:field fieldtype="field" datatype="literal">indexsorttitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">indextitle</bcf:field> + <bcf:field fieldtype="list" datatype="literal">institution</bcf:field> + <bcf:field fieldtype="list" datatype="name">introduction</bcf:field> + <bcf:field fieldtype="field" datatype="literal">isan</bcf:field> + <bcf:field fieldtype="field" datatype="literal">isbn</bcf:field> + <bcf:field fieldtype="field" datatype="literal">ismn</bcf:field> + <bcf:field fieldtype="field" datatype="literal">isrn</bcf:field> + <bcf:field fieldtype="field" datatype="literal">issn</bcf:field> + <bcf:field fieldtype="field" datatype="literal">issue</bcf:field> + <bcf:field fieldtype="field" datatype="literal">issuesubtitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">issuetitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">iswc</bcf:field> + <bcf:field fieldtype="field" datatype="literal">journalsubtitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">journaltitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">keywords</bcf:field> + <bcf:field fieldtype="field" datatype="literal">label</bcf:field> + <bcf:field fieldtype="list" datatype="key">language</bcf:field> + <bcf:field fieldtype="field" datatype="literal">library</bcf:field> + <bcf:field fieldtype="list" datatype="literal">lista</bcf:field> + <bcf:field fieldtype="list" datatype="literal">listb</bcf:field> + <bcf:field fieldtype="list" datatype="literal">listc</bcf:field> + <bcf:field fieldtype="list" datatype="literal">listd</bcf:field> + <bcf:field fieldtype="list" datatype="literal">liste</bcf:field> + <bcf:field fieldtype="list" datatype="literal">listf</bcf:field> + <bcf:field fieldtype="list" datatype="literal">location</bcf:field> + <bcf:field fieldtype="field" datatype="literal">mainsubtitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">maintitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">maintitleaddon</bcf:field> + <bcf:field fieldtype="field" datatype="integer">month</bcf:field> + <bcf:field fieldtype="list" datatype="name">namea</bcf:field> + <bcf:field fieldtype="field" datatype="literal">nameaddon</bcf:field> + <bcf:field fieldtype="field" datatype="key">nameatype</bcf:field> + <bcf:field fieldtype="list" datatype="name">nameb</bcf:field> + <bcf:field fieldtype="field" datatype="key">namebtype</bcf:field> + <bcf:field fieldtype="list" datatype="name">namec</bcf:field> + <bcf:field fieldtype="field" datatype="key">namectype</bcf:field> + <bcf:field fieldtype="field" datatype="literal">note</bcf:field> + <bcf:field fieldtype="field" datatype="literal">number</bcf:field> + <bcf:field fieldtype="field" datatype="literal">options</bcf:field> + <bcf:field fieldtype="list" datatype="literal">organization</bcf:field> + <bcf:field fieldtype="field" datatype="literal">origday</bcf:field> + <bcf:field fieldtype="field" datatype="literal">origendday</bcf:field> + <bcf:field fieldtype="field" datatype="literal">origendmonth</bcf:field> + <bcf:field fieldtype="field" datatype="literal" nullok="true">origendyear</bcf:field> + <bcf:field fieldtype="field" datatype="key">origlanguage</bcf:field> + <bcf:field fieldtype="list" datatype="literal">origlocation</bcf:field> + <bcf:field fieldtype="field" datatype="literal">origmonth</bcf:field> + <bcf:field fieldtype="list" datatype="literal">origpublisher</bcf:field> + <bcf:field fieldtype="field" datatype="literal">origtitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">origyear</bcf:field> + <bcf:field fieldtype="field" datatype="range">pages</bcf:field> + <bcf:field fieldtype="field" datatype="literal">pagetotal</bcf:field> + <bcf:field fieldtype="field" datatype="key">pagination</bcf:field> + <bcf:field fieldtype="field" datatype="literal">part</bcf:field> + <bcf:field fieldtype="field" datatype="literal" skip_output="true">presort</bcf:field> + <bcf:field fieldtype="list" datatype="literal">publisher</bcf:field> + <bcf:field fieldtype="field" datatype="key">pubstate</bcf:field> + <bcf:field fieldtype="field" datatype="literal">reprinttitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">series</bcf:field> + <bcf:field fieldtype="list" datatype="name">shortauthor</bcf:field> + <bcf:field fieldtype="list" datatype="name">shorteditor</bcf:field> + <bcf:field fieldtype="field" datatype="literal">shorthand</bcf:field> + <bcf:field fieldtype="field" datatype="literal">shorthandintro</bcf:field> + <bcf:field fieldtype="field" datatype="literal">shortjournal</bcf:field> + <bcf:field fieldtype="field" datatype="literal">shortseries</bcf:field> + <bcf:field fieldtype="field" datatype="literal">shorttitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal" skip_output="true">sortkey</bcf:field> + <bcf:field fieldtype="field" datatype="literal" skip_output="true">sortname</bcf:field> + <bcf:field fieldtype="field" datatype="literal" skip_output="true">sorttitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal" skip_output="true">sortyear</bcf:field> + <bcf:field fieldtype="field" datatype="literal">subtitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">title</bcf:field> + <bcf:field fieldtype="field" datatype="literal">titleaddon</bcf:field> + <bcf:field fieldtype="list" datatype="name">translator</bcf:field> + <bcf:field fieldtype="field" datatype="key">type</bcf:field> + <bcf:field fieldtype="field" datatype="verbatim">url</bcf:field> + <bcf:field fieldtype="field" datatype="literal">usera</bcf:field> + <bcf:field fieldtype="field" datatype="literal">userb</bcf:field> + <bcf:field fieldtype="field" datatype="literal">userc</bcf:field> + <bcf:field fieldtype="field" datatype="literal">userd</bcf:field> + <bcf:field fieldtype="field" datatype="literal">usere</bcf:field> + <bcf:field fieldtype="field" datatype="literal">userf</bcf:field> + <bcf:field fieldtype="field" datatype="literal">urlday</bcf:field> + <bcf:field fieldtype="field" datatype="literal">urlendday</bcf:field> + <bcf:field fieldtype="field" datatype="literal">urlendmonth</bcf:field> + <bcf:field fieldtype="field" datatype="literal" nullok="true">urlendyear</bcf:field> + <bcf:field fieldtype="field" datatype="literal">urlmonth</bcf:field> + <bcf:field fieldtype="field" datatype="literal">urlyear</bcf:field> + <bcf:field fieldtype="field" datatype="literal">venue</bcf:field> + <bcf:field fieldtype="field" datatype="verbatim">verba</bcf:field> + <bcf:field fieldtype="field" datatype="verbatim">verbb</bcf:field> + <bcf:field fieldtype="field" datatype="verbatim">verbc</bcf:field> + <bcf:field fieldtype="field" datatype="literal">version</bcf:field> + <bcf:field fieldtype="field" datatype="literal">volume</bcf:field> + <bcf:field fieldtype="field" datatype="literal">volumes</bcf:field> + <bcf:field fieldtype="field" datatype="literal">xref</bcf:field> + <bcf:field fieldtype="field" datatype="literal">year</bcf:field> + <bcf:field fieldtype="field" datatype="literal">fielda</bcf:field> + <bcf:field fieldtype="field" datatype="literal">fieldb</bcf:field> + <bcf:field fieldtype="field" datatype="literal">field1</bcf:field> + <bcf:field fieldtype="field" datatype="literal">field2</bcf:field> + <bcf:field fieldtype="field" datatype="literal">field3</bcf:field> + <bcf:field fieldtype="field" datatype="literal">field4</bcf:field> + <bcf:field fieldtype="field" datatype="literal">field5</bcf:field> + <bcf:field fieldtype="field" datatype="literal">field6</bcf:field> + <bcf:field fieldtype="field" datatype="literal">field7</bcf:field> + <bcf:field fieldtype="field" datatype="literal">field8</bcf:field> + <bcf:field fieldtype="field" datatype="literal">field9</bcf:field> + <bcf:field fieldtype="field" datatype="literal">field10</bcf:field> + <bcf:field fieldtype="field" datatype="literal">field11</bcf:field> + <bcf:field fieldtype="field" datatype="literal">field12</bcf:field> + <bcf:field fieldtype="field" datatype="literal">field13</bcf:field> + <bcf:field fieldtype="field" datatype="literal">field14</bcf:field> + </bcf:fields> + <bcf:entryfields> + <bcf:entrytype>ALL</bcf:entrytype> + <bcf:field>abstract</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>set</bcf:entrytype> + <bcf:field>ALL</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>eta</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>etb</bcf:entrytype> + <bcf:entrytype>etc</bcf:entrytype> + <bcf:entrytype>etd</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>journaltitle</bcf:field> + <bcf:field>fielda</bcf:field> + <bcf:field>fieldb</bcf:field> + <bcf:field>field1</bcf:field> + <bcf:field>field2</bcf:field> + <bcf:field>field3</bcf:field> + <bcf:field>field4</bcf:field> + <bcf:field>field5</bcf:field> + <bcf:field>field6</bcf:field> + <bcf:field>field7</bcf:field> + <bcf:field>field8</bcf:field> + <bcf:field>field9</bcf:field> + <bcf:field>field10</bcf:field> + <bcf:field>field11</bcf:field> + <bcf:field>field12</bcf:field> + <bcf:field>field13</bcf:field> + <bcf:field>field14</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>misc</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>journaltitle</bcf:field> + </bcf:entryfields> + <bcf:constraints> + <bcf:entrytype>ALL</bcf:entrytype> + <bcf:constraint type="data" datatype="integer" rangemin="1" rangemax="12"> + <bcf:field>month</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>eta</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>etb</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>journaltitle</bcf:field> + </bcf:constraint> + <bcf:constraint type="data" datatype="integer" rangemin="5" rangemax="12"> + <bcf:field>field1</bcf:field> + </bcf:constraint> + <bcf:constraint type="conditional"> + <bcf:antecedent quant="all"> + <bcf:field>field2</bcf:field> + <bcf:field>field3</bcf:field> + <bcf:field>field4</bcf:field> + </bcf:antecedent> + <bcf:consequent quant="none"> + <bcf:field>field5</bcf:field> + <bcf:field>field6</bcf:field> + </bcf:consequent> + </bcf:constraint> + <bcf:constraint type="conditional"> + <bcf:antecedent quant="all"> + <bcf:field>field1</bcf:field> + <bcf:field>field2</bcf:field> + </bcf:antecedent> + <bcf:consequent quant="one"> + <bcf:field>field7</bcf:field> + <bcf:field>field8</bcf:field> + </bcf:consequent> + </bcf:constraint> + <bcf:constraint type="conditional"> + <bcf:antecedent quant="all"> + <bcf:field>field5</bcf:field> + <bcf:field>field6</bcf:field> + </bcf:antecedent> + <bcf:consequent quant="all"> + <bcf:field>field9</bcf:field> + <bcf:field>field10</bcf:field> + </bcf:consequent> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>etc</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>journaltitle</bcf:field> + </bcf:constraint> + <bcf:constraint type="conditional"> + <bcf:antecedent quant="one"> + <bcf:field>field2</bcf:field> + <bcf:field>field3</bcf:field> + </bcf:antecedent> + <bcf:consequent quant="none"> + <bcf:field>field4</bcf:field> + </bcf:consequent> + </bcf:constraint> + <bcf:constraint type="conditional"> + <bcf:antecedent quant="one"> + <bcf:field>field5</bcf:field> + <bcf:field>field6</bcf:field> + </bcf:antecedent> + <bcf:consequent quant="none"> + <bcf:field>field7</bcf:field> + </bcf:consequent> + </bcf:constraint> + <bcf:constraint type="conditional"> + <bcf:antecedent quant="one"> + <bcf:field>field2</bcf:field> + <bcf:field>field3</bcf:field> + </bcf:antecedent> + <bcf:consequent quant="all"> + <bcf:field>field8</bcf:field> + <bcf:field>field9</bcf:field> + </bcf:consequent> + </bcf:constraint> + <bcf:constraint type="conditional"> + <bcf:antecedent quant="one"> + <bcf:field>field10</bcf:field> + <bcf:field>field11</bcf:field> + </bcf:antecedent> + <bcf:consequent quant="one"> + <bcf:field>field5</bcf:field> + </bcf:consequent> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>etd</bcf:entrytype> + <bcf:entrytype>etc</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:fieldor> + <bcf:field>fielda</bcf:field> + <bcf:field>fieldb</bcf:field> + </bcf:fieldor> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>etd</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>journaltitle</bcf:field> + </bcf:constraint> + <bcf:constraint type="conditional"> + <bcf:antecedent quant="none"> + <bcf:field>field2</bcf:field> + <bcf:field>field3</bcf:field> + </bcf:antecedent> + <bcf:consequent quant="none"> + <bcf:field>field4</bcf:field> + </bcf:consequent> + </bcf:constraint> + <bcf:constraint type="conditional"> + <bcf:antecedent quant="none"> + <bcf:field>field7</bcf:field> + </bcf:antecedent> + <bcf:consequent quant="none"> + <bcf:field>field5</bcf:field> + </bcf:consequent> + </bcf:constraint> + <bcf:constraint type="conditional"> + <bcf:antecedent quant="none"> + <bcf:field>field8</bcf:field> + <bcf:field>field9</bcf:field> + </bcf:antecedent> + <bcf:consequent quant="one"> + <bcf:field>field10</bcf:field> + <bcf:field>field11</bcf:field> + </bcf:consequent> + </bcf:constraint> + <bcf:constraint type="conditional"> + <bcf:antecedent quant="none"> + <bcf:field>field6</bcf:field> + </bcf:antecedent> + <bcf:consequent quant="all"> + <bcf:field>field12</bcf:field> + <bcf:field>field13</bcf:field> + </bcf:consequent> + </bcf:constraint> + </bcf:constraints> + </bcf:structure> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">structure-constraints.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>c1</bcf:citekey> + <bcf:citekey>c2</bcf:citekey> + <bcf:citekey>c3</bcf:citekey> + <bcf:citekey>c4</bcf:citekey> + <bcf:citekey>c5</bcf:citekey> + <bcf:citekey>c6</bcf:citekey> + <bcf:citekey>c7</bcf:citekey> + <bcf:citekey>c8</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/structure-constraints.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/structure-constraints.bib new file mode 100644 index 00000000000..98af5ff9a88 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/structure-constraints.bib @@ -0,0 +1,114 @@ +% Not a valid type +@BADTYPE{c1, + AUTHOR = {Clive Constraint}, + TITLE = {Limits of Things}, + DATE = {2003-10-01}, +} + +% Completely nonexistent field and field (alias) not valid for this type +% Testing a field valid for all entrytypes (ABSTRACT) +% Testing missing mandatory field +@ETA{c2, + TITLE = {Limits of Things}, + DATE = {2003-10-01}, + BADFIELD = {Something}, + JOURNAL = {Some journal}, + ABSTRACT = {Some text} +} + +% Datatype constraint - wrong month format +% Randomly named field +@ETB{c3, + AUTHOR = {Clive Constraint}, + TITLE = {Limits of Things}, + JOURNAL = {Some journal}, + YEAR = {2003}, + MONTH = {WRONG FORMAT}, + FIELD1 = {7} +} + +% Datatype constraint - wrong month format (range) +% Randomly named field with custom range (integer) +@ETB{c4, + AUTHOR = {Clive Constraint}, + TITLE = {Limits of Things}, + JOURNAL = {Some journal}, + YEAR = {2003}, + MONTH = {14}, + FIELD1 = {4} +} + +% Conditional checks +% XOR mandatory check - DATE and YEAR are both defined +% all 2,3,4 -> none 5,6 (fail) +@ETB{c5, + AUTHOR = {Clive Constraint}, + TITLE = {Limits of Things}, + JOURNAL = {Some journal}, + DATE = {2004-01-02}, + YEAR = {2003}, + FIELD2 = {a}, + FIELD3 = {a}, + FIELD4 = {a}, + FIELD5 = {a}, + FIELD6 = {a}, +} + +% Conditional checks +% all 2,3,4 -> none 5,6 (pass) (because antecedent is not satisfied) +% all 1,2 -> one 7,8 (fail) +% all 5,6 -> all 9,10 (fail) +@ETB{c6, + AUTHOR = {Clive Constraint}, + TITLE = {Limits of Things}, + JOURNAL = {Some journal}, + YEAR = {2003}, + FIELD1 = {8}, + FIELD2 = {a}, + FIELD3 = {a}, + FIELD5 = {a}, + FIELD6 = {a}, + FIELD9 = {a} +} + +% Conditional checks +% one 2,3 -> none 4 (pass) +% one 5,6 -> none 7 (fail) +% one 2,3 -> all 8,9 (pass) +% one 10,11 -> one 5 (pass) +% Mandatory OR check - one of FIELDA or FIELDB must be present (fail) +@ETC{c7, + AUTHOR = {Clive Constraint}, + TITLE = {Limits of Things}, + JOURNAL = {Some journal}, + YEAR = {2003}, + FIELD2 = {a}, + FIELD3 = {a}, + FIELD5 = {a}, + FIELD7 = {a}, + FIELD8 = {a}, + FIELD9 = {a}, + FIELD11 = {a}, +} + +% Conditional checks +% none 2,3 -> none 4 (fail) +% none 7 -> none 5 (pass) as antecedent is false +% none 8,9 -> one 10,11 (fail) +% none 6 -> all 12,13 (fail) +% Mandatory OR check - one of FIELDA or FIELDB must be present +% (both are, testing different from XOR) (pass) +@ETD{c8, + AUTHOR = {Clive Constraint}, + TITLE = {Limits of Things}, + JOURNAL = {Some journal}, + YEAR = {2003}, + FIELD4 = {a}, + FIELD5 = {a}, + FIELD7 = {a}, + FIELD12 = {a}, + FIELDA = {a}, + FIELDB = {a}, +} + + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/structure-dateformats.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/structure-dateformats.bcf new file mode 100644 index 00000000000..17162f4ce49 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/structure-dateformats.bcf @@ -0,0 +1,1414 @@ +<?xml version="1.0" encoding="UTF-8"?> +<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?> +<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?> +<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex"> + <!-- OPTIONS --> + <bcf:options component="biber" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>bblencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>bibencoding</bcf:key> + <bcf:value>utf8</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>debug</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>mincrossrefs</bcf:key> + <bcf:value>2</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortcase</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortupper</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="global"> + <bcf:option type="singlevalued"> + <bcf:key>alphaothers</bcf:key> + <bcf:value>\textbf{+}</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelalpha</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shortauthor</bcf:value> + <bcf:value order="2">author</bcf:value> + <bcf:value order="3">shorteditor</bcf:value> + <bcf:value order="4">editor</bcf:value> + <bcf:value order="5">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>labelyear</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="multivalued"> + <bcf:key>labelyearspec</bcf:key> + <bcf:value order="1">year</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxitems</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>maxnames</bcf:key> + <bcf:value>3</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minitems</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>minnames</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>singletitle</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortalphaothers</bcf:key> + <bcf:value>+</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>sortlos</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>terseinits</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>uniquename</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useauthor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>1</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useprefix</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>usetranslator</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <bcf:options component="biblatex" type="collection"> + <bcf:option type="multivalued"> + <bcf:key>labelnamespec</bcf:key> + <bcf:value order="1">shorteditor</bcf:value> + <bcf:value order="2">editor</bcf:value> + <bcf:value order="3">translator</bcf:value> + </bcf:option> + <bcf:option type="singlevalued"> + <bcf:key>useeditor</bcf:key> + <bcf:value>0</bcf:value> + </bcf:option> + </bcf:options> + <!-- CROSSREF --> + <bcf:inheritance> + <bcf:defaults inherit_all="true" override_target="false"> + </bcf:defaults> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="author" target="author"/> + <bcf:field source="author" target="bookauthor"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvbook" target="book"/> + <bcf:type_pair source="mvbook" target="inbook"/> + <bcf:type_pair source="mvbook" target="bookinbook"/> + <bcf:type_pair source="mvbook" target="suppbook"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvcollection" target="collection"/> + <bcf:type_pair source="mvcollection" target="incollection"/> + <bcf:type_pair source="mvcollection" target="suppcollection"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvproceedings" target="proceedings"/> + <bcf:type_pair source="mvproceedings" target="inproceedings"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="mvreference" target="reference"/> + <bcf:type_pair source="mvreference" target="inreference"/> + <bcf:field source="title" target="maintitle"/> + <bcf:field source="subtitle" target="mainsubtitle"/> + <bcf:field source="titleaddon" target="maintitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="book" target="inbook"/> + <bcf:type_pair source="book" target="bookinbook"/> + <bcf:type_pair source="book" target="suppbook"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="collection" target="incollection"/> + <bcf:type_pair source="collection" target="suppcollection"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="reference" target="inreference"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="proceedings" target="inproceedings"/> + <bcf:field source="title" target="booktitle"/> + <bcf:field source="subtitle" target="booksubtitle"/> + <bcf:field source="titleaddon" target="booktitleaddon"/> + </bcf:inherit> + <bcf:inherit> + <bcf:type_pair source="periodical" target="article"/> + <bcf:type_pair source="periodical" target="suppperiodical"/> + <bcf:field source="title" target="journaltitle"/> + <bcf:field source="subtitle" target="journalsubtitle"/> + </bcf:inherit> + </bcf:inheritance> + <!-- SORTING --> + <bcf:sorting> + <bcf:presort>mm</bcf:presort> + <bcf:sort order="1"> + <bcf:sortitem order="1">presort</bcf:sortitem> + </bcf:sort> + <bcf:sort order="2" final="1"> + <bcf:sortitem order="1">sortkey</bcf:sortitem> + </bcf:sort> + <bcf:sort order="3"> + <bcf:sortitem order="1">labelalpha</bcf:sortitem> + </bcf:sort> + <bcf:sort order="4"> + <bcf:sortitem order="1">sortname</bcf:sortitem> + <bcf:sortitem order="2">author</bcf:sortitem> + <bcf:sortitem order="3">editor</bcf:sortitem> + <bcf:sortitem order="4">translator</bcf:sortitem> + <bcf:sortitem order="5">sorttitle</bcf:sortitem> + <bcf:sortitem order="6">title</bcf:sortitem> + </bcf:sort> + <bcf:sort order="5" sort_direction="descending"> + <bcf:sortitem order="1">sortyear</bcf:sortitem> + <bcf:sortitem substring_side="right" substring_width="4" order="2">year</bcf:sortitem> + </bcf:sort> + <bcf:sort order="6"> + <bcf:sortitem order="1" pad_char="0">volume</bcf:sortitem> + <bcf:sortitem order="2">0000</bcf:sortitem> + </bcf:sort> + <bcf:sort order="7"> + <bcf:sortitem order="1">sorttitle</bcf:sortitem> + <bcf:sortitem order="2">title</bcf:sortitem> + </bcf:sort> + </bcf:sorting> + <bcf:structure> + <bcf:datetypes> + <bcf:datetype>date</bcf:datetype> + <bcf:datetype>origdate</bcf:datetype> + <bcf:datetype>eventdate</bcf:datetype> + <bcf:datetype>urldate</bcf:datetype> + </bcf:datetypes> + <bcf:entrytypes> + <bcf:entrytype>article</bcf:entrytype> + <bcf:entrytype>artwork</bcf:entrytype> + <bcf:entrytype>audio</bcf:entrytype> + <bcf:entrytype>bibnote</bcf:entrytype> + <bcf:entrytype>book</bcf:entrytype> + <bcf:entrytype>bookinbook</bcf:entrytype> + <bcf:entrytype>booklet</bcf:entrytype> + <bcf:entrytype>collection</bcf:entrytype> + <bcf:entrytype>commentary</bcf:entrytype> + <bcf:entrytype>customa</bcf:entrytype> + <bcf:entrytype>customb</bcf:entrytype> + <bcf:entrytype>customc</bcf:entrytype> + <bcf:entrytype>customd</bcf:entrytype> + <bcf:entrytype>custome</bcf:entrytype> + <bcf:entrytype>customf</bcf:entrytype> + <bcf:entrytype>inbook</bcf:entrytype> + <bcf:entrytype>incollection</bcf:entrytype> + <bcf:entrytype>inproceedings</bcf:entrytype> + <bcf:entrytype>inreference</bcf:entrytype> + <bcf:entrytype>image</bcf:entrytype> + <bcf:entrytype>jurisdiction</bcf:entrytype> + <bcf:entrytype>legal</bcf:entrytype> + <bcf:entrytype>legislation</bcf:entrytype> + <bcf:entrytype>letter</bcf:entrytype> + <bcf:entrytype>manual</bcf:entrytype> + <bcf:entrytype>misc</bcf:entrytype> + <bcf:entrytype>movie</bcf:entrytype> + <bcf:entrytype>music</bcf:entrytype> + <bcf:entrytype>online</bcf:entrytype> + <bcf:entrytype>patent</bcf:entrytype> + <bcf:entrytype>performance</bcf:entrytype> + <bcf:entrytype>periodical</bcf:entrytype> + <bcf:entrytype>proceedings</bcf:entrytype> + <bcf:entrytype>reference</bcf:entrytype> + <bcf:entrytype>report</bcf:entrytype> + <bcf:entrytype>review</bcf:entrytype> + <bcf:entrytype>set</bcf:entrytype> + <bcf:entrytype>software</bcf:entrytype> + <bcf:entrytype>standard</bcf:entrytype> + <bcf:entrytype>suppbook</bcf:entrytype> + <bcf:entrytype>suppcollection</bcf:entrytype> + <bcf:entrytype>thesis</bcf:entrytype> + <bcf:entrytype>unpublished</bcf:entrytype> + <bcf:entrytype>video</bcf:entrytype> + </bcf:entrytypes> + <bcf:fields> + <bcf:field fieldtype="field" datatype="literal">abstract</bcf:field> + <bcf:field fieldtype="field" datatype="literal">addendum</bcf:field> + <bcf:field fieldtype="list" datatype="name">afterword</bcf:field> + <bcf:field fieldtype="field" datatype="literal">annotation</bcf:field> + <bcf:field fieldtype="list" datatype="name">annotator</bcf:field> + <bcf:field fieldtype="list" datatype="name">author</bcf:field> + <bcf:field fieldtype="field" datatype="key">authortype</bcf:field> + <bcf:field fieldtype="list" datatype="name">bookauthor</bcf:field> + <bcf:field fieldtype="field" datatype="key">bookpagination</bcf:field> + <bcf:field fieldtype="field" datatype="literal">booksubtitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">booktitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">booktitleaddon</bcf:field> + <bcf:field fieldtype="field" datatype="literal">chapter</bcf:field> + <bcf:field fieldtype="list" datatype="name">commentator</bcf:field> + <bcf:field fieldtype="field" datatype="literal">crossref</bcf:field> + <bcf:field fieldtype="field" datatype="literal">day</bcf:field> + <bcf:field fieldtype="field" datatype="verbatim">doi</bcf:field> + <bcf:field fieldtype="field" datatype="literal">edition</bcf:field> + <bcf:field fieldtype="list" datatype="name">editor</bcf:field> + <bcf:field fieldtype="list" datatype="name">editora</bcf:field> + <bcf:field fieldtype="field" datatype="key">editoratype</bcf:field> + <bcf:field fieldtype="list" datatype="name">editorb</bcf:field> + <bcf:field fieldtype="field" datatype="key">editorbtype</bcf:field> + <bcf:field fieldtype="list" datatype="name">editorc</bcf:field> + <bcf:field fieldtype="field" datatype="key">editorctype</bcf:field> + <bcf:field fieldtype="field" datatype="key">editortype</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eid</bcf:field> + <bcf:field fieldtype="field" datatype="literal">endday</bcf:field> + <bcf:field fieldtype="field" datatype="literal">endmonth</bcf:field> + <bcf:field fieldtype="field" datatype="literal" nullok="true">endyear</bcf:field> + <bcf:field fieldtype="field" datatype="literal" skip_output="true">entryset</bcf:field> + <bcf:field fieldtype="field" datatype="literal">entrysubtype</bcf:field> + <bcf:field fieldtype="field" datatype="verbatim">eprint</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eprintclass</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eprinttype</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eventday</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eventendday</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eventendmonth</bcf:field> + <bcf:field fieldtype="field" datatype="literal" nullok="true">eventendyear</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eventmonth</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eventtitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">eventyear</bcf:field> + <bcf:field fieldtype="field" datatype="literal">execute</bcf:field> + <bcf:field fieldtype="field" datatype="verbatim">file</bcf:field> + <bcf:field fieldtype="list" datatype="name">foreword</bcf:field> + <bcf:field fieldtype="field" datatype="literal">gender</bcf:field> + <bcf:field fieldtype="list" datatype="name">holder</bcf:field> + <bcf:field fieldtype="field" datatype="literal">howpublished</bcf:field> + <bcf:field fieldtype="field" datatype="literal">hyphenation</bcf:field> + <bcf:field fieldtype="field" datatype="literal">indexsorttitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">indextitle</bcf:field> + <bcf:field fieldtype="list" datatype="literal">institution</bcf:field> + <bcf:field fieldtype="list" datatype="name">introduction</bcf:field> + <bcf:field fieldtype="field" datatype="literal">isan</bcf:field> + <bcf:field fieldtype="field" datatype="literal">isbn</bcf:field> + <bcf:field fieldtype="field" datatype="literal">ismn</bcf:field> + <bcf:field fieldtype="field" datatype="literal">isrn</bcf:field> + <bcf:field fieldtype="field" datatype="literal">issn</bcf:field> + <bcf:field fieldtype="field" datatype="literal">issue</bcf:field> + <bcf:field fieldtype="field" datatype="literal">issuesubtitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">issuetitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">iswc</bcf:field> + <bcf:field fieldtype="field" datatype="literal">journalsubtitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">journaltitle</bcf:field> + <bcf:field fieldtype="field" datatype="special">keywords</bcf:field> + <bcf:field fieldtype="field" datatype="literal">label</bcf:field> + <bcf:field fieldtype="list" datatype="key">language</bcf:field> + <bcf:field fieldtype="field" datatype="literal">library</bcf:field> + <bcf:field fieldtype="list" datatype="literal">lista</bcf:field> + <bcf:field fieldtype="list" datatype="literal">listb</bcf:field> + <bcf:field fieldtype="list" datatype="literal">listc</bcf:field> + <bcf:field fieldtype="list" datatype="literal">listd</bcf:field> + <bcf:field fieldtype="list" datatype="literal">liste</bcf:field> + <bcf:field fieldtype="list" datatype="literal">listf</bcf:field> + <bcf:field fieldtype="list" datatype="literal">location</bcf:field> + <bcf:field fieldtype="field" datatype="literal">mainsubtitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">maintitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">maintitleaddon</bcf:field> + <bcf:field fieldtype="field" datatype="integer">month</bcf:field> + <bcf:field fieldtype="list" datatype="name">namea</bcf:field> + <bcf:field fieldtype="field" datatype="literal">nameaddon</bcf:field> + <bcf:field fieldtype="field" datatype="key">nameatype</bcf:field> + <bcf:field fieldtype="list" datatype="name">nameb</bcf:field> + <bcf:field fieldtype="field" datatype="key">namebtype</bcf:field> + <bcf:field fieldtype="list" datatype="name">namec</bcf:field> + <bcf:field fieldtype="field" datatype="key">namectype</bcf:field> + <bcf:field fieldtype="field" datatype="literal">note</bcf:field> + <bcf:field fieldtype="field" datatype="literal">number</bcf:field> + <bcf:field fieldtype="field" datatype="special">options</bcf:field> + <bcf:field fieldtype="list" datatype="literal">organization</bcf:field> + <bcf:field fieldtype="field" datatype="literal">origday</bcf:field> + <bcf:field fieldtype="field" datatype="literal">origendday</bcf:field> + <bcf:field fieldtype="field" datatype="literal">origendmonth</bcf:field> + <bcf:field fieldtype="field" datatype="literal" nullok="true">origendyear</bcf:field> + <bcf:field fieldtype="field" datatype="key">origlanguage</bcf:field> + <bcf:field fieldtype="list" datatype="literal">origlocation</bcf:field> + <bcf:field fieldtype="field" datatype="literal">origmonth</bcf:field> + <bcf:field fieldtype="list" datatype="literal">origpublisher</bcf:field> + <bcf:field fieldtype="field" datatype="literal">origtitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">origyear</bcf:field> + <bcf:field fieldtype="field" datatype="range">pages</bcf:field> + <bcf:field fieldtype="field" datatype="literal">pagetotal</bcf:field> + <bcf:field fieldtype="field" datatype="key">pagination</bcf:field> + <bcf:field fieldtype="field" datatype="literal">part</bcf:field> + <bcf:field fieldtype="field" datatype="literal" skip_output="true">presort</bcf:field> + <bcf:field fieldtype="list" datatype="literal">publisher</bcf:field> + <bcf:field fieldtype="field" datatype="key">pubstate</bcf:field> + <bcf:field fieldtype="field" datatype="literal">related</bcf:field> + <bcf:field fieldtype="field" datatype="literal">relatedtype</bcf:field> + <bcf:field fieldtype="field" datatype="literal">reprinttitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">series</bcf:field> + <bcf:field fieldtype="list" datatype="name">shortauthor</bcf:field> + <bcf:field fieldtype="list" datatype="name">shorteditor</bcf:field> + <bcf:field fieldtype="field" datatype="literal">shorthand</bcf:field> + <bcf:field fieldtype="field" datatype="literal">shorthandintro</bcf:field> + <bcf:field fieldtype="field" datatype="literal">shortjournal</bcf:field> + <bcf:field fieldtype="field" datatype="literal">shortseries</bcf:field> + <bcf:field fieldtype="field" datatype="literal">shorttitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal" skip_output="true">sortkey</bcf:field> + <bcf:field fieldtype="list" datatype="name" skip_output="true">sortname</bcf:field> + <bcf:field fieldtype="field" datatype="literal" skip_output="true">sorttitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal" skip_output="true">sortyear</bcf:field> + <bcf:field fieldtype="field" datatype="literal">subtitle</bcf:field> + <bcf:field fieldtype="field" datatype="literal">title</bcf:field> + <bcf:field fieldtype="field" datatype="literal">titleaddon</bcf:field> + <bcf:field fieldtype="list" datatype="name">translator</bcf:field> + <bcf:field fieldtype="field" datatype="key">type</bcf:field> + <bcf:field fieldtype="field" datatype="verbatim">url</bcf:field> + <bcf:field fieldtype="field" datatype="literal">usera</bcf:field> + <bcf:field fieldtype="field" datatype="literal">userb</bcf:field> + <bcf:field fieldtype="field" datatype="literal">userc</bcf:field> + <bcf:field fieldtype="field" datatype="literal">userd</bcf:field> + <bcf:field fieldtype="field" datatype="literal">usere</bcf:field> + <bcf:field fieldtype="field" datatype="literal">userf</bcf:field> + <bcf:field fieldtype="field" datatype="literal">urlday</bcf:field> + <bcf:field fieldtype="field" datatype="literal">urlendday</bcf:field> + <bcf:field fieldtype="field" datatype="literal">urlendmonth</bcf:field> + <bcf:field fieldtype="field" datatype="literal" nullok="true">urlendyear</bcf:field> + <bcf:field fieldtype="field" datatype="literal">urlmonth</bcf:field> + <bcf:field fieldtype="field" datatype="literal">urlyear</bcf:field> + <bcf:field fieldtype="field" datatype="literal">venue</bcf:field> + <bcf:field fieldtype="field" datatype="verbatim">verba</bcf:field> + <bcf:field fieldtype="field" datatype="verbatim">verbb</bcf:field> + <bcf:field fieldtype="field" datatype="verbatim">verbc</bcf:field> + <bcf:field fieldtype="field" datatype="literal">version</bcf:field> + <bcf:field fieldtype="field" datatype="literal">volume</bcf:field> + <bcf:field fieldtype="field" datatype="literal">volumes</bcf:field> + <bcf:field fieldtype="field" datatype="literal">xref</bcf:field> + <bcf:field fieldtype="field" datatype="literal">year</bcf:field> + </bcf:fields> + <bcf:entryfields> + <bcf:entrytype>ALL</bcf:entrytype> + <bcf:field>abstract</bcf:field> + <bcf:field>annotation</bcf:field> + <bcf:field>authortype</bcf:field> + <bcf:field>bookpagination</bcf:field> + <bcf:field>crossref</bcf:field> + <bcf:field>entryset</bcf:field> + <bcf:field>entrysubtype</bcf:field> + <bcf:field>execute</bcf:field> + <bcf:field>file</bcf:field> + <bcf:field>gender</bcf:field> + <bcf:field>hyphenation</bcf:field> + <bcf:field>indextitle</bcf:field> + <bcf:field>indexsorttitle</bcf:field> + <bcf:field>isan</bcf:field> + <bcf:field>ismn</bcf:field> + <bcf:field>iswc</bcf:field> + <bcf:field>keywords</bcf:field> + <bcf:field>label</bcf:field> + <bcf:field>library</bcf:field> + <bcf:field>lista</bcf:field> + <bcf:field>listb</bcf:field> + <bcf:field>listc</bcf:field> + <bcf:field>listd</bcf:field> + <bcf:field>liste</bcf:field> + <bcf:field>listf</bcf:field> + <bcf:field>nameaddon</bcf:field> + <bcf:field>options</bcf:field> + <bcf:field>origday</bcf:field> + <bcf:field>origendday</bcf:field> + <bcf:field>origendmonth</bcf:field> + <bcf:field>origendyear</bcf:field> + <bcf:field>origmonth</bcf:field> + <bcf:field>origyear</bcf:field> + <bcf:field>origlocation</bcf:field> + <bcf:field>origpublisher</bcf:field> + <bcf:field>origtitle</bcf:field> + <bcf:field>pagination</bcf:field> + <bcf:field>presort</bcf:field> + <bcf:field>related</bcf:field> + <bcf:field>relatedtype</bcf:field> + <bcf:field>reprinttitle</bcf:field> + <bcf:field>shortauthor</bcf:field> + <bcf:field>shorteditor</bcf:field> + <bcf:field>shorthand</bcf:field> + <bcf:field>shorthandintro</bcf:field> + <bcf:field>shortjournal</bcf:field> + <bcf:field>shortseries</bcf:field> + <bcf:field>shorttitle</bcf:field> + <bcf:field>sortkey</bcf:field> + <bcf:field>sortname</bcf:field> + <bcf:field>sorttitle</bcf:field> + <bcf:field>sortyear</bcf:field> + <bcf:field>usera</bcf:field> + <bcf:field>userb</bcf:field> + <bcf:field>userc</bcf:field> + <bcf:field>userd</bcf:field> + <bcf:field>usere</bcf:field> + <bcf:field>userf</bcf:field> + <bcf:field>verba</bcf:field> + <bcf:field>verbb</bcf:field> + <bcf:field>verbc</bcf:field> + <bcf:field>xref</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>set</bcf:entrytype> + <bcf:field>ALL</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>article</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>journaltitle</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>annotator</bcf:field> + <bcf:field>commentator</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>editora</bcf:field> + <bcf:field>editorb</bcf:field> + <bcf:field>editorc</bcf:field> + <bcf:field>editoratype</bcf:field> + <bcf:field>editorbtype</bcf:field> + <bcf:field>editorctype</bcf:field> + <bcf:field>eid</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>issn</bcf:field> + <bcf:field>issue</bcf:field> + <bcf:field>issuetitle</bcf:field> + <bcf:field>issuesubtitle</bcf:field> + <bcf:field>journalsubtitle</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>origlanguage</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>series</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>translator</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>version</bcf:field> + <bcf:field>volume</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>bibnote</bcf:entrytype> + <bcf:field>note</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>book</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>afterword</bcf:field> + <bcf:field>annotator</bcf:field> + <bcf:field>chapter</bcf:field> + <bcf:field>commentator</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>edition</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>editora</bcf:field> + <bcf:field>editorb</bcf:field> + <bcf:field>editorc</bcf:field> + <bcf:field>editoratype</bcf:field> + <bcf:field>editorbtype</bcf:field> + <bcf:field>editorctype</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>foreword</bcf:field> + <bcf:field>introduction</bcf:field> + <bcf:field>isbn</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>maintitle</bcf:field> + <bcf:field>maintitleaddon</bcf:field> + <bcf:field>mainsubtitle</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>origlanguage</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>pagetotal</bcf:field> + <bcf:field>part</bcf:field> + <bcf:field>publisher</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>series</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>translator</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>volume</bcf:field> + <bcf:field>volumes</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>inbook</bcf:entrytype> + <bcf:entrytype>bookinbook</bcf:entrytype> + <bcf:entrytype>suppbook</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>booktitle</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>afterword</bcf:field> + <bcf:field>annotator</bcf:field> + <bcf:field>bookauthor</bcf:field> + <bcf:field>booksubtitle</bcf:field> + <bcf:field>booktitleaddon</bcf:field> + <bcf:field>chapter</bcf:field> + <bcf:field>commentator</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>edition</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>editora</bcf:field> + <bcf:field>editorb</bcf:field> + <bcf:field>editorc</bcf:field> + <bcf:field>editoratype</bcf:field> + <bcf:field>editorbtype</bcf:field> + <bcf:field>editorctype</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>foreword</bcf:field> + <bcf:field>introduction</bcf:field> + <bcf:field>isbn</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>mainsubtitle</bcf:field> + <bcf:field>maintitle</bcf:field> + <bcf:field>maintitleaddon</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>origlanguage</bcf:field> + <bcf:field>part</bcf:field> + <bcf:field>publisher</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>series</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>translator</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>volume</bcf:field> + <bcf:field>volumes</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>booklet</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>chapter</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>howpublished</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>pagetotal</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>type</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>collection</bcf:entrytype> + <bcf:entrytype>reference</bcf:entrytype> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>afterword</bcf:field> + <bcf:field>annotator</bcf:field> + <bcf:field>chapter</bcf:field> + <bcf:field>commentator</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>edition</bcf:field> + <bcf:field>editora</bcf:field> + <bcf:field>editorb</bcf:field> + <bcf:field>editorc</bcf:field> + <bcf:field>editoratype</bcf:field> + <bcf:field>editorbtype</bcf:field> + <bcf:field>editorctype</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>foreword</bcf:field> + <bcf:field>introduction</bcf:field> + <bcf:field>isbn</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>mainsubtitle</bcf:field> + <bcf:field>maintitle</bcf:field> + <bcf:field>maintitleaddon</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>origlanguage</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>pagetotal</bcf:field> + <bcf:field>part</bcf:field> + <bcf:field>publisher</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>series</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>translator</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>volume</bcf:field> + <bcf:field>volumes</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>incollection</bcf:entrytype> + <bcf:entrytype>suppcollection</bcf:entrytype> + <bcf:entrytype>inreference</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>booktitle</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>afterword</bcf:field> + <bcf:field>annotator</bcf:field> + <bcf:field>booksubtitle</bcf:field> + <bcf:field>booktitleaddon</bcf:field> + <bcf:field>chapter</bcf:field> + <bcf:field>commentator</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>edition</bcf:field> + <bcf:field>editora</bcf:field> + <bcf:field>editorb</bcf:field> + <bcf:field>editorc</bcf:field> + <bcf:field>editoratype</bcf:field> + <bcf:field>editorbtype</bcf:field> + <bcf:field>editorctype</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>foreword</bcf:field> + <bcf:field>introduction</bcf:field> + <bcf:field>isbn</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>mainsubtitle</bcf:field> + <bcf:field>maintitle</bcf:field> + <bcf:field>maintitleaddon</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>origlanguage</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>part</bcf:field> + <bcf:field>publisher</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>series</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>translator</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>volume</bcf:field> + <bcf:field>volumes</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>manual</bcf:entrytype> + <bcf:field>title</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>author</bcf:field> + <bcf:field>chapter</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>edition</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>isbn</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>organization</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>pagetotal</bcf:field> + <bcf:field>publisher</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>series</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>type</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>version</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>misc</bcf:entrytype> + <bcf:field>title</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>author</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>howpublished</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>organization</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>type</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>version</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>online</bcf:entrytype> + <bcf:field>title</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>author</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>organization</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>version</bcf:field> + <bcf:field>year</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>patent</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>holder</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>type</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>version</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>periodical</bcf:entrytype> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>editora</bcf:field> + <bcf:field>editorb</bcf:field> + <bcf:field>editorc</bcf:field> + <bcf:field>editoratype</bcf:field> + <bcf:field>editorbtype</bcf:field> + <bcf:field>editorctype</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>issn</bcf:field> + <bcf:field>issue</bcf:field> + <bcf:field>issuesubtitle</bcf:field> + <bcf:field>issuetitle</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>series</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>volume</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>proceedings</bcf:entrytype> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>chapter</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>eventday</bcf:field> + <bcf:field>eventendday</bcf:field> + <bcf:field>eventendmonth</bcf:field> + <bcf:field>eventendyear</bcf:field> + <bcf:field>eventmonth</bcf:field> + <bcf:field>eventyear</bcf:field> + <bcf:field>eventtitle</bcf:field> + <bcf:field>isbn</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>mainsubtitle</bcf:field> + <bcf:field>maintitle</bcf:field> + <bcf:field>maintitleaddon</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>organization</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>pagetotal</bcf:field> + <bcf:field>part</bcf:field> + <bcf:field>publisher</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>series</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>venue</bcf:field> + <bcf:field>volume</bcf:field> + <bcf:field>volumes</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>inproceedings</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>booktitle</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>booksubtitle</bcf:field> + <bcf:field>booktitleaddon</bcf:field> + <bcf:field>chapter</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>eventday</bcf:field> + <bcf:field>eventendday</bcf:field> + <bcf:field>eventendmonth</bcf:field> + <bcf:field>eventendyear</bcf:field> + <bcf:field>eventmonth</bcf:field> + <bcf:field>eventyear</bcf:field> + <bcf:field>eventtitle</bcf:field> + <bcf:field>isbn</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>mainsubtitle</bcf:field> + <bcf:field>maintitle</bcf:field> + <bcf:field>maintitleaddon</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>organization</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>part</bcf:field> + <bcf:field>publisher</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>series</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>venue</bcf:field> + <bcf:field>volume</bcf:field> + <bcf:field>volumes</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>report</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>type</bcf:field> + <bcf:field>institution</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>chapter</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>isrn</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>number</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>pagetotal</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + <bcf:field>version</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>thesis</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>type</bcf:field> + <bcf:field>institution</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>chapter</bcf:field> + <bcf:field>doi</bcf:field> + <bcf:field>eprint</bcf:field> + <bcf:field>eprintclass</bcf:field> + <bcf:field>eprinttype</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>pages</bcf:field> + <bcf:field>pagetotal</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + </bcf:entryfields> + <bcf:entryfields> + <bcf:entrytype>unpublished</bcf:entrytype> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>day</bcf:field> + <bcf:field>endday</bcf:field> + <bcf:field>endmonth</bcf:field> + <bcf:field>endyear</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>year</bcf:field> + <bcf:field>addendum</bcf:field> + <bcf:field>howpublished</bcf:field> + <bcf:field>language</bcf:field> + <bcf:field>location</bcf:field> + <bcf:field>month</bcf:field> + <bcf:field>note</bcf:field> + <bcf:field>pubstate</bcf:field> + <bcf:field>subtitle</bcf:field> + <bcf:field>titleaddon</bcf:field> + <bcf:field>url</bcf:field> + <bcf:field>urlday</bcf:field> + <bcf:field>urlendday</bcf:field> + <bcf:field>urlendmonth</bcf:field> + <bcf:field>urlendyear</bcf:field> + <bcf:field>urlmonth</bcf:field> + <bcf:field>urlyear</bcf:field> + </bcf:entryfields> + <bcf:constraints> + <bcf:entrytype>article</bcf:entrytype> + <bcf:entrytype>book</bcf:entrytype> + <bcf:entrytype>inbook</bcf:entrytype> + <bcf:entrytype>bookinbook</bcf:entrytype> + <bcf:entrytype>suppbook</bcf:entrytype> + <bcf:entrytype>booklet</bcf:entrytype> + <bcf:entrytype>collection</bcf:entrytype> + <bcf:entrytype>incollection</bcf:entrytype> + <bcf:entrytype>suppcollection</bcf:entrytype> + <bcf:entrytype>manual</bcf:entrytype> + <bcf:entrytype>misc</bcf:entrytype> + <bcf:entrytype>online</bcf:entrytype> + <bcf:entrytype>patent</bcf:entrytype> + <bcf:entrytype>periodical</bcf:entrytype> + <bcf:entrytype>suppperiodical</bcf:entrytype> + <bcf:entrytype>proceedings</bcf:entrytype> + <bcf:entrytype>inproceedings</bcf:entrytype> + <bcf:entrytype>reference</bcf:entrytype> + <bcf:entrytype>inreference</bcf:entrytype> + <bcf:entrytype>report</bcf:entrytype> + <bcf:entrytype>set</bcf:entrytype> + <bcf:entrytype>thesis</bcf:entrytype> + <bcf:entrytype>unpublished</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:fieldxor> + <bcf:field coerce="true">date</bcf:field> + <bcf:field>year</bcf:field> + </bcf:fieldxor> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>set</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>entryset</bcf:field> + <bcf:field>crossref</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>article</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>journaltitle</bcf:field> + <bcf:field>title</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>book</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>inbook</bcf:entrytype> + <bcf:entrytype>bookinbook</bcf:entrytype> + <bcf:entrytype>suppbook</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>booktitle</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>booklet</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:fieldor> + <bcf:field>author</bcf:field> + <bcf:field>editor</bcf:field> + </bcf:fieldor> + <bcf:field>title</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>collection</bcf:entrytype> + <bcf:entrytype>reference</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>incollection</bcf:entrytype> + <bcf:entrytype>suppcollection</bcf:entrytype> + <bcf:entrytype>inreference</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>booktitle</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>manual</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>title</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>misc</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>title</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>online</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>title</bcf:field> + <bcf:field>url</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>patent</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>number</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>periodical</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>proceedings</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>inproceedings</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>editor</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>booktitle</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>report</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>type</bcf:field> + <bcf:field>institution</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>thesis</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + <bcf:field>type</bcf:field> + <bcf:field>institution</bcf:field> + </bcf:constraint> + </bcf:constraints> + <bcf:constraints> + <bcf:entrytype>unpublished</bcf:entrytype> + <bcf:constraint type="mandatory"> + <bcf:field>author</bcf:field> + <bcf:field>title</bcf:field> + </bcf:constraint> + </bcf:constraints> + </bcf:structure> + <!-- SECTION 0 --> + <bcf:bibdata section="0"> + <bcf:datasource type="file" datatype="bibtex">structure-dateformats.bib</bcf:datasource> + </bcf:bibdata> + <bcf:section number="0"> + <bcf:citekey>L1</bcf:citekey> + <bcf:citekey>L2</bcf:citekey> + <bcf:citekey>L3</bcf:citekey> + <bcf:citekey>L4</bcf:citekey> + <bcf:citekey>L5</bcf:citekey> + <bcf:citekey>L6</bcf:citekey> + <bcf:citekey>L7</bcf:citekey> + <bcf:citekey>L8</bcf:citekey> + <bcf:citekey>L9</bcf:citekey> + <bcf:citekey>L10</bcf:citekey> + <bcf:citekey>L11</bcf:citekey> + <bcf:citekey>L12</bcf:citekey> + <bcf:citekey>L13</bcf:citekey> + <bcf:citekey>L14</bcf:citekey> + <bcf:citekey>L15</bcf:citekey> + <bcf:citekey>L16</bcf:citekey> + <bcf:citekey>L17</bcf:citekey> + <bcf:sectionlist label="MAIN" type="entry"/> + <bcf:sectionlist label="SHORTHANDS" type="shorthand"> + <bcf:filter type="field">shorthand</bcf:filter> + </bcf:sectionlist> + </bcf:section> +</bcf:controlfile> diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/structure-dateformats.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/structure-dateformats.bib new file mode 100644 index 00000000000..9686cb338e3 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/structure-dateformats.bib @@ -0,0 +1,151 @@ +% WRONG - ORIGDATE is mistyped, URLDATE is just wrong +% YEAR is messy and should be done by DATE but isn't wrong as such +% MONTH is out of range +@ARTICLE{L1, + AUTHOR = {John Doe}, + JOURNALTITLE = {Journal}, + TITLE = {Title 1}, + YEAR = {1995--1996}, + MONTH = {14}, + ORIGDATE = {1985-1030}, + URLDATE = {1.5.1998}, +} + +% WRONG - missing dash between month and day +@BOOK{L2, + AUTHOR = {John Doe}, + TITLE = {Title 2}, + PUBLISHER = {Oxford}, + ORIGDATE = {1995-1230}, + YEAR = {1991} +} + +% WRONG - completely wrong date range format +@BOOK{L3, + AUTHOR = {John Doe}, + TITLE = {Title 3}, + PUBLISHER = {Oxford}, + URL = {http://a/b/c}, + URLDATE = {1.5.1988}, + YEAR = {1854} +} + +% WRONG - 1 digit month +@BOOK{L4, + AUTHOR = {John Doe and Albert Abrahams}, + TITLE = {Title 1}, + PUBLISHER = {Oxford}, + DATE = {1995-1-04}, +} + +% WRONG - 1 digit day +@BOOK{L5, + AUTHOR = {John Doe and Albert Abrahams}, + TITLE = {Title 2}, + PUBLISHER = {Oxford}, + DATE = {1995-10-4}, +} + +% WRONG - month out of bounds +@BOOK{L6, + AUTHOR = {John Doe and Albert Abrahams}, + TITLE = {Title 1}, + PUBLISHER = {Oxford}, + DATE = {1996-13-03}, +} + +% WRONG - day out of bounds +@PROCEEDINGS{L7, + EDITOR = {John Doe and Albert Abrahams}, + TITLE = {Title 2}, + PUBLISHER = {Oxford}, + EVENTDATE = {1996-10-35}, + YEAR = {1934} +} + +% WRONG - MONTH not integer +@ARTICLE{L8, + AUTHOR = {Bill Shakespeare}, + JOURNALTITLE = {Journal}, + TITLE = {Works}, + YEAR = {1985a}, + MONTH = {january} +} + +% OK +@PROCEEDINGS{L9, + EDITOR = {John Doe and Albert Abrahams}, + TITLE = {Title 2}, + PUBLISHER = {Oxford}, + EVENTDATE = {1996-12-31}, + YEAR = {1234} +} + +% OK +@PROCEEDINGS{L10, + EDITOR = {John Doe and Albert Abrahams}, + TITLE = {Title 2}, + PUBLISHER = {Oxford}, + EVENTDATE = {1996-01-01}, + YEAR = {1239} +} + +% WRONG - DATE and YEAR specified +@BOOK{L11, + AUTHOR = {John Doe and Albert Abrahams}, + TITLE = {Title 2}, + PUBLISHER = {Oxford}, + DATE = {1996-01-01}, + YEAR = {1998}, +} + +% WRONG - DATE and MONTH specified +@ARTICLE{L12, + AUTHOR = {John Doe and Albert Abrahams}, + JOURNALTITLE = {Journal}, + TITLE = {Title 2}, + DATE = {1996-01-01}, + MONTH = {02}, +} + +% OK - open-ended date +@BOOK{L13, + AUTHOR = {John Doe and Albert Abrahams}, + TITLE = {Title 2}, + PUBLISHER = {Oxford}, + DATE = {1996-01-01/}, +} + +% OK - ENDYEAR same as YEAR, labelyear should only have YEAR +@BOOK{L14, + AUTHOR = {John Doe and Albert Abrahams}, + TITLE = {Title 2}, + PUBLISHER = {Oxford}, + DATE = {1996-12-10/1996-12-12}, +} + +% OK - labelyear should be undef, no DATE or YEAR +@BOOK{L15, + AUTHOR = {John Doe and Albert Abrahams}, + TITLE = {Title 2}, + PUBLISHER = {Oxford}, +} + +% MISSING YEAR/DATE +@PROCEEDINGS{L16, + EDITOR = {John Doe and Albert Abrahams}, + TITLE = {Title 2}, + PUBLISHER = {Oxford}, + EVENTDATE = {1996-01-01}, +} + +% OK - YEAR same as ENDYEAR, labelyear should only have YEAR +@PROCEEDINGS{L17, + EDITOR = {John Doe and Albert Abrahams}, + TITLE = {Title 2}, + PUBLISHER = {Oxford}, + DATE = {1996-12-10/1996-12-12}, + ORIGDATE = {1998-12-10/1998-12-12}, + EVENTDATE = {1998-12-10/2004-12-12}, +} + diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/uniquename.bcf b/Master/texmf-dist/source/bibtex/biber/t/tdata/uniquename.bcf new file mode 100644 index 00000000000..11b619ee05f --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/uniquename.bcf @@ -0,0 +1,233 @@ +<?xml version="1.0" encoding="UTF-8"?>
+<?oxygen RNGSchema="../../data/schemata/bcf.rnc" type="compact"?>
+<?xml-stylesheet type="text/xsl" href="../../data/bcf.xsl"?>
+<bcf:controlfile version="1.2" xmlns:bcf="https://sourceforge.net/projects/biblatex">
+ <!-- OPTIONS -->
+ <bcf:options component="biber" type="global">
+ <bcf:option type="singlevalued">
+ <bcf:key>bblencoding</bcf:key>
+ <bcf:value>utf8</bcf:value>
+ </bcf:option>
+ <bcf:option type="singlevalued">
+ <bcf:key>bibencoding</bcf:key>
+ <bcf:value>utf8</bcf:value>
+ </bcf:option>
+ <bcf:option type="singlevalued">
+ <bcf:key>debug</bcf:key>
+ <bcf:value>0</bcf:value>
+ </bcf:option>
+ <bcf:option type="singlevalued">
+ <bcf:key>mincrossrefs</bcf:key>
+ <bcf:value>2</bcf:value>
+ </bcf:option>
+ <bcf:option type="singlevalued">
+ <bcf:key>sortcase</bcf:key>
+ <bcf:value>0</bcf:value>
+ </bcf:option>
+ <bcf:option type="singlevalued">
+ <bcf:key>sortupper</bcf:key>
+ <bcf:value>1</bcf:value>
+ </bcf:option>
+ </bcf:options>
+ <bcf:options component="biblatex" type="global">
+ <bcf:option type="singlevalued">
+ <bcf:key>alphaothers</bcf:key>
+ <bcf:value>\textbf{+}</bcf:value>
+ </bcf:option>
+ <bcf:option type="singlevalued">
+ <bcf:key>labelalpha</bcf:key>
+ <bcf:value>1</bcf:value>
+ </bcf:option>
+ <bcf:option type="multivalued">
+ <bcf:key>labelnamespec</bcf:key>
+ <bcf:value order="1">shortauthor</bcf:value>
+ <bcf:value order="2">author</bcf:value>
+ <bcf:value order="3">shorteditor</bcf:value>
+ <bcf:value order="4">editor</bcf:value>
+ <bcf:value order="5">translator</bcf:value>
+ </bcf:option>
+ <bcf:option type="singlevalued">
+ <bcf:key>labelyear</bcf:key>
+ <bcf:value>1</bcf:value>
+ </bcf:option>
+ <bcf:option type="multivalued">
+ <bcf:key>labelyearspec</bcf:key>
+ <bcf:value order="1">year</bcf:value>
+ </bcf:option>
+ <bcf:option type="singlevalued">
+ <bcf:key>maxitems</bcf:key>
+ <bcf:value>3</bcf:value>
+ </bcf:option>
+ <bcf:option type="singlevalued">
+ <bcf:key>maxnames</bcf:key>
+ <bcf:value>1</bcf:value>
+ </bcf:option>
+ <bcf:option type="singlevalued">
+ <bcf:key>minitems</bcf:key>
+ <bcf:value>1</bcf:value>
+ </bcf:option>
+ <bcf:option type="singlevalued">
+ <bcf:key>minnames</bcf:key>
+ <bcf:value>1</bcf:value>
+ </bcf:option>
+ <bcf:option type="singlevalued">
+ <bcf:key>singletitle</bcf:key>
+ <bcf:value>0</bcf:value>
+ </bcf:option>
+ <bcf:option type="singlevalued">
+ <bcf:key>sortalphaothers</bcf:key>
+ <bcf:value>+</bcf:value>
+ </bcf:option>
+ <bcf:option type="singlevalued">
+ <bcf:key>sortlos</bcf:key>
+ <bcf:value>0</bcf:value>
+ </bcf:option>
+ <bcf:option type="singlevalued">
+ <bcf:key>terseinits</bcf:key>
+ <bcf:value>0</bcf:value>
+ </bcf:option>
+ <bcf:option type="singlevalued">
+ <bcf:key>uniquename</bcf:key>
+ <bcf:value>2</bcf:value>
+ </bcf:option>
+ <bcf:option type="singlevalued">
+ <bcf:key>useauthor</bcf:key>
+ <bcf:value>1</bcf:value>
+ </bcf:option>
+ <bcf:option type="singlevalued">
+ <bcf:key>useeditor</bcf:key>
+ <bcf:value>1</bcf:value>
+ </bcf:option>
+ <bcf:option type="singlevalued">
+ <bcf:key>useprefix</bcf:key>
+ <bcf:value>1</bcf:value>
+ </bcf:option>
+ <bcf:option type="singlevalued">
+ <bcf:key>usetranslator</bcf:key>
+ <bcf:value>1</bcf:value>
+ </bcf:option>
+ </bcf:options>
+ <!-- CROSSREF -->
+ <bcf:inheritance>
+ <bcf:defaults inherit_all="true" override_target="false">
+ </bcf:defaults>
+ <bcf:inherit>
+ <bcf:type_pair source="mvbook" target="inbook"/>
+ <bcf:type_pair source="mvbook" target="bookinbook"/>
+ <bcf:type_pair source="mvbook" target="suppbook"/>
+ <bcf:type_pair source="book" target="inbook"/>
+ <bcf:type_pair source="book" target="bookinbook"/>
+ <bcf:type_pair source="book" target="suppbook"/>
+ <bcf:field source="author" target="author"/>
+ <bcf:field source="author" target="bookauthor"/>
+ </bcf:inherit>
+ <bcf:inherit>
+ <bcf:type_pair source="mvbook" target="book"/>
+ <bcf:type_pair source="mvbook" target="inbook"/>
+ <bcf:type_pair source="mvbook" target="bookinbook"/>
+ <bcf:type_pair source="mvbook" target="suppbook"/>
+ <bcf:field source="title" target="maintitle"/>
+ <bcf:field source="subtitle" target="mainsubtitle"/>
+ <bcf:field source="titleaddon" target="maintitleaddon"/>
+ </bcf:inherit>
+ <bcf:inherit>
+ <bcf:type_pair source="mvcollection" target="collection"/>
+ <bcf:type_pair source="mvcollection" target="incollection"/>
+ <bcf:type_pair source="mvcollection" target="suppcollection"/>
+ <bcf:field source="title" target="maintitle"/>
+ <bcf:field source="subtitle" target="mainsubtitle"/>
+ <bcf:field source="titleaddon" target="maintitleaddon"/>
+ </bcf:inherit>
+ <bcf:inherit>
+ <bcf:type_pair source="mvproceedings" target="proceedings"/>
+ <bcf:type_pair source="mvproceedings" target="inproceedings"/>
+ <bcf:field source="title" target="maintitle"/>
+ <bcf:field source="subtitle" target="mainsubtitle"/>
+ <bcf:field source="titleaddon" target="maintitleaddon"/>
+ </bcf:inherit>
+ <bcf:inherit>
+ <bcf:type_pair source="mvreference" target="reference"/>
+ <bcf:type_pair source="mvreference" target="inreference"/>
+ <bcf:field source="title" target="maintitle"/>
+ <bcf:field source="subtitle" target="mainsubtitle"/>
+ <bcf:field source="titleaddon" target="maintitleaddon"/>
+ </bcf:inherit>
+ <bcf:inherit>
+ <bcf:type_pair source="book" target="inbook"/>
+ <bcf:type_pair source="book" target="bookinbook"/>
+ <bcf:type_pair source="book" target="suppbook"/>
+ <bcf:field source="title" target="booktitle"/>
+ <bcf:field source="subtitle" target="booksubtitle"/>
+ <bcf:field source="titleaddon" target="booktitleaddon"/>
+ </bcf:inherit>
+ <bcf:inherit>
+ <bcf:type_pair source="collection" target="incollection"/>
+ <bcf:type_pair source="collection" target="suppcollection"/>
+ <bcf:field source="title" target="booktitle"/>
+ <bcf:field source="subtitle" target="booksubtitle"/>
+ <bcf:field source="titleaddon" target="booktitleaddon"/>
+ </bcf:inherit>
+ <bcf:inherit>
+ <bcf:type_pair source="reference" target="inreference"/>
+ <bcf:field source="title" target="booktitle"/>
+ <bcf:field source="subtitle" target="booksubtitle"/>
+ <bcf:field source="titleaddon" target="booktitleaddon"/>
+ </bcf:inherit>
+ <bcf:inherit>
+ <bcf:type_pair source="proceedings" target="inproceedings"/>
+ <bcf:field source="title" target="booktitle"/>
+ <bcf:field source="subtitle" target="booksubtitle"/>
+ <bcf:field source="titleaddon" target="booktitleaddon"/>
+ </bcf:inherit>
+ <bcf:inherit>
+ <bcf:type_pair source="periodical" target="article"/>
+ <bcf:type_pair source="periodical" target="suppperiodical"/>
+ <bcf:field source="title" target="journaltitle"/>
+ <bcf:field source="subtitle" target="journalsubtitle"/>
+ </bcf:inherit>
+ </bcf:inheritance>
+ <bcf:sorting>
+ <bcf:presort>mm</bcf:presort>
+ <bcf:sort order="1">
+ <bcf:sortitem order="1">presort</bcf:sortitem>
+ </bcf:sort>
+ <bcf:sort order="2" final="1">
+ <bcf:sortitem order="1">sortkey</bcf:sortitem>
+ </bcf:sort>
+ <bcf:sort order="3">
+ <bcf:sortitem order="1">sortname</bcf:sortitem>
+ <bcf:sortitem order="2">author</bcf:sortitem>
+ <bcf:sortitem order="3">editor</bcf:sortitem>
+ <bcf:sortitem order="4">translator</bcf:sortitem>
+ <bcf:sortitem order="5">sorttitle</bcf:sortitem>
+ <bcf:sortitem order="6">title</bcf:sortitem>
+ </bcf:sort>
+ <bcf:sort order="4">
+ <bcf:sortitem order="1">sorttitle</bcf:sortitem>
+ <bcf:sortitem order="2">title</bcf:sortitem>
+ </bcf:sort>
+ <bcf:sort order="5">
+ <bcf:sortitem order="1">sortyear</bcf:sortitem>
+ <bcf:sortitem order="2">year</bcf:sortitem>
+ </bcf:sort>
+ <bcf:sort order="6">
+ <bcf:sortitem order="1">volume</bcf:sortitem>
+ <bcf:sortitem order="2">0000</bcf:sortitem>
+ </bcf:sort>
+ </bcf:sorting>
+ <!-- SECTION 0 -->
+ <bcf:bibdata section="0">
+ <bcf:datasource type="file" datatype="bibtex">uniquename.bib</bcf:datasource>
+ </bcf:bibdata>
+ <bcf:section number="0">
+ <bcf:citekey>un1</bcf:citekey>
+ <bcf:citekey>un2</bcf:citekey>
+ <bcf:citekey>un3</bcf:citekey>
+ <bcf:citekey>un4</bcf:citekey>
+ <bcf:citekey>un5</bcf:citekey>
+ <bcf:sectionlist label="MAIN" type="entry"/>
+ <bcf:sectionlist label="SHORTHANDS" type="shorthand">
+ <bcf:filter type="field">shorthand</bcf:filter>
+ </bcf:sectionlist>
+ </bcf:section>
+</bcf:controlfile>
diff --git a/Master/texmf-dist/source/bibtex/biber/t/tdata/uniquename.bib b/Master/texmf-dist/source/bibtex/biber/t/tdata/uniquename.bib new file mode 100644 index 00000000000..469a2574126 --- /dev/null +++ b/Master/texmf-dist/source/bibtex/biber/t/tdata/uniquename.bib @@ -0,0 +1,60 @@ +@BOOK{un1, + AUTHOR = {John Doe}, + TITLE = {Unique 1}, + PUBLISHER = {A press}, + LOCATION = {Cambridge}, + YEAR = {1994}, +} + +@BOOK{un2, + AUTHOR = {Edward Doe}, + TITLE = {Unique 2}, + PUBLISHER = {A press}, + LOCATION = {Cambridge}, + YEAR = {1934}, +} + +@BOOK{un3, + AUTHOR = {Jane Doe}, + TITLE = {Unique 3}, + PUBLISHER = {A press}, + LOCATION = {Cambridge}, + YEAR = {1983}, +} + +@BOOK{un4, + AUTHOR = {John Doe and Mike Mills}, + TITLE = {Unique 4}, + PUBLISHER = {A press}, + LOCATION = {Cambridge}, + YEAR = {1921}, +} + +@BOOK{un5, + SHORTAUTHOR = {Chaps}, + AUTHOR = {John Doe and Mike Mills}, + TITLE = {Unique 5}, + PUBLISHER = {A press}, + LOCATION = {Cambridge}, + YEAR = {1921}, +} + +@BOOK{un6, + AUTHOR = {I. Light}, + TITLE = {Deflecting Immigration}, + SUBTITLE = {Networks, Markets, and regulation in Los Angeles}, + YEAR = {2006}, + LOCATION = {New York, NY}, + PUBLISHER = {Russell Sage Foundation}, + KEYWORDS = {noinclude} +} + +@BOOK{un7, + AUTHOR = {M. A. Light and I. H. Light}, + TITLE = {The Geographic Expansiion of Mexican Immigration in the United States and its Implications for Local Law Enforcement}, + YEAR = {2008}, + JOURNALTITLE = {Law Enforcement Executive Forum Journal}, + VOLUME = {8}, + PAGES = {73--82}, +} + |