Nombre de documents

51

CV de Nathann Cohen


Article dans une revue20 documents

  • Nathann Cohen, Dmitrii V. Pasechnik. Implementing Brouwer’s database of strongly regular graphs. Designs, Codes and Cryptography, Springer Verlag, 2016, pp.1-13. <10.1007/s10623-016-0264-x>. <hal-01354889>
  • Jean-Alexandre Anglès d'Auriac, Nathann Cohen, Hakim El Mafthoui, Ararat Harutyunyan, Sylvain Legay, et al.. Connected Tropical Subgraphs in Vertex-Colored Graphs. Discrete Mathematics and Theoretical Computer Science, DMTCS, 2016, 17 (3), pp.327-348. <hal-01352845>
  • Nathann Cohen, William Lochet. Equitable orientations of sparse uniform hypergraphs. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2016, 23 (4), pp.4-31. <http://www.combinatorics.org/ojs/index.php/eljc/article/view/v23i4p31>. <hal-01417832>
  • Nathann Cohen. A Doubling Construction for 3-Uniform Friendship Hypergraphs with the Universal Pairs Property. Journal of Combinatorial Designs, Wiley, 2016, 24 (7), pp.336-339. <10.1002/jcd.21509>. <hal-01316029>
  • Joergen Bang-Jensen, Nathann Cohen, Frédéric Havet. Finding good 2-partitions of digraphs II. Enumerable properties. Journal of Theoretical Computer Science (TCS), Elsevier, 2016, 640, pp.1-19. <http://www.sciencedirect.com/science/article/pii/S0304397516301815>. <10.1016/j.tcs.2016.05.034>. <hal-01346079>
  • Valentin Borozan, Gerard Jennhwa Chang, Nathann Cohen, Shinya Fujita, Narayanan Narayanan, et al.. From Edge-Coloring to Strong Edge-Coloring. Electronic Journal of Combinatorics, Electronic Journal of Combinatorics, 2015, 22 (2), pp.P2.9. <http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i2p9>. <hal-01144153>
  • Julio Araujo, Nathann Cohen, Susanna F. De Rezende, Frédéric Havet, Phablo Moura. On the proper orientation number of bipartite graphs. Journal of Theoretical Computer Science (TCS), Elsevier, 2015, 566, pp.59-75. <10.1016/j.tcs.2014.11.037>. <hal-01101578>
  • Nathann Cohen, Zsolt Tuza. Induced Decompositions of Highly Dense Graphs. Journal of Graph Theory, Wiley, 2015, 78 (2), pp.97-107. <10.1002/jgt.21792>. <hal-01076882>
  • Nathann Cohen, David Coudert, Aurélien Lancin. On computing the Gromov hyperbolicity. ACM Journal on Experimental Algorithmics, Association for Computing Machinery, 2015, 20 (1), pp.18. <10.1145/2780652>. <hal-01182890>
  • Hosam Abdo, Nathann Cohen, Darko Dimitrov. Graphs with maximal irregularity. Filomat, University of Nis, 2014, 28 (7), pp.1315-1322. <10.2298/FIL1407315A>. <hal-01221794>
  • Julio Araujo, Nathann Cohen, Frédéric Giroire, Frédéric Havet. Good edge-labelling of graphs.. Discrete Applied Mathematics, Elsevier, 2012, V Latin American Algorithms, Graphs, and Optimization Symposium -- Gramado, Brazil, 2009, 160 (18), pp.2502-2513. <10.1016/j.dam.2011.07.021>. <inria-00639005>
  • Nathann Cohen, Frédéric Havet. Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree. Graphs and Combinatorics, Springer Verlag, 2011, 27 (6), pp.831--849. <inria-00638460>
  • Vesna Andova, Nathann Cohen, Riste Skrekovski. Graph Classes (Dis)satisfying the Zagreb Indices Inequality. MATCH Communications in Mathematical and in Computer Chemistry, 2011, 65 (3), pp.647-658. <hal-00531290>
  • Vesna Andova, Nathann Cohen, Ristě Skrekovski. A note on Zagreb indices inequality for trees and unicyclic graphs. Ars Mathematica Contemporanea, DMFA Slovenije, 2011, 5, pp.73-76. <http://amc-journal.eu/index.php/amc/article/view/173>. <hal-01338388>
  • Jean-Claude Bermond, Y.M Chee, Nathann Cohen, X. Zhang. The $\alpha$-Arboricity of Complete Uniform Hypergraphs. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2011, 25 (2), pp.600-610. <10.1137/100806035>. <inria-00589689>
  • Manu Basavaraju, L. Sunil Chandran, Nathann Cohen, Frédéric Havet, Tobias Müller. Acyclic edge-colouring of planar graphs. Siam Journal on Discrete Mathematics, Society for Industrial and Applied Mathematics, 2011, 25 (2), pp.436--478. <inria-00638448>
  • Nathann Cohen, David Coudert, Dorian Mazauric, Napoleao Nepomuceno, Nicolas Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Theoretical Computer Science, Elsevier, 2011, 412 (35), pp.4675-4687. <10.1016/j.tcs.2011.05.002>. <inria-00592507>
  • Nathann Cohen, Fedor Fomin, Gregory Gutin, Eun Jung Kim, Saket Saurabh, et al.. Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. Journal of Computer and System Sciences, Elsevier, 2010, 76 (7), pp.650 - 662. <hal-00504734>
  • Nathann Cohen, Darko Dimitrov, Roi Krakovski, Riste Skrekovski, Vida Vukašinović. On Wiener index of graphs and their line graphs. MATCH Communications in Mathematical and in Computer Chemistry, 2010, 64 (3), pp.683-698. <hal-00531288>
  • Nathann Cohen, Frédéric Havet. Planar graphs with maximum degree Δ≥9 are (Δ+1)-edge-choosable—A short proof. Contributions to Discrete Mathematics, University of Calgary, 2010, 310 (21), <10.1016/j.disc.2010.07.004>. <hal-01338378>

