Abstract is missing.
- Sequences of Radius k for Complete Bipartite GraphsMichal Debski, Zbigniew Lonc, Pawel Rzazewski. 1-12 [doi]
- Approximate Association via DissociationJie You, Jianxin Wang, Yixin Cao 0001. 13-24 [doi]
- Geodetic Convexity Parameters for Graphs with Few Short Induced PathsMitre Costa Dourado, Lucia Draque Penso, Dieter Rautenbach. 25-37 [doi]
- Weighted Efficient Domination for P_6 -Free and for P_5 -Free GraphsAndreas Brandstädt, Raffaele Mosca. 38-49 [doi]
- Saving Colors and Max Coloring: Some Fixed-Parameter Tractability ResultsBruno Escoffier. 50-61 [doi]
- Finding Two Edge-Disjoint Paths with Length ConstraintsLeizhen Cai, Junjie Ye. 62-73 [doi]
- Packing and Covering Immersion Models of Planar Subcubic GraphsArchontia C. Giannopoulou, O-joung Kwon, Jean-Florent Raymond, Dimitrios M. Thilikos. 74-84 [doi]
- The Maximum Weight Stable Set Problem in ( P_6 , bull)-Free GraphsFrédéric Maffray, Lucas Pastor. 85-96 [doi]
- Parameterized Power Vertex CoverEric Angel, Evripidis Bampis, Bruno Escoffier, Michael Lampis. 97-108 [doi]
- Exhaustive Generation of k-Critical ℋ-Free GraphsJan Goedgebeur, Oliver Schaudt. 109-120 [doi]
- Induced Separation DimensionEmile Ziedan, Deepak Rajendraprasad, Rogers Mathew, Martin Charles Golumbic, Jérémie Dusart. 121-132 [doi]
- Tight Bounds for Gomory-Hu-like Cut CountingRajesh Chitnis, Lior Kamma, Robert Krauthgamer. 133-144 [doi]
- Eccentricity Approximating Trees - Extended AbstractFeodor F. Dragan, Ekkehard Köhler, Hend Alrasheed. 145-157 [doi]
- Drawing Planar Graphs with Prescribed Face AreasLinda Kleist. 158-170 [doi]
- Vertex Cover Structural Parameterization RevisitedFedor V. Fomin, Torstein J. F. Strømme. 171-182 [doi]
- On Distance-d Independent Set and Other Problems in Graphs with "few" Minimal SeparatorsPedro Montealegre, Ioan Todinca. 183-194 [doi]
- Parameterized Complexity of the MINCCA Problem on Graphs of Bounded DecomposabilityDidem Gözüpek, Sibel Özkan, Christophe Paul, Ignasi Sau, Mordechai Shalom. 195-206 [doi]
- On Edge Intersection Graphs of Paths with 2 BendsMartin Pergel, Pawel Rzazewski. 207-219 [doi]
- Almost Induced Matching: Linear Kernels and Parameterized AlgorithmsMingyu Xiao, Shaowei Kou. 220-232 [doi]
- Parameterized Vertex Deletion Problems for Hereditary Graph Classes with a Block PropertyÉdouard Bonnet, Nick Brettell, O-joung Kwon, Dániel Marx. 233-244 [doi]
- Harmonious Coloring: Parameterized Algorithms and Upper BoundsSudeshna Kolay, Ragukumar Pandurangan, Fahad Panolan, Venkatesh Raman 0001, Prafullkumar Tale. 245-256 [doi]
- On Directed Steiner Trees with Multiple RootsOndrej Suchý. 257-268 [doi]
- A Faster Parameterized Algorithm for Group Feedback Edge SetM. S. Ramanujan. 269-281 [doi]
- Sequence HypergraphsKaterina Böhmová, Jérémie Chalopin, Matús Mihalák, Guido Proietti, Peter Widmayer. 282-294 [doi]
- On Subgraphs of Bounded Degeneracy in HypergraphsKunal Dutta, Arijit Ghosh. 295-306 [doi]