New upper bounds on feedback vertex numbers in butterflies
Information Processing Letters
Generalized above guarantee vertex cover and r-partization
WALCOM'12 Proceedings of the 6th international conference on Algorithms and computation
Maximum weight independent sets in hole- and dart-free graphs
Discrete Applied Mathematics
An exact algorithm for subset feedback vertex set on chordal graphs
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
The maximum vertex coverage problem on bipartite graphs
Discrete Applied Mathematics
| Hi-index | 0.04 |