ITU
Radu-Cristian Curticapean

Radu-Cristian Curticapean

Assistant Professor

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

Building: 4B07

Information Desk: 72185000

View graph of relations

  1. 2019
  2. 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 JournalJournal articleResearchpeer-review

  3. Published

    Parameterized Streaming Algorithms for Min-Ones d-SAT

    Agrawal, A., Biswas, A., Bonnet, É., Brettell, N., Curticapean, R-C., Marx, D., Miltzow, T., Raman, V. & Saurabh, S., 2019, 39th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2019). Dagstuhl, Germany: Schloss Dagstuhl--Leibniz-Zentrum für Informatik, p. 8:1-8:20 20 p. (Leibniz International Proceedings in Informatics (LIPIcs)).

    Research output: Conference Article in Proceeding or Book/Report chapterArticle in proceedingsResearchpeer-review

  4. 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 chapterArticle in proceedingsResearchpeer-review

  5. 2018
  6. Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes

    Curticapean, R-C., Dell, H. & Roth, M., 31 Oct 2018, In: Theory of Computing Systems. p. 1-40 40 p.

    Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review

  7. Block interpolation: A framework for tight exponential-time counting complexity

    Curticapean, R-C., Aug 2018, In: Information and Computation. 261, p. 265 280 p.

    Research output: Journal Article or Conference Article in JournalJournal articleResearchpeer-review

ID: 82532457