( en | de | ru )

 

Disambiguation of "Ganian, Robert"

Author of the publication

copydeleteadd this publication to your clipboard
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)

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 Knippschild

Grenzüberschreitende Kooperation: Gestaltung und Management von Kooperationsprozessen in der Raumentwicklung im deutsch-polnisch-tschechischen Grenzraum. Uni Dortmund, (2007)

Robert Wagner

Inkrementelle Modellsynchronisation. Uni Paderborn, (2009)
 

Other publications of authors with the same name

On the complexity of rainbow coloring problems., , and . Discret. Appl. Math., (2018)Foreword: Eighth Workshop on Graph Classes, Optimization, and Width Parameters, Toronto, Ontario, Canada., , and . Discret. Appl. Math., (2020)Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width., , and . Fundam. Informaticae, 123 (1): 59-76 (2013)Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting., , and . CoRR, (2015)Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)., , , and . Dagstuhl Reports, 11 (6): 82-123 (2021)Parameterized Complexity of Asynchronous Border Minimization., , , and . Algorithmica, 81 (1): 201-223 (2019)On Structural Parameterizations of the Edge Disjoint Paths Problem., , and . Algorithmica, 83 (6): 1605-1637 (2021)A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width., , and . Eur. J. Comb., 34 (3): 680-701 (2013)A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion., , and . J. Comput. Syst. Sci., (2018)On the parameterized complexity of clustering problems for incomplete data., , , , and . J. Comput. Syst. Sci., (June 2023)