@article{Gao-Goto-Cheng/14,
AUTHOR = {Gao, Hongbiao and Goto, Yuichi and Cheng, Jingde},
TITLE = {A systematic methodology for automated theorem finding},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {554},
PAGES = {2-21},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {automated theorem finding, forward deduction, strong relevant logic, nbg set theory, peano's arithmetic},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514004642},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bianchi-Bockenhauer-Hromkovic-Krug-Steffen/14,
AUTHOR = {Bianchi, Maria Paola and B{\"o}ckenhauer, Hans-Joachim and Hromkovi{\v{c}}, Juraj and Krug, Sacha and Steffen, Bj{\"o}rn},
TITLE = {On the advice complexity of the online $L(2,1)$-coloring problem on paths and cycles},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {554},
PAGES = {22-39},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {online coloring, frequency assignment, advice complexity, randomized algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514004630},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hell-Mishra/14,
AUTHOR = {Hell, Pavol and Mishra, Aurosish},
TITLE = {$H$-coloring degree-bounded (acyclic) digraphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {554},
PAGES = {40-49},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {coloring, homomorphism, acyclic digraph, degree-bounded digraph},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514004381},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Baron-Ishai-Ostrovsky/14,
AUTHOR = {Baron, Joshua and Ishai, Yuval and Ostrovsky, Rafail},
TITLE = {On linear-size pseudorandom generators and hardcore functions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {554},
PAGES = {50-63},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {cryptography, circuit complexity, pseudorandom generators, one-way functions},
URL = {http://www.sciencedirect.com/science/article/pii/S030439751400437X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Elmasry-Juhl-Katajainen-Satti/14,
AUTHOR = {Elmasry, Amr and Juhl, Daniel Dahl and Katajainen, Jyrki and Satti, Srinivasa Rao},
TITLE = {Selection from read-only memory with limited workspace},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {554},
PAGES = {64-73},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {selection algorithm, read-only memory, random-access machine, multi-pass streaming, bit vector, wavelet stack},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514004368},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kobayashi-Maruta-Nakae-Tamaki/14,
AUTHOR = {Kobayashi, Yasuaki and Maruta, Hirokazu and Nakae, Yusuke and Tamaki, Hisao},
TITLE = {A linear edge kernel for two-layer crossing minimization},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {554},
PAGES = {74-81},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {crossing minimization, fixed parameter tractable, graph drawing, kernelization, two-layer drawing},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514004332},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Braverman-Gelles-Ostrovsky/14,
AUTHOR = {Braverman, Vladimir and Gelles, Ran and Ostrovsky, Rafail},
TITLE = {How to catch $L_2$-heavy-hitters on sliding windows},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {554},
PAGES = {82-94},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {data streams, approximation algorithms, heavy hitters, sliding window model},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514004320},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bockenhauer-Hromkovic-Komm-Krug-Smula-Sprock/14,
AUTHOR = {B{\"o}ckenhauer, Hans-Joachim and Hromkovi{\v{c}}, Juraj and Komm, Dennis and Krug, Sacha and Smula, Jasmin and Sprock, Andreas},
TITLE = {The string guessing problem as a method to prove lower bounds on the advice complexity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {554},
PAGES = {95-108},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {online algorithms, competitive analysis, advice complexity, online set cover, online clique},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514004307},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chlebik-Chlebikova/14,
AUTHOR = {Chleb{\'{i}}k, Miroslav and Chleb{\'{i}}kov{\'a}, Janka},
TITLE = {Connection between conjunctive capacity and structural properties of graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {554},
PAGES = {109-118},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {graph capacities, compound channel, shannon capacity for graph families, fractional vertex cover, binding number, strong crown decomposition},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514003491},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Babu-Basavaraju-Chandran-Rajendraprasad/14,
AUTHOR = {Babu, Jasine and Basavaraju, Manu and Chandran, L. Sunil and Rajendraprasad, Deepak},
TITLE = {2-connecting outerplanar graphs without blowing up the pathwidth},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {554},
PAGES = {119-134},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {pathwidth, outerplanar graph, 2-vertex-connected},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514003375},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Chin-Ting-Han-Poon-Tsin-Ye/14,
AUTHOR = {Zhang, Yong and Chin, Francis Y.L. and Ting, Hing-Fung and Han, Xin and Poon, Chung Keung and Tsin, Yung H. and Ye, Deshi},
TITLE = {Online algorithms for 1-space bounded 2-dimensional bin packing and square packing},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {554},
PAGES = {135-149},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {competitive analysis, two dimensional bin packing, square packing},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514001716},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lin-Poon/14,
AUTHOR = {Lin, Yu-An and Poon, Sheung-Hung},
TITLE = {Non-planar square-orthogonal drawing with few-bend edges},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {554},
PAGES = {150-168},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {square-orthogonal drawing, bend number, non-planar drawing, np-completeness},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514001054},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Duan-Tian/14,
AUTHOR = {Duan, Zhenhua and Tian, Cong},
TITLE = {A practical decision procedure for Propositional Projection Temporal Logic with infinite models},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {554},
PAGES = {169-190},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {decision procedure, propositional projection temporal logic, b{\"u}chi accepting condition, automata, algorithm},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514001042},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cao-Chen-Wang/14,
AUTHOR = {Cao, Zhigang and Chen, Xujin and Wang, Changjun},
TITLE = {Schedules for marketing products with negative externalities},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {554},
PAGES = {191-206},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {negative externality, social network, efficient algorithm, marketing schedule, regret-proof schedule},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514000255},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Shi-Wang-Chen-Feng-Guo/14,
AUTHOR = {Shi, Feng and Wang, Jianxin and Chen, Jianer and Feng, Qilong and Guo, Jiong},
TITLE = {Algorithms for parameterized maximum agreement forest problem on multiple trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {554},
PAGES = {207-216},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {fixed-parameter tractability, phylogenetic tree, maximum agreement forest},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514000176},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mans-Mathieson/14,
AUTHOR = {Mans, Bernard and Mathieson, Luke},
TITLE = {On the treewidth of dynamic graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {554},
PAGES = {217-228},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {dynamic graphs, metatheorems, treewidth, local treewidth, bounded expansion},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514000164},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Zhang-Duan-Tian-Du/14,
AUTHOR = {Zhang, Nan and Duan, Zhenhua and Tian, Cong and Du, Dingzhu},
TITLE = {A formal proof of the deadline driven scheduler in PPTL axiomatic system},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {554},
PAGES = {229-253},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {theorem proving, projection temporal logic, deadline driven scheduler, real-time},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513009262},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cheong-Shawi-Gudmundsson/14,
AUTHOR = {Cheong, O. and Shawi, R. El and Gudmundsson, J.},
TITLE = {A fast algorithm for data collection along a fixed track},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {554},
PAGES = {254-262},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {wireless sensor networks, computational geometry, abstract voronoi diagram},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008931},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Georgiou-Karakostas-Konemann-Stamirowska/14,
AUTHOR = {Georgiou, Konstantinos and Karakostas, George and K{\"o}nemann, Jochen and Stamirowska, Zuzanna},
TITLE = {Social exchange networks with distant bargaining},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {554},
PAGES = {263-274},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {bargaining, exchange networks, cooperative games},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008773},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tong-Goebel-Lin/14a,
AUTHOR = {Tong, Weitian and Goebel, Randy and Lin, Guohui},
TITLE = {Approximating the minimum independent dominating set in perturbed graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {554},
PAGES = {275-282},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {independent set, independent dominating set, dominating set, approximation algorithm, perturbed graph, smooth analysis},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513008414},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}