Fredrik Manne

Daniel Thilo Schroeder

Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

Efficient Multi-core Algorithms for Computing Spanning Forests and Connected Components.

[BibT_eX]

[DOI]

Proceedings of the Massive Graph Analytics, 2022

2021

α-approximate Reductions: a Novel Source of Heuristics for Better Approximation Algorithms.

[BibT_eX]

[DOI]

CoRR, 2021

2019

Approximation algorithms in combinatorial scientific computing.

[BibT_eX]

[DOI]

S. M. Ferdous

Acta Numer., 2019

2018

Scalable b-Matching on GPUs.

[BibT_eX]

[DOI]

Proceedings of the 2018 IEEE International Parallel and Distributed Processing Symposium Workshops, 2018

2017

Community Detection on the GPU.

[BibT_eX]

[DOI]

Antonino Tumeo

Proceedings of the 2017 IEEE International Parallel and Distributed Processing Symposium, 2017

2016

Efficient Approximation Algorithms for Weighted b-Matching.

[BibT_eX]

[DOI]

Arif M. Khan

Nadathur Rajagopalan Satish

Narayanan Sundaram

Pradeep Dubey

SIAM J. Sci. Comput., 2016

On Stable Marriages and Greedy Matchings.

[BibT_eX]

[DOI]

Håkon Lerring

Proceedings of the 2016 Proceedings of the Seventh SIAM Workshop on Combinatorial Scientific Computing, 2016

2015

Codesign Lessons Learned from Implementing Graph Matching on Multithreaded Architectures.

[BibT_eX]

[DOI]

Computer, 2015

Modifying a Graph Using Vertex Elimination.

[BibT_eX]

[DOI]

Algorithmica, 2015

Optimizing Approximate Weighted Matching on Nvidia Kepler K40.

[BibT_eX]

[DOI]

Antonino Tumeo

Proceedings of the 22nd IEEE International Conference on High Performance Computing, 2015

2014

Latency-optimal communication in wireless mesh networks.

[BibT_eX]

[DOI]

Xiaolan Yao

Theor. Comput. Sci., 2014

On parallel push-relabel based algorithms for bipartite maximum matching.

[BibT_eX]

[DOI]

Ariful Azad

Parallel Comput., 2014

Pardicle: Parallel Approximate Density-Based Clustering.

[BibT_eX]

[DOI]

Proceedings of the International Conference for High Performance Computing, 2014

New Iterative Algorithms for Weighted Matching.

[BibT_eX]

[DOI]

Alexander Idelberger

Proceedings of the 27th Norsk Informatikkonferanse, 2014

New Effective Multithreaded Matching Algorithms.

[BibT_eX]

[DOI]

Proceedings of the 2014 IEEE 28th International Parallel and Distributed Processing Symposium, 2014

2013

Push-relabel based algorithms for the maximum transversal problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2013

Efficient Counting of Maximal Independent Sets in Sparse Graphs.

[BibT_eX]

[DOI]

Sadia Sharmin

Proceedings of the Experimental Algorithms, 12th International Symposium, 2013

Scalable parallel OPTICS data clustering using graph algorithmic techniques.

[BibT_eX]

[DOI]

Proceedings of the International Conference for High Performance Computing, 2013

2012

Almost optimal distributed M2M multicasting in wireless mesh networks.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

An efficient self-stabilizing distance-2 coloring algorithm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2012

How to Eliminate a Graph.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2012

A new scalable parallel DBSCAN algorithm using the disjoint-set data structure.

[BibT_eX]

[DOI]

Proceedings of the SC Conference on High Performance Computing Networking, 2012

Multi-core Spanning Forest Algorithms using the Disjoint-set Data Structure.

[BibT_eX]

[DOI]

Peder Refsnes

Proceedings of the 26th IEEE International Parallel and Distributed Processing Symposium, 2012

2011

A self-stabilizing 2/3-approximation algorithm for the maximum matching problem.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Parallel algorithms for bipartite matching problems on distributed memory computers.

[BibT_eX]

[DOI]

Parallel Comput., 2011

2010

Distributed-Memory Parallel Algorithms for Distance-2 Coloring and Related Problems in Derivative Computation.

[BibT_eX]

[DOI]

Assefaw H. Gebremedhin

Füsun Özgüner

SIAM J. Sci. Comput., 2010

Heuristic initialization for bipartite matching problems.

[BibT_eX]

[DOI]

Peter Sanders

ACM J. Exp. Algorithmics, 2010

Experiments on Union-Find Algorithms for the Disjoint-Set Data Structure.

[BibT_eX]

[DOI]

Proceedings of the Experimental Algorithms, 9th International Symposium, 2010

Efficient Self-stabilizing Graph Searching in Tree Networks.

[BibT_eX]

[DOI]

Rodica Mihai

Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2010

2009

A new self-stabilizing maximal matching algorithm.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Faster Deterministic Communication in Radio Networks.

[BibT_eX]

[DOI]

Ferdinando Cicalese

Algorithmica, 2009

