mastoid-bone
发表于 2025-3-30 11:26:06
http://reply.papertrans.cn/16/1532/153154/153154_51.png
beta-carotene
发表于 2025-3-30 15:29:08
https://doi.org/10.1007/978-3-322-89769-5 a close relationship between avoidable vertices in a graph and its minimal triangulations and identify new algorithmic uses of avoidable vertices. More specifically, applying Lexicographic Breadth First Search and bisimplicial elimination orderings, we derive a polynomial-time algorithm for the max
珠宝
发表于 2025-3-30 18:18:01
http://reply.papertrans.cn/16/1532/153154/153154_53.png
撕裂皮肉
发表于 2025-3-30 22:52:39
http://reply.papertrans.cn/16/1532/153154/153154_54.png
RECUR
发表于 2025-3-31 03:49:58
http://reply.papertrans.cn/16/1532/153154/153154_55.png
Innocence
发表于 2025-3-31 08:23:02
https://doi.org/10.1007/978-3-322-84283-1related to scheduling..Our interest is the complexity of computing leader-optimal prices depending on different types of followers. As the main result, we show that the Stackelberg pricing game where the follower is given by the well-known interval scheduling problem is solvable in polynomial time.
Facet-Joints
发表于 2025-3-31 12:17:59
Parameterized Complexity of Conflict-Free Graph Coloring,
Affiliation
发表于 2025-3-31 17:03:51
http://reply.papertrans.cn/16/1532/153154/153154_58.png
Exuberance
发表于 2025-3-31 18:46:49
http://reply.papertrans.cn/16/1532/153154/153154_59.png
使显得不重要
发表于 2025-3-31 23:22:52
http://reply.papertrans.cn/16/1532/153154/153154_60.png