×

zbMATH — the first resource for mathematics

Lundell, Eva-Marta

Compute Distance To:
Author ID: lundell.eva-marta Recent zbMATH articles by "Lundell, Eva-Marta"
Published as: Lundell, Eva-Marta
External Links: MGP · Wikidata
Documents Indexed: 16 Publications since 2004

Publications by Year

Citations contained in zbMATH

10 Publications have been cited 31 times in 22 Documents Cited by Year
On the approximability of maximum and minimum edge clique partition problems. Zbl 1112.68136
Dessmark, Anders; Jansson, Jesper; Lingas, Andrzej; Lundell, Eva-Marta; Persson, Mia
7
2007
Induced subgraph isomorphism: are some patterns substantially easier than others? Zbl 1331.05154
Floderus, Peter; Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
5
2015
Counting and detecting small subgraphs via equations. Zbl 1275.68161
Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
5
2013
Detecting and counting small pattern graphs. Zbl 1327.68332
Floderus, Peter; Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
3
2015
Efficient approximation algorithms for shortest cycles in undirected graphs. Zbl 1214.68466
Lingas, Andrzej; Lundell, Eva-Marta
3
2009
Induced subgraph isomorphism: are some patterns substantially easier than others? Zbl 1364.68228
Floderus, Peter; Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
2
2012
Counting and detecting small subgraphs via equations and matrix multiplication. Zbl 1376.05151
Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
2
2011
Polynomial-time algorithms for the ordered maximum agreement subtree problem. Zbl 1103.68967
Dessmark, Anders; Jansson, Jesper; Lingas, Andrzej; Lundell, Eva-Marta
2
2004
Detecting and counting small pattern graphs. Zbl 1406.68128
Floderus, Peter; Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
1
2013
Unique subgraphs are not easier to find. Zbl 1310.68113
Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
1
2013
Induced subgraph isomorphism: are some patterns substantially easier than others? Zbl 1331.05154
Floderus, Peter; Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
5
2015
Detecting and counting small pattern graphs. Zbl 1327.68332
Floderus, Peter; Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
3
2015
Counting and detecting small subgraphs via equations. Zbl 1275.68161
Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
5
2013
Detecting and counting small pattern graphs. Zbl 1406.68128
Floderus, Peter; Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
1
2013
Unique subgraphs are not easier to find. Zbl 1310.68113
Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
1
2013
Induced subgraph isomorphism: are some patterns substantially easier than others? Zbl 1364.68228
Floderus, Peter; Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
2
2012
Counting and detecting small subgraphs via equations and matrix multiplication. Zbl 1376.05151
Kowaluk, Mirosław; Lingas, Andrzej; Lundell, Eva-Marta
2
2011
Efficient approximation algorithms for shortest cycles in undirected graphs. Zbl 1214.68466
Lingas, Andrzej; Lundell, Eva-Marta
3
2009
On the approximability of maximum and minimum edge clique partition problems. Zbl 1112.68136
Dessmark, Anders; Jansson, Jesper; Lingas, Andrzej; Lundell, Eva-Marta; Persson, Mia
7
2007
Polynomial-time algorithms for the ordered maximum agreement subtree problem. Zbl 1103.68967
Dessmark, Anders; Jansson, Jesper; Lingas, Andrzej; Lundell, Eva-Marta
2
2004

Citations by Year

Wikidata Timeline

The data are displayed as stored in Wikidata under a Creative Commons CC0 License. Updates and corrections should be made in Wikidata.