1 – 4 of 4
- show: 100
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2014
-
Mark
Clearing Connections by Few Agents
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2007
-
Mark
Approximating the maximum clique minor and some subgraph homeomorphism problems.
(
- Contribution to journal › Article
- 2004
-
Mark
A fast algorithm for approximating the detour of a polygonal chain
(
- Contribution to journal › Article
- 2001
-
Mark
A fast algorithm for optimal alignment between similar ordered trees
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding