Articles under category:
Graphs
Graphs
Vol 12, Article 19 (pp 133)
Locally Checkable Proofs in Distributed Computing by Mika Göös and Jukka Suomela 
Vol 11, Article 13 (pp 339355)
Computing the Partition Function for Cliques in a Graph by Alexander Barvinok 
Vol 9, Article 24 (pp 759781)
[APRXRND12 Spec Issue]
Hardness of Vertex Deletion and Project Scheduling by Ola Svensson 
Vol 9, Article 11 (pp 413435)
Improved Inapproximability Results for Maximum $k$Colorable Subgraph by Venkatesan Guruswami and Ali Kemal Sinop 
Vol 9, Article 6 (pp 273282)
[NOTE]
The Complexity of the Fermionant and Immanants of Constant Width by Stephan Mertens and Cristopher Moore 
Vol 8, Article 25 (pp 567595)
[Motwani Special Issue]
Online Graph EdgeColoring in the RandomOrder Arrival Model by Bahman Bahmani, Aranyak Mehta, and Rajeev Motwani 
Vol 8, Article 18 (pp 401413)
[Motwani Special Issue]
An $O(k^3\log n)$Approximation Algorithm for VertexConnectivity Survivable Network Design by Julia Chuzhoy and Sanjeev Khanna 
Vol 7, Article 3 (pp 2743)
Inapproximability of Vertex Cover and Independent Set in Bounded Degree Graphs by Per Austrin, Subhash Khot, and Muli Safra 
Vol 6, Article 12 (pp 291308)
[RESEARCH SURVEY]
Monotone Expanders: Constructions and Applications by Zeev Dvir and Avi Wigderson 
Vol 5, Article 9 (pp 173189)
All Pairs Bottleneck Paths and MaxMin Matrix Products in Truly Subcubic Time by Virginia Vassilevska, R. Ryan Williams, and Raphael Yuster 
Vol 4, Article 9 (pp 191193)
[COMMENT]
On the LP Relaxation of the Asymmetric Traveling Salesman Path Problem by Viswanath Nagarajan 
Vol 4, Article 1 (pp 120)
Single Source Multiroute Flows and Cuts on Uniform Capacity Networks by Henning Bruhn, Jakub Černý, Alexander Hall, Petr Kolman, and Jiří Sgall 
Vol 3, Article 10 (pp 197209)
An O(log n) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem by Chandra Chekuri and Martin Pál 
■

Vol 2, Article 7 (pp 137146)
An O(√n) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow by Chandra Chekuri, Sanjeev Khanna, and F. Bruce Shepherd 
Vol 2, Article 5 (pp 91120)
Iterative Construction of Cayley Expander Graphs by Eyal Rozenman, Aner Shalev, and Avi Wigderson 