Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSamuel Fiorini
Person information
- affiliation: Université libre de Bruxelles, Department of Mathematics
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2023
[j68]Manuel Aprile
, Matthew Drescher, Samuel Fiorini, Tony Huynh:
A 7/3-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams. Discret. Appl. Math. 337: 149-160 (2023)- [j67]Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh:
A tight approximation algorithm for the cluster vertex deletion problem. Math. Program. 197(2): 1069-1091 (2023) - 2022
- [j66]Manuel Aprile, Samuel Fiorini:
Regular Matroids Have Polynomial Extension Complexity. Math. Oper. Res. 47(1): 540-559 (2022) - [j65]Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge:
Extended formulations for stable set polytopes of graphs without two disjoint odd cycles. Math. Program. 192(1): 547-566 (2022) - 2021
- [j64]Manuel Aprile, Samuel Fiorini, Tony Huynh, Gwenaël Joret, David R. Wood:
Smaller Extended Formulations for Spanning Tree Polytopes in Minor-closed Classes and Beyond. Electron. J. Comb. 28(4) (2021) - [j63]Samuel Fiorini, Marco Macchia, Kanstantsin Pashkovich:
Bounds on the Number of 2-Level Polytopes, Cones, and Configurations. Discret. Comput. Geom. 65(3): 587-600 (2021) - [j62]Samuel Fiorini, Tony Huynh, Gwenaël Joret, Carole Muller:
Unavoidable Minors for Graphs with Large ℓ p-Dimension. Discret. Comput. Geom. 66(1): 301-343 (2021) - [j61]Samuel Fiorini, Tony Huynh, Stefan Weltge:
Strengthening convex relaxations of 0/1-sets using Boolean formulas. Math. Program. 190(1): 467-482 (2021) - 2020
- [j60]Samuel Fiorini, Gwenaël Joret, Oliver Schaudt:
Improved approximation algorithms for hitting 3-vertex paths. Math. Program. 182(1): 355-367 (2020) - 2019
- [j59]Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson:
No Small Linear Program Approximates Vertex Cover Within a Factor 2 - ɛ. Math. Oper. Res. 44(1): 147-172 (2019) - [j58]Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich:
Enumeration of 2-level polytopes. Math. Program. Comput. 11(1): 173-210 (2019) - [j57]Pierre Aboulker, Samuel Fiorini, Tony Huynh, Marco Macchia, Johanna Seif:
Extension complexity of the correlation polytope. Oper. Res. Lett. 47(1): 47-51 (2019) - 2018
- [j56]Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman:
Approximability of Clique Transversal in Perfect Graphs. Algorithmica 80(8): 2221-2239 (2018) - [j55]Yohann Benchetrit, Samuel Fiorini, Tony Huynh, Stefan Weltge:
Characterizing Polytopes in the 0/1-Cube with Bounded Chvátal-Gomory Rank. Math. Oper. Res. 43(3): 718-725 (2018) - [j54]Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau:
A Tight Erdös-Pósa Function for Wheel Minors. SIAM J. Discret. Math. 32(3): 2302-2312 (2018) - [j53]Abbas Bazzi, Samuel Fiorini, Sangxia Huang, Ola Svensson:
Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits. Theory Comput. 14(1): 1-29 (2018) - 2017
- [j52]Samuel Fiorini, Tony Huynh, Gwenaël Joret, Kanstantsin Pashkovich:
Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-Genus Graphs. Discret. Comput. Geom. 57(3): 757-761 (2017) - [j51]Samuel Fiorini, Tony Huynh, Gwenaël Joret, Antonios Varvitsiotis:
The Excluded Minors for Isometric Realizability in the Plane. SIAM J. Discret. Math. 31(1): 438-453 (2017) - 2016
- [j50]Jean-Paul Doignon, Samuel Fiorini, Selim Rexhep:
The Linear Extension Polytope of a Poset. Electron. Notes Discret. Math. 55: 81-84 (2016) - [j49]Gábor Braun, Samuel Fiorini, Sebastian Pokutta:
Average case polyhedral complexity of the maximum stable set problem. Math. Program. 160(1-2): 407-431 (2016) - [j48]Samuel Fiorini, Selim Rexhep:
Poset Entropy Versus Number of Linear Extensions: The Width-2 Case. Order 33(1): 1-21 (2016) - [j47]Michele Conforti, Samuel Fiorini, Kanstantsin Pashkovich:
Cut Dominants and Forbidden Minors. SIAM J. Discret. Math. 30(3): 1571-1589 (2016) - 2015
- [j46]Yuri Bogomolov, Samuel Fiorini, Aleksandr N. Maksimenko, Kanstantsin Pashkovich:
Small Extended Formulations for Cyclic Polytopes. Discret. Comput. Geom. 53(4): 809-816 (2015) - [j45]Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf:
Exponential Lower Bounds for Polytopes in Combinatorial Optimization. J. ACM 62(2): 17:1-17:23 (2015) - [j44]Gábor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer:
Approximation Limits of Linear Programs (Beyond Hierarchies). Math. Oper. Res. 40(3): 756-772 (2015) - [j43]Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary:
Extended formulations, nonnegative factorizations, and randomized communication protocols. Math. Program. 153(1): 75-94 (2015) - [j42]Samuel Fiorini, Kanstantsin Pashkovich:
Uncapacitated flow-based extended formulations. Math. Program. 153(1): 117-131 (2015) - 2014
- [j41]Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt:
The Price of Connectivity for Vertex Cover. Discret. Math. Theor. Comput. Sci. 16(1): 207-224 (2014) - [j40]Nancy E. Clarke, Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis:
A Note on the Cops and Robber Game on Graphs Embedded in Non-Orientable Surfaces. Graphs Comb. 30(1): 119-124 (2014) - [j39]Samuel Fiorini, Audrey Herinckx:
A Tighter Erdős-Pósa Function for Long Cycles. J. Graph Theory 77(2): 111-116 (2014) - 2013
- [j38]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
Sorting under partial information (without the ellipsoid algorithm). Comb. 33(6): 655-697 (2013) - [j37]Samuel Fiorini, Gwenaël Joret, David R. Wood:
Excluded Forest Minors and the Erdős-Pósa Property. Comb. Probab. Comput. 22(5): 700-721 (2013) - [j36]Therese Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, Maxwell Young:
Faster optimal algorithms for segment minimization with small maximal value. Discret. Appl. Math. 161(3): 317-329 (2013) - [j35]Samuel Fiorini, Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis:
Combinatorial bounds on nonnegative rank and extended formulations. Discret. Math. 313(1): 67-83 (2013) - [j34]Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann:
The Stackelberg minimum spanning tree game on planar and bounded-treewidth graphs. J. Comb. Optim. 25(1): 19-46 (2013) - [j33]Barry Balof, Jean-Paul Doignon, Samuel Fiorini:
The Representation Polyhedron of a Semiorder. Order 30(1): 103-135 (2013) - 2012
- [j32]Samuel Fiorini, Thomas Rothvoß, Hans Raj Tiwary:
Extended Formulations for Polygons. Discret. Comput. Geom. 48(3): 658-668 (2012) - [j31]Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis, David R. Wood:
Small minors in dense graphs. Eur. J. Comb. 33(6): 1226-1245 (2012) - [j30]Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Minimum Entropy Combinatorial Optimization Problems. Theory Comput. Syst. 51(1): 4-21 (2012) - [j29]Samuel Fiorini, Gwenaël Joret:
Approximating the balanced minimum evolution problem. Oper. Res. Lett. 40(1): 31-35 (2012) - 2011
- [j28]Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann:
The Stackelberg Minimum Spanning Tree Game. Algorithmica 59(2): 129-144 (2011) - [j27]Céline Engelbeen, Samuel Fiorini, Antje Kiesel:
A closest vector problem arising in radiation therapy planning. J. Comb. Optim. 22(4): 609-629 (2011) - 2010
- [j26]Céline Engelbeen, Samuel Fiorini:
Constrained decompositions of integer matrices and their applications to intensity modulated radiation therapy. Networks 55(2): 138-148 (2010) - [j25]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
An Efficient Algorithm for Partial Order Production. SIAM J. Comput. 39(7): 2927-2940 (2010) - [j24]Samuel Fiorini, Gianpaolo Oriolo, Laura Sanità, Dirk Oliver Theis:
The VPN Problem with Concave Costs. SIAM J. Discret. Math. 24(3): 1080-1090 (2010) - 2009
- [j23]Jean-Paul Doignon, Samuel Fiorini, Gwenaël Joret:
Weighted graphs defining facets: A connection between stable set and linear ordering polytopes. Discret. Optim. 6(1): 1-9 (2009) - [j22]Samuel Fiorini, Odile Marcotte:
On the feedback vertex set polytope of a series-parallel graph. Discret. Optim. 6(3): 271-287 (2009) - [j21]Samuel Fiorini, Gwenaël Joret:
On a theorem of Sewell and Trotter. Eur. J. Comb. 30(2): 425-428 (2009) - 2008
- [j20]Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Tight Results on Minimum Entropy Set Cover. Algorithmica 51(1): 49-60 (2008) - [j19]Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Planar graph bipartization in linear time. Discret. Appl. Math. 156(7): 1175-1180 (2008) - [j18]Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Minimum entropy coloring. J. Comb. Optim. 16(4): 361-377 (2008) - [j17]Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Minimum entropy orientations. Oper. Res. Lett. 36(6): 680-683 (2008) - 2007
- [j16]José R. Correa, Samuel Fiorini, Nicolás E. Stier Moses:
A note on the precedence-constrained class sequencing problem. Discret. Appl. Math. 155(3): 257-259 (2007) - [j15]Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Approximate min-max relations for odd cycles in planar graphs. Math. Program. 110(1): 71-91 (2007) - [j14]Samuel Fiorini:
K. Aardal, G. Nemhauser, R. Weismantel (Eds.), Handbooks in Operations Research and Management Science, Vol. 12, Discrete Optimization, Elsevier, Amsterdam, The Netherlands, 2006, ISBN: 0-444-51507-0, 607 pp., EUR 179, $197. Oper. Res. Lett. 35(6): 823-824 (2007) - 2006
- [j13]Samuel Fiorini:
How to recycle your facets. Discret. Optim. 3(2): 136-153 (2006) - [j12]Samuel Fiorini:
0, 1/2-Cuts and the Linear Ordering Problem: Surfaces That Define Facets. SIAM J. Discret. Math. 20(4): 893-912 (2006) - 2005
- [j11]Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Planar graph bipartization in linear time. Electron. Notes Discret. Math. 19: 265-271 (2005) - [j10]Jean-Paul Doignon, Samuel Fiorini, Gwenaël Joret:
On a weighted generalization of alpha-critical graphs. Electron. Notes Discret. Math. 22: 401-404 (2005) - 2004
- [j9]Samuel Fiorini, Peter C. Fishburn:
Weak order polytopes. Discret. Math. 275(1-3): 111-127 (2004) - [j8]Jean-Paul Doignon, Samuel Fiorini:
The facets and the symmetries of the approval-voting polytope. J. Comb. Theory, Ser. B 92(1): 1-12 (2004) - [j7]Julie Christophe, Jean-Paul Doignon, Samuel Fiorini:
The Biorder Polytope. Order 21(1): 61-82 (2004) - 2003
- [j6]Samuel Fiorini, Peter C. Fishburn:
Facets of linear signed order polytopes. Discret. Appl. Math. 131(3): 597-610 (2003) - [j5]Samuel Fiorini:
A combinatorial study of partial order polytopes. Eur. J. Comb. 24(2): 149-159 (2003) - [j4]Samuel Fiorini, Peter C. Fishburn:
Extendability of Cyclic Orders. Order 20(2): 151-171 (2003) - 2001
- [j3]Samuel Fiorini:
Determining the automorphism group of the linear ordering polytope. Discret. Appl. Math. 112(1-3): 121-128 (2001) - [j2]Jean-Paul Doignon, Samuel Fiorini:
Facets of the Weak Order Polytope Derived from the Induced Partition Projection. SIAM J. Discret. Math. 15(1): 112-121 (2001) - 1999
- [j1]Samuel Fiorini:
Polyhedral aspects of partial orders and comparability graphs. Electron. Notes Discret. Math. 2: 171 (1999)
Conference and Workshop Papers
- 2021
- [c31]Samuel Fiorini, Gwenaël Joret, Stefan Weltge, Yelena Yuditsky:
Integer programs with bounded subdeterminants and two nonzeros per row. FOCS 2021: 13-24 - [c30]Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh:
A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem. IPCO 2021: 340-353 - 2020
- [c29]Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge:
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles. IPCO 2020: 104-116 - [c28]Michele Conforti, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Stefan Weltge:
The stable set problem in graphs with bounded genus and bounded odd cycle packing number. SODA 2020: 2896-2915 - 2018
- [c27]Samuel Fiorini, Martin Groß, Jochen Könemann, Laura Sanità:
Approximating Weighted Tree Augmentation via Chvátal-Gomory Cuts. SODA 2018: 817-831 - 2017
- [c26]Abbas Bazzi, Samuel Fiorini, Sangxia Huang, Ola Svensson:
Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits. SODA 2017: 2326-2341 - [c25]Manuel Aprile, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia:
Extension Complexity of Stable Set Polytopes of Bipartite Graphs. WG 2017: 75-87 - 2016
- [c24]Samuel Fiorini, Gwenaël Joret, Oliver Schaudt:
Improved Approximation Algorithms for Hitting 3-Vertex Paths. IPCO 2016: 238-249 - [c23]Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia:
Two-Level Polytopes with a Prescribed Facet. ISCO 2016: 285-296 - 2015
- [c22]Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich:
Enumeration of 2-Level Polytopes. ESA 2015: 191-202 - [c21]Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson:
No Small Linear Program Approximates Vertex Cover within a Factor 2 - e. FOCS 2015: 1123-1142 - 2014
- [c20]Gábor Braun, Samuel Fiorini, Sebastian Pokutta:
Average Case Polyhedral Complexity of the Maximum Stable Set Problem. APPROX-RANDOM 2014: 515-530 - [c19]Jean-Paul Doignon, Samuel Fiorini, Selim Rexhep:
Facets of order polytopes. CoDIT 2014: 93-97 - [c18]Samuel Fiorini, R. Krithika, N. S. Narayanaswamy, Venkatesh Raman:
LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs. ESA 2014: 430-442 - 2013
- [c17]Jean Cardinal, Samuel Fiorini:
On Generalized Comparison-Based Sorting Problems. Space-Efficient Data Structures, Streams, and Algorithms 2013: 164-175 - 2012
- [c16]Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt:
The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs. CTW 2012: 56-59 - [c15]Gábor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer:
Approximation Limits of Linear Programs (Beyond Hierarchies). FOCS 2012: 480-489 - [c14]Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary:
Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols. ISCO 2012: 129-140 - [c13]Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf:
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds. STOC 2012: 95-106 - 2011
- [c12]Therese Biedl, Stephane Durocher, Céline Engelbeen, Samuel Fiorini, Maxwell Young:
Faster Optimal Algorithms for Segment Minimization with Small Maximal Value. WADS 2011: 86-97 - 2010
- [c11]Samuel Fiorini, Gwenaël Joret, Ugo Pietropaoli:
Hitting Diamonds and Growing Cacti. IPCO 2010: 191-204 - [c10]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
Sorting under partial information (without the ellipsoid algorithm). STOC 2010: 359-368 - 2009
- [c9]Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Minimum Entropy Combinatorial Optimization Problems. CiE 2009: 79-88 - [c8]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
An efficient algorithm for partial order production. STOC 2009: 93-100 - [c7]Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann:
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. WINE 2009: 125-136 - 2008
- [c6]Céline Engelbeen, Samuel Fiorini:
Constrained Decompositions of Integer Matrices and their Applications to Intensity Modulated Radiation Therapy. CTW 2008: 177-180 - 2007
- [c5]Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann:
The Stackelberg Minimum Spanning Tree Game. WADS 2007: 64-76 - 2006
- [c4]Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Tight Results on Minimum Entropy Set Cover. APPROX-RANDOM 2006: 61-69 - 2005
- [c3]Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta:
Approximate Min-max Relations for Odd Cycles in Planar Graphs. IPCO 2005: 35-50 - [c2]Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Minimum Entropy Coloring. ISAAC 2005: 819-828 - 2004
- [c1]Jean Cardinal, Samuel Fiorini, Gilles Van Assche:
On minimum entropy graph colorings. ISIT 2004: 43
Informal and Other Publications
- 2023
- [i47]Karthekeyan Chandrasekaran, Chandra Chekuri, Samuel Fiorini, Shubhang Kulkarni, Stefan Weltge:
Polyhedral Aspects of Feedback Vertex Set and Pseudoforest Deletion Set. CoRR abs/2303.12850 (2023) - [i46]Luca Ferrarini, Samuel Fiorini, Stefan Kober, Yelena Yuditsky:
Total Matching and Subdeterminants. CoRR abs/2312.17630 (2023) - 2021
- [i45]Samuel Fiorini, Gwenaël Joret, Stefan Weltge, Yelena Yuditsky:
Integer programs with bounded subdeterminants and two nonzeros per row. CoRR abs/2106.05947 (2021) - [i44]Manuel Aprile, Samuel Fiorini, Tony Huynh, Gwenaël Joret, David R. Wood:
Smaller extended formulations for spanning tree polytopes in minor-closed classes and beyond. CoRR abs/2106.11945 (2021) - [i43]Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia:
Slack matrices, k-products, and 2-level polytopes. CoRR abs/2106.12829 (2021) - 2020
- [i42]Manuel Aprile, Michele Conforti, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia:
Recognizing Cartesian products of matrices and polytopes. CoRR abs/2002.02264 (2020) - [i41]Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh:
A Tight Approximation Algorithm for the Cluster Vertex Deletion Problem. CoRR abs/2007.08057 (2020) - [i40]Manuel Aprile, Matthew Drescher, Samuel Fiorini, Tony Huynh:
A simple 7/3-approximation algorithm for feedback vertex set in tournaments. CoRR abs/2008.08779 (2020) - [i39]Matthew Drescher, Samuel Fiorini, Tony Huynh:
A simple (2+ε)-approximation algorithm for Split Vertex Deletion. CoRR abs/2009.11056 (2020) - 2019
- [i38]Samuel Fiorini, Tony Huynh, Gwenaël Joret, Carole Muller:
Unavoidable minors for graphs with large 𝓁p-dimension. CoRR abs/1904.02951 (2019) - [i37]Michele Conforti, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Stefan Weltge:
The stable set problem in graphs with bounded genus and bounded odd cycle packing number. CoRR abs/1908.06300 (2019) - [i36]Manuel Aprile, Samuel Fiorini:
Regular matroids have polynomial extension complexity. CoRR abs/1909.08539 (2019) - [i35]Michele Conforti, Samuel Fiorini, Tony Huynh, Stefan Weltge:
Extended Formulations for Stable Set Polytopes of Graphs Without Two Disjoint Odd Cycles. CoRR abs/1911.12179 (2019) - 2018
- [i34]Pierre Aboulker, Samuel Fiorini, Tony Huynh, Marco Macchia, Johanna Seif:
Extension Complexity of the Correlation Polytope. CoRR abs/1806.00541 (2018) - [i33]Samuel Fiorini, Marco Macchia, Kanstantsin Pashkovich:
Bounds on the number of 2-level polytopes, cones and configurations. CoRR abs/1806.06011 (2018) - [i32]Samuel Fiorini, Gwenaël Joret, Oliver Schaudt:
Improved approximation algorithms for hitting 3-vertex paths. CoRR abs/1808.10370 (2018) - 2017
- [i31]Samuel Fiorini, Martin Groß, Jochen Könemann, Laura Sanità:
A 3/2-Approximation Algorithm for Tree Augmentation via Chvátal-Gomory Cuts. CoRR abs/1702.05567 (2017) - [i30]Manuel Aprile, Yuri Faenza, Samuel Fiorini, Tony Huynh, Marco Macchia:
Extension complexity of stable set polytopes of bipartite graphs. CoRR abs/1702.08741 (2017) - [i29]Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia, Kanstantsin Pashkovich:
Enumeration of 2-level polytopes. CoRR abs/1703.01943 (2017) - [i28]Pierre Aboulker, Samuel Fiorini, Tony Huynh, Gwenaël Joret, Jean-Florent Raymond, Ignasi Sau:
A tight Erdős-Pósa function for wheel minors. CoRR abs/1710.06282 (2017) - [i27]Samuel Fiorini, Tony Huynh, Stefan Weltge:
Strengthening Convex Relaxations of 0/1-Sets Using Boolean Formulas. CoRR abs/1711.01358 (2017) - 2016
- [i26]Samuel Fiorini, Tony Huynh, Gwenaël Joret, Kanstantsin Pashkovich:
Smaller Extended Formulations for the Spanning Tree Polytope of Bounded-genus Graphs. CoRR abs/1604.07976 (2016) - [i25]Abbas Bazzi, Samuel Fiorini, Sangxia Huang, Ola Svensson:
Small Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits. CoRR abs/1609.03737 (2016) - [i24]Yohann Benchetrit, Samuel Fiorini, Tony Huynh, Stefan Weltge:
Characterizing Polytopes Contained in the $0/1$-Cube with Bounded Chvátal-Gomory Rank. CoRR abs/1611.06593 (2016) - 2015
- [i23]Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta, Ola Svensson:
No Small Linear Program Approximates Vertex Cover within a Factor 2-ε. CoRR abs/1503.00753 (2015) - [i22]Samuel Fiorini, Tony Huynh, Gwenaël Joret, Antonios Varvitsiotis:
The excluded minors for isometric realizability in the plane. CoRR abs/1511.08054 (2015) - 2013
- [i21]Eglantine Camby, Jean Cardinal, Samuel Fiorini, Oliver Schaudt:
The Price of Connectivity for Vertex Cover. CoRR abs/1303.2478 (2013) - [i20]Samuel Fiorini, Kanstantsin Pashkovich:
Uncapacitated Flow-based Extended Formulations. CoRR abs/1306.3119 (2013) - [i19]Samuel Fiorini, Serge Massar, Manas K. Patra, Hans Raj Tiwary:
Generalised probabilistic theories and conic extensions of polytopes. CoRR abs/1310.4125 (2013) - [i18]Gábor Braun, Samuel Fiorini, Sebastian Pokutta:
Average case polyhedral complexity of the maximum stable set problem. CoRR abs/1311.4001 (2013) - 2012
- [i17]Gábor Braun, Samuel Fiorini, Sebastian Pokutta, David Steurer:
Approximation Limits of Linear Programs (Beyond Hierarchies). CoRR abs/1204.0957 (2012) - [i16]Samuel Fiorini, Gwenaël Joret, David R. Wood:
Excluded Forest Minors and the Erdős-Pósa Property. CoRR abs/1204.5192 (2012) - [i15]Samuel Fiorini, Audrey Herinckx:
A tighter Erdös-Pósa function for long cycles. CoRR abs/1205.0940 (2012) - 2011
- [i14]Samuel Fiorini, Gwenaël Joret:
Approximating the Balanced Minimum Evolution Problem. CoRR abs/1104.1080 (2011) - [i13]Yuri Faenza, Samuel Fiorini, Roland Grappe, Hans Raj Tiwary:
Extended formulations, non-negative factorizations and randomized communication protocols. CoRR abs/1105.4127 (2011) - [i12]Samuel Fiorini, Thomas Rothvoß, Hans Raj Tiwary:
Extended formulations for polygons. CoRR abs/1107.0371 (2011) - [i11]Samuel Fiorini, Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis:
Combinatorial Bounds on Nonnegative Rank and Extended Formulations. CoRR abs/1111.0444 (2011) - [i10]Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary, Ronald de Wolf:
Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds. CoRR abs/1111.0837 (2011) - 2010
- [i9]Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis, David R. Wood:
Small Minors in Dense Graphs. CoRR abs/1005.0895 (2010) - [i8]Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Minimum Entropy Combinatorial Optimization Problems. CoRR abs/1008.2928 (2010) - 2009
- [i7]Céline Engelbeen, Samuel Fiorini, Antje Kiesel:
A closest vector problem arising in radiation therapy planning. CoRR abs/0907.0138 (2009) - [i6]Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann:
The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. CoRR abs/0909.3221 (2009) - [i5]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
Sorting under Partial Information (without the Ellipsoid Algorithm). CoRR abs/0911.0086 (2009) - [i4]Samuel Fiorini, Gwenaël Joret, Ugo Pietropaoli:
Hitting Diamonds and Growing Cacti. CoRR abs/0911.4366 (2009) - 2008
- [i3]Jean Cardinal, Samuel Fiorini, Gwenaël Joret:
Minimum Entropy Orientations. CoRR abs/0802.1237 (2008) - [i2]Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël M. Jungers, J. Ian Munro:
An Efficient Algorithm for Partial Order Production. CoRR abs/0811.2572 (2008) - 2007
- [i1]Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann:
The Stackelberg Minimum Spanning Tree Game. CoRR abs/cs/0703019 (2007)
Coauthor Index
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 23:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
