( en | de | ru )

 

Disambiguation of "Morawietz, Nils"

Author of the publication

copydeleteadd this publication to your clipboard
Preventing Small (s,t)Cuts by Protecting Edges.

, , , and . WG, volume 12911 of Lecture Notes in Computer Science, page 143-155. Springer, (2021)

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. You can also use the button next to the name to display some publications already assigned to the person.

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

 

Other publications of authors with the same name

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