( en | de | ru )

 

Disambiguation of "Ganian, Robert"

Author of the publication

copydeleteadd this publication to your clipboard
Integer Programming and Incidence Treedepth.

, , , , , and . CoRR, (2020)

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)

Dr. rer. nat. Robert Jäschke Universität Kassel

A Repository for Formal Contexts, and . Proceedings of the 1st International Joint Conference on Conceptual Knowledge Structures, (2024)

Robert Wagner

Inkrementelle Modellsynchronisation. Uni Paderborn, (2009)
 

Other publications of authors with the same name

Parameterized Algorithms for Queue Layouts., , , and . J. Graph Algorithms Appl., 26 (3): 335-352 (2022)On Strict (Outer-)Confluent Graphs., , , and . J. Graph Algorithms Appl., 25 (1): 481-512 (2021)Counting Linear Extensions: Parameterizations by Treewidth., , , and . Algorithmica, 81 (4): 1657-1683 (2019)On the Complexity Landscape of Connected f-Factor Problems., , , , and . Algorithmica, 81 (6): 2606-2632 (2019)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)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)Edge-Cut Width: An Algorithmically Driven Analogue of Treewidth Based on Edge Cuts., , , , and . WG, volume 13453 of Lecture Notes in Computer Science, page 98-113. Springer, (2022)The Power of Cut-Based Parameters for Computing Edge Disjoint Paths., and . WG, volume 11789 of Lecture Notes in Computer Science, page 190-204. Springer, (2019)Graphs with Two Moplexes., , , , and . LAGOS, volume 195 of Procedia Computer Science, page 248-256. Elsevier, (2021)Automata approach to graphs of bounded rank-width., and . IWOCA, page 4-15. College Publications, (2008)