Now showing items 1-6 of 6

• #### A list of parameterized problems in bioinformatics ﻿

(2006-05)
External research report
Open Access
In this report we present a list of problems that originated in bionformatics. Our aim is to collect information on such problems that have been analyzed from the point of view of Parameterized Complexity. For every problem ...
• #### A note on the subgraphs of the (2×\infty)-grid ﻿

(2010-02)
Article
Restricted access - publisher's policy
We give a linear-time algorithm checking whether a graph is a subgraph of the (2×k)-grid for some value of k. Our algorithm is based on a detailed characterization of the structure of such graphs.
• #### Bidimensional parameters and local treewidth ﻿

(2003-10)
External research report
Open Access
For several graph theoretic parameters such as vertex cover and dominating set, it is known that if their values are bounded by k then the treewidth of the graph is bounded by some function of k. This fact is used as the ...
• #### Connected graph searching ﻿

(2010-09-26)
External research report
Open Access
In graph searching game the opponents are a set of searchers and a fugitive in a graph. The searchers try to capture the fugitive by applying some sequence moves that include placement, removal, or sliding of a searcher ...
• #### Efficient algorithms for parameterized H-colorings ﻿

(2005-12)
External research report
Open Access
We study the fixed parameter tractability of the restrictive $H$-coloring and the restrictive list $H$-coloring problems, introduced in~cite{DST01b}. The parameterizations are defined by fixing the number of pre-images of ...
• #### On the existence of Nash equilibria in strategic search games ﻿

(2011)
Conference report
Open Access
We consider a general multi-agent framework in which a set of n agents are roaming a network where m valuable and sharable goods (resources, services, information ....) are hidden in m different vertices of the network. ...