From: Martin Mares <mj@ucw.cz>
Date: Sat, 3 May 2008 20:40:03 +0000 (+0200)
Subject: Bibliography: Next round of corrections.
X-Git-Tag: printed~13
X-Git-Url: http://mj.ucw.cz/gitweb/?a=commitdiff_plain;h=4bb28a9fa18be89c1992fce6db8a5cb70fbba804;p=saga.git

Bibliography: Next round of corrections.
---

diff --git a/biblio.bib b/biblio.bib
index 37f4677..73c04bb 100644
--- a/biblio.bib
+++ b/biblio.bib
@@ -4,7 +4,8 @@
     booktitle = "Latin American Theoretical {INformatics}",
     pages = "88--94",
     year = "2000",
-    url = "citeseer.ist.psu.edu/bender00lca.html" }
+    url = "citeseer.ist.psu.edu/bender00lca.html"
+}
 
 @article{ frederickson:ambivalent,
   author = "Frederickson, Greg N.",
@@ -14,7 +15,6 @@
   number={2},
   pages={484--538},
   year={1997},
-  publisher={Society for Industrial and Applied Mathematics}
 }
 
 @inproceedings{ frederickson:ambifocs,
@@ -23,7 +23,8 @@
     booktitle = "{IEEE} Symposium on Foundations of Computer Science",
     pages = "632--641",
     year = "1991",
-    url = "citeseer.ist.psu.edu/frederickson91ambivalent.html" }
+    url = "citeseer.ist.psu.edu/frederickson91ambivalent.html"
+}
 
 @article{ tarjan:wcsetunion,
  author = {Robert E. Tarjan and Jan van Leeuwen},
@@ -35,8 +36,6 @@
  issn = {0004-5411},
  pages = {245--281},
  doi = {http://doi.acm.org/10.1145/62.2160},
- publisher = {ACM Press},
- address = {New York, NY, USA},
 }
 
 @article{ tarjan:setunion,
@@ -53,16 +52,15 @@
 @inproceedings { fw:transdich,
    author = "M. Fredman and D. E. Willard",
    title = "{Trans-dichotomous algorithms for minimum spanning trees and shortest paths}",
-   booktitle={FOCS '90: Proceedings of the 31st Annual Symposium on Foundations of Computer Science},
+   booktitle={FOCS '90: Proceedings of the 31st Annual IEEE Symposium on Foundations of Computer Science},
    pages = "719--725",
    year = "1990"
 }
 
 @article{ boas:vebt,
   author    = {Peter van Emde Boas},
-  title     = {Preserving Order in a Forest in Less Than Logarithmic Time
-               and Linear Space.},
-  journal   = {Inf. Process. Lett.},
+  title     = {Preserving Order in a Forest in Less Than Logarithmic Time and Linear Space},
+  journal   = {Information Processing Letters},
   volume    = {6},
   number    = {3},
   year      = {1977},
@@ -91,7 +89,7 @@
 @article{ chazelle:ackermann,
     author = "Bernard Chazelle",
     title = "{A Minimum Spanning Tree Algorithm with Inverse-Ackermann Type Complexity}",
-    journal = jacm,
+    journal = "Journal of the ACM",
     volume = "47",
     number = {6},
     pages = "1028--1047",
@@ -100,8 +98,8 @@
 
 @inproceedings{ chazelle:almostacker,
   title={{A faster deterministic algorithm for minimum spanning trees}},
-  author={Chazelle, B.},
-  booktitle={FOCS '97: Proceedings of the 38th Annual Symposium on Foundations of Computer Science},
+  author={Chazelle, Bernard},
+  booktitle={FOCS '97: Proceedings of the 38th Annual IEEE Symposium on Foundations of Computer Science},
   pages={22},
   year={1997},
 }
@@ -157,7 +155,7 @@
 @article { jarnik:ojistem,
     author = "Vojt\v{e}ch Jarn\'\i{}k",
     title = "{O jist\'em probl\'emu minim\'aln\'\i{}m (About a Certain Minimal Problem)}",
-    journal = "Pr\'ace mor. p\v{r}\'\i{}rodov\v{e}d. spol. v~Brn\v{e}",
+    journal = "Pr\'ace moravsk\'e p\v{r}\'\i{}rodov\v{e}deck\'e spole\v{c}nosti v~Brn\v{e}",
     volume = "VI",
     year = "1930",
     pages = "57--63",
@@ -167,7 +165,7 @@
 @book { tarjan:dsna,
     author = "Robert E. Tarjan",
     title = "{Data structures and network algorithms}",
-    series = "{CMBS-NSF Regional Conf. Series in Appl. Math.}",
+    series = "{CMBS-NSF Regional Conference Series in Applied Mathematics}",
     volume = 44,
     year = "1983",
     publisher = "SIAM"
@@ -197,7 +195,6 @@
    title = "{An Optimal Minimum Spanning Tree Algorithm}",
    booktitle = "{Proceedings of ICALP 2000}",
    year = "2000",
-   publisher = "Springer Verlag",
    pages = "49--60"
 }
 
@@ -211,7 +208,7 @@
 @article { karger:randomized,
    author = "D. R. Karger and P. N. Klein and R. E. Tarjan",
    title = "{A Randomized Linear-Time Algorithm to Find Minimum Spanning Trees}",
-   journal = jacm,
+   journal = "Journal of the ACM",
    volume = "42",
    number = "2",
    pages = "321--328",
@@ -221,7 +218,7 @@
 @inproceedings { karger:sampling,
    title={Random sampling in matroids, with applications to graph connectivity and minimum spanning trees},
    author={Karger, D. R.},
-   booktitle={Proceedings of the 34th Annual Symposium on Foundations of Computer Science},
+   booktitle={FOCS '93: Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science},
    year={1993},
    pages={84--93}
 }
@@ -234,7 +231,6 @@
   number={6},
   pages={303--304},
   year={1998},
-  publisher={Elsevier}
 }
 
 @article { frederickson:online,
@@ -263,7 +259,7 @@
   volume = "4698",
   series = "Lecture Notes in Computer Science",
   pages = "187--193",
-  publisher = "Springer",
+  publisher = "Springer Verlag",
   year = "2007",
 }
 
@@ -293,10 +289,15 @@
 @inproceedings{ king:verify,
     author = "Valerie King",
     title = "A Simpler Minimum Spanning Tree Verification Algorithm",
-    booktitle = "Workshop on Algorithms and Data Structures",
+    booktitle = "{Algorithms and Data Structures --- WADS '95: 4th International Workshop}",
     pages = "440--448",
     year = "1995",
-    url = "citeseer.ist.psu.edu/king95simpler.html" }
+    location = "Kingston, Canada",
+    volume = "955",
+    series = "Lecture Notes in Computer Science",
+    publisher = "Springer Verlag",
+    url = "citeseer.ist.psu.edu/king95simpler.html"
+}
 
 @article{ king:verifytwo,
   title={{A Simpler Minimum Spanning Tree Verification Algorithm}},
@@ -319,13 +320,11 @@
 @inproceedings{ thorup:aczero,
  author = {Mikkel Thorup},
  title = {{On ${\rm AC}^0$ Implementations of Fusion Trees and Atomic Heaps}},
- booktitle = {SODA '03: Proceedings of the 14th annual ACM-SIAM symposium on Discrete algorithms},
+ booktitle = {SODA '03: Proceedings of the 14th annual ACM-SIAM Symposium on Discrete algorithms},
  year = {2003},
  isbn = {0-89871-538-5},
  pages = {699--707},
  location = {Baltimore, Maryland},
- publisher = {Society for Industrial and Applied Mathematics},
- address = {Philadelphia, PA, USA},
 }
 
 @article{ kruskal:mst,
@@ -343,7 +342,7 @@
   title={{Graph Theory}},
   author={Diestel, R.},
   year={2005},
-  publisher={Springer-Verlag}
+  publisher={Springer Verlag}
 }
 
 @article{ graham:msthistory,
@@ -373,7 +372,7 @@
   number={1},
   pages={269--271},
   year={1959},
-  publisher={Springer}
+  publisher={Springer Verlag}
 }
 
 @article{ prim:mst,
@@ -422,7 +421,7 @@
   location={Tokyo, Japan},
   year={1999},
   pages={41--50},
-  publisher={Springer},
+  publisher={Springer Verlag},
   series={{Lecture Notes in Computer Science}},
   volume={1627}
 }
@@ -434,7 +433,7 @@
   location={Sydney, Australia},
   year={2000},
   pages={362--372},
-  publisher={Springer},
+  publisher={Springer Verlag},
   series={{Lecture Notes in Computer Science}},
   volume={1858}
 }
@@ -461,7 +460,7 @@
   author = "S. Pettie",
   title = "An inverse-{A}ckermann style lower bound for the online minimum spanning
     tree verification problem",
-  booktitle = "Proc. 43rd Annual Symp. on the Foundations of Computer Science, Vancouver, Canada",
+  booktitle = "FOCS 2002: Proceedings of the 43rd Annual Symposium on Foundations of Computer Science",
   year = "2002",
   url = "citeseer.ist.psu.edu/article/pettie02inverseackermann.html"
 }
@@ -485,8 +484,6 @@
  isbn = {0-89871-513-X},
  pages = {713--722},
  location = {San Francisco, California},
- publisher = {Society for Industrial and Applied Mathematics},
- address = {Philadelphia, PA, USA}
 }
 
 @inproceedings{ buchsbaum:verify,
@@ -511,11 +508,11 @@
 @inproceedings{ katriel:cycle,
   author = "I. Katriel and P. Sanders and J. Tr{\"a}ff",
   title = "A practical minimum spanning tree algorithm using the cycle property",
-  booktitle = "11th European Symposium on Algorithms (ESA)",
+  booktitle = "Algorithms --- ESA 2003: 11th European Symposium",
   number = "2832",
   series = "LNCS",
   pages = "679--690",
-  publisher = "Springer",
+  publisher = "Springer Verlag",
   year = "2003",
   url = "citeseer.ist.psu.edu/katriel03practical.html"
 }
@@ -523,7 +520,7 @@
 @article{ alstrup:nca,
   title={{Nearest Common Ancestors: A Survey and a new Distributed Algorithm}},
   author={Alstrup, S. and Gavoille, C. and Kaplan, H. and Rauhe, T.},
-  journal={Proceedings of the 14th annual ACM symposium on Parallel algorithms and architectures},
+  journal={Proceedings of the 14th annual ACM Symposium on Parallel algorithms and architectures},
   pages={258--264},
   year={2002},
 }
@@ -536,14 +533,14 @@
   number={2},
   pages={109--122},
   year={1986},
-  publisher={Springer}
+  publisher={Springer Verlag}
 }
 
 @Unpublished{ eisner:tutorial,
   author = 	 {Jason Eisner},
   title = 	 {{State-of-the-Art Algorithms for Minimum Spanning
                   Trees: A~Tutorial Discussion}},
-  note = 	 {Manuscript available online (78 pages), University of Pennsylvania}, 
+  note = 	 {Manuscript available online (78 pages), University of Pennsylvania},
   year =	 1997,
   url =		 {http://cs.jhu.edu/~jason/papers/#ms97},
 }
@@ -587,7 +584,7 @@
 @inproceedings{ hagerup:wordram,
  author = {Torben Hagerup},
  title = {{Sorting and Searching on the Word RAM}},
- booktitle = {STACS '98: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science},
+ booktitle = {STACS '98: Proceedings of the 15th annual Symposium on Theoretical Aspects of Computer Science},
  year = {1998},
  isbn = {3-540-64230-7},
  pages = {366--398},
@@ -636,7 +633,6 @@
   number={3},
   pages={538--544},
   year={1984},
-  publisher={ACM Press New York, NY, USA}
 }
 
 @book{ motwani:randalg,
@@ -654,7 +650,6 @@
   number={3},
   pages={424--436},
   year={1993},
-  publisher={Academic Press, Inc. Orlando, FL, USA}
 }
 
 @article{ han:detsort,
@@ -713,14 +708,14 @@
   number={4},
   pages={265--268},
   year={1967},
-  publisher={Springer},
+  publisher={Springer Verlag},
   note={In German}
 }
 
 @inproceedings{ gustedt:parallel,
     author = "Jens Gustedt",
     title = "Minimum Spanning Trees for Minor-Closed Graph Classes in Parallel",
-    booktitle = "Symposium on Theoretical Aspects of Computer Science",
+    booktitle = "STACS '98: Proceedings of the 15th annual Symposium on Theoretical Aspects of Computer Science",
     pages = "421-431",
     year = "1998",
     url = "citeseer.ist.psu.edu/223918.html"
@@ -747,7 +742,7 @@
 @article{ ruskey:ham,
   title={{The Hamiltonicity of directed-Cayley graphs (or: A tale of backtracking)}},
   author={Ruskey, F. and Jiang, M. and Weston, A.},
-  journal={Discrete Appl. Math},
+  journal={Discrete Applied Mathematics},
   volume={57},
   pages={75--83},
   year={1995}
@@ -804,7 +799,6 @@
   number={2},
   pages={325--357},
   year={2004},
-  publisher={Academic Press, Inc. Orlando, FL, USA}
 }
 
 @book{ matnes:idm,
@@ -825,7 +819,7 @@
 @article{ kaplansky:rooks,
   title={{The problem of the rooks and its applications}},
   author={Kaplansky, I. and Riordan, J.},
-  journal={Duke Math. J},
+  journal={Duke Mathematical Journal},
   volume={13},
   number={2},
   pages={259--268},
@@ -886,10 +880,9 @@
 @article{ yuster:matching,
   title={{Maximum matching in graphs with an excluded minor}},
   author={Yuster, R. and Zwick, U.},
-  journal={Proceedings of the 18th annual ACM-SIAM symposium on Discrete algorithms},
+  journal={SODA 2007: Proceedings of the 18th annual ACM-SIAM Symposium on Discrete Algorithms},
   pages={108--117},
   year={2007},
-  publisher={Society for Industrial and Applied Mathematics Philadelphia, PA, USA}
 }
 
 @article{ mucha:matching,
@@ -900,7 +893,6 @@
   number={1},
   pages={3--20},
   year={2006},
-  publisher={Springer}
 }
 
 @article {lovasz:minors,
@@ -932,13 +924,12 @@
   number={1},
   pages={86--109},
   year={2001},
-  publisher={Society for Industrial and Applied Mathematics}
 }
 
 @article{ thorup:pqsssp,
   title={{Integer priority queues with decrease key in constant time and the single source shortest paths problem}},
   author={Thorup, M.},
-  journal={Proceedings of the 35th ACM Symposium on Theory of Computing},
+  journal={STOC 2003: Proceedings of the 35th ACM Symposium on Theory of Computing},
   pages={149--158},
   year={2003},
 }
@@ -950,7 +941,6 @@
   volume={34},
   pages={1370},
   year={2005},
-  publisher={SIAM}
 }
 
 @inproceedings{ czumaj:metric,
@@ -966,7 +956,7 @@
 @inproceedings{ czumaj:euclidean,
  author = {Artur Czumaj and Funda Erg\"{u}n and Lance Fortnow and Avner Magen and Ilan Newman and Ronitt Rubinfeld and Christian Sohler},
  title = {Sublinear-time approximation of Euclidean minimum spanning tree},
- booktitle = {SODA '03: Proceedings of the 14th annual ACM-SIAM symposium on Discrete algorithms},
+ booktitle = {SODA '03: Proceedings of the 14th annual ACM-SIAM Symposium on Discrete Algorithms},
  year = {2003},
  isbn = {0-89871-538-5},
  pages = {813--822},
@@ -998,7 +988,6 @@
   number={2},
   pages={189--201},
   year={2000},
-  publisher={Academic Press}
 }
 
 @article{ shamos:closest,
@@ -1017,7 +1006,6 @@
   number={1},
   pages={153--174},
   year={1987},
-  publisher={Springer}
 }
 
 @article{ zhou:nodel,
@@ -1028,7 +1016,6 @@
   number={5},
   pages={271--276},
   year={2002},
-  publisher={Elsevier}
 }
 
 @techreport{ eppstein:spanning,
@@ -1086,7 +1073,6 @@
   number={2},
   pages={338--355},
   year={1984},
-  publisher={Society for Industrial and Applied Mathematics Philadelphia, PA, USA}
 }
 
 @article{ gomoryhu,
@@ -1118,7 +1104,6 @@
   number={3},
   pages={362--391},
   year={1983},
-  publisher={Academic Press, Inc. Orlando, FL, USA}
 }
 
 @article{ chernoff,
@@ -1165,8 +1150,6 @@
  issn = {0196-6774},
  pages = {170--217},
  doi = {http://dx.doi.org/10.1006/jagm.1997.0917},
- publisher = {Academic Press, Inc.},
- address = {Duluth, MN, USA},
 }
 
 @article{ vuillemin:binheap,
@@ -1220,7 +1203,6 @@
   number={3},
   pages={141--146},
   year={1999},
-  publisher={Elsevier}
 }
 
 @inproceedings{ zemlay:treeiso,
@@ -1234,10 +1216,10 @@
   note={In Russian},
 }
 
-@article{ alstrup:marked,
+@inproceedings{ alstrup:marked,
   title={{Marked ancestor problems}},
   author={Alstrup, S. and Husfeldt, T. and Rauhe, T.},
-  journal={FOCS '98: Proceedings of the 39th Annual Symposium on Foundations of Computer Science},
+  booktitle={FOCS '98: Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science},
   pages={534--543},
   year={1998}
 }
@@ -1281,8 +1263,6 @@
   pages = {345--354},
   location = {Seattle, Washington, United States},
   doi = {http://doi.acm.org/10.1145/73007.73040},
-  publisher = {ACM},
-  address = {New York, NY, USA},
 }
 
 @article{ henzinger:randdyn,
@@ -1303,7 +1283,6 @@
   number={4},
   pages={723--760},
   year={2001},
-  publisher={ACM Press New York, NY, USA}
 }
 
 @article{ frederickson:dynamic,
@@ -1323,16 +1302,14 @@
   number={5},
   pages={669--696},
   year={1997},
-  publisher={ACM Press New York, NY, USA}
 }
 
 @article{ henzinger:mst,
   title={{Maintaining minimum spanning trees in dynamic graphs}},
   author={Henzinger, M. R. and King, V.},
-  journal={Proceedings of the 24th International Colloquium on Automata, Languages and Programming},
+  journal={ICALP '97: Proceedings of the 24th International Colloquium on Automata, Languages and Programming},
   pages={594--604},
   year={1997},
-  publisher={Springer}
 }
 
 @mastersthesis { mares:dga,
@@ -1358,8 +1335,7 @@
   title = {Design of Dynamic Data Structures},
   year = {1987},
   isbn = {038712330X},
-  publisher = {Springer-Verlag New York, Inc.},
-  address = {Secaucus, NJ, USA},
+  publisher = {Springer Verlag},
   series={{Lecture Notes in Computer Science}},
   volume={156}
 }
@@ -1372,7 +1348,7 @@
   number={2},
   pages={237--248},
   year={1992},
-  publisher={Springer}
+  publisher={Springer Verlag}
 }
 
 @article{ katoh:ksmallest,
@@ -1382,7 +1358,6 @@
   volume={10},
   pages={247},
   year={1981},
-  publisher={SIAM}
 }
 
 @inproceedings{ thorup:nearopt,
@@ -1394,8 +1369,6 @@
  pages = {343--350},
  location = {Portland, Oregon, United States},
  doi = {http://doi.acm.org/10.1145/335305.335345},
- publisher = {ACM},
- address = {New York, NY, USA},
 }
 
 @article{ henzinger:lowerbounds,
@@ -1406,7 +1379,6 @@
   number={3},
   pages={351--362},
   year={1998},
-  publisher={Springer}
 }
 
 @article{ thorup:usssp,
@@ -1429,8 +1401,6 @@
   issn = {0022-0000},
   pages = {330--353},
   doi = {http://dx.doi.org/10.1016/j.jcss.2004.04.003},
-  publisher = {Academic Press, Inc.},
-  address = {Orlando, FL, USA},
 }
 
 @inproceedings{ hagerup:sssp,
@@ -1461,7 +1431,6 @@
 @article{ katoh:kmin,
   author = {N. Katoh and T. Ibaraki and H. Mine},
   title = {An Algorithm for Finding $K$ Minimum Spanning Trees},
-  publisher = {SIAM},
   year = {1981},
   journal = {SIAM Journal on Computing},
   volume = {10},
@@ -1479,8 +1448,6 @@
   issn = {0004-5411},
   pages = {297--323},
   doi = {http://doi.acm.org/10.1145/375827.375847},
-  publisher = {ACM},
-  address = {New York, NY, USA},
 }
 
 @article{ moret:expmst,
@@ -1499,20 +1466,17 @@
   number={1},
   pages={111--129},
   year={1986},
-  publisher={Springer}
 }
 
 @article{ pettie:pairing,
   author = {Seth Pettie},
   title = {Towards a Final Analysis of Pairing Heaps},
-  journal = {focs},
+  booktitle = {FOCS 2005: Proceedings of the 46rd Annual IEEE Symposium on Foundations of Computer Science},
   volume = {00},
   year = {2005},
   isbn = {0-7695-2468-0},
   pages = {174-183},
   doi = {http://doi.ieeecomputersociety.org/10.1109/SFCS.2005.75},
-  publisher = {IEEE Computer Society},
-  address = {Los Alamitos, CA, USA},
 }
 
 @book{ jaja:parallel,
@@ -1553,8 +1517,6 @@
  issn = {0004-5411},
  pages = {690--715},
  doi = {http://doi.acm.org/10.1145/322154.322161},
- publisher = {ACM},
- address = {New York, NY, USA},
 }
 
 @article{ kostochka:lbh,
@@ -1565,7 +1527,6 @@
   number={4},
   pages={307--316},
   year={1984},
-  publisher={Springer}
 }
 
 @article{ thomason:efc,
diff --git a/pref.tex b/pref.tex
index 4cbc01a..cdff6b4 100644
--- a/pref.tex
+++ b/pref.tex
@@ -39,7 +39,7 @@ included in the textbook \cite{mm:ga} which I have written for this course.
 \:The tree isomorphism algorithm in Section \ref{bucketsort}. Not published yet.
 \:Both algorithms for minor-closed graph classes in Section \ref{minorclosed}. Published in \cite{mm:mst}.
 \:The linear-time verification algorithm in Section \ref{verifysect} is a~simplification
-  of the algorithm of King \cite{king:verify} and it corrects many omissions
+  of the algorithm of King \cite{king:verifytwo} and it corrects many omissions
   in the original paper. Not published yet.
 \:The ranking algorithms in Sections \ref{ranksect} to \ref{kpranksect} are results of joint research with Milan Straka.
   Published in \cite{mm:rank}.