Andrzej Lingas

111 – 120 of 138

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/09fd65c1-2d22-477b-8095-ab06351e9b6f?embed=1&amp;hide_pagination=1&amp;hide_info=1&amp;hide_options=1"
  width="100%"
  height="400"
  allowtransparency="true"
  frameborder="0">
</iframe>

2005
Mark Approximate clustering of fingerprint vectors with missing values
Figueroa, Andres ; Goldstein, Avraham ; Jiang, Tao ; Kurowski, Maciej ; Lingas, Andrzej ^LU and Persson, Mia ^LU (2005) Computing: The Australasian Theory Symposium p.57-60
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Embedding point sets into plane graphs of small dilation
Ebbers-Baumann, A ; Grune, A ; Karpinski, M ; Klein, R ; Knauer, C and Lingas, Andrzej ^LU (2005) 16th International Symposium, ISAAC 2005 3827. p.5-16
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark LCA queries in directed acyclic graphs
Kowaluk, M and Lingas, Andrzej ^LU (2005) 32nd International Colloquium, ICALP 2005 3580. p.241-248
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Max-stretch reduction for tree spanners
Iwama, K ; Lingas, Andrzej ^LU and Okita, M (2005) 9th International Workshop, WADS 2005 3608. p.122-133
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
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 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 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
2003
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