Anders Dessmark (Former)

1 – 10 of 11

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/person/c960301d-3353-45d1-a31d-2f622062d838?embed=1&amp;hide_pagination=1&amp;hide_info=1&amp;hide_options=1"
  width="100%"
  height="400"
  allowtransparency="true"
  frameborder="0">
</iframe>

« previous
1
2
next »

2007
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 (2007) In Algorithmica 48(3). p.233-248
- Contribution to journal › Article
2006
Mark On the approximability of maximum and minimum edge clique partition problems
Dessmark, Anders ^LU ; Jansson, Jesper ^LU ; Lingas, Andrzej ^LU ; Lundell, Eva-Marta ^LU and Persson, Mia ^LU (2006) The Australasian Theory Symposium (CATS) 168. p.101-105
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2004
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 Optimal graph exploration without good maps
Dessmark, Anders ^LU and Pelc, A (2004) In Theoretical Computer Science 326(1-3). p.343-362
- Contribution to journal › Article
Mark Distributed colouring and communication in rings with local knowledge
Dessmark, Anders ^LU and Pelc, A (2004) In Combinatorics, Probability & Computing 13(2). p.123-136
- Contribution to journal › Article
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 Trade-offs between load and degree in virtual path layouts
Dessmark, Anders ^LU ; Lingas, Andrzej ^LU and Pelc, Andrzej (2003) In Parallel Processing Letters 13(3). p.485-496
- Contribution to journal › Article
Mark Deterministic rendezvous in graphs
Dessmark, Anders ^LU ; Fraigniaud, P and Pelc, A (2003) 11th Annual European Symposium - ESA 2832. p.184-195
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2002
Mark Deterministic radio broadcasting at low cost
Dessmark, Anders ^LU and Pelc, A (2002) In Networks 39(2). p.88-97
- Contribution to journal › Article
Mark Optimal graph exploration without good maps
Dessmark, Anders ^LU and Pelc, A. (2002) Algorithms - ESA 2002. 10th Annual European Symposium. Proceedings 2461. p.374-386
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding

« previous
1
2
next »