RNDr. Robert Ganian, Ph.D.

2024

• Computing Twin-Width Parameterized by the Feedback Edge Number

  BALABÁN Jakub GANIAN Robert ROCTON Mathis

  Článek ve sborníku

  41st International Symposium on Theoretical Aspects of Computer Science (STACS 2024), rok: 2024

• Twin-Width Meets Feedback Edges and Vertex Integrity

  BALABÁN Jakub GANIAN Robert ROCTON Mathis

  Článek ve sborníku

  International Symposium on Parameterized and Exact Computation (IPEC), rok: 2024

2022

• Weighted Model Counting with Twin-Width

  GANIAN Robert POKRÝVKA Filip SCHIDLER André SIMONOV Kirill SZEIDER Stefan

  Článek ve sborníku

  25th International Conference on Theory and Applications of Satisfiability Testing (SAT 2022), rok: 2022

2019

• A Join-Based Hybrid Parameter for Constraint Satisfaction

  GANIAN Robert ORDYNIAK Sebastian SZEIDER Stefan

  Článek ve sborníku

  Principles and Practice of Constraint Programming - 25th International Conference, rok: 2019

• Counting Linear Extensions: Parameterizations by Treewidth

  EIBEN Eduard GANIAN Robert KANGAS Kustaa ORDYNIAK Sebastian

  Článek v odborném periodiku

  Algorithmica, rok: 2019, ročník: 81, vydání: 4, DOI

• Group Activity Selection with Few Agent Types

  GANIAN Robert ORDYNIAK Sebastian RAHUL C. S.

  Článek ve sborníku

  27th Annual European Symposium on Algorithms (ESA 2019), rok: 2019

• Integer Programming and Incidence Treedepth

  EIBEN Eduard GANIAN Robert KNOP Dusan ORDYNIAK Sebastian PILIPCZUK Michal WROCHNA Marcin

  Článek ve sborníku

  Integer Programming and Combinatorial Optimization - 20th International Conference, IPCO 2019, rok: 2019

• Measuring what Matters: A Hybrid Approach to Dynamic Programming with Treewidth

  EIBEN Eduard GANIAN Robert HAMM Thekla KWON O-joung

  Článek ve sborníku

  44th International Symposium on Mathematical Foundations of Computer Science (MFCS 2019), rok: 2019

• On Strict (Outer-)Confluent Graphs

  FORSTER Henry GANIAN Robert KLUTE Fabian NOLLENBURG Martin

  Článek ve sborníku

  Graph Drawing and Network Visualization - 27th International Symposium, GD 2019, rok: 2019

• On the Complexity Landscape of Connected f-Factor Problems

  GANIAN Robert NARAYANASWAMY N. S. ORDYNIAK Sebastian RAHUL C. S. RAMANUJAN M. S.

  Článek v odborném periodiku

  Algorithmica, rok: 2019, ročník: 81, vydání: 6, DOI