Nina Taslaman

According to our database, Nina Taslaman authored at least 4 papers between 2008 and 2014.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2014

Exponential Time Complexity of the Permanent and the Tutte Polynomial.

Holger Dell, Thore Husfeldt, Dániel Marx, Nina Taslaman, Martin Wahlen

ACM Trans. Algorithms, 2014

2012

Shortest cycle through specified elements.

Andreas Björklund, Thore Husfeldt, Nina Taslaman

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms, 2012

2010

The Exponential Time Complexity of Computing the Probability That a Graph Is Connected.

Thore Husfeldt, Nina Taslaman

Proceedings of the Parameterized and Exact Computation - 5th International Symposium, 2010

2008

Private Key Extension of Polly Cracker Cryptosystems.

Nina Taslaman

Comput. Sci. J. Moldova, 2008