( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Parameterized Counting of Trees, Forests and Matroid Bases.

, и . CSR, том 10304 из Lecture Notes in Computer Science, стр. 85-98. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Cornelius Mund

Competition between charge-density-wave and antiferromagnetic order in one-dimension: phase diagram and dynamics. Uni Marburg, (2009)

Cornelius Hoenecke

Cornelius Menig

Cornelius Böllhoff

Cornelius Becker

 

Другие публикации лиц с тем же именем

A note on the approximability of deepest-descent circuit steps., , , и . Oper. Res. Lett., 49 (3): 310-315 (2021)Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts., , , , и . WG, том 13453 из Lecture Notes in Computer Science, стр. 98-113. Springer, (2022)Paths and walks, forests and planes.. Saarland University, Germany, (2019)Patching Colors with Tensors.. ESA, том 144 из LIPIcs, стр. 25:1-25:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Counting Vanishing Matrix-Vector Products., , , и . WALCOM, том 14549 из Lecture Notes in Computer Science, стр. 335-349. Springer, (2024)A Polyhedral Perspective on Tropical Convolutions., , и . IWOCA, том 13889 из Lecture Notes in Computer Science, стр. 111-122. Springer, (2023)The Complexity of Optimizing Atomic Congestion., , , и . AAAI, стр. 20044-20052. AAAI Press, (2024)Fast Convolutions for Near-Convex Sequences., и . ISAAC, том 283 из LIPIcs, стр. 16:1-16:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)On the Complexity of Solving Zero-Dimensional Polynomial Systems via Projection., и . ISSAC, стр. 151-158. ACM, (2016)Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP., , и . Algorithmica, 81 (2): 541-556 (2019)