 | 2012 |
|---|
| 9 |       | Petteri Kaski,
Mahdad Khatirinejad,
Patric R. J. Östergård:
Steiner triple systems satisfying the 4-vertex condition.
Des. Codes Cryptography 62(3): 323-330 (2012) |
| 8 | | Mahdad Khatirinejad,
Reza Naserasr,
Mike Newman,
Ben Seamone,
Brett Stevens:
Vertex-colouring edge-weightings with two edge weights.
Discrete Mathematics & Theoretical Computer Science 14(1): 1-20 (2012) |
| 2011 |
|---|
| 7 | | Mahdad Khatirinejad,
Reza Naserasr,
Mike Newman,
Ben Seamone,
Brett Stevens:
Digraphs are 2-Weight Choosable.
Electr. J. Comb. 18(1): (2011) |
| 2009 |
|---|
| 6 | | Mahdad Khatirinejad,
Petr Lisonek:
Linear codes for high payload steganography.
Discrete Applied Mathematics 157(5): 971-981 (2009) |
| 2008 |
|---|
| 5 | | Mohammad Ghebleh,
Mahdad Khatirinejad:
Planarity of iterated line graphs.
Discrete Mathematics 308(1): 144-147 (2008) |
| 2006 |
|---|
| 4 | | Mahdad Khatirinejad,
Petr Lisonek:
Classification and Constructions of Complete Caps in Binary Spaces.
Des. Codes Cryptography 39(1): 17-31 (2006) |
| 3 | | Petr Lisonek,
Mahdad Khatirinejad:
Erratum for "A Family of Complete Caps in PG(n, 2)".
Des. Codes Cryptography 39(2): 307 (2006) |
| 2005 |
|---|
| 2 | | Petr Lisonek,
Mahdad Khatirinejad:
A Family of Complete Caps in PG(n, 2).
Des. Codes Cryptography 35(3): 259-270 (2005) |
| 1 | | Ebrahim Salehi,
Sin-Min Lee,
Mahdad Khatirinejad:
IC-Colorings and IC-Indices of graphs.
Discrete Mathematics 299(1-3): 297-310 (2005) |
Data released under the ODC-BY 1.0 license — See also our legal information page