Search Results - Tsidulko, Oxana Yu

  • Showing 1 - 11 results of 11
Refine Results
  1. 1
    On approximate data reduction for the Rural Postman Problem: Theory and experiments

    On approximate data reduction for the Rural Postman Problem: Theory and experiments by Bevern, René, Fluschnik, Till, Tsidulko, Oxana Yu

    Published in Networks
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  2. 2
    Parameterized algorithms and data reduction for the short secluded s‐t‐path problem

    Parameterized algorithms and data reduction for the short secluded s‐t‐path problem by Bevern, René, Fluschnik, Till, Tsidulko, Oxana Yu

    Published in Networks
    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  3. 3
    Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU

    Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU by van Bevern, René, Kirilin, Artem M., Skachkov, Daniel A., Smirnov, Pavel V., Tsidulko, Oxana Yu

    Get full text
    Items that this one cites
    Article
    Save to List
    Saved in:
  4. 4
    On data reduction for dynamic vector bin packing

    On data reduction for dynamic vector bin packing by van Bevern, René, Melnikov, Andrey, Smirnov, Pavel V., Tsidulko, Oxana Yu

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  5. 5
    The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable

    The Hierarchical Chinese Postman Problem: The slightest disorder makes it hard, yet disconnectedness is manageable by Afanasev, Vsevolod A., van Bevern, René, Tsidulko, Oxana Yu

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  6. 6
    Representative families for matroid intersections, with applications to location, packing, and covering problems

    Representative families for matroid intersections, with applications to location, packing, and covering problems by van Bevern, René, Tsidulko, Oxana Yu, Zschoche, Philipp

    Get full text
    Items that this one cites
    Items that cite this one
    Article
    Save to List
    Saved in:
  7. 7
    Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU

    Serial and parallel kernelization of Multiple Hitting Set parameterized by the Dilworth number, implemented on the GPU by René van Bevern, Kirilin, Artem M, Skachkov, Daniel A, Smirnov, Pavel V, Oxana Yu Tsidulko

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  8. 8
    Representative families for matroid intersections, with applications to location, packing, and covering problems

    Representative families for matroid intersections, with applications to location, packing, and covering problems by René van Bevern, Oxana Yu Tsidulko, Zschoche, Philipp

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  9. 9
    The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable

    The Hierarchical Chinese Postman Problem: the slightest disorder makes it hard, yet disconnectedness is manageable by Afanasev, Vsevolod A, René van Bevern, Oxana Yu Tsidulko

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  10. 10
    On approximate data reduction for the Rural Postman Problem: Theory and experiments

    On approximate data reduction for the Rural Postman Problem: Theory and experiments by René van Bevern, Fluschnik, Till, Oxana Yu Tsidulko

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:
  11. 11
    Parameterized algorithms and data reduction for the short secluded \(s\)-\(t\)-path problem

    Parameterized algorithms and data reduction for the short secluded \(s\)-\(t\)-path problem by René van Bevern, Fluschnik, Till, Oxana Yu Tsidulko

    Published in arXiv.org
    Get full text
    Article
    Save to List
    Saved in:

Search Tools: