JOURNAL PAPERS
11. Maximal induced matchings in triangle-free graphs, (link)
With: Manu Basavaraju, Pinar Heggernes, Pim van ’t Hof, and Yngve Villanger,
J. Graph Theory (2015), doi: 10.1002/jgt.21994.
10. Computing the metric dimension for chain graphs, (link)
With: Henning Fernau, Pinar Heggernes, Pim van ’t Hof, Daniel Meister,
Information Processing Letters 115(9) (2015), 671 – 676.
9. Finding Disjoint Paths in Split Graphs, (link)
With: Pinar Heggernes, Pim van ’t Hof, and Erik Jan van Leeuwen,
Theory of Computing Systems 57(1) (2015), 140 – 159.
8. Graph classes and Ramsey numbers, (link)
With: Rmy Belmonte, Pinar Heggernes, Pim van ’t Hof, and Arash Rafiey,
Discrete Applied Mathematics 173 (2014), 16 – 27.
7. Subset feedback vertex sets in chordal graphs, (link)
With: Petr Golovach, Pinar Heggernes, and Dieter Kratsch,
Journal of Discrete Algorithms 26 (2014), 7 – 15.
6. Signed edge k-subdomination numbers in graphs, (link)
With: A. Khodkar, and S.M. Sheikholeslami,
Ars Combinatoria 109 (2013), 129 – 141.
5. Minus edge k-subdomination number of a graph, (link)
With: A.N. Ghameshlou, and S.M. Sheikholeslami,
AKCE International Journal of Graphs and Combinatorics 8 (2011), 1 – 11.
4. Signed (b,k)-matchings in graphs, (link)
With: A.N. Ghameshlou, S.M. Sheikholeslami, and L. Volkmann,
An. S ¸t. Univ. Ovidius Constant ¸a 18 (2010), 127 – 138.
3. Signed (b,k)-edge covers in graphs, (link)
With: A.N. Ghameshlou, A. Khodkar, and S.M. Sheikholeslami,
Intelligent Information Management 2 (2010), 143 – 148.
2. Negative k-subdecision number of a graph, (link)
With: A.N. Ghameshlou, A. Khodkar, and S.M. Sheikholeslami,
AKCE International Journal of Graphs and Combinatorics 6 (2009), 361 – 371.
1. Signed star k-subdomination numbers in graphs, (link)
With: S.M. Sheikholeslami,
Discrete Applied Mathematics 156 (2008), 3066 – 3070.
With: Manu Basavaraju, Pinar Heggernes, Pim van ’t Hof, and Yngve Villanger,
J. Graph Theory (2015), doi: 10.1002/jgt.21994.
10. Computing the metric dimension for chain graphs, (link)
With: Henning Fernau, Pinar Heggernes, Pim van ’t Hof, Daniel Meister,
Information Processing Letters 115(9) (2015), 671 – 676.
9. Finding Disjoint Paths in Split Graphs, (link)
With: Pinar Heggernes, Pim van ’t Hof, and Erik Jan van Leeuwen,
Theory of Computing Systems 57(1) (2015), 140 – 159.
8. Graph classes and Ramsey numbers, (link)
With: Rmy Belmonte, Pinar Heggernes, Pim van ’t Hof, and Arash Rafiey,
Discrete Applied Mathematics 173 (2014), 16 – 27.
7. Subset feedback vertex sets in chordal graphs, (link)
With: Petr Golovach, Pinar Heggernes, and Dieter Kratsch,
Journal of Discrete Algorithms 26 (2014), 7 – 15.
6. Signed edge k-subdomination numbers in graphs, (link)
With: A. Khodkar, and S.M. Sheikholeslami,
Ars Combinatoria 109 (2013), 129 – 141.
5. Minus edge k-subdomination number of a graph, (link)
With: A.N. Ghameshlou, and S.M. Sheikholeslami,
AKCE International Journal of Graphs and Combinatorics 8 (2011), 1 – 11.
4. Signed (b,k)-matchings in graphs, (link)
With: A.N. Ghameshlou, S.M. Sheikholeslami, and L. Volkmann,
An. S ¸t. Univ. Ovidius Constant ¸a 18 (2010), 127 – 138.
3. Signed (b,k)-edge covers in graphs, (link)
With: A.N. Ghameshlou, A. Khodkar, and S.M. Sheikholeslami,
Intelligent Information Management 2 (2010), 143 – 148.
2. Negative k-subdecision number of a graph, (link)
With: A.N. Ghameshlou, A. Khodkar, and S.M. Sheikholeslami,
AKCE International Journal of Graphs and Combinatorics 6 (2009), 361 – 371.
1. Signed star k-subdomination numbers in graphs, (link)
With: S.M. Sheikholeslami,
Discrete Applied Mathematics 156 (2008), 3066 – 3070.
SUBMITTED JOURNAL PAPERS
1. Covering the edges of bipartite graphs by cycles of length 4,
With: Henning Fernau, Pinar Heggernes, and Daniel Meister.
With: Henning Fernau, Pinar Heggernes, and Daniel Meister.
CONFERENCE PAPERS
4. Maximal induced matchings in triangle-free graphs, (link)
With: Manu Basavaraju, Pinar Heggernes, Pim van ’t Hof, and Yngve Villanger,
WG 2014, LNCS 8747: 93-104, Springer.
3. Finding Disjoint Paths in Split Graphs, (link)
With: Pinar Heggernes, Pim van ’t Hof, and Erik Jan van Leeuwen,
SOFSEM 2014, LNCS 8327: 315-326, Springer.
2. An exact algorithm for Subset Feedback Vertex Set on chordal graphs, (link)
With: Petr Golovach, Pinar Heggernes, and Dieter Kratsch,
IPEC 2012, LNCS 7535: 85 - 96, Springer.
1. Ramsey numbers for line graphs and perfect graphs, (link)
With: Remy Belmonte, Pinar Heggernes, and Pim van ’t Hof,
COCOON 2012, (Best Paper Award), LNCS 7434: 204 - 215, Springer.
With: Manu Basavaraju, Pinar Heggernes, Pim van ’t Hof, and Yngve Villanger,
WG 2014, LNCS 8747: 93-104, Springer.
3. Finding Disjoint Paths in Split Graphs, (link)
With: Pinar Heggernes, Pim van ’t Hof, and Erik Jan van Leeuwen,
SOFSEM 2014, LNCS 8327: 315-326, Springer.
2. An exact algorithm for Subset Feedback Vertex Set on chordal graphs, (link)
With: Petr Golovach, Pinar Heggernes, and Dieter Kratsch,
IPEC 2012, LNCS 7535: 85 - 96, Springer.
1. Ramsey numbers for line graphs and perfect graphs, (link)
With: Remy Belmonte, Pinar Heggernes, and Pim van ’t Hof,
COCOON 2012, (Best Paper Award), LNCS 7434: 204 - 215, Springer.
THESES
2. Algorithmic and combinatorial problems on graph classes.
PhD dissertation, University of Bergen, 2015.
1. Majority Domination Number in Graphs.
Master dissertation, Azarbaijan Shahid Madani University, 2008. (in Persian)
PhD dissertation, University of Bergen, 2015.
1. Majority Domination Number in Graphs.
Master dissertation, Azarbaijan Shahid Madani University, 2008. (in Persian)
OTHER PUBLICATIONS
1. Maximal induced matchings in triangle-free graphs, (link)
With: Manu Basavaraju, Pinar Heggernes, Pim van ’t Hof, and Yngve Villanger,
Arxiv: CoRR abs/1312.5180 (2013).
With: Manu Basavaraju, Pinar Heggernes, Pim van ’t Hof, and Yngve Villanger,
Arxiv: CoRR abs/1312.5180 (2013).