Computer Science
111 – 120 of 183
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2004
-
Mark
Approximating longest directed paths and cycles
(
- Contribution to journal › Article
-
Mark
Polynomial-time algorithms for the ordered maximum agreement subtree problem
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Semi-balanced colorings of graphs: Generalized 2-colorings based on a relaxed discrepancy condition
(
- Contribution to journal › Article
-
Mark
A fast algorithm for approximating the detour of a polygonal chain
(
- Contribution to journal › Article
-
Mark
Approximation algorithms for Hamming clustering problems
(
- Contribution to journal › Article
-
Mark
Minimum weight pseudo-triangulations
2004) 24th International Conference on Foundations of Software Technology and Theoretical Computer Science 3328. p.299-310(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Dynamic nested brackets
(
- Contribution to journal › Article
-
Mark
Approximation algorithms for MAX-BISECTION on low degree regular graphs
(
- Contribution to journal › Article
-
Mark
A fixed parameter algorithm for the minimum number convex partition problem
(
- Chapter in Book/Report/Conference proceeding › Book chapter
-
Mark
Tight time bounds for the minimum local convex partition problem
(
- Chapter in Book/Report/Conference proceeding › Book chapter