Author:
Conte Alessio,Kanté Mamadou Moustapha,Marino Andrea,Uno Takeaki
Publisher
Springer International Publishing
Reference20 articles.
1. Alon, N., Kahn, J., Seymour, P.D.: Large induced degenerate subgraphs. Graphs Comb. 3(1), 203–211 (1987)
2. Bar-Noy, A., Cheilaris, P., Olonetsky, S., Smorodinsky, S.: Online conflict-free colouring for hypergraphs. Comb. Probab. Comput. 19(4), 493–516 (2010)
3. Binkele-Raible, D., et al.: Breaking the 2
$$^{\text{ n }}$$
-barrier for irredundance: two lines of attack. J. Discret. Algorithms 9(3), 214–230 (2011)
4. Lecture Notes in Computer Science;E Boros,2004
5. Boros, E., Makino, K.: Generating maximal irredundant and minimal redundant subfamilies of a given hypergraph. announced at WEPA 2016 (Clermont-Ferrand, November 2016) and Boolean Seminar 2017 (Liblice, March 2017) (2016).
http://clp.mff.cuni.cz/booleanseminar/presentations/endre.pdf
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献