( en | de | ru )

 

Disambiguation of "Lundell, Eva-Marta"

Author of the publication

copydeleteadd this publication to your clipboard
On the Approximability of Maximum and Minimum Edge Clique Partition Problems.

, , , , and . Int. J. Found. Comput. Sci., 18 (2): 217-226 (2007)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Björn Lundell

Eva Marta Hardy

Fares Martak

Martarizal

Hans Martan

 

Other publications of authors with the same name

Detecting and Counting Small Pattern Graphs., , , and . ISAAC, volume 8283 of Lecture Notes in Computer Science, page 547-557. Springer, (2013)Exact and approximation algorithms for graph problems with some biological applications.. Lund University, Sweden, (2009)base-search.net (ftulundlup:oai:lup.lub.lu.se:3ac9524a-89fc-40bc-9b39-5b50884d3287).Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others?, , , and . COCOON, volume 7434 of Lecture Notes in Computer Science, page 37-48. Springer, (2012)The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets., , and . CPM, volume 9133 of Lecture Notes in Computer Science, page 272-283. Springer, (2015)Counting and Detecting Small Subgraphs via Equations., , and . SIAM J. Discret. Math., 27 (2): 892-909 (2013)Efficient approximation algorithms for shortest cycles in undirected graphs., and . Inf. Process. Lett., 109 (10): 493-498 (2009)Counting and detecting small subgraphs via equations and matrix multiplication., , and . SODA, page 1468-1476. SIAM, (2011)The approximability of maximum rooted triplets consistency with fan triplets and forbidden triplets., , , and . Discret. Appl. Math., (2019)Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices., , and . SWAT, volume 3111 of Lecture Notes in Computer Science, page 248-259. Springer, (2004)Unique Small Subgraphs Are Not Easier to Find., , and . LATA, volume 6638 of Lecture Notes in Computer Science, page 336-341. Springer, (2011)