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 Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell and Mia Persson Anders Dessmark, Jesper Jansson, Andrzej Lingas and Eva-Marta Lundell Miroslaw Kowaluk and Andrzej Lingas Xin Han, Kazuo Iwama, Rolf Klein and Andrzej Lingas Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto Andrzej Lingas and Martin Wahlen Andres Figueroa and Avraham Goldstein and Tao Jiang and Maciej Kurowski and Andrzej Lingas and and Mia Persson Noga Alon, Andrzej
Lingas, and Martin Wahlén Andersson,
M., Gudmundsson, J., Laube, P., and Wolle, T. Andreas
Björklund Artur Czumaj and Andrzej
Lingas Kazuo Iwama,
Andrzej Lingas, and Masaki Okita Mattias Andersson, Joachim Gudmundsson, and Christos Levcopoulos Andreas Björklund and Thore Husfeldt Andreas Björklund and Thore Husfeldt Chlebus, B.S., Kowalski, D.R., and Lingas, Andrzej Anders Dessmark, Jesper Jansson, Andrzej Lingas, Eva-Marta Lundell, and Mia Persson Magdalene Grantson and Christos Levcopoulos Magdalene Grantson Rolf Klein, Christos Levcopoulos, and Andrzej Lingas Andrzej Lingas, Mia Persson, and Martin Wahlén Mia Persson Stephen Alstrup, Thore Husfeldt, Theis Rauhe, and Mikkel Thorup
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.
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.
Polynomial-time algorithms for the ordered maximum agreement subtree problem
Algorithmica, 2007, to appear.
Unique Lowest Common Ancestors in Dags are Almost as Easy as Matrix Multiplication
15th Annual European Symposium on Algorithms(ESA), 2007, to appear.
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.
Fourier meets Möbius: fast subset convolution
39th Symp. Theory of Computation (STOC), 2007, to appear.
On Exact Complexity of Subgraph Homeomorphism
4th Conf. Theory and Applications of Models of Computation (TAMC), 2007, LNCS 4484, pp. 256-261.
Approximate Clustering of Incomplete Fingerprints
Journal of Discrete Algorithms, 2007, to appear.
Approximating the maximum clique minor
and some subgraph homeomorphism problems.
Theoretical
Computer Science, 2007, to appear.
Reporting
leadership patterns among trajectories.
Proc. ACM Symp. on
Applied Computing, 2007.
Algorithmic bounds for presumably hard
combinatorial problems.
Ph.D. thesis, Lund University, January
2007.
Finding a heaviest triangle is not harder than matrix
multiplication.
Proc. 18th ACM-SIAM Symp. on Discrete
Algorithms (SODA), 2007.
Max-Stretch Reduction for Tree
Spanners.
Algorithmica, 2007, to appear
Restricted mesh simplification using edge contractions.
Proc. 12th Ann. Internat. Computing and Combinatorics Conference (COCOON), 2006, pp. 196-204.
Inclusion-exclusion algorithms for counting set partitions.
Proc. 47th FOCS, 2006, pp. 575-582.
Exact algorithms for exact satisfiability and number of perfect matchings.
Proc. 33rd ICALP, Springer, 2006, pp. 548-559.
Performing work in broadcast networks.
Distributed Computing, vol. 18, no. 6, 2006, pp. 435-451.
On the approximability of minimum and maximum edge clique partition problems.
Proc. 12th Computing: The Australasian Theory Symposium (CATS), 2006.
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.
Fixed-parameter algorithms for optimal convex partitions and other results..
Ph.D. thesis, Lund University, 2006.
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.
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.
Approximation and online algorithms with applications in Computational Biology and Computational Geometry..
Ph.D. thesis, Lund University, 2006.
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
© Institutionen för
Datavetenskap,
2005–2006.