| 2008 |
|---|
| 6 | EE | Andrzej Lingas,
Eva-Marta Lundell:
Efficient Approximation Algorithms for Shortest Cycles in Undirected Graphs.
LATIN 2008: 736-746 |
| 2007 |
|---|
| 5 | EE | Anders Dessmark,
Jesper Jansson,
Andrzej Lingas,
Eva-Marta Lundell:
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.
Algorithmica 48(3): 233-248 (2007) |
| 4 | EE | Anders Dessmark,
Jesper Jansson,
Andrzej Lingas,
Eva-Marta Lundell,
Mia Persson:
On the Approximability of Maximum and Minimum Edge Clique Partition Problems.
Int. J. Found. Comput. Sci. 18(2): 217-226 (2007) |
| 2006 |
|---|
| 3 | EE | Anders Dessmark,
Jesper Jansson,
Andrzej Lingas,
Eva-Marta Lundell,
Mia Persson:
On the Approximability of Maximum and Minimum Edge Clique Partition Problems.
CATS 2006: 101-105 |
| 2004 |
|---|
| 2 | EE | Anders Dessmark,
Jesper Jansson,
Andrzej Lingas,
Eva-Marta Lundell:
Polynomial-Time Algorithms for the Ordered Maximum Agreement Subtree Problem.
CPM 2004: 220-229 |
| 1 | EE | Anders Dessmark,
Andrzej Lingas,
Eva-Marta Lundell:
Subexponential-Time Framework for Optimal Embeddings of Graphs in Integer Lattices.
SWAT 2004: 248-259 |
