Meghana M. Reddy

About

I am a doctoral student in the Theory of Combinatorial Algorithms group at ETH Zürich, and my supervisors are Dr. Michael Hoffmann and Prof. Emo Welzl. I graduated with a Masters in Computer Science from IIIT-Bangalore in July 2018. My Master thesis titled "On the Chromatic Art Gallery Problem" was supervised by Prof. Pradeesha Ashok. I also had the oppurtunity to work with Prof. Saket Saurabh during April-May 2018 at IMSc, Chennai.

My interests lie in Computational Geometry and Graph Theory, mainly topological graph theory and graph drawings. Prior to starting my PhD, I worked at Amazon India as a Software Development Engineer from August 2018 to August 2019. I also contributed to the graph module of SageMath through Google Summer of Code 2018 (a report of the project can be found here).

Contact

Department of Computer Science
ETH Zürich, CAB G39.3
Universitätstrasse 6, CH-8092 Zürich
meghana.mreddy@inf.ethz.ch

Publications and Preprints

Lions and Contamination: Monotone Clearings

Daniel Bertschinger, Meghana M. Reddy and Enrico Mann.
SWAT 2022, also awarded the Best Student Paper Award.

Simplifying Non-Simple Fan-Planar Drawings

Boris Klemz, Kristin Knorr, Meghana M. Reddy and Felix Schröder.
GD 2021.

Local Complexity of Polygons

Fabian Klute, Meghana M. Reddy and Tillmann Miltzow.

Simple Topological Drawings of k-Planar Graphs

Michael Hoffmann, Chih-Hung Liu, Meghana M. Reddy, Csaba D. Tóth.
GD 2020.

Efficient Guarding of Polygons and Terrains

Pradeesha Ashok and Meghana M. Reddy.
FAW 2019.

FPT Algorithms for Conflict-free Coloring of Graphs and Chromatic Terrain Guarding

Akanksha Agrawal, Pradeesha Ashok, Meghana M. Reddy, Saket Saurabh and Dolly Yadav.

Teaching

Geometry: Combinatorics & Algorithms, Fall 2022.
Algorithms Lab, Fall 2022.
Algorithms Lab, Fall 2021.
Algorithmen und Wahrscheinlichkeit, Spring 2021.
Algorithms, Probability and Computing, Fall 2020.
Algorithmen und Wahrscheinlichkeit, Spring 2020.

Talks and seminars

Lions and Contamination, Mittagsseminar, TU Berlin, March 2022.
Lions and Contamination: Monotone Clearings, EuroCG 2022, Perugia, Italy, March 2022.
Simplifying Non-Simple Fan-Planar Drawings, GD 2021, Tübingen, Germany, September 2021.
Local Complexity of Polygons, EuroCG 2021, April 2021.
Simple Drawings and Straight Line Drawings of k-planar Graphs, Mittagsseminar, ETH Zürich, Switzerland, March 2021.
Topological Drawings meet Classical Theorems from Convex Geometry, Mittagsseminar, ETH Zürich, Switzerland, October 2020.
Simple Topological Drawings of k-Planar Graphs, GD 2020, September 2020.
Simple Topological Drawings of k-Planar Graphs, Mittagsseminar, ETH Zürich, Switzerland, April 2020.
Simple Topological Drawings of k-Planar Graphs, EuroCG 2020, March 2020.

Supervised Theses

Emanuel Seemann, Matchings and Hamiltonian Cycles in 1-Planar Graphs, with Michael Hoffmann, Master thesis, August 2022.
Alexandre Krattinger, Edge-Coloring Simple Topological Drawings of the Complete Graph, with Michael Hoffmann, Master thesis, April 2022.
Enrico Mann, Lions and Contamination, with Daniel Bertschinger, Bachelor thesis, to be completed.
Ning Gao, The maximum geometric subgraph problem, with Nicolas Grelier, Master thesis, September 2021.
Alain Bastian, Edge coloring complete geometric graphs, with Michael Hoffmann, Semester thesis, May 2021.
Emanuel Seemann, Monotone topological book embeddings of planar graphs with fixed spinal order, with Michael Hoffmann, Bachelor thesis, December 2019.

Last updated in August 2022.