From: Martin Mares Date: Sun, 4 May 2008 17:48:37 +0000 (+0200) Subject: Yet more fixes to bibliography. X-Git-Tag: printed~3 X-Git-Url: http://mj.ucw.cz/gitweb/?a=commitdiff_plain;h=afc1dcd077e0803a6bc1280d877b85f37543dc0e;p=saga.git Yet more fixes to bibliography. --- diff --git a/biblio.bib b/biblio.bib index 2971a27..7659c39 100644 --- a/biblio.bib +++ b/biblio.bib @@ -46,7 +46,6 @@ number={2}, pages={215--225}, year={1975}, - publisher={ACM Press New York, NY, USA} } @inproceedings { fw:transdich, @@ -108,6 +107,8 @@ author = "Jaroslav Ne{\v{s}}et{\v{r}}il", title = "{Some remarks on the history of MST-problem}", journal = "Archivum Mathematicum", + publisher = "Masaryk University", + address = "Brno, Czech Republic", volume = "33", pages = "15--22", year = "1997" @@ -168,7 +169,7 @@ series = "{CMBS-NSF Regional Conference Series in Applied Mathematics}", volume = 44, year = "1983", - publisher = "SIAM" + publisher = "Society for Industrial and Applied Mathematics" } @techreport { pettie:ackermann, @@ -246,6 +247,8 @@ author = "Martin Mare\v{s}", title = "{Two linear time algorithms for MST on minor closed graph classes}", journal = "{Archivum Mathematicum}", + publisher = "Masaryk University", + address = "Brno, Czech Republic", volume = "40", pages = "315--320", year = "2004" @@ -257,7 +260,7 @@ booktitle = "Algorithms --- ESA 2007: 15th Annual European Symposium", location = "Eilat, Israel, October 8--10, 2007", volume = "4698", - series = "Lecture Notes in Computer Science", + series = {{Lecture Notes in Computer Science}}, pages = "187--193", publisher = "Springer Verlag", year = "2007", @@ -320,7 +323,7 @@ @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 2003: Proceedings of the 14th annual ACM-SIAM Symposium on Discrete algorithms}, year = {2003}, isbn = {0-89871-538-5}, pages = {699--707}, @@ -460,7 +463,7 @@ author = "S. Pettie", title = "An inverse-{A}ckermann style lower bound for the online minimum spanning tree verification problem", - booktitle = "FOCS 2002: Proceedings of the 43rd Annual Symposium on Foundations of Computer Science", + booktitle = "FOCS 2002: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science", year = "2002", url = "citeseer.ist.psu.edu/article/pettie02inverseackermann.html" } @@ -479,7 +482,7 @@ @inproceedings{ pettie:minirand, author = {Seth Pettie and Vijaya Ramachandran}, title = {Minimizing randomness in minimum spanning tree, parallel connectivity, and set maxima algorithms}, - booktitle = {SODA '02: Proceedings of the 13th annual ACM-SIAM Symposium on Discrete Algorithms}, + booktitle = {SODA 2002: Proceedings of the 13th annual ACM-SIAM Symposium on Discrete Algorithms}, year = {2002}, isbn = {0-89871-513-X}, pages = {713--722}, @@ -509,8 +512,8 @@ author = "I. Katriel and P. Sanders and J. Tr{\"a}ff", title = "A practical minimum spanning tree algorithm using the cycle property", booktitle = "Algorithms --- ESA 2003: 11th European Symposium", - number = "2832", - series = "LNCS", + volume = "2832", + series = "Lecture Notes in Computer Science", pages = "679--690", publisher = "Springer Verlag", year = "2003", @@ -652,7 +655,7 @@ @inproceedings{ han:detsort, title={{Deterministic sorting in $\O(n \log\log n)$ time and linear space}}, author={Han, Y.}, - booktitle={Proceedings of the 34th annual ACM Symposium on Theory of Computing}, + booktitle={STOC 2002: Proceedings of the 34th annual ACM Symposium on Theory of Computing}, pages={602--608}, year={2002}, } @@ -660,7 +663,7 @@ @inproceedings{ hanthor:randsort, title={{Integer Sorting in $\O(n\sqrt{\log\log n})$ Expected Time and Linear Space}}, author={Han, Y. and Thorup, M.}, - booktitle={Proceedings of the 43rd Symposium on Foundations of Computer Science}, + booktitle={FOCS 2002: Proceedings of the 43rd Annual IEEE Symposium on Foundations of Computer Science}, pages={135--144}, year={2002}, } @@ -805,12 +808,11 @@ publisher={Oxford University Press} } -@article{ stanley:econe, - title={{Enumerative combinatorics. Vol. 1}}, +@book{ stanley:econe, + title={{Enumerative Combinatorics. Vol. 1 (2nd ed.)}}, author={Stanley, R. P.}, - journal={Cambridge Studies in Advanced Mathematics}, - volume={49}, - year={1997} + publisher={Cambridge University Press}, + year={2000} } @article{ kaplansky:rooks, @@ -820,7 +822,8 @@ volume={13}, number={2}, pages={259--268}, - year={1946} + year={1946}, + publisher={Duke University Press} } @article{ dinic:flow, @@ -865,10 +868,11 @@ year={2004} } -@article{ kasteleyn:crystals, +/* HACK: bibtex cannot handle a part of a book with its own name */ +@inproceedings{ kasteleyn:crystals, title={{Graph theory and crystal physics}}, author={Kasteleyn, P. W.}, - journal={Graph Theory and Theoretical Physics}, + booktitle={Graph Theory and Theoretical Physics}, publisher={Academic Press, London}, pages={43--110}, year={1967} @@ -943,7 +947,7 @@ @inproceedings{ czumaj:metric, author = {Artur Czumaj and Christian Sohler}, title = {Estimating the weight of metric minimum spanning trees in sublinear-time}, - booktitle = {STOC '04: Proceedings of the 36th annual ACM Symposium on Theory of Computing}, + booktitle = {STOC 2004: Proceedings of the 36th annual ACM Symposium on Theory of Computing}, year = {2004}, isbn = {1-58113-852-0}, pages = {175--183}, @@ -952,8 +956,8 @@ @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}, + title = {{Sublinear-time approximation of Euclidean minimum spanning tree}}, + booktitle = {SODA 2003: Proceedings of the 14th annual ACM-SIAM Symposium on Discrete Algorithms}, year = {2003}, isbn = {0-89871-538-5}, pages = {813--822}, @@ -1085,7 +1089,7 @@ @inproceedings{ bhalgat:ght, author = {Ramesh Hariharan and Telikepalli Kavitha and Debmalya Panigrahi and Anand Bhalgat}, title = {{An $\widetilde\O(mn)$ Gomory-Hu tree construction algorithm for unweighted graphs}}, - booktitle = {STOC '07: Proceedings of the 39th annual ACM Symposium on Theory of Computing}, + booktitle = {STOC 2007: Proceedings of the 39th annual ACM Symposium on Theory of Computing}, year = {2007}, isbn = {978-1-59593-631-8}, pages = {605--614}, @@ -1309,7 +1313,7 @@ } @mastersthesis { mares:dga, - title={{Dynamick\'e grafov\'e algoritmy}}, + title={{Dynamick\'e grafov\'e algoritmy (Dynamic Graph Algorithms)}}, author={Martin Mare\v{s}}, school={Charles University in Prague, Faculty of Math and Physics}, year={2000}, @@ -1359,7 +1363,7 @@ @inproceedings{ thorup:nearopt, author = {Mikkel Thorup}, title = {Near-optimal fully-dynamic graph connectivity}, - booktitle = {STOC '00: Proceedings of the 32nd annual ACM Symposium on Theory of Computing}, + booktitle = {STOC 2000: Proceedings of the 32nd annual ACM Symposium on Theory of Computing}, year = {2000}, isbn = {1-58113-184-4}, pages = {343--350}, @@ -1402,7 +1406,7 @@ @inproceedings{ hagerup:sssp, author = {Torben Hagerup}, title = {{Improved Shortest Paths on the Word RAM}}, - booktitle = {ICALP '00: Proceedings of the 27th International Colloquium on Automata, Languages and Programming}, + booktitle = {ICALP 2000: Proceedings of the 27th International Colloquium on Automata, Languages and Programming}, year = {2000}, isbn = {3-540-67715-1}, pages = {61--72}, @@ -1464,15 +1468,12 @@ year={1986}, } -@article{ pettie:pairing, +@inproceedings{ pettie:pairing, author = {Seth Pettie}, title = {Towards a Final Analysis of Pairing Heaps}, 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}, } @book{ jaja:parallel, @@ -1484,7 +1485,7 @@ @techreport { mm:ga, author = "Martin Mare\v{s}", - title = "{Krajinou grafov\'ych algoritm\accent23u}", + title = "{Krajinou grafov\'ych algoritm\accent23u (Through the Landscape of Graph Algorithms)}", institution = "Institut Teoretick\'e Informatiky", address = "Praha, Czech Republic", year = "2007", @@ -1495,7 +1496,7 @@ @book { horak:mofivefour, author = {Hor\'ak, Karel and Mare\v{s}, Martin and Novotn\'y, Peter and \v{S}im\v{s}a, Jarom\'\i{}r and \v{S}vr\v{c}ek, Jaroslav and T\"opfer, Pavel and Zhouf, Jaroslav}, - title = {54.~ro\v{c}n\'\i{}k matematick\'e olympi\'ady na st\v{r}edn\'\i{}ch \v{s}kol\'ach}, + title = {54.~ro\v{c}n\'\i{}k matematick\'e olympi\'ady na st\v{r}edn\'\i{}ch \v{s}kol\'ach (The 54th Year of the Math Olympiad at High Schools)}, publisher = {Jednota \v{c}esk\'ych matematik\accent23u a fyzik\accent23u}, address = {Praha}, year = {2007}, @@ -1516,7 +1517,7 @@ } @article{ kostochka:lbh, - title={{Lower bound of the hadwiger number of graphs by their average degree}}, + title={{Lower bound of the Hadwiger number of graphs by their average degree}}, author={Kostochka, A. V.}, journal={Combinatorica}, volume={4},