## 2018

- S. Chillara, C. Engels, N. Limaye, and S. Srinivasan, “An Exponential Depth-Hierarchy Theorem for Constant-Depth Multilinear Circuits,”
*to appear in FOCS*, 2018.

## 2017

- C. Engels, B. V. R. Rao, and K. Sreenivasaiah, “On Sigma wedge Sigma
wedge Sigma Circuits: The Role
of Middle Sigma Fan-In, Homogeneity and Bottom
Degree,” in
*FCT*, 2017, vol. 10472, pp. 230–242. - C. Engels, M. Garg, K. Makino, and A. Rao, “On Expressing Majority as a Majority of Majorities,”
*Electronic Colloquium on Computational Complexity (ECCC)*, vol. 24, p. 174, 2017.

## 2016

- C. Engels, “Dichotomy Theorems for Homomorphism Polynomials of Graph Classes,”
*J. Graph Algorithms Appl.*, vol. 20, no. 1, pp. 3–22, 2016. - C. Engels and B. V. R. Rao, “On Hard Instances of Non-Commutative Permanent,” in
*COCOON*, 2016, vol. 9797, pp. 171–181.

## 2015

- C. Engels, “Dichotomy Theorems for Homomorphism Polynomials of Graph Classes,” in
*WALCOM: Algorithms and Computation - 9th International Workshop, WALCOM 2015, Dhaka, Bangladesh, February 26-28, 2015. Proceedings*, 2015, vol. 8973, pp. 282–293. - K. Bringmann, C. Engels, B. Manthey, and B. V. R. Rao, “Random Shortest Paths: Non-Euclidean Instances for Metric Optimization
Problems,”
*Algorithmica*, vol. 73, no. 1, pp. 42–62, 2015. - C. Engels, “Why are certain polynomials hard? - A look at non-commutative, parameterized and homomorphism polynomials,” PhD thesis, Saarland University, 2015.

## 2013

- K. Bringmann, C. Engels, B. Manthey, and B. V. R. Rao, “Random Shortest Paths: Non-euclidean Instances for Metric Optimization
Problems,” in
*Mathematical Foundations of Computer Science 2013 - 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings*, 2013, vol. 8087, pp. 219–230.

## 2012

- C. Engels, B. Manthey, and R. Rao, “Random Shortest Path Metrics with Applications,”
*Proceedings of Cologne-Twente Workshop*. 2012.

## 2011

- M. Bläser and C. Engels, “Randomness Efficient Testing of Sparse Black Box Identities of Unbounded
Degree over the Reals,” in
*28th International Symposium on Theoretical Aspects of Computer Science, STACS 2011, March 10-12, 2011, Dortmund, Germany*, 2011, vol. 9, pp. 555–566.

## 2010

- C. Engels, “Randomness Efficient Testing of Sparse Black Box Identities of Unbounded Degree over the Reals.” Saarland University, 2010.

## 2009

- C. Engels and B. Manthey, “Average-case approximation ratio of the 2-opt algorithm
for the TSP,”
*Oper. Res. Lett.*, vol. 37, no. 2, pp. 83–84, 2009.

## 2008

- C. Engels, “Probabilistic Analyses of Algorithms for the Traveling Salesman Problem.” Saarland University, 2008.