SOFSEM 2005: Theory and Practice of Computer Science

DOI10.1007/b105088zbMath1117.68456OpenAlexW2543951292MaRDI QIDQ5711526

Henning Fernau

Publication date: 7 December 2005

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b105088

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (8)

A parameterized perspective on packing paths of length two ⋮ Constraint bipartite vertex cover: simpler exact algorithms and implementations ⋮ On a binary distance model for the minimum linear arrangement problem ⋮ Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles ⋮ Approximation and fixed-parameter algorithms for consecutive ones submatrix problems ⋮ Applying modular decomposition to parameterized cluster editing problems ⋮ Efficiently enumerating hitting sets of hypergraphs arising in data profiling ⋮ Extension and its price for the connected vertex cover problem

This page was built for publication: SOFSEM 2005: Theory and Practice of Computer Science