| |
| 2007 | ||
|---|---|---|
| 6 | EE | Andrzej Lingas, Martin Wahlen: On Exact Complexity of Subgraph Homeomorphism. TAMC 2007: 256-261 |
| 5 | EE | Noga Alon, Andrzej Lingas, Martin Wahlen: Approximating the maximum clique minor and some subgraph homeomorphism problems. Theor. Comput. Sci. 374(1-3): 149-158 (2007) |
| 2006 | ||
| 4 | EE | Andrzej Lingas, Mia Persson, Martin Wahlen: Minimum-Energy Broadcasting in Wireless Networks in the d-Dimensional Euclidean Space (The alpha<=d Case). CAAN 2006: 112-124 |
| 2005 | ||
| 3 | EE | Andrzej Lingas, Martin Wahlen: A note on maximum independent set and related problems on box graphs. Inf. Process. Lett. 93(4): 169-171 (2005) |
| 2004 | ||
| 2 | EE | Andrzej Lingas, Martin Wahlen: On approximation of the maximum clique minor containment problem and some subgraph homeomorphism problems Electronic Colloquium on Computational Complexity (ECCC)(039): (2004) |
| 2003 | ||
| 1 | EE | Andrzej Lingas, Martin Wahlen: Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs. COCOON 2003: 50-56 |
| 1 | Noga Alon | [5] |
| 2 | Andrzej Lingas | [1] [2] [3] [4] [5] [6] |
| 3 | Mia Persson | [4] |