Bidimensionality theory characterizes a broad range of graph problems (bidimensional) that admit efficient approximate, fixed-parameter or kernelâ€¦Â (More)

(More)

Semantic Scholar uses AI to extract papers important to this topic.

2015

2015

We provide an exposition of the main results of the theory of bidimensionality in parameterized algorithm design. This theoryâ€¦Â (More)

Is this relevant?

2014

2014

Let B be a finite collection of geometric (not necessarily convex) bodies in the plane. Clearly, this class of geometric objectsâ€¦Â (More)

Is this relevant?

2012

2012

- Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh
- SODA
- 2012

Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hardâ€¦Â (More)

Is this relevant?

2011

2011

Bidimensionality theory appears to be a powerful framework for the development of meta-algorithmic techniques. It was introducedâ€¦Â (More)

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â€¦Â (More)

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â€¦Â (More)

Is this relevant?

Review

2008

Review

2008

- Erik D. Demaine, Mohammad Taghi Hajiaghayi
- Comput. J.
- 2008

This paper surveys the theory of bidimensionality. This theory characterizes a broad range of graph problems (â€˜bidimensionalâ€¦Â (More)

Is this relevant?

Highly Cited

2008

Highly Cited

2008

- Erik D. Demaine, Mohammad Taghi Hajiaghayi
- Combinatorica
- 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â€¦Â (More)

Is this relevant?

Highly Cited

2005

Highly Cited

2005

- Erik D. Demaine, Mohammad Taghi Hajiaghayi
- SODA
- 2005

We demonstrate a new connection between fixed-parameter tractability and approximation algorithms for combinatorial optimizationâ€¦Â (More)

Is this relevant?

2005

2005

- Erik D. Demaine, Mohammad Taghi Hajiaghayi
- ArXiv
- 2005

In this paper we extend the theory of bidimensionality to two families of graphs that do not exclude fixed minors: map graphs andâ€¦Â (More)

Is this relevant?