Andrzej Lingas
101 – 110 of 138
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2007
-
Mark
On exact complexity of subgraph homeomorphism
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Note on covering monotone orthogonal polygons with star-shaped polygons
- Contribution to journal › Article
- 2006
-
Mark
Performing work in broadcast networks
- Contribution to journal › Article
-
Mark
Finding a heaviest triangle is no harder than matrix multiplication
(2006) In Electronic Colloquium on Computational Complexity
- Book/Report › Report
-
Mark
A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation
- Contribution to journal › Article
-
Mark
Minimum-energy broadcasting in wireless networks in the d-dimensional Euclidean space (the alpha
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
On the approximability of maximum and minimum edge clique partition problems
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2005
-
Mark
Max-stretch reduction for tree spanners
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
LCA queries in directed acyclic graphs
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Embedding point sets into plane graphs of small dilation
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
