1 – 27 of 27
- show: 250
- |
- 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
- 2016
-
Mark
Studies in Efficient Discrete Algorithms
2016)(
- Thesis › Doctoral thesis (compilation)
- 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
Quickest path queries on transportation network
(
- Contribution to journal › Article
-
Mark
Approximation algorithms for optimal purchase/inventory policy when purchase price and demand are stochastic
(
- 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
- 2009
-
Mark
Exact and approximation algorithms for graph problems with some biological applications
2009)(
- Thesis › Doctoral thesis (compilation)
-
Mark
Algorithmic Graph Problems - From Computer Networks to Graph Embeddings
2009)(
- Thesis › Doctoral thesis (compilation)
- 2007
-
Mark
Algorithmic Bounds for Presumably Hard Combinatorial Problems
2007)(
- Thesis › Doctoral thesis (compilation)
-
Mark
Approximation Algorithms for Geometric Networks
2007)(
- Thesis › Doctoral thesis (monograph)
-
Mark
Minimum weight pseudo-triangulations
(
- Contribution to journal › Article
- 2005
-
Mark
TSP with neighborhoods of varying size
(
- Contribution to journal › Article
-
Mark
Chips on wafers, or packing rectangles into grids
(
- Contribution to journal › Article
-
Mark
Polynomial time approximation schemes for max-bisection on planar and geometric graphs
(
- Contribution to journal › Article
-
Mark
Approximation algorithms for optimization problems in graphs with superlogarithmic treewidth
(
- Contribution to journal › Article
- 2004
-
Mark
Approximation algorithms for MAX-BISECTION on low degree regular graphs
(
- Contribution to journal › Article
- 2003
-
Mark
Finding a path of superlogarithmic length
(
- Contribution to journal › Article
-
Mark
Balanced partition of minimum spanning trees
(
- Contribution to journal › Article
- 2002
-
Mark
Optimal algorithms for complete linkage clustering in d dimensions
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2001
-
Mark
From Art Galleries to Terrain Modelling --- A Meandering Path through Computational Geometry
2001)(
- Thesis › Doctoral thesis (compilation)
- 1999
-
Mark
Close Approximations of Minimum Rectangular Coverings
(
- Contribution to journal › Article