Decidable Hierarchies of Starfree Languages. - Christian Glaßer; Heinz Schmitz (FSTTCS, 2000)

A moment of perfect clarity II: consequences of sparse sets hard for NP with respect to weak reductions. - Christian Glaßer; Lane A. Hemaspaandra (SIGACT News, 2000)

A moment of perfect clarity I: the parallel census technique. - Lane A. Hemaspaandra; Christian Glaßer (SIGACT News, 2000)

A polynomial-time approximation scheme for base station positioning in UMTS networks. - Matthias Galota; Christian Glaßer; Steffen Reith; Heribert Vollmer (DIAL-M, 2001)

Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets. - Christian Glaßer; Heinz Schmitz (Developments in Language Theory, 2001)

The Boolean Structure of Dot-Depth One. - Christian Glaßer; Heinz Schmitz (J. Autom. Lang. Comb., 2001)

Forbidden-patterns and word extensions for concatenation hierarchies. - Christian Glaßer (2001)

Reductions between Disjoint NP-Pairs - Christian Glaßer; Alan L. Selman; Samik Sengupta (Electron. Colloquium Comput. Complex., 2003)

Small Bounded-Error Computations and Completeness - Elmar Böhler; Christian Glaßer; Daniel Meister 001 (Electron. Colloquium Comput. Complex., 2003)

Relativizing Function Classes. - Christian Glaßer; Gerd Wechsung (J. Univers. Comput. Sci., 2003)

A Protocol for Serializing Unique Strategies. - Marcel Crâsmaru; Christian Glaßer; Kenneth W. Regan; Samik Sengupta (MFCS, 2004)

Counting with Counterfree Automata - Christian Glaßer (Electron. Colloquium Comput. Complex., 2004)

Disjoint NP-Pairs. - Christian Glaßer; Alan L. Selman; Samik Sengupta; Liyu Zhang 001 (SIAM J. Comput., 2004)

Polylog-Time Reductions Decrease Dot-Depth. - Christian Glaßer (STACS, 2005)

The complexity of base station positioning in cellular networks. - Christian Glaßer; Steffen Reith; Heribert Vollmer (Discret. Appl. Math., 2005)

A Reducibility that Corresponds to Unbalanced Leaf-Language Classes - Christian Glaßer; Stephen D. Travers; Klaus W. Wagner (Electron. Colloquium Comput. Complex., 2005)

Redundancy in Complete Sets - Christian Glaßer; Aduri Pavan; Alan L. Selman; Liyu Zhang 001 (Electron. Colloquium Comput. Complex., 2005)

Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems - Christian Glaßer; Alan L. Selman; Liyu Zhang 001 (Electron. Colloquium Comput. Complex., 2005)

Machines that can Output Empty Words - Christian Glaßer; Stephen D. Travers (Electron. Colloquium Comput. Complex., 2005)

Generation problems. - Elmar Böhler; Christian Glaßer; Bernhard Schwarz; Klaus W. Wagner (Theor. Comput. Sci., 2005)

Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy. - Christian Glaßer; Stephen D. Travers; Klaus W. Wagner (Developments in Language Theory, 2006)

Mitosis in Computational Complexity. - Christian Glaßer; Aduri Pavan; Alan L. Selman; Liyu Zhang 001 (TAMC, 2006)

Error-bounded probabilistic computations between MA and AM. - Elmar Böhler; Christian Glaßer; Daniel Meister 001 (J. Comput. Syst. Sci., 2006)

Properties of NP-Complete Sets. - Christian Glaßer; Aduri Pavan; Alan L. Selman; Samik Sengupta (SIAM J. Comput., 2006)

The Informational Content of Canonical Disjoint NP-Pairs. - Christian Glaßer; Alan L. Selman; Liyu Zhang 001 (Electron. Colloquium Comput. Complex., 2007)

Languages polylog-time reducible to dot-depth 1/2. - Christian Glaßer (J. Comput. Syst. Sci., 2007)

Autoreducibility, mitoticity, and immunity. - Christian Glaßer; Mitsunori Ogihara; Aduri Pavan; Alan L. Selman; Liyu Zhang 001 (J. Comput. Syst. Sci., 2007)

Canonical disjoint NP-pairs of propositional proof systems. - Christian Glaßer; Alan L. Selman; Liyu Zhang 001 (Theor. Comput. Sci., 2007)

Multiobjective Disk Cover Admits a PTAS. - Christian Glaßer; Christian Reitwießner; Heinz Schmitz (ISAAC, 2008)

The complexity of unions of disjoint sets. - Christian Glaßer; Alan L. Selman; Stephen D. Travers; Klaus W. Wagner (J. Comput. Syst. Sci., 2008)

Languages of Dot-Depth 3/2. - Christian Glaßer; Heinz Schmitz (Theory Comput. Syst., 2008)

Splitting NP-Complete Sets. - Christian Glaßer; Aduri Pavan; Alan L. Selman; Liyu Zhang 001 (SIAM J. Comput., 2008)

Improved and Derandomized Approximations for Two-Criteria Metric Traveling Salesman. - Christian Glaßer; Christian Reitwießner; Maximilian Witek (Electron. Colloquium Comput. Complex., 2009)

Non-mitotic sets. - Christian Glaßer; Alan L. Selman; Stephen D. Travers; Liyu Zhang 001 (Theor. Comput. Sci., 2009)

