Ali Pinar - RankMe

131 papers A* 9A 12B 9C 4Misc 2Journal 75Unranked 17

Year	Rank	Type	Title / Venue / Authors
2025	J	`jnl`	Tight Practical Bounds for Subgraph Densities in Ego-centric Networks. CoRR Connor Mattes, Esha Datta, Ali Pinar
2024	J	`jnl`	Experimental Validation of a Command and Control Traffic Detection Model. IEEE Trans. Dependable Secur. Comput. Eric D. Vugrin, Seth Hanson, Jerry Cruz, Casey Glatter, Thomas D. Tarman, Ali Pinar
2024	—	`conf`	Neuromorphic Monte Carlo Tree Search Methods for Shortest Path Interdiction. ICONS Yang Ho, Armida Carbajal, Leonardo Escamilla, Ali Pinar
2023	J	`jnl`	Defender Policy Evaluation and Resource Allocation With MITRE ATT&CK Evaluations Data. IEEE Trans. Dependable Secur. Comput. Alexander V. Outkin, Patricia V. Schulz, Timothy Schulz, Thomas D. Tarman, Ali Pinar
2022	J	`jnl`	Batch Dynamic Algorithm to Find k-Cores and Hierarchies. CoRR Kasimir Gabert, Ali Pinar, Ümit V. Çatalyürek
2022	—	`conf`	Batch dynamic algorithm to find GRADES-NDA@SIGMOD Kasimir Gabert, Ali Pinar, Ümit V. Çatalyürek
2021	—	`conf`	A Robust Control Scheme for Time Delay Switch Attacks. AMSec@CCS Luka Malashkhia, Laura P. Swiler, Ali Pinar, Yan Wang
2021	A	`conf`	A Unifying Framework to Identify Dense Subgraphs on Streams: Graph Nuclei to Hypergraph Cores. WSDM Kasimir Gabert, Ali Pinar, Ümit V. Çatalyürek
2021	J	`jnl`	Defender Policy Evaluation and Resource Allocation Using MITRE ATT&CK Evaluations Data. CoRR Alexander V. Outkin, Patricia V. Schulz, Timothy Schulz, Thomas D. Tarman, Ali Pinar
2021	A	`conf`	EIGA: elastic and scalable dynamic graph analysis. SC Kasimir Gabert, Kaan Sancak, M. Yusuf Özkaya, Ali Pinar, Ümit V. Çatalyürek
2021	B	`conf`	Provable Advantages for Graph Algorithms in Spiking Neural Networks. SPAA James B. Aimone, Yang Ho, Ojas Parekh, Cynthia A. Phillips, Ali Pinar, William Severa, Yipu Wang
2021	—	`conf`	Shared-Memory Scalable k-Core Maintenance on Dynamic Graphs and Hypergraphs. IPDPS Workshops Kasimir Gabert, Ali Pinar, Ümit V. Çatalyürek
2021	A	`conf`	The Multiple Instance Learning Gaussian Process Probit Model. AISTATS Fulton Wang, Ali Pinar
2020	—	`conf`	A scalable graph generation algorithm to sample over a given shell distribution. IPDPS Workshops M. Yusuf Özkaya, Muhammed Fatih Balin, Ali Pinar, Ümit V. Çatalyürek
2020	—	`conf`	Cyber threat modeling and validation: port scanning and detection. HotSoS Eric D. Vugrin, Jerry Cruz, Christian Reedy, Thomas D. Tarman, Ali Pinar
2020	B	`conf`	Provable Neuromorphic Advantages for Computing Shortest Paths. SPAA James B. Aimone, Yang Ho, Ojas Parekh, Cynthia A. Phillips, Ali Pinar, William Severa, Yipu Wang
2020	A	`conf`	Residual Core Maximization: An Efficient Algorithm for Maximizing the Size of the SDM Ricky Laishram, Ahmet Erdem Sariyüce, Tina Eliassi-Rad, Ali Pinar, Sucheta Soundarajan
2019	—	`conf`	Dynamic Programming with Spiking Neural Computing. ICONS James B. Aimone, Ojas Parekh, Cynthia A. Phillips, Ali Pinar, William Severa, Helen Xu
2019	J	`jnl`	RetSynth: determining all optimal and sub-optimal synthetic pathways that facilitate synthesis of target compounds in chassis organisms. BMC Bioinform. Leanne S. Whitmore, Bernard Nguyen, Ali Pinar, Anthe George, Corey M. Hudson
2018	J	`jnl`	Chance-constrained economic dispatch with renewable energy and storage. Comput. Optim. Appl. Jianqiang Cheng, Richard Li-Yang Chen, Habib N. Najm, Ali Pinar, Cosmin Safta, Jean-Paul Watson
2018	J	`jnl`	Distributionally Robust Optimization with Principal Component Analysis. SIAM J. Optim. Jianqiang Cheng, Richard Li-Yang Chen, Habib N. Najm, Ali Pinar, Cosmin Safta, Jean-Paul Watson
2018	J	`jnl`	Local Algorithms for Hierarchical Dense Subgraph Discovery. Proc. VLDB Endow. Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar
2018	B	`conf`	Local Detection of Critical Nodes in Active Graphs. ASONAM M. Yusuf Özkaya, Ahmet Erdem Sanyuce, Ali Pinar, Ümit V. Çatalyürek
2018	A*	`conf`	Measuring and Improving the Core Resilience of Networks. WWW Ricky Laishram, Ahmet Erdem Sariyüce, Tina Eliassi-Rad, Ali Pinar, Sucheta Soundarajan
2018	A	`conf`	Peeling Bipartite Networks for Dense Subgraph Discovery. WSDM Ahmet Erdem Sariyüce, Ali Pinar
2018	A*	`conf`	Provable and Practical Approximations for the Degree Distribution using Sublinear Graph Samples. WWW Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri
2017	J	`jnl`	Active Betweenness Cardinality: Algorithms and Applications. CoRR Yusuf Özkaya, Ahmet Erdem Sariyüce, Ümit V. Çatalyürek, Ali Pinar
2017	J	`jnl`	Bounded-Degree Connected Approximations of Stochastic Networks. IEEE Trans. Mol. Biol. Multi Scale Commun. Christopher J. Quinn, Ali Pinar, Negar Kiyavash
2017	J	`jnl`	Contingency-constrained unit commitment with post-contingency corrective recourse. Ann. Oper. Res. Richard Li-Yang Chen, Neng Fan, Ali Pinar, Jean-Paul Watson
2017	J	`jnl`	Directed closure measures for networks with reciprocity. J. Complex Networks C. Seshadhri, Ali Pinar, Nurcan Durak, Tamara G. Kolda
2017	A*	`conf`	ESCAPE: Efficiently Counting All 5-Vertex Subgraphs. WWW Ali Pinar, C. Seshadhri, Vaidyanathan Vishal
2017	J	`jnl`	Measuring and modeling bipartite graphs with community structure. J. Complex Networks Sinan G. Aksoy, Tamara G. Kolda, Ali Pinar
2017	J	`jnl`	Nucleus Decompositions for Identifying Hierarchy of Dense Subgraphs. ACM Trans. Web Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek
2017	J	`jnl`	Parallel Local Algorithms for Core, Truss, and Nucleus Decompositions. CoRR Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar
2017	J	`jnl`	Provable and practical approximations for the degree distribution using sublinear graph samples. CoRR Talya Eden, Shweta Jain, Ali Pinar, Dana Ron, C. Seshadhri
2017	—	`conf`	ε - WGX: Adaptive Edge Probing for Enhancing Incomplete Networks. WebSci Sucheta Soundarajan, Tina Eliassi-Rad, Brian Gallagher, Ali Pinar
2016	J	`jnl`	Butterfly Effect: Peeling Bipartite Networks. CoRR Ahmet Erdem Sariyüce, Ali Pinar
2016	J	`jnl`	ESCAPE: Efficiently Counting All 5-Vertex Subgraphs. CoRR Ali Pinar, C. Seshadhri, Vaidyanathan Vishal
2016	J	`jnl`	Fast Hierarchy Construction for Dense Subgraphs. CoRR Ahmet Erdem Sariyüce, Ali Pinar
2016	J	`jnl`	Fast Hierarchy Construction for Dense Subgraphs. Proc. VLDB Endow. Ahmet Erdem Sariyüce, Ali Pinar
2016	B	`conf`	MaxReach: Reducing network incompleteness through node probes. ASONAM Sucheta Soundarajan, Tina Eliassi-Rad, Brian Gallagher, Ali Pinar
2016	J	`jnl`	Measuring and Modeling Bipartite Graphs with Community Structure. CoRR Sinan G. Aksoy, Tamara G. Kolda, Ali Pinar
2016	B	`conf`	Sparse approximations of directed information graphs. ISIT Christopher J. Quinn, Ali Pinar, Jing Gao, Lu Su
2016	J	`jnl`	Trigger Detection for Adaptive Scientific Workflows Using Percentile Sampling. SIAM J. Sci. Comput. Janine C. Bennett, Ankit Bhagatwala, Jacqueline H. Chen, Ali Pinar, Maher Salloum, C. Seshadhri
2015	J	`jnl`	A Space-Efficient Streaming Algorithm for Estimating Transitivity and Triangle Counts Using the Birthday Paradox. ACM Trans. Knowl. Discov. Data Madhav Jha, C. Seshadhri, Ali Pinar
2015	J	`jnl`	A stopping criterion for Markov chains when generating independent random graphs. J. Complex Networks Jaideep Ray, Ali Pinar, C. Seshadhri
2015	J	`jnl`	Bounded Degree Approximations of Stochastic Networks. CoRR Christopher J. Quinn, Ali Pinar, Negar Kiyavash
2015	Misc	`conf`	Counting triangles in real-world graph streams: Dealing with repeated edges and time windows. ACSSC Madhav Jha, Ali Pinar, C. Seshadhri
2015	A*	`conf`	Diamond Sampling for Approximate Maximum All-Pairs Dot-Product (MAD) Search. ICDM Grey Ballard, Tamara G. Kolda, Ali Pinar, C. Seshadhri
2015	J	`jnl`	Diamond Sampling for Approximate Maximum All-pairs Dot-product (MAD) Search. CoRR Grey Ballard, Ali Pinar, Tamara G. Kolda, C. Seshadhri
2015	J	`jnl`	Efficient Representation of Uncertainty for Stochastic Economic Dispatch. CoRR Cosmin Safta, Richard Li-Yang Chen, Habib N. Najm, Ali Pinar, Jean-Paul Watson
2015	—	`conf`	Enabling Adaptive Scientific Workflows Via Trigger Detection. ISAV@SC Maher Salloum, Janine C. Bennett, Ali Pinar, Ankit Bhagatwala, Jacqueline H. Chen
2015	J	`jnl`	Enabling adaptive scientific workflows via trigger detection. CoRR Maher Salloum, Janine C. Bennett, Ali Pinar, Ankit Bhagatwala, Jacqueline H. Chen
2015	A*	`conf`	Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. WWW Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek
2015	J	`jnl`	MaxOutProbe: An Algorithm for Increasing the Size of Partially Observed Networks. CoRR Sucheta Soundarajan, Tina Eliassi-Rad, Brian Gallagher, Ali Pinar
2015	A*	`conf`	Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts. WWW Madhav Jha, C. Seshadhri, Ali Pinar
2015	—	`ch.`	Sublinear Algorithms for Extreme-Scale Data Analysis. Topological and Statistical Methods for Complex Data, Tackling Large-Scale, High-Dimensional, and Multivariate Data Spaces C. Seshadhri, Ali Pinar, David C. Thompson, Janine C. Bennett
2015	J	`jnl`	Trigger detection for adaptive scientific workflows using percentile sampling. CoRR Janine C. Bennett, Ankit Bhagatwala, Jacqueline H. Chen, C. Seshadhri, Ali Pinar, Maher Salloum
2014	J	`jnl`	A Scalable Generative Graph Model with Community Structure. SIAM J. Sci. Comput. Tamara G. Kolda, Ali Pinar, Todd D. Plantenga, C. Seshadhri
2014	J	`jnl`	Accelerating Community Detection by Using K-core Subgraphs. CoRR Chengbin Peng, Tamara G. Kolda, Ali Pinar
2014	J	`jnl`	Contingency-Constrained Unit Commitment with Post-Contingency Corrective Recourse. CoRR Richard Li-Yang Chen, Neng Fan, Ali Pinar, Jean-Paul Watson
2014	J	`jnl`	Counting Triangles in Massive Graphs with MapReduce. SIAM J. Sci. Comput. Tamara G. Kolda, Ali Pinar, Todd D. Plantenga, C. Seshadhri, Christine Task
2014	J	`jnl`	Finding the Hierarchy of Dense Subgraphs using Nucleus Decompositions. CoRR Ahmet Erdem Sariyüce, C. Seshadhri, Ali Pinar, Ümit V. Çatalyürek
2014	J	`jnl`	High-performance Graph Algorithms and Applications in Computational Science (Dagstuhl Seminar 14461). Dagstuhl Reports Ulrich Carsten Meyer, Henning Meyerhenke, Ali Pinar, Ilya Safro
2014	J	`jnl`	Path Sampling: A Fast and Provable Method for Estimating 4-Vertex Subgraph Counts. CoRR Madhav Jha, C. Seshadhri, Ali Pinar
2014	J	`jnl`	Toward Using Surrogates to Accelerate Solution of Stochastic Electricity Grid Operations Problems. CoRR Cosmin Safta, Richard L. Chen, Habib N. Najm, Ali Pinar, Jean-Paul Watson
2014	J	`jnl`	Wedge sampling for computing clustering coefficients and triangle counts on large graphs. Stat. Anal. Data Min. C. Seshadhri, Ali Pinar, Tamara G. Kolda
2013	J	`jnl`	A Scalable Generative Graph Model with Community Structure CoRR Tamara G. Kolda, Ali Pinar, Todd D. Plantenga, C. Seshadhri
2013	—	`conf`	A provably-robust sampling method for generating colormaps of large data. LDAV David C. Thompson, Janine Bennett, C. Seshadhri, Ali Pinar
2013	—	`conf`	A scalable null model for directed graphs matching all degree distributions: In, out, and reciprocal. NSW Nurcan Durak, Tamara G. Kolda, Ali Pinar, C. Seshadhri
2013	A*	`conf`	A space efficient streaming algorithm for triangle counting using the birthday paradox. KDD Madhav Jha, C. Seshadhri, Ali Pinar
2013	J	`jnl`	An in-depth analysis of stochastic Kronecker graphs. J. ACM C. Seshadhri, Ali Pinar, Tamara G. Kolda
2013	J	`jnl`	Counting Triangles in Massive Graphs with MapReduce CoRR Tamara G. Kolda, Ali Pinar, Todd D. Plantenga, C. Seshadhri, Christine Task
2013	B	`conf`	Dynamics of trust reciprocation in multi-relational networks. ASONAM Ayush Singhal, Karthik Subbian, Jaideep Srivastava, Tamara G. Kolda, Ali Pinar
2013	J	`jnl`	On Clustering on Graphs with Multiple Edge Types. Internet Math. Matthew Rocklin, Ali Pinar
2013	J	`jnl`	On Reciprocity in Massively Multi-player Online Game Networks CoRR Karthik Subbian, Ayush Singhal, Tamara G. Kolda, Ali Pinar, Jaideep Srivastava
2013	B	`conf`	Optimal bounded-degree approximations of joint distributions of networks of stochastic processes. ISIT Christopher J. Quinn, Ali Pinar, Negar Kiyavash
2013	J	`jnl`	The importance of directed triangles with reciprocity: patterns and algorithms CoRR C. Seshadhri, Ali Pinar, Nurcan Durak, Tamara G. Kolda
2013	A	`conf`	Triadic Measures on Graphs: The Power of Wedge Sampling. SDM Tamara G. Kolda, Ali Pinar, C. Seshadhri
2013	J	`jnl`	Wedge Sampling for Computing Clustering Coefficients and Triangle Counts on Large Graphs. CoRR C. Seshadhri, Ali Pinar, Tamara G. Kolda
2013	J	`jnl`	When a Graph is not so Simple: Counting Triangles in Multigraph Streams. CoRR Madhav Jha, C. Seshadhri, Ali Pinar
2012	J	`jnl`	A scalable directed graph model with reciprocal edges CoRR Nurcan Durak, Tamara G. Kolda, Ali Pinar, C. Seshadhri
2012	J	`jnl`	A stopping criterion for Markov chains when generating independent random graphs CoRR Jaideep Ray, Ali Pinar, C. Seshadhri
2012	C	`conf`	Are We There Yet? When to Stop a Markov Chain while Generating Random Graphs. WAW Jaideep Ray, Ali Pinar, C. Seshadhri
2012	J	`jnl`	Are we there yet? When to stop a Markov chain while generating random graphs CoRR Jaideep Ray, Ali Pinar, C. Seshadhri
2012	J	`jnl`	Degree Relations of Triangles in Real-world Networks and Models CoRR Nurcan Durak, Ali Pinar, Tamara G. Kolda, C. Seshadhri
2012	A	`conf`	Degree relations of triangles in real-world networks and graph models. CIKM Nurcan Durak, Ali Pinar, Tamara G. Kolda, C. Seshadhri
2012	J	`jnl`	Fast Triangle Counting through Wedge Sampling CoRR C. Seshadhri, Ali Pinar, Tamara G. Kolda
2012	J	`jnl`	From the Birthday Paradox to a Practical Sublinear Space Streaming Algorithm for Triangle Counting CoRR Madhav Jha, C. Seshadhri, Ali Pinar
2012	J	`jnl`	N-k-e Survivable Power System Design CoRR Richard Li-Yang Chen, Amy Cohn, Neng Fan, Ali Pinar
2012	J	`jnl`	Partitioning Hypergraphs in Scientific Computing Applications through Vertex Separators on Graphs. SIAM J. Sci. Comput. Enver Kayaaslan, Ali Pinar, Ümit V. Çatalyürek, Cevdet Aykanat
2012	A	`conf`	The Similarity Between Stochastic Kronecker and Chung-Lu Graph Models. SDM C. Seshadhri, Ali Pinar, Tamara G. Kolda
2011	J	`jnl`	A Hitchhiker's Guide to Choosing Parameters of Stochastic Kronecker Graphs CoRR C. Seshadhri, Ali Pinar, Tamara G. Kolda
2011	J	`jnl`	A Linear Approximation Algorithm for 2-Dimensional Vector Packing CoRR Ekow J. Otoo, Ali Pinar, Doron Rotem
2011	J	`jnl`	An Implicit Optimization Approach for Survivable Network Design CoRR Richard Li-Yang Chen, Amy Cohn, Ali Pinar
2011	A*	`conf`	An In-depth Study of Stochastic Kronecker Graphs. ICDM C. Seshadhri, Ali Pinar, Tamara G. Kolda
2011	J	`jnl`	Community structure and scale-free collections of Erdös-Rényi graphs CoRR C. Seshadhri, Tamara G. Kolda, Ali Pinar
2011	J	`jnl`	Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types CoRR Matthew Rocklin, Ali Pinar
2011	J	`jnl`	Constructing and Sampling Graphs with a Prescribed Joint Degree Distribution CoRR Isabelle Stanton, Ali Pinar
2011	J	`jnl`	Constructing and sampling graphs with a prescribed joint degree distribution. ACM J. Exp. Algorithmics Isabelle Stanton, Ali Pinar
2011	J	`jnl`	Hypergraph Partitioning through Vertex Separators on Graphs CoRR Enver Kayaaslan, Ali Pinar, Ümit V. Çatalyürek, Cevdet Aykanat
2011	C	`conf`	Latent Clustering on Graphs with Multiple Edge Types. WAW Matthew Rocklin, Ali Pinar
2011	J	`jnl`	On Clustering on Graphs with Multiple Edge Types CoRR Matthew Rocklin, Ali Pinar
2011	A	`conf`	Sampling Graphs with a Prescribed Joint Degree Distribution Using Markov Chains. ALENEX Isabelle Stanton, Ali Pinar
2011	J	`jnl`	The Similarity between Stochastic Kronecker and Chung-Lu Graph Models CoRR Ali Pinar, C. Seshadhri, Tamara G. Kolda
2010	J	`jnl`	A Simulator for Large-Scale Parallel Computer Architectures. Int. J. Distributed Syst. Technol. Curtis L. Janssen, Helgi Adalsteinsson, Scott Cranford, Joseph P. Kenny, Ali Pinar, David A. Evensky, Jackson R. Mayo
2010	J	`jnl`	Communication Requirements and Interconnect Optimization for High-End Scientific Applications. IEEE Trans. Parallel Distributed Syst. Shoaib Kamil, Leonid Oliker, Ali Pinar, John Shalf
2010	C	`conf`	Computing an Aggregate Edge-Weight Function for Clustering Graphs with Multiple Edge Types. WAW Matthew Rocklin, Ali Pinar
2010	J	`jnl`	Optimization Strategies for the Vulnerability Analysis of the Electric Power Grid. SIAM J. Optim. Ali Pinar, Juan C. Meza, Vaibhav Donde, Bernard C. Lesieutre
2008	J	`jnl`	One-dimensional partitioning for heterogeneous systems: Theory and practice. J. Parallel Distributed Comput. Ali Pinar, E. Kartal Tabak, Cevdet Aykanat
2008	—	`conf`	Power System Extreme Event Detection: The Vulnerability Frontier. HICSS Bernard C. Lesieutre, Ali Pinar, Sandip Roy
2007	C	`conf`	Computing Criticality of Lines in Power Systems. ISCAS Ali Pinar, Adam Reichert, Bernard C. Lesieutre
2007	—	`conf`	Reconfigurable hybrid interconnection for static and dynamic scientific applications. Conf. Computing Frontiers Shoaib Kamil, Ali Pinar, Daniel K. Gunter, Michael Lijewski, Leonid Oliker, John Shalf
2006	—	`ch.`	Combinatorial Parallel and Scientific Computing. Parallel Processing for Scientific Computing Ali Pinar, Bruce Hendrickson
2005	A*	`conf`	Compressing Bitmap Indices by Data Reorganization. ICDE Ali Pinar, Tao Tao, Hakan Ferhatosmanoglu
2005	J	`jnl`	Improving Load Balance with Flexibly Assignable Tasks. IEEE Trans. Parallel Distributed Syst. Ali Pinar, Bruce Hendrickson
2004	J	`jnl`	Fast optimal load balancing algorithms for 1D partitioning. J. Parallel Distributed Comput. Ali Pinar, Cevdet Aykanat
2004	J	`jnl`	Interprocessor Communication with Limited Memory. IEEE Trans. Parallel Distributed Syst. Ali Pinar, Bruce Hendrickson
2004	J	`jnl`	Permuting Sparse Rectangular Matrices into Block-Diagonal Form. SIAM J. Sci. Comput. Cevdet Aykanat, Ali Pinar, Ümit V. Çatalyürek
2003	J	`jnl`	Compacting sequences with invariant transition frequencies. ACM Trans. Design Autom. Electr. Syst. Ali Pinar, C. L. Liu
2002	B	`conf`	Exploiting flexibly assignable work to improve load balance. SPAA Ali Pinar, Bruce Hendrickson
2001	—	`—`	Combinatorial Algorithms in Scientific Computing Ali Pinar
2001	—	`conf`	Communication Support for Adaptive Computation. PP Ali Pinar, Bruce Hendrickson
2001	A	`conf`	Partitioning for Complex Objectives. IPDPS Ali Pinar, Bruce Hendrickson
2000	B	`conf`	Interprocessor communication with memory constraints. SPAA Ali Pinar, Bruce Hendrickson
2000	—	`conf`	On Identifying Strongly Connected Components in Parallel. IPDPS Workshops Lisa Fleischer, Bruce Hendrickson, Ali Pinar
1999	A	`conf`	Improving Performance of Sparse Matrix-Vector Multiplication. SC Ali Pinar, Michael T. Heath
1998	A	`conf`	Power invariant vector sequence compaction. ICCAD Ali Pinar, C. L. Liu
1997	Misc	`conf`	Sparse matrix decomposition with optimal load balancing. HiPC Ali Pinar, Cevdet Aykanat
1996	—	`conf`	An Effective Model to Decompose Linear Programs for Parallel Solution. PARA Ali Pinar, Cevdet Aykanat
1995	—	`conf`	Decomposing Linear Programs for Parallel Solution. PARA Ali Pinar, Ümit V. Çatalyürek, Cevdet Aykanat, Mustafa Ç. Pinar