In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
In the strong edge coloring problem, the objective is to color the edges of the given graph with the minimum number of colors so that every color class is an induced matching. In ...
Bounded treewidth and Monadic Second Order (MSO) logic have proved to be key concepts in establishing fixed-parameter tractability results. Indeed, by Courcelle's Theorem we ...
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...
Combinatorial auctions have been studied by the multiagent systems community for some time, since these auctions are an effective mechanism for resource allocation when agents are...