Approximability and Hardness in Multi-objective Optimization. - Christian Glaßer; Christian Reitwießner; Heinz Schmitz; Maximilian Witek (CiE, 2010)

10501 Abstracts Collection - Advances and Applications of Automata on Words and Trees. - Christian Glaßer; Jean-Eric Pin; Nicole Schweikardt; Victor L. Selivanov; Wolfgang Thomas (Advances and Applications of Automata on Words and Trees, 2010)

10501 Executive Summary - Advances and Applications of Automata on Words and Trees. - Christian Glaßer; Jean-Eric Pin; Nicole Schweikardt; Victor L. Selivanov; Wolfgang Thomas (Advances and Applications of Automata on Words and Trees, 2010)

Balanced Combinations of Solutions in Multi-Objective Optimization - Christian Glaßer; Christian Reitwießner; Maximilian Witek (CoRR, 2010)

Satisfiability of algebraic circuits over sets of natural numbers. - Christian Glaßer; Christian Reitwießner; Stephen D. Travers; Matthias Waldherr (Discret. Appl. Math., 2010)

Hardness and Approximability in Multi-Objective Optimization. - Christian Glaßer; Christian Reitwießner; Heinz Schmitz; Maximilian Witek (Electron. Colloquium Comput. Complex., 2010)

Space-efficient informational redundancy. - Christian Glaßer (J. Comput. Syst. Sci., 2010)

Equivalence Problems for Circuits over Sets of Natural Numbers. - Christian Glaßer; Katrin Herr; Christian Reitwießner; Stephen D. Travers; Matthias Waldherr (Theory Comput. Syst., 2010)

Applications of Discrepancy Theory in Multiobjective Approximation. - Christian Glaßer; Christian Reitwießner; Maximilian Witek (FSTTCS, 2011)

The Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions. - Krzysztof Fleszar 001; Christian Glaßer; Fabian Lipp; Christian Reitwießner; Maximilian Witek (Electron. Colloquium Comput. Complex., 2011)

The fault tolerance of NP-hard problems. - Christian Glaßer; Aduri Pavan; Stephen D. Travers (Inf. Comput., 2011)

The shrinking property for NP and coNP. - Christian Glaßer; Christian Reitwießner; Victor L. Selivanov (Theor. Comput. Sci., 2011)

Structural Complexity of Multiobjective NP Search Problems. - Krzysztof Fleszar 001; Christian Glaßer; Fabian Lipp; Christian Reitwießner; Maximilian Witek (LATIN, 2012)

Autoreducibility of Complete Sets for Log-Space and Polynomial-Time Reductions. - Christian Glaßer; Dung T. Nguyen; Christian Reitwießner; Alan L. Selman; Maximilian Witek (Electron. Colloquium Comput. Complex., 2013)

Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes. - Christian Glaßer; Maximilian Witek (Electron. Colloquium Comput. Complex., 2013)

Perfect correspondences between dot-depth and polynomial-time hierarchies. - Christian Glaßer; Stephen D. Travers; Klaus W. Wagner (J. Comput. Syst. Sci., 2014)

Disjoint NP-Pairs and Propositional Proof Systems. - Christian Glaßer; Andrew Hughes; Alan L. Selman; Nils Wisiol (SIGACT News, 2014)

Unions of Disjoint NP-Complete Sets. - Christian Glaßer; John M. Hitchcock; Aduri Pavan; Stephen D. Travers (ACM Trans. Comput. Theory, 2014)

Constraint Satisfaction Problems around Skolem Arithmetic. - Christian Glaßer; Peter Jonsson; Barnaby Martin (CoRR, 2015)

Efficient algorithms for membership in boolean hierarchies of regular languages. - Christian Glaßer; Heinz Schmitz; Victor L. Selivanov (Theor. Comput. Sci., 2016)

Introduction to Autoreducibility and Mitoticity. - Christian Glaßer; Dung T. Nguyen; Alan L. Selman; Maximilian Witek (Computability and Complexity, 2017)

Circuit satisfiability and constraint satisfaction around Skolem Arithmetic. - Christian Glaßer; Peter Jonsson; Barnaby Martin (Theor. Comput. Sci., 2017)

NP-Completeness, Proof Systems, and Disjoint NP-Pairs. - Titus Dose; Christian Glaßer (Electron. Colloquium Comput. Complex., 2019)

Emptiness problems for integer circuits. - Dominik Barth; Moritz Beck 001; Titus Dose; Christian Glaßer; Larissa Michler; Marc Technau (Theor. Comput. Sci., 2020)

Oracle with P = NP ∩ coNP, but No Many-One Completeness in UP, DisjNP, and DisjCoNP. - Anton Ehrmanntraut; Fabian Egidy; Christian Glaßer (MFCS, 2022)

Upward Translation of Optimal and P-Optimal Proof Systems in the Boolean Hierarchy over NP. - Fabian Egidy; Christian Glaßer; Martin G. Herold (MFCS, 2023)

An Oracle with no UP-Complete Sets, but NP = PSPACE. - David Dingel; Fabian Egidy; Christian Glaßer (MFCS, 2024)

Oracle without Optimal Proof Systems outside Nondeterministic Subexponential Time. - Fabian Egidy; Christian Glaßer (CoRR, 2024)

The Complexity of Computing Second Solutions. - Fabian Egidy; Christian Glaßer; Fynn Godau (MFCS, 2025)

Optimal Proof Systems for Complex Sets Are Hard to Find. - Fabian Egidy; Christian Glaßer (STOC, 2025)