The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Marcin Kaminski: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Josep Díaz, Marcin Kaminski
    MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:377, n:1-3, pp:271-276 [Journal]
  2. Marcin Kaminski, Vadim V. Lozin
    Vertex 3-colorability of Claw-free Graphs. [Citation Graph (0, 0)][DBLP]
    Algorithmic Operations Research, 2007, v:2, n:1, pp:- [Journal]
  3. Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, J. Sawada, X. Shu
    Deciding k-colourability of P_5-free graphs in polynomial time [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  4. Josep Díaz, Marcin Kaminski
    Max-Cut and Max-Bisection are NP-hard on unit disk graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  5. Marcin Kaminski, Vadim V. Lozin
    Polynomial-time algorithm for vertex k-colorability of P_5-free graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  6. Contractions of Planar Graphs in Polynomial Time. [Citation Graph (, )][DBLP]


  7. Induced Packing of Odd Cycles in a Planar Graph. [Citation Graph (, )][DBLP]


  8. Parameterizing Cut Sets in a Graph by the Number of Their Components. [Citation Graph (, )][DBLP]


  9. A Note on k-Colorability of P5-Free Graphs. [Citation Graph (, )][DBLP]


  10. On Contracting Graphs to Fixed Pattern Graphs. [Citation Graph (, )][DBLP]


  11. The k-in-a-path Problem for Claw-free Graphs. [Citation Graph (, )][DBLP]


  12. Approximating the Maximum 3- and 4-Edge-Colorable Subgraph. [Citation Graph (, )][DBLP]


  13. Reconfiguration of List Edge-Colorings in a Graph. [Citation Graph (, )][DBLP]


  14. Finding Induced Paths of Given Parity in Claw-Free Graphs. [Citation Graph (, )][DBLP]


  15. Deciding k-Colorability of P5-Free Graphs in Polynomial Time. [Citation Graph (, )][DBLP]


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


  17. The k-in-a-path problem for claw-free graphs [Citation Graph (, )][DBLP]


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


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


  20. A note on the subgraphs of the (2× INFINITY )-grid. [Citation Graph (, )][DBLP]


Search in 0.070secs, Finished in 0.071secs
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