Subgraph Isomorphism, log-Bounded Fragmentation and Graphs of (Locally) Bounded Treewidth
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Embeddings of k-Connected Graphs of Pathwidth k
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees
ISAAC '98 Proceedings of the 9th International Symposium on Algorithms and Computation
Finding Smallest Supertrees Under Minor Containment
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
Information Processing Letters
Embeddings of k-connected graphs of pathwidth k
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Tree Decomposition Based Fast Search of RNA Structures Including Pseudoknots in Genomes
CSB '05 Proceedings of the 2005 IEEE Computational Systems Bioinformatics Conference
A survey on tree edit distance and related problems
Theoretical Computer Science
Efficient Parameterized Algorithms for Biopolymer Structure-Sequence Alignment
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
An algebraic view of the relation between largest common subtrees and smallest common supertrees
Theoretical Computer Science
Approximating the maximum clique minor and some subgraph homeomorphism problems
Theoretical Computer Science
On Chen and Chen's new tree inclusion algorithm
Information Processing Letters
Tree-edges deletion problems with bounded diameter obstruction sets
Discrete Applied Mathematics
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
Journal of Computer and System Sciences
Efficient Frequent Connected Subgraph Mining in Graphs of Bounded Treewidth
ECML PKDD '08 Proceedings of the 2008 European Conference on Machine Learning and Knowledge Discovery in Databases - Part I
Parameterized graph cleaning problems
Discrete Applied Mathematics
An exact algorithm for subgraph homeomorphism
Journal of Discrete Algorithms
Embeddings of k-connected graphs of pathwidth k
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
On exact complexity of subgraph homeomorphism
TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Efficient frequent connected subgraph mining in graphs of bounded tree-width
Theoretical Computer Science
Contractions of planar graphs in polynomial time
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
The tree inclusion problem: In linear space and faster
ACM Transactions on Algorithms (TALG)
Contracting planar graphs to contractions of triangulations
Journal of Discrete Algorithms
Edge contractions in subclasses of chordal graphs
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Contracting a chordal graph to a split graph or a tree
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Faster parameterized algorithms for minor containment
Theoretical Computer Science
Containment relations in split graphs
Discrete Applied Mathematics
Efficient parameterized algorithm for biopolymer structure-sequence alignment
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Faster parameterized algorithms for minor containment
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
On graph contractions and induced minors
Discrete Applied Mathematics
Edge contractions in subclasses of chordal graphs
Discrete Applied Mathematics
Finding contractions and induced minors in chordal graphs via disjoint paths
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Detecting induced star-like minors in polynomial time
Journal of Discrete Algorithms
Complexity of computing distances between geometric trees
SSPR'12/SPR'12 Proceedings of the 2012 Joint IAPR international conference on Structural, Syntactic, and Statistical Pattern Recognition
The complexity of mining maximal frequent subgraphs
Proceedings of the 32nd symposium on Principles of database systems
Maximum common induced subgraph parameterized by vertex cover
Information Processing Letters
| Hi-index | 0.01 |