The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Samuel Fiorini: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Jean Cardinal, Samuel Fiorini, Gwenaël Joret
    Tight Results on Minimum Entropy Set Cover. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:61-69 [Conf]
  2. Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta
    Approximate Min-max Relations for Odd Cycles in Planar Graphs. [Citation Graph (0, 0)][DBLP]
    IPCO, 2005, pp:35-50 [Conf]
  3. Jean Cardinal, Samuel Fiorini, Gwenaël Joret
    Minimum Entropy Coloring. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:819-828 [Conf]
  4. Samuel Fiorini
    Determining the automorphism group of the linear ordering polytope. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:112, n:1-3, pp:121-128 [Journal]
  5. Samuel Fiorini, Peter C. Fishburn
    Facets of linear signed order polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:3, pp:597-610 [Journal]
  6. José R. Correa, Samuel Fiorini, Nicolás E. Stier Moses
    A note on the precedence-constrained class sequencing problem. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:3, pp:257-259 [Journal]
  7. Samuel Fiorini, Peter C. Fishburn
    Weak order polytopes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:275, n:1-3, pp:111-127 [Journal]
  8. Samuel Fiorini
    A combinatorial study of partial order polytopes. [Citation Graph (0, 0)][DBLP]
    Eur. J. Comb., 2003, v:24, n:2, pp:149-159 [Journal]
  9. Jean-Paul Doignon, Samuel Fiorini
    The facets and the symmetries of the approval-voting polytope. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2004, v:92, n:1, pp:1-12 [Journal]
  10. Samuel Fiorini, Nadia Hardy, Bruce A. Reed, Adrian Vetta
    Approximate min-max relations for odd cycles in planar graphs. [Citation Graph (0, 0)][DBLP]
    Math. Program., 2007, v:110, n:1, pp:71-91 [Journal]
  11. Julie Christophe, Jean-Paul Doignon, Samuel Fiorini
    The Biorder Polytope. [Citation Graph (0, 0)][DBLP]
    Order, 2004, v:21, n:1, pp:61-82 [Journal]
  12. Samuel Fiorini, Peter C. Fishburn
    Extendability of Cyclic Orders. [Citation Graph (0, 0)][DBLP]
    Order, 2003, v:20, n:2, pp:151-171 [Journal]
  13. Jean-Paul Doignon, Samuel Fiorini
    Facets of the Weak Order Polytope Derived from the Induced Partition Projection. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2001, v:15, n:1, pp:112-121 [Journal]
  14. Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
    The Stackelberg Minimum Spanning Tree Game. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:64-76 [Conf]
  15. Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann
    The Stackelberg Minimum Spanning Tree Game [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  16. Minimum Entropy Combinatorial Optimization Problems. [Citation Graph (, )][DBLP]


  17. Hitting Diamonds and Growing Cacti. [Citation Graph (, )][DBLP]


  18. An efficient algorithm for partial order production. [Citation Graph (, )][DBLP]


  19. Sorting under partial information (without the ellipsoid algorithm). [Citation Graph (, )][DBLP]


  20. The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs. [Citation Graph (, )][DBLP]


  21. Constrained Decompositions of Integer Matrices and their Applications to Intensity Modulated Radiation Therapy. [Citation Graph (, )][DBLP]


  22. Tight Results on Minimum Entropy Set Cover. [Citation Graph (, )][DBLP]


  23. Minimum Entropy Orientations [Citation Graph (, )][DBLP]


  24. An Efficient Algorithm for Partial Order Production [Citation Graph (, )][DBLP]


  25. A closest vector problem arising in radiation therapy planning [Citation Graph (, )][DBLP]


  26. The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs [Citation Graph (, )][DBLP]


  27. Sorting under Partial Information (without the Ellipsoid Algorithm) [Citation Graph (, )][DBLP]


  28. Hitting Diamonds and Growing Cacti [Citation Graph (, )][DBLP]


  29. Minimum Entropy Combinatorial Optimization Problems [Citation Graph (, )][DBLP]


  30. Planar graph bipartization in linear time. [Citation Graph (, )][DBLP]


  31. On a theorem of Sewell and Trotter. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.004secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002