Efficient Matrix Multiplication on SIMD Computers. - Petter E. Bjørstad; Fredrik Manne; Tor Sørevik; Marián Vajtersic (SIAM J. Matrix Anal. Appl., 1992)

Optimal Partitioning of Sequences. - Fredrik Manne; Tor Sørevik (J. Algorithms, 1995)

Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer. - Fredrik Manne; Hjálmtyr Hafsteinsson (SIAM J. Sci. Comput., 1995)

Efficient Partitioning of Sequences. - Bjørn Olstad; Fredrik Manne (IEEE Trans. Computers, 1995)

On the Complexity of the Generalized Block Distribution. - Michelangelo Grigni; Fredrik Manne (IRREGULAR, 1996)

Partitioning an Array onto a Mesh of Processors. - Fredrik Manne; Tor Sørevik (PARA, 1996)

Automating the Debugging of Large Numerical Codes. - Fredrik Manne; Svein Olav Andersen (SciTools, 1996)

A Parallel Algorithm for Computing the Extremal Eigenvalues of Very Large Sparse Matrices. - Fredrik Manne (PARA, 1998)

Competing in computing (poster session). - Fredrik Manne (ITiCSE, 2000)

Scalable parallel graph coloring algorithms. - Assefaw Hadish Gebremedhin; Fredrik Manne (Concurr. Pract. Exp., 2000)

Approximations for the general block distribution of a matrix. - Bengt Aspvall; Magnús M. Halldórsson; Fredrik Manne (Theor. Comput. Sci., 2001)

Parallel Distance-k Coloring Algorithms for Numerical Optimization. - Assefaw Hadish Gebremedhin; Fredrik Manne; Alex Pothen (Euro-Par, 2002)

Efficient Self-stabilizing Algorithms for Tree Network. - Jean R. S. Blair; Fredrik Manne (ICDCS, 2003)

Efficient Generic Multi-Stage Self-Stabilizing Algorithms for Trees. - Jean R. S. Blair; Fredrik Manne (PDCS, 2004)

Speeding up Parallel Graph Coloring. - Assefaw Hadish Gebremedhin; Fredrik Manne; Tom Woods (PARA, 2004)

A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers. - Erik G. Boman; Doruk Bozdag; Ümit V. Çatalyürek; Assefaw Hadish Gebremedhin; Fredrik Manne (Euro-Par, 2005)

A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers. - Doruk Bozdag; Ümit V. Çatalyürek; Assefaw Hadish Gebremedhin; Fredrik Manne; Erik G. Boman; Füsun Özgüner (HPCC, 2005)

What Color Is Your Jacobian? Graph Coloring for Computing Derivatives. - Assefaw Hadish Gebremedhin; Fredrik Manne; Alex Pothen (SIAM Rev., 2005)

Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks. - Fredrik Manne; Qin Xin 001 (CAAN, 2006)

Faster Centralized Communication in Radio Networks. - Ferdinando Cicalese; Fredrik Manne; Qin Xin 001 (ISAAC, 2006)

A Memory Efficient Self-stabilizing Algorithm for Maximal k -Packing. - Fredrik Manne; Morten Mjelde (SSS, 2006)

A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem. - Fredrik Manne; Rob H. Bisseling (PPAM, 2007)

A Self-stabilizing Weighted Matching Algorithm. - Fredrik Manne; Morten Mjelde (SSS, 2007)

New Acyclic and Star Coloring Algorithms with Application to Computing Hessians. - Assefaw Hadish Gebremedhin; Arijit Tarafdar; Fredrik Manne; Alex Pothen (SIAM J. Sci. Comput., 2007)

A Self-stabilizing -Approximation Algorithm for the Maximum Matching Problem. - Fredrik Manne; Morten Mjelde; Laurence Pilard; Sébastien Tixeuil (SSS, 2008)

Time Efficient Radio Broadcasting in Planar Graphs. - Fredrik Manne; Qin Xin 001 (J. Networks, 2008)

A framework for scalable greedy coloring on distributed-memory parallel computers. - Doruk Bozdag; Assefaw Hadish Gebremedhin; Fredrik Manne; Erik G. Boman; Ümit V. Çatalyürek (J. Parallel Distributed Comput., 2008)

Almost Optimal Distributed M2M Multicasting in Wireless Mesh Networks. - Qin Xin 001; Fredrik Manne; Yan Zhang 002; Jianping Wang 001; Zeyu Zheng (MASS, 2009)

A Scalable Parallel Union-Find Algorithm for Distributed Memory Computers. - Fredrik Manne; Md. Mostofa Ali Patwary (PPAM (1), 2009)

Maximum weighted matching using the partitioned global address space model. - Alicia Thorsen; Phillip Merkey; Fredrik Manne (SpringSim, 2009)

Faster Deterministic Communication in Radio Networks. - Ferdinando Cicalese; Fredrik Manne; Qin Xin 001 (Algorithmica, 2009)

A new self-stabilizing maximal matching algorithm. - Fredrik Manne; Morten Mjelde; Laurence Pilard; Sébastien Tixeuil (Theor. Comput. Sci., 2009)

Efficient Self-stabilizing Graph Searching in Tree Networks. - Jean R. S. Blair; Fredrik Manne; Rodica Mihai (SSS, 2010)

Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure. - Md. Mostofa Ali Patwary; Jean R. S. Blair; Fredrik Manne (SEA, 2010)

