@article{Ballerstein-Theis/14,
AUTHOR = {Ballerstein, Kathrin and Theis, Dirk Oliver},
TITLE = {An algorithm for random signed 3-SAT with intervals},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {524},
PAGES = {1-26},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {random constraint satisfaction problems, signed satisfiability},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513007974},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Le-Pfender/14,
AUTHOR = {Le, Van Bang and Pfender, Florian},
TITLE = {Complexity results for rainbow matchings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {524},
PAGES = {27-33},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {rainbow matching, computational complexity, np-completeness, apx-completeness, parameterized complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513009250},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Calamoneri-Petreschi/14,
AUTHOR = {Calamoneri, T. and Petreschi, R.},
TITLE = {On pairwise compatibility graphs having Dilworth number two},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {524},
PAGES = {34-40},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {pairwise compatibility graphs, dilworth number, leaf power graphs, minimum leaf power graphs, threshold signed graphs, split permutation graphs, interval graphs},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513009274},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Blanchet-Sadri-Chen-Munteanu/14,
AUTHOR = {Blanchet-Sadri, F. and Chen, Bob and Munteanu, Sinziana},
TITLE = {Recurrence in infinite partial words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {524},
PAGES = {41-47},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automata and formal languages, combinatorics on words, partial words, recurrent words, recurrence quotient, recurrence function},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513009286},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kobert-Hauser-Stamatakis/14,
AUTHOR = {Kobert, Kassian and Hauser, J{\"o}rg and Stamatakis, Alexandros},
TITLE = {Is the Protein Model Assignment problem under linked branch lengths NP-hard?},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {524},
PAGES = {48-58},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {np-hard, model selection, phylogenetics, maximum likelihood, phylogenomics},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514000140},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dieudonne-Pelc/14,
AUTHOR = {Dieudonn{\'e}, Yoann and Pelc, Andrzej},
TITLE = {Price of asynchrony in mobile agents computing},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {524},
PAGES = {59-67},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {asynchronous, synchronous, mobile agent, network, rendezvous, deterministic algorithm, cost},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514000152},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yu-Yang-He-Zhang/14,
AUTHOR = {Yu, Cui and Yang, Xiaofan and He, Li and Zhang, Jing},
TITLE = {Optimal wavelength assignment in the implementation of parallel algorithms with ternary $n$-cube communication pattern on mesh optical network},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {524},
PAGES = {68-77},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {wdm optical networks, mesh, ternary n-cube, routing and wavelength assignment, congestion},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514000206},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wei-Shan-Kang/14,
AUTHOR = {Wei, Qi and Shan, Erfang and Kang, Liying},
TITLE = {A FPTAS for a two-stage hybrid flow shop problem and optimal algorithms for identical jobs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {524},
PAGES = {78-89},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling, fully polynomial time approximation, two-stage flow shop, makespan},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514000218},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Mahajan-Rao-Sreenivasaiah/14a,
AUTHOR = {Mahajan, Meena and Rao, B.V. Raghavendra and Sreenivasaiah, Karteek},
TITLE = {Monomials, multilinearity and identity testing in simple read-restricted circuits},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {524},
PAGES = {90-102},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {arithmetic circuits, computational complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S030439751400022X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Rybarczyk/14,
AUTHOR = {Rybarczyk, Katarzyna},
TITLE = {Constructions of independent sets in random intersection graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {524},
PAGES = {103-125},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {random intersection graph, independent (stable) set, greedy algorithm},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514000231},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Eirinakis-Magos-Mourtos/14a,
AUTHOR = {Eirinakis, Pavlos and Magos, Dimitrios and Mourtos, Ioannis},
TITLE = {Blockers and antiblockers of stable matchings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {524},
PAGES = {126-133},
YEAR = {2014},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {stable matching, matroid-kernel, polytope, polynomial algorithm, rotation},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513009298},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}