Cache-Oblivious Sparse Matrix–Vector Multiplication by Using Sparse Matrix Partitioning Methods. - A. N. Yzelman; Rob H. Bisseling (SIAM J. Sci. Comput., 2009)

Two-dimensional cache-oblivious sparse matrix-vector multiplication. - A. N. Yzelman; Rob H. Bisseling (Parallel Comput., 2011)

An object-oriented bulk synchronous parallel library for multicore programming. - A. N. Yzelman; Rob H. Bisseling (Concurr. Comput. Pract. Exp., 2012)

MulticoreBSP for C: A High-Performance Library for Shared-Memory Parallel Programming. - A. N. Yzelman; Rob H. Bisseling; Dirk Roose; Karl Meerbergen (Int. J. Parallel Program., 2014)

High-Level Strategies for Parallel Shared-Memory Sparse Matrix-Vector Multiplication. - Albert-Jan Nicholas Yzelman; Dirk Roose (IEEE Trans. Parallel Distributed Syst., 2014)

Generalised vectorisation for sparse matrix: vector multiplication. - A. N. Yzelman (IA3@SC, 2015)

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

Lightweight Parallel Foundations: a model-compliant communication layer. - Wijnand Suijlen; A. N. Yzelman (CoRR, 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)

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

Nonblocking execution in GraphBLAS. - Aristeidis Mastoras; Sotiris Anagnostidis; Albert-Jan Nicholas Yzelman (IPDPS Workshops, 2022)

A Native Tensor-Vector Multiplication Algorithm for High Performance Computing. - Pedro J. Martínez-Ferrer; A. N. Yzelman; Vicenç Beltran 001 (IEEE Trans. Parallel Distributed Syst., 2022)

Effective implementation of the High Performance Conjugate Gradient benchmark on GraphBLAS. - Alberto Scolari; Albert-Jan Yzelman (IPDPS Workshops, 2023)

Towards Structured Algebraic Programming. - Daniele G. Spampinato; Denis Jelovina; Jiawei Zhuang; Albert-Jan Nicholas Yzelman (ARRAY@PLDI, 2023)

Studying the expressiveness and performance of parallelization abstractions for linear pipelines. - Aristeidis Mastoras; Albert-Jan Nicholas Yzelman (PMAM@PPoPP, 2023)

Partitioning Hypergraphs is Hard: Models, Inapproximability, and Applications. - Pál András Papp; Georg Anegg; Albert-Jan Nicholas Yzelman (SPAA, 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)

Design and Implementation for Nonblocking Execution in GraphBLAS: Tradeoffs and Performance. - Aristeidis Mastoras; Sotiris Anagnostidis; Albert-Jan Nicholas Yzelman (ACM Trans. Archit. Code Optim., 2023)

Efficient Multi-Processor Scheduling in Increasingly Realistic Models (Brief Summary). - Pál András Papp; Georg Anegg; Aikaterini Karanasiou; Albert-Jan Nicholas Yzelman (IPDPS (Workshops), 2024)

Brief Announcement: Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-offs. - Toni Böhnlein; Pál András Papp; Albert-Jan Nicholas Yzelman (SPAA, 2024)

Efficient Multi-Processor Scheduling in Increasingly Realistic Models. - Pál András Papp; Georg Anegg; Aikaterini Karanasiou; Albert-Jan Nicholas Yzelman (SPAA, 2024)

Red-Blue Pebbling with Multiple Processors: Time, Communication and Memory Trade-Offs. - Toni Böhnlein; Pál András Papp; Albert-Jan Nicholas Yzelman (SIROCCO, 2025)

DAG Scheduling in the BSP Model. - Pál András Papp; Georg Anegg; Albert-Jan Yzelman (SOFSEM (2), 2025)

The Impact of Partial Computations on the Red-Blue Pebble Game. - Pál András Papp; Aleksandros Sobczyk; Albert-Jan Nicholas Yzelman (SPAA, 2025)

Distributed and heterogeneous tensor-vector contraction algorithms for high performance computing. - Pedro J. Martínez-Ferrer; Albert-Jan Yzelman; Vicenç Beltran 001 (Future Gener. Comput. Syst., 2025)

Efficient Parallel Scheduling for Sparse Triangular Solvers. - Toni Böhnlein; Pál András Papp; Raphael S. Steiner; A. N. Yzelman (CoRR, 2025)

Multiprocessor Scheduling with Memory Constraints: Fundamental Properties and Finding Optimal Solutions. - Pál András Papp; Toni Böhnlein; A. N. Yzelman (CoRR, 2025)