Invited talks
From MaRDI portal
Publication:2692717
DOI10.1007/978-3-030-75242-2_1OpenAlexW4205206904MaRDI QIDQ2692717
Henning Fernau, Katharina T. Huber, Joseph (Seffi) Naor
Publication date: 22 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-75242-2_1
Related Items
Cites Work
- Minimal dominating sets in interval graphs and trees
- A novel parameterised approximation algorithm for \textsc{minimum vertex cover}
- An incremental polynomial time algorithm to enumerate all minimal edge dominating sets
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction
- On product covering in 3-tier supply chain models: natural complete problems for W[3 and W[4]]
- Enumerating minimal dominating sets in chordal bipartite graphs
- Precoloring extension. I: Interval graphs
- On enumerating all minimal solutions of feedback problems
- Which problems have strongly exponential complexity?
- Parameterized approximation via fidelity preserving transformations
- The many facets of upper domination
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- Synchronizing words and monoid factorization: a parameterized perspective
- Extension of some edge graph problems: standard and parameterized complexity
- Extension of Vertex Cover and Independent Set in some classes of graphs
- Extension and its price for the Connected Vertex Cover problem
- On enumerating minimal dicuts and strongly connected subgraphs
- Dual-Bounded Generating Problems: Partial and Multiple Transversals of a Hypergraph
- On the Complexity Landscape of the Domination Chain
- A Polynomial Delay Algorithm for Enumerating Minimal Dominating Sets in Chordal Graphs
- Polynomial Delay Algorithm for Listing Minimal Edge Dominating Sets in Graphs
- Generating All Maximal Independent Sets: NP-Hardness and Polynomial-Time Algorithms
- Dual subimplicants of positive Boolean functions
- On the Enumeration of Minimal Dominating Sets and Related Notions
- NP‐completeness of list coloring and precoloring extension on the edges of planar graphs
- Computational Complexity
- On the Complexity of Some Enumeration Problems for Matroids
- Parameterized Algorithms
- On cliques in graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
