scientific article; zbMATH DE number 6469226
From MaRDI portal
zbMath1318.05076MaRDI QIDQ5501345
Erik D. Demaine, Dimitrios M. Thilikos, Fedor V. Fomin, Mohammad Taghi Hajiaghayi
Publication date: 3 August 2015
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items
Quickly deciding minor-closed parameters in general graphs, Some recent progress and applications in graph minor theory, Efficient exact algorithms on planar graphs: Exploiting sphere cut decompositions, Ranking and Drawing in Subexponential Time, On the parameterized complexity of the edge monitoring problem, A note on the fine-grained complexity of MIS on regular graphs, Contraction-Bidimensionality of Geometric Intersection Graphs, A refined search tree technique for dominating set on planar graphs
