Reza Naserasr - RankMe

84 papers B 3C 2Journal 76Unranked 3

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Balanced chromatic number and Hadwiger-like conjectures. Discret. Appl. Math. Andrea Jiménez, Jessica McDonald, Reza Naserasr, Kathryn Nurse, Daniel A. Quiroz
2026	J	`jnl`	Density of 2-critical signed graphs. Discret. Math. Reza Naserasr, Weiqiang Yu
2026	J	`jnl`	Fractional balanced chromatic number of signed subcubic graphs. Discret. Math. Xiaolan Hu, Luis Kuffner, Jiaao Li, Reza Naserasr, Lujia Wang, Zhouningxin Wang, Xiaowei Yu
2026	J	`jnl`	Sensitivity conjecture and signed hypercubes. ACM Trans. Comput. Theory Sophie Laplante, Reza Naserasr, Anupa Sunny, Zhouningxin Wang
2025	J	`jnl`	Critically 3-frustrated signed graphs. Discret. Math. Chiara Cappello, Reza Naserasr, Eckhard Steffen, Zhouningxin Wang
2025	J	`jnl`	Extension of the Gyárfás-Sumner conjecture to signed graphs. CoRR Guillaume Aubian, Allen Ibiapina, Luis Kuffner, Reza Naserasr, Cyril Pujol, Cléophée Robin, Huan Zhou
2025	J	`jnl`	On core of categorical product of (di)graphs. CoRR Reza Naserasr, Cyril Pujol
2024	—	`conf`	A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction. TCC (4) Pierre Charbit, Geoffroy Couteau, Pierre Meyer, Reza Naserasr
2024	J	`jnl`	A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction. IACR Cryptol. ePrint Arch. Pierre Charbit, Geoffroy Couteau, Pierre Meyer, Reza Naserasr
2024	J	`jnl`	Circular flows in mono-directed signed graphs. J. Graph Theory Jiaao Li, Reza Naserasr, Zhouningxin Wang, Xuding Zhu
2024	J	`jnl`	On the packing number of antibalanced signed simple planar graphs of negative girth at least 5. J. Comb. Optim. Reza Naserasr, Weiqiang Yu
2023	J	`jnl`	A Note on Δ-Critical Graphs. Graphs Comb. Penny Haxell, Reza Naserasr
2023	J	`jnl`	A new graph parameter to measure linearity. J. Graph Theory Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr
2023	J	`jnl`	Balanced-chromatic number and Hadwiger-like conjectures. CoRR Andrea Jiménez, Jessica McDonald, Reza Naserasr, Kathryn Nurse, Daniel A. Quiroz
2023	J	`jnl`	Circular ${\boldsymbol{(4-\epsilon )}}$ -Coloring of Some Classes of Signed Graphs. SIAM J. Discret. Math. Frantisek Kardos, Jonathan Narboni, Reza Naserasr, Zhouningxin Wang
2023	J	`jnl`	Extended Double Covers and Homomorphism Bounds of Signed Graphs. Electron. J. Comb. Florent Foucaud, Reza Naserasr, Rongxing Xu
2023	J	`jnl`	Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$. J. Graph Theory Reza Naserasr, Riste Skrekovski, Zhouningxin Wang, Rongxing Xu
2023	J	`jnl`	Packing Signatures in Signed Graphs. SIAM J. Discret. Math. Reza Naserasr, Weiqiang Yu
2023	J	`jnl`	Separating signatures in signed planar graphs. Discret. Appl. Math. Reza Naserasr, Weiqiang Yu
2023	J	`jnl`	Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem. Discret. Math. Reza Naserasr, Zhouningxin Wang
2023	J	`jnl`	Winding number and circular 4-coloring of signed graphs. CoRR Anna Gujgiczer, Reza Naserasr, Rohini S, S. Taruni
2022	J	`jnl`	Complex and Homomorphic Chromatic Number of Signed Planar Simple Graphs. Graphs Comb. Reza Naserasr, Lan Anh Pham
2022	J	`jnl`	Density of J. Comb. Theory B Reza Naserasr, Lan Anh Pham, Zhouningxin Wang
2022	J	`jnl`	Smallest C2ℓ+1-critical graphs of odd-girth 2k+1. Discret. Appl. Math. Laurent Beaudou, Florent Foucaud, Reza Naserasr
2021	J	`jnl`	Circular Chromatic Number of Signed Graphs. Electron. J. Comb. Reza Naserasr, Zhouningxin Wang, Xuding Zhu
2021	C	`conf`	Cliques in exact distance powers of graphs of given maximum degree. LAGOS Florent Foucaud, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Petru Valicov
2021	J	`jnl`	Edge clique covers in graphs with independence number two. J. Graph Theory Pierre Charbit, Gena Hahn, Marcin Kaminski, Manuel Lafond, Nicolas Lichiardopol, Reza Naserasr, Ben Seamone, Rezvan Sherkati
2021	J	`jnl`	Exact square coloring of subcubic planar graphs. Discret. Appl. Math. Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov
2021	J	`jnl`	Extension of Gyárfás-Sumner Conjecture to Digraphs. Electron. J. Comb. Pierre Aboulker, Pierre Charbit, Reza Naserasr
2021	J	`jnl`	Homomorphisms of signed graphs: An update. Eur. J. Comb. Reza Naserasr, Éric Sopena, Thomas Zaslavsky
2020	J	`jnl`	Exact square coloring of subcubic planar graphs. CoRR Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov
2020	J	`jnl`	Extension of Gyarfas-Sumner conjecture to digraphs. CoRR Pierre Aboulker, Pierre Charbit, Reza Naserasr
2020	J	`jnl`	Homomorphisms of Sparse Signed Graphs. Electron. J. Comb. Clément Charpentier, Reza Naserasr, Éric Sopena
2020	J	`jnl`	Homomorphisms of partial J. Comb. Theory B Meirun Chen, Reza Naserasr
2020	B	`conf`	Sensitivity Lower Bounds from Linear Dependencies. MFCS Sophie Laplante, Reza Naserasr, Anupa Sunny
2020	J	`jnl`	Sensitivity lower bounds from linear dependencies. Electron. Colloquium Comput. Complex. Sophie Laplante, Reza Naserasr, Anupa Sunny
2020	—	`conf`	Smallest C CALDAM Laurent Beaudou, Florent Foucaud, Reza Naserasr
2019	J	`jnl`	Homomorphism bounds of signed bipartite K4-minor-free graphs and edge-colorings of 2k-regular K4-minor-free multigraphs. Discret. Appl. Math. Laurent Beaudou, Florent Foucaud, Reza Naserasr
2019	J	`jnl`	When an optimal dominating set with given constraints exists. Theor. Comput. Sci. Omid Etesami, Narges Ghareghani, Michel Habib, Mohammad Reza Hooshmandasl, Reza Naserasr, Pouyeh Sharifani
2018	J	`jnl`	Safe sets in graphs: Graph classes and structural parameters. J. Comb. Optim. 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
2018	J	`jnl`	The optimal routing of augmented cubes. Inf. Process. Lett. Meirun Chen, Reza Naserasr
2017	—	`conf`	A New Graph Parameter to Measure Linearity. COCOA (2) Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr
2017	J	`jnl`	Homomorphism bounds and edge-colourings of K J. Comb. Theory B Laurent Beaudou, Florent Foucaud, Reza Naserasr
2017	J	`jnl`	Identification, Location-Domination and Metric Dimension on Interval and Permutation Graphs. II. Algorithms and Complexity. Algorithmica Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
2017	J	`jnl`	Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds. Theor. Comput. Sci. Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
2017	J	`jnl`	The complexity of signed graph and edge-coloured graph homomorphisms. Discret. Math. Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr
2017	J	`jnl`	The complexity of tropical graph homomorphisms. Discret. Appl. Math. Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr
2017	J	`jnl`	Towards A Unified View of Linear Structure on Graph Classes. CoRR Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr
2016	J	`jnl`	Bipartite edge partitions and the former Alon-Saks-Seymour conjecture. Australas. J Comb. Zhicheng Gao, Brendan D. McKay, Reza Naserasr, Brett Stevens
2016	J	`jnl`	Homomorphism bounds and edge-colourings of K CoRR Laurent Beaudou, Florent Foucaud, Reza Naserasr
2016	J	`jnl`	Mapping planar graphs into the Coxeter graph. Discret. Math. Ararat Harutyunyan, Reza Naserasr, Mirko Petrusevski, Riste Skrekovski, Qiang Sun
2016	C	`conf`	Safe Sets in Graphs: Graph Classes and Structural Parameters. COCOA Raquel Águeda, Nathann Cohen, Shinya Fujita, Sylvain Legay, Yannis Manoussakis, Yasuko Matsui, Leandro Montero, Reza Naserasr, Yota Otachi, Tadashi Sakuma, Zsolt Tuza, Renyu Xu
2016	J	`jnl`	The complexity of tropical graph homomorphisms. CoRR Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr
2016	J	`jnl`	Walk-Powers and Homomorphism Bounds of Planar Signed Graphs. Graphs Comb. Reza Naserasr, Sagnik Sen, Qiang Sun
2015	B	`conf`	Algorithms and Complexity for Metric Dimension and Location-domination on Interval and Permutation Graphs. WG Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
2015	J	`jnl`	From Edge-Coloring to Strong Edge-Coloring. Electron. J. Comb. Valentin Borozan, Gerard Jennhwa Chang, Nathann Cohen, Shinya Fujita, Narayanan Narayanan, Reza Naserasr, Petru Valicov
2015	J	`jnl`	Homomorphisms of Signed Graphs. J. Graph Theory Reza Naserasr, Edita Rollová, Éric Sopena
2015	J	`jnl`	Homomorphisms of binary Cayley graphs. Discret. Math. Laurent Beaudou, Reza Naserasr, Claude Tardif
2015	J	`jnl`	Identification, location-domination and metric dimension on interval and permutation graphs. I. Bounds. CoRR Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
2015	J	`jnl`	The complexity of signed graph and 2-edge-coloured graph homomorphisms. CoRR Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr
2015	J	`jnl`	Walk-powers and homomorphism bound of planar graphs. CoRR Reza Naserasr, Sagnik Sen, Qiang Sun
2014	J	`jnl`	Identification, location-domination and metric dimension on interval and permutation graphs. CoRR Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov
2014	B	`conf`	The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction. LATIN Florent Foucaud, Reza Naserasr
2013	J	`jnl`	Characterizing Extremal Digraphs for Identifying Codes and Extremal Cases of Bondy's Theorem on Induced Subsets. Graphs Comb. Florent Foucaud, Reza Naserasr, Aline Parreau
2013	J	`jnl`	Homomorphisms of planar signed graphs to signed projective cubes. Discret. Math. Theor. Comput. Sci. Reza Naserasr, Edita Rollová, Éric Sopena
2013	J	`jnl`	Identifying Codes in Line Graphs. J. Graph Theory Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov
2013	J	`jnl`	Mapping Planar Graphs into Projective Cubes. J. Graph Theory Reza Naserasr
2012	J	`jnl`	Vertex-colouring edge-weightings with two edge weights. Discret. Math. Theor. Comput. Sci. Mahdad Khatirinejad, Reza Naserasr, Mike Newman, Ben Seamone, Brett Stevens
2011	J	`jnl`	Digraphs are 2-Weight Choosable. Electron. J. Comb. Mahdad Khatirinejad, Reza Naserasr, Mike Newman, Ben Seamone, Brett Stevens
2011	J	`jnl`	Edge identifying codes. Electron. Notes Discret. Math. Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov
2011	J	`jnl`	Extremal graphs for the identifying code problem. Eur. J. Comb. Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov
2011	J	`jnl`	Identifying codes in line graphs CoRR Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov
2010	J	`jnl`	Extremal graphs for the identifying code problem CoRR Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov
2010	J	`jnl`	Extremal problems on identifying codes in digraphs and Bondy's theorem on induced subsets CoRR Florent Foucaud, Reza Naserasr, Aline Parreau
2009	J	`jnl`	Homomorphisms of triangle-free graphs without a K Discret. Math. Reza Naserasr, Yared Nigussie, Riste Skrekovski
2007	J	`jnl`	Circular Coloring the Plane. SIAM J. Discret. Math. Matt DeVos, Javad B. Ebrahimi, Mohammad Ghebleh, Luis A. Goddyn, Bojan Mohar, Reza Naserasr
2007	J	`jnl`	Homomorphisms and edge-colourings of planar graphs. J. Comb. Theory B Reza Naserasr
2006	J	`jnl`	On a new reformulation of Hadwiger's conjecture. Discret. Math. Reza Naserasr, Yared Nigussie
2006	J	`jnl`	The chromatic covering number of a graph. J. Graph Theory Reza Naserasr, Claude Tardif
2003	J	`jnl`	On Some Parameters Related to Uniquely Vertex-Colourable Graphs and Defining Sets. Ars Comb. Amir Daneshgar, Reza Naserasr
2003	J	`jnl`	The Petersen graph is not 3-edge-colorable--a new proof. Discret. Math. Reza Naserasr, Riste Skrekovski
2000	J	`jnl`	On small uniquely vertex-colourable graphs and Xu's conjecture. Discret. Math. Amir Daneshgar, Reza Naserasr
1999	J	`jnl`	Hypergraphical Codes Arising from Binary Trades. Des. Codes Cryptogr. Gholamreza B. Khosrovshahi, Reza Naserasr
1997	J	`jnl`	Defining sets in vertex colorings of graphs and latin rectangles. Discret. Math. Ebadollah S. Mahmoodian, Reza Naserasr, Manouchehr Zaker