Hossein Hajiabolhassan

45 papers Journal 44Unranked 1
YearRankTypeTitle / Venue / Authors
2023 J jnl
FunQG: Molecular Representation Learning via Quotient Graphs.
J. Chem. Inf. Model.
Hossein Hajiabolhassan, Zahra Taheri, Ali Hojatnia, Yavar Taheri Yeganeh
2023 J jnl
Regret Bounds for Satisficing in Multi-Armed Bandit Problems.
Trans. Mach. Learn. Res.
Thomas Michel, Hossein Hajiabolhassan, Ronald Ortner
2022 J jnl
FunQG: Molecular Representation Learning Via Quotient Graphs.
CoRR
Hossein Hajiabolhassan, Zahra Taheri, Ali Hojatnia, Yavar Taheri Yeganeh
2020 J jnl
On the Chromatic Number of Matching Kneser Graphs.
Comb. Probab. Comput.
Meysam Alishahi, Hossein Hajiabolhassan
2019 J jnl
On chromatic number and minimum cut.
J. Comb. Theory B
Meysam Alishahi, Hossein Hajiabolhassan
2018 J jnl
A generalization of Gale's lemma.
J. Graph Theory
Meysam Alishahi, Hossein Hajiabolhassan
2018 J jnl
Altermatic number of categorical product of graphs.
Discret. Math.
Meysam Alishahi, Hossein Hajiabolhassan
2018 J jnl
Chromatic number of random Kneser hypergraphs.
J. Comb. Theory A
Meysam Alishahi, Hossein Hajiabolhassan
2017 J jnl
Chromatic number via Turán number.
Discret. Math.
Meysam Alishahi, Hossein Hajiabolhassan
2017 J jnl
Strengthening topological colorful results for graphs.
Eur. J. Comb.
Meysam Alishahi, Hossein Hajiabolhassan, Frédéric Meunier
2016 J jnl
Hedetniemi's conjecture for Kneser hypergraphs.
J. Comb. Theory A
Hossein Hajiabolhassan, Frédéric Meunier
2015 J jnl
On the chromatic number of general Kneser hypergraphs.
J. Comb. Theory B
Meysam Alishahi, Hossein Hajiabolhassan
2014 J jnl
On the Circular Chromatic Number of Graph Powers.
J. Graph Theory
Hossein Hajiabolhassan, Ali Taherkhani
2012 J jnl
Secure Frameproof Code Through Biclique Cover.
Discret. Math. Theor. Comput. Sci.
Hossein Hajiabolhassan, Farokhlagha Moazami
2012 J jnl
Some new bounds for cover-free families through biclique covers.
Discret. Math.
Hossein Hajiabolhassan, Farokhlagha Moazami
2011 J jnl
A generalization of Kneser's conjecture.
Discret. Math.
Hossein Hajiabolhassan
2010 J jnl
A generalization of the Erdös-Ko-Rado theorem.
Discret. Math.
Meysam Alishahi, Hossein Hajiabolhassan, Ali Taherkhani
2010 J jnl
Bounds for visual cryptography schemes.
Discret. Appl. Math.
Hossein Hajiabolhassan, Abbas Cheraghi
2010 J jnl
Circular coloring and Mycielski construction.
Discret. Math.
Meysam Alishahi, Hossein Hajiabolhassan
2010 J jnl
Graph Powers and Graph Homomorphisms.
Electron. J. Comb.
Hossein Hajiabolhassan, Ali Taherkhani
2010 J jnl
On The Complexity Of Unique List Colourability And The Fixing Number Of Graphs.
Ars Comb.
Amir Daneshgar, Hossein Hajiabolhassan, Siamak Taati
2010 J jnl
On the b-chromatic number of Kneser graphs.
Discret. Appl. Math.
Hossein Hajiabolhassan
2010 J jnl
On the isoperimetric spectrum of graphs and its approximations.
J. Comb. Theory B
Amir Daneshgar, Hossein Hajiabolhassan, Ramin Javadi
2010 J jnl
Some New Bounds For Cover-Free Families Through Biclique Cover.
CoRR
Hossein Hajiabolhassan, Farokhlagha Moazami
2009 J jnl
On colorings of graph powers.
Discret. Math.
Hossein Hajiabolhassan
2008 J jnl
Density and power graphs in graph homomorphism problem.
Discret. Math.
Amir Daneshgar, Hossein Hajiabolhassan
2008 J jnl
On Connected Colourings of Graphs.
Ars Comb.
Amir Daneshgar, Hossein Hajiabolhassan, Navid Hamedazimi
2007 J jnl
Circular colouring and algebraic no-homomorphism theorems.
Eur. J. Comb.
Amir Daneshgar, Hossein Hajiabolhassan
2007 J jnl
Lower Bound for Visual Cryptography Schemes
CoRR
Abbas Cheraghi, Hossein Hajiabolhassan
2007 J jnl
On defining numbers of circular complete graphs.
Discret. Math.
Amir Daneshgar, Hossein Hajiabolhassan, Nasrin Soltankhah
2005 J jnl
Tabular graphs and chromatic sum.
Discret. Math.
Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani
2005 J jnl
Unique list-colourability and the fixing chromatic number of graphs.
Discret. Appl. Math.
Amir Daneshgar, Hossein Hajiabolhassan
2004 J jnl
Sparse
Graphs Comb.
Hossein Hajiabolhassan, Xuding Zhu
2003 J jnl
Circular chromatic number and Mycielski construction.
J. Graph Theory
Hossein Hajiabolhassan, Xuding Zhu
2003 J jnl
Circular chromatic number of Kneser graphs.
J. Comb. Theory B
Hossein Hajiabolhassan, Xuding Zhu
2003 J jnl
Circular chromatic number of subgraphs.
J. Graph Theory
Hossein Hajiabolhassan, Xuding Zhu
2003 J jnl
Graph homomorphisms through random walks.
J. Graph Theory
Amir Daneshgar, Hossein Hajiabolhassan
2002 J jnl
Uniquely 2-list colorable graphs.
Discret. Appl. Math.
Yashar Ganjali, Mohammad Ghebleh, Hossein Hajiabolhassan, M. Mirzazadeh, Sayyed Bashir Sadjad
2001 — conf
Random Walks and Graph Homomorphisms.
Graphs, Morphisms and Statistical Physics
Amir Daneshgar, Hossein Hajiabolhassan
2000 J jnl
A Note on the Hall-Condition Number of a Graph.
Ars Comb.
Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani
2000 J jnl
Minimal coloring and strength of graphs.
Discret. Math.
Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani
1999 J jnl
A characterization of uniquely vertex colorable graphs using minimal defining sets.
Discret. Math.
Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani, Manouchehr Zaker
1998 J jnl
A counterexample for Hilton-Johnson's conjecture on list coloring of graphs.
Australas. J Comb.
Changiz Eslahchi, Hossein Hajiabolhassan, Mojtaba L. Mehrabadi, Ruzbeh Tusserkani
1998 J jnl
On clique polynomials.
Australas. J Comb.
Hossein Hajiabolhassan, Mojtaba L. Mehrabadi
1997 J jnl
Uniquely Total Colorable Graphs.
Graphs Comb.
Saieed Akbari, Mehdi Behzad, Hossein Hajiabolhassan, Ebadollah S. Mahmoodian