Filtrer vos résultats
- 62
- 52
- 66
- 32
- 7
- 7
- 2
- 6
- 106
- 33
- 1
- 4
- 5
- 6
- 10
- 7
- 8
- 6
- 5
- 9
- 4
- 5
- 8
- 4
- 10
- 3
- 12
- 2
- 3
- 1
- 1
- 114
- 70
- 54
- 29
- 20
- 20
- 17
- 11
- 10
- 7
- 6
- 6
- 5
- 5
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 114
- 20
- 14
- 12
- 9
- 9
- 8
- 7
- 7
- 7
- 7
- 7
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
114 résultats
|
Finding a Vector Orthogonal to Roughly Half a Collection of VectorsJournal of Complexity, 2008, 24, pp.39-53. ⟨10.1016/j.jco.2006.09.005⟩
Article dans une revue
lirmm-00292703v1
|
||
|
Perfect graphs of arbitrarily large clique-chromatic numberJournal of Combinatorial Theory, Series B, 2016, 116, pp.456-464. ⟨10.1016/j.jctb.2015.09.008⟩
Article dans une revue
hal-01324052v1
|
||
|
Satisfying more than half of a system of linear equations over GF(2): A multivariate approachJournal of Computer and System Sciences, 2014, 80 (4), ⟨10.1016/j.jcss.2013.10.002⟩
Article dans une revue
hal-01347776v1
|
||
|
Kernels for Feedback Arc Set In TournamentsIARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Dec 2009, IIT Kanpur, India. pp.37-47, ⟨10.4230/LIPIcs.FSTTCS.2009.2305⟩
Communication dans un congrès
lirmm-00432668v1
|
||
|
Twin-width III: Max Independent Set, Min Dominating Set, and Coloring48th International Colloquium on Automata, Languages, and Programming (ICALP 2021), Jul 2021, Glasgow, United Kingdom. ⟨10.4230/LIPIcs.ICALP.2021.35⟩
Communication dans un congrès
hal-03107571v1
|
||
|
A proof of the Erdős–Sands–Sauer–Woodrow conjectureJournal of Combinatorial Theory, Series B, 2019, Elsevier Journal of Combinatorial Theory, Series B, 137, pp.316-319. ⟨10.1016/j.jctb.2018.11.005⟩
Article dans une revue
hal-02158330v2
|
||
|
A Proof of the Barát–Thomassen ConjectureJournal of Combinatorial Theory, Series B, 2017, 124, pp.39 - 55. ⟨10.1016/j.jctb.2016.12.006⟩
Article dans une revue
hal-01629943v1
|
||
|
Kernels for feedback arc set in tournamentsJournal of Computer and System Sciences, 2011, 77 (6), pp.1071-1078. ⟨10.1016/j.jcss.2010.10.001⟩
Article dans une revue
lirmm-00738221v1
|
||
|
Branchwidth of graphic matroids.2005
Pré-publication, Document de travail
hal-00012312v1
|
||
|
On Spanning Galaxies in DigraphsDiscrete Applied Mathematics, 2012, 160 (6), pp.744-754. ⟨10.1016/j.dam.2011.07.013⟩
Article dans une revue
hal-00749191v1
|
||
|
Total Domination of Graphs and Small Transversals of HypergraphsCombinatorica, 2007, 27, pp.473-487. ⟨10.1007/s00493-007-2020-3⟩
Article dans une revue
lirmm-00250084v1
|
||
|
The Domination Number of GridsSIAM Journal on Discrete Mathematics, 2011, 25, pp.1443-1453. ⟨10.1137/11082574⟩
Article dans une revue
lirmm-00569256v1
|
||
|
Hitting and Harvesting PumpkinsESA 2011 - 19th Annual European Symposium on Algorithms, Sep 2011, Saarbrücken, Germany. pp.394-407, ⟨10.1007/978-3-642-23719-5_34⟩
Communication dans un congrès
lirmm-00642341v1
|
||
Decomposing graphs into paths and treesThe European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'17), Aug 2017, Vienna, Austria. pp.751-757
Communication dans un congrès
hal-01990651v1
|
|||
|
Spanning a strong digraph by $\alpha$ circuits: A proof of Gallai's conjectureCombinatorica, 2007, 27 (6), pp.659-667. ⟨10.1007/s00493-007-2073-3⟩
Article dans une revue
lirmm-00256609v1
|
||
|
Realizing disjoint degree sequences of span at most two: A tractable discrete tomography problemDiscrete Applied Mathematics, 2011, 159, pp.23-30. ⟨10.1016/j.dam.2010.09.011⟩
Article dans une revue
lirmm-00806767v1
|
||
|
Clique versus Independent SetEuropean Journal of Combinatorics, 2014, 40, pp.73-92. ⟨10.1016/j.ejc.2014.02.003⟩
Article dans une revue
hal-00958647v1
|
||
|
WDM and Directed Star Arboricity[Research Report] RR-6179, INRIA. 2007, pp.20
Rapport
inria-00132396v3
|
||
|
Graphs with large chromatic number induce 3k-cycles2017
Pré-publication, Document de travail
hal-01431393v1
|
||
|
Convex cones and SAGBI bases of permutation invariantsInvariant theory in all characteristics, Apr 2002, Kingston, Ontario, Canada. pp.259--263
Communication dans un congrès
hal-00632279v1
|
||
|
Twin-width II: small classesCombinatorial Theory, 2022, ⟨10.5070/C62257876⟩
Article dans une revue
hal-03750978v1
|
||
|
On the complexity of partial derivatives2016
Pré-publication, Document de travail
ensl-01345746v2
|
||
|
Hoàng-Reed conjecture holds for tournaments[Research Report] RR-5976, INRIA. 2006, pp.7
Rapport
inria-00091366v2
|
||
|
Scott's Induced Subdivision Conjecture for Maximal Triangle-Free GraphsCombinatorics, Probability and Computing, 2012, 21, pp.512-514. ⟨10.1017/S0963548312000065⟩
Article dans une revue
lirmm-00741917v1
|
||
|
The Erdős-Hajnal Conjecture for Long Holes and Anti-holes2017
Pré-publication, Document de travail
hal-01431381v1
|
||
Multicut Is FPTSIAM Journal on Computing, 2018, 47 (1), pp.166-207. ⟨10.1137/140961808⟩
Article dans une revue
hal-01804120v1
|
|||
|
Partitions versus sets : a case of dualityEuropean Journal of Combinatorics, 2009, pp.1-7. ⟨10.1016/j.ejc.2009.09.004⟩
Article dans une revue
hal-00345894v3
|
||
|
Cyclic orderings and cyclic arboricity of matroidsJournal of Combinatorial Theory, Series B, 2012, 102, pp.638-646. ⟨10.1016/j.jctb.2011.08.004⟩
Article dans une revue
lirmm-00806762v1
|
||
Domination in tournamentsJournal of Combinatorial Theory, Series B, 2018, 130, pp.98-113
Article dans une revue
hal-01993403v1
|
|||
|
A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free GraphsAlgorithmica, 2017, 77 (3), pp.619 - 641. ⟨10.1007/s00453-015-0083-x⟩
Article dans une revue
hal-01482301v1
|