default search action
Christian Engels
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i10]Niranka Banerjee, Christian Engels, Duc A. Hoang:
Distance Recoloring. CoRR abs/2402.12705 (2024) - 2023
- [i9]Sankardeep Chakraborty, Christian Engels, Seungbum Jo, Mingmou Liu:
Cell-Probe Lower Bound for Accessible Interval Graphs. CoRR abs/2311.02839 (2023) - 2022
- [c9]Sankardeep Chakraborty, Christian Engels:
Lower Bounds for Lexicographical DFS Data Structures. DCC 2022: 449 - 2020
- [j5]Christian Engels, B. V. Raghavendra Rao:
On hard instances of non-commutative permanent. Discret. Appl. Math. 277: 127-138 (2020) - [j4]Christian Engels, Mohit Garg, Kazuhisa Makino, Anup Rao:
On Expressing Majority as a Majority of Majorities. SIAM J. Discret. Math. 34(1): 730-741 (2020)
2010 – 2019
- 2019
- [c8]Markus Bläser, Christian Engels:
Parameterized Valiant's Classes. IPEC 2019: 3:1-3:14 - [i8]Markus Bläser, Christian Engels:
Parameterized Valiant's Classes. CoRR abs/1907.12287 (2019) - 2018
- [c7]Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan:
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. FOCS 2018: 934-945 - [i7]Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan:
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. CoRR abs/1804.02520 (2018) - [i6]Suryajith Chillara, Christian Engels, Nutan Limaye, Srikanth Srinivasan:
A Near-Optimal Depth-Hierarchy Theorem for Small-Depth Multilinear Circuits. Electron. Colloquium Comput. Complex. TR18 (2018) - 2017
- [c6]Christian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
On \varSigma \wedge \varSigma \wedge \varSigma Circuits: The Role of Middle \varSigma Fan-In, Homogeneity and Bottom Degree. FCT 2017: 230-242 - [i5]Christian Engels, Mohit Garg, Kazuhisa Makino, Anup Rao:
On Expressing Majority as a Majority of Majorities. Electron. Colloquium Comput. Complex. TR17 (2017) - 2016
- [b1]Christian Engels:
Why are certain polynomials hard?: A look at non-commutative, parameterized and homomorphism polynomials. Saarland University, 2016 - [j3]Christian Engels:
Dichotomy Theorems for Homomorphism Polynomials of Graph Classes. J. Graph Algorithms Appl. 20(1): 3-22 (2016) - [c5]Christian Engels, B. V. Raghavendra Rao:
On Hard Instances of Non-Commutative Permanent. COCOON 2016: 171-181 - [i4]Christian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah:
Lower Bounds and Identity Testing for Projections of Power Symmetric Polynomials. Electron. Colloquium Comput. Complex. TR16 (2016) - 2015
- [j2]Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao:
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems. Algorithmica 73(1): 42-62 (2015) - [c4]Christian Engels:
Dichotomy Theorems for Homomorphism Polynomials of Graph Classes. WALCOM 2015: 282-293 - 2014
- [i3]Christian Engels, B. V. Raghavendra Rao:
New Algorithms and Hard Instances for Non-Commutative Computation. CoRR abs/1409.0742 (2014) - [i2]Christian Engels:
Dichotomy Theorems for Homomorphism Polynomials of Graph Classes. CoRR abs/1412.0423 (2014) - 2013
- [c3]Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao:
Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems. MFCS 2013: 219-230 - [i1]Karl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao:
Random Shortest Paths: Non-Euclidean Instances for Metric Optimization Problems. CoRR abs/1306.3030 (2013) - 2012
- [c2]Christian Engels, Bodo Manthey, B. V. Raghavendra Rao:
Random Shortest Path Metrics with Applications. CTW 2012: 121-124 - 2011
- [c1]Markus Bläser, Christian Engels:
Randomness Efficient Testing of Sparse Black Box Identities of Unbounded Degree over the Reals. STACS 2011: 555-566
2000 – 2009
- 2009
- [j1]Christian Engels, Bodo Manthey:
Average-case approximation ratio of the 2-opt algorithm for the TSP. Oper. Res. Lett. 37(2): 83-84 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint