| Average-case approximation ratio of the 2-opt algorithm for the TSP C Engels, B Manthey Operations Research Letters 37 (2), 83-84, 2009 | 49 | 2009 |
| A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits S Chillara, C Engels, N Limaye, S Srinivasan 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS …, 2018 | 25 | 2018 |
| On expressing majority as a majority of majorities C Engels, M Garg, K Makino, A Rao SIAM Journal on Discrete Mathematics 34 (1), 730-741, 2020 | 17 | 2020 |
| Random shortest paths: Non-euclidean instances for metric optimization problems K Bringmann, C Engels, B Manthey, BVR Rao Algorithmica 73 (1), 42-62, 2015 | 15 | 2015 |
| Random shortest paths: non-euclidean instances for metric optimization problems K Bringmann, C Engels, B Manthey, BVR Rao Algorithmica 73 (1), 42-62, 2015 | 15 | 2015 |
| Random shortest paths: Non-euclidean instances for metric optimization problems K Bringmann, C Engels, B Manthey, BVR Rao Algorithmica 73 (1), 42-62, 2015 | 15 | 2015 |
| Randomness efficient testing of sparse black box identities of unbounded degree over the reals M Bläser, C Engels Symposium on Theoretical Aspects of Computer Science (STACS2011) 9, 555-566, 2011 | 8 | 2011 |
| Dichotomy Theorems for Homomorphism Polynomials of Graph Classes C Engels J. Graph Algorithms Appl. 1, 3-22, 2016 | 7 | 2016 |
| Dichotomy theorems for homomorphism polynomials of graph classes C Engels International Workshop on Algorithms and Computation, 282-293, 2015 | 7 | 2015 |
| Why are certain polynomials hard?: A look at non-commutative, parameterized and homomorphism polynomials C Engels Saarbrücken, Universität des Saarlandes, Diss., 2016 | 4 | 2016 |
| Parameterized Valiant's Classes M Bläser, C Engels arXiv preprint arXiv:1907.12287, 2019 | 2 | 2019 |
| New Algorithms and Hard Instances for Non-Commutative Computation C Engels, BV Rao arXiv preprint arXiv:1409.0742, 2014 | 2 | 2014 |
| Lower Bounds for Lexicographical DFS Data Structures S Chakraborty, C Engels 2022 Data Compression Conference (DCC), 449-449, 2022 | 1 | 2022 |
| Distance Recoloring N Banerjee, C Engels, DA Hoang arXiv preprint arXiv:2402.12705, 2024 | | 2024 |
| Cell-Probe Lower Bound for Accessible Interval Graphs S Chakraborty, C Engels, S Jo, M Liu arXiv preprint arXiv:2311.02839, 2023 | | 2023 |
| Observations on Symmetric Circuits C Engels arXiv preprint arXiv:2007.07496, 2020 | | 2020 |
| Lower Bounds of Algebraic Branching Programs and Layerization C Engels arXiv preprint arXiv:2007.06819, 2020 | | 2020 |
| On hard instances of non-commutative permanent C Engels, BVR Rao Discrete Applied Mathematics 277, 127-138, 2020 | | 2020 |
| Exponential lower bounds for some depth five powering circuits S Chillara, C Engels, BVR Rao, R Saptharishi, K Sreenivasaiah | | 2018 |
| On\varSigma\wedge\varSigma\wedge\varSigma Circuits: The Role of Middle\varSigma Fan-In, Homogeneity and Bottom Degree C Engels, BVR Rao, K Sreenivasaiah International Symposium on Fundamentals of Computation Theory, 230-242, 2017 | | 2017 |
