3-Designs from PGL(2, q). - Peter J. Cameron; G. R. Omidi; Behruz Tayfeh-Rezaie (Electron. J. Comb., 2006)

3-Designs from PSL(2, q). - Peter J. Cameron; Hamid Reza Maimani; G. R. Omidi; Behruz Tayfeh-Rezaie (Discret. Math., 2006)

3-Designs with block size 6 from PSL(2, q) and their large sets. - G. R. Omidi; Mohammad Reza Pournaki; Behruz Tayfeh-Rezaie (Discret. Math., 2007)

On graphs with largest Laplacian eigenvalue at most 4. - G. R. Omidi (Australas. J Comb., 2009)

On the Nullity of Bipartite Graphs. - G. R. Omidi (Graphs Comb., 2009)

On Integral Graphs with Few Cycles. - G. R. Omidi (Graphs Comb., 2009)

Large sets of t-designs from t-homogeneous groups. - Reinhard Laue; Gholam Reza Omidi; Behruz Tayfeh-Rezaie (Ars Comb., 2010)

3-Designs and Large Sets of PSL(2, 2n) with Block Sizes 6. - G. R. Omidi (Ars Comb., 2010)

The characterization of graphs with the largest Laplacian eigenvalue at most 5+sqrt(13)/2. - G. R. Omidi (Ars Comb., 2010)

The spectral characterization of graphs of index less than 2 with no Zn as a component. - G. R. Omidi; Khosro Tajbakhsh (Ars Comb., 2010)

On Multicolor Ramsey Number of Paths Versus Cycles. - Gholam Reza Omidi; Ghaffar Raeisi (Electron. J. Comb., 2011)

A note on the Ramsey number of stars - Complete graphs. - Gholam Reza Omidi; Ghaffar Raeisi (Eur. J. Comb., 2011)

A Note on Group Choosability of Graphs with Girth at least 4. - G. R. Omidi (Graphs Comb., 2011)

A generalization of Ramsey theory for linear forests. - Amir Khamseh; G. R. Omidi (Int. J. Comput. Math., 2012)

The Ramsey Number of Loose Paths in 3-Uniform Hypergraphs. - Leila Maherani; Gholam Reza Omidi; Ghaffar Raeisi; Maryam Shahsiah (Electron. J. Comb., 2013)

On Group Choosability of Total Graphs. - Hong-Jian Lai; G. R. Omidi; Ghaffar Raeisi (Graphs Comb., 2013)

Strongly walk-regular graphs. - Edwin R. van Dam; G. R. Omidi (J. Comb. Theory A, 2013)

On Group Choosability of Graphs, II. - H. Chuang; Hong-Jian Lai; G. R. Omidi; K. Wang; Niloufar Zakeri (Graphs Comb., 2014)

Ramsey numbers of 3-uniform loose paths and loose cycles. - G. R. Omidi; Maryam Shahsiah (J. Comb. Theory A, 2014)

On Three-Color Ramsey Number of Paths. - Leila Maherani; G. R. Omidi; Ghaffar Raeisi; Maryam Shahsiah (Graphs Comb., 2015)

On group choosability of graphs, I. - H. Chuang; Hong-Jian Lai; G. R. Omidi; Niloufar Zakeri (Ars Comb., 2016)

Minimum Cuts of Distance-Regular Digraphs. - Saleh Ashkboos; Gholam Reza Omidi; Fateme Shafiei; Khosro Tajbakhsh (Electron. J. Comb., 2017)

Ramsey numbers of 4-uniform loose cycles. - G. R. Omidi; Maryam Shahsiah (Discret. Appl. Math., 2017)

Monochromatic Hamiltonian Berge-cycles in colored hypergraphs. - Leila Maherani; Gholam Reza Omidi (Discret. Math., 2017)

Ramsey numbers of uniform loose paths and cycles. - G. R. Omidi; Maryam Shahsiah (Discret. Math., 2017)

Diagonal Ramsey Numbers of Loose Cycles in Uniform Hypergraphs. - G. R. Omidi; Maryam Shahsiah (SIAM J. Discret. Math., 2017)

Stars versus stripes Ramsey numbers. - G. R. Omidi; Ghaffar Raeisi; Zahra Rahimi (Eur. J. Comb., 2018)

Decomposition of complete uniform multi-hypergraphs into Berge paths and cycles. - Ramin Javadi; Afsaneh Khodadadpour; Gholam Reza Omidi (J. Graph Theory, 2018)

On a Question of Erdös and Faudree on the Size Ramsey Numbers. - Ramin Javadi; Gholam Reza Omidi (SIAM J. Discret. Math., 2018)

On the Size-Ramsey Number of Cycles. - Ramin Javadi; Farideh Khoeini; G. R. Omidi; Alexey Pokrovskiy (Comb. Probab. Comput., 2019)

Size Ramsey numbers of stars versus cliques. - Meysam Miralaei; G. R. Omidi; Maryam Shahsiah (J. Graph Theory, 2019)

Ramsey Problems for Berge Hypergraphs. - Dániel Gerbner; Abhishek Methuku; Gholam Reza Omidi; Máté Vizer (SIAM J. Discret. Math., 2020)

A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles. - G. R. Omidi (Comb. Probab. Comput., 2021)

Ramsey-Turán type results for matchings in edge colored graphs. - Gholam Reza Omidi; Ghaffar Raeisi (Discret. Math., 2024)

Ramsey Numbers for Multiple Copies of Hypergraphs. - Gholam Reza Omidi; Ghaffar Raeisi (Graphs Comb., 2024)

Galaxy Codes: Advancing Achievability for Deterministic Identification via Gaussian Channels. - Holger Boche; Christian Deppe; Safieh Mahmoodi; Gholam Reza Omidi (CoRR, 2025)