1 – 10 of 13
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2012
-
Mark
The complexity of inferring a minimally resolved phylogenetic supertree
(
- Contribution to journal › Article
- 2009
-
Mark
Set partitioning via inclusion-exclusion
(
- Contribution to journal › Article
-
Mark
Finding a heaviest vertex-weighted triangle is not harder than matrix multiplication
(
- Contribution to journal › Article
-
Mark
Narrow proofs may be spacious : Separating space and width in resolution
(
- Contribution to journal › Article
- 2005
-
Mark
Polynomial time approximation schemes for max-bisection on planar and geometric graphs
(
- Contribution to journal › Article
- 2003
-
Mark
New lower bound techniques for dynamic partial sums and related problems
(
- Contribution to journal › Article
-
Mark
Finding a path of superlogarithmic length
(
- Contribution to journal › Article
- 2002
-
Mark
Fast greedy algorithms for constructing sparse geometric spanners
(
- Contribution to journal › Article