default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNathann Cohen
Person information
- affiliation: University of Paris-Sud, LRI
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j32]Thibaud Trolliet, Nathann Cohen, Frédéric Giroire, Luc Hogie, Stéphane Pérennes:
Interest clustering coefficient: a new metric for directed networks like Twitter. J. Complex Networks 10(1) (2021)- 2020
- [j31]Nathann Cohen, Fionn Mc Inerney
, Nicolas Nisse, Stéphane Pérennes:
Study of a Combinatorial Game in Graphs Through Linear Programming. Algorithmica 82(2): 212-244 (2020) - [j30]Nathann Cohen, Matjaz Kovse:
Not all partial cubes are Θ-graceful. Discret. Math. 343(10): 112031 (2020) - [c11]Thibaud Trolliet, Nathann Cohen, Frédéric Giroire, Luc Hogie, Stéphane Pérennes:
Interest Clustering Coefficient: A New Metric for Directed Networks Like Twitter. COMPLEX NETWORKS (2) 2020: 597-609 - [c10]Shaull Almagor, Nathann Cohen, Guillermo A. Pérez, Mahsa Shirmohammadi, James Worrell:
Coverability in 1-VASS with Disequality Tests. CONCUR 2020: 38:1-38:20 - [i9]Thibaud Trolliet, Nathann Cohen, Frédéric Giroire, Luc Hogie, Stéphane Pérennes:
Interest Clustering Coefficient: a New Metric for Directed Networks like Twitter. CoRR abs/2008.00517 (2020)
2010 – 2019
- 2019
- [j29]Pierre Aboulker, Nathann Cohen, Frédéric Havet, William Lochet, Phablo F. S. Moura, Stéphan Thomassé:
Subdivisions in Digraphs of Large Out-Degree or Large Dichromatic Number. Electron. J. Comb. 26(3): 3 (2019) - [j28]Julien Bensmail, Thibaut Blanc, Nathann Cohen, Frédéric Havet, Leonardo S. Rocha:
Backbone colouring and algorithms for TDMA scheduling. Discret. Math. Theor. Comput. Sci. 21(3) (2019) - [i8]Shaull Almagor, Nathann Cohen, Guillermo A. Pérez, Mahsa Shirmohammadi, James Worrell:
Coverability in 1-VASS with Disequality Tests. CoRR abs/1902.06576 (2019) - [i7]Nathann Cohen, Edith Elkind, Foram Lakhani:
Single-crossing Implementation. CoRR abs/1906.09671 (2019) - 2018
- [j27]Nathann Cohen, Frédéric Havet:
On the Minimum Size of an Identifying Code Over All Orientations of a Graph. Electron. J. Comb. 25(1): 1 (2018) - [j26]Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes:
Bispindles in Strongly Connected Digraphs with Large Chromatic Number. Electron. J. Comb. 25(2): 2 (2018) - [j25]Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Hirotaka Ono, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu:
Safe sets in graphs: Graph classes and structural parameters. J. Comb. Optim. 36(4): 1221-1242 (2018) - [j24]Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant:
Complexity dichotomies for the MinimumF-Overlay problem. J. Discrete Algorithms 52-53: 133-142 (2018) - [j23]Nathann Cohen, Frédéric Havet, William Lochet, Nicolas Nisse:
Subdivisions of oriented cycles in digraphs with large chromatic number. J. Graph Theory 89(4): 439-456 (2018) - [j22]Nathann Cohen, Nicolas Almeida Martins, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes, Rudini M. Sampaio:
Spy-game on graphs: Complexity and simple topologies. Theor. Comput. Sci. 725: 1-15 (2018) - 2017
- [j21]Nathann Cohen, Dmitrii V. Pasechnik:
Implementing Brouwer's database of strongly regular graphs. Des. Codes Cryptogr. 84(1-2): 223-235 (2017) - [j20]Nathann Cohen, Frédéric Havet, William Lochet, Raul Lopes:
Bispindle in strongly connected digraphs with large chromatic number. Electron. Notes Discret. Math. 62: 69-74 (2017) - [j19]Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller:
A polynomial-time algorithm for Outerplanar Diameter Improvement. J. Comput. Syst. Sci. 89: 315-327 (2017) - [j18]Nathann Cohen, David Coudert, Guillaume Ducoffe, Aurélien Lancin:
Applying clique-decomposition for computing Gromov hyperbolicity. Theor. Comput. Sci. 690: 114-139 (2017) - [c9]Nathann Cohen, Fionn Mc Inerney, Nicolas Nisse, Stéphane Pérennes:
Study of a Combinatorial Game in Graphs Through Linear Programming. ISAAC 2017: 22:1-22:13 - [c8]Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant:
Complexity Dichotomies for the Minimum ℱ -Overlay Problem. IWOCA 2017: 116-127 - [i6]Nathann Cohen, Frédéric Havet, Dorian Mazauric, Ignasi Sau, Rémi Watrigant:
Complexity Dichotomies for the Minimum F-Overlay Problem. CoRR abs/1703.05156 (2017) - 2016
- [j17]Nathann Cohen, William Lochet:
Equitable Orientations of Sparse Uniform Hypergraphs. Electron. J. Comb. 23(4): 4 (2016) - [j16]Jean-Alexandre Anglès d'Auriac, Nathann Cohen, Hakim El Mafthoui, Ararat Harutyunyan, Sylvain Legay, Yannis Manoussakis:
Connected Tropical Subgraphs in Vertex-Colored Graphs. Discret. Math. Theor. Comput. Sci. 17(3) (2016) - [j15]Jørgen Bang-Jensen, Nathann Cohen, Frédéric Havet:
Finding good 2-partitions of digraphs II. Enumerable properties. Theor. Comput. Sci. 640: 1-19 (2016) - [c7]Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu:
Safe Sets in Graphs: Graph Classes and Structural Parameters. COCOA 2016: 241-253 - [c6]Nathann Cohen, Mathieu Hilaire, Nicolas Almeida Martins, Nicolas Nisse, Stéphane Pérennes:
Spy-Game on Graphs. FUN 2016: 10:1-10:16 - [c5]Jean-Claude Bermond, Nathann Cohen, David Coudert, Dimitrios Letsios, Ioannis Milis, Stéphane Pérennes, Vassilis Zissimopoulos:
Bin Packing with Colocations. WAOA 2016: 40-51 - [i5]Nathann Cohen, Dmitrii V. Pasechnik:
Implementing Brouwer's database of strongly regular graphs. CoRR abs/1601.00181 (2016) - 2015
- [j14]Valentin Borozan, Gerard Jennhwa Chang, Nathann Cohen, Shinya Fujita, Narayanan Narayanan, Reza Naserasr, Petru Valicov:
From Edge-Coloring to Strong Edge-Coloring. Electron. J. Comb. 22(2): 2 (2015) - [j13]Nathann Cohen, David Coudert, Aurélien Lancin:
On Computing the Gromov Hyperbolicity. ACM J. Exp. Algorithmics 20: 1.6:1-1.6:18 (2015) - [j12]Nathann Cohen, Zsolt Tuza:
Induced Decompositions of Highly Dense Graphs. J. Graph Theory 78(2): 97-107 (2015) - [j11]Júlio Araújo, Nathann Cohen, Susanna F. de Rezende, Frédéric Havet, Phablo F. S. Moura:
On the proper orientation number of bipartite graphs. Theor. Comput. Sci. 566: 59-75 (2015) - [c4]Nathann Cohen, Daniel Gonçalves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller:
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement. CSR 2015: 123-142 - 2014
- [i4]Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller:
A Polynomial-time Algorithm for Outerplanar Diameter Improvement. CoRR abs/1403.5702 (2014) - 2013
- [c3]Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt:
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. WADS 2013: 73-84 - [i3]Andrei Asinowski, Jean Cardinal, Nathann Cohen, Sébastien Collette, Thomas Hackl, Michael Hoffmann, Kolja B. Knauer, Stefan Langerman, Michal Lason, Piotr Micek, Günter Rote, Torsten Ueckerdt:
Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles. CoRR abs/1302.2426 (2013) - 2012
- [j10]Vesna Andova, Nathann Cohen, Riste Skrekovski:
A note on Zagreb indices inequality for trees and unicyclic graphs. Ars Math. Contemp. 5(1): 73-76 (2012) - [j9]Júlio Araújo, Nathann Cohen, Frédéric Giroire, Frédéric Havet:
Good edge-labelling of graphs. Discret. Appl. Math. 160(18): 2502-2513 (2012) - [i2]Hosam Abdo, Nathann Cohen, Darko Dimitrov:
Bounds and Computation of Irregularity of a Graph. CoRR abs/1207.4804 (2012) - 2011
- [b1]Nathann Cohen:
Three years of graphs and music : some results in graph theory and its applications. University of Nice Sophia Antipolis, France, 2011 - [j8]Nathann Cohen, Frédéric Havet:
Linear and 2-Frugal Choosability of Graphs of Small Maximum Average Degree. Graphs Comb. 27(6): 831-849 (2011) - [j7]Manu Basavaraju, L. Sunil Chandran, Nathann Cohen, Frédéric Havet, Tobias Müller:
Acyclic Edge-Coloring of Planar Graphs. SIAM J. Discret. Math. 25(2): 463-478 (2011) - [j6]Jean-Claude Bermond, Yeow Meng Chee, Nathann Cohen, Xiande Zhang:
The α-Arboricity of Complete Uniform Hypergraphs. SIAM J. Discret. Math. 25(2): 600-610 (2011) - [j5]Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, Nicolas Nisse:
Tradeoffs in process strategy games with application in the WDM reconfiguration problem. Theor. Comput. Sci. 412(35): 4675-4687 (2011) - 2010
- [j4]Nathann Cohen, Frédéric Havet:
Planar graphs with maximum degree Delta>=9 are (Delta+1)-edge-choosable - A short proof. Discret. Math. 310(21): 3049-3051 (2010) - [j3]Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo:
Algorithm for finding k-vertex out-trees and its application to k-internal out-branching problem. J. Comput. Syst. Sci. 76(7): 650-662 (2010) - [c2]Nathann Cohen, David Coudert, Dorian Mazauric, Napoleão Nepomuceno, Nicolas Nisse:
Tradeoffs in Process Strategy Games with Application in the WDM Reconfiguration Problem. FUN 2010: 121-132
2000 – 2009
- 2009
- [j2]Nathann Cohen, Frédéric Havet, Tobias Müller:
Acyclic edge-colouring of planar graphs. Extended abstract. Electron. Notes Discret. Math. 34: 417-421 (2009) - [j1]Júlio Araújo, Nathann Cohen, Frédéric Giroire, Frédéric Havet:
Good edge-labelling of graphs. Electron. Notes Discret. Math. 35: 275-280 (2009) - [c1]Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo:
Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem. COCOON 2009: 37-46 - [i1]Nathann Cohen, Fedor V. Fomin, Gregory Z. Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo:
Algorithm for Finding $k$-Vertex Out-trees and its Application to $k$-Internal Out-branching Problem. CoRR abs/0903.0938 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 21:48 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
