Weighted connected k-domination and weighted k-dominating clique in distance-hereditary graphs
Theoretical Computer Science
A simple paradigm for graph recognition: application to cographs and distance hereditary graphs
Theoretical Computer Science
Forbidden subgraph decomposition
Discrete Mathematics
An Efficient Parallel Algorithm for the Efficient Domination Problem on Distance-Hereditary Graphs
IEEE Transactions on Parallel and Distributed Systems
Efficient Parallel Algorithms on Distance-Hereditary Graphs
ICPP '97 Proceedings of the international Conference on Parallel Processing
Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Pruning Graphs with Digital Search Trees. Application to Distance Hereditary Graphs
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
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
On the Clique-Width of Perfect Graph Classes
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Networks with Small Stretch Number
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Centers and medians of distance-hereditary graphs
Discrete Mathematics
MAD Trees and distance-hereditary graphs
Discrete Applied Mathematics - Special issue: The second international colloquium, "journées de l'informatique messine"
(k, +)-distance-hereditary graphs
Journal of Discrete Algorithms
Journal of Parallel and Distributed Computing
Chordal co-gem-free and (P5,gem)-freegraphs have bounded clique-width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
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
Equistable distance-hereditary graphs
Discrete Applied Mathematics
Solving some NP-complete problems using split decomposition
Discrete Applied Mathematics
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Laminar structure of ptolemaic graphs with applications
Discrete Applied Mathematics
Discrete Applied Mathematics
Chordal co-gem-free and (P5,gem)-free graphs have bounded clique-width
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
MAD trees and distance-hereditary graphs
Discrete Applied Mathematics
The Hamiltonian problem on distance-hereditary graphs
Discrete Applied Mathematics
Distance-hereditary graphs are clique-perfect
Discrete Applied Mathematics
Journal of Discrete Algorithms
O(mlogn) split decomposition of strongly-connected graphs
Discrete Applied Mathematics
An optimal, edges-only fully dynamic algorithm for distance-hereditary graphs
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
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
Dynamic distance hereditary graphs using split decomposition
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Probe distance-hereditary graphs
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
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
GD'05 Proceedings of the 13th international conference on Graph Drawing
Laminar structure of ptolemaic graphs and its applications
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Treelike comparability graphs: characterization, recognition, and applications
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Coloring a graph using split decomposition
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Note: Computing maximum stable sets for distance-hereditary graphs
Discrete Optimization
Distance-hereditary comparability graphs
Discrete Applied Mathematics
Recognition of probe distance-hereditary graphs
Discrete Applied Mathematics
Black-and-white threshold graphs
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Hi-index | 0.00 |