- CSB - MetaPress - Google - Bing - Yahoo
 | 2013 | |
|---|---|---|
| i7 |      | Christian Glaßer, Dung Nguyen, Christian Reitwießner, Alan L. Selman, Maximilian Witek: Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions. Electronic Colloquium on Computational Complexity (ECCC) 20: 47 (2013) |
| 2012 | ||
| j5 | | Alexander Okhotin, Christian Reitwießner: Parsing Boolean grammars over a one-letter alphabet using online convolution. Theor. Comput. Sci. 457: 149-157 (2012) |
| c8 | | Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek: Structural Complexity of Multiobjective NP Search Problems. LATIN 2012: 338-349 |
| 2011 | ||
| j4 | | Christian Glaßer, Christian Reitwießner, Victor L. Selivanov: The shrinking property for NP and coNP. Theor. Comput. Sci. 412(8-10): 853-864 (2011) |
| c7 | | Christian Glaßer, Christian Reitwießner, Maximilian Witek: Applications of Discrepancy Theory in Multiobjective Approximation. FSTTCS 2011: 55-65 |
| i6 | | Christian Glaßer, Christian Reitwießner, Maximilian Witek: Applications of Discrepancy Theory in Multiobjective Approximation. CoRR abs/1107.0634 (2011) |
| i5 | | Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek: The Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions. Electronic Colloquium on Computational Complexity (ECCC) 18: 53 (2011) |
| 2010 | ||
| j3 | | Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr: Satisfiability of algebraic circuits over sets of natural numbers. Discrete Applied Mathematics 158(13): 1394-1403 (2010) |
| j2 | | Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr: Equivalence Problems for Circuits over Sets of Natural Numbers. Theory Comput. Syst. 46(1): 80-103 (2010) |
| j1 | | Alexander Okhotin, Christian Reitwießner: Conjunctive grammars with restricted disjunction. Theor. Comput. Sci. 411(26-28): 2559-2571 (2010) |
| c6 | | Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek: Approximability and Hardness in Multi-objective Optimization. CiE 2010: 180-189 |
| i4 | | Christian Glaßer, Christian Reitwießner, Maximilian Witek: Balanced Combinations of Solutions in Multi-Objective Optimization. CoRR abs/1007.5475 (2010) |
| i3 | | Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek: Hardness and Approximability in Multi-Objective Optimization. Electronic Colloquium on Computational Complexity (ECCC) 17: 31 (2010) |
| 2009 | ||
| c5 | | Alexander Okhotin, Christian Reitwießner: Conjunctive Grammars with Restricted Disjunction. SOFSEM 2009: 425-436 |
| i2 | | Christian Glaßer, Christian Reitwießner, Maximilian Witek: Improved and Derandomized Approximations for Two-Criteria Metric Traveling Salesman. Electronic Colloquium on Computational Complexity (ECCC) 16: 76 (2009) |
| 2008 | ||
| c4 | | Christian Glaßer, Christian Reitwießner, Victor L. Selivanov: The Shrinking Property for NP and coNP. CiE 2008: 210-220 |
| c3 | | Christian Glaßer, Christian Reitwießner, Heinz Schmitz: Multiobjective Disk Cover Admits a PTAS. ISAAC 2008: 40-51 |
| i1 | | Christian Glaßer, Christian Reitwießner, Victor L. Selivanov: The Shrinking Property for NP and coNP. Electronic Colloquium on Computational Complexity (ECCC) 15(029) (2008) |
| 2007 | ||
| c2 | | Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr: Equivalence Problems for Circuits over Sets of Natural Numbers. CSR 2007: 127-138 |
| c1 | | Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr: Satisfiability of Algebraic Circuits over Sets of Natural Numbers. FSTTCS 2007: 253-264 |
Data released under the ODC-BY 1.0 license — See also our legal information page