Andrzej Lingas

Professor of Computer Science, Lund University, Sweden

Current research

• Exact algorithms for subgraph isomorphism and induced subgraph isomorphism for small pattern graphs (graph algorithms)
• Non-standard approaches to matrix products (matrix computation)
• Efficient network broadcasting and gossiping (parallel and distributed computation)
• Efficient construction of phylogenetic trees and similarity measures for phylogenetic networks (computational biology)
• Approximation and exact algorithms for geometric network design (computational geometry)
• Exact and approximation algorithms for the graph and geometric firefighter problems (graph algorithms, computational geometry)
• Exact algorithms for optimal partitions in metric spaces (graph algorithms/computational geometry)
• Graph clustering problems (graph algorithms)
• Parallel algorithms for small network flow (graph algorithms, parallel computation)
• Detecting specific monomials in the polynomials generated by monotone arithmetic circuits (computational complexity)
• Approximation algorithms for counting crossing free structures on a planar point set (computational geometry)

Service to the research community in 2015

• Member of the programme committees of the 42nd International Conference on Current Trends in Theory and Practice of Computer Science 2016 and the 2nd Conference on Algorithms and Discrete Applied Mathematics 2016.
• Member of the editorial boards of Nordic Journal of Computing, Parallel Processing Letters and Encyclopedia of Algorithms
• Member of the steering committees of the conference-series Scandinavian Symposium and Workshops on Algorithm Theory (see SWAT 2014) and Fundamentals of Computation Theory (see FCT 2015).

Recent PhD students

• Peter Floderus who defended his PhD dissertation on in March 2015 ,
• Dzmitry Sledneu who is expected to defend his PhD dissertation at the beginning of 2016.

ADDRESS