default search action
Theoretical Computer Science, Volume 518
Volume 518, January 2014
- Huijuan Wang, Bin Liu, Jianliang Wu, Guizhen Liu:
Total coloring of embedded graphs with maximum degree at least seven. 1-9 - Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting:
Constant-competitive tree node assignment. 10-21 - Weifan Wang, Stephen Finbow, Jiangxu Kong:
The 2-surviving rate of planar graphs without 6-cycles. 22-31 - Weizhong Luo, Jianxin Wang, Jiong Guo, Jianer Chen:
Parameterized complexity of Max-lifetime Target Coverage in wireless sensor networks. 32-41 - Edita Pelantová
, Stepán Starosta:
Palindromic richness for languages invariant under more symmetries. 42-63 - Carmine Ventre
Truthful optimization using mechanisms with verification. 64-79 - Daniel Reidenbach, Markus L. Schmid:
Regular and context-free pattern languages over small alphabets. 80-95 - Martin Olsen
On the approximability of the link building problem. 96-116
- Long Wan, Ran Ma, Jinjiang Yuan:
Primary-secondary bicriteria scheduling on identical machines to minimize the total completion time of all jobs and the maximum T-time of all machines. 117-123 - Jian-Liang Wu, Ling Xue:
Edge colorings of planar graphs without 5-cycles with two chords. 124-127 - Salvatore Ruggieri, Pavlos Eirinakis, K. Subramani
On the complexity of quantified linear systems. 128-134
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.
last updated on 2024-12-26 00:36 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: