default search action
Theoretical Computer Science, Volume 990
Volume 990, 2024
- Lorenzo Capra, Michael Köhler-Bußmeier:
Modular rewritable Petri nets: An efficient model for dynamic distributed systems. 114397 - Viliam Geffert, Dominika Palisínová, Alexander Szabari:
State complexity of binary coded regular languages. 114399 - Ankush Acharyya, Vahideh Keikha, Diptapriyo Majumdar, Supantha Pandit:
Constrained hitting set problem with intervals: Hardness, FPT and approximation algorithms. 114402 - Carl Feghali, Malory Marin:
Three remarks on W graphs. 114403 - Andreas Brandstädt, Raffaele Mosca:
Finding dominating induced matchings in P10-free graphs in polynomial time. 114404 - Julien Baste, Dimitri Watel:
An FPT algorithm for node-disjoint subtrees problems parameterized by treewidth. 114406 - Luping Wang, Jie Chen, Huan Dai, Chongben Tao:
Efficient code-based fully dynamic group signature scheme. 114407 - Preface: Special issue on theoretical aspects of computing. 114408
- Yishuo Shi, Xiaoyan Lai:
Approximation algorithm of maximizing non-monotone non-submodular functions under knapsack constraint. 114409 - Éric Duchêne, Valentin Gledel, Sylvain Gravier, Fionn Mc Inerney, Mehdi Mhalla, Aline Parreau:
Smash and grab: The 0 ⋅ 6 scoring game on graphs. 114417
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.