Skip to search formSkip to main contentSkip to account menu

Bidimensionality

Bidimensionality theory characterizes a broad range of graph problems (bidimensional) that admit efficient approximate, fixed-parameter or kernel… 
Wikipedia (opens in a new tab)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2016
2016
The field of complex networks has seen a steady growth in the last decade, fuelled by an ever-growing collection of relational… 
2015
2015
This paper extends Ellis and Stimson’s (Ideology in America. New York: Cambridge UniversityPress, 2012) study of the operational… 
Highly Cited
2011
Highly Cited
2011
Bidimensionality theory appears to be a powerful framework for the development of meta-algorithmic techniques. It was introduced… 
Highly Cited
2010
Highly Cited
2010
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced… 
Highly Cited
2008
Highly Cited
2008
Our newly developing theory of bidimensional graph problems provides general techniques for designing efficient fixed-parameter… 
Highly Cited
2008
Highly Cited
2008
We prove that any H-minor-free graph, for a fixed graph H, of treewidth w has an Ω(w) × Ω(w) grid graph as a minor. Thus grid… 
Review
2008
Review
2008
Highly Cited
2005
Highly Cited
2005
We prove that any H-minor-free graph, for a fixed graph H, of treewidth ω has an Ω(ω) × Ω(ω) grid graph as a minor. Thus grid…