Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Q5874519 - MaRDI portal

No label defined (Q5874519)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7651188

Language	Label	Description	Also known as
English	No label defined	scientific article; zbMATH DE number 7651188

Statements

scholarly article

0 references

0 references

Petr A. Golovach

0 references

publication date

7 February 2023

0 references

zbMATH Keywords

parameterized complexity

0 references

structural parameterization

0 references

subexponential algorithms

0 references

kernelization

0 references

chordal graphs

0 references

fill-in

0 references

independent set

0 references

clique

0 references

coloring

0 references

MaRDI profile type

MaRDI publication profile

0 references

Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion

0 references

Interval Vertex Deletion Admits a Polynomial Kernel

0 references

A complexity dichotomy for hitting connected minors on bounded treewidth graphs: the chair and the banner draw the boundary

0 references

Polynomial kernels for proper interval completion and related problems

0 references

Subexponential Parameterized Algorithm for I <scp>nterval</scp> C <scp>ompletion</scp>

0 references

Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth

0 references

Faster parameterized algorithms for \textsc{Minimum Fill-in}

0 references

Kernelization Lower Bounds by Cross-Composition

0 references

Graph Classes: A Survey

0 references

Fixed-parameter tractability of graph modification problems for hereditary properties

0 references

Parameterized complexity of vertex colouring

0 references

Linear Recognition of Almost Interval Graphs

0 references

Unit interval editing is fixed-parameter tractable

0 references

Interval Deletion Is Fixed-Parameter Tractable

0 references

The monadic second-order logic of graphs. I: Recognizable sets of finite graphs

0 references

Parameterized Algorithms

0 references

Fast Hamiltonicity Checking Via Bases of Perfect Matchings

0 references

Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time

0 references

Fundamentals of parameterized complexity

0 references

Polynomial kernels for weighted problems

0 references

Efficient Computation of Representative Families with Applications in Parameterized and Exact Algorithms

0 references

0 references

A Polynomial Kernel for Proper Interval Vertex Deletion

0 references

Large Induced Subgraphs via Triangulations and CMSO

0 references

Subexponential Parameterized Algorithm for Minimum Fill-In

0 references

An application of simultaneous diophantine approximation in combinatorial optimization

0 references

Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph

0 references

The intersection graphs of subtrees in trees are exactly the chordal graphs

0 references

0 references

Geometric algorithms and combinatorial optimization.

0 references

The splittance of a graph

0 references

Minimal triangulations of graphs: a survey

0 references

Which problems have strongly exponential complexity?

0 references

Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter

0 references

Approximation and Kernelization for Chordal Vertex Deletion

0 references

Data reduction for graph coloring problems

0 references

Tractability of Parameterized Completion Problems on Chordal, Strongly Chordal, and Proper Interval Graphs

0 references

Finding Hamiltonian circuits in interval graphs

0 references

Representation of a finite graph by a set of intervals on the real line

0 references

Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques

0 references

Parameterized coloring problems on chordal graphs

0 references

Chordal deletion is fixed-parameter tractable

0 references

0 references

Complexity classification of some edge modification problems

0 references

Sparsity. Graphs, structures, and algorithms

0 references

The Use of Linear Graphs in Gauss Elimination

0 references

New Approximation Techniques for Some Linear Ordering Problems

0 references

0 references

Vertex Coloring of Comparability+ke and –ke Graphs

0 references

Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs

0 references

Interval Completion Is Fixed Parameter Tractable

0 references

Computing the Minimum Fill-In is NP-Complete

0 references

Identifiers

10.4230/LIPIcs.ESA.2020.49

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5874519

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5874519&oldid=37485360"