Publications

Articles in Journals and Books

• Unions of Disjoint NP-Complete Sets
  Christian Glaßer, John Hitchcock, Aduri Pavan, Stephen Travers.
  ACM Transactions on Computation Theory, to appear.
  

• The Fault Tolerance of NP-Hard Problems
  Christian Glaßer, Aduri Pavan, Stephen Travers.
  Information and Computation, Volume 209, #3, pages 443-455, 2011.
  

• The Shrinking Property for NP and coNP
  Christian Glaßer, Christian Reitwießner, Victor Selivanov.
  Theoretical Computer Science, Volume 412, #8-10, pages 853-864, 2011.

• Space-Efficient Informational Redundancy
  Christian Glaßer.
  Journal of Computer and System Sciences, Volume 76, #8, pages 792-811, 2010.

• Satisfiability of Algebraic Circuits over Sets of Natural Numbers
  Christian Glaßer, Christian Reitwießner, Stephen Travers, Matthias Waldherr.
  Discrete Applied Mathematics, Volume 158, #13, pages 1394-1403, 2010.

• Equivalence Problems for Circuits over Sets of Natural Numbers
  Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen Travers, Matthias Waldherr.
  Theory of Computing Systems, Volume 46, #1, pages 80-103, 2010.

• Non-Mitotic Sets
  Christian Glaßer, Alan L. Selman, Stephen Travers, Liyu Zhang.
  Theoretical Computer Science, Volume 410, pages 2011-2023, 2009.

• The Informational Content of Canonical Disjoint NP-Pairs
  Christian Glaßer, Alan L. Selman, Liyu Zhang.
  International Journal of Foundations of Computer Science, Volume 20, pages 501-522, 2009.

• Autoreducibility and Mitoticity
  Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang.
  ACM-SIGACT News, Volume 40, #3, pages 60-76, 2009.

• Machines that can Output Empty Words
  Christian Glaßer, Stephen Travers.
  Theory of Computing Systems, Volume 44, #3, pages 369-390, 2009.

• The Complexity of Unions of Disjoint Sets
  Christian Glaßer, Alan L. Selman, Stephen Travers, Klaus W. Wagner.
  Journal of Computer and System Sciences, Volume 74, #7, pages 1173-1187, 2008.

• Splitting NP-Complete Sets
  Christian Glaßer, A. Pavan, Alan L. Selman, Liyu Zhang.
  SIAM Journal on Computing, Volume 37, #5, pages 1517-1535, 2008.

• Languages of Dot-Depth 3/2
  Christian Glaßer, Heinz Schmitz.
  Theory of Computing Systems, Volume 42, #2, pages 256-286, 2008.

• Languages Polylog-Time Reducible to Dot-Depth 1/2
  Christian Glaßer.
  Journal of Computer and System Sciences, Volume 73, #1, pages 36-56, 2007.

• Canonical Disjoint NP-Pairs of Propositional Proof Systems
  Christian Glaßer, Alan L. Selman, Liyu Zhang.
  Theoretical Computer Science, Volume 370, pages 60-73, 2007.

• Autoreducibility, Mitoticity, and Immunity
  Christian Glaßer, Mitsunori Ogihara, A. Pavan, Alan L. Selman, Liyu Zhang.
  Journal of Computer and System Sciences, Volume 73, #5, pages 735-754, 2007.

• Error-Bounded Probabilistic Computations between MA and AM
  Elmar Böhler, Christian Glaßer, Daniel Meister.
  Journal of Computer and System Sciences, Volume 72, #6, pages 1043-1076, 2006.

• Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems
  Christian Glaßer, Alan L. Selman, Liyu Zhang.
  Theoretical Computer Science: Essays in Memory of Shimon Even, Lecture Notes in Computer Science 3895, pages 241-253, 2006.

• Properties of NP-Complete Sets
  Christian Glaßer, A. Pavan, Alan L. Selman, Samik Sengupta.
  SIAM Journal on Computing, Volume 36, #2, pages 516-542, 2006.

• Generation Problems
  Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner.
  Theoretical Computer Science, Volume 345 (Special Issue MFCS 2004), #2-3, pages 260-295, 2005.

• Reductions between Disjoint NP-Pairs
  Christian Glaßer, Alan L. Selman, Samik Sengupta.
  Information and Computation, Volume 200, #2, pages 247-267, 2005.

