Clique-width: on the price of generality
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
TAMC '09 Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation
On minimal tree realizations of linear codes
IEEE Transactions on Information Theory
Treewidth computations I. Upper bounds
Information and Computation
The rank-width of the square grid
Discrete Applied Mathematics
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth
Discrete Applied Mathematics
Graphs of linear clique-width at most 3
TAMC'08 Proceedings of the 5th international conference on Theory and applications of models of computation
Algorithmic lower bounds for problems parameterized by clique-width
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Balanced queries: divide and conquer
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Algorithmic meta-theorems for restrictions of treewidth
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Complexity results for the spanning tree congestion problem
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
On the Boolean-width of a graph: structure and applications
WG'10 Proceedings of the 36th international conference on Graph-theoretic concepts in computer science
A local search algorithm for branchwidth
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Intractability of Clique-Width Parameterizations
SIAM Journal on Computing
Theoretical Computer Science
Monadic second-order model-checking on decomposable matroids
Discrete Applied Mathematics
Hardness results and an exact exponential algorithm for the spanning tree congestion problem
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Exploiting restricted linear structure to cope with the hardness of clique-width
TAMC'10 Proceedings of the 7th annual conference on Theory and Applications of Models of Computation
A linear time algorithm for the minimum spanning caterpillar problem for bounded treewidth graphs
SIROCCO'10 Proceedings of the 17th international conference on Structural Information and Communication Complexity
Efficient algorithms for network localization using cores of underlying graphs
ALGOSENSORS'11 Proceedings of the 7th international conference on Algorithms for Sensor Systems, Wireless Ad Hoc Networks and Autonomous Mobile Entities
Tight complexity bounds for FPT subgraph problems parameterized by clique-width
IPEC'11 Proceedings of the 6th international conference on Parameterized and Exact Computation
Approximate search strategies for weighted trees
Theoretical Computer Science
Black-and-white threshold graphs
CATS '11 Proceedings of the Seventeenth Computing: The Australasian Theory Symposium - Volume 119
Black-and-white threshold graphs
CATS 2011 Proceedings of the Seventeenth Computing on The Australasian Theory Symposium - Volume 119
Model checking lower bounds for simple graphs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Clique-width and edge contraction
Information Processing Letters
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems
Theoretical Computer Science
Digraph width measures in parameterized algorithmics
Discrete Applied Mathematics
| Hi-index | 0.06 |
Besides the very successful concept of tree-width (see [Bodlaender, H. and Koster, A. (2007) Combinatorial optimisation on graphs of bounded treewidth. These are special issues on Parameterized Complexity]), many concepts and parameters measuring the similarity or dissimilarity of structures compared to trees have been born and studied over the past years. These concepts and parameters have proved to be useful tools in many applications, especially in the design of efficient algorithms. Our presented novel look at the contemporary developments of these ‘width’ parameters in combinatorial structures delivers—besides traditional tree-width and derived dynamic programming schemes—also a number of other useful parameters like branch-width, rank-width (clique-width) or hypertree-width. In this contribution, we demonstrate how ‘width’ parameters of graphs and generalized structures (such as matroids or hypergraphs), can be used to improve the design of parameterized algorithms and the structural analysis in other applications on an abstract level.