Thèse1 document

  • Nathann Cohen. Three years of graphs and music : some results in graph theory and its applications. Discrete Mathematics [cs.DM]. Université Nice Sophia Antipolis, 2011. English. <tel-00645151>

Ouvrage (y compris édition critique et traduction)1 document

  • Alexandre Casamayou, Nathann Cohen, Guillaume Connan, Thierry Dumont, Laurent Fousse, et al.. Calcul mathématique avec Sage. CreateSpace, pp.468, 2013, 9781481191043. <inria-00540485v2>

Brevet1 document

  • Luc Hogie, Issam Tahiri, Aurélien Lancin, Nathann Cohen, David Coudert. GRPH: The high performance graph library for Java. France, Patent n° : FR.001.310007.000.S.P.2011.000.31235. 2011. <hal-01355741>

Rapport16 documents

  • Nathann Cohen, Nícolas Martins, Fionn Mcinerney, Nicolas Nisse, Stéphane Pérennes, et al.. Spy-Game on graphs: complexity and simple topologies. [Research Report] Inria Sophia Antipolis. 2017. <hal-01463297>
  • Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes. Spy Game in trees and grids. [Research Report] Inria Sophia Antipolis. 2017. <hal-01462890>
  • Pierre Aboulker, Nathann Cohen, Frédéric Havet, William Lochet, Phablo Moura, et al.. Subdivisions in digraphs of large out-degree or large dichromatic number *. [Research Report] INRIA Sophia Antipolis - I3S. 2016. <hal-01403921>
  • Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, et al.. Bin packing with colocations. [Research Report] Inria; I3S. 2016. <hal-01381333>
  • Jørgen Bang-Jensen, Nathann Cohen, Frédéric Havet. Finding good 2-partitions of digraphs II. Enumerable properties. [Research Report] RR-8868, INRIA Sophia Antipolis - I3S. 2016. <hal-01279338>
  • Nathann Cohen, Mathieu Hilaire, Nicolas Martins, Nicolas Nisse, Stéphane Pérennes. Spy-Game on graphs. [Research Report] RR-8869, Inria. 2016. <hal-01279339>
  • Nathann Cohen, Frédéric Havet, William Lochet, Nicolas Nisse. Subdivisions of oriented cycles in digraphs with large chromatic number. [Research Report] RR-8865, LRI - CNRS, University Paris-Sud; LIP - ENS Lyon; INRIA Sophia Antipolis - I3S. 2016, pp.25. <hal-01277578>
  • Julio Araujo, Nathann Cohen, Susanna F. De Rezende, Frédéric Havet, Phablo Moura. On the proper orientation number of bipartite graphs. [Research Report] RR-8492, INRIA. 2014, pp.23. <hal-00957453>
  • Nathann Cohen, David Coudert, Guillaume Ducoffe, Aurélien Lancin. Applying clique-decomposition for computing Gromov hyperbolicity. [Research Report] RR-8535, INRIA. 2014, pp.33. <hal-00989024v2>
  • Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant. Complexity Dichotomies for the Minimum F-Overlay Problem. [Research Report] 9045, Inria Sophia Antipolis. 2013, pp.16. <hal-01490535>
  • Nathann Cohen, David Coudert, Aurélien Lancin. Exact and approximate algorithms for computing the hyperbolicity of large-scale graphs. [Research Report] RR-8074, INRIA. 2012. <hal-00735481v4>
  • Nathann Cohen, Frédéric Havet. Linear and 2-frugal choosability of graphs of small maximum average degree. [Research Report] RR-7213, INRIA. 2010. <inria-00459692>
  • Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, Nicolas Nisse. Tradeoffs when optimizing Lightpaths Reconfiguration in WDM networks. [Research Report] RR-7047, INRIA. 2009. <inria-00421140v4>
  • Nathann Cohen, Frédéric Havet, Tobias Mueller. Acyclic edge-colouring of planar graphs. [Research Report] RR-6876, INRIA. 2009. <inria-00367394>
  • Julio Araújo, Nathann Cohen, Frédéric Giroire, Frédéric Havet. Good edge-labelling of graphs. [Research Report] RR-6934, INRIA. 2009, pp.16. <inria-00383343v4>
  • Nathann Cohen, Frédéric Havet. Planar graphs with maximum degree Delta\geq 9 are (\Delta+1)-edge-choosable -- short proof. [Research Report] RR-7098, INRIA. 2009. <inria-00432389>

