@article{Luo-Wang-Feng-Guo-Chen/13,
AUTHOR = {Luo, Weizhong and Wang, Jianxin and Feng, Qilong and Guo, Jiong and Chen, Jianer},
TITLE = {Improved linear problem kernel for planar connected dominating set},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {511},
PAGES = {2-12},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {data reduction, region decomposition, kernelization, connected dominating set},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513004659},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lente-Liedloff-Soukhal-TKindt/13,
AUTHOR = {Lent{\'e}, Ch. and Liedloff, M. and Soukhal, A. and T'Kindt, V.},
TITLE = {On an extension of the Sort \& Search method with application to scheduling theory},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {511},
PAGES = {13-22},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {exponential-time algorithms, scheduling, sort \& search},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513003848},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Furer-Gaspers-Kasiviswanathan/13,
AUTHOR = {F{\"u}rer, Martin and Gaspers, Serge and Kasiviswanathan, Shiva Prasad},
TITLE = {An exponential time 2-approximation algorithm for bandwidth},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {511},
PAGES = {23-31},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {exponential time algorithm, approximation algorithm, graph bandwidth, bucket decomposition},
URL = {http://www.sciencedirect.com/science/article/pii/S030439751300248X},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bougeret-Dutot-Trystram/13,
AUTHOR = {Bougeret, Marin and Dutot, Pierre-Francois and Trystram, Denis},
TITLE = {Moderately exponential approximation for makespan minimization on related machines},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {511},
PAGES = {32-41},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {moderately exponential approximation, scheduling, makespan, related machines, oracle guess},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513002338},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Lampis/13a,
AUTHOR = {Lampis, Michael},
TITLE = {Parameterized maximum path coloring},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {511},
PAGES = {42-53},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {path coloring, ept graphs, parameterized complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513000625},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Belmonte-Vatshelle/13,
AUTHOR = {Belmonte, R{\'e}my and Vatshelle, Martin},
TITLE = {Graph classes with structured neighborhoods and algorithmic applications},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {511},
PAGES = {54-65},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph decomposition, graph classes, vertex partitioning problems, boolean-width},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513000613},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bui-Xuan-Telle-Vatshelle/13,
AUTHOR = {Bui-Xuan, Binh-Minh and Telle, Jan Arne and Vatshelle, Martin},
TITLE = {Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {511},
PAGES = {66-76},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513000595},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Crowston-Gutin-Jones-Raman-Saurabh/13,
AUTHOR = {Crowston, Robert and Gutin, Gregory and Jones, Mark and Raman, Venkatesh and Saurabh, Saket},
TITLE = {Parameterized complexity of MaxSat Above Average},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {511},
PAGES = {77-84},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397513000431},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Brankovic-Fernau/13,
AUTHOR = {Brankovic, Ljiljana and Fernau, Henning},
TITLE = {A novel parameterised approximation algorithm for {\sc minimum vertex cover}},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {511},
PAGES = {85-108},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parameterised algorithms, approximation algorithms, vertex cover},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512010821},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Kim-Goncalves/13,
AUTHOR = {Kim, Eun Jung and Gon{\c{c}}alves, Daniel},
TITLE = {On exact algorithms for the permutation CSP},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {511},
PAGES = {109-116},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {exact algorithm, algorithmic lower bound, permutation constraint satisfaction problem},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512009565},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Bodlaender-Jansen-Kratsch/13a,
AUTHOR = {Bodlaender, Hans L. and Jansen, Bart M.P. and Kratsch, Stefan},
TITLE = {Kernel bounds for path and cycle problems},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {511},
PAGES = {117-136},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parameterized complexity, kernelization, upper and lower bounds, graphs, path and cycle problems},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512008262},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Damaschke/13,
AUTHOR = {Damaschke, Peter},
TITLE = {Sparse solutions of sparse linear systems: Fixed-parameter tractability and an application of complex group testing},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {511},
PAGES = {137-146},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {sparse vector, linear system, hitting set, parameterized algorithm, enumeration, problem kernel, group testing},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512006457},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Xiao-Kloks-Poon/13,
AUTHOR = {Xiao, Mingyu and Kloks, Ton and Poon, Sheung-Hung},
TITLE = {New parameterized algorithms for the edge dominating set problem},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {511},
PAGES = {147-158},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {graph algorithms, parameterized algorithms, kernelization, edge dominating set},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512006044},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Dondi-Mauri-Zoppis/13,
AUTHOR = {Dondi, Riccardo and Mauri, Giancarlo and Zoppis, Italo},
TITLE = {The $l$-Diversity problem: Tractability and approximability},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {511},
PAGES = {159-171},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {l -diversity, k -anonymity, approximation complexity, parameterized complexity},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512004823},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}
@article{Heggernes-van_t_Hof-Jansen-Kratsch-Villanger/13,
AUTHOR = {Heggernes, Pinar and van 't Hof, Pim and Jansen, Bart M.P. and Kratsch, Stefan and Villanger, Yngve},
TITLE = {Parameterized complexity of vertex deletion into perfect graph classes},
JOURNAL = {Theor.~Comput.~Sci.},
VOLUME = {511},
PAGES = {172-180},
YEAR = {2013},
EDITOR = {Ausiello, G. and Sannella, D.},
KEYWORDS = {parameterized complexity, perfect graphs, vertex deletion problems, kernelization},
URL = {http://www.sciencedirect.com/science/article/pii/S0304397512002332},
PUBLISHER = {Elsevier B.V.},
ADDRESS = {Amsterdam-Boston-London-New York-Oxford-Paris-Philadelphia-San Diego-St. Louis},
}