• The Complexity of Base Station Positioning in Cellular Networks
  Christian Glaßer, Steffen Reith, Heribert Vollmer.
  Discrete Applied Mathematics, Volume 148, #1, pages 1-12, 2005.

• Disjoint NP-Pairs
  Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang.
  SIAM Journal on Computing, Volume 33, #6, pages 1369-1416, 2004.

• Relativizing Function Classes
  Christian Glaßer, Gerd Wechsung.
  Journal of Universal Computer Science, Volume 9, #1, pages 34-50, 2003.

• The Boolean Structure of Dot-Depth One
  Christian Glaßer, Heinz Schmitz.
  Journal of Automata, Languages and Combinatorics, Volume 6, #4, pages 437-452, 2001.

• A Moment of Perfect Clarity II: Consequences of Sparse Sets Hard for NP with Respect to Weak Reductions
  Christian Glaßer, Lane A. Hemaspaandra.
  ACM-SIGACT News, Volume 31, #4, December 2000.

• A Moment of Perfect Clarity I: The Parallel Census Technique
  Christian Glaßer, Lane A. Hemaspaandra.
  ACM-SIGACT News, Volume 31, #3, September 2000.

Publications in Conference Proceedings

• 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.
  International Colloquium on Automata, Languages, and Programming (ICALP), Riga, Latvia, 2013.
  Lecture Notes in Computer Science 7965, pages 473-484, Springer-Verlag, 2013.
  

• Structural Complexity of Multiobjective NP Search Problems
  Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek.
  Latin American Symposium on Theoretical Informatics (LATIN), Arequipa, Peru, 2012.
  Lecture Notes in Computer Science 7256, pages 338-349, Springer-Verlag, 2012.
  

• Unions of Disjoint NP-Complete Sets
  Christian Glaßer, John Hitchcock, Aduri Pavan, Stephen Travers.
  International Computing and Combinatorics Conference (COCOON), Dallas, TX, USA, 2011.
  Lecture Notes in Computer Science 6842, pages 240-251, Springer-Verlag, 2011.
  

• Applications of Discrepancy Theory in Multiobjective Approximation
  Christian Glaßer, Christian Reitwießner, Maximilian Witek.
  Foundations of Software Technology and Theoretical Computer Science (FSTTCS), Mumbai, India, 2011.
  Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, pages 337-348, ISBN 978-3-939897-34-7, IBFI Schloss Dagstuhl, 2011.
  

• Approximability and Hardness in Multi-Objective Optimization
  Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek.
  Computability in Europe (CiE), 2010.
  Lecture Notes in Computer Science 6158, pages 180-189, 2010.

• The Fault Tolerance of NP-Hard Problems
  Christian Glaßer, Aduri Pavan, Stephen Travers.
  International Conference on Language and Automata Theory and Applications (LATA), 2009.
  Lecture Notes in Computer Science 5457, pages 374-385, Springer-Verlag, 2009.

• Multiobjective Disk Cover Admits a PTAS
  Christian Glaßer, Christian Reitwießner, Heinz Schmitz.
  International Symposium on Algorithms and Computation (ISAAC), 2008.
  Lecture Notes in Computer Science 5369, pages 40-51, Springer-Verlag, 2008.

• Space-Efficient Informational Redundancy
  Christian Glaßer.
  International Symposium on Algorithms and Computation (ISAAC), 2008.
  Lecture Notes in Computer Science 5369, pages 448-459, Springer-Verlag, 2008.

• The Shrinking Property for NP and coNP
  Christian Glaßer, Christian Reitwießner, Victor Selivanov.
  Computability in Europe (CiE), 2007.
  Lecture Notes in Computer Science 5028, pages 210-220, Springer-Verlag, 2008.

• Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages
  Christian Glaßer, Heinz Schmitz, Victor Selivanov.
  Symposium on Theoretical Aspects of Computer Science (STACS), Bordeaux, France, 2008.
  Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science, pages 337-348, ISBN 978-3-939897-06-4, IBFI Schloss Dagstuhl, 2008.
  

• Satisfiability of Algebraic Circuits over Sets of Natural Numbers
  Christian Glaßer, Christian Reitwießner, Stephen Travers, Matthias Waldherr.
  Foundations of Software Technology and Theoretical Computer Science (FSTTCS), New Delhi, India, 2007.
  Lecture Notes in Computer Science 4855, pages 253-264, Springer-Verlag, 2007.

