@article{Aleksandrov2007,
    author = {Aleksandrov, Lyudmil and Djidjev, Hristo and Guo, Hua and Maheshwari, Anil}, 
    title = {Partitioning planar graphs with costs and weights}, 
    journal = {J. Exp. Algorithmics}, 
    issue_date = {2006}, 
    volume = {11}, 
    month = feb, 
    year = {2007}, 
    issn = {1084-6654}, 
    articleno = {1.5}, 
    url = {http://doi.acm.org/10.1145/1187436.1210588}, 
    doi = {10.1145/1187436.1210588}, 
    acmid = {1210588}, 
    publisher = {ACM}, 
    address = {New York, NY, USA}, 
    keywords = {Graph algorithms, graph partitioning algorithms, graph separators, implementation} 
} 

@inproceedings{Frederickson1991,
    author = {Frederickson, Greg N.},
    title = {Optimal Algorithms for Tree Partitioning},
    booktitle = {Proceedings of the Second Annual ACM-SIAM Symposium on Discrete Algorithms},
    series = {SODA '91},
    year = {1991},
    isbn = {0-89791-376-0},
    location = {San Francisco, California, USA},
    pages = {168--177},
    numpages = {10},
    url = {http://dl.acm.org/citation.cfm?id=127787.127822},
    acmid = {127822},
    publisher = {Society for Industrial and Applied Mathematics},
    address = {Philadelphia, PA, USA},
} 

@article{Frederickson1987,
    author    = {Greg N. Frederickson},
    title     = {Fast Algorithms for Shortest Paths in Planar Graphs, with Applications},
    journal   = {SIAM J. Comput.},
    volume    = {16},
    number    = {6},
    year      = {1987},
    pages     = {1004-1022},
    ee        = {http://dx.doi.org/10.1137/0216064},
    bibsource = {DBLP, http://dblp.uni-trier.de}
}

@article{Miller1997,
    author = {Miller, Gary L. and Teng, Shang-Hua and Thurston, William and Vavasis, Stephen A.},
    title = {Separators for Sphere-packings and Nearest Neighbor Graphs},
    journal = {J. ACM},
    issue_date = {Jan. 1997},
    volume = {44},
    number = {1},
    month = jan,
    year = {1997},
    issn = {0004-5411},
    pages = {1--29},
    numpages = {29},
    url = {http://doi.acm.org/10.1145/256292.256294},
    doi = {10.1145/256292.256294},
    acmid = {256294},
    publisher = {ACM},
    address = {New York, NY, USA},
    keywords = {centerpoint, computational geometry, graph algorithms, graph separators, partitioning, point location, probabilistic method, rndomized algorithm, sphere-preserving mapping},
} 

@article{Aleksandrov1996,
    author = {Aleksandrov, L. and Djidjev, H.},
    title = {Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus},
    journal = {SIAM J. Discret. Math.},
    issue_date = {Feb. 1996},
    volume = {9},
    number = {1},
    month = feb,
    year = {1996},
    issn = {0895-4801},
    pages = {129--150},
    numpages = {22},
    url = {http://dx.doi.org/10.1137/S0895480194272183},
    doi = {10.1137/S0895480194272183},
    acmid = {235785},
    publisher = {Society for Industrial and Applied Mathematics},
    address = {Philadelphia, PA, USA},
    keywords = {algorithm, divide-and-conquer, graph genus, graph separator, topological graph theory},
}