Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs. - Andrzej Lingas; Martin Wahlen (COCOON, 2003)

On approximation of the maximum clique minor containment problem and some subgraph homeomorphism problems - Andrzej Lingas; Martin Wahlen (Electron. Colloquium Comput. Complex., 2004)

A note on maximum independent set and related problems on box graphs. - Andrzej Lingas; Martin Wahlen (Inf. Process. Lett., 2005)

Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The alpha<=d Case). - Andrzej Lingas; Mia Persson; Martin Wahlen (CAAN, 2006)

On Exact Complexity of Subgraph Homeomorphism. - Andrzej Lingas; Martin Wahlen (TAMC, 2007)

Approximating the maximum clique minor and some subgraph homeomorphism problems. - Noga Alon; Andrzej Lingas; Martin Wahlen (Theor. Comput. Sci., 2007)

Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges. - Leszek Gasieniec; Dariusz R. Kowalski; Andrzej Lingas; Martin Wahlen (DISC, 2008)

An exact algorithm for subgraph homeomorphism. - Andrzej Lingas; Martin Wahlen (J. Discrete Algorithms, 2009)

On the complexity of approximating the Hadwiger number. - Martin Wahlen (Theor. Comput. Sci., 2009)

Algorithmic Graph Problems - From Computer Networks to Graph Embeddings. - Martin Wahlen (2009)

Exponential Time Complexity of the Permanent and the Tutte Polynomial. - Holger Dell; Thore Husfeldt; Martin Wahlen (Electron. Colloquium Comput. Complex., 2010)

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)