Amortized efficiency of list update and paging rules
Communications of the ACM
Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
The linearity of first-fit coloring of interval graphs
SIAM Journal on Discrete Mathematics
Competitive algorithms for on-line problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
An on-line graph coloring algorithm with sublinear performance ratio
Discrete Mathematics
Algorithms finding tree-decompositions of graphs
Journal of Algorithms
Finding approximate separators and computing tree width quickly
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Coloring interval graphs with First-Fit
Discrete Mathematics
Efficient parallel algorithms for graphs of bounded tree-width
Journal of Algorithms
SIAM Journal on Computing
Efficient and constructive algorithms for the pathwidth and treewidth of graphs
Journal of Algorithms
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
Journal of Algorithms
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Parameterized Complexity
| Hi-index | 0.00 |
In this article we consider the application of ideas from parameterized complexity, and topological graph theory, to online problems. We focus on parameterized promise problems, where we are promised that the problem input obeys certain properties, or is presented in a certain fashion. We explore the effects of using graph width metrics as restrictions on the input to online problems. It seems natural to suppose that, for graphs having some form of bounded width, good online algorithms may exist for a number of natural problems. In the work presented we concentrate on online graph coloring problems, where we restrict the allowed input to instances having some form of bounded treewidth or pathwidth. We also consider the effects of restricting the presentation of the input to some form of bounded width decomposition or layout. A consequence of this part of the work is the clarification of a new parameter for graphs, persistence, which arises naturally in the online setting, and is of interest in its own right. We present some basic results regarding the general recognition of graphs having bounded persistence path decompositions.