|
Search the dblp DataBase
Gholamreza B. Khosrovshahi:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Saeed Akbari, Gholamreza B. Khosrovshahi
On the smallest edge defining sets of graphs. [Citation Graph (0, 0)][DBLP] Ars Comb., 2002, v:63, n:, pp:- [Journal]
- Ziba Eslami, Gholamreza B. Khosrovshahi, M. Mohammad-Noori, Behruz Tayfeh-Rezaie
Some New 4-Designs. [Citation Graph (0, 0)][DBLP] Ars Comb., 2004, v:73, n:, pp:- [Journal]
- Abdolhossein Hoorfar, Gholamreza B. Khosrovshahi
On the existence of trades of large volumes. [Citation Graph (0, 0)][DBLP] Ars Comb., 2004, v:73, n:, pp:- [Journal]
- Abdolhossein Hoorfar, Gholamreza B. Khosrovshahi
On the nonexistence of Steiner t-(v, k) trades. [Citation Graph (0, 0)][DBLP] Ars Comb., 2005, v:75, n:, pp:- [Journal]
- Gholamreza B. Khosrovshahi, Hamid Reza Maimani
On 2-(v, 3) Steiner Trades of Small Volumes. [Citation Graph (0, 0)][DBLP] Ars Comb., 1999, v:52, n:, pp:- [Journal]
- Gholamreza B. Khosrovshahi, Rouzbeh Torabi
Maximal Trades. [Citation Graph (0, 0)][DBLP] Ars Comb., 1999, v:51, n:, pp:- [Journal]
- A. Sadam Hedayat, Gholamreza B. Khosrovshahi, Dibyen Majumdar
A Prospect for a General Method of Constructing t-Designs. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1993, v:42, n:1, pp:31-50 [Journal]
- Gholamreza B. Khosrovshahi, Hamid Reza Maimani, Rouzbeh Torabi
On Trades: An Update. [Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 1999, v:95, n:1-3, pp:361-376 [Journal]
- Ziba Eslami, Gholamreza B. Khosrovshahi, M. Mohammad-Noori
Enumeration of t-Designs Through Intersection Matrices. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2004, v:32, n:1-3, pp:185-191 [Journal]
- Gholamreza B. Khosrovshahi, Reza Naserasr
Hypergraphical Codes Arising from Binary Trades. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 1999, v:18, n:1/3, pp:183-186 [Journal]
- Gholamreza B. Khosrovshahi, A. Nowzari-Dalini, Rouzbeh Torabi
Trading Signed Designs and Some new 4-(12, 5, 4) Designs. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 1997, v:11, n:3, pp:279-288 [Journal]
- Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie
Some Indecomposable t-Designs. [Citation Graph (0, 0)][DBLP] Des. Codes Cryptography, 2004, v:32, n:1-3, pp:235-238 [Journal]
- Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie
Root cases of large sets of t-designs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2003, v:263, n:1-3, pp:143-155 [Journal]
- Richard A. Brualdi, A. Samad Hedayat, Hadi Kharaghani, Gholamreza B. Khosrovshahi, Shahriar Shahriari
Preface. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:23, pp:2989- [Journal]
- Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie
Large sets of t-designs through partitionable sets: A survey. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2006, v:306, n:23, pp:2993-3004 [Journal]
- Ziba Eslami, Gholamreza B. Khosrovshahi
Some New 6-(14, 7, 4) Designs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 2001, v:93, n:1, pp:141-152 [Journal]
- A. Sadam Hedayat, Gholamreza B. Khosrovshahi
An Algebraic Study of BIB Designs: a Complete Solution for v = 6 and k = 3. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1981, v:30, n:1, pp:43-52 [Journal]
- Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie
A New Proof of a Classical Theorem in Design Theory. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 2001, v:93, n:2, pp:391-396 [Journal]
- Gholamreza B. Khosrovshahi, S. Ajoodani-Namini
Combining t-designs. [Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. A, 1991, v:58, n:1, pp:26-34 [Journal]
- B. Kalantari, Gholamreza B. Khosrovshahi
Magic labeling in graphs: Bounds, complexity, and an application to a variant of TSP. [Citation Graph (0, 0)][DBLP] Networks, 1996, v:28, n:4, pp:211-219 [Journal]
- Gholamreza B. Khosrovshahi, S. Ajoodani-Namini
A New Basis for Trades. [Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1990, v:3, n:3, pp:364-372 [Journal]
- S. Ajoodani-Namini, Gholamreza B. Khosrovshahi
More on halving the complete designs. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1994, v:135, n:1-3, pp:29-37 [Journal]
Preface. [Citation Graph (, )][DBLP]
Classification of simple 2-(11, 3, 3) designs. [Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.280secs
|