| On the computational complexity of the bipartizing matching problem | 0 | 0.34 | 2022 |
| Thinness of product graphs | 0 | 0.34 | 2022 |
| FPT and Kernelization Algorithms for the Induced Tree Problem. | 0 | 0.34 | 2021 |
| On Distance Graph Coloring Problems | 0 | 0.34 | 2021 |
| Modelling and solving the perfect edge domination problem | 0 | 0.34 | 2020 |
| The Complexity of Helly-B EPG Graph Recognition. | 0 | 0.34 | 2020 |
| Linear-time Algorithms for Eliminating Claws in Graphs | 0 | 0.34 | 2020 |
| Dijkstra Graphs. | 0 | 0.34 | 2019 |
| New BSP/CGM algorithms for spanning trees | 0 | 0.34 | 2019 |
| The Complexity of Helly-B EPG Graph Recognition. | 0 | 0.34 | 2019 |
| On the Geodetic Hull Number of Complementary Prisms. | 0 | 0.34 | 2018 |
| Perfect Edge Domination: Hard and Solvable Cases. | 1 | 0.35 | 2018 |
| On the resilience of canonical reducible permutation graphs. | 0 | 0.34 | 2018 |
| The convexity of induced paths of order three and applications: Complexity aspects. | 0 | 0.34 | 2018 |
| Decycling with a matching. | 2 | 0.64 | 2017 |
| On neighborhood-Helly graphs. | 0 | 0.34 | 2017 |
| Generalized threshold processes on graphs. | 0 | 0.34 | 2017 |
| Forbidden induced subgraphs for bounded p-intersection number | 0 | 0.34 | 2016 |
| Software control and intellectual property protection in cyber-physical systems. | 0 | 0.34 | 2016 |
| Distance geometry approach for special graph coloring problems. | 1 | 0.40 | 2016 |
| On the Complexity of the P3-Hull Number of the Cartesian Product of Graphs. | 0 | 0.34 | 2016 |
| The Maximum Number of Dominating Induced Matchings. | 0 | 0.34 | 2015 |
| The Graphs of Structured Programming. | 0 | 0.34 | 2015 |
| On f -Reversible Processes on Graphs | 0 | 0.34 | 2015 |
| On probe co-bipartite and probe diamond-free graphs. | 0 | 0.34 | 2015 |
| Graphs with Few P4's Under the Convexity of Paths of Order Three. | 0 | 0.34 | 2015 |
| A faster algorithm for the cluster editing problem on proper interval graphs | 0 | 0.34 | 2015 |
| Polynomial time algorithm for the k-in-a-tree problem on chordal graphs. | 0 | 0.34 | 2015 |
| Fair Fingerprinting Protocol for Attesting Software Misuses | 0 | 0.34 | 2015 |
| Efficient and Perfect domination on circular-arc graphs. | 2 | 0.40 | 2015 |
| On unit interval graphs with integer endpoints | 2 | 0.42 | 2015 |
| O(n) Time Algorithms for Dominating Induced Matching Problems. | 0 | 0.34 | 2014 |
| LAGOS'11: Sixth Latin American Algorithms, Graphs, and Optimization Symposium, Bariloche, Argentina - 2011. | 0 | 0.34 | 2014 |
| Graphs of interval count two with a given partition | 1 | 0.36 | 2014 |
| On Helly Hypergraphs with Variable Intersection Sizes. | 1 | 0.40 | 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 |
| Fast algorithms for some dominating induced matching problems | 5 | 0.50 | 2014 |
| The Arboreal Jump Number of an Order. | 0 | 0.34 | 2013 |
| Towards A Provably Resilient Scheme For Graph-Based Watermarking | 3 | 0.43 | 2013 |
| Isomorphism of graph classes related to the circular-ones property. | 16 | 1.01 | 2013 |
| Induced Decompositions of Graphs. | 1 | 0.38 | 2013 |
| Exact algorithms for dominating induced matchings | 6 | 0.53 | 2013 |
| On the geodetic Radon number of grids. | 5 | 0.98 | 2013 |
| Parallel transitive closure algorithm. | 1 | 0.35 | 2013 |
| On Minimal and Minimum Hull Sets. | 3 | 0.41 | 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 |
| An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching. | 6 | 0.50 | 2013 |
| Towards a provably robust graph-based watermarking scheme | 0 | 0.34 | 2013 |
