Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices. - Anders Dessmark; Andrzej Lingas; Eva-Marta Lundell (SWAT, 2004)

Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. - Anders Dessmark; Jesper Jansson 001; Andrzej Lingas; Eva-Marta Lundell (Algorithmica, 2007)

On the Approximability of Maximum and Minimum Edge Clique Partition Problems. - Anders Dessmark; Jesper Jansson 001; Andrzej Lingas; Eva-Marta Lundell; Mia Persson (Int. J. Found. Comput. Sci., 2007)

Efficient approximation algorithms for shortest cycles in undirected graphs. - Andrzej Lingas; Eva-Marta Lundell (Inf. Process. Lett., 2009)

Exact and approximation algorithms for graph problems with some biological applications. - Eva-Marta Lundell (2009)

Unique Small Subgraphs Are Not Easier to Find. - Miroslaw Kowaluk; Andrzej Lingas; Eva-Marta Lundell (LATA, 2011)

Counting and detecting small subgraphs via equations and matrix multiplication. - Miroslaw Kowaluk; Andrzej Lingas; Eva-Marta Lundell (SODA, 2011)

Unique subgraphs are not easier to find. - Miroslaw Kowaluk; Andrzej Lingas; Eva-Marta Lundell (Int. J. Comput. Math., 2013)

Counting and Detecting Small Subgraphs via Equations. - Miroslaw Kowaluk; Andrzej Lingas; Eva-Marta Lundell (SIAM J. Discret. Math., 2013)

The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets. - Jesper Jansson 001; Andrzej Lingas; Eva-Marta Lundell (CPM, 2015)

Detecting and Counting Small Pattern Graphs. - Peter Floderus; Miroslaw Kowaluk; Andrzej Lingas; Eva-Marta Lundell (SIAM J. Discret. Math., 2015)

Induced subgraph isomorphism: Are some patterns substantially easier than others? - Peter Floderus; Miroslaw Kowaluk; Andrzej Lingas; Eva-Marta Lundell (Theor. Comput. Sci., 2015)

The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets. - Katharina Dannenberg; Jesper Jansson 001; Andrzej Lingas; Eva-Marta Lundell (Discret. Appl. Math., 2019)