cornucopia
发表于 2025-3-25 05:55:28
http://reply.papertrans.cn/75/7412/741158/741158_21.png
Supplement
发表于 2025-3-25 10:35:36
Pareto Complexity of Two-Parameter FPT Problems: A Case Study for Partial Vertex Cover,) where .,. > 1 are constant bases. An optimal combination of bases .,. can be chosen depending on the ratio ./.. As a first illustration we apply the framework to the problem of finding, in a graph, a vertex cover of size . that leaves at most . edges uncovered. We report the best branching rules w
无思维能力
发表于 2025-3-25 13:06:49
http://reply.papertrans.cn/75/7412/741158/741158_23.png
surrogate
发表于 2025-3-25 16:42:07
Improved Induced Matchings in Sparse Graphs,ost one is matched in any induced matching, and if one of them is matched then there is another matching of the same size that matches the other vertex. Motivated by this, Kanj, Pelsmajer, Schaefer and Xia studied induced matchings in twinless graphs. They showed that any twinless planar graph
patriarch
发表于 2025-3-25 21:36:19
http://reply.papertrans.cn/75/7412/741158/741158_25.png
审问,审讯
发表于 2025-3-26 03:23:48
An Exact Algorithm for the Maximum Leaf Spanning Tree Problem,en parameterized in the number of leaves ., this problem can be solved in time .(4.poly(.)) using a simple branching algorithm introduced by a subset of the authors . Daligault, Gutin, Kim, and Yeo improved this branching algorithm and obtained a running time of .(3.72.poly(.)). In this pape
跟随
发表于 2025-3-26 06:15:49
http://reply.papertrans.cn/75/7412/741158/741158_27.png
PALL
发表于 2025-3-26 08:36:32
On Digraph Width Measures in Parameterized Algorithmics,measures for digraphs such as DAG-width or Kelly-width do not seem so successful. Several recent papers, e.g. those of Kreutzer–Ordyniak, Dankelmann–Gutin–Kim, or Lampis–Kaouri–Mitsou, have given some evidence for this. We support this direction by showing that many quite different problems remain h
Emasculate
发表于 2025-3-26 15:56:59
http://reply.papertrans.cn/75/7412/741158/741158_29.png
巫婆
发表于 2025-3-26 17:34:01
Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms, (and computationally easy) in the unbounded case for single source, single target paths. However, in the bounded case, they are combinatorially distinct and are both .-hard, even to approximate. Our results indicate that a more refined landscape appears when we study these problems with respect to