Mention Thorup's priority queue.

[saga.git] / biblio.bib

diff --git a/biblio.bib b/biblio.bib
index 697fd9d9bca7d3c1aae0f0215d849ed7a35ff43d..304eb3cd27ad2dea9604638877eee3a7a3a17d7e 100644 (file)
--- a/biblio.bib
+++ b/biblio.bib
@@ -296,15 +296,6 @@
   publisher={Springer-Verlag Berlin and Heidelberg GmbH \& Co.}
 }
 
-@article{ thorup:pq,
-  title={{Integer priority queues with decrease key in constant time and the single source shortest paths problem}},
-  author={Thorup, M.},
-  journal={Proceedings of the thirty-fifth ACM Symposium on Theory of Computing},
-  pages={149--158},
-  year={2003},
-  publisher={ACM Press New York, NY, USA}
-}
-
 @article{ graham:msthistory,
   title={{On the history of the minimum spanning tree problem}},
   author={Graham, R.L. and Hell, P.},
@@ -764,3 +755,140 @@ inproceedings{ pettie:minirand,
   year={2004},
   publisher={Academic Press, Inc. Orlando, FL, USA}
 }
+
+@book{ matnes:idm,
+  title={{Invitation to Discrete Mathematics}},
+  author={Matou{\v{s}}ek, J. and Ne{\v{s}}et{\v{r}}il, J.},
+  year={1998},
+  publisher={Oxford University Press}
+}
+
+@article{ stanley:econe,
+  title={{Enumerative combinatorics. Vol. 1}},
+  author={Stanley, R.P.},
+  journal={Cambridge Studies in Advanced Mathematics},
+  volume={49},
+  year={1997}
+}
+
+@article{ kaplansky:rooks,
+  title={{The problem of the rooks and its applications}},
+  author={Kaplansky, I. and Riordan, J.},
+  journal={Duke Math. J},
+  volume={13},
+  number={2},
+  pages={259--268},
+  year={1946}
+}
+
+@article{ dinic:flow,
+  author = {E. A. Dinic},
+  title = {Algorithm for solution of a problem of maximum flow in networks with power estimation},
+  journal = {Soviet Math. Dokl.},
+  volume = {11},
+  year = {1970},
+  pages = {1277--1280}
+}
+
+@article{ even:dinic,
+  author = {Shimon Even and Robert Endre Tarjan},
+  title = {Network Flow and Testing Graph Connectivity},
+  publisher = {SIAM},
+  year = {1975},
+  journal = {SIAM Journal on Computing},
+  volume = {4},
+  number = {4},
+  pages = {507--518},
+  url = {http://link.aip.org/link/?SMJ/4/507/1},
+  doi = {10.1137/0204043}
+}
+
+@article{ valiant:permanent,
+  title={{The complexity of computing the permanent}},
+  author={Valiant, L. G.},
+  journal={Theoretical Computer Science},
+  volume={8},
+  number={2},
+  pages={189--201},
+  year={1979}
+}
+
+@article{ jerrum:permanent,
+  title={{A Polynomial-Time Approximation Algorithm for the Permanent of a Matrix with Nonnegative Entries}},
+  author={Jerrum, M. and Sinclair, A. and Vigoda, E.},
+  journal={Journal of the ACM},
+  volume={51},
+  number={4},
+  pages={671--697},
+  year={2004}
+}
+
+@article{ kasteleyn:crystals,
+  title={{Graph theory and crystal physics}},
+  author={Kasteleyn, P. W.},
+  journal={Graph Theory and Theoretical Physics},
+  publisher={Academic Press, London},
+  pages={43--110},
+  year={1967}
+}
+
+@article{ yuster:matching,
+  title={{Maximum matching in graphs with an excluded minor}},
+  author={Yuster, R. and Zwick, U.},
+  journal={Proceedings of the eighteenth 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,
+  title={{Maximum Matchings in Planar Graphs via Gaussian Elimination}},
+  author={Mucha, M. and Sankowski, P.},
+  journal={Algorithmica},
+  volume={45},
+  number={1},
+  pages={3--20},
+  year={2006},
+  publisher={Springer}
+}
+
+@article {lovasz:minors,
+  title={{Graph Minor Theory}},
+  author={Lov\'asz, L.},
+  journal={Bulletin of the American Mathematical Society},
+  volume={43},
+  number={1},
+  pages={75--86},
+  year={2005}
+}
+
+@article{ andersson:fusion,
+  title={{Fusion trees can be implemented with AC0 instructions only}},
+  author={Andersson, A. and Miltersen, P.B. and Thorup, M.},
+  journal={Theoretical Computer Science},
+  volume={215},
+  number={1-2},
+  pages={337--344},
+  year={1999},
+  publisher={Elsevier}
+}
+
+@article{ thorup:rampq,
+  title={{On RAM priority queues}},
+  author={THORUP, M.},
+  journal={SIAM journal on computing(Print)},
+  volume={30},
+  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 thirty-fifth ACM Symposium on Theory of Computing},
+  pages={149--158},
+  year={2003},
+  publisher={ACM Press New York, NY, USA}
+}