Mikael Onsjö

Showing 3 publications


Graph Partitioning and Planted Partitions

Mikael Onsjö
Licentiate thesis

Finding Most Likely Solutions

Mikael Onsjö, Osamu Watanabe
Proc. CiE 2007: Computability in Europe. Vol. 4497, p. 758-767
Paper in proceeding

A Simple Message Passing Algorithm for Graph Partitioning

Mikael Onsjö, Osamu Watanabe
Algorithms and Computation 17th International Symposium, ISAAC 2006 Kolkata, India, December 18-20, 2006 Proceedings, Asano, Tetsuo (Ed.). Vol. 4288, p. 507-516
Paper in proceeding

Download publication list

You can download this list to your computer.

Filter and download publication list

As logged in user (Chalmers employee) you find more export functions in MyResearch.

You may also import these directly to Zotero or Mendeley by using a browser plugin. These are found herer:

Zotero Connector
Mendeley Web Importer

The service SwePub offers export of contents from Research in other formats, such as Harvard and Oxford in .RIS, BibTex and RefWorks format.

There are no projects.
There might be more projects where Mikael Onsjö participates, but you have to be logged in as a Chalmers employee to see them.