search result

Cover von Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs

Complexity of the Cluster Vertex Deletion Problem on H-Free Graphs

Year: 2022
Media group: LIPIcs
Cover von Constrained Representations of Map Graphs and Half-Squares

Constrained Representations of Map Graphs and Half-Squares

Year: 2019
Media group: LIPIcs
Cover von On the Complexity of Matching Cut in Graphs of Fixed Diameter

On the Complexity of Matching Cut in Graphs of Fixed Diameter

Year: 2016
Media group: LIPIcs
Cover von Matching Cut

Matching Cut

Kernelization, Single-Exponential Time FPT, and Exact Exponential Algorithms
Year: 2019
Media group: LIPIcs
Cover von Graph-theoretic concepts in computer science
27th international workshop, Boltenhagen, Germany, June 14 - 16, 2001, proceedings
Search for this author
Year: 2001
Publisher: Heidelberg, Springer
Series: Lecture notes in computer science; 2204
Media group: MONOGRAPHIE
Cover von Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration

Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration

Year: 2021
Media group: LIPIcs
Cover von Computing Graph Roots Without Short Cycles

Computing Graph Roots Without Short Cycles

Year: 2009
Media group: ARTICLE
Cover von Vol. 3; Graph classes
a survey
Author: Brandstädt, Andreas; Le, Van Bang; Spinrad, Jeremy P. Search for this author
Year: 1999
Publisher: Philadelphia, SIAM
Series: SIAM monographs on discrete mathematics and applications
Media group: MONOGRAPHIE
OPEN V 11.1.0.0