( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter

, , , , , и . ACM Transactions on Algorithms, (2024)to appear.
DOI: 10.1145/3632623

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.

Joachim Mnich

Leonie Mnich

Jürgen Mnich

Robert Mnich

Peter Mnich

 

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

Bisections above Tight Lower Bounds., и . WG, том 7551 из Lecture Notes in Computer Science, стр. 184-193. Springer, (2012)Parameterized Algorithms for Generalizations of Directed Feedback Vertex Set., , и . CIAC, том 11485 из Lecture Notes in Computer Science, стр. 249-261. Springer, (2019)Feedback Vertex Sets in Tournaments., и . ESA (1), том 6346 из Lecture Notes in Computer Science, стр. 267-277. Springer, (2010)When Does Schwartz Conjecture Hold?, , и . IJCAI, стр. 603-609. AAAI Press, (2015)Dynamic Parameterized Problems and Algorithms., , и . ICALP, том 80 из LIPIcs, стр. 41:1-41:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Dense Steiner problems: Approximation algorithms and inapproximability., , , и . CoRR, (2020)Engineering Kernelization for Maximum Cut., , , , , и . CoRR, (2019)Approximating Sparsest Cut in Low-Treewidth Graphs via Combinatorial Diameter, , , , , и . ACM Transactions on Algorithms, (2024)to appear.On Feedback Vertex Sets in Tournaments, и . CoRR, (2009)New Support Size Bounds and Proximity Bounds for Integer Linear Programming., , и . SOFSEM, том 14519 из Lecture Notes in Computer Science, стр. 82-95. Springer, (2024)