Search the dblp DataBase

Publications of Author

1. Vladimir E. Alekseev
   On easy and hard hereditary classes of graphs with respect to the independent set problem. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2003, v:132, n:1-3, pp:17-26 [Journal]
   
2. Vladimir E. Alekseev
   Polynomial algorithm for finding the largest independent sets in graphs without forks. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:3-16 [Journal]
   
3. Vladimir E. Alekseev, Vadim V. Lozin
   Local transformations of graphs preserving independence number. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:135, n:1-3, pp:17-30 [Journal]
   
4. Vladimir E. Alekseev, Vadim V. Lozin
   Augmenting graphs for independent sets. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2004, v:145, n:1, pp:3-10 [Journal]
   
5. Vladimir E. Alekseev, Vadim V. Lozin
   On orthogonal representations of graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2001, v:226, n:1-3, pp:359-363 [Journal]
   
6. Vladimir E. Alekseev, Vadim V. Lozin
   Independent sets of maximum weight in (p, q)-colorable graphs. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2003, v:265, n:1-3, pp:351-356 [Journal]
   
7. Vladimir E. Alekseev, Dmitry V. Korobitsyn, Vadim V. Lozin
   Boundary classes of graphs for the dominating set problem. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 2004, v:285, n:1-3, pp:1-6 [Journal]
   
8. Vladimir E. Alekseev, Alastair Farrugia, Vadim V. Lozin
   New Results on Generalized Graph Coloring. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics & Theoretical Computer Science, 2004, v:6, n:2, pp:215-222 [Journal]
   
9. 
   The Maximum Independent Set Problem in Planar Graphs. [Citation Graph (, )][DBLP]