1 – 10 of 12
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2023
-
Mark
Quantum and Approximation Algorithms for Maximum Witnesses of Boolean Matrix Products
2023) In International Journal of Foundations of Computer Science(
- Contribution to journal › Article
- 2018
-
Mark
A QPTAS for the base of the number of crossing-free structures on a planar point set
(
- Contribution to journal › Article
- 2015
-
Mark
A QPTAS for the Base of the Number of Crossing-Free Structures on a Planar Point Set
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2014
-
Mark
A note on a QPTAS for maximum weight triangulation of planar point sets
(
- Contribution to journal › Article
-
Mark
Iterative merging heuristics for correlation clustering
(
- Contribution to journal › Article
- 2013
-
Mark
Towards more efficient infection and fire fighting
(
- Contribution to journal › Article
- 2012
-
Mark
Linear-time 3-approximation algorithm for the r-star covering problem
(
- Contribution to journal › Article
-
Mark
An Approximation Algorithm for Directed Shallow Steiner Trees
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2010
-
Mark
PTAS for k-tour cover poblem on the plane for moderately large values of k
(
- Contribution to journal › Article
- 2005
-
Mark
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
(
- Contribution to journal › Article