Invited talks (Q2692717)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Invited talks	scientific article

Statements

scholarly article

0 references

Invited talks (English)

0 references

0 references

Katharina T. Huber

0 references

Joseph (Seffi) Naor

0 references

publication date

22 March 2023

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-75242-2_1

0 references

Computational Complexity

0 references

On the Complexity Landscape of the Domination Chain

0 references

The many facets of upper domination

0 references

Precoloring extension. I: Interval graphs

0 references

0 references

Dual subimplicants of positive Boolean functions

0 references

Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph

0 references

A novel parameterised approximation algorithm for \textsc{minimum vertex cover}

0 references

Synchronizing words and monoid factorization: a parameterized perspective

0 references

Extension of some edge graph problems: standard and parameterized complexity

0 references

Extension of Vertex Cover and Independent Set in some classes of graphs

0 references

On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4]

0 references

Parameterized Algorithms

0 references

Parameterized enumeration, transversals, and imperfect phylogeny reconstruction

0 references

Parameterized approximation via fidelity preserving transformations

0 references

0 references

0 references

Enumerating minimal dominating sets in chordal bipartite graphs

0 references

Minimal dominating sets in interval graphs and trees

0 references

An incremental polynomial time algorithm to enumerate all minimal edge dominating sets

0 references

Which problems have strongly exponential complexity?

0 references

On the Enumeration of Minimal Dominating Sets and Related Notions

0 references

Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs

0 references

A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs

0 references

On enumerating minimal dicuts and strongly connected subgraphs

0 references

On the Complexity of Some Enumeration Problems for Matroids

0 references

Extension and its price for the Connected Vertex Cover problem

0 references

Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms

0 references

NP‐completeness of list coloring and precoloring extension on the edges of planar graphs

0 references

On cliques in graphs

0 references

Combinatorial optimization. Polyhedra and efficiency (3 volumes)

0 references

On enumerating all minimal solutions of feedback problems

0 references

Identifiers

10.1007/978-3-030-75242-2_1

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2692717

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