Minimizing Communication Cost in Fine-Grain Partitioning of Sparse Matrices. - Bora Uçar; Cevdet Aykanat (ISCIS, 2003)

A Message Ordering Problem in Parallel Programs. - Bora Uçar; Cevdet Aykanat (PVM/MPI, 2004)

Encapsulating Multiple Communication-Cost Metrics in Partitioning Sparse Rectangular Matrices for Parallel Matrix-Vector Multiplies. - Bora Uçar; Cevdet Aykanat (SIAM J. Sci. Comput., 2004)

Parallel sparse matrix-vector multiplies and iterative solvers (Paralel seyrek matris-vektör çarpımı ve dolaylı yöntemler) - Bora Uçar (2005)

Task assignment in heterogeneous computing systems. - Bora Uçar; Cevdet Aykanat; Kamer Kaya; Murat Ikinci (J. Parallel Distributed Comput., 2006)

Heuristics for a Matrix Symmetrization Problem. - Bora Uçar (PPAM, 2007)

Heuristics for scheduling file-sharing tasks on heterogeneous systems with distributed repositories. - Kamer Kaya; Bora Uçar; Cevdet Aykanat (J. Parallel Distributed Comput., 2007)

Parallel image restoration using surrogate constraint methods. - Bora Uçar; Cevdet Aykanat; Mustafa Ç. Pinar; Tahir Malas (J. Parallel Distributed Comput., 2007)

Revisiting Hypergraph Models for Sparse Matrix Partitioning. - Bora Uçar; Cevdet Aykanat (SIAM Rev., 2007)

Partitioning Sparse Matrices for Parallel Preconditioned Iterative Methods. - Bora Uçar; Cevdet Aykanat (SIAM J. Sci. Comput., 2007)

A Parallel Matrix Scaling Algorithm. - Patrick Amestoy; Iain S. Duff; Daniel Ruiz 002; Bora Uçar (VECPAR, 2008)

Multi-level direct K-way hypergraph partitioning with multiple constraints and fixed vertices. - Cevdet Aykanat; Berkant Barla Cambazoglu; Bora Uçar (J. Parallel Distributed Comput., 2008)

Combinatorial problems in solving linear systems. - Iain S. Duff; Bora Uçar (Combinatorial Scientific Computing, 2009)

Exact Algorithms for a Task Assignment Problem. - Kamer Kaya; Bora Uçar (Parallel Process. Lett., 2009)

On the Scalability of Hypergraph Models for Sparse Matrix Partitioning. - Bora Uçar; Ümit V. Çatalyürek (PDP, 2010)

A Matrix Partitioning Interface to PaToH in MATLAB. - Bora Uçar; Ümit V. Çatalyürek; Cevdet Aykanat (Parallel Comput., 2010)

On the Block Triangular Form of Symmetric Matrices. - Iain S. Duff; Bora Uçar (SIAM Rev., 2010)

On Two-Dimensional Sparse Matrix Partitioning: Models, Methods, and a Recipe. - Ümit V. Çatalyürek; Cevdet Aykanat; Bora Uçar (SIAM J. Sci. Comput., 2010)

On Partitioning Problems with Complex Objectives. - Kamer Kaya; François-Henry Rouet; Bora Uçar (Euro-Par Workshops (1), 2011)

On the Use of Cluster-Based Partial Message Logging to Improve Fault Tolerance for MPI HPC Applications. - Thomas Ropars; Amina Guermouche; Bora Uçar; Esteban Meneses; Laxmikant V. Kalé; Franck Cappello (Euro-Par (1), 2011)

Integrated data placement and task assignment for scientific workflows in clouds. - Ümit V. Çatalyürek; Kamer Kaya; Bora Uçar (DICT@HPDC, 2011)

On Optimal Tree Traversals for Sparse Matrix Factorization. - Mathias Jacquelin; Loris Marchal; Yves Robert; Bora Uçar (IPDPS, 2011)

Design, implementation, and analysis of maximum transversal algorithms. - Iain S. Duff; Kamer Kaya; Bora Uçar (ACM Trans. Math. Softw., 2011)

Parallel Frequent Item Set Mining with Selective Item Replication. - Eray Özkural; Bora Uçar; Cevdet Aykanat (IEEE Trans. Parallel Distributed Syst., 2011)

Multifrontal Method. - Patrick Amestoy; Alfredo Buttari; Iain S. Duff; Abdou Guermouche; Jean-Yves L'Excellent; Bora Uçar (Encyclopedia of Parallel Computing, 2011)

