| Invited Lectures Hypertree Decompositions: Structure, Algorithms, and Applications Combinatorial Search on Graphs Motivated by Bioinformatics Applications: A Brief Survey Regular Papers Domination Search on Graphs with Low Dominating-Target-Number Fully Dynamic Algorithm for Recognition and Modular Decomposition of Permutation Graphs Approximating Rank-Width and Clique-Width Quickly Computing the Tutte Polynomial on Graphs of Bounded Clique-Width Minimizing NLC-Width is NP-Complete Channel Assignment and Improper Choosability of Graphs Computing Treewidth and Minimum Fill-In for Permutation Graphs in Linear Time Roman Domination over Some Graph Classes Algorithms for Comparability of Matrices in Partial Orders Imposed by Graph Homomorphisms Network Discovery and Verification Complete Graph Drawings Up to Triangle Mutations Collective Tree 1-Spanners for Interval Graphs On Stable Cutsets in Claw-Free Graphs and Planar Graphs Induced Subgraphs of Bounded Degree and Bounded Treewidth Optimal Broadcast Domination of Arbitrary Graphs in Polynomial Time Ultimate Generalizations of LexBFS and LEX M Adding an Edge in a Cograph The Computational Complexity of Delay Management Acyclic Choosability of Graphs with Small Maximum Degree Generating Colored Trees Optimal Hypergraph Tree-Realization …… Author Index |
内容加载中，请稍后...
商品评论（0条）