21 – 29 of 29
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- « previous
- 1
- 2
- 3
- next »
- 2007
-
Mark
Approximate distance oracles for graphs with dense clusters
- Contribution to journal › Article
-
Mark
On exact complexity of subgraph homeomorphism
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2006
-
Mark
Performing work in broadcast networks
- Contribution to journal › Article
-
Mark
Restricted mesh simplification using edge contractions
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Covering a set of points with a minimum number of lines
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
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
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
On the approximability of maximum and minimum edge clique partition problems
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- « previous
- 1
- 2
- 3
- next »
