| Complexity aspects of ℓ-chord convexities. | 0 | 0.34 | 2020 |
| Partial immunization of trees | 0 | 0.34 | 2020 |
| Computing the hull number in Δ-convexity. | 0 | 0.34 | 2020 |
| On the Computational Complexity of the Helly Number in the and Related Convexities. | 0 | 0.34 | 2019 |
| Computing the hull number in toll convexity. | 0 | 0.34 | 2019 |
| The Hull Number in the Convexity of Induced Paths of Order 3. | 0 | 0.34 | 2019 |
| A computational study of f-reversible processes on graphs. | 0 | 0.34 | 2018 |
| Inapproximability results and bounds for the Helly and Radon numbers of a graph. | 0 | 0.34 | 2017 |
| The Geodetic Hull Number is Hard for Chordal Graphs. | 2 | 0.38 | 2017 |
| Geodetic convexity parameters for (q, q-4)-graphs. | 0 | 0.34 | 2017 |
| The maximum infection time in the geodesic and monophonic convexities. | 3 | 0.44 | 2016 |
| On the geodetic iteration number of distance-hereditary graphs | 0 | 0.34 | 2016 |
| Geodetic Convexity Parameters for Graphs with Few Short Induced Paths. | 0 | 0.34 | 2016 |
| On the geodetic hull number of Pk-free graphs. | 5 | 0.50 | 2016 |
| Computing role assignments of split graphs. | 3 | 0.44 | 2016 |
| Algorithms and Properties for Positive Symmetrizable Matrices. | 0 | 0.34 | 2015 |
| The maximum time of 2-neighbour bootstrap percolation: Algorithmic aspects. | 8 | 0.62 | 2015 |
| Robust recoverable perfect matchings | 2 | 0.41 | 2015 |
| On f -Reversible Processes on Graphs | 0 | 0.34 | 2015 |
| Complexity of determining the maximum infection time in the geodetic convexity | 0 | 0.34 | 2015 |
| On the hereditary ( p , q )-Helly property of hypergraphs, cliques, and bicliques | 0 | 0.34 | 2015 |
| Inapproximability results related to monophonic convexity | 5 | 0.44 | 2015 |
| On Helly Hypergraphs with Variable Intersection Sizes. | 1 | 0.40 | 2014 |
| Connected Greedy Colourings. | 0 | 0.34 | 2014 |
| The Carathéodory number of the P3 convexity of chordal graphs. | 2 | 0.36 | 2014 |
| Scheduling problem with multi-purpose parallel machines. | 1 | 0.39 | 2014 |
| Algorithmic aspects of Steiner convexity and enumeration of Steiner trees. | 1 | 0.35 | 2014 |
| Inapproximability Results for Graph Convexity Parameters. | 6 | 0.54 | 2013 |
| On the geodetic Radon number of grids. | 5 | 0.98 | 2013 |
| Polynomial time algorithm for the Radon number of grids in the geodetic convexity. | 0 | 0.34 | 2013 |
| Algorithmic and structural aspects of the P 3-Radon number. | 0 | 0.34 | 2013 |
| Geodetic sets and periphery. | 0 | 0.34 | 2013 |
| An upper bound on the P3-Radon number. | 4 | 0.50 | 2012 |
| Mixed unit interval graphs. | 4 | 0.56 | 2012 |
| On the Radon Number for P 3-Convexity. | 3 | 0.44 | 2012 |
| On the Carathéodory Number for the Convexity of Paths of Order Three. | 6 | 0.58 | 2012 |
| On finite convexity spaces induced by sets of paths in graphs | 4 | 0.45 | 2011 |
| Forbidden subgraphs and the Kőnig property. | 1 | 0.39 | 2011 |
| Convex Partitions of Graphs induced by Paths of Order Three | 9 | 0.62 | 2010 |
| Scheduling unit time jobs with integer release dates to minimize the weighted number of tardy jobs | 4 | 0.58 | 2009 |
| Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals | 3 | 0.42 | 2009 |
| Helly Property, Clique Graphs, Complementary Graph Classes, and Sandwich Problems | 7 | 0.52 | 2008 |
| Improved algorithms for recognizing p | 0 | 0.34 | 2008 |
| On the helly defect of a graph | 1 | 0.36 | 2001 |
