Robert Ganian

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.

[BibT_eX]

[DOI]

Proceedings of the 42nd International Symposium on Mathematical Foundations of Computer Science, 2017

On Structural Parameterizations of the Edge Disjoint Paths Problem.

[BibT_eX]

[DOI]

Ramanujan Sridharan

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

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

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Going Beyond Primal Treewidth for (M)ILP.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2016

On the Complexity Landscape of Connected f-Factor Problems.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

On Existential MSO and its Relation to ETH.

[BibT_eX]

[DOI]

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

A Single-Exponential Fixed-Parameter Algorithm for Distance-Hereditary Vertex Deletion.

[BibT_eX]

[DOI]

O-joung Kwon

Proceedings of the 41st International Symposium on Mathematical Foundations of Computer Science, 2016

Polynomial-Time Construction of Optimal MPI Derived Datatype Trees.

[BibT_eX]

[DOI]

Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

Counting Linear Extensions: Parameterizations by Treewidth.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

Backdoors to Tractable Valued CSP.

[BibT_eX]

[DOI]

Proceedings of the Principles and Practice of Constraint Programming, 2016

The Complexity Landscape of Decompositional Parameters for ILP.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

Using Decomposition-Parameters for QBF: Mind the Prefix!

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

Improving Vertex Cover as a Graph Parameter.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2015

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

[BibT_eX]

[DOI]

CoRR, 2015

Solving Problems on Graphs of High Rank-Width.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015

Parameterized Complexity of Asynchronous Border Minimization.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Models of Computation, 2015

Community Structure Inspired Algorithms for SAT and #SAT.

[BibT_eX]

[DOI]

Proceedings of the Theory and Applications of Satisfiability Testing - SAT 2015, 2015

Algorithmic Applications of Tree-Cut Width.

[BibT_eX]

[DOI]

Eun Jung Kim

Proceedings of the Mathematical Foundations of Computer Science 2015, 2015

Meta-kernelization using Well-structured Modulators.

[BibT_eX]

[DOI]

Proceedings of the 10th International Symposium on Parameterized and Exact Computation, 2015

On the Complexity of Rainbow Coloring Problems.

[BibT_eX]

[DOI]

Juho Lauri

Proceedings of the Combinatorial Algorithms - 26th International Workshop, 2015

2014

Lower bounds on the complexity of MSO<sub>1</sub> model-checking.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2014

Quantified Conjunctive Queries on Partially Ordered Sets.

[BibT_eX]

[DOI]

Simone Bova

Proceedings of the Parameterized and Exact Computation - 9th International Symposium, 2014

Model checking existential logic on partially ordered sets.

[BibT_eX]

[DOI]

Simone Bova

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

A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width.

[BibT_eX]

[DOI]

Eur. J. Comb., 2013

Meta-kernelization with Structural Parameters.

[BibT_eX]

[DOI]

Friedrich Slivovsky

Proceedings of the Mathematical Foundations of Computer Science 2013, 2013

Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 24th International Workshop, 2013

FO Model Checking of Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012

Using Neighborhood Diversity to Solve Hard Problems

[BibT_eX]

[DOI]

CoRR, 2012

Lower Bounds on the Complexity of MSO_1 Model-Checking.

[BibT_eX]

[DOI]

Proceedings of the 29th International Symposium on Theoretical Aspects of Computer Science, 2012

When Trees Grow Low: Shrubs and Fast MSO1.

[BibT_eX]

[DOI]

Patrice Ossona de Mendez

Reshma Ramadurai

Proceedings of the Mathematical Foundations of Computer Science 2012, 2012

2011

Lower Bounds on the Complexity of MSO1 Model-Checking

[BibT_eX]

[DOI]

CoRR, 2011

Clique-width: When Hard Does Not Mean Impossible.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2011: Theory and Practice of Computer Science, 2011

Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

Are There Any Good Digraph Width Measures?

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

Thread Graphs, Linear Rank-Width and Their Algorithmic Applications.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms - 21st International Workshop, 2010

Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width.

[BibT_eX]

[DOI]

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2010

2009

The Parameterized Complexity of Oriented Colouring.

[BibT_eX]

[DOI]

Proceedings of the Annual Doctoral Workshop on Mathematical and Engineering Methods in Computer Science, 2009

On Digraph Width Measures in Parameterized Algorithmics.

[BibT_eX]

[DOI]

Proceedings of the Parameterized and Exact Computation, 4th International Workshop, 2009

Better Polynomial Algorithms on Graphs of Bounded Rank-Width.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

Automata approach to graphs of bounded rank-width.

[BibT_eX]