The parameterized complexity of database queries
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the complexity of the maximum cut problem
Nordic Journal of Computing
On the Clique-Width of Perfect Graph Classes
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
The Tree-Width of Clique-Width Bounded Graphs Without Kn, n
WG '00 Proceedings of the 26th 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
Descriptive and Parameterized Complexity
CSL '99 Proceedings of the 13th International Workshop and 8th Annual Conference of the EACSL on Computer Science Logic
On Robust Algorithms for the Maximum Weight Stable Set Problem
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
NLC2-Decomposition in Polynomial Time
WG '99 Proceedings of the 25th International Workshop on Graph-Theoretic Concepts in Computer Science
On variations of P4-sparse graphs
Discrete Applied Mathematics
Parameterized power domination complexity
Information Processing Letters
Approximation Algorithms and Hardness for Domination with Propagation
APPROX '07/RANDOM '07 Proceedings of the 10th International Workshop on Approximation and the 11th International Workshop on Randomization, and Combinatorial Optimization. Algorithms and Techniques
Parameterized power domination complexity
Information Processing Letters
Small worlds as navigable augmented networks: model, analysis, and validation
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Discrete Applied Mathematics
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Greedy routing in tree-decomposed graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Strong colorings of hypergraphs
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Two fixed-parameter algorithms for the cocoloring problem
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Linear time algorithm for computing a small biclique in graphs without long induced paths
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
| Hi-index | 0.00 |