Paul Erdös (1913-996): his influence on the theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Coloring face-hypergraphs of graphs on surfaces
Journal of Combinatorial Theory Series B
Chordal graphs and the characteristic polynomial
Discrete Mathematics
Query Evaluation via Tree-Decompositions
ICDT '01 Proceedings of the 8th International Conference on Database Theory
The Dominating Set Problem Is Fixed Parameter Tractable for Graphs of Bounded Genus
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
On the Minimum Size of a Contraction-Universal Tree
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Well-Founded Recursive Relations
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
A spectral lower bound for the treewidth of a graph and its consequences
Information Processing Letters
The dominating set problem is fixed parameter tractable for graphs of bounded genus
Journal of Algorithms
The maximal linear extension theorem in second order arithmetic
Archive for Mathematical Logic
An extended tree-width notion for directed graphs related to the computation of permanents
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Hi-index | 0.00 |