Robert Ganian
Robert Ganian
E-mailová adresa ověřena na: ac.tuwien.ac.at - Domovská stránka
Název
Citace
Citace
Rok
On parse trees and Myhill–Nerode-type tools for handling graphs of bounded rank-width
R Ganian, P Hliněný
Discrete Applied Mathematics 158 (7), 851-867, 2010
662010
When Trees Grow Low: Shrubs and Fast MSO1
R Ganian, P Hliněný, J Nešetřil, J Obdržálek, PO de Mendez, ...
International Symposium on Mathematical Foundations of Computer Science, 419-430, 2012
602012
Are there any good digraph width measures?
R Ganian, P Hliněný, J Kneis, D Meister, J Obdržálek, P Rossmanith, ...
International Symposium on Parameterized and Exact Computation, 135-146, 2010
562010
On digraph width measures in parameterized algorithmics
R Ganian, P Hliněný, J Kneis, A Langer, J Obdržálek, P Rossmanith
International Workshop on Parameterized and Exact Computation, 185-197, 2009
472009
Twin-cover: Beyond vertex cover in parameterized algorithmics
R Ganian
International Symposium on Parameterized and Exact Computation, 259-271, 2011
452011
Using neighborhood diversity to solve hard problems
R Ganian
arXiv preprint arXiv:1201.3091, 2012
392012
Digraph width measures in parameterized algorithmics
R Ganian, P Hliněný, J Kneis, A Langer, J Obdržálek, P Rossmanith
Discrete applied mathematics 168, 88-107, 2014
372014
The complexity landscape of decompositional parameters for ILP
R Ganian, S Ordyniak
Artificial Intelligence 257, 61-71, 2018
342018
Better algorithms for satisfiability problems for formulas of bounded rank-width
R Ganian, P Hliněný, J Obdržálek
Fundamenta Informaticae 123 (1), 59-76, 2013
332013
Lower bounds on the complexity of MSO1 model-checking
R Ganian, P Hliněný, A Langer, J Obdržálek, P Rossmanith, S Sikdar
Journal of Computer and System Sciences 80 (1), 180-194, 2014
302014
Are there any good digraph width measures?
R Ganian, P Hliněný, J Kneis, D Meister, J Obdržálek, P Rossmanith, ...
Journal of Combinatorial Theory, Series B 116, 250-286, 2016
272016
Improving vertex cover as a graph parameter
R Ganian
Discrete Mathematics & Theoretical Computer Science 17, 2015
272015
Thread graphs, linear rank-width and their algorithmic applications
R Ganian
International Workshop on Combinatorial Algorithms, 38-42, 2010
272010
Shrub-depth: Capturing height of dense graphs
R Ganian, P Hliněný, J Nešetřil, J Obdržálek, PO De Mendez
arXiv preprint arXiv:1707.00359, 2017
252017
Going beyond primal treewidth for (M) ILP
R Ganian, S Ordyniak, M Ramanujan
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
252017
Model checking existential logic on partially ordered sets
S Bova, R Ganian, S Szeider
ACM Transactions on Computational Logic (TOCL) 17 (2), 1-35, 2015
252015
FO model checking of interval graphs
R Ganian, P Hliněný, D Král, J Obdržálek, J Schwartz, J Teska
International Colloquium on Automata, Languages, and Programming, 250-262, 2013
232013
Algorithmic applications of tree-cut width
R Ganian, EJ Kim, S Szeider
International Symposium on Mathematical Foundations of Computer Science, 348-360, 2015
212015
Solving integer linear programs with a small number of global variables and constraints
P Dvořák, E Eiben, R Ganian, D Knop, S Ordyniak
arXiv preprint arXiv:1706.06084, 2017
202017
Clique-width: When hard does not mean impossible
R Ganian, P Hlineny, J Obdrzálek
28th International Symposium on Theoretical Aspects of Computer Science …, 2011
192011
Systém momentálně nemůže danou operaci provést. Zkuste to znovu později.
Články 1–20