Recent publications

Andreas Björklund and Thore Husfeldt
Exact algorithms for exact satisfiability and number of perfect matchings.
Algorithmica, 2008, to appear.

Artur Czumaj, Andrzej Lingas and Miroslaw Kowaluk
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
Theoretical Computer Science (Special ICALP 2005 issue), 2007, 380 (1-2), pp. 37-46.

Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell and Mia Persson
On the approximability of maximum and minimum edge clique partition problems
Int'l Journal of Foundations of Comp. Sci., vol. 18, no. 2, 2007, pp 217-226.

Anders Dessmark, Jesper Jansson, Andrzej Lingas and Eva-Marta Lundell
Polynomial-time algorithms for the ordered maximum agreement subtree problem
Algorithmica, 2007, to appear.

Miroslaw Kowaluk and Andrzej Lingas
Unique Lowest Common Ancestors in Dags are Almost as Easy as Matrix Multiplication
15th Annual European Symposium on Algorithms(ESA), 2007, to appear.

Xin Han, Kazuo Iwama, Rolf Klein and Andrzej Lingas
Approximating the maximum independent set and minimum vertex coloring on box graphs
3rd Int'l Conf. on Algorithmic Aspects in Information and Management (AAIM), 2007, LNCS 4508, pp. 337-345.

Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto
Fourier meets Möbius: fast subset convolution
39th Symp. Theory of Computation (STOC), 2007, to appear.

Andrzej Lingas and Martin Wahlen
On Exact Complexity of Subgraph Homeomorphism
4th Conf. Theory and Applications of Models of Computation (TAMC), 2007, LNCS 4484, pp. 256-261.

Andres Figueroa and Avraham Goldstein and Tao Jiang and Maciej Kurowski and Andrzej Lingas and and Mia Persson
Approximate Clustering of Incomplete Fingerprints
Journal of Discrete Algorithms, 2007, to appear.

Noga Alon, Andrzej Lingas, and Martin Wahlén
Approximating the maximum clique minor and some subgraph homeomorphism problems.
Theoretical Computer Science, 2007, to appear.

Andersson, M., Gudmundsson, J., Laube, P., and Wolle, T.
Reporting leadership patterns among trajectories.
Proc. ACM Symp. on Applied Computing, 2007.

Andreas Björklund
Algorithmic bounds for presumably hard combinatorial problems.
Ph.D. thesis, Lund University, January 2007.

Artur Czumaj and Andrzej Lingas
Finding a heaviest triangle is not harder than matrix multiplication.
Proc. 18th ACM-SIAM Symp. on Discrete Algorithms (SODA), 2007.

Kazuo Iwama, Andrzej Lingas, and Masaki Okita
Max-Stretch Reduction for Tree Spanners.
Algorithmica, 2007, to appear

Mattias Andersson, Joachim Gudmundsson, and Christos Levcopoulos
Restricted mesh simplification using edge contractions.
Proc. 12th Ann. Internat. Computing and Combinatorics Conference (COCOON), 2006, pp. 196-204.

Andreas Björklund and Thore Husfeldt
Inclusion-exclusion algorithms for counting set partitions.
Proc. 47th FOCS, 2006, pp. 575-582.

Andreas Björklund and Thore Husfeldt
Exact algorithms for exact satisfiability and number of perfect matchings.
Proc. 33rd ICALP, Springer, 2006, pp. 548-559.

Chlebus, B.S., Kowalski, D.R., and Lingas, Andrzej
Performing work in broadcast networks.
Distributed Computing, vol. 18, no. 6, 2006, pp. 435-451.

Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, and Mia Persson
On the approximability of minimum and maximum edge clique partition problems.
Proc. 12th Computing: The Australasian Theory Symposium (CATS), 2006.

Magdalene Grantson and Christos Levcopoulos
Covering a set of points with a minimum number of lines..
Proc. 6th Italian Conference on Algorithms and Complexity (CIAC), Springer, 2006, pp. 6-17.

Magdalene Grantson
Fixed-parameter algorithms for optimal convex partitions and other results..
Ph.D. thesis, Lund University, 2006.

Rolf Klein, Christos Levcopoulos, and Andrzej Lingas
A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation..
Computational Geometry, vol. 34, no. 1, 2006, pp. 28-34.

Andrzej Lingas, Mia Persson, and Martin Wahlén
Minimum-Energy Broadcasting in Wireless Networks in d-Dimensional Euclidean Space.
Proc. 3rd Workshop on Combinatorial and Algorithmic Aspects of Networking (CAAN), Springer, 2006, pp. 112-124.

Mia Persson
Approximation and online algorithms with applications in Computational Biology and Computational Geometry..
Ph.D. thesis, Lund University, 2006.

Stephen Alstrup, Thore Husfeldt, Theis Rauhe, and Mikkel Thorup
Black box for constant-time insertion in priority queues.
ACM Transactions on Algorithms, vol. 1, no. 1, 2005, pp. 102-106.

2005 and earlier

Old publications

blue line
© Institutionen för Datavetenskap, 2005–2006.