Communication dans un congrès11 documents

  • Nathann Cohen, Frédéric Havet, William Lochet, Nicolas Nisse. Subdivisions of oriented cycles in digraphs with large chromatic number. Bordeaux Graph Wokshop 2016, Nov 2016, Bordeaux, France. Proceedings of BGW 216 (Bordeaux Graph Wokshop 2016), pp.85-88, <http://bgw.labri.fr/2016/>. <hal-01411115>
  • Nathann Cohen, Mathieu Hilaire, Nicolas Martins, Nicolas Nisse, Stéphane Pérennes. Spy-Game on graphs. Erik D. Demaine and Fabrizio Grandoni. 8th International Conference on Fun with Algorithms, FUN 2016, 2016, La Maddalena, Maddalena Islands, Italy. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik, 8th International Conference on Fun with Algorithms (FUN 2016), 49, 2016, Leibniz International Proceedings in Informatics (LIPIcs). <10.4230/LIPIcs.FUN.2016.10>. <hal-01326446>
  • Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, et al.. Bin Packing with Colocations. Klaus Jansen; Monaldo Mastrolilli. 14th International Workshop on Approximation and Online Algorithms (WAOA), Aug 2016, Aarhus, Denmark. Springer, Lecture Notes in Computer Science, 10138, pp.40-51, 2017, <http://conferences.au.dk/algo16/waoa/>. <10.1007/978-3-319-51741-4_4>. <hal-01435614>
  • Nathann Cohen, Daniel Gonçalves, Kim Eun Jung, Christophe Paul, Ignasi Sau, et al.. A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. International Computer Science Symposium in Russia - CRS, 2015, Irkutsk, Russia. 9139, 2015, Lecture Notes in Computer Science. <hal-01178222>
  • Julio Araujo, Nathann Cohen, Susanna De Rezende, Frédéric Havet, Phablo Moura. On the proper orientation number of bipartite graphs. 9th International colloquium on graph theory and combinatorics, Jun 2014, Grenoble, France. <hal-01076904>
  • Jean-Alexandre Angles d'Auriac, Nathann Cohen, Hakim Maftouhi, Ararat Harutyunyan, Sylvain Legay, et al.. Connected Tropical Subgraphs in Vertex-Colored Graphs. 9th International colloquium on graph theory and combinatorics, Jun 2014, Grenoble, France. <hal-01077567>
  • Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, et al.. Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. WADS 2013, Aug 2013, Canada. pp.73-84, 2013. <hal-00947748>
  • Nathann Cohen, David Coudert, Aurélien Lancin. Algorithme exact et approché pour le calcul de l'hyperbolicité d'un graphe. Nisse, Nicolas and Rousseau, Franck and Busnel, Yann. 15èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications (AlgoTel), May 2013, Pornic, France. pp.1-4, 2013. <hal-00818441>
  • Nathann Cohen, David Coudert, Dorian Mazauric, Napoleao Nepomuceno, Nicolas Nisse. Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Paola Boldi and Luisa Gargano. Fifth International conference on Fun with Algorithms (FUN 2010), Jun 2010, Ischia, Italy. Springer, 6099, pp.121-132, 2010, Lecture Notes in Computer Science. <10.1007/978-3-642-13122-6_14>. <inria-00495443>
  • Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, Nicolas Nisse. Tradeoffs in routing reconfiguration problems. Maria Gradinariu Potop-Butucaru et Hervé Rivano. 12èmes Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2010, Belle Dune, France. pp.0, 2010. <inria-00477413>
  • Julio Araujo, Nathann Cohen, Frédéric Giroire, Frédéric Havet. Good edge-labelling of graphs. LAGOS'09 - V Latin-American Algorithms, Graphs and Optimization Symposium, Nov 2009, Gramado, Brazil. Elsevier, Volume 35 (1), pp.275-280, 2009, Eletronic Notes in Discrete Mathematics. <10.1016/j.endm.2009.11.045>. <hal-00749194>

Autre publication1 document

  • Nathann Cohen. Several Graph problems and their Linear Program formulations. Ce document contient des formulations sous forme de Programmes Linéaire de quelques problèmes de .. 2010. <inria-00504914>