• Non-Mitotic Sets
  Christian Glaßer, Alan L. Selman, Stephen Travers, Liyu Zhang.
  Foundations of Software Technology and Theoretical Computer Science (FSTTCS), New Delhi, India, 2007.
  Lecture Notes in Computer Science 4855, pages 146-157, Springer-Verlag, 2007.

• Equivalence Problems for Circuits over Sets of Natural Numbers
  Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen Travers, Matthias Waldherr.
  International Computer Science Symposium in Russia (CSR), Ekaterinburg, Russia, 2007.
  Lecture Notes in Computer Science 4649, pages 127-138, Springer-Verlag, 2007.

• The Informational Content of Canonical Disjoint NP-Pairs
  Christian Glaßer, Alan L. Selman, Liyu Zhang.
  International Computing and Combinatorics Conference (COCOON), Banff, Alberta, Canada, 2007.
  Lecture Notes in Computer Science 4598, pages 307-317, Springer-Verlag, 2007.

• The Complexity of Unions of Disjoint Sets
  Christian Glaßer, Alan L. Selman, Stephen Travers, Klaus W. Wagner.
  Symposium on Theoretical Aspects of Computer Science (STACS), Aachen, Germany, 2007.
  Lecture Notes in Computer Science 4393, pages 248-259, Springer-Verlag, 2007.

• Machines that can Output Empty Words
  Christian Glaßer, Stephen Travers.
  International Symposium on Mathematical Foundations of Computer Science (MFCS), Stará Lesná, Slovakia, 2006.
  Lecture Notes in Computer Science 4162, pages 436-446, Springer-Verlag, 2006.

• Perfect Correspondences between Dot-Depth and Polynomial-Time Hierarchy
  Christian Glaßer, Stephen Travers, Klaus W. Wagner.
  Conference on Developments in Language Theory (DLT), Santa Barbara, USA, 2006.
  Lecture Notes in Computer Science 4036, pages 408-419, Springer-Verlag, 2006.

• Mitosis in Computational Complexity
  Christian Glaßer, A. Pavan, Alan L. Selman, Liyu Zhang.
  Theory and Applications of Models of Computation (TAMC), Beijing, China, 2006.
  Lecture Notes in Computer Science 3959, pages 61-67, Springer-Verlag, 2006.

• Redundancy in Complete Sets
  Christian Glaßer, A. Pavan, Alan L. Selman, Liyu Zhang.
  Symposium on Theoretical Aspects of Computer Science (STACS), Marseille, France, 2006.
  Lecture Notes in Computer Science 3884, pages 444-454, Springer-Verlag, 2006.

• Autoreducibility, Mitoticity, and Immunity
  Christian Glaßer, Mitsunori Ogihara, A. Pavan, Alan L. Selman, Liyu Zhang.
  International Symposium on Mathematical Foundations of Computer Science (MFCS), Gdansk, Poland, 2005.
  Lecture Notes in Computer Science 3618, pages 387-398, Springer-Verlag, 2005.

• Canonical Disjoint NP-Pairs of Propositional Proof Systems
  Christian Glaßer, Alan L. Selman, Liyu Zhang.
  International Symposium on Mathematical Foundations of Computer Science (MFCS), Gdansk, Poland, 2005.
  Lecture Notes in Computer Science 3618, pages 399-409, Springer-Verlag, 2005.

• Polylog-Time Reductions Decrease Dot-Depth
  Christian Glaßer.
  Symposium on Theoretical Aspects of Computer Science (STACS), Stuttgart, Germany, 2005.
  Lecture Notes in Computer Science 3404, pages 170-181, Springer-Verlag, 2005.

• A Protocol for Serializing Unique Strategies
  Marcel Crasmaru, Christian Glaßer, Kenneth W. Regan, Samik Sengupta.
  International Symposium on Mathematical Foundations of Computer Science (MFCS), Prague, Czech Republic, 2004.
  Lecture Notes in Computer Science 3153, pages 660-672, Springer-Verlag, 2004.

• Generation Problems
  Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus Wagner.
  International Symposium on Mathematical Foundations of Computer Science (MFCS), Prague, Czech Republic, 2004.
  Lecture Notes in Computer Science 3153, pages 392-403, Springer-Verlag, 2004.

