Christian Engels

According to our database, Christian Engels authored at least 16 papers between 2009 and 2024.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2024

Distance Recoloring.

Niranka Banerjee, Christian Engels, Duc A. Hoang

CoRR, 2024

2023

Cell-Probe Lower Bound for Accessible Interval Graphs.

Sankardeep Chakraborty, Christian Engels, Seungbum Jo, Mingmou Liu

CoRR, 2023

2022

Lower Bounds for Lexicographical DFS Data Structures.

Sankardeep Chakraborty, Christian Engels

Proceedings of the Data Compression Conference, 2022

2020

On hard instances of non-commutative permanent.

Christian Engels, B. V. Raghavendra Rao

Discret. Appl. Math., 2020

2019

Parameterized Valiant's Classes.

Markus Bläser, Christian Engels

Proceedings of the 14th International Symposium on Parameterized and Exact Computation, 2019

2018

A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits.

Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan

Electron. Colloquium Comput. Complex., 2018

2017

On Expressing Majority as a Majority of Majorities.

Christian Engels, Mohit Garg, Kazuhisa Makino, Anup Rao

Electron. Colloquium Comput. Complex., 2017

On \varSigma \wedge \varSigma \wedge \varSigma Circuits: The Role of Middle \varSigma Fan-In, Homogeneity and Bottom Degree.

Christian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah

Proceedings of the Fundamentals of Computation Theory - 21st International Symposium, 2017

2016

Why are certain polynomials hard?: A look at non-commutative, parameterized and homomorphism polynomials.

Christian Engels

PhD thesis, 2016

Dichotomy Theorems for Homomorphism Polynomials of Graph Classes.

Christian Engels

J. Graph Algorithms Appl., 2016

Lower Bounds and Identity Testing for Projections of Power Symmetric Polynomials.

Christian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah

Electron. Colloquium Comput. Complex., 2016

2015

Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems.

Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao

Algorithmica, 2015

2014

New Algorithms and Hard Instances for Non-Commutative Computation.

Christian Engels, B. V. Raghavendra Rao

CoRR, 2014

2012

Random Shortest Path Metrics with Applications.

Christian Engels, Bodo Manthey, B. V. Raghavendra Rao

Proceedings of the 11th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, 2012

2011

Randomness Efficient Testing of Sparse Black Box Identities of Unbounded Degree over the Reals.

Markus Bläser, Christian Engels

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

2009

Average-case approximation ratio of the 2-opt algorithm for the TSP.

Christian Engels, Bodo Manthey

Oper. Res. Lett., 2009