Computer Science

151 – 160 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/organization/011014002?embed=1&amp;hide_pagination=1&amp;hide_info=1&amp;hide_options=1"
  width="100%"
  height="400"
  allowtransparency="true"
  frameborder="0">
</iframe>

2002
Mark On adaptive deterministic gossiping in ad hoc radio networks
Gasieniec, Leszek and Lingas, Andrzej ^LU (2002) Symposium on Discrete Algorithms, 2002 p.689-690
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
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
Mark Approximate distance oracles for geometric graphs
Gudmundsson, Joachim ; Levcopoulos, Christos ^LU ; Narasimhan, Giri and Smid, Michiel (2002) Symposium on Discrete Algorithms, 2002 p.828-837
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Finding a path of superlogarithmic length
Björklund, Andreas ^LU and Husfeldt, Thore ^LU (2002) Proceedings of 29th International Colloquium on Automata, Languages and Programming LNCS 2380. p.985-992
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Approximate distance oracles revisited
Gudmundsson, J ; Levcopoulos, Christos ^LU ; Narasimhan, G and Smid, M (2002) 13th International Symposium, ISAAC 2002 2518. p.357-368
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Adaptive algorithms for constructing convex hulls and triangulations of polygonal chains
Levcopoulos, Christos ^LU ; Lingas, Andrzej ^LU and Mitchell, Joseph S. B. (2002) 8th Scandinavian Workshop on Algorithm Theory. 2368. p.80-89
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Polynomial-time approximation schemes for the Euclidean survivable network design problem
Czumaj, A ; Lingas, Andrzej ^LU and Zhao, HR (2002) 29th International Colloquium, ICALP 2002 2380. p.973-984
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Improved algorithms for constructing fault-tolerant spanners
Levcopoulos, Christos ^LU ; Narasimhan, G and Smid, M (2002) In Algorithmica 32(1). p.144-156
- Contribution to journal › Article
2001
Mark From Art Galleries to Terrain Modelling --- A Meandering Path through Computational Geometry
Hammar, Mikael ^LU (2001)
- Thesis › Doctoral thesis (compilation)
Mark On the complexity of inferring rooted evolutionary trees
Jansson, Jesper ^LU (2001) 7. p.121-125
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding