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