default search action
Theoretical Computer Science, Volume 524
Volume 524, March 2014
- Kathrin Ballerstein, Dirk Oliver Theis:
An algorithm for random signed 3-SAT with intervals. 1-26 - Van Bang Le, Florian Pfender:
Complexity results for rainbow matchings. 27-33 - Tiziana Calamoneri, Rossella Petreschi:
On pairwise compatibility graphs having Dilworth number two. 34-40 - Francine Blanchet-Sadri, Bob Chen, Sinziana Munteanu:
Recurrence in infinite partial words. 41-47 - Kassian Kobert, Jörg Hauser, Alexandros Stamatakis:
Is the Protein Model Assignment problem under linked branch lengths NP-hard? 48-58 - Yoann Dieudonné, Andrzej Pelc:
Price of asynchrony in mobile agents computing. 59-67 - Cui Yu, Xiaofan Yang, Li He, Jing Zhang:
Optimal wavelength assignment in the implementation of parallel algorithms with ternary n-cube communication pattern on mesh optical network. 68-77 - Qi Wei, Erfang Shan, Liying Kang:
A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs. 78-89 - Meena Mahajan, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
Monomials, multilinearity and identity testing in simple read-restricted circuits. 90-102 - Katarzyna Rybarczyk:
Constructions of independent sets in random intersection graphs. 103-125
- Pavlos Eirinakis, Dimitris Magos, Ioannis Mourtos:
Blockers and antiblockers of stable matchings. 126-133
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.