Structural graph theory:

1. Graphs of Bounded Chordality, with A. Chaniotis and S. Spirkl.

2. On Separating Path and Tree Systems in Graphs, with A. Biniaz,  P. Bose, J. Carufel, A. Maheshwari, S. Odak, M. Smid, S. Smorodinsky, Y. Yuditsky.

3. Canonical trees of tree-decompositions, with J. Carmesin, M. Hamann,  JCTB, 152, 1-26.

4. A Stallings' type theorem for quasi-transitive graphs with M. Hamann, F. Lehner, T. Rühmann, JCTB, 157, 40-69.

5. Two-ended quasi-transitive graphs with T. Rühmann, Discrete Mathematics, Algorithms and Applications.

Hamiltonicity

1. Hamiltonicity of  Groups with Z_{p^n} as Commutator Subgroups, with S. Maghsoudi, F. Lehner.

2. On Vertex-Transitive Graphs with a Unique Hamiltonian Cycle, with D. Witte Morris. Journal of Graph Theory.

3. Hamiltonicity in Generalized Quasi-Dihedral Groups, with K. Stavropoulos.

4. Arc-Disjoint Hamiltonian Paths in Cartesian Product of Directed Cycles, with I. Darijani and D. Witte Morris, ARS Mathematica Contemporanea.

5. Hamilton Circles in Cayley Graphs with T. Rühmann, The Electronic Journal of Combinatorics 25 (2).

6. From cycles to circles in Cayley graphs with T. Rühmann.

Planar and non-planar graphs

1. Basis numbers of 1-planar graphs with S. Bazargani,  T. Biedl, P. Bose, A. Maheshwari, M. Smid.

2. Independence number of 1-planar graphs with T. Biedl and P. Bose, SWAT 2024.

3. On the d-independence number in 1-planar graphs, with T. Biedl and P. Bose

4. Basis numbers of bounded genus graphs with  F. Lehner.

Algorithm, Complexity and Optimization

1. Approximation for (k,l)-covers with A. Maheshwari, A. Madani.

2. On Scalable Data Structures for Keyword Base Community Search with A. Elrouby, A. Madani.

3. 
   

Infinite graph theory

1. Algebraic flow theory of infinite graphs with M.J. Moghadamzadeh, European Journal of Combinatorics 62, 58-69

2. Inverse Limits and Topologies of Infinite Graphs.

3. Canonical trees of tree-decompositions, with J. Carmesin, M. Hamann,  JCTB 152, 1-26.

4. A Stallings' type theorem for quasi-transitive graphs with M. Hamann, F. Lehner, T. Rühmann, JCTB, 157, 40-69.

5. Two-ended quasi-transitive graphs with T. Rühmann, Discrete mathematics, Algorithms and Applications.

Combinatorial group theory

1. Subgroups arising from connected components in the Morse boundary with A. Karrer and S. Zbinden.

2. Splitting groups with cubic Cayley graphs of connectivity two with K. Stavropoulos, Algebraic Combinatorics, 4, no. 6.

3. A Stallings' type theorem for quasi-transitive graphs with M. Hamann, F. Lehner, T. Rühmann, JCTB, 157, 40-69.

4. Two-ended quasi-transitive graphs with T. Rühmann, Discrete mathematics, Algorithms and Applications.

5. .Two characterisations of accessible quasi-transitive graphs with M. Hamann.

Graphs and Groups

1. Co-maximal graphs of two generators groups with R. Nikandish, Journal of Algebra and Its Applications.

2. Co-maximal Graphs of Subgroups of Groups with S. Akbari and R. Nikandish, Canadian Mathematical Bulletin 60 (1), 12-25

3. Integral of groups with K. Filom, Communications in Algebra 45 (3), 1105-1113.

4. Co-maximal ideal graphs of matrix algebras with R. Nikandish, Boletín de la Sociedad Matemática Mexicana 24 (1), 1-10

5. A note on infinite aS-groups with R. Nikandish Czechoslovak Mathematical Journal 65 (4), 1003-1009.

6. A note on co-maximal ideal graph of commutative rings with S. Akbari and R. Nikandish Ars Combinatoria, 134, 261–265.

Mathematics is the queen of the sciences and number theory is the queen of mathematics.

-Carl Friedrich Gauss