
Search the dblp DataBase
Marcin Kaminski:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Josep Díaz, Marcin Kaminski
MAXCUT and MAXBISECTION are NPhard on unit disk graphs. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2007, v:377, n:13, pp:271276 [Journal]
 Marcin Kaminski, Vadim V. Lozin
Vertex 3colorability of Clawfree Graphs. [Citation Graph (0, 0)][DBLP] Algorithmic Operations Research, 2007, v:2, n:1, pp: [Journal]
 Chính T. Hoàng, Marcin Kaminski, Vadim V. Lozin, J. Sawada, X. Shu
Deciding kcolourability of P_5free graphs in polynomial time [Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp: [Journal]
 Josep Díaz, Marcin Kaminski
MaxCut and MaxBisection are NPhard on unit disk graphs [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp: [Journal]
 Marcin Kaminski, Vadim V. Lozin
Polynomialtime algorithm for vertex kcolorability of P_5free graphs [Citation Graph (0, 0)][DBLP] CoRR, 2006, v:0, n:, pp: [Journal]
Contractions of Planar Graphs in Polynomial Time. [Citation Graph (, )][DBLP]
Induced Packing of Odd Cycles in a Planar Graph. [Citation Graph (, )][DBLP]
Parameterizing Cut Sets in a Graph by the Number of Their Components. [Citation Graph (, )][DBLP]
A Note on kColorability of P5Free Graphs. [Citation Graph (, )][DBLP]
On Contracting Graphs to Fixed Pattern Graphs. [Citation Graph (, )][DBLP]
The kinapath Problem for Clawfree Graphs. [Citation Graph (, )][DBLP]
Approximating the Maximum 3 and 4EdgeColorable Subgraph. [Citation Graph (, )][DBLP]
Reconfiguration of List EdgeColorings in a Graph. [Citation Graph (, )][DBLP]
Finding Induced Paths of Given Parity in ClawFree Graphs. [Citation Graph (, )][DBLP]
Deciding kColorability of P_{5}Free Graphs in Polynomial Time. [Citation Graph (, )][DBLP]
The PlaneWidth of Graphs [Citation Graph (, )][DBLP]
The kinapath problem for clawfree graphs [Citation Graph (, )][DBLP]
Shortest paths between shortest paths and independent sets [Citation Graph (, )][DBLP]
Recent developments on graphs of bounded cliquewidth. [Citation Graph (, )][DBLP]
A note on the subgraphs of the (2× INFINITY )grid. [Citation Graph (, )][DBLP]
Search in 0.070secs, Finished in 0.071secs
