Author:
Cáceres Manuel,Cairo Massimo,Mumey Brendan,Rizzi Romeo,Tomescu Alexandru I.
Publisher
Springer International Publishing
Reference27 articles.
1. Abboud, A., Williams, V.V., Wang, J.: Approximation and fixed parameter subquadratic algorithms for radius and diameter in sparse graphs. In: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 377–391. SIAM (2016)
2. Bang-Jensen, J., Gutin, G.: Digraphs Theory, Algorithms and Applications, 1st edn. Springer, Berlin (2000)
3. Bonizzoni, P.: A linear-time algorithm for the perfect phylogeny haplotype problem. Algorithmica 48(3), 267–285 (2007). https://doi.org/10.1007/s00453-007-0094-3
4. Bosek, B., Felsner, S., Kloch, K., Krawczyk, T., Matecki, G., Micek, P.: On-line chain partitions of orders: a survey. Order 29(1), 49–73 (2012). https://doi.org/10.1007/s11083-011-9197-1
5. Bova, S., Ganian, R., Szeider, S.: Model checking existential logic on partially ordered sets. ACM Trans. Comput. Log. (TOCL) 17(2), 1–35 (2015)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Safety in multi-assembly via paths appearing in all path covers of a DAG;IEEE/ACM Transactions on Computational Biology and Bioinformatics;2021