| 2007 |
|---|
| 18 | 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 |
|---|
| 17 | EE | Stefan Porschen,
Ewald Speckenmeyer,
Bert Randerath:
On Linear CNF Formulas.
SAT 2006: 212-225 |
| 16 | EE | Bert Randerath,
Preben D. Vestergaard:
Well-covered graphs and factors.
Discrete Applied Mathematics 154(9): 1416-1428 (2006) |
| 2005 |
|---|
| 15 | 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 |
|---|
| 14 | EE | Bert Randerath,
Ingo Schiermeyer:
3-Colorability in P for P6-free graphs.
Discrete Applied Mathematics 136(2-3): 299-313 (2004) |
| 13 | EE | Bert Randerath:
3-Colorability and forbidden subgraphs. I: Characterizing pairs.
Discrete Mathematics 276(1-3): 313-325 (2004) |
| 12 | EE | Bert Randerath,
Ingo Schiermeyer:
Vertex Colouring and Forbidden Subgraphs - A Survey.
Graphs and Combinatorics 20(1): 1-40 (2004) |
| 2003 |
|---|
| 11 | EE | Stefan Porschen,
Bert Randerath,
Ewald Speckenmeyer:
Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems.
SAT 2003: 172-187 |
| 10 | 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) |
| 9 | EE | Van Bang Le,
Bert Randerath:
On stable cutsets in line graphs.
Theor. Comput. Sci. 1-3(301): 463-475 (2003) |
| 2002 |
|---|
| 8 | | Bert Randerath,
Ingo Schiermeyer,
Meike Tewes,
Lutz Volkmann:
Vertex pancyclic graphs.
Discrete Applied Mathematics 120(1-3): 219-237 (2002) |
| 7 | EE | Bert Randerath,
Ingo Schiermeyer,
Meike Tewes:
Three-colourability and forbidden subgraphs. II: polynomial algorithms.
Discrete Mathematics 251(1-3): 137-153 (2002) |
| 2001 |
|---|
| 6 | EE | Van Bang Le,
Bert Randerath:
On Stable Cutsets in Line Graphs.
WG 2001: 263-271 |
| 1999 |
|---|
| 5 | EE | Ingo Schiermeyer,
Bert Randerath:
Colouring Graphs with Prescribed Induced Cycle Lengths.
SODA 1999: 965-966 |
| 4 | EE | Bert Randerath,
Ingo Schiermeyer,
Hong Wang:
On quadrilaterals in a graph.
Discrete Mathematics 203(1-3): 229-237 (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) |
