default search action
Theoretical Computer Science, Volume 746
Volume 746, October 2018
- Rongxing Xu, Xuding Zhu:
Bounded Greedy Nim. 1-5 - Ilan Komargodski:
Leakage resilient one-way functions: The auxiliary-input setting. 6-18 - Laurent Beaudou, Pierre Coupechoux, Antoine Dailly, Sylvain Gravier, Julien Moncel, Aline Parreau, Éric Sopena:
Octal games on graphs: The game 0.33 on subdivided stars and bistars. 19-35 - Sancrey Rodrigues Alves, Konrad K. Dabrowski, Luérbio Faria, Sulamita Klein, Ignasi Sau, Uéverton S. Souza:
On the (parameterized) complexity of recognizing well-covered (r, ℓ)-graph. 36-48 - Öznur Yasar Diner, Daniël Paulusma, Christophe Picouleau, Bernard Ries:
Contraction and deletion blockers for perfect graphs and H-free graphs. 49-72 - Vittorio Bilò, Angelo Fanelli, Luca Moscardelli:
Opinion formation games with dynamic social influences. 73-87 - Yusuke Kobayashi:
NP-hardness and fixed-parameter tractability of the minimum spanner problem. 88-97 - Sudip Biswas, Arnab Ganguly, Rahul Shah, Sharma V. Thankachan:
Ranked document retrieval for multiple patterns. 98-111 - Jørgen Bang-Jensen, Tilde My Christiansen:
Degree constrained 2-partitions of semicomplete digraphs. 112-123 - Dieter Mitsche, Pawel Pralat, Elham Roshanbin:
Burning number of graph products. 124-135 - Oscar H. Ibarra:
Grammatical characterizations of NPDAs and VPDAs with counters. 136-150
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.