21 – 30 of 183
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=""
width=""
height=""
allowtransparency="true"
frameborder="0">
</iframe>
- 2010
-
Mark
PTAS for k-tour cover poblem on the plane for moderately large values of k
- Contribution to journal › Article
-
Mark
Exponential time complexity of the permanent and the Tutte polynomial
(2010) 37th International Colloquium on Automata, Languages and Programming (ICALP 2010) In Lecture Notes in Computer Science 6198. p.426-437
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Approximability of edge matching puzzles
(2010) 36th International Conference on Current Trends in Theory and Practice of Computer Science 5901. p.153-164
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2009
-
Mark
On the complexity of approximating the Hadwiger number
- Contribution to journal › Article
-
Mark
PTAS for k-tour cover poblem on the plane for moderately large values of k
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
-
Mark
Efficient approximation algorithms for shortest cycles in undirected graphs
- Contribution to journal › Article
-
Mark
Algorithmic Graph Problems - From Computer Networks to Graph Embeddings
(2009)
- Thesis › Doctoral thesis (compilation)
-
Mark
Exact and approximation algorithms for graph problems with some biological applications
(2009)
- Thesis › Doctoral thesis (compilation)
-
Mark
Constraint Programming Methods for Optimization of Single Shortest Path Routing
(2009)
- Thesis › Doctoral thesis (monograph)
-
Mark
An exact algorithm for subgraph homeomorphism
- Contribution to journal › Article