Search - Archive ouverte HAL Access content directly

Filter your results

72 Results
Image document

Acyclic edge-colouring of planar graphs

Manu Basavaraju , L. Sunil Chandran , Nathann Cohen , Frédéric Havet , Tobias Müller et al.
SIAM Journal on Discrete Mathematics, 2011, 25 (2), pp.436--478
Journal articles inria-00638448v1
Image document

Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number

Pierre Aboulker , Nathann Cohen , Frédéric Havet , William Lochet , Phablo F S Moura et al.
The Electronic Journal of Combinatorics, 2019, 26, pp.P3.19
Journal articles hal-02275082v1
Image document

Tradeoffs in routing reconfiguration problems

Nathann Cohen , David Coudert , Dorian Mazauric , Napoleão Nepomuceno , Nicolas Nisse et al.
12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France. pp.0
Conference papers inria-00477413v1
Image document

Spy-Game on graphs

Nathann Cohen , Mathieu Hilaire , Nicolas Martins , Nicolas Nisse , Stéphane Pérennes et al.
[Research Report] RR-8869, Inria. 2016
Reports hal-01279339v1
Image document

Finding good 2-partitions of digraphs II. Enumerable properties

Jørgen Bang-Jensen , Nathann Cohen , Frédéric Havet
Theoretical Computer Science, 2016, 640, pp.1-19. ⟨10.1016/j.tcs.2016.05.034⟩
Journal articles hal-01346079v1

A note on Zagreb indices inequality for trees and unicyclic graphs

Vesna Andova , Nathann Cohen , Ristě Skrekovski
Ars Mathematica Contemporanea, 2011, 5, pp.73-76
Journal articles hal-01338388v1

Graphs with maximal irregularity

Hosam Abdo , Nathann Cohen , Darko Dimitrov
Filomat, 2014, 28 (7), pp.1315-1322. ⟨10.2298/FIL1407315A⟩
Journal articles hal-01221794v1
Image document

Planar graphs with maximum degree Delta\geq 9 are (\Delta+1)-edge-choosable -- short proof

Nathann Cohen , Frédéric Havet
[Research Report] RR-7098, INRIA. 2009
Reports inria-00432389v1
Image document

Several Graph problems and their Linear Program formulations

Nathann Cohen
2019
Preprints, Working Papers, ... inria-00504914v2
Image document

Good edge-labelling of graphs

Julio Araujo , Nathann Cohen , Frédéric Giroire , Frédéric Havet
LAGOS'09 - V Latin-American Algorithms, Graphs and Optimization Symposium, Nov 2009, Gramado, Brazil. pp.275-280, ⟨10.1016/j.endm.2009.11.045⟩
Conference papers hal-00749194v1
Image document

Connected Tropical Subgraphs in Vertex-Colored Graphs

Jean-Alexandre Anglès d'Auriac , Nathann Cohen , Hakim El Mafthoui , Ararat Harutyunyan , Sylvain Legay et al.
Discrete Mathematics and Theoretical Computer Science, 2016, Vol. 17 no. 3 (3), pp.327-348. ⟨10.46298/dmtcs.2151⟩
Journal articles hal-01352845v1
Image document

Subdivisions in digraphs of large out-degree or large dichromatic number *

Pierre Aboulker , Nathann Cohen , Frédéric Havet , William Lochet , Phablo F S Moura et al.
[Research Report] INRIA Sophia Antipolis - I3S. 2016
Reports hal-01403921v1
Image document

Spy-Game on graphs: complexity and simple topologies

Nathann Cohen , Nícolas A Martins , Fionn Mc Inerney , Nicolas Nisse , Stéphane Pérennes et al.
[Research Report] Inria Sophia Antipolis. 2017
Reports hal-01463297v1
Image document

Equitable orientations of sparse uniform hypergraphs

Nathann Cohen , William Lochet
The Electronic Journal of Combinatorics, 2016, 23 (4), pp.4-31
Journal articles hal-01417832v1
Image document

Finding good 2-partitions of digraphs II. Enumerable properties

Jørgen Bang-Jensen , Nathann Cohen , Frédéric Havet
[Research Report] RR-8868, INRIA Sophia Antipolis - I3S. 2016
Reports hal-01279338v1
Image document

Safe Sets in Graphs: Graph Classes and Structural Parameters

Nathann Cohen , Raquel Águeda , Shinya Fujita , Sylvain Legay , Yannis Manoussakis et al.
COCOA 2016 - 10th International Conference Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.241-253
Conference papers hal-01624255v1
Image document

