Recherche - Archive ouverte HAL Accéder directement au contenu

Filtrer vos résultats

72 résultats
Page :
triés par
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⟩
Article dans une revue 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
Article dans une revue hal-01338388v1

Graphs with maximal irregularity

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

Tradeoffs in routing reconfiguration problems

 Nathann Cohen , David Coudert , Dorian Mazauric , Napoleão Nepomuceno , Nicolas Nisse
12è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
Image document

Spy-Game on graphs

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

Acyclic edge-colouring of planar graphs

 Manu Basavaraju , L. Sunil Chandran , Nathann Cohen , Frédéric Havet , Tobias Müller
SIAM Journal on Discrete Mathematics, 2011, 25 (2), pp.436--478
Article dans une revue 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
Article dans une revue hal-02275082v1
Image document

Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks

 Nathann Cohen , David Coudert , Dorian Mazauric , Napoleão Nepomuceno , Nicolas Nisse
[Research Report] RR-7047, INRIA. 2009
Rapport inria-00421140v4

Le défi des 1001 graphes

 Nathann Cohen , David Coudert
Interstices, 2017
Article dans une revue hal-01662565v1
Image document

Applying clique-decomposition for computing Gromov hyperbolicity

 Nathann Cohen , David Coudert , Guillaume Ducoffe , Aurélien Lancin
[Research Report] RR-8535, INRIA. 2014, pp.33
Rapport hal-00989024v2
Image document

On computing the Gromov hyperbolicity

 Nathann Cohen , David Coudert , Aurélien Lancin
ACM 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 Rectangles

 Andrei Asinowski , Jean Cardinal , Nathann Cohen , Sébastien Collette , Thomas Hackl , et al.
WADS 2013, Aug 2013, Canada. pp.73-84
Communication dans un congrès hal-00947748v1
Image document

A Doubling Construction for 3-Uniform Friendship Hypergraphs with the Universal Pairs Property

 Nathann Cohen
Journal of Combinatorial Designs, 2016, 24 (7), pp.336-339. ⟨10.1002/jcd.21509⟩
Article dans une revue hal-01316029v1

A Polynomial-Time Algorithm for Outerplanar Diameter Improvement

 Nathann Cohen , Daniel Gonçalves , Eun Jung Kim , Christophe Paul , Ignasi Sau , et al.
CSR: 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
Image document

Complexity Dichotomies for the Minimum F-Overlay Problem

 Nathann Cohen , Frédéric Havet , Dorian Mazauric , Ignasi Sau , Rémi Watrigant
[Research Report] RR-9045, Inria Sophia Antipolis. 2013, pp.16
Rapport hal-01490535v1
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
Rapport inria-00383343v4
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⟩
Article dans une revue inria-00589689v1

Coverability in 1-VASS with Disequality Tests

 Shaull Almagor , Nathann Cohen , Guillermo A. Pérez , Mahsa Shirmohammadi , James Worrell
31st 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
Image document

Bispindles in strongly connected digraphs with large chromatic number

 Nathann Cohen , Frédéric Havet , William Lochet , Raul Lopes
The Electronic Journal of Combinatorics, 2018, ⟨10.37236/6922⟩
Article dans une revue hal-01810706v1
Image document

On Wiener index of graphs and their line graphs

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

Induced Decompositions of Highly Dense Graphs

 Nathann Cohen , Zsolt Tuza
Journal of Graph Theory, 2015, 78 (2), pp.97-107. ⟨10.1002/jgt.21792⟩
Article dans une revue istex hal-01076882v1
Image document

Tradeoffs in process strategy games with application in the WDM reconfiguration problem

 Nathann Cohen , David Coudert , Dorian Mazauric , Napoleao Nepomuceno , Nicolas Nisse
Fifth International conference on Fun with Algorithms (FUN 2010), Jun 2010, Ischia, Italy. pp.121-132, ⟨10.1007/978-3-642-13122-6_14⟩
Communication dans un congrès inria-00495443v1
Image document

Bin Packing with Colocations

 Jean-Claude Bermond , Nathann Cohen , David Coudert , Dimitrios Letsios , Ioannis Milis , et al.
14th International Workshop on Approximation and Online Algorithms (WAOA), Aug 2016, Aarhus, Denmark. pp.40-51, ⟨10.1007/978-3-319-51741-4_4⟩
Communication dans un congrès hal-01435614v1
Image document

Bispindle in strongly connected digraphs with large chromatic number

 Nathann Cohen , Frédéric Havet , William Lochet , Raul Lopes
Electronic Notes in Discrete Mathematics, 2017, 62, pp.69 - 74. ⟨10.1016/j.endm.2017.10.013⟩
Article dans une revue hal-01634307v1
Image document

Complexity dichotomies for the Minimum F -Overlay problem

 Nathann Cohen , Frédéric Havet , Dorian Mazauric , Ignasi Sau , Rémi Watrigant
Journal of Discrete Algorithms, 2018, 52-53, pp.133-142. ⟨10.1016/j.jda.2018.11.010⟩
Article dans une revue hal-01947563v1
Image document

Algorithme exact et approché pour le calcul de l'hyperbolicité d'un graphe

 Nathann Cohen , David Coudert , Aurélien Lancin
AlgoTel 2013 - 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2013, Pornic, France. pp.1-4
Communication dans un congrès hal-00818441v1
Image document

Complexity Dichotomies for the Minimum $F$-Overlay Problem

 Nathann Cohen , Frédéric Havet , Dorian Mazauric , Ignasi Sau , Rémi Watrigant
28th International Workshop on Combinatorial Algorithms (IWOCA), Jul 2017, Newcastle, Australia. pp.116-127, ⟨10.1007/978-3-319-78825-8_10⟩
Communication dans un congrès hal-01571229v1
Image document

Study of a combinatorial game in graphs through Linear Programming

 Nathann Cohen , Fionn Mc Inerney , Nicolas Nisse , Stéphane Pérennes
28th International Symposium on Algorithms and Computation (ISAAC 2017), 2017, Phuket, Thailand. ⟨10.4230/LIPIcs⟩
Communication dans un congrès hal-01582091v1
Image document

Subdivisions of oriented cycles in digraphs with large chromatic number

 Nathann Cohen , Frédéric Havet , William Lochet , Nicolas Nisse
Journal of Graph Theory, 2018, 89 (4), pp.439-456. ⟨10.1002/jgt.22360⟩
Article dans une revue hal-01834779v1
Image document

Spy-game on graphs: Complexity and simple topologies

 Nathann Cohen , Nicolas Martins , Fionn Mc Inerney , Nicolas Nisse , Stéphane Pérennes , et al.
Theoretical Computer Science, 2018, 725, pp.1 - 15. ⟨10.1016/j.tcs.2017.11.015⟩
Article dans une revue hal-01782246v1
Page :