• Properties of NP-Complete Sets
  Christian Glaßer, A. Pavan, Alan L. Selman, Samik Sengupta.
  Conference on Computational Complexity (CCC), Amherst, USA, 2004.
  Proceedings of 19th Annual IEEE Conference on Computational Complexity, pages 184-197, 2004.

• Reductions between Disjoint NP-Pairs
  Christian Glaßer, Alan L. Selman, Samik Sengupta.
  Conference on Computational Complexity (CCC), Amherst, USA, 2004.
  Proceedings of 19th Annual IEEE Conference on Computational Complexity, pages 42-53, 2004.

• Error-Bounded Probabilistic Computations between MA and AM
  Elmar Böhler, Christian Glaßer, Daniel Meister.
  International Symposium on Mathematical Foundations of Computer Science (MFCS), Bratislava, Slovak Republic, 2003.
  Lecture Notes in Computer Science 2747, pages 249-258, Springer-Verlag, 2003.

• Disjoint NP-Pairs
  Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang.
  Conference on Computational Complexity (CCC), Aarhus, Denmark, 2003.
  Proceedings of 18th Annual IEEE Conference on Computational Complexity, pages 313-332, 2003.

• Level 5/2 of the Straubing-Thérien Hierarchy for two-letter Alphabets
  Christian Glaßer, Heinz Schmitz.
  Conference on Developments in Language Theory (DLT), Vienna, Austria, 2001.
  Lecture Notes in Computer Science 2295, pages 251-261, Springer-Verlag, 2002.

• A Polynomial-Time Approximation Scheme for Base Station Positioning in UMTS Networks
  Matthias Galota, Christian Glaßer, Steffen Reith, Heribert Vollmer.
  Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications (DIALM), Rome, Italy, 2001.
  Proceedings 5th Discrete Algorithms and Methods for Mobile Computing and Communications, pages 52-59.

• Decidable Hierarchies of Starfree Languages
  Christian Glaßer, Heinz Schmitz.
  Foundations of Software Technology and Theoretical Computer Science (FSTTCS), New Delhi, India, 2000.
  Lecture Notes in Computer Science 1974, pages 503-515, Springer-Verlag, 2000.

• The Boolean Structure of Dot-Depth One
  Christian Glaßer, Heinz Schmitz.
  Workshop on Descriptional Complexity of Automata, Grammars and Related Structures (DCAGRS), London, Ontario, 2000.

• The Complexity of Base Station Positioning in Cellular Networks
  Christian Glaßer, Steffen Reith, Heribert Vollmer.
  Workshop on Approximation and Randomized Algorithms in Communication Networks (ARACNE), Geneva, Switzerland, 2000.
  Approximation and Randomized Algorithms in Communication Networks, Proceedings of ICALP 2000 Workshops, pages 167-177.

• Languages of Dot-Depth 3/2
  Christian Glaßer, Heinz Schmitz.
  Symposium on Theoretical Aspects of Computer Science (STACS), Lille, France, 2000.
  Lecture Notes in Computer Science 1770, pages 555-566, Springer-Verlag, 2000.

Technical Reports

• 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.
  Electronic Colloquium on Computational Complexity, Report TR13-047, 2013.
  

• Applications of Discrepancy Theory in Multiobjective Approximation
  Christian Glaßer, Christian Reitwießner, Maximilian Witek.
  Technical Report, arXiv:1107.0634, 2011.
  

• The Complexity of Solving Multiobjective Optimization Problems and its Relation to Multivalued Functions
  Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek.
  Electronic Colloquium on Computational Complexity, Report TR11-053, 2011.
  

• Balanced Combinations of Solutions in Multi-Objective Optimization
  Christian Glaßer, Christian Reitwießner, Maximilian Witek.
  Technical Report, arXiv:1007.5475, 2010.
  

• Hardness and Approximability in Multi-Objective Optimization
  Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek.
  Electronic Colloquium on Computational Complexity, Report TR10-031, 2010.
  

• Improved and Generalized Approximations for Two-Objective Traveling Salesman
  Christian Glaßer, Christian Reitwießner, Maximilian Witek.
  Electronic Colloquium on Computational Complexity, Report TR09-076, 2009.
  

• Multiobjective Disk Cover Admits a PTAS
  Christian Glaßer, Christian Reitwießner, Heinz Schmitz.
  Technical Report TR443, University at Würzburg, 2008.
  

