refs.bib

@misc{ekzhang2022Nov,
	author = {ekzhang},
	title = {{ekzlib: code library}},
	year = {2022},
	month = nov,
	note = {[Online; accessed 2. Nov. 2022]},
	url = {https://ekzlib.netlify.app/home}
}

@misc{spaghetti-source2022Nov,
	author = {spaghetti-source},
	title = {{algorithm}},
	journal = {GitHub},
	year = {2022},
	month = nov,
	note = {[Online; accessed 2. Nov. 2022]},
	url = {https://github.com/spaghetti-source/algorithm}
}

@article{Henzinger1998Nov,
	author = {Henzinger, M. R. and Fredman, M. L.},
	title = {{Lower Bounds for Fully Dynamic Connectivity Problems in Graphs}},
	journal = {Algorithmica},
	volume = {22},
	number = {3},
	pages = {351--362},
	year = {1998},
	month = nov,
	issn = {1432-0541},
	publisher = {Springer-Verlag},
	doi = {10.1007/PL00009228}
}

@article{Miltersen1994Aug,
	author = {Miltersen, Peter Bro and Subramanian, Sairam and Vitter, Jeffrey Scott and Tamassia, Roberto},
	title = {{Complexity models for incremental computation}},
	journal = {Theoret. Comput. Sci.},
	volume = {130},
	number = {1},
	pages = {203--236},
	year = {1994},
	month = aug,
	issn = {0304-3975},
	publisher = {Elsevier},
	doi = {10.1016/0304-3975(94)90159-7}
}

@article{Karp1978Jan,
	author = {Karp, Richard M.},
	title = {{A characterization of the minimum cycle mean in a digraph}},
	journal = {Discrete Math.},
	volume = {23},
	number = {3},
	pages = {309--311},
	year = {1978},
	month = jan,
	issn = {0012-365X},
	publisher = {North-Holland},
	doi = {10.1016/0012-365X(78)90011-0}
}

@article{Hopcroft2006Jul,
	author = {Hopcroft, John E. and Karp, Richard M.},
	title = {{An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs}},
	journal = {SIAM J. Comput.},
	year = {2006},
	month = jul,
	publisher = {Society for Industrial and Applied Mathematics},
	url = {https://epubs.siam.org/doi/10.1137/0202019}
}

@misc{SPOJ_MATCHING,
	title = {{SPOJ.com - Problem MATCHING}},
	journal = {Spoj},
	year = {2022},
	month = nov,
	note = {[Online; accessed 3. Nov. 2022]},
	url = {https://www.spoj.com/problems/MATCHING}
}

@misc{CodeFuGambit,
	title = {{CodeFu - 2021 Autumn - Problem GAMBIT}},
	year = {2021},
	month = nov,
	note = {[Online; accessed 3. Nov. 2022]},
	url = {https://codefu.mk/2021-autumn.html?subpage=problem&problemid=3339}
}

@article{Gabow1976Apr,
	author = {Gabow, Harold N.},
	title = {{An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs}},
	journal = {J. ACM},
	volume = {23},
	number = {2},
	pages = {221--234},
	year = {1976},
	month = apr,
	issn = {0004-5411},
	publisher = {Association for Computing Machinery},
	doi = {10.1145/321941.321942}
}

@misc{CutPointsCPAlgo,
	title = {{Finding articulation points in a graph in O(N+M) - Algorithms for Competitive Programming}},
	year = {2022},
	month = oct,
	note = {[Online; accessed 4. Nov. 2022]},
	url = {https://cp-algorithms.com/graph/cutpoints.html}
}

@misc{CutPointsCF,
	title = {{Articulation points and bridges (Tarjan's Algorithm) - Codeforces}},
	journal = {Codeforces},
	year = {2022},
	month = nov,
	note = {[Online; accessed 4. Nov. 2022]},
	url = {https://codeforces.com/blog/entry/71146}
}

@misc{BridgesStreetDirections,
	title = {{UVa - Street Directions}},
	year = {2022},
	month = nov,
	note = {[Online; accessed 4. Nov. 2022]},
	url = {https://onlinejudge.org/index.php?option=onlinejudge&page=show_problem&problem=551}
}

@misc{SPOJ_DYNACON1,
	title = {{SPOJ.com - Problem DYNACON1}},
	journal = {Spoj},
	year = {2022},
	month = nov,
	note = {[Online; accessed 4. Nov. 2022]},
	url = {https://www.spoj.com/problems/DYNACON1}
}

@misc{QTREE6,
	title = {{CodeChef - Query on a tree VI}},
	year = {2022},
	month = nov,
	note = {[Online; accessed 12. Nov. 2022]},
	url = {https://www.codechef.com/problems/QTREE6}
}

@misc{DSUCPAlgo,
	title = {{Disjoint Set Union - Algorithms for Competitive Programming}},
	year = {2022},
	month = nov,
	note = {[Online; accessed 13. Nov. 2022]},
	url = {https://cp-algorithms.com/data_structures/disjoint_set_union.html#historical-retrospective}
}

@article{Burkhard1973Apr,
	author = {Burkhard, W. A. and Keller, R. M.},
	title = {{Some approaches to best-match file searching}},
	journal = {Commun. ACM},
	volume = {16},
	number = {4},
	pages = {230--236},
	year = {1973},
	month = apr,
	issn = {0001-0782},
	publisher = {Association for Computing Machinery},
	doi = {10.1145/362003.362025}
}

@misc{DiscreteRootCPAlgo,
	title = {{Discrete Root - Algorithms for Competitive Programming}},
	year = {2022},
	month = nov,
	note = {[Online; accessed 23. Nov. 2022]},
	url = {https://cp-algorithms.com/algebra/discrete-root.html}
}

@misc{DiscreteLogCPAlgo,
	title = {{Discrete Log - Algorithms for Competitive Programming}},
	year = {2022},
	month = nov,
	note = {[Online; accessed 23. Nov. 2022]},
	url = {https://cp-algorithms.com/algebra/discrete-log.html}
}

@misc{FactorialModP_CPAlgo,
	title = {{Factorial modulo p - Algorithms for Competitive Programming}},
	year = {2022},
	month = nov,
	note = {[Online; accessed 23. Nov. 2022]},
	url = {https://cp-algorithms.com/algebra/factorial-modulo.html#algorithm}
}

@misc{GrayCode_CPAlgo,
	title = {{Gray code - Algorithms for Competitive Programming}},
	year = {2022},
	month = nov,
	note = {[Online; accessed 24. Nov. 2022]},
	url = {https://cp-algorithms.com/algebra/gray-code.html}
}

@misc{ShahjalalShohag2022Dec,
	author = {ShahjalalShohag},
	title = {{code-library}},
	journal = {GitHub},
	year = {2022},
	month = dec,
	note = {[Online; accessed 27. Dec. 2022]},
	url = {https://github.com/ShahjalalShohag/code-library/blob/master/Data%20Structures/Sparse%20Table%202D.cpp}
}

@misc{SPOJ_ADABLOOM,
	title = {{SPOJ.com - Problem ADABLOOM}},
	journal = {Spoj},
	year = {2023},
	month = mar,
	note = {[Online; accessed 8. Mar. 2023]},
	url = {https://www.spoj.com/problems/ADABLOOM}
}

@misc{CodeForces_Blog_DynamicConnectivity,
	title = {{Dynamic connectivity problem - Codeforces}},
	journal = {Codeforces},
	year = {2023},
	month = mar,
	note = {[Online; accessed 8. Mar. 2023]},
	url = {https://codeforces.com/blog/entry/15296}
}

@article{Edmonds_MinimumCostArboresence,
	title = {{Optimum Branchings}},
	year = {1966},
	month = nov,
	journal = {{Journal of Research of the National Bureau of Standards}},
}

@article{Chu1965,
	author = {Chu, Y. and T. H. Liu},
	title = {{On the shortest arborescence of a directed graph}},
	journal = {Science Sinica},
	volume = {14},
	pages = {1396--1400},
	year = {1965},
	url = {https://cir.nii.ac.jp/crid/1573105976162423040}
}

@misc{TreeHash,
	title = {{An easy-to-write tree hash that won't collide easy - peehs-moorhsum's blog}},
	year = {2023},
	month = mar,
	note = {[Online; accessed 20. Mar. 2023]},
	url = {https://peehs-moorhsum.blog.uoj.ac/blog/7891}
}

@article{Italiano1988May,
	author = {Italiano, Giuseppe F.},
	title = {{Finding paths and deleting edges in directed acyclic graphs}},
	journal = {Inf. Process. Lett.},
	volume = {28},
	number = {1},
	pages = {5--11},
	year = {1988},
	month = may,
	issn = {0020-0190},
	publisher = {Elsevier},
	doi = {10.1016/0020-0190(88)90136-6}
}

@article{TarjanLengauer1979Jan,
	author = {Lengauer, Thomas and Tarjan, Robert Endre},
	title = {{A fast algorithm for finding dominators in a flowgraph}},
	journal = {ACM Trans. Program. Lang. Syst.},
	volume = {1},
	number = {1},
	pages = {121--141},
	year = {1979},
	month = jan,
	issn = {0164-0925},
	publisher = {Association for Computing Machinery},
	doi = {10.1145/357062.357071}
}

@incollection{Bjorklund,
	author = {Bjorklund, Andreas and Husfeldt, Thore},
	title = {{Inclusion--Exclusion Algorithms for Counting Set Partitions}},
	booktitle = {{2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)}},
	pages = {21--24},
	isbn = {978-0-7695-2720},
	publisher = {IEEE},
	doi = {10.1109/FOCS.2006.41}
}

@misc{Eppstein,
	year = {1998},
	month = sep,
	note = {[Online; accessed 1. Oct. 2023]},
	url = {https://ics.uci.edu/~eppstein/pubs/Epp-SJC-98.pdf}
}