|
Search the dblp DataBase
Martin Milanic:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Vadim V. Lozin, Martin Milanic
A polynomial algorithm to find an independent set of maximum weight in a fork-free graph. [Citation Graph (0, 0)][DBLP] SODA, 2006, pp:26-30 [Conf]
- Vadim V. Lozin, Martin Milanic
Maximum independent sets in graphs of low degree. [Citation Graph (0, 0)][DBLP] SODA, 2007, pp:874-880 [Conf]
Computing with Priced Information: When the Value Makes the Price. [Citation Graph (, )][DBLP]
The Maximum Independent Set Problem in Planar Graphs. [Citation Graph (, )][DBLP]
Tree-Width and Optimization in Bounded Degree Graphs. [Citation Graph (, )][DBLP]
A Better Bouncer's Algorithm. [Citation Graph (, )][DBLP]
On the maximum independent set problem in subclasses of planar and more general graphs. [Citation Graph (, )][DBLP]
Structural Identifiability in Low-Rank Matrix Factorization. [Citation Graph (, )][DBLP]
The Plane-Width of Graphs [Citation Graph (, )][DBLP]
Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case [Citation Graph (, )][DBLP]
Shortest paths between shortest paths and independent sets [Citation Graph (, )][DBLP]
On finding augmenting graphs. [Citation Graph (, )][DBLP]
Recent developments on graphs of bounded clique-width. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|