( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Timecop's Work Is Harder Than You Think.

, , и . MFCS, том 170 из LIPIcs, стр. 71:1-71:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)

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.

Nepomuk Felix Nilson

Kombinierte Bestimmung des immunreaktiven Trypsins und des Pankreatitis assoziierten Proteins als mögliche neue Methode des Neugeborenenscreenings auf Mukoviszidose: eine Machbarkeitsstudie. Uni Dresden, (2009)

Andreas Nilsson

BSCCO superconductors processed by the glass ceramic route: critical aspects of process, crystallization and incorporation of oxygen, composition dependence on phase formation. TU Dresden, (2009)

Wilhelm Morawietz

Michael Morawietz

Alina Morawietz

 

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

Exact Algorithms for Group Closeness Centrality., , , и . ACDA, стр. 1-12. SIAM, (2023)Colored Cut Games., , , и . FSTTCS, том 182 из LIPIcs, стр. 30:1-30:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Graph Clustering Problems Under the Lens of Parameterized Local Search., , , и . IPEC, том 285 из LIPIcs, стр. 20:1-20:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Preventing Small (s,t)Cuts by Protecting Edges., , , и . WG, том 12911 из Lecture Notes in Computer Science, стр. 143-155. Springer, (2021)Finding 3-Swap-Optimal Independent Sets and Dominating Sets Is Hard., и . MFCS, том 241 из LIPIcs, стр. 66:1-66:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Efficient Bayesian Network Structure Learning via Parameterized Local Search on Topological Orderings., , и . AAAI, стр. 12328-12335. AAAI Press, (2021)Refined Parameterizations for Computing Colored Cuts in Edge-Colored Graphs., , , и . SOFSEM, том 12011 из Lecture Notes in Computer Science, стр. 248-259. Springer, (2020)Parameterized Local Search for Max c-Cut., , , и . IJCAI, стр. 5586-5594. ijcai.org, (2023)Multi-Parameter Analysis of Finding Minors and Subgraphs in Edge-Periodic Temporal Graphs., , , , и . SOFSEM, том 13878 из Lecture Notes in Computer Science, стр. 283-297. Springer, (2023)Distance to Transitivity: New Parameters for Taming Reachability in Temporal Graphs., , и . CoRR, (2024)