BibTeX records: Martin Wahlen

download as .bib file

@article{DBLP:journals/talg/DellHMTW14,
  author       = {Holger Dell and
                  Thore Husfeldt and
                  D{\'{a}}niel Marx and
                  Nina Taslaman and
                  Martin Wahlen},
  title        = {Exponential Time Complexity of the Permanent and the Tutte Polynomial},
  journal      = {{ACM} Trans. Algorithms},
  volume       = {10},
  number       = {4},
  pages        = {21:1--21:32},
  year         = {2014},
  url          = {https://doi.org/10.1145/2635812},
  doi          = {10.1145/2635812},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/talg/DellHMTW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1206-1775,
  author       = {Holger Dell and
                  Thore Husfeldt and
                  D{\'{a}}niel Marx and
                  Nina Taslaman and
                  Martin Wahlen},
  title        = {Exponential Time Complexity of the Permanent and the Tutte Polynomial},
  journal      = {CoRR},
  volume       = {abs/1206.1775},
  year         = {2012},
  url          = {http://arxiv.org/abs/1206.1775},
  eprinttype    = {arXiv},
  eprint       = {1206.1775},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1206-1775.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DellHW10,
  author       = {Holger Dell and
                  Thore Husfeldt and
                  Martin Wahlen},
  editor       = {Samson Abramsky and
                  Cyril Gavoille and
                  Claude Kirchner and
                  Friedhelm Meyer auf der Heide and
                  Paul G. Spirakis},
  title        = {Exponential Time Complexity of the Permanent and the Tutte Polynomial},
  booktitle    = {Automata, Languages and Programming, 37th International Colloquium,
                  {ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
                  {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {6198},
  pages        = {426--437},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-14165-2\_37},
  doi          = {10.1007/978-3-642-14165-2\_37},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/DellHW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DellHW10,
  author       = {Holger Dell and
                  Thore Husfeldt and
                  Martin Wahlen},
  title        = {Exponential Time Complexity of the Permanent and the Tutte Polynomial},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR10-078}},
  year         = {2010},
  url          = {https://eccc.weizmann.ac.il/report/2010/078},
  eprinttype    = {ECCC},
  eprint       = {TR10-078},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/DellHW10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/LingasW09,
  author       = {Andrzej Lingas and
                  Martin Wahlen},
  title        = {An exact algorithm for subgraph homeomorphism},
  journal      = {J. Discrete Algorithms},
  volume       = {7},
  number       = {4},
  pages        = {464--468},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.jda.2008.10.003},
  doi          = {10.1016/J.JDA.2008.10.003},
  timestamp    = {Tue, 16 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/jda/LingasW09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Wahlen09,
  author       = {Martin Wahlen},
  title        = {On the complexity of approximating the Hadwiger number},
  journal      = {Theor. Comput. Sci.},
  volume       = {410},
  number       = {8-10},
  pages        = {994--996},
  year         = {2009},
  url          = {https://doi.org/10.1016/j.tcs.2008.12.020},
  doi          = {10.1016/J.TCS.2008.12.020},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/Wahlen09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wdag/GasieniecKLW08,
  author       = {Leszek Gasieniec and
                  Dariusz R. Kowalski and
                  Andrzej Lingas and
                  Martin Wahlen},
  editor       = {Gadi Taubenfeld},
  title        = {Efficient Broadcasting in Known Geometric Radio Networks with Non-uniform
                  Ranges},
  booktitle    = {Distributed Computing, 22nd International Symposium, {DISC} 2008,
                  Arcachon, France, September 22-24, 2008. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {5218},
  pages        = {274--288},
  publisher    = {Springer},
  year         = {2008},
  url          = {https://doi.org/10.1007/978-3-540-87779-0\_19},
  doi          = {10.1007/978-3-540-87779-0\_19},
  timestamp    = {Tue, 14 May 2019 10:00:54 +0200},
  biburl       = {https://dblp.org/rec/conf/wdag/GasieniecKLW08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AlonLW07,
  author       = {Noga Alon and
                  Andrzej Lingas and
                  Martin Wahlen},
  title        = {Approximating the maximum clique minor and some subgraph homeomorphism
                  problems},
  journal      = {Theor. Comput. Sci.},
  volume       = {374},
  number       = {1-3},
  pages        = {149--158},
  year         = {2007},
  url          = {https://doi.org/10.1016/j.tcs.2006.12.021},
  doi          = {10.1016/J.TCS.2006.12.021},
  timestamp    = {Wed, 17 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tcs/AlonLW07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/LingasW07,
  author       = {Andrzej Lingas and
                  Martin Wahlen},
  editor       = {Jin{-}yi Cai and
                  S. Barry Cooper and
                  Hong Zhu},
  title        = {On Exact Complexity of Subgraph Homeomorphism},
  booktitle    = {Theory and Applications of Models of Computation, 4th International
                  Conference, {TAMC} 2007, Shanghai, China, May 22-25, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4484},
  pages        = {256--261},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-72504-6\_23},
  doi          = {10.1007/978-3-540-72504-6\_23},
  timestamp    = {Mon, 04 May 2020 13:17:48 +0200},
  biburl       = {https://dblp.org/rec/conf/tamc/LingasW07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/caan/LingasPW06,
  author       = {Andrzej Lingas and
                  Mia Persson and
                  Martin Wahlen},
  editor       = {Thomas Erlebach},
  title        = {Minimum-Energy Broadcasting in Wireless Networks in the \emph{d}-Dimensional
                  Euclidean Space (The \emph{alpha}{\textless}=\emph{d} Case)},
  booktitle    = {Combinatorial and Algorithmic Aspects of Networking, Third Workshop,
                  {CAAN} 2006, Chester, UK, July 2, 2006. Revised Papers},
  series       = {Lecture Notes in Computer Science},
  volume       = {4235},
  pages        = {112--124},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11922377\_10},
  doi          = {10.1007/11922377\_10},
  timestamp    = {Tue, 14 May 2019 10:00:49 +0200},
  biburl       = {https://dblp.org/rec/conf/caan/LingasPW06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ipl/LingasW05,
  author       = {Andrzej Lingas and
                  Martin Wahlen},
  title        = {A note on maximum independent set and related problems on box graphs},
  journal      = {Inf. Process. Lett.},
  volume       = {93},
  number       = {4},
  pages        = {169--171},
  year         = {2005},
  url          = {https://doi.org/10.1016/j.ipl.2004.10.013},
  doi          = {10.1016/J.IPL.2004.10.013},
  timestamp    = {Fri, 26 May 2017 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ipl/LingasW05.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-039,
  author       = {Andrzej Lingas and
                  Martin Wahlen},
  title        = {On approximation of the maximum clique minor containment problem and
                  some subgraph homeomorphism problems},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR04-039}},
  year         = {2004},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-039/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR04-039},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR04-039.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/LingasW03,
  author       = {Andrzej Lingas and
                  Martin Wahlen},
  editor       = {Tandy J. Warnow and
                  Binhai Zhu},
  title        = {Subexponential-Time Algorithms for Maximum Independent Set and Related
                  Problems on Box Graphs},
  booktitle    = {Computing and Combinatorics, 9th Annual International Conference,
                  {COCOON} 2003, Big Sky, MT, USA, July 25-28, 2003, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {2697},
  pages        = {50--56},
  publisher    = {Springer},
  year         = {2003},
  url          = {https://doi.org/10.1007/3-540-45071-8\_7},
  doi          = {10.1007/3-540-45071-8\_7},
  timestamp    = {Tue, 14 May 2019 10:00:35 +0200},
  biburl       = {https://dblp.org/rec/conf/cocoon/LingasW03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics