default search action
Theoretical Computer Science, Volume 576
Volume 576, April 2015
- K. Subramani, James Worthington:
Feasibility checking in Horn constraint systems through a reduction based approach. 1-17 - Nikolaos Fountoulakis, Tobias Friedrich, Danny Hermelin:
On the average-case complexity of parameterized clique. 18-29 - Eddie Cheng, Robert Connolly, Christopher Melekian:
Matching preclusion and conditional matching preclusion problems for the folded Petersen cube. 30-44 - Farn Wang, Sven Schewe, Jung-Hsuan Wu:
Complexity of node coverage games. 45-60 - Naonori Kakimura, Ken-ichi Kawarabayashi:
Fixed-parameter tractability for subset feedback set problems with parity constraints. 61-76 - Sam Buss:
Quasipolynomial size proofs of the propositional pigeonhole principle. 77-84 - Pavel Klavík, Jan Kratochvíl, Yota Otachi, Toshiki Saitoh:
Extending partial representations of subclasses of chordal graphs. 85-101 - Michael R. Fellows, Uéverton dos Santos Souza, Fábio Protti, Maise Dantas da Silva:
Tractability and hardness of flood-filling games on trees. 102-116
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.