Martin Wahlén (Former)

1 – 10 of 11

show: 10
|
sort: year (new to old)

News feed Embed this list Save this search Mark all Export

Cancel

Embed this list

copy and paste the html snippet below into your own page:

<iframe src="https://lup.lub.lu.se/search/person/1d7f5fc8-ed83-45ee-972d-0b0c3019c242?embed=1&amp;hide_pagination=1&amp;hide_info=1&amp;hide_options=1"
  width="100%"
  height="400"
  allowtransparency="true"
  frameborder="0">
</iframe>

« previous
1
2
next »

2014
Mark Exponential Time Complexity of the Permanent and the Tutte Polynomial
Dell, Holger ; Husfeldt, Thore ^LU ; Marx, Daniel ; Taslaman, Nina and Wahlén, Martin ^LU (2014) In ACM Transactions on Algorithms 10(4). p.21-21
- Contribution to journal › Article
2010
Mark Exponential time complexity of the permanent and the Tutte polynomial
Dell, Holger ; Husfeldt, Thore ^LU and Wahlén, Martin ^LU (2010) 37th International Colloquium on Automata, Languages and Programming (ICALP 2010) In Lecture Notes in Computer Science 6198. p.426-437
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2009
Mark On the complexity of approximating the Hadwiger number
Wahlén, Martin ^LU (2009) In Theoretical Computer Science 410(8-10). p.994-1000
- Contribution to journal › Article
Mark An exact algorithm for subgraph homeomorphism
Lingas, Andrzej ^LU and Wahlén, Martin ^LU (2009) In Journal of Discrete Algorithms 7(4). p.464-468
- Contribution to journal › Article
Mark Algorithmic Graph Problems - From Computer Networks to Graph Embeddings
Wahlén, Martin ^LU (2009)
- Thesis › Doctoral thesis (compilation)
2008
Mark Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges
Gasieniec, Leszek ; Kowalski, Dariusz ; Lingas, Andrzej ^LU and Wahlén, Martin ^LU (2008) International Symposium on Distributed Computing (DISC) 5218. p.274-288
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2007
Mark Approximating the maximum clique minor and some subgraph homeomorphism problems.
Alon, Noga ; Lingas, Andrzej ^LU and Wahlén, Martin ^LU (2007) In Theoretical Computer Science 374(1-3). p.149-158
- Contribution to journal › Article
Mark On exact complexity of subgraph homeomorphism
Lingas, Andrzej ^LU and Wahlén, Martin ^LU (2007) 4th International Conference, TAMC 2007 4484. p.256-261
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2006
Mark Minimum-energy broadcasting in wireless networks in the d-dimensional Euclidean space (the alpha
Lingas, Andrzej ^LU ; Persson, Mia ^LU and Wahlén, Martin ^LU (2006) Third Workshop, CAAN 2006 4235. p.112-124
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2005
Mark A note on maximum independent set and related problems on box graphs
Lingas, Andrzej ^LU and Wahlén, Martin ^LU (2005) In Information Processing Letters 93(4). p.169-171
- Contribution to journal › Article

« previous
1
2
next »