恩惠 发表于 2025-4-1 03:26:00

http://reply.papertrans.cn/39/3881/388025/388025_61.png

Lethargic 发表于 2025-4-1 09:26:15

http://reply.papertrans.cn/39/3881/388025/388025_62.png

MEET 发表于 2025-4-1 13:32:06

,Problems Hard for Treewidth but Easy for Stable Gonality,on problems, such as ., ., and capacitated optimization problems such as .. Our hardness claims beat existing results. The FPT algorithms use a new parameter “treebreadth”, associated to a weighted tree partition, as well as DP and ILP.
页: 1 2 3 4 5 6 [7]
查看完整版本: Titlebook: ;