Person

Yuri Faenza

This person is no longer with EPFL

Related publications (12)

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.

Yuri Faenza

Graph Chatbot

Chat with Graph Search

Extended Formulations from Communication Protocols in Output-Efficient Time

On 2-Level Polytopes Arising In Combinatorial Settings

Extension complexity of stable set polytopes of bipartite graphs

On vertices and facets of combinatorial 2-level polytopes

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

On The Convergence Of The Affine Hull Of The Chvatal-Gomory Closures

Extended Formulations, Nonnegative Factorizations, and Randomized Communication Protocols

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

On coloring problems with local constraints

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