Úpravy uploadovací mašinerie

[ga.git] / ga.bib

diff --git a/ga.bib b/ga.bib
index 5985c58382213ac3f98e5c7f2cd15aa2c1d961e4..8a6fc486f093179b41cee9ca33f9bc30324263cc 100644 (file)
--- a/ga.bib
+++ b/ga.bib
@@ -627,3 +627,124 @@
     url = {http://dx.doi.org/10.1109/SFCS.2005.39},
     year = {2005}
 }
+
+@article{ zwick:apsp,
+    author = {Zwick, Uri},
+    citeulike-article-id = {1027459},
+    citeulike-linkout-0 = {http://dx.doi.org/10.1007/s00453-005-1199-1},
+    citeulike-linkout-1 = {http://www.ingentaconnect.com/content/klu/453/2006/00000046/00000002/00001199},
+    doi = {10.1007/s00453-005-1199-1},
+    issn = {0178-4617},
+    journal = {Algorithmica},
+    month = {October},
+    number = {2},
+    pages = {181--192},
+    posted-at = {2007-01-06 00:46:43},
+    publisher = {Springer},
+    title = {{A Slightly Improved Sub-Cubic Algorithm for the All Pairs Shortest Paths Problem with Real Edge Lengths}},
+    url = {http://dx.doi.org/10.1007/s00453-005-1199-1},
+    volume = {46},
+    year = {2006}
+}
+
+@article{ chan:apsp,
+    author = {Chan, Timothy},
+    citeulike-article-id = {2315328},
+    citeulike-linkout-0 = {http://dx.doi.org/10.1007/s00453-007-9062-1},
+    doi = {10.1007/s00453-007-9062-1},
+    journal = {Algorithmica},
+    keywords = {algorithms, graph},
+    month = {February},
+    number = {2},
+    pages = {236--243},
+    posted-at = {2008-01-31 15:49:43},
+    priority = {2},
+    title = {{All-Pairs Shortest Paths with Real Weights in $O(n^3/\log n)$ Time}},
+    url = {http://dx.doi.org/10.1007/s00453-007-9062-1},
+    volume = {50},
+    year = {2008}
+}
+
+@article{ fredman:apsp,
+  title={{New bounds on the complexity of the shortest path problem}},
+  author={Fredman, M.L.},
+  journal={SIAM Journal on Computing},
+  volume={5},
+  pages={83},
+  year={1976}
+}
+
+@article{ zwick:apspint,
+  title={{All pairs shortest paths using bridging sets and rectangular matrix multiplication}},
+  author={Zwick, U.},
+  journal={Journal of the ACM (JACM)},
+  volume={49},
+  number={3},
+  pages={289--317},
+  issn={0004-5411},
+  year={2002},
+  publisher={ACM}
+}
+
+@inproceedings{ seidel:unitlength,
+ author = {Seidel, Raimund},
+ title = {On the all-pairs-shortest-path problem},
+ booktitle = {Proceedings of the twenty-fourth annual ACM symposium on Theory of computing},
+ year = {1992},
+ isbn = {0-89791-511-9},
+ location = {Victoria, British Columbia, Canada},
+ pages = {745--749},
+ numpages = {5},
+ url = {http://doi.acm.org/10.1145/129712.129784},
+ doi = {http://doi.acm.org/10.1145/129712.129784},
+ acmid = {129784},
+ publisher = {ACM},
+}
+
+@article{ haeupler:rankph,
+  title={Rank-pairing heaps},
+  author={Haeupler, B. and Sen, S. and Tarjan, R.},
+  journal={Algorithms-ESA 2009},
+  pages={659--670},
+  year={2009},
+  publisher={Springer}
+}
+
+@article{ elmasry:violheap,
+  title={{The violation heap: a relaxed Fibonacci-like heap}},
+  author={Elmasry, A.},
+  journal={Computing and Combinatorics},
+  pages={479--488},
+  year={2010},
+  publisher={Springer}
+}
+
+@inproceedings{ fredman:cellprobe,
+  author = {M. Fredman and M. Saks},
+  title = {The cell probe complexity of dynamic data structures},
+  booktitle = {STOC '89: Proceedings of the 21st annual ACM Symposium on Theory of Computing},
+  year = {1989},
+  isbn = {0-89791-307-8},
+  pages = {345--354},
+  location = {Seattle, Washington, United States},
+  doi = {http://doi.acm.org/10.1145/73007.73040},
+}
+
+@inproceedings{ alstrup:worstuf,
+  title={Worst-case and amortised optimality in union-find},
+  author={Alstrup, S. and Ben-Amram, A.M. and Rauhe, T.},
+  booktitle={Proceedings of the 31st annual ACM symposium on Theory of computing},
+  pages={499--506},
+  year={1999},
+  organization={ACM}
+}
+
+@article{ rs:wagner,
+  title={{Graph minors: XX. Wagner's Conjecture}},
+  author={Robertson, N. and Seymour, P. D.},
+  journal={Journal of Combinatorial Theory Series B},
+  volume={92},
+  number={2},
+  pages={325--357},
+  year={2004},
+}