Recognizing circle graphs in polynomial time
Journal of the ACM (JACM)
Split decomposition of undirected graphs
SODA '90 Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms
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
Discrete Mathematics - Algebraic and topological methods in graph theory
An Efficient Parallel Algorithm for the Efficient Domination Problem on Distance-Hereditary Graphs
IEEE Transactions on Parallel and Distributed Systems
European Journal of Combinatorics
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
Networks with Small Stretch Number
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
(k, +)-Distance-Hereditary Graphs
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
New Graph Classes of Bounded Clique-Width
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Block duplicate graphs and a hierarchy of chordal graphs
Discrete Applied Mathematics - Workshop on discrete optimization DO'99, contributions to discrete optimization
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
(P5,diamond)-free graphs revisited: structure and linear time optimization
Discrete Applied Mathematics - Optimal discrete structure and algorithms (ODSA 2000)
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)
Journal of Combinatorial Theory Series B
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
The Hamiltonian problem on distance-hereditary graphs
Discrete Applied Mathematics
Distance-hereditary graphs are clique-perfect
Discrete Applied Mathematics
Structure and linear time recognition of 3-leaf powers
Information Processing Letters
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
Discrete Applied Mathematics - Special issue: Max-algebra
Vertex-minors, monadic second-order logic, and a conjecture by Seese
Journal of Combinatorial Theory Series B
Finding a minimum path cover of a distance-hereditary graph in polynomial time
Discrete Applied Mathematics
NP-hard graph problems and boundary classes of graphs
Theoretical Computer Science
Equistable distance-hereditary graphs
Discrete Applied Mathematics
Compatible decompositions and block realizations of finite metrics
European Journal of Combinatorics
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Laminar structure of ptolemaic graphs with applications
Discrete Applied Mathematics
Longest Path Problems on Ptolemaic Graphs
IEICE - Transactions on Information and Systems
Characterising (k,l)-leaf powers
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
Discrete Applied Mathematics
(P5,diamond)-free graphs revisited: structure and linear time optimization
Discrete Applied Mathematics
The Hamiltonian problem on distance-hereditary graphs
Discrete Applied Mathematics
Distance-hereditary graphs are clique-perfect
Discrete Applied Mathematics
Structure and linear time recognition of 3-leaf powers
Information Processing Letters
Estimating all pairs shortest paths in restricted graph families: a unified approach
Journal of Algorithms
Journal of Discrete Algorithms
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Discrete Applied Mathematics
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
Ptolemaic graphs and interval graphs are leaf powers
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Probe distance-hereditary graphs
CATS '10 Proceedings of the Sixteenth Symposium on Computing: the Australasian Theory - Volume 109
Recognition of probe ptolemaic graphs
IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Boundary properties of graphs for algorithmic graph problems
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
Maximal matching and path matching counting in polynomial time for graphs of bounded clique width
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
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
Distance labeling in hyperbolic graphs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
WG'05 Proceedings of the 31st 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
Proximity and average eccentricity of a graph
Information Processing Letters
Note: A note on connected dominating sets of distance-hereditary graphs
Discrete Applied Mathematics
Reconstruction algorithm for permutation graphs
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Dominating induced matchings for p
ISAAC'11 Proceedings of the 22nd 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
Distance-hereditary comparability graphs
Discrete Applied Mathematics
Journal of Combinatorial Theory Series B
Recognition of probe distance-hereditary graphs
Discrete Applied Mathematics
Which distance-hereditary graphs are cover-incomparability graphs?
Discrete Applied Mathematics
Obstructions for linear rank-width at most 1
Discrete Applied Mathematics
Graphs of small rank-width are pivot-minors of graphs of small tree-width
Discrete Applied Mathematics
Hi-index | 0.01 |