Reza Naserasr

Publication Activity (10 Years)

Years Active: 1997-2024
Publications (10 Years): 51

Top Topics

Top Venues

Electron. J. Comb.

Discret. Appl. Math.

J. Graph Theory

Publications

Reza Naserasr, Weiqiang Yu
On the packing number of antibalanced signed simple planar graphs of negative girth at least 5. J. Comb. Optim. 47 (2) (2024)
Penny Haxell, Reza Naserasr
A Note on Δ-Critical Graphs. Graphs Comb. 39 (5) (2023)
Reza Naserasr, Zhouningxin Wang
Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem. Discret. Math. 346 (12) (2023)
Florent Foucaud, Reza Naserasr, Rongxing Xu
Extended Double Covers and Homomorphism Bounds of Signed Graphs. Electron. J. Comb. 30 (3) (2023)
Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr
A new graph parameter to measure linearity. J. Graph Theory 103 (3) (2023)
Frantisek Kardos, Jonathan Narboni, Reza Naserasr, Zhouningxin Wang
Circular \({\boldsymbol{(4-\epsilon )}}\) -Coloring of Some Classes of Signed Graphs. SIAM J. Discret. Math. 37 (2) (2023)
Reza Naserasr, Riste Skrekovski, Zhouningxin Wang, Rongxing Xu
Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$. J. Graph Theory 104 (3) (2023)
Anna Gujgiczer, Reza Naserasr, Rohini S, S. Taruni
Winding number and circular 4-coloring of signed graphs. CoRR (2023)
Andrea Jiménez, Jessica McDonald, Reza Naserasr, Kathryn Nurse, Daniel A. Quiroz
Balanced-chromatic number and Hadwiger-like conjectures. CoRR (2023)
Reza Naserasr, Weiqiang Yu
Packing Signatures in Signed Graphs. SIAM J. Discret. Math. 37 (4) (2023)
Reza Naserasr, Weiqiang Yu
Separating signatures in signed planar graphs. Discret. Appl. Math. 338 (2023)
Reza Naserasr, Lan Anh Pham
Complex and Homomorphic Chromatic Number of Signed Planar Simple Graphs. Graphs Comb. 38 (3) (2022)
Laurent Beaudou, Florent Foucaud, Reza Naserasr
Smallest C2ℓ+1-critical graphs of odd-girth 2k+1. Discret. Appl. Math. 319 (2022)
Reza Naserasr, Lan Anh Pham, Zhouningxin Wang
-critical signed graphs. J. Comb. Theory, Ser. B 153 (2022)
Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov
Exact square coloring of subcubic planar graphs. Discret. Appl. Math. 293 (2021)
Pierre Aboulker, Pierre Charbit, Reza Naserasr
Extension of Gyárfás-Sumner Conjecture to Digraphs. Electron. J. Comb. 28 (2) (2021)
Pierre Charbit, Gena Hahn, Marcin Kaminski, Manuel Lafond, Nicolas Lichiardopol, Reza Naserasr, Ben Seamone, Rezvan Sherkati
Edge clique covers in graphs with independence number two. J. Graph Theory 97 (2) (2021)
Reza Naserasr, Zhouningxin Wang, Xuding Zhu
Circular Chromatic Number of Signed Graphs. Electron. J. Comb. 28 (2) (2021)
Reza Naserasr, Éric Sopena, Thomas Zaslavsky
Homomorphisms of signed graphs: An update. Eur. J. Comb. 91 (2021)
Florent Foucaud, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Petru Valicov
Cliques in exact distance powers of graphs of given maximum degree. LAGOS (2021)
Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov
Exact square coloring of subcubic planar graphs. CoRR (2020)
Sophie Laplante, Reza Naserasr, Anupa Sunny
Sensitivity lower bounds from linear dependencies. Electron. Colloquium Comput. Complex. 27 (2020)
Laurent Beaudou, Florent Foucaud, Reza Naserasr
-Critical Graphs of Odd-Girth 2k+1. CALDAM (2020)
Clément Charpentier, Reza Naserasr, Éric Sopena
Homomorphisms of Sparse Signed Graphs. Electron. J. Comb. 27 (3) (2020)
Sophie Laplante, Reza Naserasr, Anupa Sunny
Sensitivity Lower Bounds from Linear Dependencies. MFCS (2020)
Meirun Chen, Reza Naserasr
-trees and edge-colorings of partial 3-trees. J. Comb. Theory, Ser. B 145 (2020)
Pierre Aboulker, Pierre Charbit, Reza Naserasr
Extension of Gyarfas-Sumner conjecture to digraphs. CoRR (2020)
Laurent Beaudou, Florent Foucaud, Reza Naserasr
Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs. Discret. Appl. Math. 261 (2019)
Omid Etesami, Narges Ghareghani, Michel Habib, Mohammad Reza Hooshmandasl, Reza Naserasr, Pouyeh Sharifani
When an optimal dominating set with given constraints exists. Theor. Comput. Sci. 780 (2019)
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) (2018)
Meirun Chen, Reza Naserasr
The optimal routing of augmented cubes. Inf. Process. Lett. 136 (2018)
Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr
A New Graph Parameter to Measure Linearity. COCOA (2) (2017)
Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds. Theor. Comput. Sci. 668 (2017)
Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr
The complexity of tropical graph homomorphisms. Discret. Appl. Math. 229 (2017)
Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr
The complexity of signed graph and edge-coloured graph homomorphisms. Discret. Math. 340 (2) (2017)
Laurent Beaudou, Florent Foucaud, Reza Naserasr
-minor-free graphs. J. Comb. Theory, Ser. B 124 (2017)
Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity. Algorithmica 78 (3) (2017)
Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr
Towards A Unified View of Linear Structure on Graph Classes. CoRR (2017)
Laurent Beaudou, Florent Foucaud, Reza Naserasr
-minor-free graphs. CoRR (2016)
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)
Zhicheng Gao, Brendan D. McKay, Reza Naserasr, Brett Stevens
Bipartite edge partitions and the former Alon-Saks-Seymour conjecture. Australas. J Comb. 66 (2016)
Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr
The complexity of tropical graph homomorphisms. CoRR (2016)
Ararat Harutyunyan, Reza Naserasr, Mirko Petrusevski, Riste Skrekovski, Qiang Sun
Mapping planar graphs into the Coxeter graph. Discret. Math. 339 (2) (2016)
Reza Naserasr, Sagnik Sen, Qiang Sun
Walk-Powers and Homomorphism Bounds of Planar Signed Graphs. Graphs Comb. 32 (4) (2016)
Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs. WG (2015)
Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds. CoRR (2015)
Reza Naserasr, Edita Rollová, Éric Sopena
Homomorphisms of Signed Graphs. J. Graph Theory 79 (3) (2015)
Reza Naserasr, Sagnik Sen, Qiang Sun
Walk-powers and homomorphism bound of planar graphs. CoRR (2015)
Laurent Beaudou, Reza Naserasr, Claude Tardif
Homomorphisms of binary Cayley graphs. Discret. Math. 338 (12) (2015)
Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr
The complexity of signed graph and 2-edge-coloured graph homomorphisms. CoRR (2015)
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) (2015)
Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
Identification, location-domination and metric dimension on interval and permutation graphs. CoRR (2014)
Florent Foucaud, Reza Naserasr
The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction. LATIN (2014)
Reza Naserasr, Edita Rollová, Éric Sopena
Homomorphisms of planar signed graphs to signed projective cubes. Discret. Math. Theor. Comput. Sci. 15 (3) (2013)
Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov
Identifying Codes in Line Graphs. J. Graph Theory 73 (4) (2013)
Reza Naserasr
Mapping Planar Graphs into Projective Cubes. J. Graph Theory 74 (3) (2013)
Florent Foucaud, Reza Naserasr, Aline Parreau
Characterizing Extremal Digraphs for Identifying Codes and Extremal Cases of Bondy's Theorem on Induced Subsets. Graphs Comb. 29 (3) (2013)
Mahdad Khatirinejad, Reza Naserasr, Mike Newman, Ben Seamone, Brett Stevens
Vertex-colouring edge-weightings with two edge weights. Discret. Math. Theor. Comput. Sci. 14 (1) (2012)
Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov
Edge identifying codes. Electron. Notes Discret. Math. 38 (2011)
Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov
Extremal graphs for the identifying code problem. Eur. J. Comb. 32 (4) (2011)
Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov
Identifying codes in line graphs CoRR (2011)
Mahdad Khatirinejad, Reza Naserasr, Mike Newman, Ben Seamone, Brett Stevens
Digraphs are 2-Weight Choosable. Electron. J. Comb. 18 (1) (2011)
Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov
Extremal graphs for the identifying code problem CoRR (2010)
Florent Foucaud, Reza Naserasr, Aline Parreau
Extremal problems on identifying codes in digraphs and Bondy's theorem on induced subsets CoRR (2010)
Reza Naserasr, Yared Nigussie, Riste Skrekovski
-minor. Discret. Math. 309 (18) (2009)
Matt DeVos, Javad Ebrahimi, Mohammad Ghebleh, Luis A. Goddyn, Bojan Mohar, Reza Naserasr
Circular Coloring the Plane. SIAM J. Discret. Math. 21 (2) (2007)
Reza Naserasr
Homomorphisms and edge-colourings of planar graphs. J. Comb. Theory, Ser. B 97 (3) (2007)
Reza Naserasr, Claude Tardif
The chromatic covering number of a graph. J. Graph Theory 51 (3) (2006)
Reza Naserasr
-Free bound for the class of planar graphs. Eur. J. Comb. 27 (7) (2006)
Reza Naserasr, Yared Nigussie
On a new reformulation of Hadwiger's conjecture. Discret. Math. 306 (23) (2006)
Reza Naserasr, Riste Skrekovski
The Petersen graph is not 3-edge-colorable--a new proof. Discret. Math. 268 (1-3) (2003)
Amir Daneshgar, Reza Naserasr
On Some Parameters Related to Uniquely Vertex-Colourable Graphs and Defining Sets. Ars Comb. 69 (2003)
Amir Daneshgar, Reza Naserasr
On small uniquely vertex-colourable graphs and Xu's conjecture. Discret. Math. 223 (1-3) (2000)
Gholamreza B. Khosrovshahi, Reza Naserasr
Hypergraphical Codes Arising from Binary Trades. Des. Codes Cryptogr. 18 (1/3) (1999)
Ebadollah S. Mahmoodian, Reza Naserasr, Manouchehr Zaker
Defining sets in vertex colorings of graphs and latin rectangles. Discret. Math. (1997)