Instruct: Given a paper title, retrieve paper titles that are cited by the given paper
Query: A Robust and Scalable Algorithm for the Steiner Problem in Graphs
Tighter Bounds for Graph Steiner Tree Approximation
A subset spanner for Planar graphs,: with application to subset TSP
approximations for a bottleneck steiner tree problem .
The traveling salesman problem for cubic graphs
The geometry of graphs and some of its algorithmic applications
The Maximum Independent Set Problem in Planar Graphs
A near-optimal approximation algorithm for Asymmetric TSP on embedded graphs
Small Maximal Independent Sets and Faster Exact Graph Coloring
The Constrained Minimum Spanning Tree Problem (Extended Abstract)
Efficient algorithms for finding maximum matching in graphs
Constructing Minimum Connected Dominating Set: Algorithmic approach
A randomized linear-time algorithm to find minimum spanning trees
Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs
A randomized linear-time algorithm for finding minimum spanning trees
Approximations For The Maximum Acyclic Subgraph Problem
An optimal minimum spanning tree algorithm
Learning Steady-States of Iterative Algorithms over Graphs
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
An algorithm for the graph crossing number problem
Parameterized Streaming Algorithms for Vertex Cover
102+ rotifer species (Rotifera: Monogononta) in Broa reservoir (SP., Brazil) on 26 August 1994, with the description of three new species
prediction of air temperature using multi - layer perceptrons with levenberg - marquardt training algorithm .
Denoising images corrupted by impulsive noise using projections onto the epigraph set of the total variation function (PES-TV)
Investigations on speaker adaptation of LSTM RNN models for speech recognition
A new heuristic for rectilinear Steiner trees