Bert Randerath

2008
24	EE	Ulrich Faigle, Bert Randerath, Rainer Schrader: Preface for CTW2005 special issue. Discrete Applied Mathematics 156(17): 3155 (2008)
2007
23	EE	Van Bang Le, Bert Randerath, Ingo Schiermeyer: On the complexity of 4-coloring graphs without long induced paths. Theor. Comput. Sci. 389(1-2): 330-335 (2007)
2006
22	EE	Stefan Porschen, Ewald Speckenmeyer, Bert Randerath: On Linear CNF Formulas. SAT 2006: 212-225
21	EE	Bert Randerath, Preben D. Vestergaard: Well-covered graphs and factors. Discrete Applied Mathematics 154(9): 1416-1428 (2006)
2005
20	EE	Stefan Porschen, Bert Randerath, Ewald Speckenmeyer: Exact 3-satisfiability is decidable in time O(20.16254n). Ann. Math. Artif. Intell. 43(1): 173-193 (2005)
2004
19	EE	Bert Randerath, Ingo Schiermeyer: 3-Colorability in P for P6-free graphs. Discrete Applied Mathematics 136(2-3): 299-313 (2004)
18	EE	Bert Randerath: 3-Colorability and forbidden subgraphs. I: Characterizing pairs. Discrete Mathematics 276(1-3): 313-325 (2004)
17	EE	Bert Randerath, Ingo Schiermeyer: Vertex Colouring and Forbidden Subgraphs - A Survey. Graphs and Combinatorics 20(1): 1-40 (2004)
2003
16	EE	Stefan Porschen, Bert Randerath, Ewald Speckenmeyer: Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems. SAT 2003: 172-187
15	EE	Martin Kochol, Vadim V. Lozin, Bert Randerath: The 3-Colorability Problem on Graphs with Maximum Degree Four. SIAM J. Comput. 32(5): 1128-1139 (2003)
14	EE	Van Bang Le, Bert Randerath: On stable cutsets in line graphs. Theor. Comput. Sci. 1-3(301): 463-475 (2003)
2002
13		Bert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann: Vertex pancyclic graphs. Discrete Applied Mathematics 120(1-3): 219-237 (2002)
12	EE	Bert Randerath, Ingo Schiermeyer, Meike Tewes: Three-colourability and forbidden subgraphs. II: polynomial algorithms. Discrete Mathematics 251(1-3): 137-153 (2002)
2001
11	EE	Van Bang Le, Bert Randerath: On Stable Cutsets in Line Graphs. WG 2001: 263-271
10	EE	Bert Randerath, Ingo Schiermeyer: 3-Colorability element oF P for p6-free Graphs. Electronic Notes in Discrete Mathematics 8: 85-89 (2001)
9	EE	Bert Randerath, Ewald Speckenmeyer, Endre Boros, Peter L. Hammer, Alexander Kogan, Kazuhisa Makino, Bruno Simeone, Ondrej Cepek: A Satisfiability Formulation of Problems on Level Graphs. Electronic Notes in Discrete Mathematics 9: 269-277 (2001)
2000
8	EE	Bert Randerath: 3-Colourability and Forbidden Subgraphs. Electronic Notes in Discrete Mathematics 5: 270-273 (2000)
1999
7	EE	Ingo Schiermeyer, Bert Randerath: Colouring Graphs with Prescribed Induced Cycle Lengths. SODA 1999: 965-966
6	EE	Bert Randerath, Ingo Schiermeyer, Hong Wang: On quadrilaterals in a graph. Discrete Mathematics 203(1-3): 229-237 (1999)
5	EE	Bert Randerath, Lutz Volkmann, Ingo Schiermeyer, Meike Tewes: Vertex Pancyclic Graphs. Electronic Notes in Discrete Mathematics 3: 166-170 (1999)
4	EE	Arne Hoffmann, Bert Randerath, Lutz Volkmann: Maximal Sets of 2-Factors in Complete Equipartite Graphs. Electronic Notes in Discrete Mathematics 3: 82-85 (1999)
1998
3	EE	Thomas Niessen, Bert Randerath: Regular factors of simple regular graphs and factor-spectra. Discrete Mathematics 185(1-3): 89-103 (1998)
2	EE	Bert Randerath, Lutz Volkmann: Characterization of graphs with equal domination and covering number. Discrete Mathematics 191(1-3): 159-169 (1998)
1997
1		Bert Randerath, Lutz Volkmann: Simplicial Graphs and Relationships to Different Graph Invariants. Ars Comb. 46: (1997)

Coauthor Index

1	Endre Boros	[9]
2	Ondrej Cepek	[9]
3	Ulrich Faigle	[24]
4	Peter L. Hammer	[9]
5	Arne Hoffmann	[4]
6	Martin Kochol	[15]
7	Alexander Kogan	[9]
8	Van Bang Le	[11] [14] [23]
9	Vadim V. Lozin	[15]
10	Kazuhisa Makino	[9]
11	Thomas Niessen	[3]
12	Stefan Porschen	[16] [20] [22]
13	Ingo Schiermeyer	[5] [6] [7] [10] [12] [13] [17] [19] [23]
14	Rainer Schrader	[24]
15	Bruno Simeone	[9]
16	Ewald Speckenmeyer	[9] [16] [20] [22]
17	Meike Tewes	[5] [12] [13]
18	Preben D. Vestergaard	[21]
19	Lutz Volkmann	[1] [2] [4] [5] [13]
20	Hong Wang	[6]

Colors in the list of coauthors