default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRuzbeh Tusserkani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2018
[j14]Seyed Amir Malekpour
, Parsa Pakzad, Mohammad-Hadi Foroughmand-Araabi, Sama Goliaei, Ruzbeh Tusserkani, Bahram Goliaei, Mehdi Sadeghi:
Modeling the probability distribution of the bacterial burst size via a game-theoretic approach. J. Bioinform. Comput. Biol. 16(4): 1850012:1-1850012:22 (2018)- 2017
- [j13]Changiz Eslahchi, Hamid Reza Maimani, Rouzbeh Torabi, Ruzbeh Tusserkani:
Dynamical 2-domination in Graphs. Ars Comb. 134: 339-350 (2017) - 2016
- [j12]Changiz Eslahchi, Hamid Reza Maimani, Rouzbeh Torabi, Ruzbeh Tusserkani:
Proper Nearly Perfect Sets in Graphs. Ars Comb. 126: 143-156 (2016) - 2015
- [j11]Ali Sharifi-Zarchi, Mehdi Totonchi, Keynoush Khaloughi, Razieh Karamzadeh, Marcos J. Araúzo-Bravo, Hossein Baharvand, Ruzbeh Tusserkani, Hamid Pezeshk, Hamidreza Chitsaz, Mehdi Sadeghi:
Increased robustness of early embryogenesis through collective decision-making by key transcription factors. BMC Syst. Biol. 9: 23 (2015) - 2014
- [j10]Mahdi Heydari, Sayed-Amir Marashi, Ruzbeh Tusserkani, Mehdi Sadeghi:
Reconstruction of phylogenetic trees of prokaryotes using maximal common intervals. Biosyst. 124: 86-94 (2014) - 2012
- [i3]Hadi Poormohammadi, Changiz Eslahchi, Ruzbeh Tusserkani:
TripNet: A Heuristic Algorithm for Constructing Rooted Phylogenetic Networks from Triplets. CoRR abs/1201.3722 (2012) - 2011
- [i2]Ruzbeh Tusserkani, Changiz Eslahchi, Hadi Poormohammadi, Azin Azadi:
TripNet: A Method for Constructing Phylogenetic Networks from Triplets. CoRR abs/1104.4720 (2011)
2000 – 2009
- 2007
- [i1]Hamed Hatami, Ruzbeh Tusserkani:
On the Complexity of the Circular Chromatic Number. CoRR abs/cs/0701007 (2007) - 2005
- [j9]Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani:
Tabular graphs and chromatic sum. Discret. Math. 304(1-3): 11-22 (2005) - [j8]Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari, Hamed Hatami, Ruzbeh Tusserkani, Xuding Zhu:
Circular chromatic index of graphs of maximum degree 3. J. Graph Theory 49(4): 325-335 (2005) - 2004
- [j7]Hamed Hatami, Ruzbeh Tusserkani:
On the complexity of the circular chromatic number. J. Graph Theory 47(3): 226-230 (2004) - 2000
- [j6]Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani:
A Note on the Hall-Condition Number of a Graph. Ars Comb. 55 (2000) - [j5]Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani:
Minimal coloring and strength of graphs. Discret. Math. 215: 265-270 (2000) - [j4]Mohammad Taghi Hajiaghayi, Ebadollah S. Mahmoodian, Seyed Vahab Mirrokni, Amin Saberi, Ruzbeh Tusserkani:
On the simultaneous edge-coloring conjecture. Discret. Math. 216(1-3): 267-272 (2000) - [j3]Mohammad Mahdian, Ebadollah S. Mahmoodian, Amin Saberi, Mohammad R. Salavatipour, Ruzbeh Tusserkani:
On a conjecture of Keedwell and the cycle double cover conjecture. Discret. Math. 216(1-3): 287-292 (2000)
1990 – 1999
- 1999
- [j2]Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani, Manouchehr Zaker:
A characterization of uniquely vertex colorable graphs using minimal defining sets. Discret. Math. 199(1-3): 233-236 (1999) - 1998
- [j1]Changiz Eslahchi, Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani:
A counterexample for Hilton-Johnson's conjecture on list coloring of graphs. Australas. J Comb. 18: 127-132 (1998)
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-04-24 23:04 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:
