Christian Glaßer

Christian Glasser

	2012
82		Krzysztof Fleszar, Christian Glaßer, Fabian Lipp, Christian Reitwießner, Maximilian Witek: Structural Complexity of Multiobjective NP Search Problems. LATIN 2012: 338-349
	2011
81		Christian Glaßer, John M. Hitchcock, Aduri Pavan, Stephen D. Travers: Unions of Disjoint NP-Complete Sets. COCOON 2011: 240-251
80		Christian Glaßer, Christian Reitwießner, Maximilian Witek: Applications of Discrepancy Theory in Multiobjective Approximation. FSTTCS 2011: 55-65
79		Christian Glaßer, Christian Reitwießner, Maximilian Witek: Applications of Discrepancy Theory in Multiobjective Approximation CoRR abs/1107.0634: (2011)
78		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)
77		Christian Glaßer, Aduri Pavan, Stephen D. Travers: The fault tolerance of NP-hard problems. Inf. Comput. 209(3): 443-455 (2011)
76		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)
	2010
75		Christian Glaßer, Christian Reitwießner, Heinz Schmitz, Maximilian Witek: Approximability and Hardness in Multi-objective Optimization. CiE 2010: 180-189
74		Christian Glaßer, Christian Reitwießner, Maximilian Witek: Balanced Combinations of Solutions in Multi-Objective Optimization CoRR abs/1007.5475: (2010)
73		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)
72		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)
71		Christian Glaßer: Space-efficient informational redundancy. J. Comput. Syst. Sci. 76(8): 792-811 (2010)
70		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)
	2009
69		Christian Glaßer, Aduri Pavan, Stephen D. Travers: The Fault Tolerance of NP-Hard Problems. LATA 2009: 374-385
68		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)
67		Christian Glaßer, Alan L. Selman, Liyu Zhang: The Informational Content of Canonical Disjoint NP-Pairs. Int. J. Found. Comput. Sci. 20(3): 501-522 (2009)
66		Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang: Non-mitotic sets. Theor. Comput. Sci. 410(21-23): 2011-2023 (2009)
65		Christian Glaßer, Stephen D. Travers: Machines that Can Output Empty Words. Theory Comput. Syst. 44(3): 369-390 (2009)
	2008
64		Christian Glaßer, Christian Reitwießner, Victor L. Selivanov: The Shrinking Property for NP and coNP. CiE 2008: 210-220
63		Christian Glaßer, Christian Reitwießner, Heinz Schmitz: Multiobjective Disk Cover Admits a PTAS. ISAAC 2008: 40-51
62		Christian Glaßer: Space-Efficient Informational Redundancy. ISAAC 2008: 448-459
61		Christian Glasser, Heinz Schmitz, Victor L. Selivanov: Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. STACS 2008: 337-348
60		Christian Glasser, Heinz Schmitz, Victor L. Selivanov: Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages CoRR abs/0802.2868: (2008)
59		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)
58		Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner: The complexity of unions of disjoint sets. J. Comput. Syst. Sci. 74(7): 1173-1187 (2008)
57		Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang: Splitting NP-Complete Sets. SIAM J. Comput. 37(5): 1517-1535 (2008)
56		Christian Glaßer, Heinz Schmitz: Languages of Dot-Depth 3/2. Theory Comput. Syst. 42(2): 256-286 (2008)
	2007
55		Christian Glaßer, Alan L. Selman, Liyu Zhang: The Informational Content of Canonical Disjoint NP-Pairs. COCOON 2007: 307-317
54		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
53		Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang: Non-mitotic Sets. FSTTCS 2007: 146-157
52		Christian Glaßer, Christian Reitwießner, Stephen D. Travers, Matthias Waldherr: Satisfiability of Algebraic Circuits over Sets of Natural Numbers. FSTTCS 2007: 253-264
51		Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner: The Complexity of Unions of Disjoint Sets. STACS 2007: 248-259
50		Christian Glaßer, Alan L. Selman, Liyu Zhang: The Informational Content of Canonical Disjoint NP-Pairs. Electronic Colloquium on Computational Complexity (ECCC) 14(018): (2007)
49		Christian Glasser, Heinz Schmitz, Victor L. Selivanov: Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages. Electronic Colloquium on Computational Complexity (ECCC) 14(094): (2007)
48		Christian Glaßer: Languages polylog-time reducible to dot-depth 1/2. J. Comput. Syst. Sci. 73(1): 36-56 (2007)
47		Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang: Autoreducibility, mitoticity, and immunity. J. Comput. Syst. Sci. 73(5): 735-754 (2007)
46		Christian Glaßer, Alan L. Selman, Liyu Zhang: Canonical disjoint NP-pairs of propositional proof systems. Theor. Comput. Sci. 370(1-3): 60-73 (2007)
	2006
45		Christian Glaßer, Stephen D. Travers, Klaus W. Wagner: Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy. Developments in Language Theory 2006: 408-419
44		Christian Glaßer, Alan L. Selman, Liyu Zhang: Survey of Disjoint NP-pairs and Relations to Propositional Proof Systems. Essays in Memory of Shimon Even 2006: 241-253
43		Christian Glaßer, Stephen D. Travers: Machines that Can Output Empty Words. MFCS 2006: 436-446
42		Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang: Redundancy in Complete Sets. STACS 2006: 444-454
41		Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang: Mitosis in Computational Complexity. TAMC 2006: 61-67
40		Christian Glaßer, Alan L. Selman, Stephen D. Travers, Klaus W. Wagner: The Complexity of Unions of Disjoint Sets. Electronic Colloquium on Computational Complexity (ECCC) 13(069): (2006)
39		Christian Glaßer, Alan L. Selman, Stephen D. Travers, Liyu Zhang: Non-Mitotic Sets. Electronic Colloquium on Computational Complexity (ECCC) 13(090): (2006)
38		Elmar Böhler, Christian Glaßer, Daniel Meister: Error-bounded probabilistic computations between MA and AM. J. Comput. Syst. Sci. 72(6): 1043-1076 (2006)
37		Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta: Properties of NP-Complete Sets. SIAM J. Comput. 36(2): 516-542 (2006)
	2005
36		Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang: Autoreducibility, Mitoticity, and Immunity. MFCS 2005: 387-398
35		Christian Glaßer, Alan L. Selman, Liyu Zhang: Canonical Disjoint NP-Pairs of Propositional Proof Systems. MFCS 2005: 399-409
34		Christian Glaßer: Polylog-Time Reductions Decrease Dot-Depth. STACS 2005: 170-181
33		Christian Glaßer, Steffen Reith, Heribert Vollmer: The complexity of base station positioning in cellular networks. Discrete Applied Mathematics 148(1): 1-12 (2005)
32		Christian Glaßer, Mitsunori Ogihara, Aduri Pavan, Alan L. Selman, Liyu Zhang: Autoreducibility, Mitoticity, and Immunity Electronic Colloquium on Computational Complexity (ECCC)(011): (2005)
31		Christian Glaßer, Stephen D. Travers, Klaus W. Wagner: A Reducibility that Corresponds to Unbalanced Leaf-Language Classes Electronic Colloquium on Computational Complexity (ECCC)(035): (2005)
30		Christian Glaßer, Aduri Pavan, Alan L. Selman, Liyu Zhang: Redundancy in Complete Sets Electronic Colloquium on Computational Complexity (ECCC)(068): (2005)
29		Christian Glaßer, Alan L. Selman, Liyu Zhang: Survey of Disjoint NP-Pairs and Relations to Propositional Proof Systems Electronic Colloquium on Computational Complexity (ECCC)(072): (2005)
28		Christian Glaßer, Stephen D. Travers: Machines that can Output Empty Words Electronic Colloquium on Computational Complexity (ECCC)(147): (2005)
27		Christian Glaßer, Alan L. Selman, Samik Sengupta: Reductions between disjoint NP-Pairs. Inf. Comput. 200(2): 247-267 (2005)
26		Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner: Generation problems. Theor. Comput. Sci. 345(2-3): 260-295 (2005)
	2004
25		Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta: Properties of NP-Complete Sets. IEEE Conference on Computational Complexity 2004: 184-197
24		Christian Glaßer, Alan L. Selman, Samik Sengupta: Reductions between Disjoint NP-Pairs. IEEE Conference on Computational Complexity 2004: 42-53
23		Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner: Generation Problems. MFCS 2004: 392-403
22		Marcel Crâsmaru, Christian Glaßer, Kenneth W. Regan, Samik Sengupta: A Protocol for Serializing Unique Strategies. MFCS 2004: 660-672
21		Christian Glaßer: Counting with Counterfree Automata Electronic Colloquium on Computational Complexity (ECCC)(011): (2004)
20		Christian Glaßer, Aduri Pavan, Alan L. Selman, Samik Sengupta: Properties of NP-Complete Sets Electronic Colloquium on Computational Complexity (ECCC)(019): (2004)
19		Elmar Böhler, Christian Glaßer, Bernhard Schwarz, Klaus W. Wagner: Generation Problems Electronic Colloquium on Computational Complexity (ECCC)(037): (2004)
18		Christian Glaßer, Alan L. Selman, Liyu Zhang: Canonical Disjoint NP-Pairs of Propositional Proof Systems Electronic Colloquium on Computational Complexity (ECCC)(106): (2004)
17		Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang: Disjoint NP-Pairs. SIAM J. Comput. 33(6): 1369-1416 (2004)
	2003
