Martin Wahlen

According to our database, Martin Wahlen authored at least 11 papers between 2003 and 2014.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2014

Exponential Time Complexity of the Permanent and the Tutte Polynomial.

Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, Martin Wahlen

ACM Trans. Algorithms, 2014

2010

Exponential Time Complexity of the Permanent and the Tutte Polynomial.

Holger Dell, Thore Husfeldt, Martin Wahlen

Electron. Colloquium Comput. Complex., 2010

2009

On the complexity of approximating the Hadwiger number.

Martin Wahlen

Theor. Comput. Sci., 2009

An exact algorithm for subgraph homeomorphism.

Andrzej Lingas, Martin Wahlen

J. Discrete Algorithms, 2009

2008

Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges.

Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Lingas, Martin Wahlen

Proceedings of the Distributed Computing, 22nd International Symposium, 2008

2007

Approximating the maximum clique minor and some subgraph homeomorphism problems.

Noga Alon, Andrzej Lingas, Martin Wahlen

Theor. Comput. Sci., 2007

On Exact Complexity of Subgraph Homeomorphism.

Andrzej Lingas, Martin Wahlen

Proceedings of the Theory and Applications of Models of Computation, 2007

2006

Minimum-Energy Broadcasting in Wireless Networks in the <i>d</i>-Dimensional Euclidean Space (The <i>alpha</i><=<i>d</i> Case).

Andrzej Lingas, Mia Persson, Martin Wahlen

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

2005

A note on maximum independent set and related problems on box graphs.

Andrzej Lingas, Martin Wahlen

Inf. Process. Lett., 2005

2004

On approximation of the maximum clique minor containment problem and some subgraph homeomorphism problems

Andrzej Lingas, Martin Wahlen

Electron. Colloquium Comput. Complex., 2004

2003

Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs.

Andrzej Lingas, Martin Wahlen

Proceedings of the Computing and Combinatorics, 9th Annual International Conference, 2003