In Conferences
  1. Two-level Polytopes with a Prescribed Facet. Samuel Fiorini, Vissarion Fisikopoulos and Marco Macchia, ISCO 2016
  2. Improved Approximation Algorithms for Hitting 3-Vertex Paths. Samuel Fiorini, Gwenaël Joret and Oliver Schaudt, IPCO 2016
  3. No Small Linear Program Approximates Vertex Cover within a Factor 2 - epsilon, Abbas Bazzi, Samuel Fiorini, Sebastian Pokutta and Ola Svensson, FOCS 2015
  4. Enumeration of 2-Level Polytopes, Adam Bohn, Yuri Faenza, Samuel Fiorini, Vissarion Fisikopoulos, Marco Macchia and Kanstantsin Pashkovich, ESA 2015
  5. LP Approaches to Improved Approximation for Clique Transversal in Perfect Graphs, Samuel Fiorini, R. Krithika, N.S. Narayanaswamy and Venkatesh Raman, ESA 2014
  6. Average case polyhedral complexity of the maximum stable set problem, G?ábor Braun, Samuel Fiorini and Sebastian Pokutta, APPROX-RANDOM 2014
  7. Approximation Limits of Linear Programs (Beyond Hierarchies). Gábor Braun, Samuel Fiorini, Sebastian Pokutta and David Steurer. 53rd Annual IEEE Symposium on Foundations of Computer Science (FOCS 2012), New Brunswick (NJ), USA, 20-23 October 2012
  8. Linear vs. Semidefinite Extended Formulations: Exponential Separation and Strong Lower Bounds. Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary and Ronald de Wolf. 44th ACM Symposium on Theory of Computing (STOC 2012), New-York (NY), USA, 19-22 May 2012. Best Paper Award
  9. Extended Formulations, Non-negative Factorizations and Randomized Communication Protocols. Yuri Faenza, Samuel Fiorini, Roland Grappe and Hans Raj Tiwary. 2nd International Symposium on Combinatorial Optimization (ISCO 2012), Athens, Greece, April 17-21 2012
  10. Optimal Algorithms For Segment Minimization With Small Maximal Value. Therese Biedl, Stephane Durocher, Samuel Fiorini, Céline Engelbeen and Maxwell Young. Algorithms and Data Structures Symposium (WADS 2011), Polytechnic Institute of New York University, Brooklyn (NY), USA, 15-17 August 2011
  11. Hitting Diamonds and Growing Cacti. Samuel Fiorini, Gwenaël Joret and Ugo Pietropaoli. 14th conference on Integer Programming and Combinatorial Optimization (IPCO 2010), Lausanne, Switzerland, 9-11 June 2010
  12. Sorting under Partial Information (without the Ellipsoid Algorithm). Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël Jungers and Ian Munro. 42nd ACM Symposium on Theory of Computing (STOC 2010), Cambridge (MA), USA, 6-8 June 2010
  13. The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. Jean Cardinal, Erik Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman and Oren Weimann. 5th Workshop on Internet & Network Economics (WINE'09), Rome, Italy, 14-18 December 2009
  14. A closest vector problem arising in radiation therapy planning. Cëline Engelbeen, Samuel Fiorini and Antje Kiesel. Japan Conference on Computational Geometry and Graphs, Kanazawa, Japan, 11-13 November 2009
  15. Minimum Entropy Combinatorial Optimization Problems. Jean Cardinal, Samuel Fiorini and Gwenaël Joret. Computability in Europe 2009 (CiE 2009), Heidelberg, Germany, 19-24 July 2009
  16. An efficient algorithm for partial order production. Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël Jungers and Ian Munro. 41st ACM Symposium on Theory of Computing (STOC 2009), Bethesda (MD), USA, 31 May--2 June 2009
  17. The Stackelberg Minimum Spanning Tree Game. Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman and Oren Weimann. 10th Workshop on Algorithms and Data Structures (WADS 2007), Halifax (Nova Scotia), Canada, 15-17 August 2007
  18. Tight results on minimum entropy set cover. Jean Cardinal, Samuel Fiorini and Gwenaël Joret. 9th Intl. Workshop on Approximation Algorithms for Combinatorial Optimization Problems (APPROX 2006) - 10th Intl. Workshop on Randomization and Computation (RANDOM 2006), Barcelona, Spain, 28-30 August 2006
  19. Minimum Entropy Coloring. Jean Cardinal, Samuel Fiorini and Gwenaël Joret. Int. Symposium on Algorithms and Computation (ISAAC 2005), Sanya (Hainan), China, 19-21 December 2005
  20. Approximate min-max relations for odd cycles in planar graphs. Samuel Fiorini, Nadia Hardy, Bruce Reed and Adrian Vetta. 11th conference on Integer Programming and Combinatorial Optimization (IPCO 2005), Berlin, Germany, 8-10 June 2005
  21. Planar graph bipartization in linear time. Samuel Fiorini, Nadia Hardy, Bruce Reed and Adrian Vetta. Graphs, Algorithm, Combinatorics (GRACO 2005), Angra dos Reis (Rio de Janeiro), Brazil, 27-29 April 2005
  22. On minimum entropy graph colorings. Jean Cardinal, Samuel Fiorini and Gilles Van Assche. the IEEE International Symposium on Information Theory (ISIT 2004), Chicago (IL), USA, 27 June-2 July 2004

[Top]

In Journals
  1. Cut-dominant and forbidden minors. Michele Conforti, Samuel Fiorini and Kanstantsin Pashkovich, SIAM Journal on Discrete Mathematics, conditionally accepted for publication
  2. Average case polyhedral complexity of the maximum stable set problem. Gábor Braun, Samuel Fiorini and Sebastian Pokutta, Mathematical Programming Series B, to appear
  3. Generalised probabilistic theories and conic extensions of polytopes. Samuel Fiorini, Serge Massar, Manas K. Patra and Hans Raj Tiwary, Journal of Physics A: Mathematical and Theoretical, to appear
  4. Poset entropy versus number of linear extensions: the width-2 case. Samuel Fiorini and Selim Rexhep, ORDER 33, pages 1-21, 2016
  5. Approximation Limits of Linear Programs (Beyond Hierarchies). Gábor Braun, Samuel Fiorini, Sebastian Pokutta and David Steurer, Mathematics of Operations Research 40, pages 756-772, 2015
  6. Small extended formulations for cyclic polytopes. Yuri Bogomolov, Samuel Fiorini, Aleksandr Maksimenko and Kanstantsin Pashkovich, Discrete and Computational Geometry 53, pages 809-816, 2015
  7. Uncapacitated Flow-based Extended Formulations. Samuel Fiorini and Kanstantsin Pashkovich, Mathematical Programming Series B 153, pages 177-131, 2015
  8. Exponential Lower Bounds for Polytopes in Combinatorial Optimization. Samuel Fiorini, Serge Massar, Sebastian Pokutta, Hans Raj Tiwary and Ronald de Wolf, Journal of the ACM 62:17, 2015
  9. The Price of Connectivity for Vertex Cover: Perfect, Near-Perfect and Critical Graphs, Eglantine Camby, Jean Cardinal, Samuel Fiorini and Oliver Schaudt, Discrete Mathematics & Theoretical Computer Science, Vol. 16, pages 207-224, 2014
  10. Extended Formulations, Non-negative Factorizations and Randomized Communication Protocols. Yuri Faenza, Samuel Fiorini, Roland Grappe and Hans Raj Tiwary, Mathematical Programming Series B, to appear
  11. A tighter Erdös-Pósa function for long cycles. Samuel Fiorini and Audrey Herinckx. Journal of Graph Theory, to appear
  12. A note on the cops & robber game on graphs embedded in non-orientable surfaces. Nancy E. Clarke, Samuel Fiorini, Gwenaël Joret and Dirk Oliver Theis. Graphs and Combinatorics, Vol. 30, pages 119-124, 2014
  13. On Generalized Comparison-Based Sorting Problems, Jean Cardinal and Samuel Fiorini. Space-Efficient Data Structures, Streams, and Algorithms, LNCS Vol. 8066, pages 164-175, 2013
  14. Excluded forest minors and the Erdös-Pósa property. Samuel Fiorini, Gwenaël Joret and David Wood, Combinatorics, Probability and Computing, Vol. 22, pages 700-721, 2013
  15. Combinatorial bounds on nonnegative rank and extended Formulations. Samuel Fiorini, Volker Kaibel, Kanstantsin Pashkovich and Dirk Oliver Theis. Discrete Mathematics, Vol. 313, pages 67-83, 2013
  16. Optimal algorithms for segment minimization with small maximal value. Therese Biedl, Stephane Durocher, Samuel Fiorini, Cëline Engelbeen and Maxwell Young, Discrete Applied Mathematics, Vol. 161, pages 317-329, 2013
  17. Small minors in dense graphs. Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis and David Wood. European Journal of Combinatorics, Vol. 33, pages 1226-1245, 2012
  18. Extended formulations for polygons. Samuel Fiorini, Thomass Rothvoss and Hans Raj Tiwary, Discrete & Computational Geometry, Vol. 48, pages 658-668, 2012
  19. Approximating the balanced minimum evolution problem. Samuel Fiorini and Gwenaël Joret. Operations Research Letters, Vol. 40, pages 31-35, 2012
  20. Sorting under Partial Information (without the Ellipsoid Algorithm). Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël Jungers and Ian Munro. Combinatorica, Vol. 33, pages 655-697, 2013
  21. Minimum Entropy Combinatorial Optimization Problems. Jean Cardinal, Samuel Fiorini and Gwenaël Joret. Theory of Computing Systems, Vol. 51, pages 4-21, 2012
  22. The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. Jean Cardinal, Erik Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman and Oren Weimann. Journal of Combinatorial Optimization, Vol. 25, pages 19-46, 2013
  23. The polyhedron of all representations of a semiorder. Barry Balof, Jean-Paul Doignon and Samuel Fiorini. Order, Online First, September 6, 2011, DOI 10.1007/s11083-011-9229-x
  24. A closest vector problem arising in radiation therapy planning. Céline Engelbeen, Samuel Fiorini and Antje Kiesel. Journal of Combinatorial Optimization, Vol. 22, pages 609-629, 2011
  25. The VPN problem with concave costs. Samuel Fiorini, Gianpaolo Oriolo, Laura Sanità and Dirk Oliver Theis. SIAM Journal on Discrete Mathematics, Vol. 24, pages 1080-1090, 2010
  26. An efficient algorithm for partial order production. Jean Cardinal, Samuel Fiorini, Gwenaël Joret, Raphaël Junger and Ian Munro. SIAM Journal on Computing, Vol. 39, pages 2927-2940, 2010
  27. Constrained decompositions of integer matrices and their applications to intensity modulated radiation therapy. Céline Engelbeen and Samuel Fiorini. Networks, Vol. 55, pages 138-148, 2010
  28. The Stackelberg minimum spanning tree game. Jean Cardinal, Erik Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman and Oren Weimann, Algorithmica, Vol. 59, pages 129-144, 2011
  29. On the feedback vertex set polytope of a series-parallel graph. Samuel Fiorini and Odile Marcotte. Discrete Optimization, Vol. 6, pages 271-287, 2009
  30. Weighted graphs defining facets: a connection between stable set and linear ordering polytopes. Jean-Paul Doignon, Samuel Fiorini and Gwenaël Joret, Discrete Optimization, Vol. 6, pages 1-9, 2009
  31. Tight results on minimum entropy set cover. Jean Cardinal, Samuel Fiorini and Gwenaël Joret. Algorithmica, Vol. 51, pages 49-60, 2008
  32. On a theorem of Sewell and Trotter. Samuel Fiorini and Gwenaël Joret. European Journal of Combinatorics, Vol. 30, pages 680-683, 2008
  33. Minimum entropy coloring. Jean Cardinal, Samuel Fiorini and Gwenaël Joret. Journal of Combinatorial Optimization, Vol. 16, pages 361-377, 2008
  34. Minimum entropy orientations. Jean Cardinal, Samuel Fiorini and Gwenaël Joret. Operations Research Letters, Vol. 36, pages 680-683, 2008
  35. Planar graph bipartization in linear time. Samuel Fiorini, Nadia Hardy, Bruce Reed and Adrian Vetta. Discrete Applied Mathematics, Vol. 156, pages 1175-1180, 2008
  36. Approximate min-max relations for odd cycles in planar graphs. Samuel Fiorini, Nadia Hardy, Bruce Reed and Adrian Vetta. Mathematical Programming Series B, Vol. 110, pages 71-91, 2007
  37. {0,1/2}-cuts and the linear ordering problem: surfaces that define facets. Samuel Fiorini. SIAM Journal on Discrete Mathematics, Vol. 20/4, pages 893-912, 2006
  38. A note on the precedence-constrained class sequencing problem. José Correa, Samuel Fiorini and Nicolès Stier-Moses, Discrete Applied Mathematics, Vol. 155/3, pages 257-259, 2006
  39. Facets of the linear ordering polytope: a unification for the fence family through weighted graphs. Jean-Paul Doignon, Samuel Fiorini and Gwenaël Joret. Journal of Mathematical Psychology, Vol. 50/3, pages 251-262, 2006
  40. How to recycle your facets. Samuel Fiorini. Discrete Optimization, Vol. 3/2, pages 136-153, 2006
  41. The biorder polytope. Julie Christophe, Samuel Fiorini and Jean-Paul Doignon, Order, Vol. 21/1, pages 61-82, 2004
  42. The facets and the symmetries of the approval-voting polytope. Jean-Paul Doignon and Samuel Fiorini. Journal of Combinatorial Theory (Series B), Vol. 92/1, pages 1-12, 2004
  43. A short proof of a theorem of Falmagne, Journal of Mathematical Psychology, Vol. 48/1, pages 80-82, 2004
  44. Weak order polytopes. Samuel Fiorini and Peter Fishburn, Discrete Mathematics, Vol. 275/1-3, pages 111-127, 2004
  45. Extendability of cyclic orders. Samuel Fiorini and Peter Fishburn. Order, Vol. 20/2, pages 151-171, 2003
  46. Counting biorders. Julie Christophe, Samuel Fiorini and Jean-Paul Doignon. Journal of Integer Sequences, Vol. 6/4, article 03.4.3, 2003
  47. Facets of linear signed order polytopes, Samuel Fiorini and Peter Fishburn. Discrete Applied Mathematics, Vol. 131/3, pages 597-610, 2003
  48. The approval-voting polytope: combinatorial interpretation of the facets. Jean-Paul Doignon and Samuel Fiorini. Mathematiques et Sciences Humaines, Vol. 161, pages 29-39, 2003.
  49. A combinatorial study of partial order polytopes. European Journal of Combinatorics, Vol. 24/2, pages 149-159, 2003
  50. Facets of the weak order polytope derived from the induced partition projection. Jean-Paul Doignon and Samuel Fiorini. SIAM journal on Discrete Mathematics, Vol. 15/1, pages 112-121, 2002
  51. Determining the automorphism group of the linear ordering polytope. Samuel Fiorini. Discrete Applied Mathematics, Vol. 112/1-3, pages 121-128, 2001

[Top]

Other

[Top]