default search action
Theoretical Computer Science, Volume 778
Volume 778, July 2019
- Xiao Zhao, Sheng Chen:
Proper 2-coloring game on some trees. 1-18 - Yiannis Giannakopoulos, Elias Koutsoupias, Maria Kyropoulou:
The anarchy of scheduling without money. 19-32 - Jeffery Kline:
Geometric search for Hadamard matrices. 33-46 - Mohan Chris Monica, Samivel Santhakumar, Micheal Arockiaraj, Jia-Bao Liu:
Partition dimension of certain classes of series parallel graphs. 47-60 - Mong-Jen Kao, Jia-Yau Shiau, Ching-Chi Lin, D. T. Lee:
Tight approximation for partial vertex cover with hard capacities. 61-72 - István Heckenberger, Joe Sawada:
A Pascal-like bound for the number of necklaces with fixed density. 73-77 - Paul M. B. Vitányi:
Logical depth for reversible Turing machines with an application to the rate of decrease in logical depth for general Turing machines. 78-80
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.