Startseite > Publikationen

Publikationen


Refereed Journal Articles

C. Brause, M.A. Henning, K. Ozeki, I. Schiermeyer, and E. Vumar: On upper bounds for the independent transversal domination number, Discrete Appl. Math., accepted for publication

C. Brause, T.D. Doan, and I. Schiermeyer: Minimum degree conditions for the proper connection number of graphs, Graphs and Comb. 33(4) (2017) 833-843

C. Brause, A. Kemnitz, M. Marangio, A. Pruchnewski, and M. Voigt: Sum choice number of generalized Θ-graphs, Discrete Math. 231 (2017) 113-118

S. A. van Aardt, C. Brause, A. P. Burger, M. Frick, A. Kemnitz, and I. Schiermeyer: Proper connection and size of graphs, Discrete Math. 340 (2017) 2673-2677

C. Brause: A subexponential-time algorithm for the Maximum Independent Set Problem in P_t-free graphs, Discrete Appl. Math. 231 (2017), 113-118

C. Brause and R. Krivos-Bellus: On a relation between k-path partition and k-path vertex cover, Discrete Appl. Math. 223 (2017) 28-38

C. Brause, M.A. Henning, and M. Krzywkowski: A characterization of trees with equal 2-domination and 2-independence numbers, Discrete Math. Theor. Comput. Sci. 19(1) (2017) #1

C. Brause, D. Rautenbach, and I. Schiermeyer: Local Connectivity, Local Degree Conditions, some Forbidden Induced Subgraphs, and Cycle Extendability, Discrete Math 340 (2017) 596-606

N.C. Lê, C. Brause, and I. Schiermeyer: On Sequential Heuristic Methods for the Maximum Independent Set Problem, Discuss. Math. Graph Theory 37 (2017) 415-426

C. Brause, B. Randerath, D. Rautenbach, and I. Schiermeyer: A Lower Bound on the Independence Number of a Graph in terms of Degrees and Local Clique Sizes, Discrete Appl. Math. 209 (2016), 5967

C. Brause and I. Schiermeyer: Kernelization of the 3-path vertex cover problem, Discrete Math. 339 (2016) 1935-1939

C. Brause, T.D. Doan, and I. Schiermeyer: On the chromatic number of (P_5, K_{2,t})-free graphs, Electronic Notes in Discrete Mathematics, 55 (2016) 121-130

C. Brause, T.D. Doan, and I. Schiermeyer: On the minimum degree and the proper connection number of graphs, Electronic Notes in Discrete Mathematics, 55 (2016) 109-112

C. Brause, T.D. Doan, and I. Schiermeyer: Proper connection number 2, connectivity, and forbidden subgraphs, Electronic Notes in Discrete Mathematics 55 (2016) 105108

C. Brause, N.C. Lê, and I. Schiermeyer: The Maximum Independent Set Problem in Subclasses of Subcubic Graphs, Discrete Math. 338 (2015), 1766-1778

N.C. Lê, C. Brause, and I. Schiermeyer: New sufficient conditions for α-redundant vertices, Discrete Math. 338 (2015), 1674-1680

N.C. Lê, C. Brause, and I. Schiermeyer: Extending the MAX Algorithm for Maximum Independent Set, Discuss. Math. Graph Theory 35 (2015) 365-386

C. Brause, P. Holub, R. Krivos-Bellus, Z. Ryjacek, and I. Schiermeyer, and P. Vrana: 4-colorability of P6-free graphs, Electronic Notes in Discrete Mathematics 49 (2015) 37-42

N.C. Lê, C. Brause, and I. Schiermeyer: The Maximum Independent Set Problem in Subclasses of S_i,j,k-Free Graphs, Electronic Notes in Discrete Mathematics 49 (2015) 43-48

Thesis

C. Brause: Neue polynomiale Heuristiken und Graphenklassen für das Maximum Independent Set Problem, Diplomarbeit, TU Bergakademie Freiberg, 2013

C. Brause: Heuristiken für das Maximum Independent Set Problem, Bachelorarbeit, TU Bergakademie Freiberg, 2011