Christian Engels Coauthor index pubzone.org

Facets and more with CompleteSearch

Listing of the DBLP Bibliography Server - FAQ
Other views (modern): by type - by year
Other mirrors: Trier I - Trier II


Ask others: ACM DL/Guide - CiteSeerx - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2016
b1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Engels: Why are certain polynomials hard?: A look at non-commutative, parameterized and homomorphism polynomials. Saarland University 2016
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Engels: Dichotomy Theorems for Homomorphism Polynomials of Graph Classes. J. Graph Algorithms Appl. 20(1): 3-22 (2016)
c5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Engels, B. V. Raghavendra Rao: On Hard Instances of Non-Commutative Permanent. COCOON 2016: 171-181
i4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Engels, B. V. Raghavendra Rao, Karteek Sreenivasaiah: Lower Bounds and Identity Testing for Projections of Power Symmetric Polynomials. Electronic Colloquium on Computational Complexity (ECCC) 23: 153 (2016)
2015
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKarl 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)
c4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Engels: Dichotomy Theorems for Homomorphism Polynomials of Graph Classes. WALCOM 2015: 282-293
2014
i3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Engels, B. V. Raghavendra Rao: New Algorithms and Hard Instances for Non-Commutative Computation. CoRR abs/1409.0742 (2014)
i2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Engels: Dichotomy Theorems for Homomorphism Polynomials of Graph Classes. CoRR abs/1412.0423 (2014)
2013
c3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKarl Bringmann, Christian Engels, Bodo Manthey, B. V. Raghavendra Rao: Random Shortest Paths: Non-euclidean Instances for Metric Optimization Problems. MFCS 2013: 219-230
i1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLKarl 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
c2no EE pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian Engels, Bodo Manthey, B. V. Raghavendra Rao: Random Shortest Path Metrics with Applications. CTW 2012: 121-124
2011
c1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarkus Bläser, Christian Engels: Randomness Efficient Testing of Sparse Black Box Identities of Unbounded Degree over the Reals. STACS 2011: 555-566
2009
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLChristian 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

1Markus Bläser[c1]
2Karl Bringmann[j2] [c3] [i1]
3Bodo Manthey[j2] [c3] [i1] [c2] [j1]
4B. V. Raghavendra Rao[c5] [i4] [j2] [i3] [c3] [i1] [c2]
5Karteek Sreenivasaiah[i4]

 

Last update 2017-03-29 23:57 CEST by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page