Mumps. - Patrick Amestoy; Alfredo Buttari; Iain S. Duff; Abdou Guermouche; Jean-Yves L'Excellent; Bora Uçar (Encyclopedia of Parallel Computing, 2011)

Hypergraph Partitioning. - Ümit V. Çatalyürek; Bora Uçar; Cevdet Aykanat (Encyclopedia of Parallel Computing, 2011)

On Optimal and Balanced Sparse Matrix Partitioning Problems. - Anaël Grandjean; Johannes Langguth; Bora Uçar (CLUSTER, 2012)

UMPa: A multi-objective, multi-level partitioner for communication minimization. - Ümit V. Çatalyürek; Mehmet Deveci; Kamer Kaya; Bora Uçar (Graph Partitioning and Graph Clustering, 2012)

A partitioning-based divisive clustering technique for maximizing the modularity. - Ümit V. Çatalyürek; Kamer Kaya; Johannes Langguth; Bora Uçar (Graph Partitioning and Graph Clustering, 2012)

Topic 10: Parallel Numerical Algorithms. - Iain S. Duff; Efstratios Gallopoulos; Daniela di Serafino; Bora Uçar (Euro-Par, 2012)

On Shared-Memory Parallelization of a Sparse Matrix Scaling Algorithm. - Ümit V. Çatalyürek; Kamer Kaya; Bora Uçar (ICPP, 2012)

Multithreaded Clustering for Multi-level Hypergraph Partitioning. - Ümit V. Çatalyürek; Mehmet Deveci; Kamer Kaya; Bora Uçar (IPDPS, 2012)

On Computing Inverse Entries of a Sparse Matrix in an Out-of-Core Environment. - Patrick Amestoy; Iain S. Duff; Jean-Yves L'Excellent; Yves Robert; François-Henry Rouet; Bora Uçar (SIAM J. Sci. Comput., 2012)

GPU Accelerated Maximum Cardinality Matching Algorithms for Bipartite Graphs. - Mehmet Deveci; Kamer Kaya; Bora Uçar; Ümit V. Çatalyürek (Euro-Par, 2013)

A Push-Relabel-Based Maximum Cardinality Bipartite Matching Algorithm on GPUs. - Mehmet Deveci; Kamer Kaya; Bora Uçar; Ümit V. Çatalyürek (ICPP, 2013)

Semi-Matching Algorithms for Scheduling Parallel Tasks under Resource Constraints. - Anne Benoit; Johannes Langguth; Bora Uçar (IPDPS Workshops, 2013)

On Partitioning and Reordering Problems in a Hierarchically Parallel Hybrid Linear Solver. - Ichitaro Yamazaki; Xiaoye S. Li; François-Henry Rouet; Bora Uçar (IPDPS Workshops, 2013)

Analysis of Partitioning Models and Metrics in Parallel Sparse Matrix-Vector Multiplication. - Kamer Kaya; Bora Uçar; Ümit V. Çatalyürek (PPAM (2), 2013)

Push-relabel based algorithms for the maximum transversal problem. - Kamer Kaya; Johannes Langguth; Fredrik Manne; Bora Uçar (Comput. Oper. Res., 2013)

Direct methods for sparse matrix solution. - Iain S. Duff; Bora Uçar (Scholarpedia, 2013)

Constructing Elimination Trees for Sparse Unsymmetric Matrices. - Kamer Kaya; Bora Uçar (SIAM J. Matrix Anal. Appl., 2013)

Scheduling for Large-Scale Systems. - Anne Benoit; Loris Marchal; Yves Robert; Bora Uçar; Frédéric Vivien (Computing Handbook, 3rd ed. (1), 2014)

Reducing elimination tree height for parallel LU factorization of sparse unsymmetric matrices. - Enver Kayaaslan; Bora Uçar (HiPC, 2014)

Bipartite Matching Heuristics with Quality Guarantees on Shared Memory Parallel Computers. - Fanny Dufossé; Kamer Kaya; Bora Uçar (IPDPS, 2014)

On Partitioning Two Dimensional Finite Difference Meshes for Distributed Memory Parallel Computers. - Anaël Grandjean; Bora Uçar (PDP, 2014)

A Symmetry Preserving Algorithm for Matrix Scaling. - Philip A. Knight; Daniel Ruiz 002; Bora Uçar (SIAM J. Matrix Anal. Appl., 2014)

Fast and High Quality Topology-Aware Task Mapping. - Mehmet Deveci; Kamer Kaya; Bora Uçar; Ümit V. Çatalyürek (IPDPS, 2015)

Combining Backward and Forward Recovery to Cope with Silent Errors in Iterative Solvers. - Massimiliano Fasi; Yves Robert; Bora Uçar (IPDPS Workshops, 2015)

Semi-two-dimensional Partitioning for Parallel Sparse Matrix-Vector Multiplication. - Enver Kayaaslan; Bora Uçar; Cevdet Aykanat (IPDPS Workshops, 2015)

Load-Balanced Local Time Stepping for Large-Scale Wave Propagation. - Max Rietmann; Daniel Peter 001; Olaf Schenk; Bora Uçar; Marcus J. Grote (IPDPS, 2015)

Scalable sparse tensor decompositions in distributed memory systems. - Oguz Kaya; Bora Uçar (SC, 2015)

Comments on the hierarchically structured bin packing problem. - Thomas Lambert; Loris Marchal; Bora Uçar (Inf. Process. Lett., 2015)

Hypergraph partitioning for multiple communication cost metrics: Model and methods. - Mehmet Deveci; Kamer Kaya; Bora Uçar; Ümit V. Çatalyürek (J. Parallel Distributed Comput., 2015)

Two approximation algorithms for bipartite matching on multicore architectures. - Fanny Dufossé; Kamer Kaya; Bora Uçar (J. Parallel Distributed Comput., 2015)

High Performance Parallel Algorithms for the Tucker Decomposition of Sparse Tensors. - Oguz Kaya; Bora Uçar (ICPP, 2016)

PCO Introduction and Committees. - Didier El Baz; Bora Uçar (IPDPS Workshops, 2016)

A backward/forward recovery approach for the preconditioned conjugate gradient method. - Massimiliano Fasi; Julien Langou; Yves Robert; Bora Uçar (J. Comput. Sci., 2016)

Acyclic Partitioning of Large Directed Acyclic Graphs. - Julien Herrmann; Jonathan Kho; Bora Uçar; Kamer Kaya; Ümit V. Çatalyürek (CCGrid, 2017)

Preconditioning Techniques Based on the Birkhoff-von Neumann Decomposition. - Michele Benzi; Bora Uçar (Comput. Methods Appl. Math., 2017)

SiNA: A Scalable Iterative Network Aligner. - Abdurrahman Yasar; Bora Uçar; Ümit V. Çatalyürek (ASONAM, 2018)

Approximation algorithms for maximum matchings in undirected graphs. - Fanny Dufossé; Kamer Kaya; Ioannis Panagiotas; Bora Uçar (CSC, 2018)

Parallel Candecomp/Parafac Decomposition of Sparse Tensors Using Dimension Trees. - Oguz Kaya; Bora Uçar (SIAM J. Sci. Comput., 2018)

1.5D Parallel Sparse Matrix-Vector Multiply. - Enver Kayaaslan; Cevdet Aykanat; Bora Uçar (SIAM J. Sci. Comput., 2018)

Scheduling series-parallel task graphs to minimize peak memory. - Enver Kayaaslan; Thomas Lambert; Loris Marchal; Bora Uçar (Theor. Comput. Sci., 2018)

Partitioning, matching, and ordering: Combinatorial scientific computing with matrices and tensors. (Partitionnement, couplage et permutation: Calcul scientifique combinatoire sur des matrices et des tenseurs). - Bora Uçar (2019)

Efficient and effective sparse tensor reordering. - Jiajia Li 001; Bora Uçar; Ümit V. Çatalyürek; Jimeng Sun 001; Kevin J. Barker; Richard W. Vuduc (ICS, 2019)

A Scalable Clustering-Based Task Scheduler for Homogeneous Processors Using DAG Partitioning. - M. Yusuf Özkaya; Anne Benoit; Bora Uçar; Julien Herrmann; Ümit V. Çatalyürek (IPDPS, 2019)

High Performance Tensor-Vector Multiplication on Shared-Memory Systems. - Filip Pawlowski; Bora Uçar; Albert-Jan Yzelman (PPAM (1), 2019)

Effective Heuristics for Matchings in Hypergraphs. - Fanny Dufossé; Kamer Kaya; Ioannis Panagiotas; Bora Uçar (SEA², 2019)

A multi-dimensional Morton-ordered block storage for mode-oblivious tensor computations. - Filip Pawlowski; Bora Uçar; Albert-Jan Yzelman (J. Comput. Sci., 2019)

Multilevel Algorithms for Acyclic Partitioning of Directed Acyclic Graphs. - Julien Herrmann; M. Yusuf Özkaya; Bora Uçar; Kamer Kaya; Ümit V. Çatalyürek (SIAM J. Sci. Comput., 2019)

