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.
2017
2017
Los canales derivadores son estructuras hidraulicas, que desvian parte del agua que circula sobre un rio y la envian hacia una… 
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
We provide an exposition of the main results of the theory of bidimensionality in parameterized algorithm design. This theory… 
2011
2011
A simple PC screen can be considered as an interface of a virtual environment where an user can move objects and interact with… 
2011
2011
Bidimensionality theory provides a general framework for developing subexponential fixed parameter algorithms for NP-hard… 
2010
2010
Analyzing a series of works realized in the media of performance and photography (Vito Acconci, Sophie Calle), video installation… 
2008
2008
Robertson and Seymour developed the seminal Graph MinorTheory over the past two decades. This breakthrough in graph… 
2005
2005
In this paper we extend the theory of bidimensionality to two families of graphs that do not exclude fixed minors: map graphs and… 
2000
2000
Etude de la question de l'immanence et de la transcendance de l'existence par rapport a l'essence, chez Kant et Hegel. L'A…