Filtrer vos résultats
- 63
- 35
- 1
- 58
- 23
- 12
- 3
- 2
- 1
- 9
- 2
- 90
- 20
- 1
- 1
- 2
- 7
- 1
- 1
- 1
- 4
- 8
- 4
- 5
- 5
- 11
- 5
- 8
- 6
- 5
- 8
- 8
- 5
- 2
- 2
- 1
- 98
- 1
- 99
- 48
- 45
- 37
- 7
- 5
- 5
- 4
- 4
- 3
- 3
- 3
- 3
- 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
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 28
- 25
- 17
- 15
- 13
- 10
- 9
- 8
- 7
- 6
- 6
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 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
99 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
|
||
|
Well-quasi-ordering $H$-contraction-free graphsDiscrete Applied Mathematics, 2018, 248, pp.18-27. ⟨10.1016/j.dam.2017.02.018⟩
Article dans une revue
lirmm-01486775v2
|
||
|
Enumerating the edge-colourings and total colourings of a regular graph[Research Report] RR-7652, INRIA. 2011
Rapport
inria-00602188v1
|
||
|
Quantifying trust dynamics in signed graphs, the S-Cores approachSDM 2014 - 14th SIAM International Conference on Data Mining, Aug 2014, Philadelphia, United States. pp.668-676, ⟨10.1137/1.9781611973440.77⟩
Communication dans un congrès
lirmm-01083529v1
|
||
|
Report on GRASTA 2014[Research Report] AlGCo project team, CNRS, LIRMM, Montpellier, France. 2014
Rapport
hal-01084230v1
|
||
|
On the (non-)existence of polynomial kernels for $P_l$-free edge modification problemsAlgorithmica, 2013, 65 (4), pp.900-926. ⟨10.1007/s00453-012-9619-5⟩
Article dans une revue
hal-00821612v1
|
||
|
PACE Solver Description: TouiouidthIPEC 2023 - 18th International Symposium on Parameterized and Exact Computation, Sep 2023, Amsterdam, Netherlands. pp.4, ⟨10.4230/LIPIcs.IPEC.2023.38⟩
Communication dans un congrès
hal-04395895v1
|
||
Arc-chromatic number of digraphs in which every vertex has bounded outdegree or bounded indegreeJournal of Graph Theory, 2006, 53 (4), pp.315-332. ⟨10.1002/jgt.20189⟩
Article dans une revue
istex
lirmm-00153978v1
|
|||
Two proofs of Bermond-Thomassen conjecture for regular tournaments6th Czech-Slovak International Symposium on Combinatorics, Graph Theory, Algorithms and Applications, Jul 2007, Prague, République Tchèque, Czech Republic. pp.47-53, ⟨10.1016/j.endm.2007.01.008⟩
Communication dans un congrès
istex
lirmm-00153984v1
|
|||
|
Constrained Flows in Networks2023
Pré-publication, Document de travail
hal-04379871v1
|
||
|
On finding the best and worst orientations for the metric dimension[Research Report] Inria. 2020
Rapport
hal-02921466v1
|
||
|
Redicolouring digraphs: directed treewidth and cycle-degeneracyInria. 2023
Rapport
hal-04271445v1
|
||
|
Design of fault-tolerant on-board networks with variable switch sizesTheoretical Computer Science, 2015, 562, pp.75-89. ⟨10.1016/j.tcs.2014.09.034⟩
Article dans une revue
hal-01111370v1
|
||
|
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
|
||
|
Perfect DCJ rearrangementRECOMB-CG: Comparative Genomics, Oct 2008, Paris, France. pp.158-169, ⟨10.1007/978-3-540-87989-3_12⟩
Communication dans un congrès
lirmm-00327258v1
|
||
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
|
|||
|
Linear time recognition of P4-indifference graphsDiscrete Mathematics and Theoretical Computer Science, 2001, Vol. 4 no. 2 (2), pp.173-178. ⟨10.46298/dmtcs.269⟩
Article dans une revue
inria-00471619v1
|
||
|
Avoidability of Formulas with Two Variables20th International Conference on Developments in Language Theory (DLT 2016), Laboratoire de combinatoire et d'informatique mathématique (LaCIM), Université du Québec à Montréal, Jul 2016, Montréal, Canada. pp.344-354, ⟨10.1007/978-3-662-53132-7_28⟩
Communication dans un congrès
lirmm-01375829v1
|
||
|
Digraph redicolouringEuropean Journal of Combinatorics, 2024, 116, pp.103876. ⟨10.1016/j.ejc.2023.103876⟩
Article dans une revue
hal-04306893v1
|
||
|
Induced minors and well-quasi-orderingEuroComb: European Conference on Combinatorics, Graph Theory and Applications, Aug 2015, Bergen, Norway. pp.197-201, ⟨10.1016/j.endm.2015.06.029⟩
Communication dans un congrès
lirmm-01349277v1
|
||
|
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
|
||
|
Bipartite spanning sub(di)graphs induced by 2-partitionsJournal of Graph Theory, 2019, 92 (2), pp.130-151. ⟨10.1002/jgt.22444⟩
Article dans une revue
hal-02350210v1
|
||
|
Complexity Dichotomies for the Minimum F-Overlay Problem[Research Report] RR-9045, Inria Sophia Antipolis. 2013, pp.16
Rapport
hal-01490535v1
|
||
|
Report on GRASTA 2017, 6th Workshop on GRAph Searching, Theory and Applications, Anogia, Crete, Greece, April 10 – April 13, 2017[Research Report] LIP6, CNRS, Universit ́e Pierre et Marie Curie Paris, France; Department of Informatics, University of Bergen, Bergen, Norway; CNRS and Université Paris Diderot, France; Inria & Université Nice Sophia Antipolis, CNRS, I3S, Sophia Antipolis, France; AlGCo project team, CNRS, LIRMM, Montpellier, France. 2017
Rapport
lirmm-01645614v1
|
||
Recognition of dynamic circle graphsICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France
Communication dans un congrès
hal-01178215v1
|
|||
|
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
|
||
|
Two floor building needing eight colorsJournal of Graph Algorithms and Applications, 2015, 19 (1), pp.1--9. ⟨10.7155/jgaa.00344⟩
Article dans une revue
hal-00996709v2
|
||
|
Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2Journal of Graph Theory, 2022, 100 (2), pp.294-314. ⟨10.1002/jgt.22779⟩
Article dans une revue
lirmm-04032263v1
|
||
|
WDM and Directed Star Arboricity[Research Report] RR-6179, INRIA. 2007, pp.20
Rapport
inria-00132396v3
|
||
|
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
|