@article{Angelini-Da_Lozzo-Di_Battista-Frati-Roselli/15,
AUTHOR = {Angelini, Patrizio and Da Lozzo, Giordano and Di Battista, Giuseppe and Frati, Fabrizio and Roselli, Vincenzo},
TITLE = {The importance of being proper: (In clustered-level planarity and $T$-level planarity)},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {571},
PAGES = {1-9},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {level planarity, simultaneous embedding, clustered planarity},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397514010317},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lai/15,
AUTHOR = {Lai, Cheng-Nan},
TITLE = {On the construction of all shortest vertex-disjoint paths in Cayley graphs of Abelian groups},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {571},
PAGES = {10-20},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {cayley graph, vertex-disjoint paths, interconnection network, generalized hypercube, torus, hypercube},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397515000146},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Krysta-Ventre/15,
AUTHOR = {Krysta, Piotr and Ventre, Carmine},
TITLE = {Combinatorial auctions with verification are tractable},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {571},
PAGES = {21-35},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {mechanism design, foundation of incentive-compatibility, combinatorial auctions, mechanisms with verification},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397515000171},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Auer-Bachmaier-Brandenburg-Gleissner-Hanauer/15,
AUTHOR = {Auer, Christopher and Bachmaier, Christian and Brandenburg, Franz J. and Glei{\ss}ner, Andreas and Hanauer, Kathrin},
TITLE = {Upward planar graphs and their duals},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {571},
PAGES = {36-49},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {planar graphs, dual graphs, graph drawing, upward planarity, surfaces},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397515000304},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Rytter-Shur/15,
AUTHOR = {Rytter, Wojciech and Shur, Arseny M.},
TITLE = {Searching for Zimin patterns},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {571},
PAGES = {50-57},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {zimin word, unavoidable pattern, on-line algorithm, fibonacci word},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397515000316},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Wang-Zhang-Zhang-Broersma/15,
AUTHOR = {Wang, Limin and Zhang, Xiaoyan and Zhang, Zhao and Broersma, Hajo},
TITLE = {A PTAS for the minimum weight connected vertex cover $P_3$ problem on unit disk graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {571},
PAGES = {58-66},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {ptas, vertex cover, p 3 cover, minimum weight cover, connected cover, c-local problem, unit disk graph, grid graph},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397515000328},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Crespelle-Phan-Tran/15,
AUTHOR = {Crespelle, Christophe and Phan, Thi Ha Duong and Tran, The Hung},
TITLE = {Termination of the iterated strong-factor operator on multipartite graphs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {571},
PAGES = {67-77},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {strong-factor operator, factor operator, multipartite graph series, termination},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397515000365},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Durocher-Mondal-Rahman/15,
AUTHOR = {Durocher, Stephane and Mondal, Debajyoti and Rahman, Md. Saidur},
TITLE = {On graphs that are not PCGs},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {571},
PAGES = {78-87},
YEAR = {2015},
EDITOR = {Ausiello, G. and Sannella, D. and Kari, L.},
KEYWORDS = {pairwise compatibility graph, leaf powers, tree-based distance metric},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397515000389},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}