Graph-Theoretic Concepts in Computer Science

Sequences of radius "k" for complete bipartite graphs.-&nbsp;Approximate Association via Dissociation.-&nbsp;Geodetic convexity parameters for graphs with few short induced paths.-&nbsp;Weighted Ecient Domination for P5-Free and for P6-Free Graphs.-&nbsp;Saving colors and Max Coloring: some xed-parameter tractability results.-&nbsp;Finding Two Edge-Disjoint Paths with Length Constraints.-&nbsp;Packing and covering immersion models of planar subcubic graphs.-&nbsp;The maximum weight stable set problem in (P 6, bull)-free graphs.-&nbsp;Parameterized Power Vertex Cover.-&nbsp;Exhaustive generation of k-critical H-free graphs.-&nbsp;Induced separation dimension.-&nbsp;Tight Bounds for Gomory-Hu-like Cut Counting.-&nbsp;Eccentricity Approximating Trees: Extended Abstract.-&nbsp;Drawing Planar Graphs with Prescribed Face Areas.-&nbsp;Vertex Cover Structural Parameterization Revisited.-&nbsp;Distance-d Independent Set and other problems in graphs with "few"&nbsp;minimal separators.-&nbsp;Parameterized complexity of the MINCCA problem on graphs of<br>bounded decomposability.-&nbsp;On edge intersection graphs of paths with 2 bends.-&nbsp;&nbsp;Almost Induced Matching: Linear Kernels and Parameterized Algorithms.-&nbsp;Parameterized vertex deletion problems for hereditary graph classes&nbsp;with a block property.-&nbsp;Harmonious Coloring: Parameterized Algorithms and Upper bounds.-&nbsp;On Directed Steiner Trees with Multiple Roots.-&nbsp;A Faster Parameterized Algorithm for Group Feedback Edge Set.-&nbsp;Sequence Hypergraphs.- On subgraphs of bounded degeneracy in hypergraphs.