( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Almost-Linear Time Parameterized Algorithm for Rankwidth via Dynamic Rankwidth.

, и . STOC, стр. 1538-1549. ACM, (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.

Moritz Sokolowski

Janina Sokolowski

Fabian Sokolowski

Gerhard Sokolowski

Günter Sokolowski

 

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

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)Fully dynamic approximation schemes on planar and apex-minor-free graphs., , , и . CoRR, (2023)Detecting Points in Integer Cones of Polytopes is Double-Exponentially Hard., , , , и . SOSA, стр. 279-285. SIAM, (2024)Determining 4-Edge-Connected Components in Linear Time., , , и . ESA, том 204 из LIPIcs, стр. 71:1-71:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Flipper Games for Monadically Stable Graph Classes., , , , , , , , и . ICALP, том 261 из LIPIcs, стр. 128:1-128:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Almost-Linear Time Parameterized Algorithm for Rankwidth via Dynamic Rankwidth., и . STOC, стр. 1538-1549. ACM, (2024)Sparse Graphs of Twin-Width 2 Have Bounded Tree-Width., , , , , и . ISAAC, том 283 из LIPIcs, стр. 11:1-11:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Exact Shortest Paths with Rational Weights on the Word RAM., , и . SODA, стр. 2597-2608. SIAM, (2024)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)Dynamic treewidth., , , , и . FOCS, стр. 1734-1744. IEEE, (2023)