( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths.

, и . CoRR, (2018)

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.

Robert Wille

Towards a design flow for reversible logic. Uni Bremen, (2009)

Robert Klöfkorn

Numerics for evolution equations: a general interface based design concept. Uni Freiburg, (2009)

Robert Braun

Referenzmodellierung: Grundlegung und Evaluation der Technik des Modell-Konfigurationsmanagements. TU Dresden, (2010)

Robert Wagner

Inkrementelle Modellsynchronisation. Uni Paderborn, (2009)

Robert Zangenfeind

Das Bedeutung-Text-Modell: Wörterbuch und Grammatik einer integralen Sprachbeschreibung. Uni München, (2009)
 

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

Algorithmic Applications of Tree-Cut Width., , и . MFCS (2), том 9235 из Lecture Notes in Computer Science, стр. 348-360. Springer, (2015)Community Structure Inspired Algorithms for SAT and #SAT., и . SAT, том 9340 из Lecture Notes in Computer Science, стр. 223-237. Springer, (2015)Clique-width: When Hard Does Not Mean Impossible., , и . STACS, том 9 из LIPIcs, стр. 404-415. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Better Polynomial Algorithms on Graphs of Bounded Rank-Width., и . IWOCA, том 5874 из Lecture Notes in Computer Science, стр. 266-277. Springer, (2009)On the Complexity of Rainbow Coloring Problems., , и . IWOCA, том 9538 из Lecture Notes in Computer Science, стр. 209-220. Springer, (2015)Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes., и . IWOCA, том 8288 из Lecture Notes in Computer Science, стр. 164-177. Springer, (2013)On the Complexity Landscape of Connected f -Factor Problems., , , , и . CoRR, (2018)The Complexity of Envy-Free Graph Cutting., , , , и . CoRR, (2023)On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width., и . Discret. Appl. Math., 158 (7): 851-867 (2010)On Existential MSO and Its Relation to ETH., , , и . ACM Trans. Comput. Theory, 12 (4): 22:1-22:32 (2020)