Search the dblp DataBase

Publications of Author

1. Stefan Porschen, Bert Randerath, Ewald Speckenmeyer
   Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems. [Citation Graph (0, 0)][DBLP]
   SAT, 2003, pp:172-187 [Conf]
   
2. Stefan Porschen, Ewald Speckenmeyer, Bert Randerath
   On Linear CNF Formulas. [Citation Graph (0, 0)][DBLP]
   SAT, 2006, pp:212-225 [Conf]
   
3. Ingo Schiermeyer, Bert Randerath
   Colouring Graphs with Prescribed Induced Cycle Lengths. [Citation Graph (0, 0)][DBLP]
   SODA, 1999, pp:965-966 [Conf]
   
4. Van Bang Le, Bert Randerath
   On Stable Cutsets in Line Graphs. [Citation Graph (0, 0)][DBLP]
   WG, 2001, pp:263-271 [Conf]
   
5. Stefan Porschen, Bert Randerath, Ewald Speckenmeyer
   Exact 3-satisfiability is decidable in time O(2^0.16254n). [Citation Graph (0, 0)][DBLP]
   Ann. Math. Artif. Intell., 2005, v:43, n:1, pp:173-193 [Journal]
   
6. Bert Randerath, Lutz Volkmann
   Simplicial Graphs and Relationships to Different Graph Invariants. [Citation Graph (0, 0)][DBLP]
   Ars Comb., 1997, v:46, n:, pp:- [Journal]
   
7. Bert Randerath, Ingo Schiermeyer
   3-Colorability in P for P₆-free graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:136, n:2-3, pp:299-313 [Journal]
   
8. Bert Randerath, Ingo Schiermeyer, Meike Tewes, Lutz Volkmann
   Vertex pancyclic graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2002, v:120, n:1-3, pp:219-237 [Journal]
   
9. Bert Randerath, Preben D. Vestergaard
   Well-covered graphs and factors. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:9, pp:1416-1428 [Journal]
   
10. Bert Randerath
    3-Colorability and forbidden subgraphs. I: Characterizing pairs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:276, n:1-3, pp:313-325 [Journal]
    
11. Bert Randerath, Ingo Schiermeyer, Meike Tewes
    Three-colourability and forbidden subgraphs. II: polynomial algorithms. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:251, n:1-3, pp:137-153 [Journal]
    
12. Bert Randerath, Ingo Schiermeyer
    Vertex Colouring and Forbidden Subgraphs - A Survey. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:1, pp:1-40 [Journal]
    
13. Martin Kochol, Vadim V. Lozin, Bert Randerath
    The 3-Colorability Problem on Graphs with Maximum Degree Four. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2003, v:32, n:5, pp:1128-1139 [Journal]
    
14. Van Bang Le, Bert Randerath
    On stable cutsets in line graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:301, pp:463-475 [Journal]
    
15. Bert Randerath, Ingo Schiermeyer, Hong Wang
    On quadrilaterals in a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:203, n:1-3, pp:229-237 [Journal]
    
16. Bert Randerath, Lutz Volkmann
    Characterization of graphs with equal domination and covering number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:191, n:1-3, pp:159-169 [Journal]
    
17. Thomas Niessen, Bert Randerath
    Regular factors of simple regular graphs and factor-spectra. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:185, n:1-3, pp:89-103 [Journal]
    
18. 
    Preface for CTW2005 special issue. [Citation Graph (, )][DBLP]
    
    
19. 
    On maximum independent sets in P₅-free graphs. [Citation Graph (, )][DBLP]
    
    
20. 
    An upper bound on the domination number of a graph with minimum degree 2. [Citation Graph (, )][DBLP]
    
    
21. 
    All P₃-equipackable graphs. [Citation Graph (, )][DBLP]