@article{Broersma-Golovach-Paulusma-Song/12a,
AUTHOR = {Broersma, Hajo and Golovach, Petr A. and Paulusma, Dani{\"e}l and Song, Jian},
TITLE = {Determining the chromatic number of triangle-free $2P_3$-free graphs in polynomial time},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {423},
PAGES = {1-10},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {chromatic number, triangle-free, forbidden induced subgraph},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511010619},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Chan-Megow-Sitters-van_Stee/12,
AUTHOR = {Chan, Ho-Leung and Megow, Nicole and Sitters, Ren{\'e} and van Stee, Rob},
TITLE = {A note on sorting buffers offline},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {423},
PAGES = {11-18},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {np-hard, approximation algorithm, resource augmentation, buffer sorting},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511010620},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Gorbenko-Popov/12,
AUTHOR = {Gorbenko, A.A. and Popov, V.Yu.},
TITLE = {The set of parameterized $k$-covers problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {423},
PAGES = {19-24},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parameterized pattern matching, set of k -covers, np-complete, logical models},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511010188},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lacroix-Mahjoub-Martin-Picouleau/12,
AUTHOR = {Lacroix, Mathieu and Mahjoub, A. Ridha and Martin, S{\'e}bastien and Picouleau, Christophe},
TITLE = {On the NP-completeness of the perfect matching free subgraph problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {423},
PAGES = {25-29},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bipartite graph, matching, blocker, stable set, tripartite graph, np-complete, structural analysis problem},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511010413},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Russo/12,
AUTHOR = {Russo, Lu{\'{i}}s M.S.},
TITLE = {Monge properties of sequence alignment},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {423},
PAGES = {30-49},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {cyclic strings, edit distance, longest common subsequence, computational complexity, string matching, monge property, matrix multiplication, alignment, incremental string comparison},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511010449},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Tassa/12,
AUTHOR = {Tassa, Tamir},
TITLE = {Finding all maximally-matchable edges in a bipartite graph},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {423},
PAGES = {50-58},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {bipartite graphs, perfect matchings, maximum matchings, maximally-matchable edges},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511010474},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {see Addendum in Theor.~Comput.~Sci., Vol. 491, 2013, 136-136},
}
@article{van_Stee/12,
AUTHOR = {van Stee, Rob},
TITLE = {An improved algorithm for online rectangle filling},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {423},
PAGES = {59-74},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {online algorithms, resource management and awareness, wireless networks},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511010437},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Ben-Amram-Yoffe/12,
AUTHOR = {Ben-Amram, Amir M. and Yoffe, Simon},
TITLE = {Corrigendum to ``A simple and efficient Union-Find-Delete algorithm''},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {423},
PAGES = {75-75},
YEAR = {2012},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397511010590},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
NOTE = {Originally in Theor.~Comput.~Sci., Vol. 412, 2011, No. 4-5, 487-492},
}