Neha Lodha

Neha Lodha is a researcher in the Institut für Logic and Computation at TU Wien. Her work focuses on algorithms, complexity theory, and SAT/SMT solving techniques. She has contributed to graph encodings for combinatorial optimization problems and parameterized complexity analysis.

Key research areas include SAT-based approaches for graph decomposition (branchwidth, treewidth), SMT methods for fractional hypertree width, and algorithm engineering for constraint satisfaction problems. Her work bridges theoretical foundations with practical algorithmic implementations.

Notably, she received the 2016 SAT Conference Best Student Paper Award for her work on SAT encodings of branchwidth. This research was later expanded into a 2019 ACM Transactions publication.

Her publications span conferences like IJCAI, CP, and SAT, with a focus on advancing the theoretical and practical aspects of computational logic and algorithm design.