search result

Cover von A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width

A Unified Polynomial-Time Algorithm for Feedback Vertex Set on Graphs of Bounded Mim-Width

Year: 2018
Media group: LIPIcs
Cover von On Algorithmic Applications of ℱ-Branchwidth

On Algorithmic Applications of ℱ-Branchwidth

Year: 2025
Media group: LIPIcs
Cover von Dynamic Programming on Bipartite Tree Decompositions

Dynamic Programming on Bipartite Tree Decompositions

Year: 2023
Media group: LIPIcs
Cover von XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure

XNLP-Completeness for Parameterized Problems on Graphs with a Linear Structure

Year: 2022
Media group: LIPIcs
Cover von A Unifying Framework for Characterizing and Computing Width Measures

A Unifying Framework for Characterizing and Computing Width Measures

Year: 2022
Media group: LIPIcs
Cover von Diverse Pairs of Matchings

Diverse Pairs of Matchings

Year: 2020
Media group: LIPIcs
Cover von Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach

Compressing Permutation Groups into Grammars and Polytopes. A Graph Embedding Approach

Year: 2020
Media group: LIPIcs
Cover von Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width

Generalized Distance Domination Problems and Their Complexity on Graphs of Bounded mim-width

Year: 2019
Media group: LIPIcs
Cover von Treewidth Is NP-Complete on Cubic Graphs

Treewidth Is NP-Complete on Cubic Graphs

Author: Milanič, Martin; Ordyniak, Sebastian; Pandey, Sukanya
Year: 2023
Media group: LIPIcs
OPEN V 11.1.0.0