( en | de | ru )

 

Disambiguation of "Ganian, Robert"

Author of the publication

copydeleteadd this publication to your clipboard
On Strict (Outer-)Confluent Graphs.

, , , and . GD, volume 11904 of Lecture Notes in Computer Science, page 147-161. Springer, (2019)

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 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)
 

Other publications of authors with the same name

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)Model Checking Existential Logic on Partially Ordered Sets., , and . ACM Trans. Comput. Log., 17 (2): 10 (2016)Parameterized Complexity in Graph Drawing (Dagstuhl Seminar 21293)., , , and . Dagstuhl Reports, 11 (6): 82-123 (2021)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)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)Extending Orthogonal Planar Graph Drawings Is Fixed-Parameter Tractable., , , , and . SoCG, volume 258 of LIPIcs, page 18:1-18:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)