×

Found 15 Documents (Results 1–15)

Newest Citations Relevance
Behera, Balaram; Husić, Edin; Jain, Shweta; Roughgarden, Tim; Seshadhri, C.

FPT algorithms for finding near-cliques in \(c\)-closed graphs. (English) Zbl 07829249

Braverman, Mark (ed.), 13th innovations in theoretical computer science conference, ITCS 2022, Berkeley, CA, USA, January 31 – February 3, 2022. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 215, Article 17, 24 p. (2022).
MSC:  68Qxx
Cite Review PDF
Full Text: DOI arXiv
Gujjula, Krishna Reddy; Ayalur Seshadrinathan, Krishnan; Meisami, Amirhossein

A hybrid metaheuristic for the maximum \(k\)-plex problem. (English) Zbl 1414.90069

Butenko, Sergiy (ed.) et al., Examining robustness and vulnerability of networked systems. Selected papers of the NATO Advanced Research Workshop (ARW) on examining robustness and vulnerability of critical infrastructure networks, Kiev, Ukraine, June 3–5, 2013. Amsterdam: IOS Press. NATO Sci. Peace Secur. Ser. D, Inf. Commun. Secur. 37, 83-92 (2014).
MSC:  90B15 91D30 90C35 90C59
Cite Review PDF
Full Text: Link

Filter Results by …

Document Type

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software