Neha Lodha

 

Research Interests

• Graph encodings to SAT/SMT and other techniques
• Extending SAT and SMT for upper and lower bounds
• Algorithms and Complexity
• Automata Theory
• Game Theory

My current CV.

 

My presentations and posters:

• A SAT approach to Branchwidth [Poster] [Presentation]

 

Publications:
8 results

2019
[8]	A SAT Approach to Branchwidth Neha Lodha, Sebastian Ordyniak, Stefan Szeider ACM Transactions on Computational Logic, volume 20, number 3, pages 15:1–15:24, 2019. [bibtex] [pdf] [doi]
[7]	SAT-Encodings for Treecut Width and Treedepth Robert Ganian, Neha Lodha, Sebastian Ordyniak, Stefan Szeider Proceedings of ALENEX 2019, the 21st Workshop on Algorithm Engineering and Experiments (Stephen G. Kobourov, Henning Meyerhenke, eds.), pages 117–129, 2019, Society for Industrial and Applied Mathematics (SIAM). [bibtex] [pdf] [doi]
2018
[6]	An SMT Approach to Fractional Hypertree Width Johannes K. Fichte, Markus Hecher, Neha Lodha, Stefan Szeider Proceedings of CP 2018, the 24rd International Conference on Principles and Practice of Constraint Programming (John N. Hooker, ed.), volume 11008 of Lecture Notes in Computer Science, pages 109–127, 2018, Springer Verlag. [bibtex] [pdf] [doi]
2017
[5]	A SAT Approach to Branchwidth Neha Lodha, Sebastian Ordyniak, Stefan Szeider Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI 2017, Melbourne, Australia, August 19-25, 2017 (Carles Sierra, ed.), pages 4894–4898, 2017, ijcai.org. Note: Sister Conference Best Paper Track [bibtex] [pdf] [doi]
[4]	SAT-Encodings for Special Treewidth and Pathwidth Neha Lodha, Sebastian Ordyniak, Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 429–445, 2017, Springer Verlag. [bibtex] [pdf] [doi]
[3]	SAT-Based Local Improvement for Finding Tree Decompositions of Small Width Johannes K. Fichte, Neha Lodha, Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2017 - 20th International Conference, Melbourne, VIC, Australia, August 28 - September 1, 2017, Proceedings (Serge Gaspers, Toby Walsh, eds.), volume 10491 of Lecture Notes in Computer Science, pages 401–411, 2017, Springer Verlag. [bibtex] [pdf] [doi]
2016
[2]	A SAT Approach to Branchwidth Neha Lodha, Sebastian Ordyniak, Stefan Szeider Theory and Applications of Satisfiability Testing - SAT 2016 - 19th International Conference, Bordeaux, France, July 5-8, 2016, Proceedings (Nadia Creignou, Daniel Le Berre, eds.), volume 9710 of Lecture Notes in Computer Science, pages 179–195, 2016, Springer Verlag. [bibtex] [doi]
[1]	Positive and Negative Results for Parameterized Compilability Simone Bova, Ronald de Haan, Neha Lodha, Stefan Szeider 2016, Technical report AC-TR-16-003, Algorithms and Complexity Group, TU Wien. [bibtex] [pdf]