Information and Computation
Definability and Descriptive Complexity on Databases of Bounded Tree-Width
ICDT '99 Proceedings of the 7th International Conference on Database Theory
Computing Phylogenetic Roots with Bounded Degrees and Errors
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
An Existential Locality Theorem
CSL '01 Proceedings of the 15th International Workshop on Computer Science Logic
On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width
Graph-Theoretic Concepts in Computer Science
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Graph operations characterizing rank-width and balanced graph expressions
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
On the expressive power of planar perfect matching and permanents of bounded treewidth matrices
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Logspace algorithms for computing shortest and longest paths in series-parallel graphs
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Graphs of bounded treewidth can be canonized in AC1
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
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
Compact navigation and distance oracles for graphs with small treewidth
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Characterizing arithmetic circuit classes by constraint satisfaction problems
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
On the OBDD size for graphs of bounded tree- and clique-width
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Balancing bounded treewidth circuits
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
Charge group partitioning in biomolecular simulation
RECOMB'12 Proceedings of the 16th Annual international conference on Research in Computational Molecular Biology
Preserving terminal distances using minors
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Sparsest cut on bounded treewidth graphs: algorithms and hardness results
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Balancing Bounded Treewidth Circuits
Theory of Computing Systems
| Hi-index | 0.00 |