21 – 27 of 27
- 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 »
- 2009
-
Mark
Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication
(
- Contribution to journal › Article
-
Mark
An exact algorithm for subgraph homeomorphism
(
- Contribution to journal › Article
-
Mark
Algorithmic Graph Problems - From Computer Networks to Graph Embeddings
2009)(
- Thesis › Doctoral thesis (compilation)
- 2007
-
Mark
Polynomial-time algorithms for the ordered maximum agreement subtree problem
(
- Contribution to journal › Article
-
Mark
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
(
- Contribution to journal › Article
- 2004
-
Mark
A fixed parameter algorithm for the minimum number convex partition problem
(
- Chapter in Book/Report/Conference proceeding › Book chapter
- 1998
-
Mark
New Results on Combinatorial Algorithms
1998)(
- Thesis › Doctoral thesis (monograph)
- « previous
- 1
- 2
- 3
- next »