Robert Ganian

From MaRDI portal
Person:395001

Available identifiers

zbMath Open ganian.robertWikidataQ102398681 ScholiaQ102398681MaRDI QIDQ395001

List of research outcomes

PublicationDate of PublicationType
Maximizing Social Welfare in Score-Based Social Distance Games2024-02-28Paper
Hedonic diversity games: a complexity picture with more than two colors2023-12-14Paper
Testing upward planarity of partial 2-trees2023-08-16Paper
Edge-cut width: an algorithmically driven analogue of treewidth based on edge cuts2023-05-05Paper
Group activity selection with few agent types2023-04-28Paper
On the parameterized complexity of clustering problems for incomplete data2023-03-10Paper
https://portal.mardi4nfdi.de/entity/Q58742842023-02-07Paper
Parameterized complexity of envy-free resource allocation in social networks2023-01-04Paper
Algorithmic Applications of Tree-Cut Width2022-11-15Paper
Parameterized Algorithms for Queue Layouts2022-11-14Paper
Threshold Treewidth and Hypertree Width2022-08-30Paper
https://portal.mardi4nfdi.de/entity/Q50924042022-07-21Paper
https://portal.mardi4nfdi.de/entity/Q50891972022-07-18Paper
On Strict (Outer-)Confluent Graphs2022-06-28Paper
On Covering Segments with Unit Intervals2022-06-03Paper
Sum-of-Products with Default Values: Algorithms and Complexity Results2022-05-16Paper
https://portal.mardi4nfdi.de/entity/Q50757912022-05-11Paper
On Existential MSO and Its Relation to ETH2022-03-07Paper
An efficient algorithm for counting Markov equivalent DAGs2022-03-02Paper
Parameterized Algorithms for Queue Layouts2021-12-01Paper
New width parameters for SAT and \#SAT2021-11-02Paper
The complexity landscape of decompositional parameters for ILP: programs with few global variables and constraints2021-11-02Paper
Measuring what matters: a hybrid approach to dynamic programming with treewidth2021-07-06Paper
On structural parameterizations of the edge disjoint paths problem2021-06-11Paper
Towards a polynomial kernel for directed feedback vertex set2021-04-19Paper
The power of cut-based parameters for computing edge-disjoint paths2021-03-26Paper
On structural parameterizations of the bounded-degree vertex deletion problem2021-02-01Paper
Parameterized Algorithms for Book Embedding Problems2020-12-18Paper
https://portal.mardi4nfdi.de/entity/Q51362552020-11-25Paper
On strict (outer-)confluent graphs2020-10-26Paper
Parameterized algorithms for book embedding problems2020-10-26Paper
https://portal.mardi4nfdi.de/entity/Q33041262020-08-05Paper
https://portal.mardi4nfdi.de/entity/Q33041322020-08-05Paper
https://portal.mardi4nfdi.de/entity/Q51112502020-05-26Paper
Using decomposition-parameters for QBF: mind the prefix!2020-03-13Paper
The power of cut-based parameters for computing edge disjoint paths2020-02-24Paper
Integer programming and incidence treedepth2020-02-06Paper
SAT-Encodings for Treecut Width and Treedepth2019-09-13Paper
On Strict (Outer-)Confluent Graphs2019-08-14Paper
On the complexity landscape of connected \(f\)-factor problems2019-05-17Paper
https://portal.mardi4nfdi.de/entity/Q46256952019-02-25Paper
Parameterized complexity of asynchronous border minimization2019-01-11Paper
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting2018-11-05Paper
Meta-kernelization using well-structured modulators2018-09-17Paper
A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion2018-09-07Paper
Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting2018-07-16Paper
On the complexity of rainbow coloring problems2018-06-27Paper
The complexity landscape of decompositional parameters for ILP2018-05-16Paper
Model checking existential logic on partially ordered sets2018-04-23Paper
https://portal.mardi4nfdi.de/entity/Q46366352018-04-19Paper
Solving problems on graphs of high rank-width2018-04-06Paper
https://portal.mardi4nfdi.de/entity/Q46085932018-03-21Paper
https://portal.mardi4nfdi.de/entity/Q46086022018-03-21Paper
https://portal.mardi4nfdi.de/entity/Q46086032018-03-21Paper
https://portal.mardi4nfdi.de/entity/Q46063102018-03-02Paper
Backdoor treewidth for SAT2017-11-15Paper
New width parameters for model counting2017-11-15Paper
https://portal.mardi4nfdi.de/entity/Q53637652017-09-29Paper
Model checking existential logic on partially ordered sets2017-07-12Paper
Shrub-depth: Capturing Height of Dense Graphs2017-07-02Paper
On the complexity of rainbow coloring problems2016-04-04Paper
Quantified conjunctive queries on partially ordered sets2016-02-18Paper
FO Model Checking of Interval Graphs2016-01-07Paper
Are there any good digraph width measures?2015-12-11Paper
Meta-kernelization with structural parameters2015-12-11Paper
https://portal.mardi4nfdi.de/entity/Q34550322015-12-03Paper
Community Structure Inspired Algorithms for SAT and #SAT2015-11-20Paper
Solving Problems on Graphs of High Rank-Width2015-10-30Paper
Parameterized complexity of asynchronous border minimization2015-09-30Paper
Algorithmic Applications of Tree-Cut Width2015-09-16Paper
Quantified Conjunctive Queries on Partially Ordered Sets2015-09-15Paper
Digraph width measures in parameterized algorithmics2014-04-02Paper
Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking2014-01-28Paper
Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes2014-01-17Paper
Meta-kernelization with Structural Parameters2013-09-20Paper
FO Model Checking of Interval Graphs2013-08-07Paper
https://portal.mardi4nfdi.de/entity/Q52989102013-06-25Paper
Better Algorithms for Satisfiability Problems for Formulas of Bounded Rank-width2013-04-18Paper
A unified approach to polynomial algorithms on graphs of bounded (bi-)rank-width2013-01-24Paper
https://portal.mardi4nfdi.de/entity/Q29173122012-09-28Paper
When Trees Grow Low: Shrubs and Fast MSO12012-09-25Paper
https://portal.mardi4nfdi.de/entity/Q29088382012-08-29Paper
https://portal.mardi4nfdi.de/entity/Q29047732012-08-23Paper
Twin-Cover: Beyond Vertex Cover in Parameterized Algorithmics2012-06-15Paper
https://portal.mardi4nfdi.de/entity/Q31137052012-01-23Paper
https://portal.mardi4nfdi.de/entity/Q31042532011-12-19Paper
Thread Graphs, Linear Rank-Width and Their Algorithmic Applications2011-05-19Paper
New Results on the Complexity of the Max- and Min-Rep Problems2011-02-15Paper
Are There Any Good Digraph Width Measures?2010-12-07Paper
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width2010-05-25Paper
New Results on the Complexity of Oriented Colouring on Restricted Digraph Classes2010-01-28Paper
On Digraph Width Measures in Parameterized Algorithmics2010-01-14Paper
Better Polynomial Algorithms on Graphs of Bounded Rank-Width2009-12-11Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Robert Ganian