Martin Wahlen

Publication Activity (10 Years)

Years Active: 2003-2014
Publications (10 Years): 0

Top Topics

Exponential Size

Average Case Complexity

Bayesian Networks

Top Venues

ACM Trans. Algorithms

Publications

Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, Martin Wahlen
Exponential Time Complexity of the Permanent and the Tutte Polynomial. ACM Trans. Algorithms 10 (4) (2014)
Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, Martin Wahlen
Exponential Time Complexity of the Permanent and the Tutte Polynomial CoRR (2012)
Holger Dell, Thore Husfeldt, Martin Wahlen
Exponential Time Complexity of the Permanent and the Tutte Polynomial. ICALP (1) (2010)
Holger Dell, Thore Husfeldt, Martin Wahlen
Exponential Time Complexity of the Permanent and the Tutte Polynomial. Electron. Colloquium Comput. Complex. 17 (2010)
Martin Wahlen
On the complexity of approximating the Hadwiger number. Theor. Comput. Sci. 410 (8-10) (2009)
Andrzej Lingas, Martin Wahlen
An exact algorithm for subgraph homeomorphism. J. Discrete Algorithms 7 (4) (2009)
Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Lingas, Martin Wahlen
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges. DISC (2008)
Andrzej Lingas, Martin Wahlen
On Exact Complexity of Subgraph Homeomorphism. TAMC (2007)
Noga Alon, Andrzej Lingas, Martin Wahlen
Approximating the maximum clique minor and some subgraph homeomorphism problems. Theor. Comput. Sci. 374 (1-3) (2007)
Andrzej Lingas, Mia Persson, Martin Wahlen
Case). CAAN (2006)
Andrzej Lingas, Martin Wahlen
A note on maximum independent set and related problems on box graphs. Inf. Process. Lett. 93 (4) (2005)
Andrzej Lingas, Martin Wahlen
On approximation of the maximum clique minor containment problem and some subgraph homeomorphism problems Electron. Colloquium Comput. Complex. (039) (2004)
Andrzej Lingas, Martin Wahlen
Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs. COCOON (2003)