default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFredrik Manne
Person information
- affiliation: University of Bergen, Norway
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i3]Kenneth Langedal
, Fredrik Manne:
Graph Neural Networks as Ordering Heuristics for Parallel Graph Coloring. CoRR abs/2408.05054 (2024)- 2022
- [c38]Kenneth Langedal, Johannes Langguth, Fredrik Manne, Daniel Thilo Schroeder:
Efficient Minimum Weight Vertex Cover Heuristics Using Graph Neural Networks. SEA 2022: 12:1-12:17 - [p1]Fredrik Manne, Md. Mostofa Ali Patwary:
Efficient Multi-core Algorithms for Computing Spanning Forests and Connected Components. Massive Graph Analytics 2022: 109-125 - 2021
- [i2]Fredrik Manne, Geevarghese Philip, Saket Saurabh, Prafullkumar Tale:
α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms. CoRR abs/2106.14169 (2021)
2010 – 2019
- 2019
- [j25]Alex Pothen, S. M. Ferdous, Fredrik Manne:
Approximation algorithms in combinatorial scientific computing. Acta Numer. 28: 541-633 (2019) - 2018
- [c37]Md. Naim, Fredrik Manne:
Scalable b-Matching on GPUs. IPDPS Workshops 2018: 637-646 - [e2]Fredrik Manne, Peter Sanders, Sivan Toledo:
Proceedings of the Eighth SIAM Workshop on Combinatorial Scientific Computing, CSC 2018, Bergen, Norway, June 6-8, 2018. SIAM 2018, ISBN 978-1-61197-521-5 [contents] - 2017
- [c36]Md. Naim, Fredrik Manne, Mahantesh Halappanavar, Antonino Tumeo:
Community Detection on the GPU. IPDPS 2017: 625-634 - 2016
- [j24]Arif M. Khan, Alex Pothen, Md. Mostofa Ali Patwary, Nadathur Rajagopalan Satish, Narayanan Sundaram, Fredrik Manne, Mahantesh Halappanavar, Pradeep Dubey:
Efficient Approximation Algorithms for Weighted b-Matching. SIAM J. Sci. Comput. 38(5) (2016) - [c35]Fredrik Manne, Md. Naim, Håkon Lerring, Mahantesh Halappanavar:
On Stable Marriages and Greedy Matchings. CSC 2016: 92-101 - 2015
- [j23]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk:
Modifying a Graph Using Vertex Elimination. Algorithmica 72(1): 99-125 (2015) - [j22]Mahantesh Halappanavar, Alex Pothen, Ariful Azad, Fredrik Manne, Johannes Langguth, Arif M. Khan:
Codesign Lessons Learned from Implementing Graph Matching on Multithreaded Architectures. Computer 48(8): 46-55 (2015) - [c34]Md. Naim, Fredrik Manne, Mahantesh Halappanavar, Antonino Tumeo, Johannes Langguth:
Optimizing Approximate Weighted Matching on Nvidia Kepler K40. HiPC 2015: 105-114 - 2014
- [j21]Johannes Langguth, Ariful Azad, Mahantesh Halappanavar, Fredrik Manne:
On parallel push-relabel based algorithms for bipartite maximum matching. Parallel Comput. 40(7): 289-308 (2014) - [j20]Qin Xin, Fredrik Manne, Xiaolan Yao:
Latency-optimal communication in wireless mesh networks. Theor. Comput. Sci. 528: 79-84 (2014) - [c33]Fredrik Manne, Mahantesh Halappanavar:
New Effective Multithreaded Matching Algorithms. IPDPS 2014: 519-528 - [c32]Alexander Idelberger, Fredrik Manne:
New Iterative Algorithms for Weighted Matching. NIK 2014 - [c31]Md. Mostofa Ali Patwary, Nadathur Satish, Narayanan Sundaram, Fredrik Manne, Salman Habib, Pradeep Dubey:
Pardicle: Parallel Approximate Density-Based Clustering. SC 2014: 560-571 - 2013
- [j19]Kamer Kaya, Johannes Langguth, Fredrik Manne, Bora Uçar:
Push-relabel based algorithms for the maximum transversal problem. Comput. Oper. Res. 40(5): 1266-1275 (2013) - [c30]Md. Mostofa Ali Patwary, Diana Palsetia, Ankit Agrawal, Wei-keng Liao, Fredrik Manne, Alok N. Choudhary:
Scalable parallel OPTICS data clustering using graph algorithmic techniques. SC 2013: 49:1-49:12 - [c29]Fredrik Manne, Sadia Sharmin:
Efficient Counting of Maximal Independent Sets in Sparse Graphs. SEA 2013: 103-114 - 2012
- [j18]Qin Xin, Fredrik Manne, Yan Zhang, Xin Wang:
Almost optimal distributed M2M multicasting in wireless mesh networks. Theor. Comput. Sci. 439: 69-82 (2012) - [j17]Jean R. S. Blair, Fredrik Manne:
An efficient self-stabilizing distance-2 coloring algorithm. Theor. Comput. Sci. 444: 28-39 (2012) - [c28]Md. Mostofa Ali Patwary, Peder Refsnes, Fredrik Manne:
Multi-core Spanning Forest Algorithms using the Disjoint-set Data Structure. IPDPS 2012: 827-835 - [c27]Md. Mostofa Ali Patwary, Diana Palsetia, Ankit Agrawal, Wei-keng Liao, Fredrik Manne, Alok N. Choudhary:
A new scalable parallel DBSCAN algorithm using the disjoint-set data structure. SC 2012: 62 - [c26]Petr A. Golovach, Pinar Heggernes, Pim van 't Hof, Fredrik Manne, Daniël Paulusma, Michal Pilipczuk:
How to Eliminate a Graph. WG 2012: 320-331 - 2011
- [j16]Johannes Langguth, Md. Mostofa Ali Patwary, Fredrik Manne:
Parallel algorithms for bipartite matching problems on distributed memory computers. Parallel Comput. 37(12): 820-845 (2011) - [j15]Fredrik Manne, Morten Mjelde, Laurence Pilard, Sébastien Tixeuil:
A self-stabilizing 2/3-approximation algorithm for the maximum matching problem. Theor. Comput. Sci. 412(40): 5515-5526 (2011) - 2010
- [j14]Johannes Langguth, Fredrik Manne, Peter Sanders:
Heuristic initialization for bipartite matching problems. ACM J. Exp. Algorithmics 15 (2010) - [j13]Doruk Bozdag, Ümit V. Çatalyürek, Assefaw H. Gebremedhin, Fredrik Manne, Erik G. Boman, Füsun Özgüner:
Distributed-Memory Parallel Algorithms for Distance-2 Coloring and Related Problems in Derivative Computation. SIAM J. Sci. Comput. 32(4): 2418-2446 (2010) - [c25]Jean R. S. Blair, Fredrik Manne, Rodica Mihai:
Efficient Self-stabilizing Graph Searching in Tree Networks. SSS 2010: 111-125 - [c24]Md. Mostofa Ali Patwary, Jean R. S. Blair, Fredrik Manne:
Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure. SEA 2010: 411-423
2000 – 2009
- 2009
- [j12]Ferdinando Cicalese, Fredrik Manne, Qin Xin:
Faster Deterministic Communication in Radio Networks. Algorithmica 54(2): 226-242 (2009) - [j11]Fredrik Manne, Morten Mjelde, Laurence Pilard, Sébastien Tixeuil:
A new self-stabilizing maximal matching algorithm. Theor. Comput. Sci. 410(14): 1336-1345 (2009) - [c23]Qin Xin, Fredrik Manne, Yan Zhang, Jianping Wang, Zeyu Zheng:
Almost Optimal Distributed M2M Multicasting in Wireless Mesh Networks. MASS 2009: 120-129 - [c22]Fredrik Manne, Md. Mostofa Ali Patwary:
A Scalable Parallel Union-Find Algorithm for Distributed Memory Computers. PPAM (1) 2009: 186-195 - [c21]Jean R. S. Blair, Fredrik Manne:
An Efficient Self-stabilizing Distance-2 Coloring Algorithm. SIROCCO 2009: 237-251 - [c20]Alicia Thorsen, Phillip Merkey, Fredrik Manne:
Maximum weighted matching using the partitioned global address space model. SpringSim 2009 - 2008
- [j10]Fredrik Manne, Qin Xin:
Time Efficient Radio Broadcasting in Planar Graphs. J. Networks 3(2): 9-16 (2008) - [j9]Doruk Bozdag, Assefaw Hadish Gebremedhin, Fredrik Manne, Erik G. Boman, Ümit V. Çatalyürek:
A framework for scalable greedy coloring on distributed-memory parallel computers. J. Parallel Distributed Comput. 68(4): 515-535 (2008) - [c19]Fredrik Manne, Morten Mjelde, Laurence Pilard, Sébastien Tixeuil:
A Self-stabilizing -Approximation Algorithm for the Maximum Matching Problem. SSS 2008: 94-108 - 2007
- [j8]Assefaw Hadish Gebremedhin, Arijit Tarafdar, Fredrik Manne, Alex Pothen:
New Acyclic and Star Coloring Algorithms with Application to Computing Hessians. SIAM J. Sci. Comput. 29(3): 1042-1072 (2007) - [c18]Fredrik Manne, Rob H. Bisseling:
A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem. PPAM 2007: 708-717 - [c17]Fredrik Manne, Morten Mjelde, Laurence Pilard, Sébastien Tixeuil:
A New Self-stabilizing Maximal Matching Algorithm. SIROCCO 2007: 96-108 - [c16]Fredrik Manne, Morten Mjelde:
A Self-stabilizing Weighted Matching Algorithm. SSS 2007: 383-393 - [i1]Fredrik Manne, Morten Mjelde, Laurence Pilard, Sébastien Tixeuil:
A New Self-Stabilizing Maximal Matching Algorithm. CoRR abs/cs/0701189 (2007) - 2006
- [c15]Fredrik Manne, Qin Xin:
Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks. CAAN 2006: 125-134 - [c14]Ferdinando Cicalese, Fredrik Manne, Qin Xin:
Faster Centralized Communication in Radio Networks. ISAAC 2006: 339-348 - [c13]Fredrik Manne, Morten Mjelde:
A Memory Efficient Self-stabilizing Algorithm for Maximal k -Packing. SSS 2006: 428-439 - 2005
- [j7]Assefaw Hadish Gebremedhin, Fredrik Manne, Alex Pothen:
What Color Is Your Jacobian? Graph Coloring for Computing Derivatives. SIAM Rev. 47(4): 629-705 (2005) - [c12]Erik G. Boman, Doruk Bozdag, Ümit V. Çatalyürek, Assefaw Hadish Gebremedhin, Fredrik Manne:
A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers. Euro-Par 2005: 241-251 - [c11]Doruk Bozdag, Ümit V. Çatalyürek, Assefaw Hadish Gebremedhin, Fredrik Manne, Erik G. Boman, Füsun Özgüner:
A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers. HPCC 2005: 796-806 - 2004
- [c10]Jean R. S. Blair, Fredrik Manne:
Efficient Generic Multi-Stage Self-Stabilizing Algorithms for Trees. PDCS 2004: 333-338 - [c9]Assefaw Hadish Gebremedhin, Fredrik Manne, Tom Woods:
Speeding up Parallel Graph Coloring. PARA 2004: 1079-1088 - 2003
- [c8]Jean R. S. Blair, Fredrik Manne:
Efficient Self-stabilizing Algorithms for Tree Network. ICDCS 2003: 20- - 2002
- [c7]Assefaw Hadish Gebremedhin, Fredrik Manne, Alex Pothen:
Parallel Distance-k Coloring Algorithms for Numerical Optimization. Euro-Par 2002: 912-921 - 2001
- [j6]Bengt Aspvall, Magnús M. Halldórsson, Fredrik Manne:
Approximations for the general block distribution of a matrix. Theor. Comput. Sci. 262(1): 145-160 (2001) - [e1]Tor Sørevik, Fredrik Manne, Randi Moe, Assefaw Hadish Gebremedhin:
Applied Parallel Computing, New Paradigms for HPC in Industry and Academia, 5th International Workshop, PARA 2000 Bergen, Norway, June 18-20, 2000 Proceedings. Lecture Notes in Computer Science 1947, Springer 2001, ISBN 3-540-41729-X [contents] - 2000
- [j5]Assefaw Hadish Gebremedhin, Fredrik Manne:
Scalable parallel graph coloring algorithms. Concurr. Pract. Exp. 12(12): 1131-1146 (2000) - [c6]Fredrik Manne:
Competing in computing (poster session). ITiCSE 2000: 190
1990 – 1999
- 1998
- [c5]Fredrik Manne:
A Parallel Algorithm for Computing the Extremal Eigenvalues of Very Large Sparse Matrices. PARA 1998: 332-336 - [c4]Bengt Aspvall, Magnús M. Halldórsson, Fredrik Manne:
Approximations for the General Block Distribution of a Matrix. SWAT 1998: 47-58 - 1996
- [c3]Michelangelo Grigni, Fredrik Manne:
On the Complexity of the Generalized Block Distribution. IRREGULAR 1996: 319-326 - [c2]Fredrik Manne, Tor Sørevik:
Partitioning an Array onto a Mesh of Processors. PARA 1996: 467-477 - [c1]Fredrik Manne, Svein Olav Andersen:
Automating the Debugging of Large Numerical Codes. SciTools 1996: 339-352 - 1995
- [j4]Fredrik Manne, Tor Sørevik:
Optimal Partitioning of Sequences. J. Algorithms 19(2): 235-249 (1995) - [j3]Fredrik Manne, Hjálmtyr Hafsteinsson:
Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer. SIAM J. Sci. Comput. 16(4): 934-950 (1995) - [j2]Bjørn Olstad, Fredrik Manne:
Efficient Partitioning of Sequences. IEEE Trans. Computers 44(11): 1322-1326 (1995) - 1992
- [j1]Petter E. Bjørstad, Fredrik Manne, Tor Sørevik, Marián Vajtersic:
Efficient Matrix Multiplication on SIMD Computers. SIAM J. Matrix Anal. Appl. 13(1): 386-401 (1992)
Coauthor Index
aka: Assefaw H. Gebremedhin
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:24 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
