暂无分享,去创建一个
David R. Wood | Samuel Fiorini | Tony Huynh | Manuel Aprile | Gwenael Joret | Samuel Fiorini | T. Huynh | G. Joret | D. Wood | Manuel Aprile
[1] Shengyu Zhang,et al. Quantum strategic game theory , 2010, ITCS '12.
[2] Hristo Djidjev,et al. Linear Algorithms for Partitioning Embedded Graphs of Bounded Genus , 1996, SIAM J. Discret. Math..
[3] Manuel Aprile,et al. Extended formulations for matroid polytopes through randomized protocols , 2021, Oper. Res. Lett..
[4] R. Kipp Martin,et al. Using separation algorithms to generate mixed integer model reformulations , 1991, Oper. Res. Lett..
[5] Jack Edmonds,et al. Matroids and the greedy algorithm , 1971, Math. Program..
[6] Dirk Oliver Theis,et al. On the Combinatorial Lower Bound for the Extension Complexity of the Spanning Tree Polytope , 2018, Oper. Res. Lett..
[7] Justin C. Williams,et al. A linear‐size zero—one programming model for the minimum spanning tree problem in planar graphs , 2002, Networks.
[8] Michele Conforti,et al. Subgraph polytopes and independence polytopes of count matroids , 2015, Oper. Res. Lett..
[9] N. Alon,et al. A separator theorem for nonplanar graphs , 1990 .
[10] Sergey Norin,et al. Sublinear Separators in Intersection Graphs of Convex Shapes , 2021, SIAM J. Discret. Math..
[11] Thomas Rothvoß,et al. Some 0/1 polytopes need exponential size extended formulations , 2011, Math. Program..
[12] Gary L. Miller,et al. Separators for sphere-packings and nearest neighbor graphs , 1997, JACM.
[13] A. Thomason. An extremal function for contractions of graphs , 1984, Mathematical Proceedings of the Cambridge Philosophical Society.
[14] Alexandr V. Kostochka,et al. Lower bound of the hadwiger number of graphs by their average degree , 1984, Comb..
[15] Hans Raj Tiwary,et al. Extended formulations, nonnegative factorizations, and randomized communication protocols , 2011, Mathematical Programming.
[16] Austin Buchanan,et al. A note on "A linear-size zero-one programming model for the minimum spanning tree problem in planar graphs" , 2019, Networks.
[17] Hans Raj Tiwary,et al. Extension Complexity, MSO Logic, and Treewidth , 2015, SWAT.
[18] Samuel Fiorini,et al. Regular matroids have polynomial extension complexity , 2019, ArXiv.
[19] TarjanRobert Endre,et al. A separator theorem for graphs of bounded genus , 1984 .
[20] Pat Morin,et al. Layered separators in minor-closed graph classes with applications , 2013, J. Comb. Theory, Ser. B.
[21] Zdenek Dvorak,et al. Strongly Sublinear Separators and Polynomial Expansion , 2015, SIAM J. Discret. Math..
[22] B. Sturmfels,et al. Matroid polytopes, nested sets and Bergman fans , 2004, math/0411260.
[23] John R Gilbert,et al. A Separator Theorem for Graphs of Bounded Genus , 1984, J. Algorithms.
[24] Bruce A. Reed,et al. A linear-time algorithm to find a separator in a graph excluding a minor , 2009, TALG.
[25] James R. Lee,et al. Separators in region intersection graphs , 2016, ITCS.
[26] Yuri Faenza,et al. Extended formulations from communication protocols in output-efficient time , 2018, Mathematical Programming.
[27] Alexander Schrijver,et al. Combinatorial optimization. Polyhedra and efficiency. , 2003 .
[28] Samuel Fiorini,et al. Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs , 2017, Discret. Comput. Geom..
[29] Alfonso Cevallos,et al. On 2-Level Polytopes Arising in Combinatorial Settings , 2017, SIAM J. Discret. Math..
[30] Mihalis Yannakakis,et al. Expressing combinatorial optimization problems by linear programs , 1991, STOC '88.
[31] Bruce A. Reed,et al. A Separator Theorem in Minor-Closed Classes , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.
[32] David Eppstein,et al. Structure of Graphs with Locally Restricted Crossings , 2015, SIAM J. Discret. Math..
[33] James R. Lee,et al. Improved approximation algorithms for minimum-weight vertex separators , 2005, STOC '05.
[34] TengShang-Hua,et al. Separators for sphere-packings and nearest neighbor graphs , 1997 .