RNDr. Robert Ganian, Ph.D.
Total number of publications: 82
2014
-
Digraph width measures in parameterized algorithmics
Discrete Applied Mathematics, year: 2014, volume: 168, edition: 1, DOI
-
Lower Bounds on the Complexity of MSO_1 Model-Checking
Journal of Computer and System Sciences, year: 2014, volume: 80, edition: 1, DOI
2013
-
Better algorithms for satisfiability problems for formulas of bounded rank-width
Fundamenta Informaticae, year: 2013, volume: 123, edition: 1, DOI
-
Cops-and-robbers: Remarks and problems
Journal of Combinatorial Mathematics and Combinatorial Computing, year: 2013, volume: 85, edition: 1
-
Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes
Combinatorial Algorithms 24th International Workshop, IWOCA 2013, year: 2013
-
FO Model Checking of Interval Graphs
ICALP (2) 2013, year: 2013
-
Unified Approach to Polynomial Algorithms on Graphs of Bounded (bi-)Rank-width
European Journal of Combinatorics, year: 2013, volume: 34, edition: 3, DOI
2012
-
Can dense graphs be "sparse"?
Year: 2012, type: Conference abstract
-
Lower Bounds on the Complexity of MSO_1 Model-Checking
29th International Symposium on Theoretical Aspects of Computer Science STACS2012, year: 2012
-
Parameterized Algorithms on Width Parameters of Graphs
Year: 2012, type: