LATIN 2004: Theoretical Informatics
From MaRDI portal
Publication:5901631
DOI10.1007/b95852zbMath1196.68169OpenAlexW2475444492MaRDI QIDQ5901631
Fedor V. Fomin, Mohammad Taghi Hajiaghayi, Dimitrios M. Thilikos, Erik D. Demaine
Publication date: 7 May 2009
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b95852
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
The degree-diameter problem for sparse graph classes, Subexponential parameterized algorithms for graphs of polynomial growth, Contraction-Bidimensionality of Geometric Intersection Graphs, A refined search tree technique for dominating set on planar graphs
