ITU
Holger Dell

Holger Dell

Associate Professor

IT University of Copenhagen
Rued Langgaards Vej 7
DK-2300 Copenhagen S
Denmark

Information Desk: 72185000

View graph of relations

1 - 7 out of 7Page size: 50
  1. 2021
  2. Published

    Fine-Grained Reductions from Approximate Counting to Decision

    Dell, H. & Lapinskas, J., 2021, In: ACM Transactions on Computation Theory. 13, 2, p. 1-24 8.

    Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

  3. Published

    Modular Counting of Subgraphs: Matchings, Matching-Splittable Graphs, and Paths

    Curticapean, R-C., Dell, H. & Husfeldt, T., 2021, Proceedings of the 29th Annual European Symposium on Algorithms. Schloss Dagstuhl--Leibniz-Zentrum für Informatik, Vol. 204. 17 p. 34

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

  4. 2020
  5. Published

    Approximately counting and sampling small witnesses using a colourful decision oracle

    Dell, H., Lapinskas, J. & Meeks, K., 2020, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms. Chawla, S. (ed.). Society for Industrial and Applied Mathematics, p. 2201-2211 11 p.

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

  6. 2019
  7. Published

    A Fixed-Parameter Perspective on #BIS

    Curticapean, R-C., Dell, H., Fomin, F., Goldberg, L. A. & Lapinskas, J., 18 Jul 2019, In: Algorithmica. 81, 10, p. 3844–3864

    Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

  8. Counting Answers to Existential Questions

    Dell, H., Roth, M. & Wellnitz, P., 2019, International Colloquium on Automata, Languages, and Programming (ICALP 2019). Dagstuhl Publishing, Germany

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

  9. Fine-Grained Dichotomies for the Tutte Plane and Boolean #CSP

    Brand, C., Dell, H. & Roth, M., 2019, In: Algorithmica. 81, p. 541-556 2.

    Research output: Journal Article or Conference Article in Journal › Journal article › Research › peer-review

  10. Published

    The Exponential-Time Complexity of Counting (Quantum) Graph Homomorphisms

    Chen, H., Curticapean, R-C. & Dell, H., 2019, Graph-Theoretic Concepts in Computer Science: 45th International Workshop, WG 2019, Vall de Núria, Spain, June 19–21, 2019, Revised Papers. Springer, p. 364-378 (Lecture Notes in Computer Science, Vol. 11789).

    Research output: Conference Article in Proceeding or Book/Report chapter › Article in proceedings › Research › peer-review

ID: 84173193