1 – 11 of 11
- show: 20
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2012
-
Mark
Exact and approximation algorithms for geometric and capacitated set cover problems
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2011
-
Mark
Approximation algorithms for buy-at-bulk geometric network design
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2010
-
Mark
Approximability of edge matching puzzles
2010) 36th International Conference on Current Trends in Theory and Practice of Computer Science 5901. p.153-164(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2009
-
Mark
A fast output-sensitive algorithm for Boolean matrix multiplication
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
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
-
Mark
Efficient approximation algorithms for shortest cycles in undirected graphs
(
- Contribution to journal › Article
-
Mark
Restricted mesh simplification using edge contractions
(
- Contribution to journal › Article
-
Mark
Faster multi-witnesses for Boolean matrix multiplication
(
- Contribution to journal › Article
-
Mark
Efficient broadcasting in known toplogy radio networks with long-range interference
2009) p.230-239(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
An exact algorithm for subgraph homeomorphism
(
- Contribution to journal › Article