Filtrer vos résultats
- 59
- 13
- 34
- 17
- 16
- 2
- 1
- 1
- 1
- 16
- 65
- 25
- 1
- 3
- 3
- 7
- 10
- 13
- 5
- 5
- 4
- 2
- 8
- 6
- 5
- 68
- 4
- 57
- 57
- 48
- 10
- 7
- 5
- 3
- 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
- 72
- 26
- 15
- 13
- 8
- 8
- 7
- 6
- 6
- 5
- 5
- 4
- 4
- 4
- 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
- 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
- 1
- 1
72 résultats
|
Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks[Research Report] RR-7047, INRIA. 2009
Rapport
inria-00421140v4
|
||
Le défi des 1001 graphesInterstices, 2017
Article dans une revue
hal-01662565v1
|
|||
|
Applying clique-decomposition for computing Gromov hyperbolicity[Research Report] RR-8535, INRIA. 2014, pp.33
Rapport
hal-00989024v2
|
||
|
On computing the Gromov hyperbolicityACM Journal of Experimental Algorithmics, 2015, 20 (1), pp.18. ⟨10.1145/2780652⟩
Article dans une revue
hal-01182890v1
|
||
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless RectanglesWADS 2013, Aug 2013, Canada. pp.73-84
Communication dans un congrès
hal-00947748v1
|
|||
|
A Polynomial-Time Algorithm for Outerplanar Diameter ImprovementCSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.123-142, ⟨10.1007/978-3-319-20297-6_9⟩
Communication dans un congrès
hal-01178222v1
|
||
|
A Doubling Construction for 3-Uniform Friendship Hypergraphs with the Universal Pairs PropertyJournal of Combinatorial Designs, 2016, 24 (7), pp.336-339. ⟨10.1002/jcd.21509⟩
Article dans une revue
hal-01316029v1
|
||
|
Bispindles in strongly connected digraphs with large chromatic numberThe Electronic Journal of Combinatorics, 2018, ⟨10.37236/6922⟩
Article dans une revue
hal-01810706v1
|
||
|
Complexity Dichotomies for the Minimum F-Overlay Problem[Research Report] RR-9045, Inria Sophia Antipolis. 2013, pp.16
Rapport
hal-01490535v1
|
||
|
Coverability in 1-VASS with Disequality Tests31st International Conference on Concurrency Theory, CONCUR 2020, Aug 2020, Vienna, Austria. pp.38:1--38:20, ⟨10.4230/LIPIcs.CONCUR.2020.38⟩
Communication dans un congrès
hal-03064637v1
|
||
|
The $\alpha$-Arboricity of Complete Uniform HypergraphsSIAM Journal on Discrete Mathematics, 2011, 25 (2), pp.600-610. ⟨10.1137/100806035⟩
Article dans une revue
inria-00589689v1
|
||
|
Good edge-labelling of graphs[Research Report] RR-6934, INRIA. 2009, pp.16
Rapport
inria-00383343v4
|
||
|
Induced Decompositions of Highly Dense GraphsJournal of Graph Theory, 2015, 78 (2), pp.97-107. ⟨10.1002/jgt.21792⟩
Article dans une revue
istex
hal-01076882v1
|
||
|
On Wiener index of graphs and their line graphsMATCH Communications in Mathematical and in Computer Chemistry, 2010, 64 (3), pp.683-698
Article dans une revue
hal-00531288v1
|
||
|
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic NumberThe Electronic Journal of Combinatorics, 2019, 26, pp.P3.19
Article dans une revue
hal-02275082v1
|
||
|
Spy-Game on graphs[Research Report] RR-8869, Inria. 2016
Rapport
hal-01279339v1
|
||
|
Tradeoffs in routing reconfiguration problems12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France. pp.0
Communication dans un congrès
inria-00477413v1
|
||
|
Acyclic edge-colouring of planar graphsSIAM Journal on Discrete Mathematics, 2011, 25 (2), pp.436--478
Article dans une revue
inria-00638448v1
|
||
A note on Zagreb indices inequality for trees and unicyclic graphsArs Mathematica Contemporanea, 2011, 5, pp.73-76
Article dans une revue
hal-01338388v1
|
|||
|
Graphs with maximal irregularityFilomat, 2014, 28 (7), pp.1315-1322. ⟨10.2298/FIL1407315A⟩
Article dans une revue
hal-01221794v1
|
||
|
Finding good 2-partitions of digraphs II. Enumerable propertiesTheoretical Computer Science, 2016, 640, pp.1-19. ⟨10.1016/j.tcs.2016.05.034⟩
Article dans une revue
hal-01346079v1
|
||
|
Spy-Game on graphs: complexity and simple topologies[Research Report] Inria Sophia Antipolis. 2017
Rapport
hal-01463297v1
|
||
|
Several Graph problems and their Linear Program formulations2019
Pré-publication, Document de travail
inria-00504914v2
|
||
|
Finding good 2-partitions of digraphs II. Enumerable properties[Research Report] RR-8868, INRIA Sophia Antipolis - I3S. 2016
Rapport
hal-01279338v1
|
||
|
Good edge-labelling of graphsLAGOS'09 - V Latin-American Algorithms, Graphs and Optimization Symposium, Nov 2009, Gramado, Brazil. pp.275-280, ⟨10.1016/j.endm.2009.11.045⟩
Communication dans un congrès
hal-00749194v1
|
||
|
Planar graphs with maximum degree Delta\geq 9 are (\Delta+1)-edge-choosable -- short proof[Research Report] RR-7098, INRIA. 2009
Rapport
inria-00432389v1
|
||
|
Safe Sets in Graphs: Graph Classes and Structural ParametersCOCOA 2016 - 10th International Conference Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.241-253
Communication dans un congrès
hal-01624255v1
|
||
|
Connected Tropical Subgraphs in Vertex-Colored GraphsDiscrete Mathematics and Theoretical Computer Science, 2016, Vol. 17 no. 3 (3), pp.327-348. ⟨10.46298/dmtcs.2151⟩
Article dans une revue
hal-01352845v1
|
||
|
Subdivisions in digraphs of large out-degree or large dichromatic number *[Research Report] INRIA Sophia Antipolis - I3S. 2016
Rapport
hal-01403921v1
|
||
|
Equitable orientations of sparse uniform hypergraphsThe Electronic Journal of Combinatorics, 2016, 23 (4), pp.4-31
Article dans une revue
hal-01417832v1
|