Publications | Lund University Publications

111 – 120 of 183

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=department+exact+011014002&amp;hide_pagination=1&amp;hide_info=1&amp;hide_options=1"
  width="100%"
  height="400"
  allowtransparency="true"
  frameborder="0">
</iframe>

« previous
1
…
11
12
13
14
…
19
next »

2004
Mark Approximating longest directed paths and cycles
Björklund, Andreas ^LU ; Husfeldt, Thore ^LU and Khanna, S (2004) In Lecture Notes in Computer Science 3142. p.222-233
- Contribution to journal › Article
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 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 Semi-balanced colorings of graphs: Generalized 2-colorings based on a relaxed discrepancy condition
Jansson, Jesper ^LU and Tokuyama, T (2004) In Graphs and Combinatorics 20(2). p.205-222
- 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 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 Dynamic nested brackets
Alstrup, S ; Husfeldt, Thore ^LU and Rauhe, T (2004) In Information and Computation 193(2). p.75-83
- 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 Fixed parameter algorithms and other results for convex patitions
Grantson Borgelt, Magdalene ^LU (2004)
- Thesis › Licentiate thesis

« previous
1
…
11
12
13
14
…
19
next »

your query:: Remove department: Computer Science