Author:
Andres Stephan Dominique,Hochstättler Winfried
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference6 articles.
1. Greedy colorings for the binary paintshop problem;Amini;J. Discrete Algorithms,2010
2. Complexity results on restricted instances of a paint shop problem for words;Bonsma;Discrete Appl. Math.,2006
3. Complexity result on a paint shop problem;Epping;Discrete Appl. Math.,2004
4. On approximability of minimum bisection problem;Karpinski;Electronic Colloquium on Computational Complexity (ECCC),2002
5. Approximation algorithms for the bipartite multicut problem;Kenkre;Inform. Process. Lett.,2010
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献