3532 articles – 5253 Notices  [english version]
.:. Consultation > Liste par discipline > Combinatoire .:.
16 documents classés par :
1 - 2 Page Suivante Page Finale
fulltext access Supersaturation in the Boolean lattice
Dove A. P., Griggs J. R., Kang R. J., Sereni J.-S.
[hal-00802000 - version 1]
fulltext access Transversals of Longest Paths and Cycles
Rautenbach D., Sereni J.-S.
[hal-00793271 - version 1]
fulltext access Subcubic triangle-free graphs have fractional chromatic number at most $14/5$
Dvořák Z., Sereni J.-S., Volec J.
[hal-00779634 - version 1]
fulltext accessible on an other server Simplifying inclusion-exclusion formulas
Goaoc X., Matoušek J., Paták P., Safernová Z., Tancer M.
(11/07/2012) [hal-00764182 - version 1]
fulltext access A new bound for the 2/3 conjecture
Král' D., Liu C.-H., Sereni J.-S., Whalen P., Yilma Z.
[hal-00686989 - version 2]
fulltext access Stratégies d'optimisation de la mémoire pour le calcul d'applications linéaires et l'indexation de document partagés
Ahmad M.
Université Henri Poincaré - Nancy I (14/11/2011), Adam Cichon (Dir.) [tel-00641866 - version 2]
fulltext accessible on an other server Helly numbers of acyclic families
de Verdière E. C., Ginot G., Goaoc X.
(24/02/2011) [hal-00646166 - version 1]
fulltext access On the complexity of cycle enumeration using Zeons
Schott R., Staples S.
(2010) [hal-00567889 - version 1]
Single machine scheduling with job ready and delivery times subject to resource constraints
Janiak W. A., Janiak A., Portmann M.-C.
Dans IEEE International Symposium on Parallel and Distributed Processing - IPDPS 2008 (2008) 1-7 [inria-00339824 - version 1]
fulltext access A window time negotiation approach at the scheduling level inside supply chains
Portmann M.-C., Mouloua Z.
Dans 3rd Multidisciplinary International Scheduling Conference: Theory and Applications - MISTA 2007 (2007) 410-417 [inria-00187505 - version 1]