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 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
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 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 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 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 Subexponential-time framework for optimal embeddings of graphs in integer lattices
Dessmark, Anders ^LU ; Lingas, Andrzej ^LU and Lundell, Eva-Marta ^LU (2004) 9th Scandinavian Workshop on Algorithm Theory 3111. p.248-259
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
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
2003
Mark Improved approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
Czumaj, A ; Lingas, Andrzej ^LU and Nilsson, J (2003) 14th International Symposium, ISAAC 2003 2906. p.544-553
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark A fast algorithm for optimal alignment between similar ordered trees
Jansson, Jesper ^LU and Lingas, Andrzej ^LU (2003) In Fundamenta Informaticae 56(1-2). p.105-120
- Contribution to journal › Article