---

• Web Page: https://www.linkedin.com/in/neha-lodha-9975915b/

---

Research Interests

• Algorithms, Complexity Theory, SAT Encoding, Graph Theory, Parameterized Complexity, Knowledge Compilation, Artificial Intelligence.

---

Former Position

• Until 2019 I was a PhD student fully funded by the Doctoral College Logical Methods in Computer Science, TU Wien. I started my PhD studies in September 2014 under the supervision of Prof. Dr. Stefan Szeider. I am also a project assistant in the Algorithms and Complexity group

---

Education

• M.Sc. in Theoritical Computer Sciences (Institute of Mathematical Sciences, Chennai, India).
• B.Tech. (Sardar Vallabhbhai National Institute of Technology, Surat, India)

---

Publications

1. Neha Lodha, Sebastian Ordyniak, Stefan Szeider, SAT-Encodings for Special Treewidth and Pathwidth,  in: Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, Australia, August 28 to September 1, 2017. (Note: To Appear)
2. Johannes K. Fichte, Neha Lodha, Stefan Szeider, SAT-Based Local Improvement for Finding Tree Decompositions of Small Width, in: Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, Australia, August 28 to September 1, 2017. (Note: To Appear)
3. Neha Lodha, Sebastian Ordyniak and Stefan Szeider, A SAT Approach to Branchwidth, in: Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Labri, Bordeaux, France, July 5-8,pages 179–195, 2016.
4. Simone Bova, Ronald de Haan, Neha Lodha, Stefan Szeider, Positive and Negative Results for Parameterized Compilabilit, 2016, Technical report AC-TR-16-003, Algorithms and Complexity Group, TU Wien.

---

Awards

• Best student paper award for A SAT Approach to Branchwidth, at SAT 2016, Bordeaux, France