| 2008 |
|---|
| 9 | EE | Ferdinando Cicalese,
Martin Milanic:
Computing with Priced Information: When the Value Makes the Price.
ISAAC 2008: 378-389 |
| 8 | EE | Vladimir E. Alekseev,
Vadim V. Lozin,
Dmitriy Malyshev,
Martin Milanic:
The Maximum Independent Set Problem in Planar Graphs.
MFCS 2008: 96-107 |
| 7 | EE | Marcin Kaminski,
Paul Medvedev,
Martin Milanic:
The Plane-Width of Graphs
CoRR abs/0812.4346: (2008) |
| 6 | EE | Vadim V. Lozin,
Martin Milanic:
On finding augmenting graphs.
Discrete Applied Mathematics 156(13): 2517-2529 (2008) |
| 5 | EE | Vadim V. Lozin,
Martin Milanic:
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph.
J. Discrete Algorithms 6(4): 595-604 (2008) |
| 2007 |
|---|
| 4 | | Vadim V. Lozin,
Martin Milanic:
On the maximum independent set problem in subclasses of planar and more general graphs.
CTW 2007: 107-110 |
| 3 | EE | Vadim V. Lozin,
Martin Milanic:
Maximum independent sets in graphs of low degree.
SODA 2007: 874-880 |
| 2 | EE | Vadim V. Lozin,
Martin Milanic:
Tree-Width and Optimization in Bounded Degree Graphs.
WG 2007: 45-54 |
| 2006 |
|---|
| 1 | EE | Vadim V. Lozin,
Martin Milanic:
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph.
SODA 2006: 26-30 |
