Parametric Module Allocation on Partial k-Trees
IEEE Transactions on Computers
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
Random duplicated assignment: an alternative to striping in video servers
MULTIMEDIA '97 Proceedings of the fifth ACM international conference on Multimedia
A new viewpoint on code generation for directed acyclic graphs
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
The vertex-disjoint menger problem in planar graphs
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Constraint satisfaction and database theory: a tutorial
PODS '00 Proceedings of the nineteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Algorithmic aspects of topology control problems for ad hoc networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
Annals of Mathematics and Artificial Intelligence
An Architecture for Planning in Embedded Systems
Applied Intelligence
Computational Complexity of Simultaneous Elementary Matching Problems
Journal of Automated Reasoning
Analyzing the Multiple-target-multiple-agent Scenario Using Optimal Assignment Algorithms
Journal of Intelligent and Robotic Systems
A Symbolic Algorithms for Maximum Flow in 0-1 Networks
Formal Methods in System Design
Picture Similarity Retrieval Using the 2D Projection Interval Representation
IEEE Transactions on Knowledge and Data Engineering
Control-Flow Analysis in Cubic Time
ESOP '01 Proceedings of the 10th European Symposium on Programming Languages and Systems
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
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Dynamic Representation of Sparse Graphs
WADS '99 Proceedings of the 6th International Workshop on Algorithms and Data Structures
Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Deriving Formulas for Domination Numbers of Fasciagraphs and Rotagraphs
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
Induction of Recursive Theories in the Normal ILP Setting: Issues and Solutions
ILP '00 Proceedings of the 10th International Conference on Inductive Logic Programming
On Synthesis of Easily Testable (k, K) Circuits
IEEE Transactions on Computers
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
Journal of Algorithms
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms
Trading uninitialized space for time
Information Processing Letters
Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
Journal of Computer and System Sciences
Algorithmic aspects of topology control problems for ad hoc networks
Mobile Networks and Applications
Computing the branchwidth of interval graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Computing minimal triangulations in time O(nα log n) = o(n2.376)
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
Algorithmic construction of sets for k-restrictions
ACM Transactions on Algorithms (TALG)
Learning Recursive Theories in the Normal ILP Setting
Fundamenta Informaticae
Subgraph isomorphism, log-bounded fragmentation, and graphs of (locally) bounded treewidth
Journal of Computer and System Sciences
Quantum approaches to graph colouring
Theoretical Computer Science
Bit-Parallel Tree Pattern Matching Algorithms for Unordered Labeled Trees
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Computing the branchwidth of interval graphs
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Embeddings of k-connected graphs of pathwidth k
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover
Discrete Applied Mathematics
Matching and P2-packing: weighted versions
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Attribute value reordering for efficient hybrid OLAP
Information Sciences: an International Journal
Graph minors and parameterized algorithm design
The Multivariate Algorithmic Revolution and Beyond
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P'2002), Part 2
Learning Recursive Theories in the Normal ILP Setting
Fundamenta Informaticae
Transition-optimal Token Distribution
Fundamenta Informaticae
Datalog and constraint satisfaction with infinite templates
Journal of Computer and System Sciences
Matching and Weighted P2-Packing: Algorithms and Kernels
Theoretical Computer Science
Hi-index | 0.01 |