Andrzej Lingas
Professor of Computer Science, Lund University, Sweden
Current research
The design and analysis of efficient exact and approximation
algorithms for combinatorial and geometric problems. The research is
in part supported by the VR
project "Efficient algorithms and approximation
heuristics for combinatorial and geometric problems" and the
COST 295 ACTION project
DYNAMO
(Dynamic Communication Networks). During 2001--2007,
I have been working among other things on the
following problems:
- Efficient network broadcasting and gossiping
(parallel and distributed computation)
- Efficient construction of evolutionary trees
(computational biology)
- Tree alignment (computational biology)
- Approximation and optimization dilation problems (computational
geometry)
- String clustering problems (string algorithms,
computational biology)
- Maximum independent set and related problems for restricted
graph classes (graph algorithms)
- Approximation algorithms for max-bisection (graph algorithms)
- Polynomial-time approximation schemes for Euclidean minimum
cost k-connectivity (geometric graph algorithms)
- Boolean matrix multiplication, lowest common ancestors
in directed graphs, finding heaviest subgraphs (matrix computations
and graph algorithms)
For the previous problems I have
worked on as well as for the previous and the recent
publications see
publications.
Courses
I have been or will be responsible for the following graduate
and/or undergraduate courses in
2007--
Other activities
ADDRESS
Andrzej Lingas (
Andrzej.Lingas@cs.lth.se)
Department of Computer Science
Lund University
Box 118
S-221 00 Lund
Sweden
Phone: (+46) 46 222 45 19
Fax: (+46) 46 13 10 21
(Click here to
see where my room is)