Filtrer vos résultats
- 72
- 65
- 75
- 43
- 10
- 7
- 2
- 6
- 1
- 125
- 43
- 1
- 5
- 9
- 10
- 8
- 7
- 9
- 7
- 9
- 6
- 5
- 9
- 4
- 5
- 8
- 4
- 10
- 3
- 12
- 2
- 3
- 1
- 1
- 137
- 86
- 55
- 30
- 21
- 20
- 20
- 18
- 12
- 7
- 6
- 6
- 5
- 5
- 5
- 4
- 4
- 3
- 3
- 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
- 137
- 20
- 15
- 14
- 9
- 9
- 9
- 9
- 8
- 8
- 8
- 8
- 7
- 7
- 7
- 7
- 6
- 6
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 4
- 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
- 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
137 résultats
|
|
The Hoàng-Reed Conjecture holds for tournamentsDiscrete Mathematics, 2008, 308, pp.3412-3415. ⟨10.1016/j.disc.2007.06.033⟩
Article dans une revue
lirmm-00292710v1
|
||
|
|
Subdivisions in digraphs of large out-degree or large dichromatic number *[Research Report] INRIA Sophia Antipolis - I3S. 2016
Rapport
hal-01403921v1
|
||
Disjoint 3-Cycles in Tournaments: A Proof of The Bermond-Thomassen Conjecture for TournamentsJournal of Graph Theory, 2014, 75 (3), pp.284-302. ⟨10.1002/jgt.21740⟩
Article dans une revue
istex
lirmm-01282882v1
|
|||
Coloring dense digraphsThe European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB'17), Aug 2017, Vienna, Austria. pp.577-583
Communication dans un congrès
hal-01990330v1
|
|||
|
|
Twin-width II: small classesACM-SIAM Symposium on Discrete Algorithms (SODA21), Jan 2021, Alexandria, United States
Communication dans un congrès
hal-03107577v1
|
||
|
|
A Quadratic Kernel for Feedback Vertex SetSODA'09: Symposium on Discrete Algorithms, New York, United States. pp.115-119
Communication dans un congrès
lirmm-00394595v1
|
||
|
|
Degeneracy of P_t-free and C_{\>= t}-free graphs with no large complete bipartite subgraphsJournal of Combinatorial Theory, Series B, 2022, 152, pp.353-378. ⟨10.1016/j.jctb.2021.10.005⟩
Article dans une revue
hal-03829680v1
|
||
|
|
VC-dimension and Erdős–Pósa propertyDiscrete Mathematics, 2015, 338, pp.2302-2317. ⟨10.1016/j.disc.2015.05.026⟩
Article dans une revue
hal-01324090v1
|
||
|
|
Twin-width V: linear minors, modular counting, and matrix multiplicationSTACS 2023 ( Symposium on Theoretical Aspects of Computer Science ), Mar 2023, Hambourg, Germany. ⟨10.4230/LIPIcs.STACS.2023.15⟩
Communication dans un congrès
hal-04292966v1
|
||
|
|
Twin-width IV: ordered graphs and matricesSTOC 2022, Jun 2022, Rome, Italy
Communication dans un congrès
hal-03714452v1
|
||
|
|
Separation Choosability and Dense Bipartite Induced SubgraphsCombinatorics, Probability and Computing, 2019, 28 (5), pp.720-732. ⟨10.1017/S0963548319000026⟩
Article dans une revue
hal-02275202v1
|
||
Subquadratic Kernels for Implicit 3-Hitting Set and 3-Set Packing ProblemsACM Transactions on Algorithms, 2019, 15 (1), pp.1-44
Article dans une revue
hal-02055844v1
|
|||
|
|
Convexly independent subsets of Minkowski sums of convex polygonsDiscrete Mathematics, 2021, 344 (8), pp.112472. ⟨10.1016/j.disc.2021.112472⟩
Article dans une revue
hal-03457272v1
|
||
|
|
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
|
||
|
|
( #» P 6 , triangle)-free digraphs have bounded dichromatic number2023
Pré-publication, Document de travail
hal-03985871v1
|
||
Quasi-Polynomial Time Approximation Schemes for the Maximum Weight Independent Set Problem in \(\boldsymbol{H}\)-Free GraphsSIAM Journal on Computing, 2024, 53 (1), pp.47-86. ⟨10.1137/20M1333778⟩
Article dans une revue
hal-04531446v1
|
|||
|
|
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
|
||
|
|
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
|
||
|
|
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
|
||
|
|
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
|
||
|
|
Twin-width and polynomial kernelsIPEC 2021, Sep 2021, Lisbon, Portugal
Communication dans un congrès
hal-03430542v1
|
||
|
|
Twin-width VIII: delineation and win-wins2023
Pré-publication, Document de travail
hal-03956131v1
|
||
|
|
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
|
||
|
|
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
|
||
|
|
Sparse graphs with bounded induced cycle packing number have logarithmic treewidthJournal of Combinatorial Theory, Series B, 2024, 167, pp.215-249. ⟨10.1016/j.jctb.2024.03.003⟩
Article dans une revue
hal-04522701v1
|
||
|
|
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
|
||
|
|
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
|