Volume 125, May 2022

An almost optimal approximation algorithm for monotone submodular multiple knapsack.

Yaron Fairstein Ariel Kulik Joseph (Seffi) Naor Danny Raz Hadas Shachnai

• 原文链接
• 谷歌学术
• 必应学术
• 百度学术

Orthogonal planarity testing of bounded treewidth graphs.

Emilio Di Giacomo Giuseppe Liotta Fabrizio Montecchiani

• 原文链接
• 谷歌学术
• 必应学术
• 百度学术

Approximating the existential theory of the reals.

Argyrios Deligkas John Fearnley Themistoklis Melissourgos Paul G. Spirakis

• 原文链接
• 谷歌学术
• 必应学术
• 百度学术

Greedy routing and the algorithmic small-world phenomenon.

Karl Bringmann Ralph Keusch Johannes Lengler Yannic Maus Anisur Rahaman Molla

• 原文链接
• 谷歌学术
• 必应学术
• 百度学术

Incompressibility of H-free edge modification problems: Towards a dichotomy.

Dániel Marx R. B. Sandeep

• 原文链接
• 谷歌学术
• 必应学术
• 百度学术

Regular expression length via arithmetic formula complexity.

Ehud Cseresnyes Hannes Seiwert

• 原文链接
• 谷歌学术
• 必应学术
• 百度学术