Person

Daniela Bronner

This person is no longer with EPFL

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Related publications (3)

Please note that this is not a complete list of this person’s publications. It includes only semantically relevant works. For a full list, please refer to Infoscience.

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.

An introduction to treewidth

Bernard Ries, Daniela Bronner

The notion of treewidth has seen to be a powerful vehicle for many graph algorithmic studies. A lot of problems, which are in general

NP

-complete, can be solved in polynomial time for graphs with small treewidth. In the first part of this paper we presen ...

2006

Daniela Bronner

Graph Chatbot

Chat with Graph Search

An introduction to treewidth

(k,lambda)-colorings and universal graphs

Colorations Suboptimales

Colorations Suboptimales

An introduction to treewidth

(k,lambda)-colorings and universal graphs