Andrzej Lingas
101 – 110 of 131
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2005
-
Mark
Embedding point sets into plane graphs of small dilation
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Approximate clustering of fingerprint vectors with missing values
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
A note on maximum independent set and related problems on box graphs
(
- Contribution to journal › Article
-
Mark
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
(
- Contribution to journal › Article
-
Mark
Polynomial time approximation schemes for max-bisection on planar and geometric graphs
(
- Contribution to journal › Article
-
Mark
LCA queries in directed acyclic graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Max-stretch reduction for tree spanners
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2004
-
Mark
A fast algorithm for approximating the detour of a polygonal chain
(
- Contribution to journal › Article
-
Mark
Approximation algorithms for Hamming clustering problems
(
- Contribution to journal › Article
-
Mark
Approximation algorithms for MAX-BISECTION on low degree regular graphs
(
- Contribution to journal › Article