@article{Acuna-Birmele-Cottret-Crescenzi-Jourdan-Lacroix-Marchetti-Spaccamela-Marino-Milreu-Sagot-Stougie/12,
AUTHOR = {Acu{\~n}a, Vicente and Birmel{\'e}, Etienne and Cottret, Ludovic and Crescenzi, Pierluigi and Jourdan, Fabien and Lacroix, Vincent and Marchetti-Spaccamela, Alberto and Marino, Andrea and Milreu, Paulo Vieira and Sagot, Marie-France and Stougie, Leen},
TITLE = {Telling stories: Enumerating maximal directed acyclic graphs with a constrained set of sources and targets},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {457},
PAGES = {1-9},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {maximal dag, feedback arc set, story arc set},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512007207},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bermond-Peters/12,
AUTHOR = {Bermond, Jean-Claude and Peters, Joseph G.},
TITLE = {Optimal gathering in radio grids with interference},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {457},
PAGES = {10-26},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {radio communication, interference, grids, gathering},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512007165},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Breslauer-Italiano/12,
AUTHOR = {Breslauer, Dany and Italiano, Giuseppe F.},
TITLE = {On suffix extensions in suffix trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {457},
PAGES = {27-34},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {suffix trees, string algorithms},
URL = {http://www.sciencedirect.com/science/article/pii/S030439751200713X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Cao-Cheng-Wan-Li/12,
AUTHOR = {Cao, Qian and Cheng, T.C.E. and Wan, Guohua and Li, Yi},
TITLE = {Several semi-online scheduling problems on two identical machines with combined information},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {457},
PAGES = {35-44},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {scheduling, identical machines, semi-online, buffer, combined information},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512006500},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Comi-DasGupta-Schapira-Srinivasan/12,
AUTHOR = {Comi, Marco and DasGupta, Bhaskar and Schapira, Michael and Srinivasan, Venkatakumar},
TITLE = {On communication protocols that compute almost privately},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {457},
PAGES = {45-58},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {approximate privacy, multi-party communication, tiling, binary space partition},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512006676},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Elor-Bruckstein/12,
AUTHOR = {Elor, Yotam and Bruckstein, Alfred M.},
TITLE = {A ``thermodynamic'' approach to multi-robot cooperative localization},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {457},
PAGES = {59-75},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {localization, cooperative localization, multi-agent, multi-robot, distributed robotics, odometry, dead reckoning},
URL = {http://www.sciencedirect.com/science/article/pii/S030439751200655X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Elor-Bruckstein/12a,
AUTHOR = {Elor, Yotam and Bruckstein, Alfred M.},
TITLE = {Two-robot source seeking with point measurements},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {457},
PAGES = {76-85},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {source-seeking, point measurement, gradient, fume tracking},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512006536},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Golovach-Paulusma-Song/12a,
AUTHOR = {Golovach, Petr A. and Paulusma, Dani{\"e}l and Song, Jian},
TITLE = {Computing vertex-surjective homomorphisms to partially reflexive trees},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {457},
PAGES = {86-100},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph homomorphism, surjectivity, computational complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512006561},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Graca-Zhong-Dumas/12,
AUTHOR = {Gra{\c{c}}a, Daniel S. and Zhong, Ning and Dumas, H.S.},
TITLE = {The connection between computability of a nonlinear problem and its linearization: The Hartman-Grobman theorem revisited},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {457},
PAGES = {101-110},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {hartman-grobman theorem, differential equations, linearization, computability},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512006962},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Heinz-Kasprzik-Kotzing/12,
AUTHOR = {Heinz, Jeffrey and Kasprzik, Anna and K{\"o}tzing, Timo},
TITLE = {Learning in the limit with lattice-structured hypothesis spaces},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {457},
PAGES = {111-127},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {learning from positive data, lattice theory},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512007128},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Higgins/12,
AUTHOR = {Higgins, Peter M.},
TITLE = {Burrows-Wheeler transformations and de Bruijn words},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {457},
PAGES = {128-136},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512007141},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Jacob-Ritscher-Scheideler-Schmid/12,
AUTHOR = {Jacob, Riko and Ritscher, Stephan and Scheideler, Christian and Schmid, Stefan},
TITLE = {Towards higher-dimensional topological self-stabilization: A distributed algorithm for Delaunay graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {457},
PAGES = {137-148},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {distributed algorithms, topology control, social networks},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512007372},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Okhotin-Reitwiessner/12,
AUTHOR = {Okhotin, Alexander and Reitwie{\ss}ner, Christian},
TITLE = {Parsing Boolean grammars over a one-letter alphabet using online convolution},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {457},
PAGES = {149-157},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {boolean grammars, conjunctive grammars, context-free grammars, unary languages, parsing, boolean convolution, integer multiplication},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512006421},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Kong-Zhang/12,
AUTHOR = {Wang, Weifan and Kong, Jiangxu and Zhang, Lianzhu},
TITLE = {The 2-surviving rate of planar graphs without 4-cycles},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {457},
PAGES = {158-165},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {firefighter problem, 2-surviving rate, planar graph, cycle},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512006706},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xue-Kamae/12,
AUTHOR = {Xue, Yu-Mei and Kamae, Teturo},
TITLE = {Maximal pattern complexity, dual system and pattern recognition},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {457},
PAGES = {166-173},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512006433},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Yuan-Li-Yuan/12,
AUTHOR = {Yuan, Junling and Li, Wenhua and Yuan, Jinjiang},
TITLE = {A best possible online algorithm for scheduling equal-length jobs on two machines with chain precedence constraints},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {457},
PAGES = {174-180},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online algorithm, parallel-machine scheduling, equal-length jobs, chain precedence constraints, competitive ratio},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512006688},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}