• The Shrinking Property for NP and coNP
  Christian Glaßer, Christian Reitwießner, Victor Selivanov.
  Electronic Colloquium on Computational Complexity, Report TR08-029, March 2008.
  (Also appears as Technical Report TR440, University at Würzburg, 2008.)
  

• False Positives and NP-Hard Sets
  Christian Glaßer, A. Pavan, Stephen Travers.
  Technical Report TR435, University at Würzburg, 2007.
  

• Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages
  Christian Glaßer, Heinz Schmitz, Victor Selivanov.
  Electronic Colloquium on Computational Complexity, Report TR07-094, October 2007.
  (Also appears as Technical Report TR429, University at Würzburg, 2007.)
  

• Satisfiability of Algebraic Circuits over Sets of Natural Numbers
  Christian Glaßer, Christian Reitwießner, Stephen Travers, Matthias Waldherr.
  Technical Report TR402, University at Würzburg, 2007.
  

• The Informational Content of Canonical Disjoint NP-Pairs
  Christian Glaßer, Alan L. Selman, Liyu Zhang.
  Electronic Colloquium on Computational Complexity, Report TR07-018, March 2007.
  

• Logspace Mitoticity
  Christian Glaßer.
  Technical Report TR400, University at Würzburg, 2007.
  

• Equivalence Problems for Circuits over Sets of Natural Numbers
  Christian Glaßer, Katrin Herr, Christian Reitwießner, Stephen Travers, Matthias Waldherr.
  Technical Report TR392, University at Würzburg, 2006.
  

• Non-Mitotic Sets
  Christian Glaßer, Alan L. Selman, Stephen Travers, Liyu Zhang.
  Electronic Colloquium on Computational Complexity, Report TR06-090, July 2006.
  (Also appears as Technical Report TR389, University at Würzburg, 2006.)
  

• The Complexity of Unions of Disjoint Sets
  Christian Glaßer, Alan L. Selman, Stephen Travers, Klaus W. Wagner.
  Electronic Colloquium on Computational Complexity, Report TR06-069, May 2006.
  (Also appears as Technical Report TR384, University at Würzburg, 2006.)
  

• Machines that can Output Empty Words
  Christian Glaßer, Stephen Travers.
  Electronic Colloquium on Computational Complexity, Report TR05-147, December 2005.
  (Also appears as Technical Report TR376, University at Würzburg, 2005.)
  

• Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems
  Christian Glaßer, Alan L. Selman, Liyu Zhang.
  Electronic Colloquium on Computational Complexity, Report TR05-072, July 2005.
  (Also appears as Technical Report 2005-19, Department of Computer Science, University at Buffalo, 2005.)
  

• Redundancy in Complete Sets
  Christian Glaßer, A. Pavan, Alan L. Selman, Liyu Zhang.
  Electronic Colloquium on Computational Complexity, Report TR05-068, July 2005.
  (Also appears as Technical Report 2005-18, Department of Computer Science, University at Buffalo, 2005.)
  

• A Reducibility that Corresponds to Unbalanced Leaf-Language Classes
  Christian Glaßer, Stephen Travers, Klaus W. Wagner.
  Electronic Colloquium on Computational Complexity, Report TR05-035, April 2005.
  (Also appears as Technical Report No. 354, University of Wuerzburg, 2005.)
  

• Autoreducibility, Mitoticity, and Immunity
  Christian Glaßer, Mitsunori Ogihara, A. Pavan, Alan L. Selman, Liyu Zhang.
  Electronic Colloquium on Computational Complexity, Report TR05-011, January 2005.
  (Also appears as Technical Report 2004-22, Department of Computer Science, University at Buffalo, 2004.)
  

• Canonical Disjoint NP-Pairs of Propositional Proof Systems
  Christian Glaßer, Alan L. Selman, Liyu Zhang.
  Electronic Colloquium on Computational Complexity, Report TR04-106, November 2004.
  

• Generation Problems
  Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus Wagner.
  Electronic Colloquium on Computational Complexity, Report TR04-037, April 2004.
  (Also appears as Technical Report No. 329, University of Wuerzburg, 2004.)
  

• Properties of NP-Complete Sets
  Christian Glaßer, A. Pavan, Alan L. Selman, Samik Sengupta.
  Electronic Colloquium on Computational Complexity, Report TR04-019, March 2004.
  