Interest Clustering Coefficient: a New Metric for Directed Networks like Twitter

Thibaud Trolliet , Nathann Cohen , Frédéric Giroire , Luc Hogie , Stéphane Pérennes et al.
COMPLEX NETWORKS 2020 - 9th International Conference on Complex Networks and their Applications, Dec 2020, Madrid / Virtual, Spain
Conference papers hal-03052083v1
Image document

Linear and 2-frugal choosability of graphs of small maximum average degree

Nathann Cohen , Frédéric Havet
[Research Report] RR-7213, INRIA. 2010
Reports inria-00459692v1
Image document

Three years of graphs and music : some results in graph theory and its applications

Nathann Cohen
Discrete Mathematics [cs.DM]. Université Nice Sophia Antipolis, 2011. English. ⟨NNT : ⟩
Theses tel-00645151v1

GRPH

Luc Hogie , Issam Tahiri , Aurélien Lancin , Nathann Cohen , David Coudert et al.
France, Patent n° : FR.001.310007.000.S.P.2011.000.31235. 2011
Patents hal-01355741v1
Image document

Calcul mathématique avec Sage

Alexandre Casamayou , Nathann Cohen , Guillaume Connan , Thierry Dumont , Laurent Fousse et al.
CreateSpace, pp.468, 2013, 9781481191043
Books inria-00540485v2
Image document

Good edge-labelling of graphs.

Julio Araujo , Nathann Cohen , Frédéric Giroire , Frédéric Havet
Discrete Applied Mathematics, 2012, V Latin American Algorithms, Graphs, and Optimization Symposium -- Gramado, Brazil, 2009, 160 (18), pp.2502-2513. ⟨10.1016/j.dam.2011.07.021⟩
Journal articles inria-00639005v1
Image document

A polynomial-time algorithm for Outerplanar Diameter Improvement

Nathann Cohen , Daniel Gonçalves , Eun Jung Kim , Christophe Paul , Ignasi Sau Valls et al.
Journal of Computer and System Sciences, 2017, 89, pp.315 - 327. ⟨10.1016/j.jcss.2017.05.016⟩
Journal articles hal-01592242v1

Safe sets in graphs: Graph classes and structural parameters

Reza Naserasr , Raquel Águeda , Nathann Cohen , Shinya Fujita , Sylvain Legay et al.
Journal of Combinatorial Optimization, 2017, pp.1-22. ⟨10.1007/s10878-017-0205-2⟩
Journal articles hal-01644491v1
Image document

Applying clique-decomposition for computing Gromov hyperbolicity

Nathann Cohen , David Coudert , Guillaume Ducoffe , Aurélien Lancin
Theoretical Computer Science, 2017, 690, pp.114-139. ⟨10.1016/j.tcs.2017.06.001⟩
Journal articles hal-01540756v1
Image document

Subdivisions of oriented cycles in digraphs with large chromatic number

Nathann Cohen , Frédéric Havet , William Lochet , Nicolas Nisse
[Research Report] RR-8865, LRI - CNRS, University Paris-Sud; LIP - ENS Lyon; INRIA Sophia Antipolis - I3S. 2016, pp.25
Reports hal-01277578v1
Image document

On Wiener index of graphs and their line graphs

Nathann Cohen , Darko Dimitrov , Roi Krakovski , Riste Skrekovski , Vida Vukašinović et al.
MATCH Communications in Mathematical and in Computer Chemistry, 2010, 64 (3), pp.683-698
Journal articles hal-00531288v1
Image document

Good edge-labelling of graphs

Julio Araújo , Nathann Cohen , Frédéric Giroire , Frédéric Havet
[Research Report] RR-6934, INRIA. 2009, pp.16
Reports inria-00383343v4

Coverability in 1-VASS with Disequality Tests

Shaull Almagor , Nathann Cohen , Guillermo A. Pérez , Mahsa Shirmohammadi , James Worrell et al.
31st International Conference on Concurrency Theory, CONCUR 2020, Aug 2020, Vienna, Austria. pp.38:1--38:20, ⟨10.4230/LIPIcs.CONCUR.2020.38⟩
Conference papers hal-03064637v1
Image document

The $\alpha$-Arboricity of Complete Uniform Hypergraphs

Jean-Claude Bermond , Y.M Chee , Nathann Cohen , X. Zhang
SIAM Journal on Discrete Mathematics, 2011, 25 (2), pp.600-610. ⟨10.1137/100806035⟩
Journal articles inria-00589689v1