( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard.

, , , , и . SOSA, стр. 279-285. SIAM, (2024)

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.

Marita Majewski

Mariusz Majewski

Peter Majewski

Ingo Majewski

Frank Majewski

 

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

Dynamic treewidth., , , , и . FOCS, стр. 1734-1744. IEEE, (2023)Maintaining CMSO₂ Properties on Dynamic Structures with Bounded Feedback Vertex Number., , и . STACS, том 254 из LIPIcs, стр. 46:1-46:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument., , , , , , и . ACM Trans. Comput. Theory, 16 (2): 8:1-8:18 (2024)Simpler and faster algorithms for detours in planar digraphs., , , и . SOSA, стр. 156-165. SIAM, (2023)Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard., , , , и . SOSA, стр. 279-285. SIAM, (2024)Max Weight Independent Set in Graphs with No Long Claws: An Analog of the Gyárfás' Path Argument., , , , , , и . ICALP, том 229 из LIPIcs, стр. 93:1-93:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Parameterized Dynamic Data Structure for Split Completion., , и . ESA, том 308 из LIPIcs, стр. 87:1-87:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2024)The Asymmetric Travelling Salesman Problem In Sparse Digraphs., и . IPEC, том 180 из LIPIcs, стр. 23:1-23:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)