Eva-Marta Lundell

Lund University — Sweden

Computer Science · Physical Sciences

7h-index166citations16works0.02yr avg
OpenAlex↗Google Scholar↗Lab page↗

Accepting Students?

No reports yet. Know if this professor is taking students?

Research Topics

Advanced Graph Theory Research(13), Complexity and Algorithms in Graphs(11), Optimization and Search Problems(6), Graph theory and applications(3), Graph Labeling and Dimension Problems(2)

Publications16 total

Induced subgraph isomorphism: Are some patterns substantially easier than others?
Theoretical Computer Science·2015· 21 cited
Detecting and Counting Small Pattern Graphs
SIAM Journal on Discrete Mathematics·2015· 17 cited
The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets
Lecture notes in computer science·2015· 2 cited
Detecting and Counting Small Pattern Graphs
Lecture notes in computer science·2013· 7 cited
Counting and Detecting Small Subgraphs via Equations
SIAM Journal on Discrete Mathematics·2013· 42 cited
Unique subgraphs are not easier to find
International Journal of Computer Mathematics·2012· 2 cited
Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?
Lecture notes in computer science·2012· 8 cited
Counting and detecting small subgraphs via equations and matrix multiplication
2011· 13 citedOpen Access
Counting and detecting small subgraphs via equations and matrix multiplication
Symposium on Discrete Algorithms·2011· 25 cited
Unique Small Subgraphs Are Not Easier to Find
Lecture notes in computer science·2011· 2 cited
Efficient approximation algorithms for shortest cycles in undirected graphs
Information Processing Letters·2009· 21 cited
Exact and approximation algorithms for graph problems with some biological applications
Lund University Publications (Lund University)·2009
Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs
Lecture notes in computer science·2008· 3 cited
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem
Algorithmica·2007· 1 cited
ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS
International Journal of Foundations of Computer Science·2007· 1 cited
Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices
Lecture notes in computer science·2004· 1 cited

Frequent Co-authors

Andrzej Lingas(15), Mirosław Kowaluk(9), Peter Floderus(4), Jesper Jansson(3), Anders Dessmark(3), Mia Persson(1)