ITU
Nina Sofia  Taslaman

Nina Sofia Taslaman

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

Information Desk: 72185000

View graph of relations

  1. Journal article › Research › Peer-reviewed
  2. Published

    Exponential Time Complexity of the Permanent and the Tutte Polynomial

    Dell, H., Husfeldt, T., Marx, D., Taslaman, N. S. & Wahlén, M., 2014, In: A C M Transactions on Algorithms. 10, 4, p. 21:1-21:32 32 p., 21.

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

  3. Ph.D. thesis › Research
  4. Published

    Exponential-Time Algorithms and Complexity of NP-Hard Graph Problems

    Taslaman, N. S., 2013, IT-Universitetet i København. 95 p. (ITU-DS; No. 83).

    Research output: Book / Anthology / Report / Ph.D. thesisPh.D. thesisResearch

  5. Article in proceedings › Research › Peer-reviewed
  6. Published

    The exponential time complexity of computing the probability that a graph is connected

    Husfeldt, T. & Taslaman, N. S., 2010, 5th International Symposium on Parameterized and Exact Computation (IPEC 2010), December 13–15, 2010, Chennai, India. Springer, (Lecture Notes in Computer Science).

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

ID: 1012044