@inproceedings{ frederickson91ambivalent,
author = "Greg N. Frederickson",
- title = "Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees",
+ title = "Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and $k$ Smallest Spanning Trees",
booktitle = "{IEEE} Symposium on Foundations of Computer Science",
pages = "632-641",
year = "1991",
author = "J. K{\"a}rkk{\"a}inen and P. Sanders",
title = "Simple linear work suffix array construction",
booktitle = "Proc. 13th International Conference on Automata, Languages and Programming",
- publisher = "Springer",
+ publisher = "Springer Verlag",
year = "2003",
url = "citeseer.ist.psu.edu/arkk03simple.html" }
publisher = {Elsevier North-Holland, Inc.},
address = {Amsterdam, The Netherlands, The Netherlands},
}
+
+@book { kapitoly,
+ author = "Ji\v{r}\'\i{} Matou\v{s}ek and Jaroslav Ne\v{s}et\v{r}il",
+ title = "{Kapitoly z~diskr\'etn\'\i{} matematiky}",
+ year = "2002",
+ publisher = "Karolinum",
+ address = "Praha"
+}
+
+@book { demel,
+ author = "Ji\v{r}\'\i{} Demel",
+ title = "{Grafy a jejich aplikace}",
+ year = 2002,
+ publisher = "Academia",
+ address = "Praha"
+}
+
+@book { schrijver,
+ author = "Alexander Schrijver",
+ title = "{Combinatorial Optimization --- Polyhedra and Efficiency}",
+ series = "Algorithms and Combinatorics",
+ volume = 24,
+ year = 2003,
+ publisher = "Springer Verlag"
+}
+
+@book { kucera,
+ author = "Lud'ek Ku\v{c}era",
+ title = "{Kombinatorick\'e algoritmy}",
+ year = 1989,
+ publisher = "SNTL",
+ address = "Praha"
+}
+
+@article{ boyer:cutting,
+ title={{On the cutting edge: Simplified $\O(n)$ planarity by edge addition}},
+ author={Boyer, J.M. and Myrvold, W.J.},
+ journal={Journal of Graph Algorithms and Applications},
+ volume={8},
+ number={3},
+ pages={241--273},
+ year={2004}
+}
+
+@article{ tarjan:planarity,
+ title={{Efficient Planarity Testing}},
+ author={Hopcroft, J. and Tarjan, R.},
+ journal={Journal of the ACM (JACM)},
+ volume={21},
+ number={4},
+ pages={549--568},
+ year={1974},
+ publisher={ACM Press New York, NY, USA}
+}
+
+@article{ schnyder:grid,
+ title={{Embedding planar graphs on the grid}},
+ author={Schnyder, W.},
+ journal={Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms},
+ pages={138--148},
+ year={1990},
+ publisher={Society for Industrial and Applied Mathematics Philadelphia, PA, USA}
+}
+
+@article{ chrobak:grid,
+ title={{A linear-time algorithm for drawing a planar graph on a grid}},
+ author={Chrobak, M. and Payne, T. H.},
+ journal={Information Processing Letters},
+ volume={54},
+ number={4},
+ pages={241--246},
+ year={1995},
+ publisher={Elsevier Science}
+}
+
+@inproceedings{ thorup:ac0,
+ author = {Mikkel Thorup},
+ title = {{On ${\rm AC}^0$ Implementations of Fusion Trees and Atomic Heaps}},
+ booktitle = {SODA '03: Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms},
+ year = {2003},
+ isbn = {0-89871-538-5},
+ pages = {699--707},
+ location = {Baltimore, Maryland},
+ publisher = {Society for Industrial and Applied Mathematics},
+ address = {Philadelphia, PA, USA},
+}
+
+@article{ kruskal:mst,
+ title={{On the Shortest Spanning Subtree of a Graph and the Traveling Salesman Problem}},
+ author={Kruskal Jr, J.B.},
+ journal={Proceedings of the American Mathematical Society},
+ volume={7},
+ number={1},
+ pages={48--50},
+ year={1956},
+ publisher={JSTOR}
+}
+
+@book{ diestel:gt,
+ title={{Graph Theory}},
+ author={Diestel, R.},
+ year={2005},
+ publisher={Springer-Verlag Berlin and Heidelberg GmbH \& Co. K}
+}
+
+@article{ thorup:usssp,
+ title={{Undirected single-source shortest paths with positive integer weights in linear time}},
+ author={Thorup, M.},
+ journal={Journal of the ACM (JACM)},
+ volume={46},
+ number={3},
+ pages={362--394},
+ year={1999},
+ publisher={ACM Press New York, NY, USA}
+}
+
+@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{ thorup:isort,
+ title={{Integer Sorting in 0 (n sqrt (log log n)) Expected Time and Linear Space}},
+ author={Han, Y. and Thorup, M.},
+ journal={Proceedings of the 43rd Symposium on Foundations of Computer Science},
+ pages={135--144},
+ year={2002},
+ publisher={IEEE Computer Society Washington, DC, USA}
+}
+
+@article{ han:sort,
+ title={{Deterministic sorting in O (nloglogn) time and linear space}},
+ author={Han, Y.},
+ journal={Journal of Algorithms},
+ volume={50},
+ number={1},
+ pages={96--105},
+ year={2004},
+ publisher={Elsevier}
+}
+
+@techreport{ burrows:bwt,
+ title={{A block-sorting lossless data compression algorithm}},
+ author={Burrows, M. and Wheeler, D.J.},
+ year={1994},
+ number={124},
+ institution={Digital Systems Research Center}
+}
+
+@article{ weihe:paths,
+ title={{Edge-Disjoint $(s,t)$-Paths in Undirected Planar Graphs in Linear Time}},
+ author={Weihe, K.},
+ journal={Journal of Algorithms},
+ volume={23},
+ number={1},
+ pages={121--138},
+ year={1997},
+ publisher={Elsevier}
+}
+
+@article{ threeinds,
+ title={{An $\O({\vert V\vert}^3)$ algorithm for finding maximum flows in networks}},
+ author={Malhotra, V. and Kumar, M.P. and Maheshwari, S.N.},
+ journal={Information Processing Letters},
+ volume={7},
+ number={6},
+ pages={277--278},
+ year={1978}
+}
+
+@article{ ahomcc,
+ title={{Efficient string matching: an aid to bibliographic search}},
+ author={Aho, A.V. and Corasick, M.J.},
+ journal={Communications of the ACM},
+ volume={18},
+ number={6},
+ pages={333--340},
+ year={1975},
+ publisher={ACM Press New York, NY, USA}
+}
+
+@article{ hopcroft:matching,
+ title={{An $n^{5/2}$ algorithm for maximum matchings in bipartite graphs}},
+ author={Hopcroft, J.E. and Karp, R.M.},
+ journal={SIAM Journal on Computing},
+ volume={2},
+ number={4},
+ pages={225--231},
+ year={1973}
+}
+
+@article{ karger:mincut,
+ author = {Karger, David R. and Stein, Clifford},
+ title = {A new approach to the minimum cut problem},
+ journal = {J. ACM},
+ volume = {43},
+ number = {4},
+ year = {1996},
+ issn = {0004-5411},
+ pages = {601--640},
+ doi = {http://doi.acm.org/10.1145/234533.234534},
+ publisher = {ACM},
+ address = {New York, NY, USA},
+}
+
+@inproceedings{ thorup:queue,
+ title={{Integer priority queues with decrease key in constant time and the single source shortest paths problem}},
+ author={Thorup, M.},
+ booktitle={Proceedings of the thirty-fifth annual ACM symposium on Theory of computing},
+ pages={149--158},
+ year={2003},
+}
+
+@article{ thorup:equiv,
+ title={{Equivalence between priority queues and sorting}},
+ author={Thorup, M.},
+ journal={Journal of the ACM},
+ volume={54},
+ number={6},
+ pages={28},
+ year={2007},
+ publisher={ACM}
+}
+
+@conference{ cherkassky:hotq,
+ title={{Buckets, heaps, lists, and monotone priority queues}},
+ author={Cherkassky, B.V. and Goldberg, A.V. and Silverstein, C.},
+ booktitle={Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms},
+ pages={83--92},
+ year={1997},
+ organization={Society for Industrial and Applied Mathematics}
+}
projects / ga.git / blobdiff