Person

Gautier Stauffer

This person is no longer with EPFL

Related publications (10)

About
Privacy
Disclaimer

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Gautier Stauffer

Graph Chatbot

Chat with Graph Search

Solving the Weighted Stable Set Problem in Claw-Free Graphs via Decomposition

Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs

An algorithmic decomposition of claw-free graphs leading to an O(n^3) algorithm for the weighted stable set problem

The stable set polytope of quasi-line graphs

Circular Ones Matrices and the Stable set Polytopes of Quasi-Line Graphs

On the stable set polytope of claw-free graphs

Circular Ones Matrices and the Stable Set Polytope of Quasi-Line Graphs

On non-rank facets of the stable set polytope of claw-free graphs and circulant graphs

The Winding Road toward a Characterization of the Stable Set Polytope

on Non-Rank Facets of the Stable Set Polytope of Claw-Free Graphs and Circulant Graphs