Andrzej Lingas

91 – 100 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>

« previous
1
…
9
10
11
12
…
14
next »

2008
Mark Max-stretch reduction for tree spanners
Iwama, Kazuo ; Lingas, Andrzej ^LU and Okita, Masaki (2008) In Algorithmica 50(2). p.223-235
- Contribution to journal › Article
Mark Minimum k-connected geometric networks
Czumaj, Artur and Lingas, Andrzej ^LU (2008) p.536-538
- Chapter in Book/Report/Conference proceeding › Book chapter
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
Mark On the approximability of maximum and minimum edge clique partition problems
Dessmark, Anders ; Jansson, Jesper ; Lingas, Andrzej ^LU ; Lundell, Eva-Marta ^LU and Persson, Mia ^LU (2007) In International Journal of Foundations of Computer Science 18(2). p.217-226
- Contribution to journal › Article
Mark Unique lowest common ancestors in dags are almost as easy as matrix multiplication
Kowaluk, Miroslaw and Lingas, Andrzej ^LU (2007) 15th Annual European Symposium on Algorithms 4698. p.265-274
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
Mark Embedding point sets into plane graphs of small dilation
Ebbers-Baumann, Annette ; Gruene, Ansgar ; Klein, Rolf ; Karpinski, Marek ; Knauer, Christian and Lingas, Andrzej ^LU (2007) In International Journal of Computational Geometry and Applications 17(3). p.201-230
- Contribution to journal › Article
Mark Approximating the maximum clique minor and some subgraph homeomorphism problems.
Alon, Noga ; Lingas, Andrzej ^LU and Wahlén, Martin ^LU (2007) In Theoretical Computer Science 374(1-3). p.149-158
- Contribution to journal › Article
Mark Faster algorithms for finding lowest common ancestors in directed acyclic graphs
Czumaj, Artur ; Kowaluk, Miroslaw and Lingas, Andrzej ^LU (2007) In Theoretical Computer Science 380(1-2). p.37-46
- Contribution to journal › Article
Mark Approximating the maximum independent set and minimum vertex coloring on box graphs
Han, Xin ; Iwama, Kazuo ; Klein, Rolf and Lingas, Andrzej ^LU (2007) Third International Conference, AAIM 2007 4508. p.337-345
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
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

« previous
1
…
9
10
11
12
…
14
next »