Efficient decision procedures for graph properties on context-free graph languages
Journal of the ACM (JACM)
A linear time algorithm for finding tree-decompositions of small treewidth
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
An algebraic theory of graph reduction
Journal of the ACM (JACM)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Approximation schemes for PSPACE-complete problems for succinct specifications (preliminary version)
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
I/O-efficient algorithms for graphs of bounded treewidth
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Exploiting structure in quantified formulas
Journal of Algorithms
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Efficient Analysis of Graphs with Small Minimal Separators
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
Tree-width and the monadic quantifier hierarchy
Theoretical Computer Science - Logic and complexity in computer science
An integrated model of workflows, e-contracts and solution implementation
Proceedings of the 2004 ACM symposium on Applied computing
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
Degree-constrained decompositions of graphs: bounded treewidth and planarity
Theoretical Computer Science
Tree-edges deletion problems with bounded diameter obstruction sets
Discrete Applied Mathematics
Computational properties of argument systems satisfying graph-theoretic constraints
Artificial Intelligence
ROMAN DOMINATION: a parameterized perspective
International Journal of Computer Mathematics
Solving problems on recursively constructed graphs
ACM Computing Surveys (CSUR)
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
Discrete Applied Mathematics
Connectivity in Multi-interface Networks
Trustworthy Global Computing
Tree-width of graphs without a 3×3 grid minor
Discrete Applied Mathematics
On minimal tree realizations of linear codes
IEEE Transactions on Information Theory
Comparative pathway prediction via unified graph modeling of genomic structure information
ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
Cost minimisation in multi-interface networks
NET-COOP'07 Proceedings of the 1st EuroFGI international conference on Network control and optimization
Computing representations of matroids of bounded branch-width
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
The space complexity of k-tree isomorphism
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Optimization and recognition for K5-minor free graphs in linear time
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Exploiting multi-interface networks: Connectivity and Cheapest Paths
Wireless Networks
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Decomposition width of matroids
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Dynamic programming for graphs on surfaces
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Mining graphs with constraints on symmetry and diameter
WAIM'10 Proceedings of the 2010 international conference on Web-age information management
Language models as representations for weakly-supervised NLP tasks
CoNLL '11 Proceedings of the Fifteenth Conference on Computational Natural Language Learning
An efficient partitioning oracle for bounded-treewidth graphs
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Rapid ab initio RNA folding including pseudoknots via graph tree decomposition
WABI'06 Proceedings of the 6th international conference on Algorithms in Bioinformatics
Approximation and complexity of k–splittable flows
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Faster approximation schemes and parameterized algorithms on (odd-)H-minor-free graphs
Theoretical Computer Science
Roman domination: a parameterized perspective
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Decomposition width of matroids
Discrete Applied Mathematics
Graph minors and parameterized algorithm design
The Multivariate Algorithmic Revolution and Beyond
RNA folding including pseudoknots: a new parameterized algorithm and improved upper bound
WABI'07 Proceedings of the 7th international conference on Algorithms in Bioinformatics
Drawing planar 3-trees with given face areas
Computational Geometry: Theory and Applications
Linear kernels and single-exponential algorithms via protrusion decompositions
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Maximum matching in multi-interface networks
Theoretical Computer Science
Dynamic programming for graphs on surfaces
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.07 |