My primary research areas are large-scale graph analysis and combinatorial scientific computing, which deals with combinatorial problems arising in applications and algorithms of scientific computing. My early work was on traditional applications of combinatorial scientific computing such as sparse matrix computations and parallel computing, where the combinatorial algorithms work on the back stage to play an enabling role. Recently, I have started looking at areas where combinatorial problems are directly associated with scientific and engineering goals.

Before joining Sandia, I worked at Lawrence Berkeley National Laboratory between Oct 2001 and Oct 2008. And before that I received my PhD in Computer science with the option of computational science and engineering from University of Illinois at Urbana Champaign (1997--2001), my M.S. and B.S. in Computer Science from Bilkent University, Turkey, in 1994 and 1996, respectively.

For more information about my work, yo ucan look at my CV ...

Recent Activities

• I am on the program or organizing committees of
  • DOE Applied Mathematics Program Meeting
  
  SIAM International Conference on Data Mining
  
• My Near-term travel schedule
• Joint Mathematics Meetings, Boston, MA, Jan 4-7 2012
• SIAM Parallel Processing, Savannah, GA, Feb 14-16, 2012
• SIAM Annual Meeting, Minneapolis, MN, July 2012

Research Projects

• Scalable Mathods for Modeling Networks


• Statistically Significant Relational Data Mining


• Quantifiable Secure Power Systems Operations and Planning

Recent Publications

Modeling and Analysis of Graphs

• C. Seshadhri, A. Pinar, and T. Kolda, " Fast Triangle Counting through Wedge Sampling," submitted.
• C. Seshadhri, T. Kolda, and A. Pinar, Community structure and scale-free collections of Erdos--Renyi graphs, to appear in Physical Review E
• J. Ray, A. Pinar, and C. Sehadhri, " Are we there yet? When to stop a Markov chain while generating random graphs," to appear in WAW 12.
• A. Pinar, C. Seshadhri, and T.Kolda," The Similarity between Stochastic Kronecker and Chung-Lu Graph Models, to appear in SDM'12 " arxiv link
• C. Seshadhri, A. Pinar, and T.Kolda, " An In-Depth Analysis of Stochastiic Kronecker Graphs" Available at arxiv.
• M. Rocklin and A. Pinar, " On Clustering on Graphs with Multiple Edge Types " submitted for journal publication. (pdf)
• I. Stanton and A. Pinar, " Constructing and sampling graphs with prescribed joint degree distribution using Markov Chains ", submitted to ACM Journal of Experimental Algorithmics . (pdf)
• M. Rocklin and A. Pinar, " Latent Clustering on Graphs with Multiple Edge Types " to appear in Proc.8th Workshop on Algorithms and Models for the Web Graph (WAW11). (pdf)
• C. Seshadhri, A. Pinar, and T.Kolda, " An In-Depth Study of Stochastiic Kronecker Graphs" Available at arxiv.
• E. Kayaaslan, A. Pinar, U. Catalyurek, and C. Aykanat, "Hypergraph Partitioning through Vertex Separators on Graphs", submitted to SIAM J. Scientific Computing (pdf).
• M. Rocklin and A. Pinar, "Computing an Aggregate Edge-weight function for Clustering of Graphs with Multiple Edge Types", In Proc. 7th Workshop on Algorithms and Models for the Web Graph (WAW10). (pdf)
• I. Stanton and A. Pinar, " Sampling graphs with prescribed joint degree distribution using Markov Chains", to appear in Proc. ALENEX 11. (pdf)

Complex Networks

• R. Chen, A. Cohn, N. Fan, and A. Pinar, N-k-epsilon Survivable Power System Design," submitted (pdf) .
• R. Chen, A. Cohn, and A. Pinar, An Implicit Optimization Approach for Survivable Network Design," to appear in Proc. IEEE Network Science Workshop. (pdf)
• A. Pinar, J. Meza, V. Donde, and B. Lesieutre, Optimization Strategies for the Vulnerability Analysis of the Power Grid," SIAM Journal on Optimization, Vol. 20, No. 4, pages 1786--1810, 2010. (pdf)
• V. Donde, V. Lopez, B. Lesieutre, A. Pinar, C. Yang, and J. Meza, Severe Multiple Contingency Screening in Electric Power Systems," IEEE Transactions on Power Systems, Vol. 23, No. 2, pages 406--417, 2008. (pdf)
• B. Lesieutre, A. Pinar, and S. Roy, Power System Extreme Event Detection: The Vulnerability Frontier," in Proc. 41st Hawaii International Conference on System Sciences, pages: 184, Waikoloa, Big Island, HI, 2008. (pdf)
• A. Pinar, A. Reichert, and B. Lesieutre, "Computing Criticality of Lines in a Power System," Proc. 2007 IEEE International Symposium on Circuits and Systems, pages = 65-68, New Orleans, LA, May 2007. (pdf)

High Performance Computing

• E. Kayaaslan, A. Pinar, U. Catalyurek, and C. Aykanat, " Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs ", SIAM Scientific Computing, to appear. (pdf)
• C. Janssen, H. Adalsteinsson, S. Cranford, J. Kenny, A. Pinar, D. Evensky, and J. Mayo, " A Simulator for Large-scale Parallel Computer Architectures", International Journal of Distributed Systems and Technology (pdf)
• S. Kamil, L. Oliker, A. Pinar, and J. Shalf, " Communication Requirements and Interconnect Optimization for High-End Scientific Applications", IEEE Transactions on Parallel and Distributed Computing, Vol. 21, No. 2, pages 188--202, 2010. (pdf)
• A. Pinar, E. Tabak, and C. Aykanat, " One dimensional partitioning for hetero- geneous systems", Journal of Parallel and Distributed Computing, Vol. 68, No. 11, pages 1473--1486, 2008. (pdf)
• S. Kamil, A. Pnar, D. Gunter, M. Lijewski, L. Oliker, and J. Shalf, ``Reconfigurable hybrid interconnection for static and dynamic scientific applications," Proc. of the 4th International Conference on Computing Frontiers, pages: 183--195, Ischia, Italy, 2007. (pdf)

Top of page