| 2008 |
|---|
| 10 | EE | Vladimir E. Alekseev,
Vadim V. Lozin,
Dmitriy Malyshev,
Martin Milanic:
The Maximum Independent Set Problem in Planar Graphs.
MFCS 2008: 96-107 |
| 2007 |
|---|
| 9 | EE | Vladimir E. Alekseev,
Rodica Boliac,
Dmitry V. Korobitsyn,
Vadim V. Lozin:
NP-hard graph problems and boundary classes of graphs.
Theor. Comput. Sci. 389(1-2): 219-236 (2007) |
| 2004 |
|---|
| 8 | EE | Vladimir E. Alekseev,
Vadim V. Lozin:
Local transformations of graphs preserving independence number.
Discrete Applied Mathematics 135(1-3): 17-30 (2004) |
| 7 | EE | Vladimir E. Alekseev:
Polynomial algorithm for finding the largest independent sets in graphs without forks.
Discrete Applied Mathematics 135(1-3): 3-16 (2004) |
| 6 | EE | Vladimir E. Alekseev,
Vadim V. Lozin:
Augmenting graphs for independent sets.
Discrete Applied Mathematics 145(1): 3-10 (2004) |
| 5 | EE | Vladimir E. Alekseev,
Dmitry V. Korobitsyn,
Vadim V. Lozin:
Boundary classes of graphs for the dominating set problem.
Discrete Mathematics 285(1-3): 1-6 (2004) |
| 4 | EE | Vladimir E. Alekseev,
Alastair Farrugia,
Vadim V. Lozin:
New Results on Generalized Graph Coloring.
Discrete Mathematics & Theoretical Computer Science 6(2): 215-222 (2004) |
| 2003 |
|---|
| 3 | EE | Vladimir E. Alekseev:
On easy and hard hereditary classes of graphs with respect to the independent set problem.
Discrete Applied Mathematics 132(1-3): 17-26 (2003) |
| 2 | EE | Vladimir E. Alekseev,
Vadim V. Lozin:
Independent sets of maximum weight in (p, q)-colorable graphs.
Discrete Mathematics 265(1-3): 351-356 (2003) |
| 2001 |
|---|
| 1 | EE | Vladimir E. Alekseev,
Vadim V. Lozin:
On orthogonal representations of graphs.
Discrete Mathematics 226(1-3): 359-363 (2001) |
