Efficient decision procedures for graph properties on context-free graph languages
Journal of the ACM (JACM)
An algebraic theory of graph reduction
Journal of the ACM (JACM)
A data structure for dynamically maintaining rooted trees
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Subgraph isomorphism in planar graphs and related problems
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The maximum subforest problem: approximation and exact algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Make it practical: a generic linear-time algorithm for solving maximum-weightsum problems
ICFP '00 Proceedings of the fifth ACM SIGPLAN international conference on Functional programming
Efficiently parallelizable problems on a class of decomposable graphs
Journal of Computer and System Sciences
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
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
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Experimental evaluation of a tree decomposition-based algorithm for vertex cover on planar graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Treewidth computations I. Upper bounds
Information and Computation
Generation of efficient programs for solving maximum multi-marking problems
SAIG'01 Proceedings of the 2nd international conference on Semantics, applications, and implementation of program generation
Matchability and k-maximal matchings
Discrete Applied Mathematics
Mining graphs with constraints on symmetry and diameter
WAIM'10 Proceedings of the 2010 international conference on Web-age information management
Maximum marking problems with accumulative weight functions
ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Improved steiner tree algorithms for bounded treewidth
IWOCA'11 Proceedings of the 22nd international conference on Combinatorial Algorithms
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Improved Steiner tree algorithms for bounded treewidth
Journal of Discrete Algorithms
Coalition structure generation over graphs
Journal of Artificial Intelligence Research
| Hi-index | 0.00 |