An Efficient Parallel Algorithm for the Efficient Domination Problem on Distance-Hereditary Graphs
IEEE Transactions on Parallel and Distributed Systems
Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Efficient Algorithms for the Hamiltonian Problem on Distance-Hereditary Graphs
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
Parallel Decomposition of Distance-Hereditary Graphs
ParNum '99 Proceedings of the 4th International ACPC Conference Including Special Tracks on Parallel Numerics and Parallel Computing in Image Processing, Video Processing, and Multimedia: Parallel Computation
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Journal of Parallel and Distributed Computing
The Hamiltonian problem on distance-hereditary graphs
Discrete Applied Mathematics
Distance-hereditary graphs are clique-perfect
Discrete Applied Mathematics
An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs
The Journal of Supercomputing
Linear-time algorithms for the Hamiltonian problems on distance-hereditary graphs
Theoretical Computer Science
Finding a minimum path cover of a distance-hereditary graph in polynomial time
Discrete Applied Mathematics
Laminar structure of ptolemaic graphs with applications
Discrete Applied Mathematics
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
The Hamiltonian problem on distance-hereditary graphs
Discrete Applied Mathematics
Distance-hereditary graphs are clique-perfect
Discrete Applied Mathematics
A new approach to graph recognition and applications to distance-hereditary graphs
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Theoretical Computer Science
Using split composition to extend distance-hereditary graphs in a generative way
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Recognition of probe cographs and partitioned probe distance hereditary graphs
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
Laminar structure of ptolemaic graphs and its applications
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Classifying rankwidth k-DH-graphs
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Note: Computing maximum stable sets for distance-hereditary graphs
Discrete Optimization
The black-and-white coloring problem on distance-hereditary graphs and strongly chordal graphs
FAW-AAIM'12 Proceedings of the 6th international Frontiers in Algorithmics, and Proceedings of the 8th international conference on Algorithmic Aspects in Information and Management
| Hi-index | 0.01 |