1 – 8 of 8
- show: 10
- |
- sort: year (new to old)
Close
Embed this list
<iframe src=" "
width=" "
height=" "
allowtransparency="true"
frameborder="0">
</iframe>
- 2020
-
Mark
Graphs with equal domination and covering numbers
(
- Contribution to journal › Article
- 2019
-
Mark
Clearing directed subgraphs by mobile agents : Variations on covering with paths
(
- Contribution to journal › Article
- 2017
-
Mark
The snow team problem : (Clearing Directed subgraphs by mobile agents)
2017) 21th International Symposium on Fundamentals of Computation Theory, FCT 2017 In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 10472 LNCS. p.190-203(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2014
-
Mark
Clearing Connections by Few Agents
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2012
-
Mark
Linear-time 3-approximation algorithm for the r-star covering problem
(
- Contribution to journal › Article
- 2011
-
Mark
Approximation algorithms for buy-at-bulk geometric network design
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2008
-
Mark
Linear-time 3-approximation algorithm for the r-star covering problem
(
- Chapter in Book/Report/Conference proceeding › Paper in conference proceeding
- 2007
-
Mark
Note on covering monotone orthogonal polygons with star-shaped polygons
(
- Contribution to journal › Article