| Determining Equitable Total Chromatic Number For Infinite Classes Of Complete R-Partite Graphs | 0 | 0.34 | 2021 |
| Neighbour-distinguishing labellings of powers of paths and powers of cycles | 0 | 0.34 | 2020 |
| On the Computational Complexity of the Helly Number in the and Related Convexities. | 0 | 0.34 | 2019 |
| Equitable Total Chromatic Number of for Even. | 0 | 0.34 | 2019 |
| Equitable total coloring of complete r-partite p-balanced graphs | 0 | 0.34 | 2019 |
| A General Method for Forbidden Induced Subgraph Sandwich Problem NP-completeness. | 0 | 0.34 | 2019 |
| On the maximum number of minimum dominating sets in forests. | 0 | 0.34 | 2019 |
| Timber game as a counting problem | 0 | 0.34 | 2019 |
| On Adjacent-vertex-distinguishing Total Colourings of Powers of Cycles, Hypercubes and Lattice Graphs. | 0 | 0.34 | 2019 |
| On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers. | 0 | 0.34 | 2019 |
| On Caterpillars of Game Chromatic Number 4. | 0 | 0.34 | 2019 |
| Identifying simultaneous rearrangements in cancer genomes. | 0 | 0.34 | 2018 |
| Computational And Structural Analysis Of The Contour Of Graphs | 0 | 0.34 | 2018 |
| Dominating sets inducing large components in maximal outerplanar graphs. | 0 | 0.34 | 2018 |
| The partitioned probe problem: NP-complete versus polynomial dichotomy. | 0 | 0.34 | 2018 |
| The Solitaire Clobber game and correducibility. | 0 | 0.34 | 2017 |
| On star and biclique edge-colorings. | 0 | 0.34 | 2017 |
| Fast and Simple Jumbled Indexing for Binary Run-Length Encoded Strings. | 1 | 0.36 | 2017 |
| On Type 2 Snarks and Dot Products. | 0 | 0.34 | 2017 |
| Genomic distance with high indel costs. | 0 | 0.34 | 2017 |
| Fast and Simple Jumbled Indexing for Binary RLE Strings. | 0 | 0.34 | 2017 |
| Relating 2-rainbow domination to Roman domination. | 0 | 0.34 | 2017 |
| Sandwiches Missing Two Ingredients of Order Four. | 0 | 0.34 | 2017 |
| New Genome Similarity Measures based on Conserved Gene Adjacencies. | 1 | 0.37 | 2017 |
| The ( k , ℓ ) unpartitioned probe problem NP-complete versus polynomial dichotomy | 0 | 0.34 | 2016 |
| Strong Equality of Roman and Weak Roman Domination in Trees | 1 | 0.41 | 2016 |
| New Genome Similarity Measures Based on Conserved Gene Adjacencies. | 1 | 0.37 | 2016 |
| Dominating sets inducing large components. | 0 | 0.34 | 2016 |
| On the total coloring of generalized Petersen graphs | 2 | 0.43 | 2016 |
| On the equitable total chromatic number of cubic graphs | 1 | 0.48 | 2016 |
| Averaging 2-rainbow domination and Roman domination. | 1 | 0.36 | 2016 |
| Distance k-domination, distance k-guarding, and distance k-vertex cover of maximal outerplanar graphs. | 4 | 0.59 | 2015 |
| Timber Game with Caterpillars. | 0 | 0.34 | 2015 |
| The 1,2-Conjecture for powers of cycles | 1 | 0.36 | 2015 |
| Solitaire Clobber played on Cartesian product of graphs | 2 | 0.55 | 2015 |
| Asymptotic surviving rate of trees with multiple fire sources. | 0 | 0.34 | 2015 |
| The complexity of forbidden subgraph sandwich problems and the skew partition sandwich problem | 1 | 0.36 | 2015 |
| Graph-Theoretic Modelling of the Domain Chaining Problem. | 0 | 0.34 | 2015 |
| Biclique-colouring verification complexity and biclique-colouring power graphs | 2 | 0.38 | 2015 |
| Solitaire clobber on circulant graphs. | 1 | 0.41 | 2014 |
| Matchings in Graphs of Odd Regularity and Girth. | 1 | 0.37 | 2013 |
| DCJ-indel and DCJ-substitution distances with distinct operation costs. | 4 | 0.43 | 2013 |
| On total coloring and equitable total coloring of cubic graphs with large girth. | 0 | 0.34 | 2013 |
| The generalized split probe problem. | 1 | 0.37 | 2013 |
| Geodetic sets and periphery. | 0 | 0.34 | 2013 |
| More fires and more fighters | 16 | 0.74 | 2013 |
| DCJ-indel distance with distinct operation costs | 4 | 0.48 | 2012 |
| Biclique-colouring powers of paths and powers of cycles | 1 | 0.35 | 2012 |
| Gene clusters as intersections of powers of paths. | 2 | 0.49 | 2012 |
| 2K2-partition of some classes of graphs | 4 | 0.40 | 2012 |
