Planarita: Slidy opraveny a prizpusobeny novym terminum

[ga.git] / ga.bib

diff --git a/ga.bib b/ga.bib
index 74bc27ecba48df4c797fa5a9896b1e49d12ca512..8a6fc486f093179b41cee9ca33f9bc30324263cc 100644 (file)
--- a/ga.bib
+++ b/ga.bib
@@ -700,3 +700,51 @@
  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},
+}