OREGON STATE UNIVERSITY

You are here

Biblio

Found 18 results
Filters: Author is Borradaile, Glencora  [Clear All Filters]
In Press
Borradaile, G., J. Iglesias, T. Migler, A. Ochoa, G. T. Wilfong, and L. Zhang, "Egalitarian Graph Orientations", CoRR, vol. abs/1212.2178, In Press.
2012
Azimi, J., A. Fern, X. Z. Fern, G. Borradaile, and B. Heeringa, "Batch Active Learning via Coordinated Matching", International Conference on Machine Learning (ICML), Edinburgh, Scotland, 07/2012.
Borradaile, G., S. Pettie, and C. Wulff-Nilsen, "Connectivity Oracles for Planar Graphs", Scandinavian Symposium and Workshops on Algorithm Theory (SWAT), vol. abs/1204.4159, Helsinki, Finland, 07/2012.
Borradaile, G., B. Heeringa, and G. Wilfong, "The knapsack problem with neighbour constraints", Journal of Discrete Algorithms, vol. 16, pp. 224 - 235, 10/2012.
Borradaile, G., and D. Eppstein, "Near-Linear-Time Deterministic Plane Steiner Spanners and TSP Approximation for Well-Spaced Point Sets", CoRR, vol. abs/1206.2254, Charlottetown, Prince Edward Island, Canada, 08/2012.
Harutyunyan, A., G. Borradaile, C. Chambers, and C. Scaffidi, "Planted-model evaluation of algorithms for identifying differences between spreadsheets", 2012 IEEE Symposium on Visual Languages and Human-Centric Computing (VL/HCC), Innsbruck, Austria, IEEE, pp. 7 - 14, 10/2012.
Borradaile, G., E. D. Demaine, and S. Tazari, "Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs", Algorithmica, 06/2012.
2011
Borradaile, G., P. N. Klein, S. Mozes, Y. Nussbaum, and C. Wulff-Nilsen, "Multiple-Source Multiple-Sink Maximum Flow in Directed Planar Graphs in Near-Linear Time", 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science (FOCS), Palm Springs, CA, IEEE, pp. 170 - 179, 10.2011.
2010
Borradaile, G., P. Sankowski, and C. Wulff-Nilsen, "Min st-Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time", CoRR, vol. abs/1003.1320, 2010.
Borradaile, G., J. R. Lee, and A. Sidiropoulos, "Randomly Removing G Handles at Once", Computational Geometry, vol. 43, issue 8, pp. 655 - 662, 10/2010.
2009
Borradaile, G., and P. N. Klein, "An O(n log n) Algorithm for Maximum St-Flow in a Directed Planar Graph", Journal of the ACM, vol. 56, issue 2, pp. 1 - 30, 04/2009.
Borradaile, G., P. N. Klein, and C. Mathieu, "A Polynomial-Time Approximation Scheme for Steiner Tree in Planar Graphs", ACM Transactions on Algorithms, vol. 5, issue 3, pp. 1 - 31, 07/2009.
Borradaile, G., E. D. Demaine, and S. Tazari, "Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs", 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009), vol. 3, Dagstuhl, Germany, Schloss Dagstuhl–Leibniz-Zentrum fuer Informatik, pp. 171–182, 02/2009.
2008
Borradaile, G., and P. N. Klein, Lecture Notes in Computer ScienceAutomata, Languages and ProgrammingThe Two-Edge Connectivity Survivable Network Problem in Planar Graphs, , vol. 5125, Berlin, Heidelberg, Springer Berlin Heidelberg, pp. 485 - 501, 2008.
Borradaile, G., P. N. Klein, and C. Mathieu, "A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest", 2008 IEEE 49th Annual IEEE Symposium on Foundations of Computer Science (FOCS), Philadelphia, PA, IEEE, pp. 115 - 124, 10/2008.
2005
Borradaile, G., and P. Van Hentenryck, "Safe and Tight Linear Estimators for Global Optimization", Mathematical Programming, vol. 102, issue 3, pp. 495 - 517, 01/2005.