73 citations · 785 across the 86 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.CO2021★ 7 cited
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond
Manuel Aprile, Samuel Fiorini, Tony Huynh +2
Let be a connected -vertex graph in a proper minor-closed class . We prove that the extension complexity of the spanning tree polytope of is . Th…
math.CO2021★ 1 cited
Integer programs with bounded subdeterminants and two nonzeros per row
Samuel Fiorini, Gwenaël Joret, Stefan Weltge +1
We give a strongly polynomial-time algorithm for integer linear programs defined by integer coefficient matrices whose subdeterminants are bounded by a constant and that contain at…
math.CO2021★ 7 cited
Improved bounds for weak coloring numbers
Gwenaël Joret, Piotr Micek
Weak coloring numbers generalize the notion of degeneracy of a graph. They were introduced by Kierstead \& Yang in the context of games on graphs. Recently, several connections hav…