Topics in Theoretical Computer Science

s of Invited Talks The Coding Lens in Explicit Constructions

[1]  P. J. Narayanan,et al.  Large Graph Algorithms for Massively Multithreaded Architectures , 2009 .

[2]  Roberto Tamassia,et al.  On the Computational Complexity of Upward and Rectilinear Planarity Testing , 1994, SIAM J. Comput..

[3]  Sumit Kumar,et al.  A modified parallel approach to Single Source Shortest Path Problem for massively dense graphs using CUDA , 2011, 2011 2nd International Conference on Computer and Communication Technology (ICCCT-2011).

[4]  Kurt Mehlhorn,et al.  A Parallelization of Dijkstra's Shortest Path Algorithm , 1998, MFCS.

[5]  R. Tamassia,et al.  Upward planarity testing , 1995 .

[6]  Christian Bachmaier,et al.  Classification of Planar Upward Embedding , 2011, Graph Drawing.

[7]  Christian Bachmaier,et al.  Upward planar graphs and their duals , 2015, Theor. Comput. Sci..

[8]  Naveed A. Sherwani,et al.  Algorithms for VLSI Physical Design Automation , 1999, Springer US.

[9]  Ardeshir Dolati,et al.  On the sphericity testing of single source digraphs , 2008, Discret. Math..

[10]  Nilay Khare,et al.  Modified Dijkstra’s Algorithm for Dense Graphs on GPU using CUDA , 2016 .

[11]  Keval Vora,et al.  CuSha: vertex-centric graph processing on GPUs , 2014, HPDC '14.

[12]  Michael Garland,et al.  Work-Efficient Parallel GPU Methods for Single-Source Shortest Paths , 2014, 2014 IEEE 28th International Parallel and Distributed Processing Symposium.

[13]  Nicola Bombieri,et al.  An Efficient Implementation of the Bellman-Ford Algorithm for Kepler GPU Architectures , 2016, IEEE Transactions on Parallel and Distributed Systems.

[14]  MICHAEL D. HUTTON,et al.  Upward planar drawing of single source acyclic digraphs , 1991, SODA '91.

[15]  S. Mehdi Hashemi,et al.  Upward Drawings to Fit Surfaces , 1994, ORDAL.

[16]  Ulrich Meyer,et al.  Delta-Stepping: A Parallel Single Source Shortest Path Algorithm , 1998, ESA.

[17]  Jeremy G. Siek,et al.  The Boost Graph Library - User Guide and Reference Manual , 2001, C++ in-depth series.

[18]  John D. Owens,et al.  Gunrock: a high-performance graph processing library on the GPU , 2015, PPoPP.

[19]  Roberto Tamassia,et al.  Algorithms for Plane Representations of Acyclic Digraphs , 1988, Theor. Comput. Sci..

[20]  Ardeshir Dolati.  LINEAR SPHERICITY TESTING OF 3-CONNECTED SINGLE SOURCE DIGRAPHS , 2011 .

[21]  Christian Bachmaier,et al.  Rolling Upward Planarity Testing of Strongly Connected Graphs , 2013, WG.

[22]  Carlo Mannino,et al.  Optimal Upward Planarity Testing of Single-Source Digraphs , 1993, ESA.

[23]  Andrzej Kisielewicz,et al.  The Complexity of Upward Drawings on Spheres , 1997 .

[24]  L. R. Ford,et al.  NETWORK FLOW THEORY , 1956 .

[25]  Arturo González-Escribano,et al.  A new GPU-based approach to the Shortest Path problem , 2013, HPCS.

[26]  C. Thomassen.  Planar acyclic oriented graphs , 1989 .

[27]  Michela Becchi,et al.  Deploying Graph Algorithms on GPUs: An Adaptive Solution , 2013, 2013 IEEE 27th International Symposium on Parallel and Distributed Processing.

[28]  Edsger W. Dijkstra,et al.  A note on two problems in connexion with graphs , 1959, Numerische Mathematik.

[29]  Keshav Pingali,et al.  Atomic-free irregular computations on GPUs , 2013, GPGPU@ASPLOS.

[30]  Christian Bachmaier,et al.  The Duals of Upward Planar Graphs on Cylinders , 2012, WG.

[31]  Robert M. Farber,et al.  CUDA Application Design and Development , 2011 .

[32]  Pedro J. Martín,et al.  CUDA Solutions for the SSSP Problem , 2009, ICCS.

[33]  Achilleas Papakostas,et al.  Upward Planarity Testing of Outerplanar Dags ( Extended Abstract ) , 2005 .

[34]  Arturo González-Escribano,et al.  Comprehensive Evaluation of a New GPU-based Approach to the Shortest Path Problem , 2015, 2013 International Conference on High Performance Computing & Simulation (HPCS).

[35]  Ardeshir Dolati.  Digraph Embedding on T h . , 2008 .

[36]  Carlo Mannino,et al.  Upward drawings of triconnected digraphs , 2005, Algorithmica.

[37]  S. Vetrivel,et al.  APPLICATIONS OF GRAPH THEORY IN COMPUTER SCIENCE AN OVERVIEW , 2010 .

[38]  S. Mehdi Hashemi.  Digraph embedding , 2001, Discret. Math..

[39]  Oumarou Sie,et al.  Improving Global Performance on GPU for Algorithms with Main Loop Containing a Reduction Operation: Case of Dijkstra's Algorithm , 2015 .

[40]  Christian Sommer,et al.  Shortest-path queries in static networks , 2014, ACM Comput. Surv..

[41]  Gary L. Miller,et al.  On determining the genus of a graph in O(v O(g)) steps(Preliminary Report) , 1979, STOC.

[42]  Richard Bellman,et al.  ON A ROUTING PROBLEM , 1958 .

[43]  P. J. Narayanan,et al.  Accelerating Large Graph Algorithms on the GPU Using CUDA , 2007, HiPC.

[44]  Nilay Khare,et al.  Efficient Parallel Implementation of Single Source Shortest Path Algorithm on GPU Using CUDA , 2016 .

[45]  Keshav Pingali,et al.  A quantitative study of irregular programs on GPUs , 2012, 2012 IEEE International Symposium on Workload Characterization (IISWC).

[46]  Ardeshir Dolati,et al.  On the Upward Embedding on the Torus , 2008 .