Padmini Mukkamala

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.

About
Privacy
Disclaimer

Graph Chatbot

About this result

Related publications (2)

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.

Related publications (2)

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.

Lower bounds on the obstacle number of graphs

János Pach, Doemoetoer Palvoelgyi, Padmini Mukkamala

Given a graph G, an obstacle representation of G is a set of points in the plane representing the vertices of G, together with a set of connected obstacles such that two vertices of G are joined by an edge if and only if the corresponding points can be con ...

2012

Padmini Mukkamala

Graph Chatbot

Lower bounds on the obstacle number of graphs

Graphs with large obstacle numbers

Lower bounds on the obstacle number of graphs

Graphs with large obstacle numbers