No. |
Title |
Author |
Year |
---|

1 |
On Computing Centroids According to the p-Norms of Hamming Distance Vectors |
Chen, Jiehua et al. |
2019 |

2 |
Packing Directed Circuits Quarter-Integrally |
Masarík, Tomás et al. |
2019 |

3 |
Cluster Editing in Multi-Layer and Temporal Graphs |
Chen, Jiehua et al. |
2018 |

4 |
How Hard Is It to Satisfy (Almost) All Roommates? |
Chen, Jiehua et al. |
2018 |

5 |
Solving Partition Problems Almost Always Requires Pushing Many Vertices Around |
Kanj, Iyad et al. |
2018 |

6 |
Finding Secluded Places of Special Interest in Graphs |
van Bevern, René et al. |
2017 |

7 |
Parameterized Algorithms for Recognizing Monopolar and 2-Subcolorable Graphs |
Kanj, Iyad et al. |
2016 |

8 |
Approximation Algorithms for Mixed, Windy, and Capacitated Arc Routing Problems |
van Bevern, René et al. |
2015 |

9 |
On Kernelization and Approximation for the Vector Connectivity Problem |
Kratsch, Stefan et al. |
2015 |

10 |
The Parameterized Complexity of the Minimum Shared Edges Problem |
Fluschnik, Till et al. |
2015 |