Clik here to view.
A polynomial algorithm to find an independent set of maximum weight in a...
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
View ArticleClik here to view.
Tree-Width and Optimization in Bounded Degree Graphs.
Vadim V. Lozin, Martin Milanic: Tree-Width and Optimization in Bounded Degree Graphs. WG 2007: 45-54
View ArticleClik here to view.
Maximum independent sets in graphs of low degree.
Vadim V. Lozin, Martin Milanic: Maximum independent sets in graphs of low degree. SODA 2007: 874-880
View ArticleClik here to view.
On the maximum independent set problem in subclasses of planar and more...
Vadim V. Lozin, Martin Milanic: On the maximum independent set problem in subclasses of planar and more general graphs. CTW 2007: 107-110
View ArticleClik here to view.
The Plane-Width of Graphs.
Marcin Kaminski, Paul Medvedev, Martin Milanic: The Plane-Width of Graphs. CoRR abs/0812.4346 (2008)
View ArticleClik here to view.
The Maximum Independent Set Problem in Planar Graphs.
Vladimir E. Alekseev, Vadim V. Lozin, Dmitriy S. Malyshev, Martin Milanic: The Maximum Independent Set Problem in Planar Graphs. MFCS 2008: 96-107
View ArticleClik here to view.
Computing with Priced Information: When the Value Makes the Price.
Ferdinando Cicalese, Martin Milanic: Computing with Priced Information: When the Value Makes the Price. ISAAC 2008: 378-389
View ArticleClik here to view.
A polynomial algorithm to find an independent set of maximum weight in a...
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)
View ArticleClik here to view.
On finding augmenting graphs.
Vadim V. Lozin, Martin Milanic: On finding augmenting graphs. Discret. Appl. Math. 156(13): 2517-2529 (2008)
View ArticleClik here to view.
The Exact Weighted Independent Set Problem in Perfect Graphs and Related...
Martin Milanic, Jérôme Monnot: The Exact Weighted Independent Set Problem in Perfect Graphs and Related Classes. Electron. Notes Discret. Math. 35: 317-322 (2009)
View ArticleClik here to view.
On the Plane-Width of Graphs.
Marcin Kaminski, Paul Medvedev, Martin Milanic: On the Plane-Width of Graphs. Electron. Notes Discret. Math. 34: 633-637 (2009)
View ArticleClik here to view.
Recent developments on graphs of bounded clique-width.
Marcin Kaminski, Vadim V. Lozin, Martin Milanic: Recent developments on graphs of bounded clique-width. Discret. Appl. Math. 157(12): 2747-2761 (2009)
View ArticleClik here to view.
Simple and Fast Reoptimizations for the Steiner Tree Problem.
Bruno Escoffier, Martin Milanic, Vangelis Th. Paschos: Simple and Fast Reoptimizations for the Steiner Tree Problem. Algorithmic Oper. Res. 4(2): 86-94 (2009)
View ArticleClik here to view.
Hardness, approximability, and exact algorithms for vector domination and...
Ferdinando Cicalese, Martin Milanic, Ugo Vaccaro: Hardness, approximability, and exact algorithms for vector domination and total vector domination in graphs. CoRR abs/1012.1529 (2010)
View ArticleClik here to view.
Shortest paths between shortest paths and independent sets.
Marcin Kaminski, Paul Medvedev, Martin Milanic: Shortest paths between shortest paths and independent sets. CoRR abs/1008.4563 (2010)
View ArticleClik here to view.
Competitive Boolean Function Evaluation: Beyond Monotonicity, and the...
Ferdinando Cicalese, Travis Gagie, Eduardo Sany Laber, Martin Milanic: Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case. CoRR abs/1006.4136 (2010)
View ArticleClik here to view.
Graphs of Separability at Most Two: Structural Characterizations and Their...
Ferdinando Cicalese, Martin Milanic: Graphs of Separability at Most Two: Structural Characterizations and Their Consequences. IWOCA 2010: 291-302
View ArticleClik here to view.
Shortest Paths between Shortest Paths and Independent Sets.
Marcin Kaminski, Paul Medvedev, Martin Milanic: Shortest Paths between Shortest Paths and Independent Sets. IWOCA 2010: 56-67
View ArticleClik here to view.
A Better Bouncer's Algorithm.
Ferdinando Cicalese, Travis Gagie, Anthony J. Macula, Martin Milanic, Eberhard Triesch: A Better Bouncer's Algorithm. FUN 2010: 113-120
View ArticleClik here to view.
On the Maximum Independent Set Problem in Subclasses of Planar Graphs.
Vadim V. Lozin, Martin Milanic: On the Maximum Independent Set Problem in Subclasses of Planar Graphs. J. Graph Algorithms Appl. 14(2): 269-286 (2010)
View Article
