Publications | Lund University Publications

101 – 110 of 137

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=author+exact+%22cs-ali%22+or+(documentType+any+%22bookEditor+conferenceEditor%22+and+editor+exact+%22cs-ali%22)&amp;hide_pagination=1&amp;hide_info=1&amp;hide_options=1"
  width="100%"
  height="400"
  allowtransparency="true"
  frameborder="0">
</iframe>

2007
Mark Finding a heaviest triangle is not harder than matrix multiplication
Czumaj, Artur and Lingas, Andrzej ^LU (2007) Symposium on Discrete Algorithms, 2007 p.986-994
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
2006
Mark A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation
Klein, Rolf ; Levcopoulos, Christos ^LU and Lingas, Andrzej ^LU (2006) In Computational Geometry 34(1). p.28-34
- Contribution to journal › Article
Mark Performing work in broadcast networks
Chlebus, BS ; Kowalski, DR and Lingas, Andrzej ^LU (2006) In Distributed Computing 18(6). p.435-451
- Contribution to journal › Article
Mark Minimum-energy broadcasting in wireless networks in the d-dimensional Euclidean space (the alpha
Lingas, Andrzej ^LU ; Persson, Mia ^LU and Wahlén, Martin ^LU (2006) Third Workshop, CAAN 2006 4235. p.112-124
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Finding a heaviest triangle is no harder than matrix multiplication
Czumaj, Artur and Lingas, Andrzej ^LU (2006) In Electronic Colloquium on Computational Complexity
- Book/Report › Report
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
2005
Mark Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
Czumaj, A ; Halldorsson, M M ; Lingas, Andrzej ^LU and Nilsson, J (2005) In Information Processing Letters 94(2). p.49-53
- Contribution to journal › Article
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 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
Mark Polynomial time approximation schemes for max-bisection on planar and geometric graphs
Jansen, K ; Karpinski, M ; Lingas, Andrzej ^LU and Seidel, E (2005) In SIAM Journal on Computing 35(1). p.110-119
- Contribution to journal › Article

your query:: Remove author: Lingas, Andrzej (LU)