The following pages link to Samuel Fiorini (Q210516):
Displayed 50 items.
- Average case polyhedral complexity of the maximum stable set problem (Q344955) (← links)
- A closest vector problem arising in radiation therapy planning (Q411241) (← links)
- Small minors in dense graphs (Q427808) (← links)
- Approximating the balanced minimum evolution problem (Q433835) (← links)
- The linear extension polytope of a poset (Q510939) (← links)
- Smaller extended formulations for the spanning tree polytope of bounded-genus graphs (Q527446) (← links)
- The Stackelberg minimum spanning tree game (Q627533) (← links)
- Minimum entropy combinatorial optimization problems (Q693045) (← links)
- Extended formulations for polygons (Q714985) (← links)
- Approximability of clique transversal in perfect graphs (Q724231) (← links)
- Extended formulations, nonnegative factorizations, and randomized communication protocols (Q745681) (← links)
- Uncapacitated flow-based extended formulations (Q745688) (← links)
- On the feedback vertex set polytope of a series-parallel graph (Q834183) (← links)
- A note on the precedence-constrained class sequencing problem (Q868379) (← links)
- Approximate min-max relations for odd cycles in planar graphs (Q877199) (← links)
- Tight results on minimum entropy set cover (Q926288) (← links)
- On a theorem of Sewell and Trotter (Q1003593) (← links)
- Weighted graphs defining facets: A connection between stable set and linear ordering polytopes (Q1013288) (← links)
- Minimum entropy coloring (Q1016051) (← links)
- Facets of linear signed order polytopes. (Q1414239) (← links)
- Weak order polytopes. (Q1420590) (← links)
- Extendability of cyclic orders (Q1425169) (← links)
- Extension complexity of stable set polytopes of bipartite graphs (Q1687905) (← links)
- Extended formulations for order polytopes through network flows (Q1736010) (← links)
- Enumeration of 2-level polytopes (Q1741129) (← links)
- Combinatorial bounds on nonnegative rank and extended formulations (Q1759811) (← links)
- The biorder polytope (Q1765958) (← links)
- A combinatorial study of partial order polytopes (Q1867280) (← links)
- The facets and the symmetries of the approval-voting polytope (Q1880786) (← links)
- Faster optimal algorithms for segment minimization with small maximal value (Q1932452) (← links)
- The representation polyhedron of a semiorder. (Q1943679) (← links)
- The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs (Q1945700) (← links)
- Unavoidable minors for graphs with large \(\ell_p\)-dimension (Q2039320) (← links)
- Recognizing Cartesian products of matrices and polytopes (Q2056923) (← links)
- Extended formulations for stable set polytopes of graphs without two disjoint odd cycles (Q2118145) (← links)
- Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond (Q2121739) (← links)
- Improved approximation algorithms for hitting 3-vertex paths (Q2191773) (← links)
- Strengthening convex relaxations of 0/1-sets using Boolean formulas (Q2235155) (← links)
- Extension complexity of the correlation polytope (Q2294265) (← links)
- Small extended formulations for cyclic polytopes (Q2351019) (← links)
- Sorting under partial information (without the ellipsoid algorithm). (Q2439837) (← links)
- A note on the cops and robber game on graphs embedded in non-orientable surfaces (Q2441345) (← links)
- Planar graph bipartization in linear time (Q2482113) (← links)
- Facets of the linear ordering polytope: a unification for the fence family through weighted graphs (Q2497757) (← links)
- How to recycle your facets (Q2506820) (← links)
- Minimum entropy orientations (Q2517793) (← links)
- Bounds on the number of 2-level polytopes, cones, and configurations (Q2664102) (← links)
- (Q2741302) (← links)
- Facets of the Weak Order Polytope Derived from the Induced Partition Projection (Q2784506) (← links)
- Exponential Lower Bounds for Polytopes in Combinatorial Optimization (Q2796404) (← links)