Hossein Hajiabolhassan

Publication Activity (10 Years)

Years Active: 1997-2023
Publications (10 Years): 11

Top Topics

Subgraph Isomorphism

Johnson Lindenstrauss

Efficient Learning

Top Venues

J. Comb. Theory, Ser. A

J. Graph Theory

J. Comb. Theory, Ser. B

Publications

Hossein Hajiabolhassan, Zahra Taheri, Ali Hojatnia, Yavar Taheri Yeganeh
FunQG: Molecular Representation Learning via Quotient Graphs. J. Chem. Inf. Model. 63 (11) (2023)
Thomas Michel, Hossein Hajiabolhassan, Ronald Ortner
Regret Bounds for Satisficing in Multi-Armed Bandit Problems. Trans. Mach. Learn. Res. 2023 (2023)
Hossein Hajiabolhassan, Zahra Taheri, Ali Hojatnia, Yavar Taheri Yeganeh
FunQG: Molecular Representation Learning Via Quotient Graphs. CoRR (2022)
Meysam Alishahi, Hossein Hajiabolhassan
On the Chromatic Number of Matching Kneser Graphs. Comb. Probab. Comput. 29 (1) (2020)
Meysam Alishahi, Hossein Hajiabolhassan
On chromatic number and minimum cut. J. Comb. Theory, Ser. B 139 (2019)
Meysam Alishahi, Hossein Hajiabolhassan
A generalization of Gale's lemma. J. Graph Theory 88 (2) (2018)
Meysam Alishahi, Hossein Hajiabolhassan
Altermatic number of categorical product of graphs. Discret. Math. 341 (5) (2018)
Meysam Alishahi, Hossein Hajiabolhassan
Chromatic number of random Kneser hypergraphs. J. Comb. Theory, Ser. A 154 (2018)
Meysam Alishahi, Hossein Hajiabolhassan, Frédéric Meunier
Strengthening topological colorful results for graphs. Eur. J. Comb. 64 (2017)
Meysam Alishahi, Hossein Hajiabolhassan
Chromatic number via Turán number. Discret. Math. 340 (10) (2017)
Hossein Hajiabolhassan, Frédéric Meunier
Hedetniemi's conjecture for Kneser hypergraphs. J. Comb. Theory, Ser. A 143 (2016)
Meysam Alishahi, Hossein Hajiabolhassan
On the chromatic number of general Kneser hypergraphs. J. Comb. Theory, Ser. B 115 (2015)
Hossein Hajiabolhassan, Ali Taherkhani
On the Circular Chromatic Number of Graph Powers. J. Graph Theory 75 (1) (2014)
Hossein Hajiabolhassan, Farokhlagha Moazami
Some new bounds for cover-free families through biclique covers. Discret. Math. 312 (24) (2012)
Hossein Hajiabolhassan, Farokhlagha Moazami
Secure Frameproof Code Through Biclique Cover. Discret. Math. Theor. Comput. Sci. 14 (2) (2012)
Hossein Hajiabolhassan
A generalization of Kneser's conjecture. Discret. Math. 311 (23-24) (2011)
Hossein Hajiabolhassan
On the b-chromatic number of Kneser graphs. Discret. Appl. Math. 158 (3) (2010)
Meysam Alishahi, Hossein Hajiabolhassan, Ali Taherkhani
A generalization of the Erdös-Ko-Rado theorem. Discret. Math. 310 (1) (2010)
Hossein Hajiabolhassan, Farokhlagha Moazami
Some New Bounds For Cover-Free Families Through Biclique Cover. CoRR (2010)
Amir Daneshgar, Hossein Hajiabolhassan, Ramin Javadi
On the isoperimetric spectrum of graphs and its approximations. J. Comb. Theory, Ser. B 100 (4) (2010)
Amir Daneshgar, Hossein Hajiabolhassan, Siamak Taati
On The Complexity Of Unique List Colourability And The Fixing Number Of Graphs. Ars Comb. 97 (2010)
Hossein Hajiabolhassan, Abbas Cheraghi
Bounds for visual cryptography schemes. Discret. Appl. Math. 158 (6) (2010)
Meysam Alishahi, Hossein Hajiabolhassan
Circular coloring and Mycielski construction. Discret. Math. 310 (10-11) (2010)
Hossein Hajiabolhassan, Ali Taherkhani
Graph Powers and Graph Homomorphisms. Electron. J. Comb. 17 (1) (2010)
Hossein Hajiabolhassan
On colorings of graph powers. Discret. Math. 309 (13) (2009)
Amir Daneshgar, Hossein Hajiabolhassan
Density and power graphs in graph homomorphism problem. Discret. Math. 308 (17) (2008)
Amir Daneshgar, Hossein Hajiabolhassan, Navid Hamedazimi
On Connected Colourings of Graphs. Ars Comb. 89 (2008)
Amir Daneshgar, Hossein Hajiabolhassan
Circular colouring and algebraic no-homomorphism theorems. Eur. J. Comb. 28 (6) (2007)
Abbas Cheraghi, Hossein Hajiabolhassan
Lower Bound for Visual Cryptography Schemes CoRR (2007)
Amir Daneshgar, Hossein Hajiabolhassan, Nasrin Soltankhah
On defining numbers of circular complete graphs. Discret. Math. 307 (2) (2007)
Amir Daneshgar, Hossein Hajiabolhassan
Unique list-colourability and the fixing chromatic number of graphs. Discret. Appl. Math. 152 (1-3) (2005)
Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani
Tabular graphs and chromatic sum. Discret. Math. 304 (1-3) (2005)
Hossein Hajiabolhassan, Xuding Zhu
-Colourable Graphs of Bounded Maximum Degree. Graphs Comb. 20 (1) (2004)
Hossein Hajiabolhassan, Xuding Zhu
Circular chromatic number of Kneser graphs. J. Comb. Theory, Ser. B 88 (2) (2003)
Amir Daneshgar, Hossein Hajiabolhassan
Graph homomorphisms through random walks. J. Graph Theory 44 (1) (2003)
Hossein Hajiabolhassan, Xuding Zhu
Circular chromatic number and Mycielski construction. J. Graph Theory 44 (2) (2003)
Hossein Hajiabolhassan, Xuding Zhu
Circular chromatic number of subgraphs. J. Graph Theory 44 (2) (2003)
Yashar Ganjali, Mohammad Ghebleh, Hossein Hajiabolhassan, M. Mirzazadeh, Sayyed Bashir Sadjad
Uniquely 2-list colorable graphs. Discret. Appl. Math. 119 (3) (2002)
Amir Daneshgar, Hossein Hajiabolhassan
Random Walks and Graph Homomorphisms. Graphs, Morphisms and Statistical Physics (2001)
Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani
Minimal coloring and strength of graphs. Discret. Math. 215 (2000)
Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani
A Note on the Hall-Condition Number of a Graph. Ars Comb. 55 (2000)
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) (1999)
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 (1998)
Hossein Hajiabolhassan, Mojtaba L. Mehrabadi
On clique polynomials. Australas. J Comb. 18 (1998)
Saieed Akbari, Mehdi Behzad, Hossein Hajiabolhassan, Ebadollah S. Mahmoodian
Uniquely Total Colorable Graphs. Graphs Comb. 13 (4) (1997)