Folgen
Robert Ganian
Robert Ganian
Bestätigte E-Mail-Adresse bei ac.tuwien.ac.at - Startseite
Titel
Zitiert von
Zitiert von
Jahr
When Trees Grow Low: Shrubs and Fast MSO1
R Ganian, P Hliněný, J Nešetřil, J Obdržálek, P Ossona de Mendez, ...
Mathematical Foundations of Computer Science 2012: 37th International …, 2012
772012
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
762010
Twin-cover: Beyond vertex cover in parameterized algorithmics
R Ganian
International Symposium on Parameterized and Exact Computation, 259-271, 2011
662011
Are there any good digraph width measures?
R Ganian, P Hliněný, J Kneis, D Meister, J Obdržálek, P Rossmanith, ...
Parameterized and Exact Computation: 5th International Symposium, IPEC 2010 …, 2010
602010
The complexity landscape of decompositional parameters for ILP
R Ganian, S Ordyniak
Artificial Intelligence 257, 61-71, 2018
552018
On structural parameterizations of the bounded-degree vertex deletion problem
R Ganian, F Klute, S Ordyniak
Algorithmica 83, 297-336, 2021
532021
Shrub-depth: Capturing height of dense graphs
R Ganian, P Hliněný, J Nešetřil, J Obdržálek, PO De Mendez
Logical Methods in Computer Science 15, 2019
532019
Improving vertex cover as a graph parameter
R Ganian
Discrete Mathematics & Theoretical Computer Science 17 (Discrete Algorithms), 2015
532015
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
532014
On digraph width measures in parameterized algorithmics
R Ganian, P Hliněný, J Kneis, A Langer, J Obdržálek, P Rossmanith
Parameterized and Exact Computation: 4th International Workshop, IWPEC 2009 …, 2009
482009
Using neighborhood diversity to solve hard problems
R Ganian
arXiv preprint arXiv:1201.3091, 2012
452012
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
412016
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
402014
Algorithmic applications of tree-cut width
R Ganian, EJ Kim, S Szeider
International Symposium on Mathematical Foundations of Computer Science, 348-360, 2015
38*2015
FO model checking of interval graphs
R Ganian, P Hlineny, D Král, J Obdrzálek, J Schwartz, J Teska
Logical Methods in Computer Science 11, 2015
342015
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
342013
Going beyond primal treewidth for (M) ILP
R Ganian, S Ordyniak, M Ramanujan
Proceedings of the AAAI Conference on Artificial Intelligence 31 (1), 2017
332017
Combining treewidth and backdoors for CSP
R Ganian, MS Ramanujan, S Szeider
arXiv preprint arXiv:1610.03298, 2016
312016
Thread graphs, linear rank-width and their algorithmic applications
R Ganian
Combinatorial Algorithms: 21st International Workshop, IWOCA 2010, London …, 2011
312011
Discovering archipelagos of tractability for constraint satisfaction and counting
R Ganian, MS Ramanujan, S Szeider
ACM Transactions on Algorithms (TALG) 13 (2), 1-32, 2017
302017
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20