search result

Cover von A Polynomial-Time Approximation Algorithm for Complete Interval Minors

A Polynomial-Time Approximation Algorithm for Complete Interval Minors

Year: 2025
Media group: LIPIcs
Cover von A Brief Tour in Twin-Width (Invited Talk)

A Brief Tour in Twin-Width (Invited Talk)

Year: 2022
Media group: LIPIcs
Cover von First Order Logic and Twin-Width in Tournaments

First Order Logic and Twin-Width in Tournaments

Year: 2023
Media group: LIPIcs
Cover von Temporalizing Digraphs via Linear-Size Balanced Bi-Trees

Temporalizing Digraphs via Linear-Size Balanced Bi-Trees

Year: 2024
Media group: LIPIcs
Cover von The Independent Set Problem Is FPT for Even-Hole-Free Graphs

The Independent Set Problem Is FPT for Even-Hole-Free Graphs

Year: 2019
Media group: LIPIcs
Cover von Graph coloring, communication complexity and the stubborn problem

Graph coloring, communication complexity and the stubborn problem

(Invited talk)
Year: 2013
Media group: ARTICLE
Cover von A Polynomial Kernel for Multicut in Trees

A Polynomial Kernel for Multicut in Trees

Year: 2009
Media group: ARTICLE
Cover von On the Complexity of Client-Waiter and Waiter-Client Games

On the Complexity of Client-Waiter and Waiter-Client Games

Year: 2025
Media group: LIPIcs
Cover von Vertex-Minor Universal Graphs for Generating Entangled Quantum Subsystems

Vertex-Minor Universal Graphs for Generating Entangled Quantum Subsystems

Author: Thomassé, Stéphan
Year: 2024
Media group: LIPIcs
Cover von Maximum Independent Set When Excluding an Induced Minor

Maximum Independent Set When Excluding an Induced Minor

K₁ + tK₂ and tC₃ ⊎ C₄
Year: 2023
Media group: LIPIcs
OPEN V 11.1.0.0