Martin Wahlen Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2012
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, Martin Wahlen: Exponential Time Complexity of the Permanent and the Tutte Polynomial. CoRR abs/1206.1775 (2012)
2010
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Holger Dell, Thore Husfeldt, Martin Wahlen: Exponential Time Complexity of the Permanent and the Tutte Polynomial. ICALP (1) 2010: 426-437
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Holger Dell, Thore Husfeldt, Martin Wahlen: Exponential Time Complexity of the Permanent and the Tutte Polynomial. Electronic Colloquium on Computational Complexity (ECCC) 17: 78 (2010)
2009
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrzej Lingas, Martin Wahlen: An exact algorithm for subgraph homeomorphism. J. Discrete Algorithms 7(4): 464-468 (2009)
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Martin Wahlen: On the complexity of approximating the Hadwiger number. Theor. Comput. Sci. 410(8-10): 994-996 (2009)
2008
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Leszek Gasieniec, Dariusz R. Kowalski, Andrzej Lingas, Martin Wahlen: Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform Ranges. DISC 2008: 274-288
2007
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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)
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrzej Lingas, Martin Wahlen: On Exact Complexity of Subgraph Homeomorphism. TAMC 2007: 256-261
2006
c2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
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
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Andrzej Lingas, Martin Wahlen: Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs. COCOON 2003: 50-56

Coauthor Index

1Noga Alon
[j2]
2Holger Dell
[i3] [c5] [i2]
3Leszek Gasieniec
[c4]
4Thore Husfeldt
[i3] [c5] [i2]
5Dariusz R. Kowalski (Darek Kowalski)
[c4]
6Andrzej Lingas
[j4] [c4] [j2] [c3] [c2] [j1] [i1] [c1]
7Dániel Marx
[i3]
8Mia Persson
[c2]
9Nina Taslaman
[i3]
Last update Thu May 23 18:12:51 2013 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page