Publications | Lund University Publications

11 – 20 of 24

show: 10
|
sort: year (new to old)

News feed Embed this list Save this search Mark all Export

Cancel

Embed this list

copy and paste the html snippet below into your own page:

<iframe src="https://lup.lub.lu.se/search/publication?embed=1&q=project+exact+P441&amp;hide_pagination=1&amp;hide_info=1&amp;hide_options=1"
  width="100%"
  height="400"
  allowtransparency="true"
  frameborder="0">
</iframe>

2004
Mark Approximate distance oracles for graphs with dense clusters
Andersson, Mattias ^LU ; Gudmundsson, J and Levcopoulos, Christos ^LU (2004) 15th International Symposium, ISAAC 2004 3341. p.53-64
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Polynomial-time algorithms for the ordered maximum agreement subtree problem
Dessmark, Anders ^LU ; Jansson, Jesper ^LU ; Lingas, Andrzej ^LU and Lundell, Eva-Marta ^LU (2004) 15th Annual Symposium, CPM 2004 3109. p.220-229
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Minimum weight pseudo-triangulations
Gudmundsson, Joachim and Levcopoulos, Christos ^LU (2004) 24th International Conference on Foundations of Software Technology and Theoretical Computer Science 3328. p.299-310
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Approximation algorithms for Hamming clustering problems
Gasieniec, Leszek ; Jansson, Jesper ^LU and Lingas, Andrzej ^LU (2004) In Journal of Discrete Algorithms 2(2 spec. iss.). p.289-301
- Contribution to journal › Article
Mark A fast algorithm for approximating the detour of a polygonal chain
Ebbers-Baumann, A ; Klein, R ; Langetepe, E and Lingas, Andrzej ^LU (2004) In Computational Geometry 27(2). p.123-134
- Contribution to journal › Article
Mark Tight time bounds for the minimum local convex partition problem
Grantson Borgelt, Magdalene ^LU and Levcopoulos, Christos ^LU (2004) 3742. p.95-105
- Chapter in Book/Report/Conference proceeding › Book chapter
Mark A fixed parameter algorithm for the minimum number convex partition problem
Grantson Borgelt, Magdalene ^LU and Levcopoulos, Christos ^LU (2004) 3742. p.83-94
- Chapter in Book/Report/Conference proceeding › Book chapter
Mark Approximation algorithms for MAX-BISECTION on low degree regular graphs
Karpinski, M ; Kowaluk, M and Lingas, Andrzej ^LU (2004) In Fundamenta Informaticae 62(3-4). p.369-375
- Contribution to journal › Article
2003
Mark An improved bound on Boolean matrix multiplication for highly clustered data
Gasieniec, L and Lingas, Andrzej ^LU (2003) 8th International Workshop, WADS 2003 In Lecture Notes in Computer Science 2748. p.329-339
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Fundamentals of computation theory
(2003) In Lecture Notes in Computer Science 2751.
- Book/Report › Conference proceeding (editor)