#### Filter Results:

- Full text PDF available (42)

#### Publication Year

1999

2017

- This year (0)
- Last 5 years (26)
- Last 10 years (69)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Marcin Kaminski, Paul Medvedev, Martin Milanic
- Theor. Comput. Sci.
- 2012

We study problems of reconfigurability of independent sets in graphs. We consider three different models (token jumping, token sliding, and token addition and removal) and analyze relationshipsâ€¦ (More)

- ChÃnh T. HoÃ ng, Marcin Kaminski, Vadim V. Lozin, Joe Sawada, Xiao Shu
- Algorithmica
- 2008

The problem of computing the chromatic number of a P 5-free graph (aÂ graph which contains no path on 5 vertices as an induced subgraph) is known to be NP-hard. However, we show that for every fixedâ€¦ (More)

- Vadim V. Lozin, Marcin Kaminski
- Contributions to Discrete Mathematics
- 2007

Vertex and edge colorability are two graph problems that are NP-hard in general. We show that both problems remain difficult even for graphs without short cycles, i.e., without cycles of length atâ€¦ (More)

- Marcin Kaminski, Vadim V. Lozin, Martin Milanic
- Discrete Applied Mathematics
- 2009

Whether the clique-width of graphs in a certain class of graphs is bounded or not is an important question from an algorithmic point of view, as many problems that are NP-hard in general admitâ€¦ (More)

- Paul S. Bonsma, Marcin Kaminski, Marcin Wrochna
- SWAT
- 2014

We present a polynomial-time algorithm that, given two independent sets in a clawfree graph G, decides whether one can be transformed into the other by a sequence of elementary steps. Each elementaryâ€¦ (More)

- Takehiro Ito, Marcin Kaminski, Erik D. Demaine
- WADS
- 2009

- Takehiro Ito, Marcin Kaminski, Hirotaka Ono
- ISAAC
- 2014

Suppose that we are given two independent sets I0 and Ir of a graph such that |I0| = |Ir|, and imagine that a token is placed on each vertex in I0. The token jumping problem is to determine whetherâ€¦ (More)

- Josep DÃaz, Marcin Kaminski
- Theor. Comput. Sci.
- 2007

We prove that the max-cut and max-bisection problems are NP-hard on unit disk graphs. We also show that Î»-precision graphs are planar for Î» > 1/ âˆš 2 and give a dichotomy theorem for max-cutâ€¦ (More)

- GwenaÃ«l Joret, Marcin Kaminski, Dirk Oliver Theis
- Contributions to Discrete Mathematics
- 2010

The two-player, complete information game of Cops and Robber is played on undirected finite graphs. A number of cops and one robber are positioned on vertices and take turns in sliding along edges.â€¦ (More)

Suppose that we are given two independent sets I0 and Ir of a graph such that |I0| = |Ir|, and imagine that a token is placed on each vertex in I0. Then, the token jumping problem is to determineâ€¦ (More)