81 – 90 of 130
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2008
-
Mark
Efficient approximation algorithms for shortest cycles in undirected graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Linear-time 3-approximation algorithm for the r-star covering problem
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Approximate clustering of incomplete fingerprints
(
- Contribution to journal › Article
-
Mark
A path cover technique for LCAs in dags
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Minimum k-connected geometric networks
2008) p.536-538(
- Chapter in Book/Report/Conference proceeding › Book chapter
- 2007
-
Mark
Polynomial-time algorithms for the ordered maximum agreement subtree problem
(
- Contribution to journal › Article
-
Mark
On the approximability of maximum and minimum edge clique partition problems
(
- Contribution to journal › Article
-
Mark
Unique lowest common ancestors in dags are almost as easy as matrix multiplication
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Embedding point sets into plane graphs of small dilation
(
- Contribution to journal › Article
-
Mark
Approximating the maximum clique minor and some subgraph homeomorphism problems.
(
- Contribution to journal › Article