Eva-Marta Lundell

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