My main interest is graph algorithms, computational biology and bioinformatics.

• P. Floderus, M. Kowaluk, A. Lingas and E.-M. Lundell
  "Induced subgraph isomorphism: Are some patterns substantially easier than others?",
  accepted to 18th Annual International Computing and Combinatorics Conference (Cocoon 2012)

• M. Kowaluk, A. Lingas and E.-M. Lundell
  "Unique Small Subgraphs Are Not Easier to Find",
  in proc. 5th International Conference on Language and Automata Theory and Applications (LATA 2011), LNCS 6638, Springer 2011, pp. 336-341

• M. Kowaluk, A. Lingas and E.-M. Lundell
  "Counting and detecting small subgraphs via equations and matrix multiplication",
  in proc. 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2011), SIAM 2011, pp. 1468-1476

• A. Lingas, E.-M. Lundell
  "Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs",
  Information Processing Letters , 109(10), 2009, pp. 493-498

• A. Lingas, E.-M. Lundell
  "Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs",
  in proc. 8th Latin American Symposium on Theoretical Informatics (LATIN 2008), LNCS 4957, Springer 2008, pp. 736-746

• A. Dessmark, J. Jansson, A. Lingas, E.-M. Lundell, M. Persson
  "On the Approximability of Maximum and Minimum Edge Clique Partition Problems", Int. J. Found. Comput. Sci. 18(2), 2007, pp. 217-226

• A. Dessmark, J. Jansson, A. Lingas, E.M. Lundell
  "Polynomial-time algorithms for the ordered maximum agreement subtree problem",
  Algorithmica 48(3), 2007, pp. 233-248

• A. Dessmark, J. Jansson, A. Lingas, E.-M. Lundell, M. Persson
  "On the approximability of maximum and minimum edge clique partition problems",
  in proc. 12th Australasian Theory Symposium (CATS 2006), pp. 101-105

• A. Dessmark, A. Lingas, E.M. Lundell,
  "Subexponential-time framework for optimal embeddings of graphs in integer lattices",
  in proc. 9th Scandinavian Workshop on Algorithm Theory (SWAT 2004), LNCS 3111, Springer 2004, pp. 248-259

• A. Dessmark, J. Jansson, A. Lingas, E.M. Lundell
  "Polynomial-time algorithms for the ordered maximum agreement subtree problem",
  in proc. 15th Annual Combinatorial Pattern Matching Symposium (CPM 2004), LNCS 3109, Springer 2004, pp. 220-229

• J. Jansson, A. Lingas, E.M. Lundell,
  "A triplet approach to approximations of evolutionary trees",
  poster at RECOMB 2004

• E.M. Lundell,
  "Exact and approximation algorithms for graph problems with some biological applications",
  Ph.D. thesis in Computer Science, Department of Computer Science, Lund University, Sweden, 2009.

• E.M. Lundell,
  "On the use of Kolmogorov complexity in computational complexity",
  Master's thesis in Computer Science, Department of Computer Science, Lund University, Sweden, 2002.

2007: DAT124 Computational Biology

(exercises and lecture notes)

2006: DAT124 Computational Biology

2004: DAT501 (TA), DAT312 (TA), DAT124 Computational Biology

2004: DAT124 Computational Biology

2004: DAT501 (TA), DAT312 (TA)

2003: DAT501 (TA)

2002: DAT501 (TA), DAT124 Computational Biology

M.Sc. in Computer Science, Lund University, 2001.

Ph.D. in Computer Science, Lund University, 2009.

Member of the Organizing Committee of the 5th Annual Swedish Bioinformatics Workshop, November 2004

ADDRESS