| The Biclique Partitioning Polytope | 0 | 0.34 | 2021 |
| Vector Domination in split-indifference graphs | 0 | 0.34 | 2020 |
| -Hull Number of Graphs with Diameter Two. | 0 | 0.34 | 2019 |
| Genome Rearrangements on Multigenomic Models: Applications of Graph Convexity Problems. | 0 | 0.34 | 2019 |
| Width Parameterizations for Knot-Free Vertex Deletion on Digraphs. | 0 | 0.34 | 2019 |
| Deadlock resolution in wait-for graphs by vertex/arc deletion. | 1 | 0.35 | 2019 |
| On the hardness of finding the geodetic number of a subcubic graph. | 0 | 0.34 | 2018 |
| Cograph generation with linear delay. | 0 | 0.34 | 2018 |
| On the complete set packing and set partitioning polytopes: Properties and rank 1 facets. | 0 | 0.34 | 2018 |
| Decycling a graph by the removal of a matching: new algorithmic and structural aspects in some classes of graphs. | 0 | 0.34 | 2018 |
| A computational study of f-reversible processes on graphs. | 0 | 0.34 | 2018 |
| A matheuristic for the cell formation problem. | 2 | 0.36 | 2018 |
| Closure of genomic sets: applications of graph convexity to genome rearrangement problems. | 0 | 0.34 | 2018 |
| Algorithms, kernels and lower bounds for the Flood-It game parameterized by the vertex cover number. | 0 | 0.34 | 2018 |
| And/or-convexity: a graph convexity based on processes and deadlock models. | 0 | 0.34 | 2018 |
| Decycling a Graph by the Removal of a Matching: Characterizations for Special Classes. | 0 | 0.34 | 2017 |
| Tractability, hardness, and kernelization lower bound for and/or graph solution. | 0 | 0.34 | 2017 |
| Corrigendum to "Complexity analysis of P3-convexity problems on bounded-degree and planar graphs" [Theoret. Comput. Sci. 607 Part 1 (2015) 83-95]. | 0 | 0.34 | 2017 |
| Deletion Graph Problems Based on Deadlock Resolution. | 1 | 0.36 | 2017 |
| New Algorithms For The Minimum Coloring Cut Problem | 4 | 0.44 | 2017 |
| New heuristics for the Bicluster Editing Problem. | 0 | 0.34 | 2017 |
| On the geodetic iteration number of distance-hereditary graphs | 0 | 0.34 | 2016 |
| Efficient algorithms for cluster editing. | 9 | 0.53 | 2016 |
| Deadlock models in distributed computation: foundations, design, and computational complexity. | 1 | 0.35 | 2016 |
| A Parallel Hybrid Metaheuristic For Bicluster Editing | 2 | 0.36 | 2016 |
| Adaptive event sensing in networks of autonomous mobile agents | 0 | 0.34 | 2015 |
| Robust recoverable perfect matchings | 2 | 0.41 | 2015 |
| Complexity of Geodetic Number Problem in Graphs with Maximum Degree 4. | 0 | 0.34 | 2015 |
| Complexity analysis of P-convexity problems on bounded-degree and planar graphs. | 1 | 0.36 | 2015 |
| A hybrid iterated local search and variable neighborhood descent heuristic applied to the cell formation problem | 4 | 0.42 | 2015 |
| Tractability and hardness of flood-filling games on trees | 2 | 0.39 | 2015 |
| Cycles in complementary prisms | 1 | 0.41 | 2015 |
| The Flood-It game parameterized by the vertex cover number | 0 | 0.34 | 2015 |
| On Helly Hypergraphs with Variable Intersection Sizes. | 1 | 0.40 | 2014 |
| An algorithmic analysis of Flood-it and Free-Flood-it on graph powers. | 4 | 0.42 | 2014 |
| Algorithmic aspects of Steiner convexity and enumeration of Steiner trees. | 1 | 0.35 | 2014 |
| On P 3-Convexity of Graphs with Bounded Degree. | 0 | 0.34 | 2014 |
| Clique cycle-transversals in distance-hereditary graphs | 0 | 0.34 | 2013 |
| Cycle transversals in perfect graphs and cographs | 6 | 0.58 | 2013 |
| Parameterized and/or graph solution. | 0 | 0.34 | 2013 |
| On (k, ℓ)-Graph Sandwich Problems. | 1 | 0.35 | 2013 |
| The predecessor-existence problem for k-reversible processes. | 0 | 0.34 | 2013 |
| On specifying boundary conditions for the graph sandwich problem. | 0 | 0.34 | 2013 |
| Clique cycle transversals in graphs with few P4's. | 0 | 0.34 | 2013 |
| Revisiting the Complexity of And/Or Graph Solution | 4 | 0.41 | 2013 |
| On solving manufacturing cell formation via Bicluster Editing. | 5 | 0.48 | 2013 |
| Matching Preclusion Number in Cartesian Product of Graphs and its Application to Interconnection Networks. | 2 | 0.38 | 2013 |
| An energy function and its application to the periodic behavior of k-reversible processes. | 1 | 0.48 | 2013 |
| Corrigendum to "Cycle transversals in perfect graphs and cographs" [Theoret. Comput. Sci. 469(2013) 15-23]. | 0 | 0.34 | 2013 |
| Parameterized Complexity of Flood-Filling Games on Trees. | 5 | 0.46 | 2013 |
