Eva-Marta Lundell

Proceedings of the Combinatorial Pattern Matching - 26th Annual Symposium, 2015

2013

Counting and Detecting Small Subgraphs via Equations.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

Unique subgraphs are not easier to find.

[BibT_eX]

[DOI]

Int. J. Comput. Math., 2013

2011

Counting and detecting small subgraphs via equations and matrix multiplication.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, 2011

Unique Small Subgraphs Are Not Easier to Find.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2011

2009

Exact and approximation algorithms for graph problems with some biological applications.

[BibT_eX]

[DOI]

PhD thesis, 2009

Efficient approximation algorithms for shortest cycles in undirected graphs.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2009

2007

On the Approximability of Maximum and Minimum Edge Clique Partition Problems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2007

Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.

[BibT_eX]

[DOI]

Algorithmica, 2007

2004

Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices.

[BibT_eX]

[DOI]

Anders Dessmark