default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDGholamreza B. Khosrovshahi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j33]M. H. Ahmadi, N. Akhlaghinia, Gholamreza B. Khosrovshahi
, S. Sadri:
New partitionings of complete designs. Des. Codes Cryptogr. 89(12): 2715-2723 (2021)- [j32]Hossein Esmailian, Ebrahim Ghorbani, Samira Hossein Ghorban, Gholamreza B. Khosrovshahi:
Maximal graphs with respect to rank. Discret. Math. 344(1): 112191 (2021) - 2020
- [j31]Ebrahim Ghorbani, Sara Kamali, Gholamreza B. Khosrovshahi, Denis S. Krotov:
On the Volumes and Affine Types of Trades. Electron. J. Comb. 27(1): 1 (2020)
2010 – 2019
- 2014
- [j30]M. H. Ahmadi, N. Akhlaghinia, Gholamreza B. Khosrovshahi, Ch. Maysoori:
More on the Wilson $W_{tk}(v)$ Matrices. Electron. J. Comb. 21(2): 2 (2014) - 2013
- [j29]Mohammad Reza Faghihi, Ebrahim Ghorbani, Gholamreza B. Khosrovshahi, S. Tat:
On Optimality of Designs with Three Distinct Eigenvalues. Electron. J. Comb. 20(2): 16 (2013) - 2012
- [j28]Saieed Akbari, Narges Ghareghani, Gholamreza B. Khosrovshahi, Sanaz Zare:
A Note on Zero-Sum 5-Flows in Regular Graphs. Electron. J. Comb. 19(2): 7 (2012)
2000 – 2009
- 2009
- [j27]Jeffrey H. Dinitz, Hadi Kharaghani, Gholamreza B. Khosrovshahi, Shahriar Shahriari:
Preface. Discret. Math. 309(3): 513-514 (2009) - [j26]Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie:
Classification of simple 2-(11, 3, 3) designs. Discret. Math. 309(3): 515-520 (2009) - 2008
- [j25]Ebrahim Ghorbani, Gholamreza B. Khosrovshahi, Ch. Maysoori, Morteza Mohammad Noori:
Inclusion matrices and chains. J. Comb. Theory A 115(5): 878-887 (2008) - 2006
- [j24]Richard A. Brualdi, A. Samad Hedayat, Hadi Kharaghani, Gholamreza B. Khosrovshahi, Shahriar Shahriari:
Preface. Discret. Math. 306(23): 2989 (2006) - [j23]Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie:
Large sets of t-designs through partitionable sets: A survey. Discret. Math. 306(23): 2993-3004 (2006) - 2005
- [j22]Abdolhossein Hoorfar, Gholamreza B. Khosrovshahi:
On the nonexistence of Steiner t-(v, k) trades. Ars Comb. 75 (2005) - 2004
- [j21]Ziba Eslami, Gholamreza B. Khosrovshahi, Morteza Mohammad Noori, Behruz Tayfeh-Rezaie:
Some New 4-Designs. Ars Comb. 73 (2004) - [j20]Abdolhossein Hoorfar, Gholamreza B. Khosrovshahi:
On the existence of trades of large volumes. Ars Comb. 73 (2004) - [j19]Ziba Eslami, Gholamreza B. Khosrovshahi, Morteza Mohammad Noori:
Enumeration of t-Designs Through Intersection Matrices. Des. Codes Cryptogr. 32(1-3): 185-191 (2004) - [j18]Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie:
Some Indecomposable t-Designs. Des. Codes Cryptogr. 32(1-3): 235-238 (2004) - 2003
- [j17]Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie:
Root cases of large sets of t-designs. Discret. Math. 263(1-3): 143-155 (2003) - 2002
- [j16]Saeed Akbari, Gholamreza B. Khosrovshahi:
On the smallest edge defining sets of graphs. Ars Comb. 63 (2002) - [e1]Gholamreza B. Khosrovshahi, Ali Shokoufandeh, Mohammad Amin Shokrollahi:
Theoretical Aspects of Computer Science, Advanced Lectures (First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000). Lecture Notes in Computer Science 2292, Springer 2002, ISBN 3-540-43328-7 [contents] - 2001
- [j15]Ziba Eslami, Gholamreza B. Khosrovshahi:
Some New 6-(14, 7, 4) Designs. J. Comb. Theory A 93(1): 141-152 (2001) - [j14]Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie:
A New Proof of a Classical Theorem in Design Theory. J. Comb. Theory A 93(2): 391-396 (2001)
1990 – 1999
- 1999
- [j13]Gholamreza B. Khosrovshahi, Hamid Reza Maimani, Rouzbeh Torabi:
Classification of simple 2-(6, 3) and 2-(7, 3) trades. Australas. J Comb. 19: 55-72 (1999) - [j12]Gholamreza B. Khosrovshahi, Rouzbeh Torabi:
Maximal Trades. Ars Comb. 51 (1999) - [j11]Gholamreza B. Khosrovshahi, Hamid Reza Maimani:
On 2-(v, 3) Steiner Trades of Small Volumes. Ars Comb. 52 (1999) - [j10]Gholamreza B. Khosrovshahi, Hamid Reza Maimani, Rouzbeh Torabi:
On Trades: An Update. Discret. Appl. Math. 95(1-3): 361-376 (1999) - [j9]Gholamreza B. Khosrovshahi, Reza Naserasr:
Hypergraphical Codes Arising from Binary Trades. Des. Codes Cryptogr. 18(1/3): 183-186 (1999) - 1997
- [j8]Gholamreza B. Khosrovshahi, Hamid Reza Maimani:
Smallest defining sets for 2-(10, 5, 4) designs. Australas. J Comb. 15: 31-36 (1997) - [j7]Gholamreza B. Khosrovshahi, Abbas Nowzari-Dalini, Rouzbeh Torabi:
Trading Signed Designs and Some new 4-(12, 5, 4) Designs. Des. Codes Cryptogr. 11(3): 279-288 (1997) - 1996
- [j6]Bahman Kalantari, Gholamreza B. Khosrovshahi:
Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP. Networks 28(4): 211-219 (1996) - 1994
- [j5]S. Ajoodani-Namini, Gholamreza B. Khosrovshahi:
More on halving the complete designs. Discret. Math. 135(1-3): 29-37 (1994) - 1993
- [j4]A. Sadam Hedayat, Gholamreza B. Khosrovshahi, Dibyen Majumdar:
A Prospect for a General Method of Constructing t-Designs. Discret. Appl. Math. 42(1): 31-50 (1993) - 1991
- [j3]Gholamreza B. Khosrovshahi, S. Ajoodani-Namini:
Combining t-designs. J. Comb. Theory A 58(1): 26-34 (1991) - 1990
- [j2]Gholamreza B. Khosrovshahi, S. Ajoodani-Namini:
A New Basis for Trades. SIAM J. Discret. Math. 3(3): 364-372 (1990)
1980 – 1989
- 1981
- [j1]A. Sadam Hedayat, Gholamreza B. Khosrovshahi:
An Algebraic Study of BIB Designs: a Complete Solution for v = 6 and k = 3. J. Comb. Theory A 30(1): 43-52 (1981)
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-06-10 21:20 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:
