( en | de | ru )

 

Disambiguation of "Ganian, Robert"

Author of the publication

copydeleteadd this publication to your clipboard
The Power of Cut-Based Parameters for Computing Edge Disjoint Paths.

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

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)
 

Other publications of authors with the same name

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