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},
+}