default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDReza Naserasr
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2025
[j54]Chiara Cappello, Reza Naserasr
, Eckhard Steffen, Zhouningxin Wang:
Critically 3-frustrated signed graphs. Discret. Math. 348(2): 114258 (2025)- 2024
- [j53]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): 9 (2024) - 2023
- [j52]Florent Foucaud, Reza Naserasr, Rongxing Xu:
Extended Double Covers and Homomorphism Bounds of Signed Graphs. Electron. J. Comb. 30(3) (2023) - [j51]Reza Naserasr, Weiqiang Yu:
Separating signatures in signed planar graphs. Discret. Appl. Math. 338: 302-310 (2023) - [j50]Reza Naserasr, Zhouningxin Wang:
Signed bipartite circular cliques and a bipartite analogue of Grötzsch's theorem. Discret. Math. 346(12): 113604 (2023) - [j49]Penny Haxell, Reza Naserasr:
A Note on Δ-Critical Graphs. Graphs Comb. 39(5): 101 (2023) - [j48]Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr:
A new graph parameter to measure linearity. J. Graph Theory 103(3): 462-485 (2023) - [j47]Reza Naserasr, Riste Skrekovski, Zhouningxin Wang, Rongxing Xu:
Mapping sparse signed graphs to (K2k,M) $({K}_{2k},M)$. J. Graph Theory 104(3): 611-644 (2023) - [j46]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): 1198-1211 (2023) - [j45]Reza Naserasr, Weiqiang Yu:
Packing Signatures in Signed Graphs. SIAM J. Discret. Math. 37(4): 2365-2381 (2023) - 2022
- [j44]Laurent Beaudou, Florent Foucaud, Reza Naserasr:
Smallest C2ℓ+1-critical graphs of odd-girth 2k+1. Discret. Appl. Math. 319: 564-575 (2022) - [j43]Reza Naserasr, Lan Anh Pham:
Complex and Homomorphic Chromatic Number of Signed Planar Simple Graphs. Graphs Comb. 38(3): 58 (2022) - [j42]Reza Naserasr, Lan Anh Pham, Zhouningxin Wang:
Density of C-4-critical signed graphs. J. Comb. Theory B 153: 81-104 (2022) - 2021
- [j41]Pierre Aboulker, Pierre Charbit, Reza Naserasr:
Extension of Gyárfás-Sumner Conjecture to Digraphs. Electron. J. Comb. 28(2): 2 (2021) - [j40]Reza Naserasr, Zhouningxin Wang, Xuding Zhu:
Circular Chromatic Number of Signed Graphs. Electron. J. Comb. 28(2): 2 (2021) - [j39]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: 74-89 (2021) - [j38]Reza Naserasr, Éric Sopena, Thomas Zaslavsky:
Homomorphisms of signed graphs: An update. Eur. J. Comb. 91: 103222 (2021) - [j37]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): 324-339 (2021) - 2020
- [j36]Clément Charpentier, Reza Naserasr, Éric Sopena:
Homomorphisms of Sparse Signed Graphs. Electron. J. Comb. 27(3): 3 (2020) - [j35]Meirun Chen, Reza Naserasr:
Homomorphisms of partial t-trees and edge-colorings of partial 3-trees. J. Comb. Theory B 145: 1-31 (2020) - 2019
- [j34]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: 40-51 (2019) - [j33]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: 54-65 (2019) - 2018
- [j32]Meirun Chen, Reza Naserasr:
The optimal routing of augmented cubes. Inf. Process. Lett. 136: 59-63 (2018) - [j31]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) - 2017
- [j30]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): 914-944 (2017) - [j29]Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr:
The complexity of tropical graph homomorphisms. Discret. Appl. Math. 229: 64-81 (2017) - [j28]Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr:
The complexity of signed graph and edge-coloured graph homomorphisms. Discret. Math. 340(2): 223-235 (2017) - [j27]Laurent Beaudou, Florent Foucaud, Reza Naserasr:
Homomorphism bounds and edge-colourings of K4-minor-free graphs. J. Comb. Theory B 124: 128-164 (2017) - [j26]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: 43-58 (2017) - 2016
- [j25]Zhicheng Gao, Brendan D. McKay, Reza Naserasr, Brett Stevens:
Bipartite edge partitions and the former Alon-Saks-Seymour conjecture. Australas. J Comb. 66: 211-228 (2016) - [j24]Ararat Harutyunyan, Reza Naserasr, Mirko Petrusevski, Riste Skrekovski, Qiang Sun:
Mapping planar graphs into the Coxeter graph. Discret. Math. 339(2): 839-849 (2016) - [j23]Reza Naserasr, Sagnik Sen, Qiang Sun:
Walk-Powers and Homomorphism Bounds of Planar Signed Graphs. Graphs Comb. 32(4): 1505-1519 (2016) - 2015
- [j22]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) - [j21]Laurent Beaudou, Reza Naserasr, Claude Tardif:
Homomorphisms of binary Cayley graphs. Discret. Math. 338(12): 2539-2544 (2015) - [j20]Reza Naserasr, Edita Rollová, Éric Sopena:
Homomorphisms of Signed Graphs. J. Graph Theory 79(3): 178-212 (2015) - 2013
- [j19]Reza Naserasr, Edita Rollová, Éric Sopena:
Homomorphisms of planar signed graphs to signed projective cubes. Discret. Math. Theor. Comput. Sci. 15(3): 1-12 (2013) - [j18]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): 463-473 (2013) - [j17]Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov:
Identifying Codes in Line Graphs. J. Graph Theory 73(4): 425-448 (2013) - [j16]Reza Naserasr:
Mapping Planar Graphs into Projective Cubes. J. Graph Theory 74(3): 249-259 (2013) - 2012
- [j15]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): 1-20 (2012) - 2011
- [j14]Mahdad Khatirinejad, Reza Naserasr, Mike Newman, Ben Seamone, Brett Stevens:
Digraphs are 2-Weight Choosable. Electron. J. Comb. 18(1) (2011) - [j13]Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov:
Extremal graphs for the identifying code problem. Eur. J. Comb. 32(4): 628-638 (2011) - [j12]Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov:
Edge identifying codes. Electron. Notes Discret. Math. 38: 343-348 (2011) - 2009
- [j11]Reza Naserasr, Yared Nigussie, Riste Skrekovski:
Homomorphisms of triangle-free graphs without a K5-minor. Discret. Math. 309(18): 5789-5798 (2009) - 2007
- [j10]Reza Naserasr:
Homomorphisms and edge-colourings of planar graphs. J. Comb. Theory B 97(3): 394-400 (2007) - [j9]Matt DeVos, Javad B. Ebrahimi, Mohammad Ghebleh, Luis A. Goddyn, Bojan Mohar, Reza Naserasr:
Circular Coloring the Plane. SIAM J. Discret. Math. 21(2): 461-465 (2007) - 2006
- [j8]Reza Naserasr, Yared Nigussie:
On a new reformulation of Hadwiger's conjecture. Discret. Math. 306(23): 3136-3139 (2006) - [j7]Reza Naserasr:
K5-Free bound for the class of planar graphs. Eur. J. Comb. 27(7): 1155-1158 (2006) - [j6]Reza Naserasr, Claude Tardif:
The chromatic covering number of a graph. J. Graph Theory 51(3): 199-204 (2006) - 2003
- [j5]Amir Daneshgar, Reza Naserasr:
On Some Parameters Related to Uniquely Vertex-Colourable Graphs and Defining Sets. Ars Comb. 69 (2003) - [j4]Reza Naserasr, Riste Skrekovski:
The Petersen graph is not 3-edge-colorable--a new proof. Discret. Math. 268(1-3): 325-326 (2003) - 2000
- [j3]Amir Daneshgar, Reza Naserasr:
On small uniquely vertex-colourable graphs and Xu's conjecture. Discret. Math. 223(1-3): 93-108 (2000) - 1999
- [j2]Gholamreza B. Khosrovshahi, Reza Naserasr:
Hypergraphical Codes Arising from Binary Trades. Des. Codes Cryptogr. 18(1/3): 183-186 (1999) - 1997
- [j1]Ebadollah S. Mahmoodian, Reza Naserasr, Manouchehr Zaker:
Defining sets in vertex colorings of graphs and latin rectangles. Discret. Math. 167-168: 451-460 (1997)
Conference and Workshop Papers
- 2021
- [c7]Florent Foucaud, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Petru Valicov:
Cliques in exact distance powers of graphs of given maximum degree. LAGOS 2021: 427-436 - 2020
- [c6]Laurent Beaudou, Florent Foucaud, Reza Naserasr:
Smallest C2l+1-Critical Graphs of Odd-Girth 2k+1. CALDAM 2020: 184-196 - [c5]Sophie Laplante, Reza Naserasr, Anupa Sunny:
Sensitivity Lower Bounds from Linear Dependencies. MFCS 2020: 62:1-62:14 - 2017
- [c4]Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr:
A New Graph Parameter to Measure Linearity. COCOA (2) 2017: 154-168 - 2016
- [c3]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 - 2015
- [c2]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: 456-471 - 2014
- [c1]Florent Foucaud, Reza Naserasr:
The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction. LATIN 2014: 526-537
Informal and Other Publications
- 2024
- [i16]Pierre Charbit, Geoffroy Couteau, Pierre Meyer, Reza Naserasr:
A Note on Low-Communication Secure Multiparty Computation via Circuit Depth-Reduction. IACR Cryptol. ePrint Arch. 2024: 1473 (2024) - 2023
- [i15]Anna Gujgiczer, Reza Naserasr, Rohini S, S. Taruni:
Winding number and circular 4-coloring of signed graphs. CoRR abs/2307.04652 (2023) - [i14]Andrea Jiménez, Jessica McDonald, Reza Naserasr, Kathryn Nurse, Daniel A. Quiroz:
Balanced-chromatic number and Hadwiger-like conjectures. CoRR abs/2308.01242 (2023) - 2020
- [i13]Florent Foucaud, Hervé Hocquard, Suchismita Mishra, Narayanan Narayanan, Reza Naserasr, Éric Sopena, Petru Valicov:
Exact square coloring of subcubic planar graphs. CoRR abs/2009.00843 (2020) - [i12]Pierre Aboulker, Pierre Charbit, Reza Naserasr:
Extension of Gyarfas-Sumner conjecture to digraphs. CoRR abs/2009.13319 (2020) - [i11]Sophie Laplante, Reza Naserasr, Anupa Sunny:
Sensitivity lower bounds from linear dependencies. Electron. Colloquium Comput. Complex. TR20 (2020) - 2017
- [i10]Pierre Charbit, Michel Habib, Lalla Mouatadid, Reza Naserasr:
Towards A Unified View of Linear Structure on Graph Classes. CoRR abs/1702.02133 (2017) - 2016
- [i9]Florent Foucaud, Ararat Harutyunyan, Pavol Hell, Sylvain Legay, Yannis Manoussakis, Reza Naserasr:
The complexity of tropical graph homomorphisms. CoRR abs/1607.04777 (2016) - [i8]Laurent Beaudou, Florent Foucaud, Reza Naserasr:
Homomorphism bounds and edge-colourings of K4-minor-free graphs. CoRR abs/1610.03999 (2016) - 2015
- [i7]Reza Naserasr, Sagnik Sen, Qiang Sun:
Walk-powers and homomorphism bound of planar graphs. CoRR abs/1501.05089 (2015) - [i6]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 abs/1507.08164 (2015) - [i5]Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr:
The complexity of signed graph and 2-edge-coloured graph homomorphisms. CoRR abs/1510.05502 (2015) - 2014
- [i4]Florent Foucaud, George B. Mertzios, Reza Naserasr, Aline Parreau, Petru Valicov:
Identification, location-domination and metric dimension on interval and permutation graphs. CoRR abs/1405.2424 (2014) - 2011
- [i3]Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov:
Identifying codes in line graphs. CoRR abs/1107.0207 (2011) - 2010
- [i2]Florent Foucaud, Eleonora Guerrini, Matjaz Kovse, Reza Naserasr, Aline Parreau, Petru Valicov:
Extremal graphs for the identifying code problem. CoRR abs/1004.5230 (2010) - [i1]Florent Foucaud, Reza Naserasr, Aline Parreau:
Extremal problems on identifying codes in digraphs and Bondy's theorem on induced subsets. CoRR abs/1010.2985 (2010)
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-10-07 02:31 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:
