Eva-Marta Lundell

Available identifiers

Publication	Date of Publication	Type
The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets	2019-03-11	Paper
https://portal.mardi4nfdi.de/entity/Q5365132	2017-09-29	Paper
Induced subgraph isomorphism: are some patterns substantially easier than others?	2015-10-30	Paper
The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets	2015-08-20	Paper
Detecting and Counting Small Pattern Graphs	2015-08-17	Paper
Detecting and Counting Small Pattern Graphs	2014-01-14	Paper
Unique subgraphs are not easier to find	2013-10-22	Paper
Counting and detecting small subgraphs via equations	2013-09-26	Paper
Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?	2012-09-25	Paper
Unique small subgraphs are not easier to find	2011-06-03	Paper
Efficient approximation algorithms for shortest cycles in undirected graphs	2010-08-16	Paper
Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs	2008-04-15	Paper
Polynomial-time algorithms for the ordered maximum agreement subtree problem	2007-08-20	Paper
ON THE APPROXIMABILITY OF MAXIMUM AND MINIMUM EDGE CLIQUE PARTITION PROBLEMS	2007-04-25	Paper
Combinatorial Pattern Matching	2005-09-07	Paper
Algorithm Theory - SWAT 2004	2005-09-07	Paper

This page was built for person: Eva-Marta Lundell