The following pages link to Robert Ganian (Q395001):
Displaying 50 items.
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (Q395003) (← links)
- Are there any good digraph width measures? (Q896003) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width (Q972346) (← links)
- On the complexity of rainbow coloring problems (Q1647834) (← links)
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion (Q1672007) (← links)
- Backdoor treewidth for SAT (Q1680239) (← links)
- New width parameters for model counting (Q1680240) (← links)
- Solving problems on graphs of high rank-width (Q1709595) (← links)
- The complexity landscape of decompositional parameters for ILP (Q1749387) (← links)
- Parameterized complexity of asynchronous border minimization (Q1755787) (← links)
- A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width (Q1933649) (← links)
- On structural parameterizations of the edge disjoint paths problem (Q2032342) (← links)
- Measuring what matters: a hybrid approach to dynamic programming with treewidth (Q2040028) (← links)
- On strict (outer-)confluent graphs (Q2206846) (← links)
- Parameterized algorithms for book embedding problems (Q2206870) (← links)
- On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
- New width parameters for SAT and \#SAT (Q2238644) (← links)
- The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints (Q2238737) (← links)
- Integer programming and incidence treedepth (Q2293088) (← links)
- The power of cut-based parameters for computing edge disjoint paths (Q2301542) (← links)
- Using decomposition-parameters for QBF: mind the prefix! (Q2304627) (← links)
- Meta-kernelization using well-structured modulators (Q2413976) (← links)
- On the complexity landscape of connected \(f\)-factor problems (Q2414869) (← links)
- Digraph width measures in parameterized algorithmics (Q2442211) (← links)
- Quantified conjunctive queries on partially ordered sets (Q2634671) (← links)
- The power of cut-based parameters for computing edge-disjoint paths (Q2659778) (← links)
- Towards a polynomial kernel for directed feedback vertex set (Q2663705) (← links)
- An efficient algorithm for counting Markov equivalent DAGs (Q2667829) (← links)
- Parameterized complexity of envy-free resource allocation in social networks (Q2680801) (← links)
- On the parameterized complexity of clustering problems for incomplete data (Q2689366) (← links)
- Group activity selection with few agent types (Q2701380) (← links)
- Meta-kernelization with Structural Parameters (Q2849933) (← links)
- Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes (Q2870025) (← links)
- Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics (Q2891355) (← links)
- Lower bounds on the complexity of \(\mathrm{MSO}_1\) model-checking (Q2904773) (← links)
- Better algorithms for satisfiability problems for formulas of bounded rank-width (Q2908838) (← links)
- When Trees Grow Low: Shrubs and Fast MSO1 (Q2912741) (← links)
- The parameterized complexity of oriented colouring (Q2917312) (← links)
- Quantified Conjunctive Queries on Partially Ordered Sets (Q2946013) (← links)
- Algorithmic Applications of Tree-Cut Width (Q2946405) (← links)
- Thread Graphs, Linear Rank-Width and Their Algorithmic Applications (Q3000492) (← links)
- Are There Any Good Digraph Width Measures? (Q3058698) (← links)
- New Results on the Complexity of the Max- and Min-Rep Problems (Q3075522) (← links)
- (Q3104253) (← links)
- Clique-width: when hard does not mean impossible (Q3113705) (← links)
- Small Resolution Proofs for QBF using Dependency Treewidth (Q3304126) (← links)
- On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem (Q3304132) (← links)
- New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes (Q3401108) (← links)
- Solving Problems on Graphs of High Rank-Width (Q3449829) (← links)