• Counting with Counterfree Automata
  Christian Glaßer.
  Electronic Colloquium on Computational Complexity, Report TR04-011, 2004.
  (Also appears as Technical Report No. 315, University of Wuerzburg, 2004.)
  

• Small Bounded-Error Computations and Completeness
  Elmar Böhler, Christian Glaßer, Daniel Meister.
  Technical Report No. 311, University of Wuerzburg, 2003.
  

• Reductions between Disjoint NP-Pairs
  Christian Glaßer, Alan L. Selman, Samik Sengupta.
  Electronic Colloquium on Computational Complexity, Report TR03-027, April 2003.
  (Also appears as Technical Report 2003-04, Department of Computer Science, University at Buffalo, 2003.)
  

• Disjoint NP-Pairs
  Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang.
  Electronic Colloquium on Computational Complexity, Report TR03-011, February 2003.
  (Also appears as Technical Report 2003-02, Department of Computer Science, University at Buffalo, 2003.)
  

• Error-Bounded Probabilistic Computations between MA and AM
  Elmar Böhler, Christian Glaßer, Daniel Meister.
  Technical Report No. 299, University of Wuerzburg, 2002.
  

• A Moment of Perfect Clarity II: Consequences of Sparse Sets Hard for NP with Respect to Weak Reductions
  Christian Glaßer, Lane A. Hemaspaandra.
  Technical Report No. 738, University of Rochester Department of Computer Science, November 2000.
  (Also appears as ACM Computing Research Repository Technical Report cs.CC/0011019, November 2000.)
  

• A Moment of Perfect Clarity I: The Parallel Census Technique
  Christian Glaßer, Lane A. Hemaspaandra.
  Technical Report No. 735, University of Rochester Department of Computer Science, July 2000.
  (Also appears as ACM Computing Research Repository Technical Report cs.CC/0007025, July 2000.)
  

• A Polynomial-Time Approximation Scheme for Base Station Positioning in UMTS Networks
  Matthias Galota, Christian Glaßer, Steffen Reith, Heribert Vollmer.
  Technical Report No. 264, University of Wuerzburg, 2000.
  

• Concatenation Hierarchies and Forbidden Patterns
  Christian Glaßer, Heinz Schmitz.
  Technical Report No. 256, University of Wuerzburg, 2000.
  

• The Complexity of Base Station Positioning in Cellular Networks
  Christian Glaßer, Steffen Reith, Heribert Vollmer.
  Technical Report No. 252, University of Wuerzburg, 2000.
  

• Consequences of the Existence of Sparse Sets Hard for NP under a Subclass of Truth-Table Reductions
  Christian Glaßer.
  Technical Report No. 245, University of Wuerzburg, 2000.
  

• Languages of Dot-Depth 3/2
  Christian Glaßer, Heinz Schmitz.
  Technical Report No. 243, University of Wuerzburg, 1999.
  

• Approximation Algorithms for Cellular Network Optimization
  Christian Glaßer, Steffen Reith, Heribert Vollmer.
  Technical Report No. 232, University of Wuerzburg, 1999.
  

• The Boolean Hierarchy over Dot-Depth 1/2
  Christian Glaßer.
  Technical Report No. 230, University of Wuerzburg, 1999.
  

• Relativizing Function Classes
  Christian Glaßer, Gerd Wechsung.
  Technical Report No. 219, University of Wuerzburg, 1999.
  

• A Normalform for Classes of Concatenation Hierarchies
  Christian Glaßer.
  Technical Report No. 216, University of Wuerzburg, 1998.
  

• On the approximability of problems for cellular networks
  Christian Glaßer.
  Technical Report No. 208, University of Wuerzburg, 1998.
  

• Klassifizierung der Nicht-Approximierbarkeit eines Basisstationsproblems mit Interferenzen
  Christian Glaßer.
  Technical Report No. 197, University of Wuerzburg, 1998.
  

Theses

• NP-Completeness and Disjoint NP-Pairs
  Christian Glaßer.
  Habilitation Thesis, University of Wuerzburg, July 2006.
  

• Forbidden-Patterns and Word Extensions for Concatenation Hierarchies
  Christian Glaßer.
  PhD Thesis, University of Wuerzburg, September 2001.
  

• Relativierungen von Funktionenklassen
  Christian Glaßer.
  Diploma Thesis, University of Jena, 1997.