|
Search the dblp DataBase
Eva-Marta Lundell:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. [Citation Graph (0, 0)][DBLP] CPM, 2004, pp:220-229 [Conf]
- Anders Dessmark, Andrzej Lingas, Eva-Marta Lundell
Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices. [Citation Graph (0, 0)][DBLP] SWAT, 2004, pp:248-259 [Conf]
- Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem. [Citation Graph (0, 0)][DBLP] Algorithmica, 2007, v:48, n:3, pp:233-248 [Journal]
On the Approximability of Maximum and Minimum Edge Clique Partition Problems. [Citation Graph (, )][DBLP]
Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.001secs
|