Reza Naserasr

Publications

Pré-publication, Document de travail (21)

Brooks' theorem for signed graphs with ∆ = 3 Reza Naserasr,Huan Zhou 2025 Pré-publication, Document de travail hal-05321120v1
On core of categorical product of (di)graphs Reza Naserasr,Cyril Pujol 2025 Pré-publication, Document de travail hal-05052892v1
Fractional balanced chromatic number of signed subcubic graphs Reza Naserasr,Hu Xiaolan,Kuﬀner Luis,Naserasr Reza,Wang Lujiaet al. 2025 Pré-publication, Document de travail hal-05028168v1
Extension of the Gyárfás-Sumner conjecture to signed graphs Guillaume Aubian,Allen Ibiapina,Luis Kuffner,Reza Naserasr,Cyril Pujolet al. 2025 Pré-publication, Document de travail hal-05321116v1
Odd Hadwiger's conjecture for the complements of Kneser graphs Chen Meirun,Reza Naserasr,Wang Lujia,Zhou Sanming 2025 Pré-publication, Document de travail hal-05072101v1
Density of 2-critical signed graphs Reza Naserasr,Weiqiang Yu 2025 Pré-publication, Document de travail hal-05295126v1
Fractional balanced chromatic number and arboricity of planar (signed) graphs Reza Naserasr,Naserasr Reza,Pham Lan Anh,Pujol Cyril,Zhou Huan 2025 Pré-publication, Document de travail hal-05028169v1
Signed projective cubes, a homomorphism point of view Meirun Chen,Reza Naserasr,Alessandra Sarti 2024 Pré-publication, Document de travail hal-04607606v1
Sensitivity conjecture and signed hypercubes Sophie Laplante,Reza Naserasr,Anupa Sunny,Zhouningxin Wang 2023 Pré-publication, Document de travail hal-04080411v1
Winding number and circular 4-coloring of signed graphs Reza Naserasr,Anna Gujgiczer,Rohini S,Taruni S 2023 Pré-publication, Document de travail hal-03840738v2
On the packing number of antibalanced signed simple planar graphs of negative girth at least 5 Reza Naserasr,Weiqiang Yu 2023 Pré-publication, Document de travail hal-04080407v1
Packing signatures in signed graphs Reza Naserasr,Weiqiang Yu 2023 Pré-publication, Document de travail hal-03960731v1
Balanced-chromatic number and Hadwiger-like conjectures Andrea Jimenez,Jessica Mcdonald,Reza Naserasr,Kathryn Nurse,Daniel A. Quiroz 2023 Pré-publication, Document de travail hal-04174372v1
Circular flows in mono-directed signed graphs Jiaao Li,Reza Naserasr,Zhouningxin Wang,Xuding Zhu 2022 Pré-publication, Document de travail hal-03840742v1
A note on ∆-critical graphs Penny Haxell,Reza Naserasr 2022 Pré-publication, Document de travail hal-03840737v1
Characterizing and recognizing exact-distance squares of graphs Yandong Bai,Pedro Cortes,Reza Naserasr,Danile Quiroz 2022 Pré-publication, Document de travail hal-03840741v1
Circular (4 − \epsilon)-coloring of some classes of signed graphs František Kardoš,Jonathan Narboni,Reza Naserasr,Zhouningxin Wang 2021 Pré-publication, Document de travail hal-03298994v1
Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem Reza Naserasr,Zhouningxin Wang 2021 Pré-publication, Document de travail hal-03356580v1
Mapping sparse signed graphs to (K_{2k} , M ) Reza Naserasr,Riste Skrekovski,Zhouningxin Wang,Rongxing Xu 2021 Pré-publication, Document de travail hal-03109532v1
Sensitivity lower bounds from linear dependencies Sophie Laplante,Reza Naserasr,Anupa Sunny 2020 Pré-publication, Document de travail hal-02429358v1
On powers of interval graphs and their orders Florent Foucaud,Reza Naserasr,Aline Parreau,Petru Valicov 2015 Pré-publication, Document de travail hal-01198830v1

Communication dans un congrès (9)

