Eva-Marta Lundell

Publication Activity (10 Years)

Years Active: 2004-2019
Publications (10 Years): 4

Top Venues

SIAM J. Discret. Math.

COCOON

Discret. Appl. Math.

CPM

Lund University, Sweden (PHD)

Education History

Lund University, Sweden

PHD

Publications

Katharina Dannenberg, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets. Discret. Appl. Math. 257 (2019)
Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
Detecting and Counting Small Pattern Graphs. SIAM J. Discret. Math. 29 (3) (2015)
Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets. CPM (2015)
Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
Induced subgraph isomorphism: Are some patterns substantially easier than others? Theor. Comput. Sci. 605 (2015)
Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
Detecting and Counting Small Pattern Graphs. ISAAC (2013)
Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
Unique subgraphs are not easier to find. Int. J. Comput. Math. 90 (6) (2013)
Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
Counting and Detecting Small Subgraphs via Equations. SIAM J. Discret. Math. 27 (2) (2013)
Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? COCOON (2012)
Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
Unique Small Subgraphs Are Not Easier to Find. LATA (2011)
Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
Counting and detecting small subgraphs via equations and matrix multiplication. SODA (2011)
Andrzej Lingas, Eva-Marta Lundell
Efficient approximation algorithms for shortest cycles in undirected graphs. Inf. Process. Lett. 109 (10) (2009)
Andrzej Lingas, Eva-Marta Lundell
Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs. LATIN (2008)
Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. Algorithmica 48 (3) (2007)
Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson
On the Approximability of Maximum and Minimum Edge Clique Partition Problems. Int. J. Found. Comput. Sci. 18 (2) (2007)
Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson
On the Approximability of Maximum and Minimum Edge Clique Partition Problems. CATS (2006)
Anders Dessmark, Andrzej Lingas, Eva-Marta Lundell
Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices. SWAT (2004)
Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. CPM (2004)

Eva-Marta Lundell.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Eva-Marta Lundell