Computer Science
121 – 130 of 183
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2004
-
Mark
Tight time bounds for the minimum local convex partition problem
(
- Chapter in Book/Report/Conference proceeding › Book chapter
-
Mark
A new Q-learning algorithm based on the Metropolis criterion
(
- Contribution to journal › Article
-
Mark
Fixed parameter algorithms and other results for convex patitions
2004)(
- Thesis › Licentiate thesis
- 2003
-
Mark
Improved approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
An improved bound on Boolean matrix multiplication for highly clustered data
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Subexponential-time algorithms for maximum independent set and related problems on box graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Fundamentals of computation theory
- Book/Report › Conference proceeding (editor)
-
Mark
Deterministic rendezvous in graphs
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Chips on wafers
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Balanced partition of minimum spanning trees
(
- Contribution to journal › Article