A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction Pierre Charbit,Geoffroy Couteau,Pierre Meyer,Reza Naserasr TCC 2024, Dec 2024, Milan (Italie), Italy Communication dans un congrès hal-04779135v1
A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction Pierre Charbit,Geoffroy Couteau,Pierre Meyer,Reza Naserasr TCC 2024, Dec 2024, Milan, Italy Communication dans un congrès hal-04773929v1
Smallest $C_{2l+1}$-Critical Graphs of Odd-Girth $2k+1$ Laurent Beaudou,Florent Foucaud,Reza Naserasr 6th International Conference on Algorithms and Discrete Applied Mathematics (CALDAM 2020), Feb 2020, Hyderabad, India. pp.184-196, ⟨10.1007/978-3-030-39219-2_16⟩ Communication dans un congrès hal-03041342v1
A New Graph Parameter to Measure Linearity Pierre Charbit,Michel Habib,Lalla Mouatadid,Reza Naserasr COCOA 2017 - 11th Annual International Conference on Combinatorial Optimization and Applications, Dec 2017, Shanghai, China. pp.154-168, ⟨10.1007/978-3-319-71147-8_11⟩ Communication dans un congrès hal-01672521v1
Safe Sets in Graphs: Graph Classes and Structural Parameters Nathann Cohen,Raquel Águeda,Shinya Fujita,Sylvain Legay,Yannis Manoussakiset al. COCOA 2016 - 10th International Conference Combinatorial Optimization and Applications, Dec 2016, Hong Kong, China. pp.241-253, ⟨10.1007/978-3-319-48749-6_18⟩ Communication dans un congrès hal-01624255v1
Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs Florent Foucaud,George Mertzios,Reza Naserasr,Aline Parreau,Petru Valicov International Workshop on Graph-Theoretic Concepts in Computer Science WG 2015, Jun 2015, Munich, Germany. pp.175 - 471, ⟨10.1007/978-3-662-53174-7_32⟩ Communication dans un congrès hal-01518713v1
On homomorphisms of planar signed graphs to signed projective cubes Reza Naserasr,Edita Rollova,Eric Sopena European Conference on Combinatorics, Graph Theory and Applications - Eurocomb 2013, Sep 2013, Pisa, Italy. pp.1-5 Communication dans un congrès hal-00829117v1
Homomorphisms of signed bipartite graphs Reza Naserasr,Edita Rollova,Eric Sopena European Conference on Combinatorics, Graph Theory and Applications - Eurocomb 2013, Sep 2013, Pisa, Italy. pp.1-5 Communication dans un congrès hal-00829116v1
Edge identifying codes Florent Foucaud,Sylvain Gravier,Reza Naserasr,Aline Parreau,Petru Valicov European Conference on Combinatorics, Graph Theory and Applications (EUROCOMB), Aug 2011, Budapest, Hungary. pp.343-348, ⟨10.1016/j.endm.2011.09.056⟩ Communication dans un congrès istex hal-00960555v1

Article dans une revue (34)

