


default search action
Theoretical Computer Science, Volume 890
Volume 890, October 2021
- Xin Sun, Dachuan Xu

, Longkun Guo, Min Li:
Deterministic approximation algorithm for submodular maximization subject to a matroid constraint. 1-15 - Frank Gurski, Dominique Komander, Marvin Lindemann:

Efficient computation of the oriented chromatic number of recursively defined digraphs. 16-35 - Ronny Tredup, Evgeny Erofeev:

On the parameterized complexity of the synthesis of Boolean nets with restricted place environments. 36-69 - Piotr Wojciechowski

, K. Subramani
:
Copy complexity of Horn formulas with respect to unit read-once resolution. 70-86 - Jasine Babu, Veena Prabhakaran

, Arko Sharma:
A substructure based lower bound for eternal vertex cover number. 87-104 - Francesco Arena, Miriam Di Ianni:

Complexity of Scorpion Solitaire and applications to Klondike. 105-124 - Ruggero Lanotte

, Massimo Merro, Andrei Munteanu:
A process calculus approach to detection and mitigation of PLC malware. 125-146 - Stefan Hoffmann

:
Constrained synchronization and commutativity. 147-170 - Murad Tukan

, Cenk Baykal
, Dan Feldman, Daniela Rus:
On coresets for support vector machines. 171-191 - Haitao Wang, Yiming Zhao:

Algorithms for diameters of unicycle graphs and diameter-optimally augmenting trees. 192-209 - Bin Fu, Pengfei Gu, Yuming Zhao:

Approximate set union via approximate randomization. 210-239

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














