LBFS orderings and cocomparability graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs
Theoretical Computer Science
Journal of Algorithms
Hardness of Approximating Independent Domination in Circle Graphs
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Efficient Algorithms for the Minimum Connected Domination on Trapezoid Graphs
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
On Subfamilies of AT-Free Graphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Independent domination in finitely defined classes of graphs
Theoretical Computer Science
On linear and circular structure of (claw, net)-free graphs
Discrete Applied Mathematics
On the independent dominating set polytope
European Journal of Combinatorics
Improved bottleneck domination algorithms
Discrete Applied Mathematics
Efficient algorithms for the minimum connected domination on trapezoid graphs
Information Sciences: an International Journal
Discrete Applied Mathematics
Core Stability of Minimum Coloring Games
Mathematics of Operations Research
Algorithms on Subtree Filament Graphs
Graph Theory, Computational Intelligence and Thought
On the Cubicity of AT-Free Graphs and Circular-Arc Graphs
Graph Theory, Computational Intelligence and Thought
Discrete Applied Mathematics
On end-vertices of Lexicographic Breadth First Searches
Discrete Applied Mathematics
Hardness and approximation of minimum distortion embeddings
Information Processing Letters
Graphs of linear clique-width at most 3
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
The LBFS Structure and Recognition of Interval Graphs
SIAM Journal on Discrete Mathematics
A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Lexicographic breadth first search – a survey
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Core stability of minimum coloring games
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
On the L(h, k)-labeling of co-comparability graphs
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Some advances on the set covering polyhedron of circulant matrices
Discrete Applied Mathematics
Hi-index | 0.00 |