Algorithms
DACS Research - Computer Science
Our research focuses on the design and analysis of efficient algorithms that are scalable for larger and larger inputs, with a primary emphasis on optimization, provable properties, correctness, and computational hardness. We tackle fundamental and applied problems in areas such as graph theory, scheduling, computational geometry, combinatorial optimization, and information security. We connect to application areas including networks, logistics, transportation, manufacturing, bioinformatics, and beyond. Our research also concerns algorithmic questions in quantum computing, with a focus on fundamental computational aspects