Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Bidimensionality

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

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
We study the problem of finding small s–t separators that induce graphs having certain properties. It is known that finding a… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
2013
2013
In this paper we make the first step beyond bidimensionality by obtaining subexponential time algorithms for problems on directed… Expand
Is this relevant?
Highly Cited
2012
Highly Cited
2012
In this paper we use several of the key ideas from Bidimensionality to give a new generic approach to design EPTASs and… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Bidimensionality theory appears to be a powerful framework for the development of meta-algorithmic techniques. It was introduced… Expand
  • figure 1
Is this relevant?
Highly Cited
2010
Highly Cited
2010
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced… Expand
  • figure 1
Is this relevant?
2009
2009
We provide new combinatorial theorems on the structure of graphs that are contained as contractions in graphs of large treewidth… Expand
  • figure 1
Is this relevant?
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… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We demonstrate a new connection between fixed-parameter tractability and approximation algorithms for combinatorial optimization… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Our newly developing theory of bidimensional graph problems provides general techniques for designing efficient fixed-parameter… Expand
  • figure 1-1
  • figure 1-2
  • figure 2-1
  • figure 2-2
  • figure 2-3
Is this relevant?
2005
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… Expand
Is this relevant?