Karp-Sipser based kernels for bipartite graph matching. - Kamer Kaya; Johannes Langguth; Ioannis Panagiotas; Bora Uçar (ALENEX, 2020)

Engineering Fast Almost Optimal Algorithms for Bipartite Graph Matching. - Ioannis Panagiotas; Bora Uçar (ESA, 2020)

Combinatorial Tiling for Sparse Neural Networks. - Filip Pawlowski; Rob H. Bisseling; Bora Uçar; A. N. Yzelman (HPEC, 2020)

Matrix symmetrization and sparse direct solvers. - Raluca Portase; Bora Uçar (CSC, 2020)

Programming Strategies for Irregular Algorithms on the Emu Chick. - Eric R. Hein; Srinivas Eswar; Abdurrahman Yasar; Jiajia Li 001; Jeffrey S. Young 001; Thomas M. Conte; Ümit V. Çatalyürek; Richard W. Vuduc; E. Jason Riedy; Bora Uçar (ACM Trans. Parallel Comput., 2020)

Fully-dynamic Weighted Matching Approximation in Practice. - Eugenio Angriman; Henning Meyerhenke; Christian Schulz 003; Bora Uçar (ACDA, 2021)

Shared-memory implementation of the Karp-Sipser kernelization process. - Johannes Langguth; Ioannis Panagiotas; Bora Uçar (HiPC, 2021)

Streaming Hypergraph Partitioning Algorithms on Limited Memory Environments. - Fatih Tasyaran; Berkay Demireller; Kamer Kaya; Bora Uçar (CoRR, 2021)

An Efficient Parallel Implementation of a Perfect Hashing Method for Hypergraphs. - Somesh Singh 001; Bora Uçar (IPDPS Workshops, 2022)

Scaling matrices and counting the perfect matchings in graphs. - Fanny Dufossé; Kamer Kaya; Ioannis Panagiotas; Bora Uçar (Discret. Appl. Math., 2022)

Algorithms and Data Structures for Hyperedge Queries. - Jules Bertrand; Fanny Dufossé; Somesh Singh 001; Bora Uçar (ACM J. Exp. Algorithmics, 2022)

Engineering Fast Algorithms for the Bottleneck Matching Problem. - Ioannis Panagiotas; Grégoire Pichon; Somesh Singh 001; Bora Uçar (ESA, 2023)

Open Problems in (Hyper)Graph Decomposition. - Deepak Ajwani; Rob H. Bisseling; Katrin Casel; Ümit V. Çatalyürek; Cédric Chevalier; Florian Chudigiewitsch; Marcelo Fonseca Faraj; Michael R. Fellows; Lars Gottesbüren; Tobias Heuer; George Karypis; Kamer Kaya; et al. (CoRR, 2023)

Recent Trends in Graph Decomposition (Dagstuhl Seminar 23331). - George Karypis; Christian Schulz 003; Darren Strash; Deepak Ajwani; Rob H. Bisseling; Katrin Casel; Ümit V. Çatalyürek; Cédric Chevalier; Florian Chudigiewitsch; Marcelo Fonseca Faraj; Michael R. Fellows; Lars Gottesbüren; et al. (Dagstuhl Reports, 2023)

Engineering Edge Orientation Algorithms. - Henrik Reinstädtler; Christian Schulz 003; Bora Uçar (ESA, 2024)

Orthogonal Matching Pursuit-Based Algorithms for the Birkhoff-Von Neumann Decomposition. - Damien Lesens; Jérémy E. Cohen; Bora Uçar (EUSIPCO, 2024)

HeiOrient. - Henrik Reinstädtler; Christian Schulz 003; Bora Uçar (DROPS Artifacts, 2024)

Semi-Streaming Algorithms for Hypergraph Matching. - Henrik Reinstädtler; S. M. Ferdous; Alex Pothen; Bora Uçar; Christian Schulz 003 (CoRR, 2025)

SUperman: Efficient Permanent Computation on GPUs. - Deniz Elbek; Fatih Tasyaran; Bora Uçar; Kamer Kaya (CoRR, 2025)

Near-Optimal Minimum Cuts in Hypergraphs at Scale. - Adil Chhabra; Christian Schulz 003; Bora Uçar; Loris Wilwert (CoRR, 2025)

Efficient Parallel Sparse Tensor Contraction. - Somesh Singh 001; Bora Uçar (IEEE Trans. Parallel Distributed Syst., 2025)