Instruct: Given the title of a scientific paper, retrieve paper titles that are cited by the given paper.
Query: The Constant Inapproximability of the Parameterized Dominating Set Problem
The Parameterized Complexity of k-Biclique
Dominator Tree Certification and Independent Spanning Trees
The Maximum Clique Problem
approximation algorithms for independence and domination on b1 - vpg and b1 - epg graphs .
Approximation algorithms and hardness results for cycle packing problems
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
A HYBRID HEURISTIC FOR THE MINIMUM WEIGHT VERTEX COVER PROBLEM
Approximation Algorithms for Partial Covering Problems
DNA Solution of the Maximal Clique Problem
A tutorial on branch and cut algorithms for the maximum stable set problem
Dominator Tree Certification and Divergent Spanning Trees
Bin Packing Problem: Two Approximation Algorithms
A Fast , Adaptive Variant of the Goemans-Williamson Scheme for the Prize-Collecting Steiner Tree Problem
Towards polynomial lower bounds for dynamic problems
Valued Constraint Satisfaction Problems: Hard and Easy Problems
A subset spanner for Planar graphs,: with application to subset TSP
Parameterized Streaming Algorithms for Vertex Cover
An efficient parameterized algorithm for m-set packing
Reducibility Among Combinatorial Problems
EEG-based continuous control of a game using a 3 channel motor imagery BCI: BCI game
A mobile interface for navigating hierarchical information space
Linear time algorithm for computing a small biclique in graphs without long induced paths
Characterizing data usage patterns in a large cellular network
Associations among facial masculinity, physical strength, fluctuating asymmetry and attractiveness in young men and women.