16		Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang: Disjoint NP-Pairs. IEEE Conference on Computational Complexity 2003: 313-332
15		Elmar Böhler, Christian Glaßer, Daniel Meister: Error-Bounded Probabilistic Computations between MA and AM. MFCS 2003: 249-258
14		Christian Glaßer, Alan L. Selman, Samik Sengupta, Liyu Zhang: Disjoint NP-Pairs Electronic Colloquium on Computational Complexity (ECCC) 10(011): (2003)
13		Christian Glaßer, Alan L. Selman, Samik Sengupta: Reductions between Disjoint NP-Pairs Electronic Colloquium on Computational Complexity (ECCC) 10(027): (2003)
12		Elmar Böhler, Christian Glaßer, Daniel Meister: Small Bounded-Error Computations and Completeness Electronic Colloquium on Computational Complexity (ECCC)(069): (2003)
11		Christian Glaßer, Gerd Wechsung: Relativizing Function Classes. J. UCS 9(1): 34-50 (2003)
	2001
10		Matthias Galota, Christian Glaßer, Steffen Reith, Heribert Vollmer: A polynomial-time approximation scheme for base station positioning in UMTS networks. DIAL-M 2001: 52-59
9		Christian Glaßer, Heinz Schmitz: Level 5/2 of the Straubing-Thérien Hierarchy for Two-Letter Alphabets. Developments in Language Theory 2001: 251-261
8		Christian Glaßer, Heinz Schmitz: The Boolean Structure of Dot-Depth One. Journal of Automata, Languages and Combinatorics 6(4): 437-452 (2001)
	2000
7		Christian Glaßer, Heinz Schmitz: Decidable Hierarchies of Starfree Languages. FSTTCS 2000: 503-515
6		Christian Glaßer, Steffen Reith, Heribert Vollmer: The Complexity of Base Station Positioning in Cellular Networks. ICALP Satellite Workshops 2000: 167-178
5		Christian Glaßer, Heinz Schmitz: Languages of Dot-Depth 3/2. STACS 2000: 555-566
4		Christian Glaßer, Lane A. Hemaspaandra: A Moment of Perfect Clarity I: The Parallel Census Technique CoRR cs.CC/0007025: (2000)
3		Christian Glaßer, Lane A. Hemaspaandra: A Moment of Perfect Clarity II: Consequences of Sparse Sets Hard for NP with Respect to Weak Reductions CoRR cs.CC/0011019: (2000)
2		Lane A. Hemaspaandra, Christian Glaßer: A moment of perfect clarity I: the parallel census technique. SIGACT News 31(3): 37-42 (2000)
1		Christian Glaßer, Lane A. Hemaspaandra: A moment of perfect clarity II: consequences of sparse sets hard for NP with respect to weak reductions. SIGACT News 31(4): 39-51 (2000)

Coauthor Index

1	Elmar Böhler	[12] [15] [19] [23] [26] [38]
2	Marcel Crâsmaru	[22]
3	Krzysztof Fleszar	[78] [82]
4	Matthias Galota	[10]
5	Lane A. Hemaspaandra (Lane A. Hemachandra)	[1] [2] [3] [4]
6	Katrin Herr	[54] [70]
7	John M. Hitchcock	[81]
8	Fabian Lipp	[78] [82]
9	Daniel Meister	[12] [15] [38]
10	Mitsunori Ogihara (Mitsunori Ogiwara)	[32] [36] [47]
11	Aduri Pavan	[20] [25] [30] [32] [36] [37] [41] [42] [47] [57] [69] [77] [81]
12	Kenneth W. Regan	[22]
13	Steffen Reith	[6] [10] [33]
14	Christian Reitwießner	[52] [54] [59] [63] [64] [68] [70] [72] [73] [74] [75] [76] [78] [79] [80] [82]
15	Heinz Schmitz	[5] [7] [8] [9] [49] [56] [60] [61] [63] [72] [75]
16	Bernhard Schwarz	[19] [23] [26]
17	Victor L. Selivanov	[49] [59] [60] [61] [64] [76]
18	Alan L. Selman	[13] [14] [16] [17] [18] [20] [24] [25] [27] [29] [30] [32] [35] [36] [37] [39] [40] [41] [42] [44] [46] [47] [50] [51] [53] [55] [57] [58] [66] [67]
19	Samik Sengupta	[13] [14] [16] [17] [20] [22] [24] [25] [27] [37]
20	Stephen D. Travers	[28] [31] [39] [40] [43] [45] [51] [52] [53] [54] [58] [65] [66] [69] [70] [73] [77] [81]
21	Heribert Vollmer	[6] [10] [33]
22	Klaus W. Wagner	[19] [23] [26] [31] [40] [45] [51] [58]
23	Matthias Waldherr	[52] [54] [70] [73]
24	Gerd Wechsung	[11]
25	Maximilian Witek	[68] [72] [74] [75] [78] [79] [80] [82]
26	Liyu Zhang	[14] [16] [17] [18] [29] [30] [32] [35] [36] [39] [41] [42] [44] [46] [47] [50] [53] [55] [57] [66] [67]

Last update Thu May 31 18:55:10 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page