Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 554
Volume 554, October 2014
Editorial
- Ding-Zhu Du, Guochuan Zhang:
Computing and Combinatorics. 1
- Hongbiao Gao, Yuichi Goto
, Jingde Cheng:
A systematic methodology for automated theorem finding. 2-21 - Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovic, Sacha Krug, Björn Steffen:
On the advice complexity of the online L(2, 1)-coloring problem on paths and cycles. 22-39 - Pavol Hell, Aurosish Mishra:
H-coloring degree-bounded (acyclic) digraphs. 40-49 - Joshua Baron, Yuval Ishai, Rafail Ostrovsky:
On linear-size pseudorandom generators and hardcore functions. 50-63 - Amr Elmasry, Daniel Dahl Juhl, Jyrki Katajainen, Srinivasa Rao Satti:
Selection from read-only memory with limited workspace. 64-73 - Yasuaki Kobayashi, Hirokazu Maruta, Yusuke Nakae, Hisao Tamaki:
A linear edge kernel for two-layer crossing minimization. 74-81 - Vladimir Braverman, Ran Gelles, Rafail Ostrovsky:
How to catch L2-heavy-hitters on sliding windows. 82-94 - Hans-Joachim Böckenhauer, Juraj Hromkovic, Dennis Komm, Sacha Krug, Jasmin Smula, Andreas Sprock:
The string guessing problem as a method to prove lower bounds on the advice complexity. 95-108 - Miroslav Chlebík, Janka Chlebíková:
Connection between conjunctive capacity and structural properties of graphs. 109-118 - Jasine Babu, Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad:
2-Connecting outerplanar graphs without blowing up the pathwidth. 119-134 - Yong Zhang, Francis Y. L. Chin, Hing-Fung Ting, Xin Han, Chung Keung Poon, Yung H. Tsin, Deshi Ye:
Online algorithms for 1-space bounded 2-dimensional bin packing and square packing. 135-149 - Yu-An Lin, Sheung-Hung Poon:
Non-planar square-orthogonal drawing with few-bend edges. 150-168 - Zhenhua Duan, Cong Tian:
A practical decision procedure for Propositional Projection Temporal Logic with infinite models. 169-190 - Zhigang Cao, Xujin Chen, Changjun Wang:
Schedules for marketing products with negative externalities. 191-206 - Feng Shi, Jianxin Wang, Jianer Chen, Qilong Feng, Jiong Guo:
Algorithms for parameterized maximum agreement forest problem on multiple trees. 207-216 - Bernard Mans, Luke Mathieson:
On the treewidth of dynamic graphs. 217-228 - Nan Zhang, Zhenhua Duan, Cong Tian, Ding-Zhu Du:
A formal proof of the deadline driven scheduler in PPTL axiomatic system. 229-253 - Otfried Cheong, Radwa El Shawi, Joachim Gudmundsson:
A fast algorithm for data collection along a fixed track. 254-262 - Konstantinos Georgiou, George Karakostas, Jochen Könemann, Zuzanna Stamirowska:
Social exchange networks with distant bargaining. 263-274 - Weitian Tong, Randy Goebel, Guohui Lin:
Approximating the minimum independent dominating set in perturbed graphs. 275-282
a service of 
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-04-22 20:02 CEST 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:
