( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting.

, , и . CoRR, (2015)

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 Klöfkorn

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

Robert Wille

Towards a design flow for reversible logic. Uni Bremen, (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)
 

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

On Existential MSO and its Relation to ETH., , , и . MFCS, том 58 из LIPIcs, стр. 42:1-42:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting., , и . CoRR, (2015)Parameterized Complexity of Asynchronous Border Minimization., , , и . Algorithmica, 81 (1): 201-223 (2019)Integer Programming and Incidence Treedepth., , , , , и . CoRR, (2020)Slim Tree-Cut Width., и . IPEC, том 249 из LIPIcs, стр. 15:1-15:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth., , , и . MFCS, том 138 из LIPIcs, стр. 42:1-42:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)Parameterized Complexity of Envy-Free Resource Allocation in Social Networks., , , и . AAAI, стр. 7135-7142. AAAI Press, (2020)On the Parameterized Complexity of Clustering Incomplete Data into Subspaces of Small Rank., , , и . AAAI, стр. 3906-3913. AAAI Press, (2020)Parameterized Algorithms for Book Embedding Problems., , , и . GD, том 11904 из Lecture Notes in Computer Science, стр. 365-378. Springer, (2019)Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable., , , , и . SoCG, том 258 из LIPIcs, стр. 18:1-18:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)