activity
20092011
most citedFaster Approximation Schemes and Parameterized Algorithms on H-Minor-Free and Odd-Minor-Free Graphs

10 citations · 12 across the 6 of their papers we have counts for

collaborators
Showing 2011Show all

2 papers · 1 filter

cs.CC2011

Computing hypergraph width measures exactly

Lukas Moll, Siamak Tazari, Marc Thurley

Hypergraph width measures are a class of hypergraph invariants important in studying the complexity of constraint satisfaction problems (CSPs). We present a general exact exponenti…

cs.DM2011

Directed Nowhere Dense Classes of Graphs

Stephan Kreutzer, Siamak Tazari

We introduce the concept of shallow directed minors and based on this a new classification of classes of directed graphs which is diametric to existing directed graph decomposition…