1 – 11 of 11
- show: 250
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2023
-
Mark
On parallel time in population protocols
(
- Contribution to journal › Article
- 2018
-
Mark
Approximation schemes for capacitated geometric network design
(
- Contribution to journal › Article
- 2011
-
Mark
Approximation algorithms for buy-at-bulk geometric network design
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2010
-
Mark
PTAS for k-tour cover poblem on the plane for moderately large values of k
(
- Contribution to journal › Article
- 2009
-
Mark
Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication
(
- Contribution to journal › Article
-
Mark
PTAS for k-tour cover poblem on the plane for moderately large values of k
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2008
-
Mark
Minimum k-connected geometric networks
2008) p.536-538(
- Chapter in Book/Report/Conference proceeding › Book chapter
- 2007
-
Mark
Finding a heaviest triangle is not harder than matrix multiplication
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
(
- Contribution to journal › Article
- 2006
-
Mark
Finding a heaviest triangle is no harder than matrix multiplication
2006) In Electronic Colloquium on Computational Complexity(
- Book/Report › Report
- 2000
-
Mark
Fast approximation schemes for Euclidean multi-connectivity problems
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding