% This file was created with JabRef 2.10.
% Encoding: Cp1252

@article{devine,
  title={Note—A Model for Minimizing the Cost of Drilling Dual Completion Oil Wells},
  author={Devine, Michael D},
  journal={Management Science},
  volume={20},
  number={4-part-i},
  pages={532--535},
  year={1973},
  publisher={INFORMS}
}
@article{ford1956maxflow,
  title={Maximal flow through a network},
  author={Ford, Lester R and Fulkerson, Delbert R},
  journal={Canadian journal of Mathematics},
  volume={8},
  number={3},
  pages={399--404},
  year={1956}
}

@article{fujii1969optimal,
  title={Optimal sequencing of two equivalent processors},
  author={Fujii, M and Kasami, T and Ninomiya, K},
  journal={SIAM Journal on Applied Mathematics},
  volume={17},
  number={4},
  pages={784--789},
  year={1969},
  publisher={SIAM}
}

@inproceedings{iri1980determination,
  title={The determination of the pen movement of an XY-plotter and its computational complexity},
  author={Iri, M and Taguchi, A},
  booktitle={Proc. Spring Conference of th: Operations Research Society of Japan},
  volume={8},
  pages={204--205},
  year={1980}
}

@article{iri1983heuristics,
  title={Heuristics for planar minimum-weight perfect metchings},
  author={Iri, Masao and Murota, Kazuo and Matsui, Shouichi},
  journal={Networks},
  volume={13},
  number={1},
  pages={67--92},
  year={1983},
  publisher={Wiley Online Library}
}

@inproceedings{mucha,
  title={Maximum matchings via Gaussian elimination},
  author={Mucha, Marcin and Sankowski, Piotr},
  booktitle={Foundations of Computer Science, 2004. Proceedings. 45th Annual IEEE Symposium on},
  pages={248--255},
  year={2004},
  organization={IEEE}
}



@article{miller,
  title={Finding small simple cycle separators for 2-connected planar graphs},
  author={Miller, Gary L},
  journal={Journal of Computer and System Sciences},
  volume={32},
  number={3},
  pages={265--279},
  year={1986},
  publisher={Elsevier}
}


@article{gerards,
  title={Matching},
  author={Gerards, AMH},
  journal={Handbooks in operations research and management science},
  volume={7},
  pages={135--224},
  year={1995},
  publisher={Elsevier}
}

@article{fred,
  title                    = {Fast algorithms for shortest paths in planar graphs, with applications},
  author                   = {Federickson, Greg N},
  journal                  = {SIAM Journal on Computing},
  volume                   = {16},
  number                   = {6},
  pages                    = {1004--1022},
  year                     = {1987},
  publisher                = {SIAM}
}

