( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Constrained and Ordered Level Planarity Parameterized by the Number of Levels

, , , , , и . Proc. 40th Annu. Sympos. Comput. Geom. (SoCG'24), том 293 из LIPIcs, стр. . Schloss Dagstuhl – Leibniz-Zentrum für Informatik, (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.

Blazej Grabowski

Blazej Ochocinski

Blazej Duda

Katja Blazej

Vaclav Taubenhansl

 

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

A Simpler Bit-parallel Algorithm for Swap Matching., , и . CoRR, (2016)Computing m-Eternal Domination Number of Cactus Graphs in Linear Time., , и . CoRR, (2023)Polynomial kernels for tracking shortest paths., , , , , и . Inf. Process. Lett., (2023)On the Smallest Synchronizing Terms of Finite Tree Automata., , и . CIAA, том 14151 из Lecture Notes in Computer Science, стр. 79-90. Springer, (2023)On the Intersections of Non-homotopic Loops., , , и . CALDAM, том 12601 из Lecture Notes in Computer Science, стр. 196-205. Springer, (2021)Constant Factor Approximation for Tracking Paths and Fault Tolerant Feedback Vertex Set., , , , , и . WAOA, том 12982 из Lecture Notes in Computer Science, стр. 23-38. Springer, (2021)On the m-eternal Domination Number of Cactus Graphs., , и . RP, том 11674 из Lecture Notes in Computer Science, стр. 33-47. Springer, (2019)Polynomial Kernels for Tracking Shortest Paths., , , , , и . CoRR, (2022)On Polynomial Kernels for Traveling Salesperson Problem and Its Generalizations., , , , , и . ESA, том 244 из LIPIcs, стр. 22:1-22:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Bears with Hats and Independence Polynomials., , и . WG, том 12911 из Lecture Notes in Computer Science, стр. 283-295. Springer, (2021)