Robert Ganian

According to our database1, Robert Ganian authored at least 82 papers between 2008 and 2018.

Collaborative distances :

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
On the complexity of rainbow coloring problems.
Discrete Applied Mathematics, 2018

Parameterized Algorithms for the Matrix Completion Problem.
CoRR, 2018

Solving Problems on Graphs of High Rank-Width.
Algorithmica, 2018

The complexity landscape of decompositional parameters for ILP.
Artif. Intell., 2018

On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

Small Resolution Proofs for QBF using Dependency Treewidth.
Proceedings of the 35th Symposium on Theoretical Aspects of Computer Science, 2018

A Structural Approach to Activity Selection.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Unary Integer Linear Programming with Structural Restrictions.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Parameterized Algorithms for the Matrix Completion Problem.
Proceedings of the 35th International Conference on Machine Learning, 2018

2017
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting.
ACM Trans. Algorithms, 2017

Small Resolution Proofs for QBF using Dependency Treewidth.
CoRR, 2017

On Structural Parameterizations of the Edge Disjoint Paths Problem.
CoRR, 2017

Shrub-depth: Capturing Height of Dense Graphs.
CoRR, 2017

Solving Integer Linear Programs with a Small Number of Global Variables and Constraints.
CoRR, 2017

Combining Treewidth and Backdoors for CSP.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

New Width Parameters for Model Counting.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Backdoor Treewidth for SAT.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28, 2017

Towards a Polynomial Kernel for Directed Feedback Vertex Set.
Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

On Structural Parameterizations of the Edge Disjoint Paths Problem.
Proceedings of the 28th International Symposium on Algorithms and Computation, 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, 2017

Going Beyond Primal Treewidth for (M)ILP.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Model Checking Existential Logic on Partially Ordered Sets.
ACM Trans. Comput. Log., 2016

Quantified conjunctive queries on partially ordered sets.
Theor. Comput. Sci., 2016

Are there any good digraph width measures?
J. Comb. Theory, Ser. B, 2016

Meta-kernelization with structural parameters.
J. Comput. Syst. Sci., 2016

Backdoors to Tractable Valued CSP.
CoRR, 2016

Combining Treewidth and Backdoors for CSP.
CoRR, 2016

A single-exponential fixed-parameter algorithm for Distance-Hereditary Vertex Deletion.
CoRR, 2016

Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting.
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

On the Complexity Landscape of Connected f-Factor Problems.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

On Existential MSO and its Relation to ETH.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion.
Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Polynomial-Time Construction of Optimal MPI Derived Datatype Trees.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

Counting Linear Extensions: Parameterizations by Treewidth.
Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Backdoors to Tractable Valued CSP.
Proceedings of the Principles and Practice of Constraint Programming, 2016

The Complexity Landscape of Decompositional Parameters for ILP.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Using Decomposition-Parameters for QBF: Mind the Prefix!
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Improving Vertex Cover as a Graph Parameter.
Discrete Mathematics & Theoretical Computer Science, 2015

FO Model Checking of Interval Graphs
Logical Methods in Computer Science, 2015

Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting.
CoRR, 2015

Polynomial-time Construction of Optimal Tree-structured Communication Data Layout Descriptions.
CoRR, 2015

Parameterized Complexity of Asynchronous Border Minimization.
CoRR, 2015

Meta-Kernelization using Well-Structured Modulators.
CoRR, 2015

Solving Problems on Graphs of High Rank-Width.
CoRR, 2015

On the Complexity of Rainbow Coloring Problems.
CoRR, 2015

Solving Problems on Graphs of High Rank-Width.
Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Parameterized Complexity of Asynchronous Border Minimization.
Proceedings of the Theory and Applications of Models of Computation, 2015

Community Structure Inspired Algorithms for SAT and #SAT.
Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Algorithmic Applications of Tree-Cut Width.
Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Meta-kernelization using Well-structured Modulators.
Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

On the Complexity of Rainbow Coloring Problems.
Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014
Lower bounds on the complexity of MSO1 model-checking.
J. Comput. Syst. Sci., 2014

Digraph width measures in parameterized algorithmics.
Discrete Applied Mathematics, 2014

Quantified Conjunctive Queries on Partially Ordered Sets.
CoRR, 2014

Model Checking Existential Logic on Partially Ordered Sets.
CoRR, 2014

Quantified Conjunctive Queries on Partially Ordered Sets.
Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

Model checking existential logic on partially ordered sets.
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2014

2013
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width.
Fundam. Inform., 2013

A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width.
Eur. J. Comb., 2013

Meta-Kernelization with Structural Parameters
CoRR, 2013

Expanding the expressive power of Monadic Second-Order logic on restricted graph classes.
CoRR, 2013

Meta-kernelization with Structural Parameters.
Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes.
Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

FO Model Checking of Interval Graphs.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Using Neighborhood Diversity to Solve Hard Problems
CoRR, 2012

Lower Bounds on the Complexity of MSO_1 Model-Checking.
Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

When Trees Grow Low: Shrubs and Fast MSO1.
Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011
Lower Bounds on the Complexity of MSO1 Model-Checking
CoRR, 2011

Clique-width: When Hard Does Not Mean Impossible.
Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

New Results on the Complexity of the Max- and Min-Rep Problems.
Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics.
Proceedings of the Parameterized and Exact Computation - 6th International Symposium, 2011

2010
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width.
Discrete Applied Mathematics, 2010

Better algorithms for satisfiability problems for formulas of bounded rank-width
CoRR, 2010

Are there any good digraph width measures?
CoRR, 2010

New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes.
Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Are There Any Good Digraph Width Measures?
Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

Thread Graphs, Linear Rank-Width and Their Algorithmic Applications.
Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width.
Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009
The Parameterized Complexity of Oriented Colouring.
Proceedings of the Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, 2009

On Digraph Width Measures in Parameterized Algorithmics.
Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Better Polynomial Algorithms on Graphs of Bounded Rank-Width.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008
Automata approach to graphs of bounded rank-width.
Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008


  Loading...