[PDF][PDF] Addenda to the survey of layout problems
J Petit - Bulletin of EATCS, 2013 - bulletin.eatcs.org
In 2002, J. Díaz, M. Serna and the author published “A Survey of Graph Layout Problems”,
which then was a complete view of the current state of the art of layout problems from an …
which then was a complete view of the current state of the art of layout problems from an …
Interval deletion is fixed-parameter tractable
We study the minimum interval deletion problem, which asks for the removal of a set of at
most k vertices to make a graph of n vertices into an interval graph. We present a …
most k vertices to make a graph of n vertices into an interval graph. We present a …
Linear recognition of almost interval graphs
Y Cao - Proceedings of the Twenty-Seventh Annual ACM-SIAM …, 2016 - SIAM
Let interval+ kv, interval+ ke, and interval–ke denote the classes of graphs that can be
obtained from some interval graph by adding k vertices, adding k edges, and deleting k …
obtained from some interval graph by adding k vertices, adding k edges, and deleting k …
[PDF][PDF] Graph modification problems related to graph classes
F Mancini - PhD degree dissertation, University of Bergen Norway, 2008 - Citeseer
This thesis consists of two parts. In the second part the research papers that constitute the
new results of the thesis are presented. In this first part we want to put these results in a …
new results of the thesis are presented. In this first part we want to put these results in a …
Linear time algorithms for finding a dominating set of fixed size in degenerated graphs
There is substantial literature dealing with fixed parameter algorithms for the dominating set
problem on various families of graphs. In this paper, we give ak O (dk) n time algorithm for …
problem on various families of graphs. In this paper, we give ak O (dk) n time algorithm for …
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
P Heggernes, C Papadopoulos - Theoretical Computer Science, 2009 - Elsevier
We study graph properties that admit an increasing, or equivalently decreasing, sequence of
graphs on the same vertex set such that for any two consecutive graphs in the sequence …
graphs on the same vertex set such that for any two consecutive graphs in the sequence …
Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
P Heggernes, C Papadopoulos - … , COCOON 2007, Banff, Canada, July 16 …, 2007 - Springer
We study graph properties that admit an increasing, or equivalently decreasing, sequence of
graphs on the same vertex set such that for any two consecutive graphs in the sequence …
graphs on the same vertex set such that for any two consecutive graphs in the sequence …
[HTML][HTML] Minimum fill-in and treewidth of split+ ke and split+ kv graphs
F Mancini - Discrete applied mathematics, 2010 - Elsevier
In this paper we investigate how graph problems that are NP-hard in general, but polynomial
time solvable on split graphs, behave on input graphs that are close to being split. For this …
time solvable on split graphs, behave on input graphs that are close to being split. For this …
Mixed search number and linear-width of interval and split graphs
Mixed Search Number and Linear-Width of Interval and Split Graphs Page 1 Mixed Search
Number and Linear-Width of Interval and Split Graphs Fedor V. Fomin, Pinar Heggernes …
Number and Linear-Width of Interval and Split Graphs Fedor V. Fomin, Pinar Heggernes …
Kernelization for edge modification problems
Y Ke - 2023 - theses.lib.polyu.edu.hk
Graph modification problems are significant problems in computer science that have gained
considerable attention in recent decades. In this thesis, we focus on edge modification …
considerable attention in recent decades. In this thesis, we focus on edge modification …