Heuristic initialization for bipartite matching problems. - Johannes Langguth; Fredrik Manne; Peter Sanders 001 (ACM J. Exp. Algorithmics, 2010)

Distributed-Memory Parallel Algorithms for Distance-2 Coloring and Related Problems in Derivative Computation. - Doruk Bozdag; Ümit V. Çatalyürek; Assefaw H. Gebremedhin; Fredrik Manne; Erik G. Boman; Füsun Özgüner (SIAM J. Sci. Comput., 2010)

Parallel algorithms for bipartite matching problems on distributed memory computers. - Johannes Langguth; Md. Mostofa Ali Patwary; Fredrik Manne (Parallel Comput., 2011)

A self-stabilizing 2/3-approximation algorithm for the maximum matching problem. - Fredrik Manne; Morten Mjelde; Laurence Pilard; Sébastien Tixeuil (Theor. Comput. Sci., 2011)

Multi-core Spanning Forest Algorithms using the Disjoint-set Data Structure. - Md. Mostofa Ali Patwary; Peder Refsnes; Fredrik Manne (IPDPS, 2012)

A new scalable parallel DBSCAN algorithm using the disjoint-set data structure. - Md. Mostofa Ali Patwary; Diana Palsetia; Ankit Agrawal 001; Wei-keng Liao; Fredrik Manne; Alok N. Choudhary (SC, 2012)

How to Eliminate a Graph. - Petr A. Golovach; Pinar Heggernes; Pim van 't Hof; Fredrik Manne; Daniël Paulusma; Michal Pilipczuk (WG, 2012)

An efficient self-stabilizing distance-2 coloring algorithm. - Jean R. S. Blair; Fredrik Manne (Theor. Comput. Sci., 2012)

Almost optimal distributed M2M multicasting in wireless mesh networks. - Qin Xin 001; Fredrik Manne; Yan Zhang 002; Xin Wang 001 (Theor. Comput. Sci., 2012)

Scalable parallel OPTICS data clustering using graph algorithmic techniques. - Md. Mostofa Ali Patwary; Diana Palsetia; Ankit Agrawal 001; Wei-keng Liao; Fredrik Manne; Alok N. Choudhary (SC, 2013)

Efficient Counting of Maximal Independent Sets in Sparse Graphs. - Fredrik Manne; Sadia Sharmin (SEA, 2013)

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

New Effective Multithreaded Matching Algorithms. - Fredrik Manne; Mahantesh Halappanavar (IPDPS, 2014)

New Iterative Algorithms for Weighted Matching. - Alexander Idelberger; Fredrik Manne (NIK, 2014)

Pardicle: Parallel Approximate Density-Based Clustering. - Md. Mostofa Ali Patwary; Nadathur Satish; Narayanan Sundaram; Fredrik Manne; Salman Habib; Pradeep Dubey (SC, 2014)

On parallel push-relabel based algorithms for bipartite maximum matching. - Johannes Langguth; Ariful Azad; Mahantesh Halappanavar; Fredrik Manne (Parallel Comput., 2014)

Latency-optimal communication in wireless mesh networks. - Qin Xin 001; Fredrik Manne; Xiaolan Yao (Theor. Comput. Sci., 2014)

Optimizing Approximate Weighted Matching on Nvidia Kepler K40. - Md. Naim; Fredrik Manne; Mahantesh Halappanavar; Antonino Tumeo; Johannes Langguth (HiPC, 2015)

Modifying a Graph Using Vertex Elimination. - Petr A. Golovach; Pinar Heggernes; Pim van 't Hof; Fredrik Manne; Daniël Paulusma; Michal Pilipczuk (Algorithmica, 2015)

Codesign Lessons Learned from Implementing Graph Matching on Multithreaded Architectures. - Mahantesh Halappanavar; Alex Pothen; Ariful Azad; Fredrik Manne; Johannes Langguth; Arif M. Khan (Computer, 2015)

On Stable Marriages and Greedy Matchings. - Fredrik Manne; Md. Naim; Håkon Lerring; Mahantesh Halappanavar (CSC, 2016)

Efficient Approximation Algorithms for Weighted b-Matching. - Arif M. Khan; Alex Pothen; Md. Mostofa Ali Patwary; Nadathur Rajagopalan Satish; Narayanan Sundaram; Fredrik Manne; Mahantesh Halappanavar; Pradeep Dubey (SIAM J. Sci. Comput., 2016)

Community Detection on the GPU. - Md. Naim; Fredrik Manne; Mahantesh Halappanavar; Antonino Tumeo (IPDPS, 2017)

Scalable b-Matching on GPUs. - Md. Naim; Fredrik Manne (IPDPS Workshops, 2018)

Approximation algorithms in combinatorial scientific computing. - Alex Pothen; S. M. Ferdous; Fredrik Manne (Acta Numer., 2019)

α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms. - Fredrik Manne; Geevarghese Philip; Saket Saurabh 001; Prafullkumar Tale (CoRR, 2021)

Efficient Multi-core Algorithms for Computing Spanning Forests and Connected Components. - Fredrik Manne; Md. Mostofa Ali Patwary (Massive Graph Analytics, 2022)

Efficient Minimum Weight Vertex Cover Heuristics Using Graph Neural Networks. - Kenneth Langedal; Johannes Langguth; Fredrik Manne; Daniel Thilo Schroeder (SEA, 2022)

Graph Neural Networks as Ordering Heuristics for Parallel Graph Coloring. - Kenneth Langedal; Fredrik Manne (CoRR, 2024)