BibTeX records: Holger Dell

download as .bib file

@article{DBLP:journals/siamcomp/DellLM22,
  author    = {Holger Dell and
               John Lapinskas and
               Kitty Meeks},
  title     = {Approximately Counting and Sampling Small Witnesses Using a Colorful
               Decision Oracle},
  journal   = {{SIAM} J. Comput.},
  volume    = {51},
  number    = {4},
  pages     = {849--899},
  year      = {2022},
  url       = {https://doi.org/10.1137/19m130604x},
  doi       = {10.1137/19m130604x},
  timestamp = {Mon, 08 Aug 2022 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamcomp/DellLM22.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/DellL21,
  author    = {Holger Dell and
               John Lapinskas},
  title     = {Fine-Grained Reductions from Approximate Counting to Decision},
  journal   = {{ACM} Trans. Comput. Theory},
  volume    = {13},
  number    = {2},
  pages     = {8:1--8:24},
  year      = {2021},
  url       = {https://doi.org/10.1145/3442352},
  doi       = {10.1145/3442352},
  timestamp = {Tue, 15 Jun 2021 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/toct/DellL21.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/CurticapeanDH21,
  author    = {Radu Curticapean and
               Holger Dell and
               Thore Husfeldt},
  editor    = {Petra Mutzel and
               Rasmus Pagh and
               Grzegorz Herman},
  title     = {Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs,
               and Paths},
  booktitle = {29th Annual European Symposium on Algorithms, {ESA} 2021, September
               6-8, 2021, Lisbon, Portugal (Virtual Conference)},
  series    = {LIPIcs},
  volume    = {204},
  pages     = {34:1--34:17},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2021},
  url       = {https://doi.org/10.4230/LIPIcs.ESA.2021.34},
  doi       = {10.4230/LIPIcs.ESA.2021.34},
  timestamp = {Tue, 31 Aug 2021 14:18:27 +0200},
  biburl    = {https://dblp.org/rec/conf/esa/CurticapeanDH21.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-00629,
  author    = {Radu Curticapean and
               Holger Dell and
               Thore Husfeldt},
  title     = {Modular counting of subgraphs: Matchings, matching-splittable graphs,
               and paths},
  journal   = {CoRR},
  volume    = {abs/2107.00629},
  year      = {2021},
  url       = {https://arxiv.org/abs/2107.00629},
  eprinttype = {arXiv},
  eprint    = {2107.00629},
  timestamp = {Wed, 07 Jul 2021 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-2107-00629.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DellLM20,
  author    = {Holger Dell and
               John Lapinskas and
               Kitty Meeks},
  editor    = {Shuchi Chawla},
  title     = {Approximately counting and sampling small witnesses using a colourful
               decision oracle},
  booktitle = {Proceedings of the 2020 {ACM-SIAM} Symposium on Discrete Algorithms,
               {SODA} 2020, Salt Lake City, UT, USA, January 5-8, 2020},
  pages     = {2201--2211},
  publisher = {{SIAM}},
  year      = {2020},
  url       = {https://doi.org/10.1137/1.9781611975994.135},
  doi       = {10.1137/1.9781611975994.135},
  timestamp = {Thu, 15 Jul 2021 13:48:53 +0200},
  biburl    = {https://dblp.org/rec/conf/soda/DellLM20.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BrandDR19,
  author    = {Cornelius Brand and
               Holger Dell and
               Marc Roth},
  title     = {Fine-Grained Dichotomies for the Tutte Plane and Boolean {\#}CSP},
  journal   = {Algorithmica},
  volume    = {81},
  number    = {2},
  pages     = {541--556},
  year      = {2019},
  url       = {https://doi.org/10.1007/s00453-018-0472-z},
  doi       = {10.1007/s00453-018-0472-z},
  timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/algorithmica/BrandDR19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/CurticapeanDFGL19,
  author    = {Radu Curticapean and
               Holger Dell and
               Fedor V. Fomin and
               Leslie Ann Goldberg and
               John Lapinskas},
  title     = {A Fixed-Parameter Perspective on {\#}BIS},
  journal   = {Algorithmica},
  volume    = {81},
  number    = {10},
  pages     = {3844--3864},
  year      = {2019},
  url       = {https://doi.org/10.1007/s00453-019-00606-4},
  doi       = {10.1007/s00453-019-00606-4},
  timestamp = {Thu, 31 Oct 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/algorithmica/CurticapeanDFGL19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/CurticapeanDR19,
  author    = {Radu Curticapean and
               Holger Dell and
               Marc Roth},
  title     = {Counting Edge-injective Homomorphisms and Matchings on Restricted
               Graph Classes},
  journal   = {Theory Comput. Syst.},
  volume    = {63},
  number    = {5},
  pages     = {987--1026},
  year      = {2019},
  url       = {https://doi.org/10.1007/s00224-018-9893-y},
  doi       = {10.1007/s00224-018-9893-y},
  timestamp = {Thu, 08 Aug 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/mst/CurticapeanDR19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/BezakovaCDF19,
  author    = {Ivona Bez{\'{a}}kov{\'{a}} and
               Radu Curticapean and
               Holger Dell and
               Fedor V. Fomin},
  title     = {Finding Detours is Fixed-Parameter Tractable},
  journal   = {{SIAM} J. Discret. Math.},
  volume    = {33},
  number    = {4},
  pages     = {2326--2345},
  year      = {2019},
  url       = {https://doi.org/10.1137/17M1148566},
  doi       = {10.1137/17M1148566},
  timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/siamdm/BezakovaCDF19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DellRW19,
  author    = {Holger Dell and
               Marc Roth and
               Philip Wellnitz},
  editor    = {Christel Baier and
               Ioannis Chatzigiannakis and
               Paola Flocchini and
               Stefano Leonardi},
  title     = {Counting Answers to Existential Questions},
  booktitle = {46th International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2019, July 9-12, 2019, Patras, Greece},
  series    = {LIPIcs},
  volume    = {132},
  pages     = {113:1--113:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2019},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2019.113},
  doi       = {10.4230/LIPIcs.ICALP.2019.113},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/icalp/DellRW19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/ChenCD19,
  author    = {Hubie Chen and
               Radu Curticapean and
               Holger Dell},
  editor    = {Ignasi Sau and
               Dimitrios M. Thilikos},
  title     = {The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms},
  booktitle = {Graph-Theoretic Concepts in Computer Science - 45th International
               Workshop, {WG} 2019, Vall de N{\'{u}}ria, Spain, June 19-21,
               2019, Revised Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {11789},
  pages     = {364--378},
  publisher = {Springer},
  year      = {2019},
  url       = {https://doi.org/10.1007/978-3-030-30786-8\_28},
  doi       = {10.1007/978-3-030-30786-8\_28},
  timestamp = {Tue, 29 Dec 2020 18:38:49 +0100},
  biburl    = {https://dblp.org/rec/conf/wg/ChenCD19.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1902-04960,
  author    = {Holger Dell and
               Marc Roth and
               Philip Wellnitz},
  title     = {Counting Answers to Existential Questions},
  journal   = {CoRR},
  volume    = {abs/1902.04960},
  year      = {2019},
  url       = {http://arxiv.org/abs/1902.04960},
  eprinttype = {arXiv},
  eprint    = {1902.04960},
  timestamp = {Tue, 21 May 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1902-04960.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1907-04826,
  author    = {Holger Dell and
               John Lapinskas and
               Kitty Meeks},
  title     = {Approximately counting and sampling small witnesses using a colourful
               decision oracle},
  journal   = {CoRR},
  volume    = {abs/1907.04826},
  year      = {2019},
  url       = {http://arxiv.org/abs/1907.04826},
  eprinttype = {arXiv},
  eprint    = {1907.04826},
  timestamp = {Wed, 17 Jul 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1907-04826.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DellGR18,
  author    = {Holger Dell and
               Martin Grohe and
               Gaurav Rattan},
  editor    = {Ioannis Chatzigiannakis and
               Christos Kaklamanis and
               D{\'{a}}niel Marx and
               Donald Sannella},
  title     = {Lov{\'{a}}sz Meets Weisfeiler and Leman},
  booktitle = {45th International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
  series    = {LIPIcs},
  volume    = {107},
  pages     = {40:1--40:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2018},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2018.40},
  doi       = {10.4230/LIPIcs.ICALP.2018.40},
  timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/icalp/DellGR18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/BrandDH18,
  author    = {Cornelius Brand and
               Holger Dell and
               Thore Husfeldt},
  editor    = {Ilias Diakonikolas and
               David Kempe and
               Monika Henzinger},
  title     = {Extensor-coding},
  booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
  pages     = {151--164},
  publisher = {{ACM}},
  year      = {2018},
  url       = {https://doi.org/10.1145/3188745.3188902},
  doi       = {10.1145/3188745.3188902},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/BrandDH18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AbboudBDN18,
  author    = {Amir Abboud and
               Karl Bringmann and
               Holger Dell and
               Jesper Nederlof},
  editor    = {Ilias Diakonikolas and
               David Kempe and
               Monika Henzinger},
  title     = {More consequences of falsifying {SETH} and the orthogonal vectors
               conjecture},
  booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
  pages     = {253--266},
  publisher = {{ACM}},
  year      = {2018},
  url       = {https://doi.org/10.1145/3188745.3188938},
  doi       = {10.1145/3188745.3188938},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/AbboudBDN18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/DellL18,
  author    = {Holger Dell and
               John Lapinskas},
  editor    = {Ilias Diakonikolas and
               David Kempe and
               Monika Henzinger},
  title     = {Fine-grained reductions from approximate counting to decision},
  booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
  pages     = {281--288},
  publisher = {{ACM}},
  year      = {2018},
  url       = {https://doi.org/10.1145/3188745.3188920},
  doi       = {10.1145/3188745.3188920},
  timestamp = {Wed, 21 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/DellL18.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-08876,
  author    = {Holger Dell and
               Martin Grohe and
               Gaurav Rattan},
  title     = {Weisfeiler-Leman meets Homomorphisms},
  journal   = {CoRR},
  volume    = {abs/1802.08876},
  year      = {2018},
  url       = {http://arxiv.org/abs/1802.08876},
  eprinttype = {arXiv},
  eprint    = {1802.08876},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1802-08876.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1804-09448,
  author    = {Cornelius Brand and
               Holger Dell and
               Thore Husfeldt},
  title     = {Extensor-Coding},
  journal   = {CoRR},
  volume    = {abs/1804.09448},
  year      = {2018},
  url       = {http://arxiv.org/abs/1804.09448},
  eprinttype = {arXiv},
  eprint    = {1804.09448},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1804-09448.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1805-08554,
  author    = {Amir Abboud and
               Karl Bringmann and
               Holger Dell and
               Jesper Nederlof},
  title     = {More Consequences of Falsifying {SETH} and the Orthogonal Vectors
               Conjecture},
  journal   = {CoRR},
  volume    = {abs/1805.08554},
  year      = {2018},
  url       = {http://arxiv.org/abs/1805.08554},
  eprinttype = {arXiv},
  eprint    = {1805.08554},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1805-08554.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1812-03155,
  author    = {Holger Dell and
               D{\'{a}}niel Marx},
  title     = {Kernelization of Packing Problems},
  journal   = {CoRR},
  volume    = {abs/1812.03155},
  year      = {2018},
  url       = {http://arxiv.org/abs/1812.03155},
  eprinttype = {arXiv},
  eprint    = {1812.03155},
  timestamp = {Tue, 01 Jan 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1812-03155.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/DellKLMM17,
  author    = {Holger Dell and
               Eun Jung Kim and
               Michael Lampis and
               Valia Mitsou and
               Tobias M{\"{o}}mke},
  title     = {Complexity and Approximability of Parameterized MAX-CSPs},
  journal   = {Algorithmica},
  volume    = {79},
  number    = {1},
  pages     = {230--250},
  year      = {2017},
  url       = {https://doi.org/10.1007/s00453-017-0310-8},
  doi       = {10.1007/s00453-017-0310-8},
  timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/algorithmica/DellKLMM17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BezakovaCDF17,
  author    = {Ivona Bez{\'{a}}kov{\'{a}} and
               Radu Curticapean and
               Holger Dell and
               Fedor V. Fomin},
  editor    = {Ioannis Chatzigiannakis and
               Piotr Indyk and
               Fabian Kuhn and
               Anca Muscholl},
  title     = {Finding Detours is Fixed-Parameter Tractable},
  booktitle = {44th International Colloquium on Automata, Languages, and Programming,
               {ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
  series    = {LIPIcs},
  volume    = {80},
  pages     = {54:1--54:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2017},
  url       = {https://doi.org/10.4230/LIPIcs.ICALP.2017.54},
  doi       = {10.4230/LIPIcs.ICALP.2017.54},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/icalp/BezakovaCDF17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/CurticapeanDFGL17,
  author    = {Radu Curticapean and
               Holger Dell and
               Fedor V. Fomin and
               Leslie Ann Goldberg and
               John Lapinskas},
  editor    = {Daniel Lokshtanov and
               Naomi Nishimura},
  title     = {A Fixed-Parameter Perspective on {\#}BIS},
  booktitle = {12th International Symposium on Parameterized and Exact Computation,
               {IPEC} 2017, September 6-8, 2017, Vienna, Austria},
  series    = {LIPIcs},
  volume    = {89},
  pages     = {13:1--13:13},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2017},
  url       = {https://doi.org/10.4230/LIPIcs.IPEC.2017.13},
  doi       = {10.4230/LIPIcs.IPEC.2017.13},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/iwpec/CurticapeanDFGL17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/DellKTW17,
  author    = {Holger Dell and
               Christian Komusiewicz and
               Nimrod Talmon and
               Mathias Weller},
  editor    = {Daniel Lokshtanov and
               Naomi Nishimura},
  title     = {The {PACE} 2017 Parameterized Algorithms and Computational Experiments
               Challenge: The Second Iteration},
  booktitle = {12th International Symposium on Parameterized and Exact Computation,
               {IPEC} 2017, September 6-8, 2017, Vienna, Austria},
  series    = {LIPIcs},
  volume    = {89},
  pages     = {30:1--30:12},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2017},
  url       = {https://doi.org/10.4230/LIPIcs.IPEC.2017.30},
  doi       = {10.4230/LIPIcs.IPEC.2017.30},
  timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/conf/iwpec/DellKTW17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/CurticapeanDR17,
  author    = {Radu Curticapean and
               Holger Dell and
               Marc Roth},
  editor    = {Heribert Vollmer and
               Brigitte Vall{\'{e}}e},
  title     = {Counting Edge-Injective Homomorphisms and Matchings on Restricted
               Graph Classes},
  booktitle = {34th Symposium on Theoretical Aspects of Computer Science, {STACS}
               2017, March 8-11, 2017, Hannover, Germany},
  series    = {LIPIcs},
  volume    = {66},
  pages     = {25:1--25:15},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2017},
  url       = {https://doi.org/10.4230/LIPIcs.STACS.2017.25},
  doi       = {10.4230/LIPIcs.STACS.2017.25},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/stacs/CurticapeanDR17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/CurticapeanDM17,
  author    = {Radu Curticapean and
               Holger Dell and
               D{\'{a}}niel Marx},
  editor    = {Hamed Hatami and
               Pierre McKenzie and
               Valerie King},
  title     = {Homomorphisms are a good basis for counting small subgraphs},
  booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  pages     = {210--223},
  publisher = {{ACM}},
  year      = {2017},
  url       = {https://doi.org/10.1145/3055399.3055502},
  doi       = {10.1145/3055399.3055502},
  timestamp = {Sun, 02 Jun 2019 21:10:31 +0200},
  biburl    = {https://dblp.org/rec/conf/stoc/CurticapeanDM17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CurticapeanDR17,
  author    = {Radu Curticapean and
               Holger Dell and
               Marc Roth},
  title     = {Counting edge-injective homomorphisms and matchings on restricted
               graph classes},
  journal   = {CoRR},
  volume    = {abs/1702.05447},
  year      = {2017},
  url       = {http://arxiv.org/abs/1702.05447},
  eprinttype = {arXiv},
  eprint    = {1702.05447},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/CurticapeanDR17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CurticapeanDFGL17,
  author    = {Radu Curticapean and
               Holger Dell and
               Fedor V. Fomin and
               Leslie Ann Goldberg and
               John Lapinskas},
  title     = {A Fixed-Parameter Perspective on {\#}BIS},
  journal   = {CoRR},
  volume    = {abs/1702.05543},
  year      = {2017},
  url       = {http://arxiv.org/abs/1702.05543},
  eprinttype = {arXiv},
  eprint    = {1702.05543},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/CurticapeanDFGL17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/CurticapeanDM17,
  author    = {Radu Curticapean and
               Holger Dell and
               D{\'{a}}niel Marx},
  title     = {Homomorphisms Are a Good Basis for Counting Small Subgraphs},
  journal   = {CoRR},
  volume    = {abs/1705.01595},
  year      = {2017},
  url       = {http://arxiv.org/abs/1705.01595},
  eprinttype = {arXiv},
  eprint    = {1705.01595},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/CurticapeanDM17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/DellL17,
  author    = {Holger Dell and
               John Lapinskas},
  title     = {Fine-grained reductions from approximate counting to decision},
  journal   = {CoRR},
  volume    = {abs/1707.04609},
  year      = {2017},
  url       = {http://arxiv.org/abs/1707.04609},
  eprinttype = {arXiv},
  eprint    = {1707.04609},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/DellL17.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1710-01712,
  author    = {Holger Dell},
  title     = {Note on "The Complexity of Counting Surjective Homomorphisms
               and Compactions"},
  journal   = {CoRR},
  volume    = {abs/1710.01712},
  year      = {2017},
  url       = {http://arxiv.org/abs/1710.01712},
  eprinttype = {arXiv},
  eprint    = {1710.01712},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1710-01712.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/Dell16,
  author    = {Holger Dell},
  title     = {AND-Compression of NP-Complete Problems: Streamlined Proof and Minor
               Observations},
  journal   = {Algorithmica},
  volume    = {75},
  number    = {2},
  pages     = {403--423},
  year      = {2016},
  url       = {https://doi.org/10.1007/s00453-015-0110-y},
  doi       = {10.1007/s00453-015-0110-y},
  timestamp = {Wed, 26 Jul 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/algorithmica/Dell16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/talg/CyganDLMNOPSW16,
  author    = {Marek Cygan and
               Holger Dell and
               Daniel Lokshtanov and
               D{\'{a}}niel Marx and
               Jesper Nederlof and
               Yoshio Okamoto and
               Ramamohan Paturi and
               Saket Saurabh and
               Magnus Wahlstr{\"{o}}m},
  title     = {On Problems as Hard as {CNF-SAT}},
  journal   = {{ACM} Trans. Algorithms},
  volume    = {12},
  number    = {3},
  pages     = {41:1--41:24},
  year      = {2016},
  url       = {https://doi.org/10.1145/2925416},
  doi       = {10.1145/2925416},
  timestamp = {Sat, 19 Oct 2019 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/talg/CyganDLMNOPSW16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BrandDR16,
  author    = {Cornelius Brand and
               Holger Dell and
               Marc Roth},
  editor    = {Jiong Guo and
               Danny Hermelin},
  title     = {Fine-Grained Dichotomies for the Tutte Plane and Boolean {\#}CSP},
  booktitle = {11th International Symposium on Parameterized and Exact Computation,
               {IPEC} 2016, August 24-26, 2016, Aarhus, Denmark},
  series    = {LIPIcs},
  volume    = {63},
  pages     = {9:1--9:14},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2016},
  url       = {https://doi.org/10.4230/LIPIcs.IPEC.2016.9},
  doi       = {10.4230/LIPIcs.IPEC.2016.9},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/iwpec/BrandDR16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/DellHJKKR16,
  author    = {Holger Dell and
               Thore Husfeldt and
               Bart M. P. Jansen and
               Petteri Kaski and
               Christian Komusiewicz and
               Frances A. Rosamond},
  editor    = {Jiong Guo and
               Danny Hermelin},
  title     = {The First Parameterized Algorithms and Computational Experiments Challenge},
  booktitle = {11th International Symposium on Parameterized and Exact Computation,
               {IPEC} 2016, August 24-26, 2016, Aarhus, Denmark},
  series    = {LIPIcs},
  volume    = {63},
  pages     = {30:1--30:9},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2016},
  url       = {https://doi.org/10.4230/LIPIcs.IPEC.2016.30},
  doi       = {10.4230/LIPIcs.IPEC.2016.30},
  timestamp = {Fri, 30 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/iwpec/DellHJKKR16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BrandDR16,
  author    = {Cornelius Brand and
               Holger Dell and
               Marc Roth},
  title     = {Fine-grained dichotomies for the Tutte plane and Boolean {\#}CSP},
  journal   = {CoRR},
  volume    = {abs/1606.06581},
  year      = {2016},
  url       = {http://arxiv.org/abs/1606.06581},
  eprinttype = {arXiv},
  eprint    = {1606.06581},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/BrandDR16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BezakovaCDF16,
  author    = {Ivona Bez{\'{a}}kov{\'{a}} and
               Radu Curticapean and
               Holger Dell and
               Fedor V. Fomin},
  title     = {Finding Detours is Fixed-parameter Tractable},
  journal   = {CoRR},
  volume    = {abs/1607.07737},
  year      = {2016},
  url       = {http://arxiv.org/abs/1607.07737},
  eprinttype = {arXiv},
  eprint    = {1607.07737},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/BezakovaCDF16.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BjorklundDH15,
  author    = {Andreas Bj{\"{o}}rklund and
               Holger Dell and
               Thore Husfeldt},
  editor    = {Magn{\'{u}}s M. Halld{\'{o}}rsson and
               Kazuo Iwama and
               Naoki Kobayashi and
               Bettina Speckmann},
  title     = {The Parity of Set Systems Under Random Restrictions with Applications
               to Exponential Time Problems},
  booktitle = {Automata, Languages, and Programming - 42nd International Colloquium,
               {ICALP} 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {9134},
  pages     = {231--242},
  publisher = {Springer},
  year      = {2015},
  url       = {https://doi.org/10.1007/978-3-662-47672-7\_19},
  doi       = {10.1007/978-3-662-47672-7\_19},
  timestamp = {Fri, 27 Mar 2020 09:02:59 +0100},
  biburl    = {https://dblp.org/rec/conf/icalp/BjorklundDH15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/Dell0LMM15,
  author    = {Holger Dell and
               Eun Jung Kim and
               Michael Lampis and
               Valia Mitsou and
               Tobias M{\"{o}}mke},
  editor    = {Thore Husfeldt and
               Iyad A. Kanj},
  title     = {Complexity and Approximability of Parameterized MAX-CSPs},
  booktitle = {10th International Symposium on Parameterized and Exact Computation,
               {IPEC} 2015, September 16-18, 2015, Patras, Greece},
  series    = {LIPIcs},
  volume    = {43},
  pages     = {294--306},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year      = {2015},
  url       = {https://doi.org/10.4230/LIPIcs.IPEC.2015.294},
  doi       = {10.4230/LIPIcs.IPEC.2015.294},
  timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
  biburl    = {https://dblp.org/rec/conf/iwpec/Dell0LMM15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Dell0LMM15,
  author    = {Holger Dell and
               Eun Jung Kim and
               Michael Lampis and
               Valia Mitsou and
               Tobias M{\"{o}}mke},
  title     = {Complexity and Approximability of Parameterized MAX-CSPs},
  journal   = {CoRR},
  volume    = {abs/1511.05546},
  year      = {2015},
  url       = {http://arxiv.org/abs/1511.05546},
  eprinttype = {arXiv},
  eprint    = {1511.05546},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/Dell0LMM15.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/DellM14,
  author    = {Holger Dell and
               Dieter van Melkebeek},
  title     = {Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time
               Hierarchy Collapses},
  journal   = {J. {ACM}},
  volume    = {61},
  number    = {4},
  pages     = {23:1--23:27},
  year      = {2014},
  url       = {https://doi.org/10.1145/2629620},
  doi       = {10.1145/2629620},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/jacm/DellM14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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}
}
@inproceedings{DBLP:conf/iwpec/Dell14,
  author    = {Holger Dell},
  editor    = {Marek Cygan and
               Pinar Heggernes},
  title     = {AND-compression of NP-complete Problems: Streamlined Proof and Minor
               Observations},
  booktitle = {Parameterized and Exact Computation - 9th International Symposium,
               {IPEC} 2014, Wroclaw, Poland, September 10-12, 2014. Revised Selected
               Papers},
  series    = {Lecture Notes in Computer Science},
  volume    = {8894},
  pages     = {184--195},
  publisher = {Springer},
  year      = {2014},
  url       = {https://doi.org/10.1007/978-3-319-13524-3\_16},
  doi       = {10.1007/978-3-319-13524-3\_16},
  timestamp = {Sat, 19 Oct 2019 20:25:35 +0200},
  biburl    = {https://dblp.org/rec/conf/iwpec/Dell14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Dell14,
  author    = {Holger Dell},
  title     = {A simple proof that AND-compression of NP-complete problems is hard},
  journal   = {CoRR},
  volume    = {abs/1405.4472},
  year      = {2014},
  url       = {http://arxiv.org/abs/1405.4472},
  eprinttype = {arXiv},
  eprint    = {1405.4472},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/Dell14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Dell14,
  author    = {Holger Dell},
  title     = {A simple proof that AND-compression of NP-complete problems is hard},
  journal   = {Electron. Colloquium Comput. Complex.},
  pages     = {75},
  year      = {2014},
  url       = {https://eccc.weizmann.ac.il/report/2014/075},
  timestamp = {Mon, 30 Aug 2021 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/eccc/Dell14.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/DellKMW13,
  author    = {Holger Dell and
               Valentine Kabanets and
               Dieter van Melkebeek and
               Osamu Watanabe},
  title     = {Is Valiant-Vazirani's isolation probability improvable?},
  journal   = {Comput. Complex.},
  volume    = {22},
  number    = {2},
  pages     = {345--383},
  year      = {2013},
  url       = {https://doi.org/10.1007/s00037-013-0059-7},
  doi       = {10.1007/s00037-013-0059-7},
  timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/cc/DellKMW13.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/BlaserDF12,
  author    = {Markus Bl{\"{a}}ser and
               Holger Dell and
               Mahmoud Fouz},
  title     = {Complexity and Approximability of the Cover Polynomial},
  journal   = {Comput. Complex.},
  volume    = {21},
  number    = {3},
  pages     = {359--419},
  year      = {2012},
  url       = {https://doi.org/10.1007/s00037-011-0018-0},
  doi       = {10.1007/s00037-011-0018-0},
  timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/journals/cc/BlaserDF12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/DellKMW12,
  author    = {Holger Dell and
               Valentine Kabanets and
               Dieter van Melkebeek and
               Osamu Watanabe},
  title     = {Is Valiant-Vazirani's Isolation Probability Improvable?},
  booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
               2012, Porto, Portugal, June 26-29, 2012},
  pages     = {10--20},
  publisher = {{IEEE} Computer Society},
  year      = {2012},
  url       = {https://doi.org/10.1109/CCC.2012.22},
  doi       = {10.1109/CCC.2012.22},
  timestamp = {Tue, 21 Jul 2020 19:04:52 +0200},
  biburl    = {https://dblp.org/rec/conf/coco/DellKMW12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/CyganDLMNOPSW12,
  author    = {Marek Cygan and
               Holger Dell and
               Daniel Lokshtanov and
               D{\'{a}}niel Marx and
               Jesper Nederlof and
               Yoshio Okamoto and
               Ramamohan Paturi and
               Saket Saurabh and
               Magnus Wahlstr{\"{o}}m},
  title     = {On Problems as Hard as {CNF-SAT}},
  booktitle = {Proceedings of the 27th Conference on Computational Complexity, {CCC}
               2012, Porto, Portugal, June 26-29, 2012},
  pages     = {74--84},
  publisher = {{IEEE} Computer Society},
  year      = {2012},
  url       = {https://doi.org/10.1109/CCC.2012.36},
  doi       = {10.1109/CCC.2012.36},
  timestamp = {Fri, 20 Dec 2019 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/coco/CyganDLMNOPSW12.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/DellM12,
  author    = {Holger Dell and
               D{\'{a}}niel Marx},
  editor    = {Yuval Rabani},
  title     = {Kernelization of packing problems},
  booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
               Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
  pages     = {68--81},
  publisher = {{SIAM}},
  year      = {2012},
  url       = {https://doi.org/10.1137/1.9781611973099.6},
  doi       = {10.1137/1.9781611973099.6},
  timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
  biburl    = {https://dblp.org/rec/conf/soda/DellM12.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}
}
@phdthesis{DBLP:phd/de/Dell2011,
  author    = {Holger Dell},
  title     = {Sparse instances of hard problems},
  school    = {Humboldt University of Berlin},
  year      = {2011},
  url       = {http://edoc.hu-berlin.de/dissertationen/dell-holger-2011-07-15/PDF/dell.pdf},
  urn       = {urn:nbn:de:kobv:11-100192642},
  timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/phd/de/Dell2011.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-2275,
  author    = {Marek Cygan and
               Holger Dell and
               Daniel Lokshtanov and
               D{\'{a}}niel Marx and
               Jesper Nederlof and
               Yoshio Okamoto and
               Ramamohan Paturi and
               Saket Saurabh and
               Magnus Wahlstr{\"{o}}m},
  title     = {On Problems as Hard as {CNFSAT}},
  journal   = {CoRR},
  volume    = {abs/1112.2275},
  year      = {2011},
  url       = {http://arxiv.org/abs/1112.2275},
  eprinttype = {arXiv},
  eprint    = {1112.2275},
  timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/corr/abs-1112-2275.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/BlaserDM10,
  author    = {Markus Bl{\"{a}}ser and
               Holger Dell and
               Johann A. Makowsky},
  title     = {Complexity of the Bollob{\'{a}}s-Riordan Polynomial. Exceptional
               Points and Uniform Reductions},
  journal   = {Theory Comput. Syst.},
  volume    = {46},
  number    = {4},
  pages     = {690--706},
  year      = {2010},
  url       = {https://doi.org/10.1007/s00224-009-9213-7},
  doi       = {10.1007/s00224-009-9213-7},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/mst/BlaserDM10.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}
}
@inproceedings{DBLP:conf/stoc/DellM10,
  author    = {Holger Dell and
               Dieter van Melkebeek},
  editor    = {Leonard J. Schulman},
  title     = {Satisfiability allows no nontrivial sparsification unless the polynomial-time
               hierarchy collapses},
  booktitle = {Proceedings of the 42nd {ACM} Symposium on Theory of Computing, {STOC}
               2010, Cambridge, Massachusetts, USA, 5-8 June 2010},
  pages     = {251--260},
  publisher = {{ACM}},
  year      = {2010},
  url       = {https://doi.org/10.1145/1806689.1806725},
  doi       = {10.1145/1806689.1806725},
  timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl    = {https://dblp.org/rec/conf/stoc/DellM10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MelkebeekD10,
  author    = {Dieter van Melkebeek and
               Holger Dell},
  title     = {Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time
               Hierarchy Collapses},
  journal   = {Electron. Colloquium Comput. Complex.},
  pages     = {38},
  year      = {2010},
  url       = {https://eccc.weizmann.ac.il/report/2010/038},
  timestamp = {Mon, 30 Aug 2021 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/eccc/MelkebeekD10.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.},
  pages     = {78},
  year      = {2010},
  url       = {https://eccc.weizmann.ac.il/report/2010/078},
  timestamp = {Mon, 30 Aug 2021 01:00:00 +0200},
  biburl    = {https://dblp.org/rec/journals/eccc/DellHW10.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/DellM09,
  author    = {Holger Dell and
               Dieter van Melkebeek},
  editor    = {Erik D. Demaine and
               MohammadTaghi Hajiaghayi and
               D{\'{a}}niel Marx},
  title     = {Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time
               Hierarchy Collapses},
  booktitle = {Parameterized complexity and approximation algorithms, 13.12. - 17.12.2009},
  series    = {Dagstuhl Seminar Proceedings},
  volume    = {09511},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
  year      = {2009},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2010/2504/},
  timestamp = {Thu, 10 Jun 2021 13:02:08 +0200},
  biburl    = {https://dblp.org/rec/conf/dagstuhl/DellM09.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/BlaserDM08,
  author    = {Markus Bl{\"{a}}ser and
               Holger Dell and
               Johann A. Makowsky},
  editor    = {Edward A. Hirsch and
               Alexander A. Razborov and
               Alexei L. Semenov and
               Anatol Slissenko},
  title     = {Complexity of the Bollob{\'{a}}s-Riordan Polynomial},
  booktitle = {Computer Science - Theory and Applications, Third International Computer
               Science Symposium in Russia, {CSR} 2008, Moscow, Russia, June 7-12,
               2008, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5010},
  pages     = {86--98},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-79709-8\_12},
  doi       = {10.1007/978-3-540-79709-8\_12},
  timestamp = {Tue, 14 May 2019 10:00:51 +0200},
  biburl    = {https://dblp.org/rec/conf/csr/BlaserDM08.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/BlaserD07,
  author    = {Markus Bl{\"{a}}ser and
               Holger Dell},
  editor    = {Lars Arge and
               Christian Cachin and
               Tomasz Jurdzinski and
               Andrzej Tarlecki},
  title     = {Complexity of the Cover Polynomial},
  booktitle = {Automata, Languages and Programming, 34th International Colloquium,
               {ICALP} 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4596},
  pages     = {801--812},
  publisher = {Springer},
  year      = {2007},
  url       = {https://doi.org/10.1007/978-3-540-73420-8\_69},
  doi       = {10.1007/978-3-540-73420-8\_69},
  timestamp = {Tue, 14 May 2019 10:00:44 +0200},
  biburl    = {https://dblp.org/rec/conf/icalp/BlaserD07.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics