#### Filter Results:

- Full text PDF available (5)

#### Publication Year

1973

2015

- This year (0)
- Last 5 years (6)
- Last 10 years (9)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

- Andrzej Lingas, Eva-Marta Lundell
- LATIN
- 2008

- Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, Mia Persson
- Int. J. Found. Comput. Sci.
- 2006

We consider the following clustering problems: given a general undirected graph, partition its vertices into disjoint clusters such that each cluster forms a clique and the number of edges within the clusters is maximized (Max-ECP), or the number of edges between clusters is minimized (Min-ECP). These problems arise naturally in the DNA clone… (More)

- Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
- SODA
- 2011

We present a general technique for detecting and counting small subgraphs. It consists in forming special linear combinations of the numbers of occurrences of different induced subgraphs of fixed size in a graph. The combinations can be efficiently computed by rectangular matrix multiplication.
Our two main results utilizing the technique are as follows.… (More)

- Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
- SIAM J. Discrete Math.
- 2013

- Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
- SIAM J. Discrete Math.
- 2013

- Peter Floderus, Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
- Theor. Comput. Sci.
- 2012

- Anders Dessmark, Andrzej Lingas, Eva-Marta Lundell
- SWAT
- 2004

- Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell
- Algorithmica
- 2004

For a set of rooted, unordered, distinctly leaf-labeled trees, the NP-hard maximum agreement subtree problem (MAST) asks for a tree contained (up to isomorphism or homeomorphism) in all of the input trees with as many labeled leaves as possible. We study the ordered variants of MAST where the trees are uniformly or non-uniformly ordered. We provide the… (More)

- Miros Law, Kowaluk, Andrzej Lingas, Eva-Marta Lundell
- 2013

We present a general technique for detecting and counting small subgraphs. It consists of forming special linear combinations of the numbers of occurrences of different induced subgraphs of fixed size in a graph. These combinations can be efficiently computed by rectangular matrix multiplication. Our two main results utilizing the technique are as follows.… (More)

- Miroslaw Kowaluk, Andrzej Lingas, Eva-Marta Lundell
- LATA
- 2011