@article{Heggernes-Papadopoulos/09,
AUTHOR = {Heggernes, Pinar and Papadopoulos, Charis},
TITLE = {Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {1},
PAGES = {1-15},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Choffrut-Grigorieff/09,
AUTHOR = {Choffrut, Christian and Grigorieff, Serge},
TITLE = {Finite $n$-tape automata over possibly infinite alphabets: Extending a theorem of Eilenberg et al.},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {1},
PAGES = {16-34},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Currie-Aberkane/09,
AUTHOR = {Currie, James D. and Aberkane, Ali},
TITLE = {A cyclic binary morphism avoiding Abelian fourth powers},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {1},
PAGES = {44-52},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fellows-Hermelin-Rosamond-Vialette/09,
AUTHOR = {Fellows, Michael R. and Hermelin, Danny and Rosamond, Frances and Vialette, St{\'{e}}phane},
TITLE = {On the parameterized complexity of multiple-interval graph problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {1},
PAGES = {53-61},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Baswana-Goyal-Sen/09,
AUTHOR = {Baswana, Surender and Goyal, Vishrut and Sen, Sandeep},
TITLE = {All-pairs nearly 2-approximate shortest paths in $O(n^2$polylog $n)$ time},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {1},
PAGES = {84-93},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ikeda-Kubo-Yamashita/09,
AUTHOR = {Ikeda, Satoshi and Kubo, Izumi and Yamashita, Masafumi},
TITLE = {The hitting and cover times of random walks on finite graphs using local degree information},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {1},
PAGES = {94-100},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Faliszewski-Hemaspaandra/09,
AUTHOR = {Faliszewski, Piotr and Hemaspaandra, Lane},
TITLE = {The complexity of power-index comparison},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {1},
PAGES = {101-107},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bidinger-Compagnoni/09,
AUTHOR = {Bidinger, Philippe and Compagnoni, Adriana},
TITLE = {Pict correctness revisited},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {2-3},
PAGES = {114-127},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Capecchi-Coppo-Dezani-Ciancaglini-Drossopoulou-Giachino/09,
AUTHOR = {Capecchi, Sara and Coppo, Mario and Dezani-Ciancaglini, Mariangiola and Drossopoulou, Sophia and Giachino, Elena},
TITLE = {Amalgamating sessions and methods in object-oriented languages with generics},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {2-3},
PAGES = {142-167},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Field-Marinescu-Stefansen/09,
AUTHOR = {Field, John and Marinescu, Maria-Cristina and Stefansen, Christian},
TITLE = {Reactors: A data-oriented synchronous/asynchronous programming model for distributed applications},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {2-3},
PAGES = {168-201},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Haller-Odersky/09,
AUTHOR = {Haller, Philipp and Odersky, Martin},
TITLE = {Scala Actors: Unifying thread-based and event-based programming},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {2-3},
PAGES = {202-220},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jacquet-Linden/09,
AUTHOR = {Jacquet, Jean-Marie and Linden, Isabelle},
TITLE = {Fully abstract models and refinements as tools to compare agents in timed coordination languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {2-3},
PAGES = {221-253},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Busi-Zandron/09,
AUTHOR = {Busi, Nadia and Zandron, Claudio},
TITLE = {Computational expressiveness of Genetic Systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {4-5},
PAGES = {286-293},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Condon-Jabbari/09,
AUTHOR = {Condon, Anne and Jabbari, Hosna},
TITLE = {Computational prediction of nucleic acid secondary structure: Methods, applications, and challenges},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {4-5},
PAGES = {294-301},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{DHondt/09,
AUTHOR = {D'Hondt, Ellie},
TITLE = {Quantum approaches to graph colouring},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {4-5},
PAGES = {302-309},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ehrenfeucht-Rozenberg/09,
AUTHOR = {Ehrenfeucht, A. and Rozenberg, G.},
TITLE = {Introducing time in reaction systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {4-5},
PAGES = {310-322},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Garzillo-Trautteur/09,
AUTHOR = {Garzillo, Carmine and Trautteur, Giuseppe},
TITLE = {Computational virtuality in biological systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {4-5},
PAGES = {323-331},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jonoska-McColm/09,
AUTHOR = {Jonoska, Nata{\v{s}}a and McColm, Gregory L.},
TITLE = {Complexity classes for self-assembling flexible tiles},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {4-5},
PAGES = {332-346},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kjos-Hanssen-Nerode/09,
AUTHOR = {Kjos-Hanssen, Bj{\o}rn and Nerode, Anil},
TITLE = {Effective dimension of points visited by Brownian motion},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {4-5},
PAGES = {347-354},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Krishna/09,
AUTHOR = {Krishna, Shankara Narayanan},
TITLE = {Membrane computing with transport and embedded proteins},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {4-5},
PAGES = {355-375},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ladyman/09,
AUTHOR = {Ladyman, James},
TITLE = {What does it mean to say that a physical system implements a computation?},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {4-5},
PAGES = {376-383},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Awerbuch-Scheideler/09,
AUTHOR = {Awerbuch, Baruch and Scheideler, Christian},
TITLE = {Robust random number generation for peer-to-peer systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {6-7},
PAGES = {453-466},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bazzi-Choi-Gouda/09,
AUTHOR = {Bazzi, Rida A. and Choi, Young-ri and Gouda, Mohamed G.},
TITLE = {Hop chains: Secure routing and the establishment of distinct identities},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {6-7},
PAGES = {467-480},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Czyzowicz-Gasieniec-Pelc/09,
AUTHOR = {Czyzowicz, Jurek and G{\c{a}}sieniec, Leszek and Pelc, Andrzej},
TITLE = {Gathering few fat mobile robots in the plane},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {6-7},
PAGES = {481-499},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Demirbas-Arora-Kulathumani/09,
AUTHOR = {Demirbas, Murat and Arora, Anish and Kulathumani, Vinodkrishnan},
TITLE = {GLANCE: A lightweight querying service for wireless sensor networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {6-7},
PAGES = {500-513},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dolev-Tzachar/09,
AUTHOR = {Dolev, Shlomi and Tzachar, Nir},
TITLE = {Empire of colonies: Self-stabilizing and self-organizing distributed algorithm},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {6-7},
PAGES = {514-532},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Englert/09,
AUTHOR = {Englert, Burkhard},
TITLE = {On the cost of uniform protocols whose memory consumption is adaptive to interval contention},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {6-7},
PAGES = {533-545},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gilbert-Guerraoui-Newport/09,
AUTHOR = {Gilbert, Seth and Guerraoui, Rachid and Newport, Calvin},
TITLE = {Of malicious motes and suspicious sensors: On the efficiency of malicious interference in wireless networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {6-7},
PAGES = {546-569},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Guerraoui-Herlihy-Pochon/09,
AUTHOR = {Guerraoui, Rachid and Herlihy, Maurice and Pochon, Bastian},
TITLE = {A topological treatment of early-deciding set-agreement},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {6-7},
PAGES = {570-580},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Johnen-Nguyen/09,
AUTHOR = {Johnen, Colette and Nguyen, Le Huy},
TITLE = {Robust self-stabilizing weight-based clustering algorithm},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {6-7},
PAGES = {581-594},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kiwi-Soto-Thraves/09,
AUTHOR = {Kiwi, M. and Soto, M. and Thraves, C.},
TITLE = {Adversarial queuing theory with setups},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {670-687},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gao/09,
AUTHOR = {Gao, Yong},
TITLE = {The degree distribution of random $k$-trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {688-695},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Djelloul/09,
AUTHOR = {Djelloul, Selma},
TITLE = {Treewidth and logical definability of graph products},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {696-710},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bein-Larmore-Morales-Sudborough/09,
AUTHOR = {Bein, Wolfgang W. and Larmore, Lawrence L. and Morales, Linda and Sudborough, I. Hal},
TITLE = {A quadratic time 2-approximation algorithm for block sorting},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {711-717},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Guo/09,
AUTHOR = {Guo, Jiong},
TITLE = {A more effective linear kernelization for cluster editing},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {718-726},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kaporis-Spirakis/09,
AUTHOR = {Kaporis, A.C. and Spirakis, P.G.},
TITLE = {The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {745-755},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dai-Yu/09,
AUTHOR = {Dai, Decheng and Yu, Changyuan},
TITLE = {A $5 + \epsilon$-approximation algorithm for minimum weighted dominating set in unit disk graph},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {756-765},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Blanchet-Sadri-Mercas-Scott/09,
AUTHOR = {Blanchet-Sadri, F. and Merca{\c{s}}, Robert and Scott, Geoffrey},
TITLE = {A generalization of Thue freeness for partial words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {793-800},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kung-Lin-Liang-Hsu-Tan/09,
AUTHOR = {Kung, Tzu-Liang and Lin, Cheng-Kuan and Liang, Tyne and Hsu, Lih-Hsing and Tan, Jimmy J.M.},
TITLE = {On the bipanpositionable bipanconnectedness of hypercubes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {801-811},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Kanj-Meng-Xia-Zhang/09,
AUTHOR = {Chen, Jianer and Kanj, Iyad A. and Meng, Jie and Xia, Ge and Zhang, Fenghui},
TITLE = {On the pseudo-achromatic number problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {818-829},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bouvel-Rossin/09,
AUTHOR = {Bouvel, Mathilde and Rossin, Dominique},
TITLE = {A variant of the tandem duplication --- Random loss model of genome rearrangement},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {847-858},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Asodi-Umans/09,
AUTHOR = {Asodi, Vera and Umans, Christopher},
TITLE = {The complexity of the matroid-greedoid partition problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {859-866},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chan-Ku-Lu-Wang/09,
AUTHOR = {Chan, Chi-Yuan and Ku, Shan-Chyun and Lu, Chi-Jen and Wang, Biing-Feng},
TITLE = {Efficient algorithms for two generalized 2-median problems and the group median problem on trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {867-876},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ferrante-Parlato-Sorrentino-Ventre/09,
AUTHOR = {Ferrante, Alessandro and Parlato, Gennaro and Sorrentino, Francesco and Ventre, Carmine},
TITLE = {Fast payment schemes for truthful mechanisms with verification},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {886-899},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Koga/09,
AUTHOR = {Koga, Hisashi},
TITLE = {Dynamic TCP acknowledgment with sliding window},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {914-925},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hsieh-Tu/09,
AUTHOR = {Hsieh, Sun-Yuan and Tu, Chang-Jen},
TITLE = {Constructing edge-disjoint spanning trees in locally twisted cubes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {926-932},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kontogiannis-Spirakis/09,
AUTHOR = {Kontogiannis, Spyros C. and Spirakis, Paul G.},
TITLE = {On the support size of stable strategies in random games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {933-942},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Halava-Harju-Karki-Seebold/09,
AUTHOR = {Halava, Vesa and Harju, Tero and K{\"{a}}rki, Tomi and S{\'{e}}{\'{e}}bold, Patrice},
TITLE = {Overlap-freeness in infinite partial words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {943-948},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cardinal-Langerman-Levy/09,
AUTHOR = {Cardinal, Jean and Langerman, Stefan and Levy, Eythan},
TITLE = {Improved approximation bounds for edge dominating set in dense graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {949-957},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gagie/09a,
AUTHOR = {Gagie, Travis},
TITLE = {Compressed depth sequences},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {958-962},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hong-Park-Chang/09,
AUTHOR = {Hong, Sung-Pil and Park, Myoung-Ju and Chang, Soo Y.},
TITLE = {Approximation of the $k$-batch consolidation problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {963-967},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Blanchet-Sadri-Jungers-Palumbo/09,
AUTHOR = {Blanchet-Sadri, F. and Jungers, Rapha{\"e}l M. and Palumbo, Justin},
TITLE = {Testing avoidability on sets of partial words is hard},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {968-972},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Honkala/09a,
AUTHOR = {Honkala, Juha},
TITLE = {On the simplification of infinite morphic words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {8-10},
PAGES = {997-1000},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Danos-Schumacher/09,
AUTHOR = {Danos, Vincent and Schumacher, Linus J.},
TITLE = {How liquid is biological signalling?},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {11},
PAGES = {1003-1012},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Feng-Zhang-Wang/09,
AUTHOR = {Feng, Wangsen and Zhang, Li'ang and Wang, Hanpin},
TITLE = {Approximation algorithm for maximum edge coloring},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {11},
PAGES = {1022-1029},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jakoby-Liskiewicz-Reischuk-Schindelhauer/09,
AUTHOR = {Jakoby, Andreas and Li{\'s}kiewicz, Maciej and Reischuk, R{\"{u}}diger and Schindelhauer, Christian},
TITLE = {Improving the average delay of sorting},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {11},
PAGES = {1030-1041},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kawaguchi-Nagamochi/09,
AUTHOR = {Kawaguchi, Akifumi and Nagamochi, Hiroshi},
TITLE = {Drawing slicing graphs with face areas},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {11},
PAGES = {1061-1072},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gumm/09,
AUTHOR = {Gumm, H. Peter},
TITLE = {Copower functors},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {12-13},
PAGES = {1129-1142},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bova-Montagna/09,
AUTHOR = {Bova, Simone and Montagna, Franco},
TITLE = {The consequence relation in the logic of commutative GBL-algebras is PSPACE-complete},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {12-13},
PAGES = {1143-1158},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gabbay/09,
AUTHOR = {Gabbay, Murdoch J.},
TITLE = {A study of substitution, using nominal techniques and Fraenkel-Mostowksi sets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {12-13},
PAGES = {1159-1189},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bergstra-Hirshfeld-Tucker/09,
AUTHOR = {Bergstra, J.A. and Hirshfeld, Y. and Tucker, J.V.},
TITLE = {Meadows and the equational specification of division},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {12-13},
PAGES = {1261-1271},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kwiatkowska-Norman-Parker-Vigliotti/09,
AUTHOR = {Kwiatkowska, Marta and Norman, Gethin and Parker, David and Vigliotti, Maria Grazia},
TITLE = {Probabilistic Mobile Ambients},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {12-13},
PAGES = {1272-1303},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Broersma-Johnson-Paulusma/09,
AUTHOR = {Broersma, Hajo and Johnson, Matthew and Paulusma, Dani{\"e}l},
TITLE = {Upper bounds and algorithms for parallel knock-out numbers},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {14},
PAGES = {1319-1327},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gafni-Mostefaoui-Raynal-Travers/09,
AUTHOR = {Gafni, Eli and Most{\'{e}}faoui, Achour and Raynal, Michel and Travers, Corentin},
TITLE = {From adaptive renaming to set agreement},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {14},
PAGES = {1328-1335},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Korteweg-Marchetti-Spaccamela-Stougie-Vitaletti/09,
AUTHOR = {Korteweg, Peter and Marchetti-Spaccamela, Alberto and Stougie, Leen and Vitaletti, Andrea},
TITLE = {Data aggregation in sensor networks: Balancing communication and delay costs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {14},
PAGES = {1346-1354},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Efrima-Peleg/09,
AUTHOR = {Efrima, Asaf and Peleg, David},
TITLE = {Distributed algorithms for partitioning a swarm of autonomous mobile robots},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {14},
PAGES = {1355-1368},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Even-Levi-Litman/09,
AUTHOR = {Even, Guy and Levi, Tamir and Litman, Ami},
TITLE = {Optimal conclusive sets for comparator networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {14},
PAGES = {1369-1376},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kralovic-Kralovic/09,
AUTHOR = {Kr{\'{a}}lovi{\v{c}}, Rastislav and Kr{\'{a}}lovi{\v{c}}, Richard},
TITLE = {Rapid almost-complete broadcasting in faulty networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {14},
PAGES = {1377-1387},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Czyzowicz-Dobrev-Kranakis-Opatrny-Urrutia/09,
AUTHOR = {Czyzowicz, J. and Dobrev, S. and Kranakis, E. and Opatrny, J. and Urrutia, J.},
TITLE = {Local edge colouring of Yao-like subgraphs of Unit Disk Graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {14},
PAGES = {1388-1400},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Korman-Kutten/09,
AUTHOR = {Korman, Amos and Kutten, Shay},
TITLE = {A note on models for graph representations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {14},
PAGES = {1401-1412},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Greenberg-Randall/09,
AUTHOR = {Greenberg, Sam and Randall, Dana},
TITLE = {Convergence rates of Markov chains for some self-assembly and non-saturated Ising models},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {15},
PAGES = {1417-1427},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Grayson-Taormina-Twarock/09,
AUTHOR = {Grayson, N.E. and Taormina, A. and Twarock, R.},
TITLE = {DNA duplex cage structures with icosahedral symmetry},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {15},
PAGES = {1440-1447},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jonoska-Seeman-Wu/09,
AUTHOR = {Jonoska, Nata{\v{s}}a and Seeman, Nadrian C. and Wu, Gang},
TITLE = {On existence of reporter strands in DNA-based graph structures},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {15},
PAGES = {1448-1460},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brun-Reishus/09,
AUTHOR = {Brun, Yuriy and Reishus, Dustin},
TITLE = {Path finding in the tile assembly model},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {15},
PAGES = {1461-1472},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Anselmo-Madonia/09,
AUTHOR = {Anselmo, Marcella and Madonia, Maria},
TITLE = {Deterministic and unambiguous two-dimensional languages over one-letter alphabet},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {16},
PAGES = {1477-1485},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brijder-Hoogeboom/09,
AUTHOR = {Brijder, Robert and Hoogeboom, Hendrik Jan},
TITLE = {Perfectly quilted rectangular snake tilings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {16},
PAGES = {1486-1494},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Becker/09,
AUTHOR = {Becker, Florent},
TITLE = {Pictures worth a thousand tiles, a geometrical programming language for self-assembly},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {16},
PAGES = {1495-1515},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Goodman-Strauss/09,
AUTHOR = {Goodman-Strauss, Chaim},
TITLE = {Regular production systems and triangle tilings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {16},
PAGES = {1534-1549},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ackermann-Roglin-Vocking/09,
AUTHOR = {Ackermann, Heiner and R{\"{o}}glin, Heiko and V{\"{o}}cking, Berthold},
TITLE = {Pure Nash equilibria in player-specific and weighted congestion games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {17},
PAGES = {1552-1563},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bilo-Guala-Proietti/09,
AUTHOR = {Bil{\`{o}}, Davide and Gual{\`{a}}, Luciano and Proietti, Guido},
TITLE = {Dynamic mechanism design},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {17},
PAGES = {1564-1572},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Huang-Teng/09,
AUTHOR = {Chen, Xi and Huang, Li-Sha and Teng, Shang-Hua},
TITLE = {Market equilibria with hybrid linear-Leontief utilities},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {17},
PAGES = {1573-1580},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Daskalakis-Mehta-Papadimitriou/09,
AUTHOR = {Daskalakis, Constantinos and Mehta, Aranyak and Papadimitriou, Christos},
TITLE = {A note on approximate Nash equilibria},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {17},
PAGES = {1581-1588},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Immorlica-Li-Mirrokni-Schulz/09,
AUTHOR = {Immorlica, Nicole and Li, Li (Erran) and Mirrokni, Vahab S. and Schulz, Andreas S.},
TITLE = {Coordination mechanisms for selfish scheduling},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {17},
PAGES = {1589-1598},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kontogiannis-Panagopoulou-Spirakis/09,
AUTHOR = {Kontogiannis, Spyros C. and Panagopoulou, Panagiota N. and Spirakis, Paul G.},
TITLE = {Polynomial algorithms for approximating Nash equilibria of bimatrix games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {17},
PAGES = {1599-1606},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cai-Lu/09,
AUTHOR = {Cai, Jin-Yi and Lu, Pinyan},
TITLE = {Holographic algorithms: The power of dimensionality resolved},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {18},
PAGES = {1618-1628},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Larose-Tesson/09,
AUTHOR = {Larose, Beno{\^{i}}t and Tesson, Pascal},
TITLE = {Universal algebra and hardness results for constraint satisfaction problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {18},
PAGES = {1629-1647},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Blomer-Naewe/09,
AUTHOR = {Bl{\"{o}}mer, Johannes and Naewe, Stefanie},
TITLE = {Sampling methods for shortest vectors, closest vectors and successive minima},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {18},
PAGES = {1648-1665},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Atserias-Bulatov-Dawar/09,
AUTHOR = {Atserias, Albert and Bulatov, Andrei and Dawar, Anuj},
TITLE = {Affine systems of equations and counting infinitary logic},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {18},
PAGES = {1666-1683},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bodirsky-Chen-Kara-von_Oertzen/09,
AUTHOR = {Bodirsky, Manuel and Chen, Hubie and K{\'{a}}ra, Jan and von Oertzen, Timo},
TITLE = {Maximal infinite-valued constraint languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {18},
PAGES = {1684-1693},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Boigelot-Brusten/09,
AUTHOR = {Boigelot, Bernard and Brusten, Julien},
TITLE = {A generalization of Cobham's theorem to automata over real numbers},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {18},
PAGES = {1694-1703},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fiore-Hur/09,
AUTHOR = {Fiore, Marcelo and Hur, Chung-Kil},
TITLE = {On the construction of free algebras for equational systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {18},
PAGES = {1704-1729},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ishai-Malkin-Strauss-Wright/09,
AUTHOR = {Ishai, Yuval and Malkin, Tal and Strauss, Martin J. and Wright, Rebecca N.},
TITLE = {Private multiparty sampling and approximation of vector combinations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {18},
PAGES = {1730-1745},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chang/09a,
AUTHOR = {Chang, Kevin L.},
TITLE = {Multiple pass streaming algorithms for learning mixtures of distributions in $\mathbb {R}^d$},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {19},
PAGES = {1765-1780},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jain-Stephan-Ye/09,
AUTHOR = {Jain, Sanjay and Stephan, Frank and Ye, Nan},
TITLE = {Prescribed learning of r.e. classes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {19},
PAGES = {1796-1806},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Case-Moelius/09,
AUTHOR = {Case, John and Moelius III, Samuel E.},
TITLE = {Parallelism increases iterative learning power},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {19},
PAGES = {1863-1875},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Audibert-Munos-Szepesvari/09,
AUTHOR = {Audibert, Jean-Yves and Munos, R{\'{e}}mi and Szepesv{\'{a}}ri, Csaba},
TITLE = {Exploration-exploitation tradeoff using variance estimates in multi-armed bandits},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {19},
PAGES = {1876-1902},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Feldman-Shah/09,
AUTHOR = {Feldman, Vitaly and Shah, Shrenik},
TITLE = {Separating models of learning with faulty teachers},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {19},
PAGES = {1903-1912},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ambainis-Nahimovs/09,
AUTHOR = {Ambainis, Andris and Nahimovs, Nikolajs},
TITLE = {Improved constructions of quantum automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {20},
PAGES = {1916-1922},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Freivalds-Ozols-Mancinska/09,
AUTHOR = {Freivalds, R{\=u}si{\c{n}}{\v{s}} and Ozols, M{\=a}ris and Man{\v{c}}inska, Laura},
TITLE = {Improved constructions of mixed state quantum automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {20},
PAGES = {1923-1931},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Golovkins-Kravtsev-Kravcevs/09,
AUTHOR = {Golovkins, Marats and Kravtsev, Maksim and Kravcevs, Vasilijs},
TITLE = {On a class of languages recognizable by probabilistic reversible decide-and-halt automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {20},
PAGES = {1942-1951},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dzelme-Berzina/09,
AUTHOR = {Dzelme-B{\=e}rzi{\c{n}}a, Ilze},
TITLE = {Mathematical logic and quantum finite state automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {20},
PAGES = {1952-1959},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fraigniaud-Gavoille-Kosowski-Lebhar-Lotker/09,
AUTHOR = {Fraigniaud, Pierre and Gavoille, Cyril and Kosowski, Adrian and Lebhar, Emmanuelle and Lotker, Zvi},
TITLE = {Universal augmentation schemes for network navigability},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {21-23},
PAGES = {1970-1981},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Elias-Lagergren/09,
AUTHOR = {Elias, Isaac and Lagergren, Jens},
TITLE = {Fast neighbor joining},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {21-23},
PAGES = {1993-2000},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Glasser-Selman-Travers-Zhang/09,
AUTHOR = {Gla{\ss}er, Christian and Selman, Alan L. and Travers, Stephen and Zhang, Liyu},
TITLE = {Non-mitotic sets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {21-23},
PAGES = {2011-2023},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Schmidt-Samatova/09,
AUTHOR = {Chen, Wenbin and Schmidt, Matthew C. and Samatova, Nagiza F.},
TITLE = {On parameterized complexity of the Multi-MCS problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {21-23},
PAGES = {2024-2032},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Guignard-Sopena/09,
AUTHOR = {Guignard, Adrien and Sopena, {\'E}ric},
TITLE = {Compound Node-Kayles on paths},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {21-23},
PAGES = {2033-2044},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fleischner-Mujuni-Paulusma-Szeider/09,
AUTHOR = {Fleischner, Herbert and Mujuni, Egbert and Paulusma, Dani{\"e}l and Szeider, Stefan},
TITLE = {Covering graphs with few complete bipartite subgraphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {21-23},
PAGES = {2045-2053},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dantchev-Martin-Rhodes/09,
AUTHOR = {Dantchev, Stefan and Martin, Barnaby and Rhodes, Mark},
TITLE = {Tight rank lower bounds for the Sherali-Adams proof system},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {21-23},
PAGES = {2054-2063},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alcon-Faria-de_Figueiredo-Gutierrez/09,
AUTHOR = {Alc{\'o}n, Liliana and Faria, Luerbio and de Figueiredo, Celina M.H. and Gutierrez, Marisa},
TITLE = {The complexity of clique graph recognition},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {21-23},
PAGES = {2072-2083},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Goldstein/09,
AUTHOR = {Goldstein, Ilya},
TITLE = {Asymptotic subword complexity of fixed points of group substitutions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {21-23},
PAGES = {2084-2098},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Baldoni-Bonomi-Querzoni-Tucci_Piergiovanni/09,
AUTHOR = {Baldoni, Roberto and Bonomi, Silvia and Querzoni, Leonardo and Tucci Piergiovanni, Sara},
TITLE = {Investigating the existence and the regularity of Logarithmic Harary Graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {21-23},
PAGES = {2110-2121},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lando-Nutov/09,
AUTHOR = {Lando, Yuval and Nutov, Zeev},
TITLE = {Inapproximability of survivable networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {21-23},
PAGES = {2122-2125},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Col-Tellier/09,
AUTHOR = {Col, M.-A. Jacob-Da and Tellier, P.},
TITLE = {Quasi-linear transformations and discrete tilings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {21-23},
PAGES = {2126-2134},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cherubini-Kisielewicz/09,
AUTHOR = {Cherubini, A. and Kisielewicz, A.},
TITLE = {Collapsing words, permutation conditions and coherent colorings of trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {21-23},
PAGES = {2135-2147},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Beimel-Ben-Moshe-Ben-Shimol-Carmi-Chai-Kitroser-Omri/09,
AUTHOR = {Beimel, Amos and Ben-Moshe, Boaz and Ben-Shimol, Yehuda and Carmi, Paz and Chai, Eldad and Kitroser, Itzik and Omri, Eran},
TITLE = {Matrix columns allocation problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {21-23},
PAGES = {2174-2183},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bourgeois-Escoffier-Paschos/09b,
AUTHOR = {Bourgeois, N. and Escoffier, B. and Paschos, V.Th.},
TITLE = {Efficient approximation of MIN SET COVER by moderately exponential algorithms},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {21-23},
PAGES = {2184-2195},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Galatolo-Hoyrup-Rojas/09,
AUTHOR = {Galatolo, Stefano and Hoyrup, Mathieu and Rojas, Crist{\'o}bal},
TITLE = {A constructive Borel-Cantelli lemma. Constructing orbits with required statistical properties},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {21-23},
PAGES = {2207-2222},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bockenhauer-Kneis-Kupke/09,
AUTHOR = {B{\"{o}}ckenhauer, Hans-Joachim and Kneis, Joachim and Kupke, Joachim},
TITLE = {Approximation hardness of deadline-TSP reoptimization},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {21-23},
PAGES = {2241-2249},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hoffmann/09,
AUTHOR = {Hoffmann, Jan},
TITLE = {Finding a tree structure in a resolution proof is $NP$-complete},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {21-23},
PAGES = {2295-2300},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alhazov-Petre-Rogojin/09,
AUTHOR = {Alhazov, Artiom and Petre, Ion and Rogojin, Vladimir},
TITLE = {The parallel complexity of signed graphs: Decidability results and an improved algorithm},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {24-25},
PAGES = {2308-2315},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cai-Ding/09,
AUTHOR = {Cai, Ying and Ding, Cunsheng},
TITLE = {Binary sequences with optimal autocorrelation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {24-25},
PAGES = {2316-2322},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Calude-Jurgensen-Staiger/09,
AUTHOR = {Calude, Cristian S. and J{\"{u}}rgensen, Helmut and Staiger, Ludwig},
TITLE = {Topology on words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {24-25},
PAGES = {2323-2335},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Campeanu-Santean/09a,
AUTHOR = {C{\^{a}}mpeanu, Cezar and Santean, Nicolae},
TITLE = {On the intersection of regex languages with regular languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {24-25},
PAGES = {2336-2344},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cassaigne-Karhumaki-Salmela/09,
AUTHOR = {Cassaigne, Julien and Karhum{\"{a}}ki, Juhani and Salmela, Petri},
TITLE = {Conjugacy of finite biprefix codes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {24-25},
PAGES = {2345-2351},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cavaliere-Ibarra-Paun-Egecioglu-Ionescu-Woodworth/09,
AUTHOR = {Cavaliere, Matteo and Ibarra, Oscar H. and P{\u{a}}un, Gheorghe and Egecioglu, Omer and Ionescu, Mihai and Woodworth, Sara},
TITLE = {Asynchronous spiking neural $P$ systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {24-25},
PAGES = {2352-2364},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Ma-Zhang/09,
AUTHOR = {Chen, Shihyen and Ma, Bin and Zhang, Kaizhong},
TITLE = {On the similarity metric and the distance metric},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {24-25},
PAGES = {2365-2376},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Domaratzki-Okhotin/09,
AUTHOR = {Domaratzki, Michael and Okhotin, Alexander},
TITLE = {State complexity of power},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {24-25},
PAGES = {2377-2392},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kari-Mahalingam-Seki/09,
AUTHOR = {Kari, Lila and Mahalingam, Kalpana and Seki, Shinnosuke},
TITLE = {Twin-roots of words and their properties},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {24-25},
PAGES = {2393-2400},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Krieger-Miller-Rampersad-Ravikumar-Shallit/09,
AUTHOR = {Krieger, Dalia and Miller, Avery and Rampersad, Narad and Ravikumar, Bala and Shallit, Jeffrey},
TITLE = {Decimations of languages and state complexity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {24-25},
PAGES = {2401-2409},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Friedrich-Hebbinghaus-Neumann/09,
AUTHOR = {Friedrich, Tobias and Hebbinghaus, Nils and Neumann, Frank},
TITLE = {Comparison of simple diversity mechanisms on plateau functions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {26},
PAGES = {2455-2462},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jain-Zhang/09,
AUTHOR = {Jain, Rahul and Zhang, Shengyu},
TITLE = {New bounds on classical and quantum one-way communication complexity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {26},
PAGES = {2463-2477},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Broadbent-Kashefi/09,
AUTHOR = {Broadbent, Anne and Kashefi, Elham},
TITLE = {Parallelizing quantum circuits},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {26},
PAGES = {2489-2510},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Han-Salomaa/09,
AUTHOR = {Han, Yo-Sub and Salomaa, Kai},
TITLE = {State complexity of basic operations on suffix-free regular languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {27-29},
PAGES = {2537-2548},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Berenbrink-Cooper-Hu/09,
AUTHOR = {Berenbrink, Petra and Cooper, Colin and Hu, Zengjian},
TITLE = {Energy efficient randomised communication in unknown AdHoc networks},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {27-29},
PAGES = {2549-2561},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jain-Kinber/09,
AUTHOR = {Jain, Sanjay and Kinber, Efim},
TITLE = {One-shot learners using negative counterexamples and nearest positive examples},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {27-29},
PAGES = {2562-2580},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Kanj-Xia/09,
AUTHOR = {Chen, Jianer and Kanj, Iyad A. and Xia, Ge},
TITLE = {On parameterized exponential time complexity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {27-29},
PAGES = {2641-2648},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Harvey/09b,
AUTHOR = {Harvey, David},
TITLE = {A cache-friendly truncated FFT},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {27-29},
PAGES = {2649-2658},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Garg-Schost/09,
AUTHOR = {Garg, Sanchit and Schost, {\'E}ric},
TITLE = {Interpolation of polynomials given by straight-line programs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {27-29},
PAGES = {2659-2662},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fu-Huo-Zhao/09,
AUTHOR = {Fu, Bin and Huo, Yumei and Zhao, Hairong},
TITLE = {Exponential inapproximability and FPTAS for scheduling with availability constraints},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {27-29},
PAGES = {2663-2674},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hong-Shin/09,
AUTHOR = {Hong, Soonjo and Shin, Sujin},
TITLE = {Cyclic renewal systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {27-29},
PAGES = {2675-2684},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{De_Carli-Frosini-Rinaldi-Sorbi/09,
AUTHOR = {De Carli, F. and Frosini, A. and Rinaldi, S. and Sorbi, A.},
TITLE = {Lattices of local two-dimensional languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {27-29},
PAGES = {2701-2713},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chang-Lyuu/09,
AUTHOR = {Chang, Ching-Lueh and Lyuu, Yuh-Dauh},
TITLE = {Spreading messages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {27-29},
PAGES = {2714-2724},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Diaz-Grandoni-Spaccamela/09,
AUTHOR = {Diaz, Josep and Grandoni, Fabrizio and Spaccamela, Alberto Marchetti},
TITLE = {Balanced cut approximation in random geometric graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {27-29},
PAGES = {2725-2731},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cao-Yang/09,
AUTHOR = {Cao, Zhigang and Yang, Xiaoguang},
TITLE = {A PTAS for parallel batch scheduling with rejection and dynamic job arrivals},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {27-29},
PAGES = {2732-2745},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kashan-Karimi-Ghomi/09,
AUTHOR = {Kashan, Ali Husseinzadeh and Karimi, Behrooz and Ghomi, S.M.T. Fatemi},
TITLE = {A note on minimizing makespan on a single batch processing machine with nonidentical job sizes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {27-29},
PAGES = {2754-2758},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Balkova-Pelantova/09,
AUTHOR = {Balkov{\'{a}}, L'ubom{\'{i}}ra and Pelantov{\'{a}}, Edita},
TITLE = {A note on symmetries in the Rauzy graph and factor frequencies},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {27-29},
PAGES = {2779-2783},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Allouche-Rampersad-Shallit/09,
AUTHOR = {Allouche, Jean-Paul and Rampersad, Narad and Shallit, Jeffrey},
TITLE = {Periodicity, repetitions, and orbits of an automatic sequence},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {30-32},
PAGES = {2795-2803},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automatic sequence, squarefree, overlap-free, thue-morse sequence, rudin-shapiro sequence, decidability, periodicity, orbit, orbit closure, continued fraction},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VKDN0S-6/2/6082dbc4779d199349ca0f1e36fb58af},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Baturo-Rytter/09,
AUTHOR = {Baturo, Pawe{\l} and Rytter, Wojciech},
TITLE = {Compressed string-matching in standard Sturmian words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {30-32},
PAGES = {2804-2810},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sturmian words, string-matching, linear time, lexicographic numeration property},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VVR20N-3/2/2a2f1354785202404ac184407e0d1617},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Berstel-Boasson-Carton/09,
AUTHOR = {Berstel, Jean and Boasson, Luc and Carton, Olivier},
TITLE = {Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {30-32},
PAGES = {2811-2822},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {hopcroft's algorithm, automata minimization, standard sturmian sequence, continuant polynomials},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VKDN0S-3/2/c1a6fb2588f26eb5398fdd45413616f6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Blondel-Cassaigne-Jungers/09,
AUTHOR = {Blondel, Vincent D. and Cassaigne, Julien and Jungers, Rapha{\"e}l M.},
TITLE = {On the number of $\alpha$-power-free binary words for $2<\alpha\le 7/3$},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {30-32},
PAGES = {2823-2833},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {overlap-free words, combinatorics on words, joint spectral radius},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VJ4WWP-2/2/4f8428be0a4ff2cfbe859b6235e52550},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bu-Li-Li-Qian-Xu/09,
AUTHOR = {Bu, Dongbo and Li, Ming and Li, Shuai Cheng and Qian, Jianbo and Xu, Jinbo},
TITLE = {Finding compact structural motifs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {30-32},
PAGES = {2834-2839},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {compact structural motif, np-hardness, approximation algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VXTSS5-1/2/d352ff1e90757aa0508a5a3926125791},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bucci-de_Luca-De_Luca/09,
AUTHOR = {Bucci, Michelangelo and de Luca, Aldo and De Luca, Alessandro},
TITLE = {Characteristic morphisms of generalized Episturmian words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {30-32},
PAGES = {2840-2859},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {episturmian words, episturmian morphisms, involutory antimorphisms, characteristic morphisms, overlap-free codes, normal codes},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4V34DD2-1/2/968789b976f590cbc08ce1841e8d9744},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bucci-De_Luca-Glen-Zamboni/09,
AUTHOR = {Bucci, Michelangelo and De Luca, Alessandro and Glen, Amy and Zamboni, Luca Q.},
TITLE = {A new characteristic property of rich words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {30-32},
PAGES = {2860-2863},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorics on words, palindromes, rich words, return words},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4TY4TS3-1/2/ab49fae370fe89c5afae69dfef556375},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bugeaud-Reutenauer-Siksek/09,
AUTHOR = {Bugeaud, Yann and Reutenauer, Christophe and Siksek, Samir},
TITLE = {A Sturmian sequence related to the uniqueness conjecture for Markoff numbers},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {30-32},
PAGES = {2864-2869},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sturmian sequences, christoffel words, computational number theory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VJSRYK-3/2/0725363d2178a8356ba837b490b334fe},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Choffrut-Grigorieff/09a,
AUTHOR = {Choffrut, Christian and Grigorieff, Serge},
TITLE = {The ``equal last letter'' predicate for words on infinite alphabets and classes of multitape automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {30-32},
PAGES = {2870-2884},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {multitape automata, first-order logic, finite words over infinite alphabets},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VJ4WWP-6/2/954df5d42b7c61778d1781b7ff75e74c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Currie-Rampersad/09,
AUTHOR = {Currie, James and Rampersad, Narad},
TITLE = {Dejean's conjecture holds for $n\ge30$},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {30-32},
PAGES = {2885-2888},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {repetitive threshold, fractional power, dejean's conjecture},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VK02NS-1/2/4450e562e3191d79404a0b3ae4545ccc},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Czeizler-Plandowski/09,
AUTHOR = {Czeizler, Elena and Plandowski, Wojciech},
TITLE = {On systems of word equations over three unknowns with at most six occurrences of one of the unknowns},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {30-32},
PAGES = {2889-2909},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {word equations, combinatorics on words, unification theory, formal languages},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VHSDM8-2/2/986d808eedaf999dc41f6f4a40f47879},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dassow-Martin-Vico/09,
AUTHOR = {Dassow, J{\"u}rgen and Mart{\'{i}}n, Gema M. and Vico, Francisco J.},
TITLE = {Some operations preserving primitivity of words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {30-32},
PAGES = {2910-2919},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {primitive words, almost duplications and mirror images},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VHSDM8-3/2/754c209db0f295301bddb73d95821ec6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Diaz-Kirousis-Mitsche-Perez-Gimenez/09,
AUTHOR = {D{\'{i}}az, J. and Kirousis, L. and Mitsche, D. and P{\'e}rez-Gim{\'e}nez, X.},
TITLE = {On the satisfiability threshold of formulas with three literals per clause},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {30-32},
PAGES = {2920-2934},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VR24BN-1/2/f07a230f8bc868bcee384d9e87d79de5},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Diekert-Krieger/09,
AUTHOR = {Diekert, Volker and Krieger, Dalia},
TITLE = {Some remarks about stabilizers},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {30-32},
PAGES = {2935-2946},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {infinite words, morphisms, stabilizers},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VHSDM8-1/2/17a3da9cbd7d6e8bde105b3ee54b2108},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Frid/09,
AUTHOR = {Frid, A.E.},
TITLE = {Simple equations on binary factorial languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {30-32},
PAGES = {2947-2956},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {language equations, commutation, conjugacy, catenation of languages, monoid of factorial languages, canonical decompositions},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VT0X8H-1/2/eb8041abc4b7fc3acd5fabec1a55f9ae},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Halava-Kari-Matiyasevich/09,
AUTHOR = {Halava, Vesa and Kari, Jarkko and Matiyasevich, Yuri},
TITLE = {On post correspondence problem for letter monotonic languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {30-32},
PAGES = {2957-2960},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {post correspondence problem, decidability, word equation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VKDN0S-5/2/e405b87e58a64f72498dc63ad5a7cc51},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Han-Salomaa/09a,
AUTHOR = {Han, Yo-Sub and Salomaa, Kai},
TITLE = {Nondeterministic state complexity of nested word automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {30-32},
PAGES = {2961-2971},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {state complexity, nondeterminism, finite automata on nested words, language operations},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VFK821-1/2/194f0369fb890d461c0c1279cd9e3809},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hromkovic-Petersen-Schnitger/09,
AUTHOR = {Hromkovi{\v{c}}, Juraj and Petersen, Holger and Schnitger, Georg},
TITLE = {On the limits of the communication complexity technique for proving lower bounds on the size of minimal NFA's},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {30-32},
PAGES = {2972-2981},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {communication complexity, descriptional complexity, finite automata, nondeterminism},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VXMPTV-3/2/36bb869f1892656d260e7aee66c75a74},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ibarra-Paun-Rodriguez-Paton/09,
AUTHOR = {Ibarra, Oscar H. and P{\u{a}}un, Andrei and Rodr{\'{i}}guez-Pat{\'o}n, Alfonso},
TITLE = {Sequential SNP systems based on min/max spike number},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {30-32},
PAGES = {2982-2991},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {membrane computing, sequentiality, universality, spike number, spiking neural p systems},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VTVR4G-2/2/013ed754530110041dc82612fdc5c07e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ciocchetta-Hillston/09,
AUTHOR = {Ciocchetta, Federica and Hillston, Jane},
TITLE = {Bio-PEPA: A framework for the modelling and analysis of biological systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {33-34},
PAGES = {3065-3084},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {process algebras, biochemical networks, modelling, analysis},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VT14KW-1/2/d75a955fd6da7cf9a3eb25abf3b8ebbf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Barbuti-Caravagna-Maggiolo-Schettini-Milazzo/09,
AUTHOR = {Barbuti, Roberto and Caravagna, Giulio and Maggiolo-Schettini, Andrea and Milazzo, Paolo},
TITLE = {An intermediate language for the stochastic simulation of biological systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {33-34},
PAGES = {3085-3109},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {multiset rewriting, stochastic simulation, stochastic calculus of looping sequences, stochastic [pi]-calculus},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4THSX7T-8/2/6da3367852fb72eec7c866b9d17b1d75},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bodei/09,
AUTHOR = {Bodei, Chiara},
TITLE = {A Control Flow Analysis for Beta-binders with and without static compartments},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {33-34},
PAGES = {3110-3127},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {control flow analysis, beta-binders, biological compartments},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4TJX1VV-1/2/df17ef73aa88e0138e1daa3fa76736ce},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Barnat-Brim-Cerna-Drazan-Fabrikova-Safranek/09,
AUTHOR = {Barnat, J. and Brim, L. and {\v{C}}ern{\'a}, I. and Dra{\v{z}}an, S. and Fabrikov{\'a}, J. and {\v{S}}afr{\'a}nek, D.},
TITLE = {On algorithmic analysis of transcriptional regulation by LTL model checking},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {33-34},
PAGES = {3128-3148},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {genetic regulatory network, piecewise-linear approximation, model checking},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VPV5M7-1/2/e04efb8ab3fb3180c382a9d4e0a07324},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bartocci-Corradini-Di_Berardini-Entcheva-Smolka-Grosu/09,
AUTHOR = {Bartocci, E. and Corradini, F. and Di Berardini, M.R. and Entcheva, E. and Smolka, S.A. and Grosu, R.},
TITLE = {Modeling and simulation of cardiac tissue using hybrid I/O automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {33-34},
PAGES = {3149-3165},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational systems biology, hybrid automata, formal analysis, excitable tissue},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VTKKWD-1/2/c292be0805be9cc2307d03d1a6a96e7a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cardelli-Caron-Gardner-Kahramanogullar-Phillips/09,
AUTHOR = {Cardelli, Luca and Caron, Emmanuelle and Gardner, Philippa and Kahramano{\u{g}}ullar{\i}, Ozan and Phillips, Andrew},
TITLE = {A process model of Rho GTP-binding proteins},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {33-34},
PAGES = {3166-3185},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {gtp-binding proteins, stochastic [pi]-calculus, process modeling},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W9XBHN-1/2/cbeb0585fb4afbd2533b850a308fda31},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alhazov-Csuhaj-Varju-Martin-Vide-Rogozhin/09,
AUTHOR = {Alhazov, Artiom and Csuhaj-Varj{\'u}, Erzs{\'e}bet and Mart{\'{i}}n-Vide, Carlos and Rogozhin, Yurii},
TITLE = {On the size of computationally complete hybrid networks of evolutionary processors},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {35},
PAGES = {3188-3197},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {hybrid networks of evolutionary processors, point mutations, computational completeness},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W7J146-7/2/ff7cfd8dc9e8d5584604dc20a1017b70},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Biegler-Salomaa/09,
AUTHOR = {Biegler, Franziska and Salomaa, Kai},
TITLE = {On the synchronized derivation depth of context-free grammars},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {35},
PAGES = {3198-3208},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {synchronization, context-free languages, regulated rewriting, derivation complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VYP9B6-4/2/07256ad680583b5d9d4188e820b31441},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bordihn-Holzer-Kutrib/09,
AUTHOR = {Bordihn, Henning and Holzer, Markus and Kutrib, Martin},
TITLE = {Determination of finite automata accepting subregular languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {35},
PAGES = {3209-3222},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {state complexity, determination, subregular languages, finite automata},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WCTWX9-1/2/f310b3944535724de86425fe1d24957c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brzozowski-Konstantinidis/09,
AUTHOR = {Brzozowski, Janusz and Konstantinidis, Stavros},
TITLE = {State-complexity hierarchies of uniform languages of alphabet-size length},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {35},
PAGES = {3223-3235},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automaton, bound, hierarchy, language, permutation, state complexity, tree, uniform},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VTVR4G-1/2/bdc8167524b9ec3be0138c4f6c81756a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brzozowski-Santean/09,
AUTHOR = {Brzozowski, Janusz and Santean, Nicolae},
TITLE = {Predictable semiautomata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {35},
PAGES = {3236-3249},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automaton, bound, delegator, look-ahead, nondeterminism, predictor, semiautomaton, simulation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W91PY0-2/2/9a98c33d5ec91bc4ededf9bc96937594},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Czeizler-Czeizler-Kari-Salomaa/09,
AUTHOR = {Czeizler, Elena and Czeizler, Eugen and Kari, Lila and Salomaa, Kai},
TITLE = {On the descriptional complexity of Watson-Crick automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {35},
PAGES = {3250-3260},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {watson-crick automata, state complexity, determinism},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W7J146-5/2/6ff08d25fa71df8799d6054425dc3a88},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dassow-Stiebe-Truthe/09,
AUTHOR = {Dassow, J{\"u}rgen and Stiebe, Ralf and Truthe, Bianca},
TITLE = {Two collapsing hierarchies of subregularly tree controlled languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {35},
PAGES = {3261-3271},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {controlled derivations, tree controlled grammars, subregular control},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VVR20N-2/2/21f9fb6476a1f6ac21f47fab93bc2f4e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Esik-Gao-Liu-Yu/09,
AUTHOR = {{\'E}sik, Zolt{\'a}n and Gao, Yuan and Liu, Guangwu and Yu, Sheng},
TITLE = {Estimation of state complexity of combined operations},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {35},
PAGES = {3272-3280},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {state complexity, combined operations, estimation, multiple operations},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VY2CDJ-2/2/c67c6187ccbaabf5fbcd9c64bd78528b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gruber-Holzer/09,
AUTHOR = {Gruber, Hermann and Holzer, Markus},
TITLE = {Language operations with regular expressions of polynomial size},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {35},
PAGES = {3281-3289},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {regular expressions, derivatives, language quotient, cyclic shift, circular shift},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W3HXBM-1/2/32d0d5d224438a76baeb655625efc6d7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fotakis-Kontogiannis-Koutsoupias-Mavronicolas-Spirakis/09,
AUTHOR = {Fotakis, Dimitris and Kontogiannis, Spyros and Koutsoupias, Elias and Mavronicolas, Marios and Spirakis, Paul},
TITLE = {The structure and complexity of Nash equilibria for a selfish routing game},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {36},
PAGES = {3305-3326},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithmic game theory, selfish routing, nash equilibrium},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4RJRVVJ-1/2/74a12dad51bcdd857c9e692e02843a73},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Christodoulou-Koutsoupias-Nanavati/09,
AUTHOR = {Christodoulou, George and Koutsoupias, Elias and Nanavati, Akash},
TITLE = {Coordination mechanisms},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {36},
PAGES = {3327-3336},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {game theory, price of anarchy, mechanism, congestion games, selfish task allocation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VGF3YW-2/2/47a0c8badb70aeb015e137c9e60b20de},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Busch-Magdon-Ismail/09,
AUTHOR = {Busch, Costas and Magdon-Ismail, Malik},
TITLE = {Atomic routing games on maximum congestion},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {36},
PAGES = {3337-3347},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithmic game theory, congestion game, routing game, nash equilibrium, price of anarchy},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W7423R-1/2/fc91813262b7f25983d5e35378ffa80d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Auletta-De_Prisco-Penna-Persiano/09a,
AUTHOR = {Auletta, Vincenzo and De Prisco, Roberto and Penna, Paolo and Persiano, Giuseppe},
TITLE = {On designing truthful mechanisms for online scheduling},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {36},
PAGES = {3348-3356},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online algorithms, mechanism design, online truthful mechanisms, scheduling},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VBDKNT-1/2/d31274588a2016066c2f550e6c95ba32},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fischer-Vocking/09,
AUTHOR = {Fischer, Simon and V{\"o}cking, Berthold},
TITLE = {Adaptive routing with stale information},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {36},
PAGES = {3357-3371},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {wardrop model, adaptive routing, stale information, game theory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4RWH8F8-1/2/816dcc5c6f2f3ad60222cb02a32e4c4d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chitturi-Fahle-Meng-Morales-Shields-Sudborough-Voit/09,
AUTHOR = {Chitturi, B. and Fahle, W. and Meng, Z. and Morales, L. and Shields, C.O. and Sudborough, I.H. and Voit, W.},
TITLE = {An $(18/11)n$ upper bound for sorting by prefix reversals},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {36},
PAGES = {3372-3390},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {pancake problem, pancake network, sorting by prefix reversals, permutations, upper bounds},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4SGD4WV-1/2/5605127d663ee3cd4952489cf29026c8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kutylowski-Meyer_auf_der_Heide/09,
AUTHOR = {Kuty{\l}owski, Jaros{\l}aw and Meyer auf der Heide, Friedhelm},
TITLE = {Optimal strategies for maintaining a chain of relays between an explorer and a base camp},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {36},
PAGES = {3391-3405},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithms, distributed, network communications},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4S73RGY-4/2/5fe3a5454fff6edcd9d8278bcd7972d2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ausiello-Franciosa-Italiano/09,
AUTHOR = {Ausiello, Giorgio and Franciosa, Paolo G. and Italiano, Giuseppe F.},
TITLE = {Small stretch $(\alpha, \beta)$-spanners in the streaming model},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {36},
PAGES = {3406-3413},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph algorithms, graph spanners, streaming algorithms, external memory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4SB7TYV-1/2/7fac7201ac4c2094ddbf0cd768c697f3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Elsasser-Sauerwald/09b,
AUTHOR = {Els{\"a}sser, R. and Sauerwald, T.},
TITLE = {On the runtime and robustness of randomized broadcasting},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {36},
PAGES = {3414-3427},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {randomized algorithm, distributed computing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4S92TS0-2/2/235b31eef85991416333bc1be21371f2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bockenhauer-Hromkovic-Kralovic-Momke-Rossmanith/09,
AUTHOR = {B{\"o}ckenhauer, Hans-Joachim and Hromkovi{\v{c}}, Juraj and Kr{\'a}lovi{\v{c}}, Richard and M{\"o}mke, Tobias and Rossmanith, Peter},
TITLE = {Reoptimization of Steiner trees: Changing the terminal set},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {36},
PAGES = {3428-3435},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation algorithms, reoptimization, steiner tree},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4SF8SXX-2/2/da017ed868dd669dcca8fc2f4f4a60e4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kutrib-Malcher-Werlein/09,
AUTHOR = {Kutrib, Martin and Malcher, Andreas and Werlein, Larissa},
TITLE = {Regulated nondeterminism in pushdown automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {37},
PAGES = {3447-3460},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {pushdown automata, limited nondeterminism, context-dependent nondeterminism, computational capacity, closures of languages, context-free languages},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WGK6SJ-3/2/751144bb9951ec5e711d894dcff48025},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ackerman-Shallit/09,
AUTHOR = {Ackerman, Margareta and Shallit, Jeffrey},
TITLE = {Efficient enumeration of words in regular languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {37},
PAGES = {3461-3470},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {regular language, enumeration, nfa, lexicographical order},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VXB90X-4/2/316e665a8bab8a5b58df2c4bd9df6d50},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Crochemore-Epifanio-Gabriele-Mignosi/09,
AUTHOR = {Crochemore, M. and Epifanio, C. and Gabriele, A. and Mignosi, F.},
TITLE = {From Nerode's congruence to suffix automata with mismatches},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {37},
PAGES = {3471-3480},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorics on words, indexing, suffix automata, languages with mismatches, approximate string matching},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VXB744-4/2/0f2d12a54821f801446713a477f42a9f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Droste-Rahonis/09,
AUTHOR = {Droste, Manfred and Rahonis, George},
TITLE = {Weighted automata and weighted logics with discounting},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {37},
PAGES = {3481-3494},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {weighted automata, weighted b{\'o}chi and muller automata, formal power series, weighted mso logic, discounting},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VY78R6-2/2/62e193e31706963fc3573df9deffcf83},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jonoska-Pirnot/09,
AUTHOR = {Jonoska, Nata{\v{s}}a and Pirnot, Joni B.},
TITLE = {Finite state automata representing two-dimensional subshifts},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {37},
PAGES = {3504-3512},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {two-dimensional subshift, transitivity, periodicity, follower set},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VXB90X-6/2/10da872961b974a708d8da1b55ce2693},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Anselmo-Giammarresi-Madonia/09,
AUTHOR = {Anselmo, Marcella and Giammarresi, Dora and Madonia, Maria},
TITLE = {A computational model for tiling recognizable two-dimensional languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {37},
PAGES = {3520-3529},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {two-dimensional languages, finite automata, determinism},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VXB90X-2/2/fa426e6771224d01172400099f72054b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hogberg-Maletti-May/09,
AUTHOR = {H{\"o}gberg, Johanna and Maletti, Andreas and May, Jonathan},
TITLE = {Backward and forward bisimulation minimization of tree automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {37},
PAGES = {3539-3552},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {tree automaton, bisimulation, minimization, partition refinement, tree language},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VXMPTV-2/2/9725a058a0a0ad2439223dd82a6a4f01},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Klein-Ben-Nissan/09,
AUTHOR = {Klein, Shmuel T. and Ben-Nissan, Miri Kopel},
TITLE = {Accelerating Boyer-Moore searches on binary texts},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {37},
PAGES = {3563-3571},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {boyer-moore, bdm, pattern matching, binary texts, compressed matching},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VXB90X-5/2/17642fd004dedd0e18a121311bfd563c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bein-Epstein-Larmore-Noga/09,
AUTHOR = {Bein, Wolfgang and Epstein, Leah and Larmore, Lawrence L. and Noga, John},
TITLE = {Optimally competitive list batching},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3631-3639},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {design of algorithms, online algorithms, batching, tcp acknowledgment},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W45WP3-3/2/19fe68c77c5d6f930584c883d06c99a9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Komusiewicz-Huffner-Moser-Niedermeier/09,
AUTHOR = {Komusiewicz, Christian and H{\"u}ffner, Falk and Moser, Hannes and Niedermeier, Rolf},
TITLE = {Isolation concepts for efficiently enumerating dense subgraphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3640-3654},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {np-hard problem, parameterized complexity, fixed-parameter tractability, exact algorithm, clique, s-plex},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W7YXXT-1/2/4be6601f21cbdfe1632ca1f3f78a01d6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jungers-Protasov-Blondel/09,
AUTHOR = {Jungers, Rapha{\"e}l M. and Protasov, Vladimir Y. and Blondel, Vincent D.},
TITLE = {Overlap-free words and spectra of matrices},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3670-3684},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {overlap-free words, combinatorics on words, joint spectral radius, joint spectral subradius, lyapunov exponent},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W7YXXT-2/2/6c196f89bd40d0982feed21d9ae4f61d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Acerbi-Dennunzio-Formenti/09,
AUTHOR = {Acerbi, Luigi and Dennunzio, Alberto and Formenti, Enrico},
TITLE = {Conservation of some dynamical properties for operations on cellular automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3685-3693},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cellular automata, symbolic dynamics},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W7RYHP-1/2/641b9863157cab8e3ca2c8790300facb},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dorrigiv-Lopez-Ortiz-Munro/09,
AUTHOR = {Dorrigiv, Reza and L{\'o}pez-Ortiz, Alejandro and Munro, J. Ian},
TITLE = {On the relative dominance of paging algorithms},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3694-3701},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {competitive analysis, fault rate, online algorithms, paging},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W7RYHP-2/2/04e8f2a66cd1bedb752bca8aef756f2b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hasunuma-Ishii-Ono-Uno/09a,
AUTHOR = {Hasunuma, Toru and Ishii, Toshimasa and Ono, Hirotaka and Uno, Yushi},
TITLE = {An $O(n^{1.75})$ algorithm for $L(2,1)$-labeling of trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3702-3710},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {frequency/channel assignment, graph algorithm, l(2,1)-labeling, vertex coloring},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W8TW8K-2/2/280f37deabae7b44f1b587be4d40cacb},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Biegler-Daley-Holzer-McQuillan/09,
AUTHOR = {Biegler, Franziska and Daley, Mark and Holzer, Markus and McQuillan, Ian},
TITLE = {On the uniqueness of shuffle on words and finite languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3711-3724},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {shuffle decomposition, finite languages, uniqueness, words},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W7B0KH-1/2/ceb214abdf7e41b4cb3ecc6e7b1d6ae4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kowalik/09,
AUTHOR = {Kowalik, {\L}ukasz},
TITLE = {Improved edge-coloring with three colors},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3733-3742},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {edge-coloring, exponential-time, algorithm, measure and conquer},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W7YXXT-3/2/d0592609ecaf412b84630bc304d57131},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Foata-Han/09,
AUTHOR = {Foata, Dominique and Han, Guo-Niu},
TITLE = {New permutation coding and equidistribution of set-valued statistics},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3743-3750},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {lehmer coding, inversion table, cycles of permutations, set-valued statistics, hypermaps},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W8TW8K-4/2/d74a28742133551205cbd7cfe19c0378},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Amini-Perennes-Sau/09,
AUTHOR = {Amini, Omid and P{\'e}rennes, St{\'e}phane and Sau, Ignasi},
TITLE = {Hardness and approximation of traffic grooming},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3751-3760},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {traffic grooming, optical networks, sonet adm, approximation algorithms, apx-hardness, ptas},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W91PY0-1/2/374f115a082b1cf7369700f6974d6241},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ji-Cheng/09,
AUTHOR = {Ji, Min and Cheng, T.C.E.},
TITLE = {Parallel-machine scheduling of simple linear deteriorating jobs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3761-3768},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parallel-machine scheduling, computational complexity, worst-case bound, makespan, total machine load},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W7J146-4/2/a0245a62cd6b65ebd295b4cf04de37a7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jiang-Miller-Pritikin/09,
AUTHOR = {Jiang, Tao and Miller, Zevi and Pritikin, Dan},
TITLE = {Separation numbers of trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3769-3781},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {antibandwidth, bandwidth, separation, labeling},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W91PY0-4/2/0ecff51cbe453af22c66f65a8166b48b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Augustine-Banerjee-Irani/09,
AUTHOR = {Augustine, John and Banerjee, Sudarshan and Irani, Sandy},
TITLE = {Strip packing with precedence constraints and strip packing with release times},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3792-3803},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {strip packing, approximation algorithms, precedence constraints, linear programming, field programmable gate array},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WD1C4H-1/2/80da7dcb918dca18342640fdb6160dc2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hermann-Pichler/09,
AUTHOR = {Hermann, Miki and Pichler, Reinhard},
TITLE = {Complexity of counting the optimal solutions},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3814-3825},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational complexity, counting complexity, optimization problems},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WD7B8V-1/2/ff9756b664eec779774dde99813a4c15},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Beyersdorff-Kobler-Messner/09,
AUTHOR = {Beyersdorff, Olaf and K{\"o}bler, Johannes and Messner, Jochen},
TITLE = {Nondeterministic functions and the existence of optimal proof systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3839-3855},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {optimal proof systems, nondeterministic functions, disjoint -pairs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WD1C4H-3/2/d7c29676d76fb87daaa6b1c06b1234db},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jonsson-Krokhin-Kuivinen/09,
AUTHOR = {Jonsson, Peter and Krokhin, Andrei and Kuivinen, Fredrik},
TITLE = {Hard constraint satisfaction problems have hard gaps at location 1},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3856-3874},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {constraint satisfaction, optimisation, approximability, universal algebra, computational complexity, dichotomy},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WD1C4H-2/2/632679d934a080d2b9711afc4a87dad8},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hua-Wang-Yu-Lau/09,
AUTHOR = {Hua, Qiang-Sheng and Wang, Yuexuan and Yu, Dongxiao and Lau, Francis C.M.},
TITLE = {Set multi-covering via inclusion-exclusion},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3882-3892},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {set multi-covering, inclusion-exclusion, algorithm, complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WD1C4H-4/2/036db1a485ec76c9725e8c38eaa74da1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Keranen/09,
AUTHOR = {Ker{\"a}nen, Veikko},
TITLE = {A powerful Abelian square-free substitution over 4 letters},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3893-3900},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {abelian square, square-free, repetition avoidance, exponential growth},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WDGCTJ-2/2/cf846613492d3860169e19268de9c7b9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Greco-Scarcello/09,
AUTHOR = {Greco, Gianluigi and Scarcello, Francesco},
TITLE = {On the complexity of constrained Nash equilibria in graphical games},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3901-3924},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {game theory, graphical games, nash equilibria, computational complexity, treewidth},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WF4J71-1/2/740cb25d1559aaa3f46c16f352ac68b1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Biskup-Plandowski/09,
AUTHOR = {Biskup, Marek Tomasz and Plandowski, Wojciech},
TITLE = {Shortest synchronizing strings for Huffman codes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3925-3941},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {huffman code, synchronizing string, finite automaton, cern{\'o} conjecture},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WGF16T-1/2/50714a5def22dfbc5ad700069eaa7890},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bulatov-Dyer-Goldberg-Jalsenius-Richerby/09,
AUTHOR = {Bulatov, Andrei and Dyer, Martin and Goldberg, Leslie Ann and Jalsenius, Markus and Richerby, David},
TITLE = {The complexity of weighted Boolean \#CSP with mixed signs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3949-3961},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {complexity of counting, constraint satisfaction, partition function},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WGF16T-3/2/7e25960549150d90aa6f0180f47029ef},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dennunzio-Guillon-Masson/09,
AUTHOR = {Dennunzio, Alberto and Guillon, Pierre and Masson, Beno{\^i}t},
TITLE = {Sand automata as cellular automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3962-3974},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sand automata, cellular automata, dynamical systems, nilpotency, undecidability},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WJHBCC-1/2/b7bf569853b611067f594052d78926d4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Erdelyi-Hemaspaandra-Rothe-Spakowski/09a,
AUTHOR = {Erd{\'e}lyi, G{\'a}bor and Hemaspaandra, Lane A. and Rothe, J{\"o}rg and Spakowski, Holger},
TITLE = {Generalized juntas and $NP$-hard sets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {38-40},
PAGES = {3995-4000},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {np-completeness, padding, junta distributions},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WK48DR-3/2/99d6c0ff0aa1c929364e65014491b8de},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Beauxis-Palamidessi/09,
AUTHOR = {Beauxis, Romain and Palamidessi, Catuscia},
TITLE = {Probabilistic and nondeterministic aspects of anonymity},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {41},
PAGES = {4006-4025},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {anonymity, probability, probabilistic automata},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WH2M5S-3/2/9f0ee8f79b1584c4db5674195484e1ff},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Benes-Kretinsky-Larsen-Srba/09,
AUTHOR = {Bene{\v{s}}, N. and K{\v{r}}et{\'{i}}nsk{\'y}, J. and Larsen, K.G. and Srba, J.},
TITLE = {On determinism in modal transition systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {41},
PAGES = {4026-4043},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {compositional verification, modal transition systems, deterministic specifications, refinement, consistency},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WH8CCN-2/2/91fd6cf16e800b57762439a147cf3702},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bonchi-Montanari/09,
AUTHOR = {Bonchi, Filippo and Montanari, Ugo},
TITLE = {Reactive systems, (semi-)saturated semantics and coalgebras on presheaves},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {41},
PAGES = {4044-4066},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {behavioral equivalences, reactive systems, logic programming, petri nets},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WH8CCN-3/2/d57ca250dfad004c395bc177421a68d1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{ElSalamouny-Krukow-Sassone/09,
AUTHOR = {ElSalamouny, Ehab and Krukow, Karl Tikj{\o}b and Sassone, Vladimiro},
TITLE = {An analysis of the exponential decay principle in probabilistic trust models},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {41},
PAGES = {4067-4084},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {trust, computational trust, probabilistic trust models, hidden markov models, decay principle, beta distribution},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WH8CCN-4/2/0ed6646ac7625f9202dc4626c3291363},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Frandsen-Frandsen/09,
AUTHOR = {Frandsen, Gudmund Skovbjerg and Frandsen, Peter Frands},
TITLE = {Dynamic matrix rank},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {41},
PAGES = {4085-4093},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {matrix rank, dynamic algorithms, lower bounds},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WH8CCN-6/2/f6a237d22ef8cc8ccda673e8be02c1e2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gazagnaire-Genest-Helouet-Thiagarajan-Yang/09,
AUTHOR = {Gazagnaire, Thomas and Genest, Blaise and H{\'e}lou{\"e}t, Lo{\"i}c and Thiagarajan, P.S. and Yang, Shaofa},
TITLE = {Causal Message Sequence Charts},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {41},
PAGES = {4094-4110},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scenario languages, partial orders, distributed systems, modeling},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WH2M5S-4/2/6704d19577b19df8f7b21228751d5c12},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chadha-Viswanathan/09,
AUTHOR = {Chadha, Rohit and Viswanathan, Mahesh},
TITLE = {Deciding branching time properties for asynchronous programs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {42},
PAGES = {4169-4179},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {asynchronous programs, well-structured transition systems, model checking},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4VHSDM8-4/2/f8b937f87b30455fb67b9b3253425338},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Colson-Michel/09,
AUTHOR = {Colson, Lo{\"i}c and Michel, David},
TITLE = {Pedagogical second-order $\lambda$-calculus},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {42},
PAGES = {4190-4203},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {typed [lambda]-calculus, natural deduction, mathematical logic, negationless mathematics, constructive mathematics},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W7J146-3/2/397fa629bafaeca07d2bac23b1529a74},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{David/09,
AUTHOR = {David, Ren{\'e}},
TITLE = {A direct proof of the confluence of combinatory strong reduction},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {42},
PAGES = {4204-4215},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatory logic, confluence},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W7J146-2/2/f80b1f0b0f0e063ef349c605f381b059},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hadjidj-Boucheneb/09,
AUTHOR = {Hadjidj, Rachid and Boucheneb, Hanifa},
TITLE = {On-the-fly $TCTL$ model checking for time Petri nets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {42},
PAGES = {4241-4261},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {time petri nets, state space abstractions, state class method, tctl model checking},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WJBC1C-2/2/1149d678bbed2389eb1119203f1d48a3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fainekos-Pappas/09,
AUTHOR = {Fainekos, Georgios E. and Pappas, George J.},
TITLE = {Robustness of temporal logic specifications for continuous-time signals},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {42},
PAGES = {4262-4291},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {linear and metric temporal logic, robustness, metric spaces, testing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WK4SPK-1/2/f409db55aa49597c3f6dcdd049bca616},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kapah-Landau-Levy-Oz/09,
AUTHOR = {Kapah, Oren and Landau, Gad M. and Levy, Avivit and Oz, Nitsan},
TITLE = {Interchange rearrangement: The element-cost model},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {43},
PAGES = {4315-4326},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {strings rearrangement distances, rearrangement cost models, interchange rearrangement},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WS9BW5-3/2/5b41546b965a5aa1f96a48d483af0707},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Battaglia-Cangelosi-Grossi-Pisanti/09,
AUTHOR = {Battaglia, Giovanni and Cangelosi, Davide and Grossi, Roberto and Pisanti, Nadia},
TITLE = {Masking patterns in sequences: A new class of motif discovery with don't cares},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {43},
PAGES = {4327-4340},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {motif inference, pattern with don't care, partial order set, doubling algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WS9BW5-2/2/55ad0603744152a1df197ab3471c40f1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Apostolico-Cunial/09,
AUTHOR = {Apostolico, Alberto and Cunial, Fabio},
TITLE = {The subsequence composition of a string},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {43},
PAGES = {4360-4371},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {constrained subsequences, special subsequences, suffix graph, core equivalence classes, string complexity measures},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WSHK7T-2/2/a238e911c760d5496099ca1ed4fea157},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Castiglione-Restivo-Sciortino/09,
AUTHOR = {Castiglione, G. and Restivo, A. and Sciortino, M.},
TITLE = {Circular Sturmian words and Hopcroft's algorithm},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {43},
PAGES = {4372-4381},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {deterministic finite state automata, hopcroft's minimization algorithm, circular sturmian words, sturmian morphisms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WS9BW5-6/2/d0d279bcf0fcc1934a335fb61b26984c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Amir-Aumann-Indyk-Levy-Porat/09,
AUTHOR = {Amir, Amihood and Aumann, Yonatan and Indyk, Piotr and Levy, Avivit and Porat, Ely},
TITLE = {Efficient computations of $l_1$ and $l_\infty$ rearrangement distances},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {43},
PAGES = {4382-4390},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximate string matching, rearrangement distances, pattern matching},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WSHK7T-6/2/ba88df46aa217527fbf53a02f3572b32},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Federico-Pisanti/09,
AUTHOR = {Federico, Maria and Pisanti, Nadia},
TITLE = {Suffix tree characterization of maximal motifs in biological sequences},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {43},
PAGES = {4391-4401},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {motif discovery, maximal motifs, suffix tree},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WSHK7T-3/2/a1d187336cadab4623e3850c78b30d3d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gonzalez-Navarro/09,
AUTHOR = {Gonz{\'a}lez, Rodrigo and Navarro, Gonzalo},
TITLE = {Rank/select on dynamic compressed sequences and applications},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {43},
PAGES = {4414-4422},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {compressed data structures, empirical entropy, text indexing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WS9BW5-5/2/87eec4ac7f8b6a76a2c875212e8589be},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Beal-Perrin/09,
AUTHOR = {B{\'e}al, Marie-Pierre and Perrin, Dominique},
TITLE = {Completing codes in a sofic shift},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {43},
PAGES = {4423-4431},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automata and formal languages, codes, complete codes, sofic shifts, symbolic dynamics, variable length codes},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WSHK7T-5/2/7da28d9c9d8d32a83d8f2f688082f479},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Baeza-Yates-Bruyere-Delgrange-Scheihing/09,
AUTHOR = {Baeza-Yates, Ricardo and Bruy{\`e}re, V{\'e}ronique and Delgrange, Olivier and Scheihing, Rodrigo},
TITLE = {On the size of Boyer-Moore automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {43},
PAGES = {4432-4443},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WS9BW5-7/2/96b2cffc847fece26e5282f7ba1cc1b2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Deng/09a,
AUTHOR = {Chen, Xi and Deng, Xiaotie},
TITLE = {On the complexity of 2D discrete fixed point problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {44},
PAGES = {4448-4456},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WW2SR7-1/2/de9d2bf1dfefe361df8cb64b49fc9b4e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Finocchi-Grandoni-Italiano/09,
AUTHOR = {Finocchi, Irene and Grandoni, Fabrizio and Italiano, Giuseppe F.},
TITLE = {Optimal resilient sorting and searching in the presence of memory faults},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {44},
PAGES = {4457-4470},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorial algorithms, sorting, searching, memory faults, memory models, computing with unreliable information},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WT3WM3-2/2/a23e1097cb52f5073acdbb7b0628f450},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chaudhuri-Rao-Riesenfeld-Talwar/09a,
AUTHOR = {Chaudhuri, Kamalika and Rao, Satish and Riesenfeld, Samantha and Talwar, Kunal},
TITLE = {A push-relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroids},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {44},
PAGES = {4489-4503},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation algorithms, push-relabel, degree-bounded network design, spanning trees},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WT3WM3-4/2/feea86024eaf2fad3343c5735529352a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Harren/09,
AUTHOR = {Harren, Rolf},
TITLE = {Approximation algorithms for orthogonal packing problems for hypercubes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {44},
PAGES = {4504-4532},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {orthogonal knapsack problem, square packing, hypercube packing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WT3WM3-1/2/4e1fd6f189113a6abe1981159e309e78},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Angel-Bampis-Gourves/09,
AUTHOR = {Angel, Eric and Bampis, Evripidis and Gourv{\`e}s, Laurent},
TITLE = {On the minimum hitting set of bundles problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {45},
PAGES = {4534-4542},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {minimum hitting set, min{\'o}k-sat, approximation algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X49YJK-1/2/e9ccca894ce6d5ff19ac83bd52d69441},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Tanahashi/09,
AUTHOR = {Chen, Zhi-Zhong and Tanahashi, Ruka},
TITLE = {Approximating maximum edge 2-coloring in simple graphs via local improvement},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {45},
PAGES = {4543-4553},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation algorithms, graph algorithms, edge coloring, np-hardness},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WS2J1G-1/2/25ea7f450c03b771d06cde8d2b60a612},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Betzler-Fellows-Guo-Niedermeier-Rosamond/09,
AUTHOR = {Betzler, Nadja and Fellows, Michael R. and Guo, Jiong and Niedermeier, Rolf and Rosamond, Frances A.},
TITLE = {Fixed-parameter algorithms for Kemeny rankings},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {45},
PAGES = {4554-4570},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational social choice, voting systems, winner determination, rank aggregation, consensus finding, fixed-parameter tractability},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X60TDT-1/2/02ac97bb3fa947f1dab1318e75a13422},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gutin-Razgon-Kim/09,
AUTHOR = {Gutin, Gregory and Razgon, Igor and Kim, Eun Jung},
TITLE = {Minimum leaf out-branching and related problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {45},
PAGES = {4571-4579},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {directed graphs, out-branchings, minimum number of leaves, fixed-parameter tractable, acyclic directed graphs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W04KP8-1/2/bc82ff0bb5bc2401f95dcd80c13881cc},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bansal-Chan-Pruhs/09,
AUTHOR = {Bansal, Nikhil and Chan, Ho-Leung and Pruhs, Kirk},
TITLE = {Speed scaling with a solar cell},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {45},
PAGES = {4580-4587},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling, deadline scheduling, energy efficiency, solar cell},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WR1B8X-2/2/f2639b6f20a2781e2e2b245fd31eff32},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alpuente-Escobar-Iborra/09,
AUTHOR = {Alpuente, Mar{\'{i}}a and Escobar, Santiago and Iborra, Jos{\'e}},
TITLE = {Termination of narrowing revisited},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {46},
PAGES = {4608-4625},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {narrowing, termination, reachability problems, equational unification},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WV15VS-1/2/be66a32cae579b4a28dbaae5252e577a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Amato-Lipton-McGrail/09,
AUTHOR = {Amato, Gianluca and Lipton, James and McGrail, Robert},
TITLE = {On the algebraic structure of declarative programming languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {46},
PAGES = {4626-4671},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {categorical logic, indexed categories, logic programming, abstract data types, constraint logic programming},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WV15VS-7/2/5475111b9a9642244a208e9bd1fcd46a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bagnara-Hill-Zaffanella/09,
AUTHOR = {Bagnara, Roberto and Hill, Patricia M. and Zaffanella, Enea},
TITLE = {Applications of polyhedral computations to the analysis and verification of hardware and software systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {46},
PAGES = {4672-4691},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {static analysis, computer-aided verification, abstract interpretation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WV15VS-8/2/18372f1d88cfe70aa0c3342e39c86faa},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bossi/09,
AUTHOR = {Bossi, Annalisa},
TITLE = {$S$-semantics for logic programming: A retrospective look},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {46},
PAGES = {4692-4703},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {logic programming, semantics},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WV15VS-5/2/8948a721363615ecf417d7364e22a307},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gras-Hermenegildo/09,
AUTHOR = {Gras, Daniel Cabeza and Hermenegildo, Manuel V.},
TITLE = {Non-strict independence-based program parallelization using sharing and freeness information},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {46},
PAGES = {4704-4723},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parallelism, automatic parallelization, abstract interpretation, abstract domains, sharing and freeness, non-strict independence, parallelizing compilers, declarative languages, logic programming},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WV15VS-9/2/5259875e1f0cdf36794ee6b7fa04d2e7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cousot-Cousot-Giacobazzi/09,
AUTHOR = {Cousot, Patrick and Cousot, Radhia and Giacobazzi, Roberto},
TITLE = {Abstract interpretation of resolution-based semantics},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {46},
PAGES = {4724-4746},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {abstract interpretation, bottom-up semantics, herbrand semantics, logic programming, s-semantics},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WV15VS-B/2/2f48daf447c2db17b3bf52f64c08c836},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Civril-Magdon-Ismail/09,
AUTHOR = {{\c{C}}ivril, Ali and Magdon-Ismail, Malik},
TITLE = {On selecting a maximum volume sub-matrix of a matrix and related problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {4801-4811},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {subset selection, condition number, maximum volume sub-matrix, complexity, approximation},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WJHBCC-2/2/9fdf4c8764527a5cbfe5f22a3e56e47c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bayer-Le-de_Ridder/09,
AUTHOR = {Bayer, Daniel and Le, Van Bang and de Ridder, H.N.},
TITLE = {Probe threshold and probe trivially perfect graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {4812-4822},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {probe graphs, probe threshold, probe interval, probe trivially perfect, graph class, 2-sat},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WK4SPK-2/2/bf2ab567ac54471f9ad4c74f50affa20},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dennunzio-Di_Lena-Formenti-Margara/09,
AUTHOR = {Dennunzio, A. and Di Lena, P. and Formenti, E. and Margara, L.},
TITLE = {On the directional dynamics of additive cellular automata},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {4823-4833},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cellular automata, directional dynamics, factor languages, attractors},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WK48DR-2/2/12c1d8b9b93a55444b94e4e7d194e7bf},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kis/09,
AUTHOR = {Kis, Tam{\'a}s},
TITLE = {Scheduling multiprocessor UET tasks of two sizes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {4864-4873},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling uet tasks, matching theory, network matrices},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WK4SPK-6/2/481c6a77aeb5c961a7dba98b79e9a472},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Domosi-Horvath-Vuillon/09,
AUTHOR = {D{\"o}m{\"o}si, P{\'a}l and Horv{\'a}th, G{\'e}za and Vuillon, Laurent},
TITLE = {On the Shyr-Yu theorem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {4874-4877},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorics of words},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WN2XYC-1/2/030e136b0da0bffe8a296e1e23879218},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Huang/09,
AUTHOR = {Huang, Yunbao},
TITLE = {The complexity of C$^{b\omega}$-words of the form $\tilde{w}xw$},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {4892-4904},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {kolakoski sequence, derivative, c[infinity]-words, [delta]-operator, [backward difference]-operator, c[omega]-words, cb[omega]-words, palindrome, c[infinity]-quasi-palindrome},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WM0JFK-2/2/6720a20040ceaa9778c8f3bf85ff606f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Alon-Stav/09a,
AUTHOR = {Alon, Noga and Stav, Uri},
TITLE = {Hardness of edge-modification problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {4920-4927},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {edge modification problems, hardness of approximation, edit distance, hereditary graph properties},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WR1B8X-4/2/b83fde84a4f0ec1f2c7aee037691c618},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Arvind-Kobler-Lindner/09,
AUTHOR = {Arvind, V. and K{\"o}bler, Johannes and Lindner, Wolfgang},
TITLE = {Parameterized learnability of juntas},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {4928-4936},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {learning theory, computational complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WR1B8X-1/2/55ced6855a85d2806a69711829d7a8e0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{De_Felice-Fici-Zizza/09,
AUTHOR = {De Felice, Clelia and Fici, Gabriele and Zizza, Rosalba},
TITLE = {A characterization of regular circular languages generated by marked splicing systems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {4937-4960},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {molecular computing, splicing systems, circular words, formal languages, automata theory},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WR1B8X-5/2/ea23b69dc17ae0c1282f3a2b6a265be6},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Garcia-Vazquez_de_Parga-Cano-Lopez/09,
AUTHOR = {Garc{\'{i}}a, Pedro and V{\'a}zquez de Parga, Manuel and Cano, Antonio and L{\'o}pez, Dami{\'a}n},
TITLE = {On locally reversible languages},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {4961-4974},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {formal languages, locally reversible language, quasi-k-reversible automata},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WS2J1G-2/2/3e0833067efd625ed2ae569360911b12},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cordasco-Gargano/09,
AUTHOR = {Cordasco, Gennaro and Gargano, Luisa},
TITLE = {Navigable Small-World networks with few random bits},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {4975-4988},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {small-world networks, kleinberg's model, greedy routing, complex networks},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WW2SR7-3/2/d5ed38251def0de1a326181700098c71},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gassner-Hatzl-Krumke-Sperber-Woeginger/09,
AUTHOR = {Gassner, Elisabeth and Hatzl, Johannes and Krumke, Sven O. and Sperber, Heike and Woeginger, Gerhard J.},
TITLE = {How hard is it to find extreme Nash equilibria in network congestion games?},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {4989-4999},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {network congestion game, unsplittable flow, makespan objective, extreme equilibria, complexity, c72 [non-cooperative games]},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WVK4X7-1/2/e9cdf7b20d589f0f2502c286d76c6c4e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kowalik-Mucha/09a,
AUTHOR = {Kowalik, {\L}ukasz and Mucha, Marcin},
TITLE = {Deterministic 7/8-approximation for the metric maximum TSP},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {5000-5009},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {the traveling salesman problem, approximation, deterministic algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WW2SR7-2/2/fe3ac9623ad3af380165ba189770a0a1},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kao-Rampersad-Shallit/09,
AUTHOR = {Kao, Jui-Yi and Rampersad, Narad and Shallit, Jeffrey},
TITLE = {On NFAs where all states are final, initial, or both},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {5010-5021},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {nondeterministic finite automata, pspace-complete problem, state complexity},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WW2SR7-4/2/f2910abb802f5745de742e7ab7d0ce95},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cain/09,
AUTHOR = {Cain, Alan J.},
TITLE = {Automaton semigroups},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {5022-5038},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {automaton semigroup, constructions, cayley automata},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WY142R-2/2/eeaef03d4b0af7e42cc9d05b1422f5fc},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Epstein-Tan/09,
AUTHOR = {Chen, Xingyu and Epstein, Leah and Tan, Zhiyi},
TITLE = {Semi-online machine covering for two uniform machines},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {5047-5062},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {two-machine scheduling, semi-online algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X0PC4N-4/2/351ad49281561cb65d755e385093d37d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Lu-Zeng/09a,
AUTHOR = {Chen, Lei and Lu, Changhong and Zeng, Zhenbing},
TITLE = {Hardness results and approximation algorithms for (weighted) paired-domination in graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {5063-5071},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximation algorithms, apx-complete, combinatorial problems, domination problems, paired-domination},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X0PC4N-5/2/7331872870ec23cb207cb6574792c4bd},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chen-Lu-Zeng/09b,
AUTHOR = {Chen, Lei and Lu, Changhong and Zeng, Zhenbing},
TITLE = {Distance paired-domination problems on subclasses of chordal graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {5072-5081},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {algorithm, paired-domination, k-distance domination, interval graph, block graphs, trees},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X0PC4N-3/2/43e9dac0c92b8f2791daa7443caecd66},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Batu-Berenbrink-Sohler/09,
AUTHOR = {Batu, Tu{\u{g}}kan and Berenbrink, Petra and Sohler, Christian},
TITLE = {A sublinear-time approximation scheme for bin packing},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {5082-5092},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sublinear-time algorithms, bin packing},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X1SBJ2-1/2/a6a35b59bc47e4edbf8b8fc40b16f527},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kiltz-Galindo/09,
AUTHOR = {Kiltz, Eike and Galindo, David},
TITLE = {Direct chosen-ciphertext secure identity-based key encapsulation without random oracles},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {5093-5111},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {public-key cryptography, identity-based encryption, chosen-ciphertext security, bilinear maps},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X1YCKS-1/2/56b476f956ff535f37f077488b1eff1c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Khamis-Daoud-Essa/09,
AUTHOR = {Khamis, Soheir M. and Daoud, Sameh S. and Essa, Hanaa A.E.},
TITLE = {A randomized algorithm for determining dominating sets in graphs of maximum degree five},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {5122-5127},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {minimum dominating set, las vegas technique, randomized algorithm, polynomial-time approximation algorithm},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X2DD54-2/2/9ea36d7ba6ff475eed92be39d87a48de},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bang-Jensen-Kriesell/09,
AUTHOR = {Bang-Jensen, J{\o}rgen and Kriesell, Matthias},
TITLE = {Disjoint directed and undirected paths and cycles in digraphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {5138-5144},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {disjoint paths in digraphs, subgraph homeomorphism problem, dichotomy result, mixed graphs, np-completeness},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X6FNPS-1/2/44b906617ee4e020994bb6958ef8454b},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{DAlessandro-Intrigila-Varricchio/09,
AUTHOR = {D'Alessandro, Flavio and Intrigila, Benedetto and Varricchio, Stefano},
TITLE = {The Parikh counting functions of sparse context-free languages are quasi-polynomials},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {5158-5181},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sparse language, context-free language, semi-linear set, parikh counting function},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X6FNPS-3/2/19867a0a977ab816795486d87bc0b4ec},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Che-Kats-Levner/09,
AUTHOR = {Che, Ada and Kats, Vladimir and Levner, Eugene},
TITLE = {A note on a quadratic algorithm for the 2-cyclic robotic scheduling problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {5188-5190},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {robotic scheduling, polynomial algorithm, complexity, no-wait},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X0PC4N-6/2/75e869385cdfec54c405286ba82cd521},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dubickas/09,
AUTHOR = {Dubickas, Art{\=u}ras},
TITLE = {Binary words with a given Diophantine exponent},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {47-49},
PAGES = {5191-5195},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorics on words, binary words, diophantine exponent},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X378HR-1/2/121d1bec1f111566ec9a0a1b221623d7},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Blaser-Meyer_de_Voltaire/09,
AUTHOR = {Bl{\"a}ser, Markus and Meyer de Voltaire, Andreas},
TITLE = {Semisimple algebras of almost minimal rank over the reals},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {50},
PAGES = {5202-5214},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bilinear complexity, associative algebras, algebras of minimal rank},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X54JWV-8/2/a40408f1360b83bf0ef0f327c5bddf36},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bonsma-Cereceda/09,
AUTHOR = {Bonsma, Paul and Cereceda, Luis},
TITLE = {Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {50},
PAGES = {5215-5226},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {vertex-recolouring, colour graph, pspace-complete, superpolynomial distance},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X54JWV-9/2/8b2447cde2b04de8b4bb5a12b9cf902e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Crochemore-Ilie-Rytter/09,
AUTHOR = {Crochemore, Maxime and Ilie, Lucian and Rytter, Wojciech},
TITLE = {Repetitions in strings: Algorithms and combinatorics},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {50},
PAGES = {5227-5235},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {repetitions, squares, cubes, runs, consecutive repeats, tandem repeats, compression, factorisation, algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X54JWV-5/2/239c725f668a6cafa1df28db957495aa},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Duckworth-Zito/09,
AUTHOR = {Duckworth, William and Zito, Michele},
TITLE = {Large independent sets in random regular graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {50},
PAGES = {5236-5243},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {random graphs, independent sets, approximation algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X54JWV-1/2/cd72a968fccf68cab92b5c93ecc878d2},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Koiran-Perifel/09,
AUTHOR = {Koiran, Pascal and Perifel, Sylvain},
TITLE = {VPSPACE and a transfer theorem over the complex field},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {50},
PAGES = {5244-5251},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational complexity, algebraic complexity, blum-shub-smale model, valiant's model},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X54JWV-6/2/f0a629148ff6db1fcaef6586e4b4b67a},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bergeron-Mixtacki-Stoye/09,
AUTHOR = {Bergeron, Anne and Mixtacki, Julia and Stoye, Jens},
TITLE = {A new linear time algorithm to compute the genomic distance via the double cut and join distance},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {51},
PAGES = {5300-5316},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {comparative genomics, genome rearrangements, genomic distance computation, sorting by translocations, fusions, fissions and inversions},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X7GMMH-6/2/0dfbe6c2e08200020229e7f2671cad21},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Hundt-Liskiewicz-Nevries/09,
AUTHOR = {Hundt, Christian and Li{\'s}kiewicz, Maciej and Nevries, Ragnar},
TITLE = {A combinatorial geometrical approach to two-dimensional robust pattern matching with scaling and rotation},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {51},
PAGES = {5317-5333},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {combinatorial pattern matching, digital image matching, discrete rotations and scalings, discrete algorithms},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X7GMMH-1/2/947e6ebdb67da8f9d69ce16f10850f8f},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Amir-Aumann-Kapah-Levy-Porat/09,
AUTHOR = {Amir, Amihood and Aumann, Yonatan and Kapah, Oren and Levy, Avivit and Porat, Ely},
TITLE = {Approximate string matching with address bit errors},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {51},
PAGES = {5334-5346},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximate string matching, address errors, strings rearrangement metrics},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X7GMMH-2/2/cc2d5ed31dcb6b0735af517a71a34de3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Keller-Kopelowitz-Lewenstein/09,
AUTHOR = {Keller, Orgad and Kopelowitz, Tsvi and Lewenstein, Moshe},
TITLE = {On the longest common parameterized subsequence},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {51},
PAGES = {5347-5353},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X7GMMH-7/2/1325334819c4ebb48201f40b1161753c},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Fischer-Makinen-Navarro/09,
AUTHOR = {Fischer, Johannes and M{\"a}kinen, Veli and Navarro, Gonzalo},
TITLE = {Faster entropy-bounded compressed suffix trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {51},
PAGES = {5354-5364},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {suffix trees, compressed data structures, range minimum queries},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X7GMMH-8/2/3ec98b2f14aaac39ada1193ef67bc6b9},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kolpakov-Kucherov/09,
AUTHOR = {Kolpakov, Roman and Kucherov, Gregory},
TITLE = {Searching for gapped palindromes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {51},
PAGES = {5365-5373},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4X7GMMH-3/2/a59deec272fe6df754bc3bef7c46778e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Huffner-Komusiewicz-Moser-Niedermeier/09,
AUTHOR = {H{\"u}ffner, Falk and Komusiewicz, Christian and Moser, Hannes and Niedermeier, Rolf},
TITLE = {Isolation concepts for clique enumeration: Comparison and computational experiments},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {52},
PAGES = {5384-5397},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {np-hard problem, fixed-parameter tractability, exact algorithm, algorithm engineering, dense subgraph},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W8VW6D-1/2/eff6d0100a89b916ce1f5ef23532d4f4},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Danziger-Mendelsohn-Moura-Stevens/09,
AUTHOR = {Danziger, Peter and Mendelsohn, Eric and Moura, Lucia and Stevens, Brett},
TITLE = {Covering arrays avoiding forbidden edges},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {52},
PAGES = {5403-5414},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WY142R-1/2/ee74b7528e7fa819c152cd66907b47b3},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cai-Chen-Lin/09,
AUTHOR = {Cai, Zhipeng and Chen, Zhi-Zhong and Lin, Guohui},
TITLE = {A 3.4713-approximation algorithm for the capacitated multicast tree routing problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {52},
PAGES = {5415-5424},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {capacitated multicast tree routing, approximation algorithm, steiner minimum tree, tree partitioning},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W91PY0-3/2/5606d38a14476563e9854fe8a7c21b11},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Betzler-Uhlmann/09,
AUTHOR = {Betzler, Nadja and Uhlmann, Johannes},
TITLE = {Parameterized complexity of candidate control in elections and related digraph problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {52},
PAGES = {5425-5442},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {computational social choice, digraph modification problems, w[1]-/w[2]-hardness, np-hardness, copeland[alpha] voting, plurality voting},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WDNKV3-1/2/612e1d1cfceffab9e11376c4ea032c1d},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brandstadt-Le/09,
AUTHOR = {Brandst{\"a}dt, Andreas and Le, Van Bang},
TITLE = {Simplicial powers of graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {52},
PAGES = {5443-5454},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph powers, leaf powers, simplicial powers, forbidden induced subgraph, chordal graphs, block graphs, ptolemaic graphs, strongly chordal graphs},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W45WP3-2/2/5b43c5fb602d1892d880126126a1c006},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bocker-Briesemeister-Bui-Truss/09,
AUTHOR = {B{\"o}cker, S. and Briesemeister, S. and Bui, Q.B.A. and Truss, A.},
TITLE = {Going weighted: Parameterized algorithms for cluster editing},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {52},
PAGES = {5467-5480},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {exact algorithms, fixed-parameter tractability, data clustering},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W7RYHP-3/2/adaea728469965b61c0f643b1a83f2d0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Janssen-Pralat/09,
AUTHOR = {Janssen, Jeannette and Pralat, Pawe{\l}},
TITLE = {Protean graphs with a variety of ranking schemes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {52},
PAGES = {5491-5504},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {random graphs, web graphs, protean graphs, degree distribution, differential equations method, power law graphs, scale-free networks},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4W8TW8K-3/2/9d4564a71044414784274fa6e583cb4e},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bhattacharya-Burmester-Hu-Kranakis-Shi-Wiese/09,
AUTHOR = {Bhattacharya, Binay and Burmester, Mike and Hu, Yuzhuang and Kranakis, Evangelos and Shi, Qiaosheng and Wiese, Andreas},
TITLE = {Optimal movement of mobile sensors for barrier coverage of a planar region},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {410},
NUMBER = {52},
PAGES = {5515-5528},
YEAR = {2009},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {barrier coverage, circle, line, mobile robots, minimize max, minimize sum, optimal movement sensors},
URL = {http://www.sciencedirect.com/science/article/B6V1G-4WRD3P7-1/2/7ae56f19b870a8496579cd5235dc9df0},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}