Instruct: Given the title of a paper, retrieve paper titles that are cited by the given paper
Query: Exact (exponential) algorithms for the dominating set problem
Small Maximal Independent Sets and Faster Exact Graph Coloring
Computing Large Matchings in Planar Graphs with Fixed Minimum Degree
Almost-polynomial ratio ETH-hardness of approximating densest k-subgraph
Tight approximation algorithms for maximum general assignment problems
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
An Exponential Lower Bound for Cut Sparsifiers in Planar Graphs
A New 3/2-Approximation Algorithm for the b -Edge Cover Problem.
A Distributed Algorithm for Minimum-Weight Spanning Trees
Improved Approximation Schemes for the Restricted Shortest Path Problem.
New Algorithms for Enumerating All Maximal Cliques
The Design of Approximation Algorithms
An O(log 2 k)-competitive Algorithm for Metric Bipartite Matching
The prize collecting Steiner tree problem: theory and practice
A new approach to the minimum cut problem
A Multilevel Algorithm for the Minimum 2-sum Problem
Complexities of some interesting problems on spanning trees
Approximation algorithms for deadline-TSP and vehicle routing with time-windows
A polylogarithmic approximation algorithm for the group Steiner tree problem
Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms
Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting
ATL: A model transformation tool
On the Solution of Traveling Salesman Problems
Resilience to loss and potential trauma.
Position-aware Attention and Supervised Data Improve Slot Filling
XFI: software guards for system address spaces