Maximum weighted matching using the partitioned global address space model.

[BibT_eX]

[DOI]

Alicia Thorsen

Phillip Merkey

Proceedings of the 2009 Spring Simulation Multiconference, SpringSim 2009, 2009

A Scalable Parallel Union-Find Algorithm for Distributed Memory Computers.

[BibT_eX]

[DOI]

Proceedings of the Parallel Processing and Applied Mathematics, 2009

Almost Optimal Distributed M2M Multicasting in Wireless Mesh Networks.

[BibT_eX]

[DOI]

Proceedings of the IEEE 6th International Conference on Mobile Adhoc and Sensor Systems, 2009

2008

A framework for scalable greedy coloring on distributed-memory parallel computers.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2008

Time Efficient Radio Broadcasting in Planar Graphs.

[BibT_eX]

[DOI]

J. Networks, 2008

A Self-stabilizing -Approximation Algorithm for the Maximum Matching Problem.

[BibT_eX]

[DOI]

Proceedings of the Stabilization, 2008

2007

New Acyclic and Star Coloring Algorithms with Application to Computing Hessians.

[BibT_eX]

[DOI]

Arijit Tarafdar

SIAM J. Sci. Comput., 2007

A Self-stabilizing Weighted Matching Algorithm.

[BibT_eX]

[DOI]

Morten Mjelde

Proceedings of the Stabilization, 2007

A Parallel Approximation Algorithm for the Weighted Maximum Matching Problem.

[BibT_eX]

[DOI]

Rob H. Bisseling

Proceedings of the Parallel Processing and Applied Mathematics, 2007

2006

A Memory Efficient Self-stabilizing Algorithm for Maximal <i>k</i> -Packing.

[BibT_eX]

[DOI]

Morten Mjelde

Proceedings of the Stabilization, 2006

Faster Centralized Communication in Radio Networks.

[BibT_eX]

[DOI]

Ferdinando Cicalese

Proceedings of the Algorithms and Computation, 17th International Symposium, 2006

Optimal Gossiping with Unit Size Messages in Known Topology Radio Networks.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial and Algorithmic Aspects of Networking, Third Workshop, 2006

2005

What Color Is Your Jacobian? Graph Coloring for Computing Derivatives.

[BibT_eX]

[DOI]

SIAM Rev., 2005

A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers.

[BibT_eX]

[DOI]

Füsun Özgüner

Proceedings of the High Performance Computing and Communications, 2005

A Scalable Parallel Graph Coloring Algorithm for Distributed Memory Computers.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2005, Parallel Processing, 11th International Euro-Par Conference, Lisbon, Portugal, August 30, 2005

2004

Speeding up Parallel Graph Coloring.

[BibT_eX]

[DOI]

Tom Woods

Proceedings of the Applied Parallel Computing, 2004

Efficient Generic Multi-Stage Self-Stabilizing Algorithms for Trees.

[BibT_eX]

Proceedings of the ISCA 17th International Conference on Parallel and Distributed Computing Systems, 2004

2003

Efficient Self-stabilizing Algorithms for Tree Network.

[BibT_eX]

[DOI]

Proceedings of the 23rd International Conference on Distributed Computing Systems (ICDCS 2003), 2003

2002

Parallel Distance-k Coloring Algorithms for Numerical Optimization.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2002, 2002

2001

Approximations for the general block distribution of a matrix.

[BibT_eX]

[DOI]

Bengt Aspvall

Magnús M. Halldórsson

Theor. Comput. Sci., 2001

2000

Scalable parallel graph coloring algorithms.

[BibT_eX]

[DOI]

Concurr. Pract. Exp., 2000

Competing in computing (poster session).

[BibT_eX]

[DOI]

Proceedings of the 5th Annual SIGCSE Conference on Innovation and Technology in Computer Science Education, 2000

1998

A Parallel Algorithm for Computing the Extremal Eigenvalues of Very Large Sparse Matrices.

[BibT_eX]

[DOI]

Proceedings of the Applied Parallel Computing, 1998

1996

Automating the Debugging of Large Numerical Codes.

[BibT_eX]

[DOI]

Svein Olav Andersen

Proceedings of the Modern Software Tools for Scientific Computing, 1996

Partitioning an Array onto a Mesh of Processors.

[BibT_eX]

[DOI]

Tor Sørevik

Proceedings of the Applied Parallel Computing, 1996

On the Complexity of the Generalized Block Distribution.

[BibT_eX]

[DOI]

Michelangelo Grigni

Proceedings of the Parallel Algorithms for Irregularly Structured Problems, 1996

1995

Efficient Partitioning of Sequences.

[BibT_eX]

[DOI]

Bjørn Olstad

IEEE Trans. Computers, 1995

Efficient Sparse Cholesky Factorization on a Massively Parallel SIMD Computer.

[BibT_eX]

[DOI]

Hjálmtyr Hafsteinsson

SIAM J. Sci. Comput., 1995

Optimal Partitioning of Sequences.

[BibT_eX]

[DOI]