Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 511
Volume 511, November 2013
- Vangelis Th. Paschos:
Preface. 1
- Weizhong Luo, Jianxin Wang, Qilong Feng, Jiong Guo, Jianer Chen:
Improved linear problem kernel for planar connected dominating set. 2-12 - Christophe Lenté, Mathieu Liedloff, Ameur Soukhal, Vincent T'kindt
:
On an extension of the Sort & Search method with application to scheduling theory. 13-22 - Martin Fürer, Serge Gaspers, Shiva Prasad Kasiviswanathan:
An exponential time 2-approximation algorithm for bandwidth. 23-31 - Marin Bougeret, Pierre-François Dutot, Denis Trystram:
Moderately exponential approximation for makespan minimization on related machines. 32-41 - Michael Lampis:
Parameterized maximum path coloring. 42-53 - Rémy Belmonte, Martin Vatshelle:
Graph classes with structured neighborhoods and algorithmic applications. 54-65 - Binh-Minh Bui-Xuan, Jan Arne Telle, Martin Vatshelle:
Fast dynamic programming for locally checkable vertex subset and vertex partitioning problems. 66-76 - Robert Crowston, Gregory Z. Gutin, Mark Jones, Venkatesh Raman, Saket Saurabh:
Parameterized complexity of MaxSat Above Average. 77-84 - Ljiljana Brankovic, Henning Fernau:
A novel parameterised approximation algorithm for minimum vertex cover. 85-108 - Eun Jung Kim, Daniel Gonçalves:
On exact algorithms for the permutation CSP. 109-116 - Hans L. Bodlaender, Bart M. P. Jansen, Stefan Kratsch:
Kernel bounds for path and cycle problems. 117-136 - Peter Damaschke:
Sparse solutions of sparse linear systems: Fixed-parameter tractability and an application of complex group testing. 137-146 - Mingyu Xiao, Ton Kloks, Sheung-Hung Poon:
New parameterized algorithms for the edge dominating set problem. 147-158 - Riccardo Dondi, Giancarlo Mauri, Italo Zoppis:
The l-Diversity problem: Tractability and approximability. 159-171 - Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen, Stefan Kratsch, Yngve Villanger:
Parameterized complexity of vertex deletion into perfect graph classes. 172-180
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-04-18 20:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
