| Modelling and solving the perfect edge domination problem | 0 | 0.34 | 2020 |
| Perfect Edge Domination: Hard and Solvable Cases. | 1 | 0.35 | 2018 |
| Approximating weighted induced matchings. | 0 | 0.34 | 2018 |
| Approximating weighted neighborhood independent sets. | 0 | 0.34 | 2018 |
| On neighborhood-Helly graphs. | 0 | 0.34 | 2017 |
| Exact Algorithms for Minimum Weighted Dominating Induced Matching | 3 | 0.39 | 2017 |
| The Maximum Number of Dominating Induced Matchings. | 0 | 0.34 | 2015 |
| Approximation algorithms for clique transversals on some graph classes | 0 | 0.34 | 2015 |
| A faster algorithm for the cluster editing problem on proper interval graphs | 0 | 0.34 | 2015 |
| Efficient and Perfect domination on circular-arc graphs. | 2 | 0.40 | 2015 |
| On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size | 0 | 0.34 | 2015 |
| O(n) Time Algorithms for Dominating Induced Matching Problems. | 0 | 0.34 | 2014 |
| Fast algorithms for some dominating induced matching problems | 5 | 0.50 | 2014 |
| Isomorphism of graph classes related to the circular-ones property. | 16 | 1.01 | 2013 |
| Exact algorithms for dominating induced matchings | 6 | 0.53 | 2013 |
| Normal Helly circular-arc graphs and its subclasses | 8 | 0.50 | 2013 |
| An O *(1.1939 n ) Time Algorithm for Minimum Weighted Dominating Induced Matching. | 6 | 0.50 | 2013 |
| Subclasses of Normal Helly Circular-Arc Graphs | 5 | 0.42 | 2011 |
| Linear-Time Recognition of Helly Circular-Arc Models and Graphs | 10 | 0.55 | 2011 |
| Powers of cycles, powers of paths, and distance graphs | 8 | 0.49 | 2011 |
| The clique operator on circular-arc graphs | 10 | 0.52 | 2010 |
| Arboricity, h-index, and dynamic algorithms | 17 | 0.85 | 2010 |
| Short Models for Unit Interval Graphs | 5 | 0.55 | 2009 |
| Characterizations and recognition of circular-arc graphs and subclasses: A survey | 16 | 0.73 | 2009 |
| Algorithms for finding clique-transversals of graphs | 8 | 0.47 | 2008 |
| On cliques of Helly Circular-arc Graphs | 6 | 0.52 | 2008 |
| Unit Circular-Arc Graph Representations and Feasible Circulations | 10 | 0.66 | 2008 |
| A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs | 8 | 0.51 | 2008 |
| Improved algorithms for recognizing p | 0 | 0.34 | 2008 |
| Faster recognition of clique-Helly and hereditary clique-Helly graphs | 6 | 0.60 | 2007 |
| Proper Helly circular-arc graphs | 9 | 0.56 | 2007 |
| Efficient construction of unit circular-arc models | 9 | 0.73 | 2006 |
| Algorithms for clique-independent sets on subclasses of circular-arc graphs | 10 | 0.57 | 2006 |
| Characterizations and linear time recognition of helly circular-arc graphs | 11 | 0.73 | 2006 |
| On Balanced Graphs | 14 | 0.81 | 2006 |
| Clique-independent sets of Helly circular-arc graphs | 3 | 0.43 | 2004 |
| Self-clique graphs and matrix permutations | 14 | 0.91 | 2003 |
| On Clique-Transversals and Clique-Independent Sets | 22 | 0.88 | 2002 |
| Clique graphs of Helly circular arc graphs | 7 | 0.60 | 2001 |
| A sufficient condition for self-clique graphs | 4 | 0.58 | 2001 |