Extended Double Covers and Homomorphism Bounds of Signed Graphs Florent Foucaud,Reza Naserasr,Rongxing Xu The Electronic Journal of Combinatorics, 2023, 30 (3), pp.P3.31. ⟨10.37236/10754⟩ Article dans une revue hal-03356591v2
Smallest $C_{2l+1}$-critical graphs of odd-girth $2k+1$ Laurent Beaudou,Florent Foucaud,Reza Naserasr Discrete Applied Mathematics, 2022, 319, pp.564 - 575. ⟨10.1016/j.dam.2021.08.040⟩ Article dans une revue hal-03784719v1
Complex and homomorphic chromatic number of signed planar simple graphs Reza Naserasr,Lan Anh Pham Graphs and Combinatorics, 2022 Article dans une revue hal-03000542v1
Density of C −4 -critical signed graphs Reza Naserasr,Lan Anh Pham,Zhouningxin Wang Journal of Combinatorial Theory, Series B, 2022 Article dans une revue hal-03000545v1
Edge clique covers in graphs with independence number two Pierre Charbit,Geňa Hahn,Marcin Kamiński,Manuel Lafond,Nicolas Lichiardopolet al. Journal of Graph Theory, 2021 Article dans une revue hal-02969899v1
Homomorphisms of signed graphs: An update Reza Naserasr,Eric Sopena,Thomas Zaslavsky European Journal of Combinatorics, 2021, ⟨10.1016/j.ejc.2020.103222⟩ Article dans une revue hal-02429415v2
Exact square coloring of subcubic planar graphs Florent Foucaud,Hervé Hocquard,Suchismita Mishra,Narayanan Narayanan,Reza Naserasret al. Discrete Applied Mathematics, 2021, 293, pp.74-89. ⟨10.1016/j.dam.2021.01.007⟩ Article dans une revue hal-02925881v3
Circular chromatic number of signed graphs Reza Naserasr,Zhouningxin Wang,Xuding Zhu The Electronic Journal of Combinatorics, 2021 Article dans une revue hal-02969872v1
Extension of Gyárfás-Sumner conjecture to digraphs Pierre Aboulker,Pierre Charbit,Reza Naserasr The Electronic Journal of Combinatorics, 2021, ⟨10.37236/9906⟩ Article dans une revue hal-02969880v1
The homomorphism order of signed graphs Reza Naserasr,Sagnik Sen,Eric Sopena Journal of Combinatorial Mathematics and Combinatorial Computing, In press Article dans une revue hal-02969878v1
Homomorphisms of partial t-trees and edge-coloring of partial 3-trees Meirun Chen,Reza Naserasr Journal of Combinatorial Theory, Series B, 2020 Article dans une revue hal-02429570v1
Bounding signed series-parallel graphs and cores of signed K 4 -subdivisions Reza Naserasr,Zhouningxin Wang Journal of Combinatorial Mathematics and Combinatorial Computing, In press Article dans une revue hal-02969873v1
Homomorphisms of sparse signed graphs Clément Charpentier,Reza Naserasr,Eric Sopena The Electronic Journal of Combinatorics, 2020, 27 (3), ⟨10.37236/8478⟩ Article dans une revue hal-03035030v1
When an optimal dominating set with given constraints exists Nargues Ghareghani,Michel Habib,Mohammad Reza Hooshmandasl,Reza Naserasr,Pouyeh Sharifani Theoretical Computer Science, 2019, ⟨10.1016/j.tcs.2019.02.012⟩ Article dans une revue hal-02423707v1
On the Structure of Small Strength-2 Covering Arrays Janne I Kokkala,Karen Meagher,Reza Naserasr,Kari J Nurmela,Patric R J Östergårdet al. Journal of Combinatorial Designs, 2019, 28 (1), pp.5-24. ⟨10.1002/jcd.21671⟩ Article dans une revue hal-02429432v1
Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs Laurent Beaudou,Florent Foucaud,Reza Naserasr Discrete Applied Mathematics, 2019, 261, pp.40-51. ⟨10.1016/j.dam.2018.09.004⟩ Article dans une revue hal-01915269v1
A New Approach Towards a Conjecture on Intersecting Three Longest Paths Reza Naserasr Journal of Combinatorics, 2019, ⟨10.4310/JOC.2019.v10.n2.a2⟩ Article dans une revue hal-02429509v1
The optimal routing of augmented cubes. Meirun Chen,Reza Naserasr Information Processing Letters, 2018 Article dans une revue hal-01934333v1
Identification, location-domination and metric dimension on interval and permutation graphs. II. Algorithms and complexity Florent Foucaud,George B. Mertzios,Reza Naserasr,Aline Parreau,Petru Valicov Algorithmica, 2017, 78 (3), pp.914-944. ⟨10.1007/s00453-016-0184-1⟩ Article dans une revue hal-01198784v1
Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds Florent Foucaud,George B. Mertzios,Reza Naserasr,Aline Parreau,Petru Valicov Theoretical Computer Science, 2017, 668, pp.43-58. ⟨10.1016/j.tcs.2017.01.006⟩ Article dans une revue hal-01198783v1
Safe sets in graphs: Graph classes and structural parameters Raquel Águeda,Nathann Cohen,Shinya Fujita,Sylvain Legay,Yannis Manoussakiset al. Journal of Combinatorial Optimization, 2017, 36, pp.1221-1242. ⟨10.1007/s10878-017-0205-2⟩ Article dans une revue hal-01644491v1
The complexity of signed and edge-coloured graph homomorphisms. Brewster Richard,Foucaud Florent,Hell Pavol,Reza Naserasr Discrete Mathematics, 2017, 340 (2), pp.223-235. ⟨10.1016/j.disc.2016.08.005⟩ Article dans une revue hal-01520743v1
Homomorphism bounds and edge-colourings of K4-minor-free graphs Laurent Beaudou,Florent Foucaud,Reza Naserasr Journal of Combinatorial Theory, Series B, 2017, 124, pp.128-164. ⟨10.1016/j.jctb.2017.01.001⟩ Article dans une revue hal-01520741v1
The complexity of tropical graph homomorphisms. Florent Foucaud,Ararat Harutyunyan,Pavol Hell,Sylvain Legay,Yannis Manoussakiset al. Discrete Applied Mathematics, 2017, 229, pp.64-81. ⟨10.1016/j.dam.2017.04.027⟩ Article dans une revue hal-01520739v1
Bipartite edge partitions and the former Alon-Saks-Seymour Gao Z.,Mckay B. D.,Reza Naserasr,Stevens B. The Australasian Journal of Combinatorics, 2016 Article dans une revue hal-01520742v1
Algorithms and complexity for metric dimension and location-domination on interval and permutation graphs. Foucaud F.,Mertzios G. B.,Reza Naserasr,Parreau A.,Petru Valicov Lecture Notes in Computer Science, 2016 Article dans une revue hal-01520744v1
Homomorphisms of signed graphs Reza Naserasr,Edita Rollova,Eric Sopena Journal of Graph Theory, 2015, 79 (3), pp.178-212. ⟨10.1002/jgt.21817⟩ Article dans une revue istex hal-00991796v1
From Edge-Coloring to Strong Edge-Coloring Valentin Borozan,Gerard Jennhwa Chang,Nathann Cohen,Shinya Fujita,Narayanan Narayanan N Narayananet al. The Electronic Journal of Combinatorics, 2015, 22 (2), pp.P2.9 Article dans une revue hal-01144153v1
Identifying codes in line graphs Florent Foucaud,Sylvain Gravier,Reza Naserasr,Aline Parreau,Petru Valicov Journal of Graph Theory, 2013, 73 (4), pp.425-448. ⟨10.1002/jgt.21686⟩ Article dans une revue hal-00605406v2
Characterizing extremal digraphs for identifying codes and extremal cases of Bondy's theorem on induced subsets Florent Foucaud,Reza Naserasr,Aline Parreau Graphs and Combinatorics, 2013, 29 (3), pp.463-473. ⟨10.1007/s00373-012-1136-4⟩ Article dans une revue hal-00526446v3
Homomorphisms of planar signed graphs to signed projective cubes Reza Naserasr,Edita Rollova,Eric Sopena Discrete Mathematics and Theoretical Computer Science, 2013, 15 (3), pp.1-12 Article dans une revue hal-00876298v2
Mapping planar graphs into projective cubes. Reza Naserasr Journal of Graph Theory, 2013, pp.11 Article dans une revue hal-01140168v1
Vertex-colouring edge-weightings with two edge weights Mahdad Khatirinejad,Reza Naserasr,Mike Newman,Ben Seamone,Brett Stevens Discrete Mathematics and Theoretical Computer Science, 2012, Vol. 14 no. 1 (1), pp.1-20. ⟨10.46298/dmtcs.570⟩ Article dans une revue hal-00990567v1
Extremal graphs for the identifying code problem Florent Foucaud,Eleonora Guerrini,Matjaz Kovse,Reza Naserasr,Aline Parreauet al. European Journal of Combinatorics, 2011, 32 (4), pp.628-638. ⟨10.1016/j.ejc.2011.01.002⟩ Article dans une revue hal-00477467v4