61 – 70 of 183
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2007
-
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
Minimum weight pseudo-triangulations
- Contribution to journal › Article
-
Mark
Faster algorithms for finding lowest common ancestors in directed acyclic graphs
- Contribution to journal › Article
-
Mark
Generalizing the Gap Theorem for Constructing a t-Spanner of Low Weight Fast and Simple
(2007)
- Book/Report › Report
-
Mark
A CP-LP approach to network management in OSPF routing
(2007) ACM Symposium on Applied Computing
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Finding a heaviest triangle is not harder than matrix multiplication
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
On exact complexity of subgraph homeomorphism
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Approximate distance oracles for graphs with dense clusters
- Contribution to journal › Article
-
Mark
Approximating the maximum independent set and minimum vertex coloring on box graphs
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Knowledge-based reconfiguration of automation systems
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
