Author:
Molter Hendrik,Niedermeier Rolf,Renken Malte
Publisher
Springer International Publishing
Reference16 articles.
1. Bentert, M., Himmel, A.S., Molter, H., Morik, M., Niedermeier, R., Saitenmacher, R.: Listing all maximal $$k$$-plexes in temporal graphs. ACM J. Exp. Algorithm. 24(1), 1.13:1–1.13:27 (2019)
2. van Bevern, R., Fluschnik, T., Mertzios, G.B., Molter, H., Sorge, M., Suchý, O.: The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs. Discret. Optim. 30, 20–50 (2018)
3. Chechik, S., Johnson, M.P., Parter, M., Peleg, D.: Secluded connectivity problems. Algorithmica 79(3), 708–741 (2017)
4. Eppstein, D., Strash, D.: Listing all maximal cliques in large sparse real-world graphs. ACM J. Exp. Algorithm. 18, 1–3 (2013)
5. Fournet, J., Barrat, A.: Contact patterns among high school students. PLoS ONE 9(9), 1–17 (2014)
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献