| Invited Lecture Blow-Ups, Win/Win's, and Crown Rules: Some New Directions in FPT Matching, Edge-Colouring, and Dimers Regular Papers Minimum Flow Time Graph Ordering Searching Is Not Jumping Incremental Integration Tools for Chemical Engineering An Industrial Application of Triple Graph Grammars The Minimum Degree Heuristic and the Minimal Triangulation Process Generalized Parametric Multi-terminal Flows Problem Canonical Decomposition of Outerplanar Maps and Application to Enumeration, Coding, and Generation The Complexity of the Matching-Cut Problem for Planar Graphs and Other Graph Classes Tree Spanners for Bipartite Graphs and Probe Interval Graphs A Simple Linear Time LexBFS Cograph Recognition Algorithm Backbone Colorings for Networks Greedy Edge-Disjoint Paths in Complete Graphs Graph-Based Approaches to Software Watermarking Completely Connected Clustered Graphs An FPT Algorithm for Set Splitting Drawing Planar Graphs on a Curve Tree-Partitions of k-Trees with Applications in Graph Layout Resource Allocation Problems in Multifiber WDM Tree Networks An Improved Upper Bound on the Crossing Number of the Hypercube NCE Graph Grammars and Clique-Width Chordal Probe Graphs Subgraph Induced Planar Connectivity Augmentation On the Recognition of General Partition Short Cycles in Planar Graphs Complexity of Hypergraph Coloring and Seidel's Switching …… Erratum Author Index |
内容加载中，请稍后...
商品评论（0条）