Martin Wahlen

14 papers A 1C 1Misc 1Journal 8Unranked 2
YearRankTypeTitle / Venue / Authors
2014 J jnl
Exponential Time Complexity of the Permanent and the Tutte Polynomial.
ACM Trans. Algorithms
Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, Martin Wahlen
2012 J jnl
Exponential Time Complexity of the Permanent and the Tutte Polynomial
CoRR
Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, Martin Wahlen
2010 — conf
Exponential Time Complexity of the Permanent and the Tutte Polynomial.
ICALP (1)
Holger Dell, Thore Husfeldt, Martin Wahlen
2010 J jnl
Exponential Time Complexity of the Permanent and the Tutte Polynomial.
Electron. Colloquium Comput. Complex.
Holger Dell, Thore Husfeldt, Martin Wahlen
2009 — —
Algorithmic Graph Problems - From Computer Networks to Graph Embeddings.
Martin Wahlen
2009 J jnl
An exact algorithm for subgraph homeomorphism.
J. Discrete Algorithms
Andrzej Lingas, Martin Wahlen
2009 J jnl
On the complexity of approximating the Hadwiger number.
Theor. Comput. Sci.
Martin Wahlen
2008 A conf
Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges.
DISC
Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Lingas, Martin Wahlen
2007 J jnl
Approximating the maximum clique minor and some subgraph homeomorphism problems.
Theor. Comput. Sci.
Noga Alon, Andrzej Lingas, Martin Wahlen
2007 C conf
On Exact Complexity of Subgraph Homeomorphism.
TAMC
Andrzej Lingas, Martin Wahlen
2006 — conf
Minimum-Energy Broadcasting in Wireless Networks in the
CAAN
Andrzej Lingas, Mia Persson, Martin Wahlen
2005 J jnl
A note on maximum independent set and related problems on box graphs.
Inf. Process. Lett.
Andrzej Lingas, Martin Wahlen
2004 J jnl
On approximation of the maximum clique minor containment problem and some subgraph homeomorphism problems
Electron. Colloquium Comput. Complex.
Andrzej Lingas, Martin Wahlen
2003 Misc conf
Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs.
COCOON
Andrzej Lingas, Martin Wahlen