Marcin Kaminski 0001

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Hirotaka Ono 0001

> Home > Persons > Marcin Kaminski 0001

Publications

2020
[j47]
- view
  authority control:
- export record
  dblp key:
  - journals/dam/ItoKOSUY20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/dam/ItoKOSUY20
Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka:
Parameterized complexity of independent set reconfiguration problems. Discret. Appl. Math. 283: 336-345 (2020)
2014
[c25]
- view
  authority control:
- export record
  dblp key:
  - conf/isaac/ItoKO14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/ItoKO14
Takehiro Ito, Marcin Jakub Kaminski, Hirotaka Ono:
Fixed-Parameter Tractability of Token Jumping on Planar Graphs. ISAAC 2014: 208-219
[c22]
- view
  authority control:
- export record
  dblp key:
  - conf/tamc/ItoKOSUY14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/tamc/ItoKOSUY14
Takehiro Ito, Marcin Kaminski, Hirotaka Ono, Akira Suzuki, Ryuhei Uehara, Katsuhisa Yamanaka:
On the Parameterized Complexity for Token Jumping on Graphs. TAMC 2014: 341-351
[i13]
- view
  - electronic edition @ arxiv.org (open access)
  - references & citations
- export record
  dblp key:
  - journals/corr/ItoKO14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/corr/ItoKO14
Takehiro Ito, Marcin Kaminski, Hirotaka Ono:
Fixed-Parameter Tractability of Token Jumping on Planar Graphs. CoRR abs/1406.6567 (2014)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.