( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Faster Existential FO Model Checking on Posets.

, , , и . ISAAC, том 8889 из Lecture Notes in Computer Science, стр. 441-451. Springer, (2014)

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.

Jakub Mácha

Analytische Theorien der Metapher: Untersuchungen zum Konzept der metaphorischen Bedeutung. Uni Hannover, (2009)

Jakub Novák

Jakub Kopycki

Jakub Limanowski

Jakub Hodek

 

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

Faster Existential FO Model Checking on Posets., , , и . ISAAC, том 8889 из Lecture Notes in Computer Science, стр. 441-451. Springer, (2014)Deobfuscating sparse graphs., и . CoRR, (2017)First order limits of sparse graphs: Plane trees and path-width., , , , , , , и . Random Struct. Algorithms, 50 (4): 612-635 (2017)A New Perspective on FO Model Checking of Dense Graph Classes., , , , и . ACM Trans. Comput. Log., 21 (4): 28:1-28:23 (2020)FO Model Checking on Posets of Bounded Width., , , , , , и . FOCS, стр. 963-974. IEEE Computer Society, (2015)Parameterized Shifted Combinatorial Optimization., , , и . COCOON, том 10392 из Lecture Notes in Computer Science, стр. 224-236. Springer, (2017)Treelike Decompositions for Transductions of Sparse Graphs., , , , и . LICS, стр. 31:1-31:14. ACM, (2022)Model Checking on Interpretations of Classes of Bounded Local Cliquewidth., , , , , , и . LICS, стр. 54:1-54:13. ACM, (2022)Computing Shrub-Depth Decompositions., и . STACS, том 154 из LIPIcs, стр. 56:1-56:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Flipper Games for Monadically Stable Graph Classes., , , , , , , , и . ICALP, том 261 из LIPIcs, стр. 128:1-128:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)