The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Martin Milanic: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. 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]
  2. Vadim V. Lozin, Martin Milanic
    Maximum independent sets in graphs of low degree. [Citation Graph (0, 0)][DBLP]
    SODA, 2007, pp:874-880 [Conf]

  3. Computing with Priced Information: When the Value Makes the Price. [Citation Graph (, )][DBLP]


  4. The Maximum Independent Set Problem in Planar Graphs. [Citation Graph (, )][DBLP]


  5. Tree-Width and Optimization in Bounded Degree Graphs. [Citation Graph (, )][DBLP]


  6. A Better Bouncer's Algorithm. [Citation Graph (, )][DBLP]


  7. On the maximum independent set problem in subclasses of planar and more general graphs. [Citation Graph (, )][DBLP]


  8. Structural Identifiability in Low-Rank Matrix Factorization. [Citation Graph (, )][DBLP]


  9. The Plane-Width of Graphs [Citation Graph (, )][DBLP]


  10. Competitive Boolean Function Evaluation: Beyond Monotonicity, and the Symmetric Case [Citation Graph (, )][DBLP]


  11. Shortest paths between shortest paths and independent sets [Citation Graph (, )][DBLP]


  12. On finding augmenting graphs. [Citation Graph (, )][DBLP]


  13. Recent developments on graphs of bounded clique-width. [Citation Graph (, )][DBLP]


Search in 0.001secs, Finished in 0.002secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002