A Timing-Constrained Incremental Routing Algorithm for Symmetrical FPGAs
EDTC '96 Proceedings of the 1996 European conference on Design and Test
Satgraphs and independent domination: part 1
Theoretical Computer Science
Independent domination in hereditary classes
Theoretical Computer Science
Note: A decidability result for the dominating set problem
Theoretical Computer Science
Exponential time algorithms for the minimum dominating set problem on some graph classes
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Note: On graphs for which the connected domination number is at most the total domination number
Discrete Applied Mathematics
Computing minimum geodetic sets of proper interval graphs
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
The geodetic number of a graph
Mathematical and Computer Modelling: An International Journal
Computing a minimum outer-connected dominating set for the class of chordal graphs
Information Processing Letters
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
On dominating sets whose induced subgraphs have a bounded diameter
Discrete Applied Mathematics
Some advances on the set covering polyhedron of circulant matrices
Discrete Applied Mathematics
| Hi-index | 0.89 |