AAAAAA

   
Results: 1-12 |
Results: 12
A note on alpha-redundant vertices in graphs
Authors: Brandstadt, A Lozin, VV
Citation: A. Brandstadt et Vv. Lozin, A note on alpha-redundant vertices in graphs, DISCR APP M, 108(3), 2001, pp. 301-308
Recognizing the P-4-structure of block graphs
Authors: Brandstadt, A Le, VB
Citation: A. Brandstadt et Vb. Le, Recognizing the P-4-structure of block graphs, DISCR APP M, 99(1-3), 2000, pp. 349-366
On stable cutsets in graphs
Authors: Brandstadt, A Dragan, FF Le, VB Szymczak, T
Citation: A. Brandstadt et al., On stable cutsets in graphs, DISCR APP M, 105(1-3), 2000, pp. 39-50
Seroprevalence of herpes simplex virus type 1 and type 2 in selected German populations - Relevance for the incidence of genital herpes
Authors: Wutzler, P Doerr, HW Farber, I Eichhorn, U Helbig, B Sauerbrei, A Brandstadt, A Rabenau, HF
Citation: P. Wutzler et al., Seroprevalence of herpes simplex virus type 1 and type 2 in selected German populations - Relevance for the incidence of genital herpes, J MED VIROL, 61(2), 2000, pp. 201-207
Linear time algorithms or hamiltonian problems on (claw, net)-free graphs
Authors: Brandstadt, A Dragan, FF Kohler, E
Citation: A. Brandstadt et al., Linear time algorithms or hamiltonian problems on (claw, net)-free graphs, SIAM J COMP, 30(5), 2000, pp. 1662-1677
Proceedings of the Conference on Optimal Discrete Structures and Algorithms - ODSA '97 - 8-10 September 1997 - Rostock, Germany - Preface
Authors: Brandstadt, A Engel, K Gronau, HD Labahn, R
Citation: A. Brandstadt et al., Proceedings of the Conference on Optimal Discrete Structures and Algorithms - ODSA '97 - 8-10 September 1997 - Rostock, Germany - Preface, DISCR APP M, 95(1-3), 1999, pp. 1-1
Tree- and forest-perfect graphs
Authors: Brandstadt, A Le, VB
Citation: A. Brandstadt et Vb. Le, Tree- and forest-perfect graphs, DISCR APP M, 95(1-3), 1999, pp. 141-162
On the stability number of claw-free P-5-free and more general graphs
Authors: Brandstadt, A Hammer, PL
Citation: A. Brandstadt et Pl. Hammer, On the stability number of claw-free P-5-free and more general graphs, DISCR APP M, 95(1-3), 1999, pp. 163-167
Recognizing the P-4-structure of bipartite graphs
Authors: Babel, L Brandstadt, A Le, VB
Citation: L. Babel et al., Recognizing the P-4-structure of bipartite graphs, DISCR APP M, 93(2-3), 1999, pp. 157-168
Convexity and HHD-free graphs
Authors: Dragan, FF Nicolai, F Brandstadt, A
Citation: Ff. Dragan et al., Convexity and HHD-free graphs, SIAM J DISC, 12(1), 1999, pp. 119-135
Distance approximating trees for chordal and dually chordal graphs
Authors: Brandstadt, A Chepoi, V Dragan, F
Citation: A. Brandstadt et al., Distance approximating trees for chordal and dually chordal graphs, J ALGORITHM, 30(1), 1999, pp. 166-184
The complexity of some problems related to GRAPH 3-COLORABILITY
Authors: Brandstadt, A Le, VB Szymczak, T
Citation: A. Brandstadt et al., The complexity of some problems related to GRAPH 3-COLORABILITY, DISCR APP M, 89(1-3), 1998, pp. 59-73
Risultati: 1-12 |