RNDr. Robert Ganian, Ph.D.
Počet publikací: 82
2017
-
Combining Treewidth and Backdoors for CSP
34th Symposium on Theoretical Aspects of Computer Science, STACS 2017, March 8-11, 2017, Hannover, Germany, rok: 2017
-
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting
ACM Transactions on Algorithms, rok: 2017, ročník: 13, vydání: 2, DOI
-
Going Beyond Primal Treewidth for {(M)ILP}
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA, rok: 2017
-
New Width Parameters for Model Counting
Theory and Applications of Satisfiability Testing - {SAT} 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings, rok: 2017
-
On Structural Parameterizations of the Edge Disjoint Paths Problem
28th International Symposium on Algorithms and Computation, ISAAC 2017, December 9-12, 2017, Phuket, Thailand, rok: 2017
-
Solving Integer Linear Programs with a Small Number of Global Variables and Constraints
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, {IJCAI} 2017, Melbourne, Australia, August 19-25, 2017, rok: 2017
-
Towards a Polynomial Kernel for Directed Feedback Vertex Set
42nd International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2017, August 21-25, 2017 - Aalborg, Denmark, rok: 2017
2016
-
A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion
41st International Symposium on Mathematical Foundations of Computer Science, {MFCS} 2016, August 22-26, 2016 - Krak{\'{o}}w, Poland, rok: 2016
-
Are there any good digraph width measures?
Journal of Combinatorial Theory, Ser B, rok: 2016, ročník: 116, vydání: 1, DOI
-
Backdoors to Tractable Valued CSP
PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING, CP 2016, rok: 2016