@inproceedings{edmondsjohnson,
  title={Matching: A well-solved class of integer linear programs},
  author={Edmonds, Jack and Johnson, Ellis L},
  booktitle={in: Combinatorial structures and their applications (Gordon and Breach},
  year={1970},
  organization={Citeseer}
}

@article{cunningham,
  title={A primal algorithm for optimum matching},
  author={Cunningham, William H and Marsh, AB},
  journal={Polyhedral Combinatorics},
  pages={50--72},
  year={1978},
  publisher={Springer}
}

@inproceedings{kms,
  title={Structured recursive separator decompositions for planar graphs in linear time},
  author={Klein, Philip N and Mozes, Shay and Sommer, Christian},
  booktitle={Proceedings of the forty-fifth annual ACM symposium on Theory of computing},
  pages={505--514},
  year={2013},
  organization={ACM}
}

@article{berge,
  title={Two theorems in graph theory},
  author={Berge, Claude},
  journal={Proceedings of the National Academy of Sciences},
  volume={43},
  number={9},
  pages={842--844},
  year={1957},
  publisher={National Acad Sciences}
}

@article{kuhn,
  title={Variants of the Hungarian method for assignment problems},
  author={Kuhn, Harold W},
  journal={Naval Research Logistics Quarterly},
  volume={3},
  number={4},
  pages={253--258},
  year={1956},
  publisher={Wiley Online Library}
}

@book{ford,
  title={Flows in networks},
  author={Ford Jr, Lester Randolph and Fulkerson, Delbert Ray},
  year={2015},
  publisher={Princeton university press}
}

@article{edmonds,
  title={Theoretical improvements in algorithmic efficiency for network flow problems},
  author={Edmonds, Jack and Karp, Richard M},
  journal={Journal of the ACM (JACM)},
  volume={19},
  number={2},
  pages={248--264},
  year={1972},
  publisher={ACM}
}

@inproceedings{hopcroft,
  title={A $n^{5/2}$ algorithm for maximum matchings in bipartite graphs},
  author={Hopcroft, John E and Karp, Richard M},
  booktitle={Switching and Automata Theory, 1971., 12th Annual Symposium on},
  pages={122--125},
  year={1971},
  organization={IEEE}
}

@article{vazirani2012,
  title={A Simplification of the MV Matching Algorithm and its Proof},
  author={Vazirani, Vijay V},
  journal={arXiv preprint arXiv:1210.4594},
  year={2012}
}
@article{mozes,
  title={Optimization Algorithms for Planar Graphs},
  author={P.N. Klein and S. Mozes},
  journal={http://planarity.org/},
  year={2014}
}

@article{thorup,
  title={Compact oracles for reachability and approximate distances in planar digraphs},
  author={Thorup, Mikkel},
  journal={Journal of the ACM (JACM)},
  volume={51},
  number={6},
  pages={993--1024},
  year={2004},
  publisher={ACM}
}

@inproceedings{klein2005,
  title={Multiple-source shortest paths in planar graphs},
  author={Klein, Philip N},
  booktitle={SODA},
  volume={5},
  pages={146--155},
  year={2005}
}
@article{muchaplanar,
  title={Maximum matchings in planar graphs via Gaussian elimination},
  author={Mucha, Marcin and Sankowski, Piotr},
  journal={Algorithmica},
  volume={45},
  number={1},
  pages={3--20},
  year={2006},
  publisher={Springer}
}

@article{lipton,
  title={A separator theorem for planar graphs},
  author={Lipton, Richard J and Tarjan, Robert Endre},
  journal={SIAM Journal on Applied Mathematics},
  volume={36},
  number={2},
  pages={177--189},
  year={1979},
  publisher={SIAM}
}

@article{liptonapp,
  title={Applications of a planar separator theorem},
  author={Lipton, Richard J and Tarjan, Robert Endre},
  journal={SIAM journal on computing},
  volume={9},
  number={3},
  pages={615--627},
  year={1980},
  publisher={SIAM}
}

@inproceedings{klein1994,
  title={Faster shortest-path algorithms for planar graphs},
  author={Klein, Philip and Rao, Satish and Rauch, Monika and Subramanian, Sairam},
  booktitle={Proceedings of the twenty-sixth annual ACM symposium on Theory of computing},
  pages={27--37},
  year={1994},
  organization={ACM}
}

@inproceedings{borradaile,
  title={Multiple-source multiple-sink maximum flow in directed planar graphs in near-linear time},
  author={Borradaile, Glencora and Klein, Philip N and Mozes, Shay and Nussbaum, Yahav and Wulff-Nilsen, Christian},
  booktitle={Foundations of Computer Science (FOCS), 2011 IEEE 52nd Annual Symposium on},
  pages={170--179},
  year={2011},
  organization={IEEE}
}

@inproceedings{kleintree,
  title={Structured recursive separator decompositions for planar graphs in linear time},
  author={Klein, Philip N and Mozes, Shay and Sommer, Christian},
  booktitle={Proceedings of the forty-fifth annual ACM symposium on Theory of computing},
  pages={505--514},
  year={2013},
  organization={ACM}
}

@article{federickson,
  title={Fast algorithms for shortest paths in planar graphs, with applications},
  author={Federickson, Greg N},
  journal={SIAM Journal on Computing},
  volume={16},
  number={6},
  pages={1004--1022},
  year={1987},
  publisher={SIAM}
}

@article{frao,
  title={Planar graphs, negative weight edges, shortest paths, and near linear time},
  author={Fakcharoenphol, Jittat and Rao, Satish},
  journal={Journal of Computer and System Sciences},
  volume={72},
  number={5},
  pages={868--889},
  year={2006},
  publisher={Elsevier}
}



@article{blum1990,
  title={A new approach to maximum matching in general graphs},
  author={Blum, Norbert},
  journal={Automata, Languages and Programming},
  pages={586--597},
  year={1990},
  publisher={Springer}
}

@article{blum2015,
  title={Maximum Matching in General Graphs Without Explicit Consideration of Blossoms Revisited},
  author={Blum, Norbert},
  journal={arXiv preprint arXiv:1509.04927},
  year={2015}
}

@inproceedings{micali1980,
  title={An $O(\sqrt{V}E)$ Algorithm for finding maximum matching in general graphs},
  author={Micali, Silvio and Vazirani, Vijay V},
  booktitle={Foundations of Computer Science, 1980., 21st Annual Symposium on},
  pages={17--27},
  year={1980},
  organization={IEEE}
}

@inproceedings{kaplan2012submatrix,
  title={Submatrix maximum queries in Monge matrices and Monge partial matrices, and their applications},
  author={Kaplan, Haim and Mozes, Shay and Nussbaum, Yahav and Sharir, Micha},
  booktitle={Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms},
  pages={338--355},
  year={2012},
  organization={SIAM}
}