Martin Wahlen

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
Exponential Time Complexity of the Permanent and the Tutte Polynomial ACM Transactions on Algorithms	2018-10-30	Paper
Exponential Time Complexity of the Permanent and the Tutte Polynomial ACM Transactions on Algorithms	2018-10-30	Paper
Subexponential-time algorithms for Maximum Independent Set and related problems on box graphs Lecture Notes in Computer Science	2011-03-18	Paper
Exponential time complexity of the permanent and the Tutte polynomial (extended abstract) Automata, Languages and Programming	2010-09-07	Paper
An exact algorithm for subgraph homeomorphism Journal of Discrete Algorithms	2009-12-10	Paper
A note on maximum independent set and related problems on box graphs Information Processing Letters	2009-08-27	Paper
Approximating the maximum clique minor and some subgraph homeomorphism problems Theoretical Computer Science	2009-06-22	Paper
On the complexity of approximating the Hadwiger number Theoretical Computer Science	2009-03-17	Paper
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges Lecture Notes in Computer Science	2008-11-20	Paper
Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The α≤d Case) Combinatorial and Algorithmic Aspects of Networking	2008-04-17	Paper
On Exact Complexity of Subgraph Homeomorphism Lecture Notes in Computer Science	2007-11-13	Paper

Research outcomes over time

This page was built for person: Martin Wahlen