2008 |
10 | EE | Chính T. Hoàng,
Marcin Kaminski,
Vadim V. Lozin,
Joe Sawada,
Xiao Shu:
A Note on k-Colorability of P5-Free Graphs.
MFCS 2008: 387-394 |
9 | EE | Marcin Kaminski,
Paul Medvedev,
Martin Milanic:
The Plane-Width of Graphs
CoRR abs/0812.4346: (2008) |
2007 |
8 | EE | Marcin Kaminski,
Vadim V. Lozin:
Vertex 3-colorability of Claw-free Graphs.
Algorithmic Operations Research 2(1): (2007) |
7 | EE | Chính T. Hoàng,
Marcin Kaminski,
Vadim V. Lozin,
Joe Sawada,
Xiao Shu:
Deciding k-colourability of P_5-free graphs in polynomial time
CoRR abs/cs/0702043: (2007) |
6 | EE | Domingos Moreira Cardoso,
Marcin Kaminski,
Vadim V. Lozin:
Maximum k -regular induced subgraphs.
J. Comb. Optim. 14(4): 455-463 (2007) |
5 | EE | Josep Díaz,
Marcin Kaminski:
MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs.
Theor. Comput. Sci. 377(1-3): 271-276 (2007) |
2006 |
4 | EE | Marcin Kaminski,
Vadim V. Lozin:
Polynomial-time algorithm for vertex k-colorability of P_5-free graphs
CoRR abs/cs/0607115: (2006) |
3 | EE | Josep Díaz,
Marcin Kaminski:
Max-Cut and Max-Bisection are NP-hard on unit disk graphs
CoRR abs/cs/0609128: (2006) |
2004 |
2 | EE | Marcin Kaminski:
Multiresolutional Techniques in Finite Element Method Solution of Eigenvalue Problem.
International Conference on Computational Science 2004: 171-178 |
2003 |
1 | EE | Marcin Kaminski:
Some Notes on Numerical Convergence of the Stochastic Perturbation Method.
International Conference on Computational Science 2003: 521-532 |