default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Marcin Kaminski 0001
@article{DBLP:journals/jgt/CharbitHKLLNSS21,
author = {Pierre Charbit and
Gena Hahn and
Marcin Kaminski and
Manuel Lafond and
Nicolas Lichiardopol and
Reza Naserasr and
Ben Seamone and
Rezvan Sherkati},
title = {Edge clique covers in graphs with independence number two},
journal = {J. Graph Theory},
volume = {97},
number = {2},
pages = {324--339},
year = {2021},
url = {https://doi.org/10.1002/jgt.22657},
doi = {10.1002/JGT.22657},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/CharbitHKLLNSS21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ItoKOSUY20,
author = {Takehiro Ito and
Marcin Jakub Kaminski and
Hirotaka Ono and
Akira Suzuki and
Ryuhei Uehara and
Katsuhisa Yamanaka},
title = {Parameterized complexity of independent set reconfiguration problems},
journal = {Discret. Appl. Math.},
volume = {283},
pages = {336--345},
year = {2020},
url = {https://doi.org/10.1016/j.dam.2020.01.022},
doi = {10.1016/J.DAM.2020.01.022},
timestamp = {Wed, 14 May 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/ItoKOSUY20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KaminskiP19,
author = {Marcin Kaminski and
Anna Pstrucha},
title = {Certifying coloring algorithms for graphs without long induced paths},
journal = {Discret. Appl. Math.},
volume = {261},
pages = {258--267},
year = {2019},
url = {https://doi.org/10.1016/j.dam.2018.09.031},
doi = {10.1016/J.DAM.2018.09.031},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KaminskiP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/BlasiokKRT19,
author = {Jaroslaw Blasiok and
Marcin Kaminski and
Jean{-}Florent Raymond and
Th{\'{e}}ophile Trunck},
title = {Induced minors and well-quasi-ordering},
journal = {J. Comb. Theory {B}},
volume = {134},
pages = {110--142},
year = {2019},
url = {https://doi.org/10.1016/j.jctb.2018.05.005},
doi = {10.1016/J.JCTB.2018.05.005},
timestamp = {Sun, 19 Jan 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jct/BlasiokKRT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KaminskiRT18,
author = {Marcin Jakub Kaminski and
Jean{-}Florent Raymond and
Th{\'{e}}ophile Trunck},
title = {Well-quasi-ordering H-contraction-free graphs},
journal = {Discret. Appl. Math.},
volume = {248},
pages = {18--27},
year = {2018},
url = {https://doi.org/10.1016/j.dam.2017.02.018},
doi = {10.1016/J.DAM.2017.02.018},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KaminskiRT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KaminskiRT18,
author = {Marcin Jakub Kaminski and
Jean{-}Florent Raymond and
Th{\'{e}}ophile Trunck},
title = {Multigraphs without large bonds are wqo by contraction},
journal = {J. Graph Theory},
volume = {88},
number = {4},
pages = {558--565},
year = {2018},
url = {https://doi.org/10.1002/jgt.22229},
doi = {10.1002/JGT.22229},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KaminskiRT18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BlasiokK17,
author = {Jaroslaw Blasiok and
Marcin Jakub Kaminski},
title = {Chain Minors are {FPT}},
journal = {Algorithmica},
volume = {79},
number = {3},
pages = {698--707},
year = {2017},
url = {https://doi.org/10.1007/s00453-016-0220-1},
doi = {10.1007/S00453-016-0220-1},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/BlasiokK17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BelmonteHKP17,
author = {R{\'{e}}my Belmonte and
Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
title = {The price of connectivity for feedback vertex set},
journal = {Discret. Appl. Math.},
volume = {217},
pages = {132--143},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2016.08.011},
doi = {10.1016/J.DAM.2016.08.011},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BelmonteHKP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BresarHKMPPT17,
author = {Bostjan Bresar and
Pinar Heggernes and
Marcin Jakub Kaminski and
Martin Milanic and
Dani{\"{e}}l Paulusma and
Primoz Potocnik and
Nicolas Trotignon},
title = {Preface: Algorithmic Graph Theory on the Adriatic Coast},
journal = {Discret. Appl. Math.},
volume = {231},
pages = {1--3},
year = {2017},
url = {https://doi.org/10.1016/j.dam.2017.05.007},
doi = {10.1016/J.DAM.2017.05.007},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BresarHKMPPT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/GolovachKMT17,
author = {Petr A. Golovach and
Marcin Kaminski and
Spyridon Maniatis and
Dimitrios M. Thilikos},
title = {The Parameterized Complexity of Graph Cyclability},
journal = {{SIAM} J. Discret. Math.},
volume = {31},
number = {1},
pages = {511--541},
year = {2017},
url = {https://doi.org/10.1137/141000014},
doi = {10.1137/141000014},
timestamp = {Sat, 25 Apr 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamdm/GolovachKMT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KaminskiP17,
author = {Marcin Kaminski and
Anna Pstrucha},
title = {Certifying coloring algorithms for graphs without long induced paths},
journal = {CoRR},
volume = {abs/1703.02485},
year = {2017},
url = {http://arxiv.org/abs/1703.02485},
eprinttype = {arXiv},
eprint = {1703.02485},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KaminskiP17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/networks/KaminskiPST16,
author = {Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Anthony Stewart and
Dimitrios M. Thilikos},
title = {Minimal disconnected cuts in planar graphs},
journal = {Networks},
volume = {68},
number = {4},
pages = {250--259},
year = {2016},
url = {https://doi.org/10.1002/net.21696},
doi = {10.1002/NET.21696},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/networks/KaminskiPST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AtminasKR16,
author = {Aistis Atminas and
Marcin Kaminski and
Jean{-}Florent Raymond},
title = {Scattered packings of cycles},
journal = {Theor. Comput. Sci.},
volume = {647},
pages = {33--42},
year = {2016},
url = {https://doi.org/10.1016/j.tcs.2016.07.021},
doi = {10.1016/J.TCS.2016.07.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AtminasKR16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/KaminskiRT16,
author = {Marcin Kaminski and
Jean{-}Florent Raymond and
Th{\'{e}}ophile Trunck},
title = {Well-quasi-ordering H-contraction-free graphs},
journal = {CoRR},
volume = {abs/1602.00733},
year = {2016},
url = {http://arxiv.org/abs/1602.00733},
eprinttype = {arXiv},
eprint = {1602.00733},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/KaminskiRT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KaminskiM15,
author = {Marcin Jakub Kaminski and
Martin Milanic},
title = {On the complexity of the identifiable subgraph problem},
journal = {Discret. Appl. Math.},
volume = {182},
pages = {25--33},
year = {2015},
url = {https://doi.org/10.1016/j.dam.2014.10.021},
doi = {10.1016/J.DAM.2014.10.021},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KaminskiM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/BlasiokKRT15,
author = {Jaroslaw Blasiok and
Marcin Kaminski and
Jean{-}Florent Raymond and
Th{\'{e}}ophile Trunck},
title = {Induced minors and well-quasi-ordering},
journal = {Electron. Notes Discret. Math.},
volume = {49},
pages = {197--201},
year = {2015},
url = {https://doi.org/10.1016/j.endm.2015.06.029},
doi = {10.1016/J.ENDM.2015.06.029},
timestamp = {Mon, 05 Feb 2024 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/BlasiokKRT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/GiannopoulouKT15,
author = {Archontia C. Giannopoulou and
Marcin Jakub Kaminski and
Dimitrios M. Thilikos},
title = {Forbidding Kuratowski Graphs as Immersions},
journal = {J. Graph Theory},
volume = {78},
number = {1},
pages = {43--60},
year = {2015},
url = {https://doi.org/10.1002/jgt.21790},
doi = {10.1002/JGT.21790},
timestamp = {Mon, 03 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgt/GiannopoulouKT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/KaminskiPST15,
author = {Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Anthony Stewart and
Dimitrios M. Thilikos},
editor = {Adrian Kosowski and
Igor Walukiewicz},
title = {Minimal Disconnected Cuts in Planar Graphs},
booktitle = {Fundamentals of Computation Theory - 20th International Symposium,
{FCT} 2015, Gda{\'{n}}sk, Poland, August 17-19, 2015, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {9210},
pages = {243--254},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-319-22177-9\_19},
doi = {10.1007/978-3-319-22177-9\_19},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fct/KaminskiPST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BelmonteHKP15,
author = {R{\'{e}}my Belmonte and
Pim van 't Hof and
Marcin Jakub Kaminski and
Dani{\"{e}}l Paulusma},
title = {The Price of Connectivity for Feedback Vertex Set},
journal = {CoRR},
volume = {abs/1510.02639},
year = {2015},
url = {http://arxiv.org/abs/1510.02639},
eprinttype = {arXiv},
eprint = {1510.02639},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BelmonteHKP15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BlasiokKRT15,
author = {Jaroslaw Blasiok and
Marcin Kaminski and
Jean{-}Florent Raymond and
Th{\'{e}}ophile Trunck},
title = {Induced minors and well-quasi-ordering},
journal = {CoRR},
volume = {abs/1510.07135},
year = {2015},
url = {http://arxiv.org/abs/1510.07135},
eprinttype = {arXiv},
eprint = {1510.07135},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BlasiokKRT15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/BelmonteGHHKP14,
author = {R{\'{e}}my Belmonte and
Petr A. Golovach and
Pinar Heggernes and
Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
title = {Detecting Fixed Patterns in Chordal Graphs in Polynomial Time},
journal = {Algorithmica},
volume = {69},
number = {3},
pages = {501--521},
year = {2014},
url = {https://doi.org/10.1007/s00453-013-9748-5},
doi = {10.1007/S00453-013-9748-5},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/BelmonteGHHKP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/GolovachPKT14,
author = {Petr A. Golovach and
Dani{\"{e}}l Paulusma and
Marcin Kaminski and
Dimitrios M. Thilikos},
title = {Lift-contractions},
journal = {Eur. J. Comb.},
volume = {35},
pages = {286--296},
year = {2014},
url = {https://doi.org/10.1016/j.ejc.2013.06.026},
doi = {10.1016/J.EJC.2013.06.026},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/GolovachPKT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamdm/KaminskiK14,
author = {Marcin Jakub Kaminski and
Lukasz Kowalik},
title = {Beyond the Vizing's Bound for at Most Seven Colors},
journal = {{SIAM} J. Discret. Math.},
volume = {28},
number = {3},
pages = {1334--1362},
year = {2014},
url = {https://doi.org/10.1137/120899765},
doi = {10.1137/120899765},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamdm/KaminskiK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/GolovachKMT14,
author = {Petr A. Golovach and
Marcin Jakub Kaminski and
Spyridon Maniatis and
Dimitrios M. Thilikos},
editor = {Andreas S. Schulz and
Dorothea Wagner},
title = {The Parameterized Complexity of Graph Cyclability},
booktitle = {Algorithms - {ESA} 2014 - 22th Annual European Symposium, Wroclaw,
Poland, September 8-10, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8737},
pages = {492--504},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44777-2\_41},
doi = {10.1007/978-3-662-44777-2\_41},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/esa/GolovachKMT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ItoKO14,
author = {Takehiro Ito and
Marcin Jakub Kaminski and
Hirotaka Ono},
editor = {Hee{-}Kap Ahn and
Chan{-}Su Shin},
title = {Fixed-Parameter Tractability of Token Jumping on Planar Graphs},
booktitle = {Algorithms and Computation - 25th International Symposium, {ISAAC}
2014, Jeonju, Korea, December 15-17, 2014, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8889},
pages = {208--219},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-13075-0\_17},
doi = {10.1007/978-3-319-13075-0\_17},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/isaac/ItoKO14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/BelmonteHKP14,
author = {R{\'{e}}my Belmonte and
Pim van 't Hof and
Marcin Jakub Kaminski and
Dani{\"{e}}l Paulusma},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {Forbidden Induced Subgraphs and the Price of Connectivity for Feedback
Vertex Set},
booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International
Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
Part {II}},
series = {Lecture Notes in Computer Science},
volume = {8635},
pages = {57--68},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44465-8\_6},
doi = {10.1007/978-3-662-44465-8\_6},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/BelmonteHKP14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/BonsmaKW14,
author = {Paul S. Bonsma and
Marcin Kaminski and
Marcin Wrochna},
editor = {R. Ravi and
Inge Li G{\o}rtz},
title = {Reconfiguring Independent Sets in Claw-Free Graphs},
booktitle = {Algorithm Theory - {SWAT} 2014 - 14th Scandinavian Symposium and Workshops,
Copenhagen, Denmark, July 2-4, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8503},
pages = {86--97},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-08404-6\_8},
doi = {10.1007/978-3-319-08404-6\_8},
timestamp = {Sun, 02 Jun 2019 21:15:18 +0200},
biburl = {https://dblp.org/rec/conf/swat/BonsmaKW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/ItoKOSUY14,
author = {Takehiro Ito and
Marcin Kaminski and
Hirotaka Ono and
Akira Suzuki and
Ryuhei Uehara and
Katsuhisa Yamanaka},
editor = {T. V. Gopal and
Manindra Agrawal and
Angsheng Li and
S. Barry Cooper},
title = {On the Parameterized Complexity for Token Jumping on Graphs},
booktitle = {Theory and Applications of Models of Computation - 11th Annual Conference,
{TAMC} 2014, Chennai, India, April 11-13, 2014. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {8402},
pages = {341--351},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-319-06089-7\_24},
doi = {10.1007/978-3-319-06089-7\_24},
timestamp = {Wed, 14 May 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/tamc/ItoKOSUY14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/BonsmaKW14,
author = {Paul S. Bonsma and
Marcin Kaminski and
Marcin Wrochna},
title = {Reconfiguring Independent Sets in Claw-Free Graphs},
journal = {CoRR},
volume = {abs/1403.0359},
year = {2014},
url = {http://arxiv.org/abs/1403.0359},
eprinttype = {arXiv},
eprint = {1403.0359},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/BonsmaKW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ItoKO14,
author = {Takehiro Ito and
Marcin Kaminski and
Hirotaka Ono},
title = {Fixed-Parameter Tractability of Token Jumping on Planar Graphs},
journal = {CoRR},
volume = {abs/1406.6567},
year = {2014},
url = {http://arxiv.org/abs/1406.6567},
eprinttype = {arXiv},
eprint = {1406.6567},
timestamp = {Fri, 29 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/ItoKO14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AtminasKR14,
author = {Aistis Atminas and
Marcin Kaminski and
Jean{-}Florent Raymond},
title = {Induced packings of cycles},
journal = {CoRR},
volume = {abs/1409.2733},
year = {2014},
url = {http://arxiv.org/abs/1409.2733},
eprinttype = {arXiv},
eprint = {1409.2733},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AtminasKR14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/GolovachKMT14,
author = {Petr A. Golovach and
Marcin Jakub Kaminski and
Spyridon Maniatis and
Dimitrios M. Thilikos},
title = {The Parameterized Complexity of Graph Cyclability},
journal = {CoRR},
volume = {abs/1412.3955},
year = {2014},
url = {http://arxiv.org/abs/1412.3955},
eprinttype = {arXiv},
eprint = {1412.3955},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GolovachKMT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HoangKSS13,
author = {Ch{\'{\i}}nh T. Ho{\`{a}}ng and
Marcin Kaminski and
Joe Sawada and
R. Sritharan},
title = {Finding and listing induced paths and cycles},
journal = {Discret. Appl. Math.},
volume = {161},
number = {4-5},
pages = {633--641},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2012.01.024},
doi = {10.1016/J.DAM.2012.01.024},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/HoangKSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/BelmonteHKPT13,
author = {R{\'{e}}my Belmonte and
Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {Characterizing graphs of small carving-width},
journal = {Discret. Appl. Math.},
volume = {161},
number = {13-14},
pages = {1888--1893},
year = {2013},
url = {https://doi.org/10.1016/j.dam.2013.02.036},
doi = {10.1016/J.DAM.2013.02.036},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/BelmonteHKPT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dmtcs/FialaKP13,
author = {Jir{\'{\i}} Fiala and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
title = {A note on contracting claw-free graphs},
journal = {Discret. Math. Theor. Comput. Sci.},
volume = {15},
number = {2},
pages = {223--232},
year = {2013},
url = {https://doi.org/10.46298/dmtcs.605},
doi = {10.46298/DMTCS.605},
timestamp = {Tue, 31 Jan 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dmtcs/FialaKP13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigact/Kaminski13,
author = {Marcin Kaminski},
title = {Review of Boolean Models and Methods in Mathematics, Computer Science,
and Engineering by Yves Crama and Peter L. Hammer},
journal = {{SIGACT} News},
volume = {44},
number = {1},
pages = {21--24},
year = {2013},
url = {https://doi.org/10.1145/2447712.2447720},
doi = {10.1145/2447712.2447720},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/Kaminski13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GolovachKPT13,
author = {Petr A. Golovach and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {Increasing the minimum degree of a graph by contractions},
journal = {Theor. Comput. Sci.},
volume = {481},
pages = {74--84},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2013.02.030},
doi = {10.1016/J.TCS.2013.02.030},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GolovachKPT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/BlasiokK13,
author = {Jaroslaw Blasiok and
Marcin Kaminski},
editor = {Gregory Z. Gutin and
Stefan Szeider},
title = {Chain Minors Are {FPT}},
booktitle = {Parameterized and Exact Computation - 8th International Symposium,
{IPEC} 2013, Sophia Antipolis, France, September 4-6, 2013, Revised
Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {8246},
pages = {78--83},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-319-03898-8\_8},
doi = {10.1007/978-3-319-03898-8\_8},
timestamp = {Sun, 04 Aug 2024 19:43:27 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/BlasiokK13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/GiannopoulouKT13,
author = {Archontia C. Giannopoulou and
Marcin Kaminski and
Dimitrios M. Thilikos},
editor = {Andreas Brandst{\"{a}}dt and
Klaus Jansen and
R{\"{u}}diger Reischuk},
title = {Excluding Graphs as Immersions in Surface Embedded Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science - 39th International
Workshop, {WG} 2013, L{\"{u}}beck, Germany, June 19-21, 2013,
Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {8165},
pages = {274--285},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-45043-3\_24},
doi = {10.1007/978-3-642-45043-3\_24},
timestamp = {Mon, 03 Mar 2025 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/wg/GiannopoulouKT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1304-5849,
author = {Jaroslaw Blasiok and
Marcin Kaminski},
title = {Chain minors are {FPT}},
journal = {CoRR},
volume = {abs/1304.5849},
year = {2013},
url = {http://arxiv.org/abs/1304.5849},
eprinttype = {arXiv},
eprint = {1304.5849},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1304-5849.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/FialaKLP12,
author = {Jir{\'{\i}} Fiala and
Marcin Kaminski and
Bernard Lidick{\'{y}} and
Dani{\"{e}}l Paulusma},
title = {The k-in-a-Path Problem for Claw-free Graphs},
journal = {Algorithmica},
volume = {62},
number = {1-2},
pages = {499--519},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9468-z},
doi = {10.1007/S00453-010-9468-Z},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/FialaKLP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HofKP12,
author = {Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
title = {Finding Induced Paths of Given Parity in Claw-Free Graphs},
journal = {Algorithmica},
volume = {62},
number = {1-2},
pages = {537--563},
year = {2012},
url = {https://doi.org/10.1007/s00453-010-9470-5},
doi = {10.1007/S00453-010-9470-5},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/HofKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GolovachKPT12,
author = {Petr A. Golovach and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {Containment relations in split graphs},
journal = {Discret. Appl. Math.},
volume = {160},
number = {1-2},
pages = {155--163},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2011.10.004},
doi = {10.1016/J.DAM.2011.10.004},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GolovachKPT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/HofKPST12,
author = {Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Stefan Szeider and
Dimitrios M. Thilikos},
title = {On graph contractions and induced minors},
journal = {Discret. Appl. Math.},
volume = {160},
number = {6},
pages = {799--809},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2010.05.005},
doi = {10.1016/J.DAM.2010.05.005},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dam/HofKPST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ItoKD12,
author = {Takehiro Ito and
Marcin Kaminski and
Erik D. Demaine},
title = {Reconfiguration of list edge-colorings in a graph},
journal = {Discret. Appl. Math.},
volume = {160},
number = {15},
pages = {2199--2207},
year = {2012},
url = {https://doi.org/10.1016/j.dam.2012.05.014},
doi = {10.1016/J.DAM.2012.05.014},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ItoKD12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/FialaKP12,
author = {Jir{\'{\i}} Fiala and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
title = {Detecting induced star-like minors in polynomial time},
journal = {J. Discrete Algorithms},
volume = {17},
pages = {74--85},
year = {2012},
url = {https://doi.org/10.1016/j.jda.2012.11.002},
doi = {10.1016/J.JDA.2012.11.002},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/FialaKP12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GolovachKPT12,
author = {Petr A. Golovach and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {Induced packing of odd cycles in planar graphs},
journal = {Theor. Comput. Sci.},
volume = {420},
pages = {28--35},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2011.11.004},
doi = {10.1016/J.TCS.2011.11.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GolovachKPT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Kaminski12,
author = {Marcin Kaminski},
title = {max-cut and containment relations in graphs},
journal = {Theor. Comput. Sci.},
volume = {438},
pages = {89--95},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.02.036},
doi = {10.1016/J.TCS.2012.02.036},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Kaminski12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KaminskiMM12,
author = {Marcin Kaminski and
Paul Medvedev and
Martin Milanic},
title = {Complexity of independent set reconfigurability problems},
journal = {Theor. Comput. Sci.},
volume = {439},
pages = {9--15},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.03.004},
doi = {10.1016/J.TCS.2012.03.004},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KaminskiMM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoa/BelmonteHKPT12,
author = {R{\'{e}}my Belmonte and
Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
editor = {Guohui Lin},
title = {Characterizing Graphs of Small Carving-Width},
booktitle = {Combinatorial Optimization and Applications - 6th International Conference,
{COCOA} 2012, Banff, AB, Canada, August 5-9, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7402},
pages = {360--370},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31770-5\_32},
doi = {10.1007/978-3-642-31770-5\_32},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoa/BelmonteHKPT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BelmonteHK12,
author = {R{\'{e}}my Belmonte and
Pim van 't Hof and
Marcin Kaminski},
editor = {Kun{-}Mao Chao and
Tsan{-}sheng Hsu and
Der{-}Tsai Lee},
title = {Induced Immersions},
booktitle = {Algorithms and Computation - 23rd International Symposium, {ISAAC}
2012, Taipei, Taiwan, December 19-21, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7676},
pages = {299--308},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-35261-4\_33},
doi = {10.1007/978-3-642-35261-4\_33},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BelmonteHK12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/KaminskiN12,
author = {Marcin Kaminski and
Naomi Nishimura},
editor = {Yuval Rabani},
title = {Finding an induced path of given parity in planar graphs in polynomial
time},
booktitle = {Proceedings of the Twenty-Third Annual {ACM-SIAM} Symposium on Discrete
Algorithms, {SODA} 2012, Kyoto, Japan, January 17-19, 2012},
pages = {656--670},
publisher = {{SIAM}},
year = {2012},
url = {https://doi.org/10.1137/1.9781611973099.55},
doi = {10.1137/1.9781611973099.55},
timestamp = {Tue, 02 Feb 2021 17:07:31 +0100},
biburl = {https://dblp.org/rec/conf/soda/KaminskiN12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/KaminskiT12,
author = {Marcin Kaminski and
Dimitrios M. Thilikos},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Contraction checking in graphs on surfaces},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {182--193},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.182},
doi = {10.4230/LIPICS.STACS.2012.182},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/stacs/KaminskiT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1207-5329,
author = {Archontia C. Giannopoulou and
Marcin Kaminski and
Dimitrios M. Thilikos},
title = {Forbidding Kuratowski Graphs as Immersions},
journal = {CoRR},
volume = {abs/1207.5329},
year = {2012},
url = {http://arxiv.org/abs/1207.5329},
eprinttype = {arXiv},
eprint = {1207.5329},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1207-5329.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1211-5031,
author = {Marcin Kaminski and
Lukasz Kowalik},
title = {Beyond the Vizing's bound for at most seven colors},
journal = {CoRR},
volume = {abs/1211.5031},
year = {2012},
url = {http://arxiv.org/abs/1211.5031},
eprinttype = {arXiv},
eprint = {1211.5031},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1211-5031.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/ItoKPT11,
author = {Takehiro Ito and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {On disconnected cuts and separators},
journal = {Discret. Appl. Math.},
volume = {159},
number = {13},
pages = {1345--1351},
year = {2011},
url = {https://doi.org/10.1016/j.dam.2011.04.027},
doi = {10.1016/J.DAM.2011.04.027},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/ItoKPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/GolovachKPT11,
author = {Petr A. Golovach and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {Lift Contractions},
journal = {Electron. Notes Discret. Math.},
volume = {38},
pages = {407--412},
year = {2011},
url = {https://doi.org/10.1016/j.endm.2011.09.066},
doi = {10.1016/J.ENDM.2011.09.066},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/endm/GolovachKPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jda/KaminskiPT11,
author = {Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {Contracting planar graphs to contractions of triangulations},
journal = {J. Discrete Algorithms},
volume = {9},
number = {3},
pages = {299--306},
year = {2011},
url = {https://doi.org/10.1016/j.jda.2011.03.010},
doi = {10.1016/J.JDA.2011.03.010},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jda/KaminskiPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgt/KaminskiMM11,
author = {Marcin Kaminski and
Paul Medvedev and
Martin Milanic},
title = {The plane-width of graphs},
journal = {J. Graph Theory},
volume = {68},
number = {3},
pages = {229--245},
year = {2011},
url = {https://doi.org/10.1002/jgt.20554},
doi = {10.1002/JGT.20554},
timestamp = {Fri, 02 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jgt/KaminskiMM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/KaminskiMM11,
author = {Marcin Kaminski and
Paul Medvedev and
Martin Milanic},
title = {Shortest paths between shortest paths},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {39},
pages = {5205--5210},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.05.021},
doi = {10.1016/J.TCS.2011.05.021},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/KaminskiMM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ItoKPT11,
author = {Takehiro Ito and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {Parameterizing cut sets in a graph by the number of their components},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {45},
pages = {6340--6350},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2011.07.005},
doi = {10.1016/J.TCS.2011.07.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ItoKPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/colognetwente/GolovachKT11,
author = {Petr A. Golovach and
Marcin Kaminski and
Dimitrios M. Thilikos},
editor = {Ludovica Adacher and
Marta Flamini and
Gianmaria Leo and
Gaia Nicosia and
Andrea Pacifici and
Veronica Piccialli},
title = {Odd cyclic surface separators in planar graphs},
booktitle = {Proceedings of the 10th Cologne-Twente Workshop on graphs and combinatorial
optimization. Extended Abstracts, Villa Mondragone, Frascati, Italy,
June 14-16, 2011},
pages = {165--167},
year = {2011},
url = {http://ctw2011.dia.uniroma3.it/ctw\_proceedings.pdf\#page=177},
timestamp = {Thu, 12 Mar 2020 11:34:41 +0100},
biburl = {https://dblp.org/rec/conf/colognetwente/GolovachKT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/BelmonteGHHKP11,
author = {R{\'{e}}my Belmonte and
Petr A. Golovach and
Pinar Heggernes and
Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
editor = {Takao Asano and
Shin{-}Ichi Nakano and
Yoshio Okamoto and
Osamu Watanabe},
title = {Finding Contractions and Induced Minors in Chordal Graphs via Disjoint
Paths},
booktitle = {Algorithms and Computation - 22nd International Symposium, {ISAAC}
2011, Yokohama, Japan, December 5-8, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7074},
pages = {110--119},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-25591-5\_13},
doi = {10.1007/978-3-642-25591-5\_13},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/BelmonteGHHKP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/GolovachKPT11,
author = {Petr A. Golovach and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
editor = {D{\'{a}}niel Marx and
Peter Rossmanith},
title = {Increasing the Minimum Degree of a Graph by Contractions},
booktitle = {Parameterized and Exact Computation - 6th International Symposium,
{IPEC} 2011, Saarbr{\"{u}}cken, Germany, September 6-8, 2011.
Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {7112},
pages = {67--79},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-28050-4\_6},
doi = {10.1007/978-3-642-28050-4\_6},
timestamp = {Fri, 09 Apr 2021 18:49:30 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/GolovachKPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GolovachKP11,
author = {Petr A. Golovach and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
editor = {Filip Murlak and
Piotr Sankowski},
title = {Contracting a Chordal Graph to a Split Graph or a Tree},
booktitle = {Mathematical Foundations of Computer Science 2011 - 36th International
Symposium, {MFCS} 2011, Warsaw, Poland, August 22-26, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6907},
pages = {339--350},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22993-0\_32},
doi = {10.1007/978-3-642-22993-0\_32},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GolovachKP11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/HoangKLSS10,
author = {Ch{\'{\i}}nh T. Ho{\`{a}}ng and
Marcin Kaminski and
Vadim V. Lozin and
Joe Sawada and
Xiao Shu},
title = {Deciding \emph{k}-Colorability of \emph{P}\({}_{\mbox{5}}\)-Free Graphs
in Polynomial Time},
journal = {Algorithmica},
volume = {57},
number = {1},
pages = {74--81},
year = {2010},
url = {https://doi.org/10.1007/s00453-008-9197-8},
doi = {10.1007/S00453-008-9197-8},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/algorithmica/HoangKLSS10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cdm/JoretKT10,
author = {Gwena{\"{e}}l Joret and
Marcin Kaminski and
Dirk Oliver Theis},
title = {The Cops and Robber game on graphs with forbidden (induced) subgraphs},
journal = {Contributions Discret. Math.},
volume = {5},
number = {2},
year = {2010},
url = {https://doi.org/10.11575/cdm.v5i2.62032},
doi = {10.11575/CDM.V5I2.62032},
timestamp = {Tue, 01 Apr 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cdm/JoretKT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dm/DiazKT10,
author = {Josep D{\'{\i}}az and
Marcin Kaminski and
Dimitrios M. Thilikos},
title = {A note on the subgraphs of the (2{\texttimes}{\(\infty\)})-grid},
journal = {Discret. Math.},
volume = {310},
number = {3},
pages = {531--536},
year = {2010},
url = {https://doi.org/10.1016/j.disc.2009.03.046},
doi = {10.1016/J.DISC.2009.03.046},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dm/DiazKT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/esa/KaminskiPT10,
author = {Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
editor = {Mark de Berg and
Ulrich Meyer},
title = {Contractions of Planar Graphs in Polynomial Time},
booktitle = {Algorithms - {ESA} 2010, 18th Annual European Symposium, Liverpool,
UK, September 6-8, 2010. Proceedings, Part {I}},
series = {Lecture Notes in Computer Science},
volume = {6346},
pages = {122--133},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-15775-2\_11},
doi = {10.1007/978-3-642-15775-2\_11},
timestamp = {Sat, 05 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/esa/KaminskiPT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwoca/KaminskiMM10,
author = {Marcin Kaminski and
Paul Medvedev and
Martin Milanic},
editor = {Costas S. Iliopoulos and
William F. Smyth},
title = {Shortest Paths between Shortest Paths and Independent Sets},
booktitle = {Combinatorial Algorithms - 21st International Workshop, {IWOCA} 2010,
London, UK, July 26-28, 2010, Revised Selected Papers},
series = {Lecture Notes in Computer Science},
volume = {6460},
pages = {56--67},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-19222-7\_7},
doi = {10.1007/978-3-642-19222-7\_7},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/iwoca/KaminskiMM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/HofKPST10,
author = {Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Stefan Szeider and
Dimitrios M. Thilikos},
editor = {Jan van Leeuwen and
Anca Muscholl and
David Peleg and
Jaroslav Pokorn{\'{y}} and
Bernhard Rumpe},
title = {On Contracting Graphs to Fixed Pattern Graphs},
booktitle = {{SOFSEM} 2010: Theory and Practice of Computer Science, 36th Conference
on Current Trends in Theory and Practice of Computer Science, Spindleruv
Ml{\'{y}}n, Czech Republic, January 23-29, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5901},
pages = {503--514},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-11266-9\_42},
doi = {10.1007/978-3-642-11266-9\_42},
timestamp = {Sun, 04 Aug 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/HofKPST10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/FialaKLP10,
author = {Jir{\'{\i}} Fiala and
Marcin Kaminski and
Bernard Lidick{\'{y}} and
Dani{\"{e}}l Paulusma},
editor = {Jean{-}Yves Marion and
Thomas Schwentick},
title = {The k-in-a-path Problem for Claw-free Graphs},
booktitle = {27th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2010, March 4-6, 2010, Nancy, France},
series = {LIPIcs},
volume = {5},
pages = {371--382},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2010},
url = {https://doi.org/10.4230/LIPIcs.STACS.2010.2469},
doi = {10.4230/LIPICS.STACS.2010.2469},
timestamp = {Tue, 19 Aug 2025 16:16:35 +0200},
biburl = {https://dblp.org/rec/conf/stacs/FialaKLP10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/swat/KaminskiK10,
author = {Marcin Kaminski and
Lukasz Kowalik},
editor = {Haim Kaplan},
title = {Approximating the Maximum 3- and 4-Edge-Colorable Subgraph},
booktitle = {Algorithm Theory - {SWAT} 2010, 12th Scandinavian Symposium and Workshops
on Algorithm Theory, Bergen, Norway, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6139},
pages = {395--407},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13731-0\_37},
doi = {10.1007/978-3-642-13731-0\_37},
timestamp = {Tue, 14 May 2019 10:00:39 +0200},
biburl = {https://dblp.org/rec/conf/swat/KaminskiK10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/Kaminski10,
author = {Marcin Kaminski},
editor = {Dimitrios M. Thilikos},
title = {max-cut and Containment Relations in Graphs},
booktitle = {Graph Theoretic Concepts in Computer Science - 36th International
Workshop, {WG} 2010, Zar{\'{o}}s, Crete, Greece, June 28-30,
2010 Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {6410},
pages = {15--26},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-16926-7\_4},
doi = {10.1007/978-3-642-16926-7\_4},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/wg/Kaminski10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1008-4563,
author = {Marcin Kaminski and
Paul Medvedev and
Martin Milanic},
title = {Shortest paths between shortest paths and independent sets},
journal = {CoRR},
volume = {abs/1008.4563},
year = {2010},
url = {http://arxiv.org/abs/1008.4563},
eprinttype = {arXiv},
eprint = {1008.4563},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1008-4563.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1012-2460,
author = {Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
title = {Contracting planar graphs to contractions of triangulations},
journal = {CoRR},
volume = {abs/1012.2460},
year = {2010},
url = {http://arxiv.org/abs/1012.2460},
eprinttype = {arXiv},
eprint = {1012.2460},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1012-2460.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/KaminskiLM09,
author = {Marcin Kaminski and
Vadim V. Lozin and
Martin Milanic},
title = {Recent developments on graphs of bounded clique-width},
journal = {Discret. Appl. Math.},
volume = {157},
number = {12},
pages = {2747--2761},
year = {2009},
url = {https://doi.org/10.1016/j.dam.2008.08.022},
doi = {10.1016/J.DAM.2008.08.022},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/KaminskiLM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/endm/KaminskiMM09,
author = {Marcin Kaminski and
Paul Medvedev and
Martin Milanic},
title = {On the Plane-Width of Graphs},
journal = {Electron. Notes Discret. Math.},
volume = {34},
pages = {633--637},
year = {2009},
url = {https://doi.org/10.1016/j.endm.2009.07.107},
doi = {10.1016/J.ENDM.2009.07.107},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/endm/KaminskiMM09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/GolovachKPT09,
author = {Petr A. Golovach and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
editor = {Yingfei Dong and
Ding{-}Zhu Du and
Oscar H. Ibarra},
title = {Induced Packing of Odd Cycles in a Planar Graph},
booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC}
2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5878},
pages = {514--523},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10631-6\_53},
doi = {10.1007/978-3-642-10631-6\_53},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/GolovachKPT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/ItoKPT09,
author = {Takehiro Ito and
Marcin Kaminski and
Dani{\"{e}}l Paulusma and
Dimitrios M. Thilikos},
editor = {Yingfei Dong and
Ding{-}Zhu Du and
Oscar H. Ibarra},
title = {Parameterizing Cut Sets in a Graph by the Number of Their Components},
booktitle = {Algorithms and Computation, 20th International Symposium, {ISAAC}
2009, Honolulu, Hawaii, USA, December 16-18, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5878},
pages = {605--615},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-10631-6\_62},
doi = {10.1007/978-3-642-10631-6\_62},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/ItoKPT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wads/ItoKD09,
author = {Takehiro Ito and
Marcin Kaminski and
Erik D. Demaine},
editor = {Frank K. H. A. Dehne and
Marina L. Gavrilova and
J{\"{o}}rg{-}R{\"{u}}diger Sack and
Csaba D. T{\'{o}}th},
title = {Reconfiguration of List Edge-Colorings in a Graph},
booktitle = {Algorithms and Data Structures, 11th International Symposium, {WADS}
2009, Banff, Canada, August 21-23, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5664},
pages = {375--386},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03367-4\_33},
doi = {10.1007/978-3-642-03367-4\_33},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/wads/ItoKD09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/wg/HofKP09,
author = {Pim van 't Hof and
Marcin Kaminski and
Dani{\"{e}}l Paulusma},
editor = {Christophe Paul and
Michel Habib},
title = {Finding Induced Paths of Given Parity in Claw-Free Graphs},
booktitle = {Graph-Theoretic Concepts in Computer Science, 35th International Workshop,
{WG} 2009, Montpellier, France, June 24-26, 2009. Revised Papers},
series = {Lecture Notes in Computer Science},
volume = {5911},
pages = {341--352},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-11409-0\_30},
doi = {10.1007/978-3-642-11409-0\_30},
timestamp = {Thu, 14 Oct 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/wg/HofKP09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0912-5468,
author = {Jir{\'{\i}} Fiala and
Marcin Kaminski and
Bernard Lidick{\'{y}} and
Dani{\"{e}}l Paulusma},
title = {The k-in-a-path problem for claw-free graphs},
journal = {CoRR},
volume = {abs/0912.5468},
year = {2009},
url = {http://arxiv.org/abs/0912.5468},
eprinttype = {arXiv},
eprint = {0912.5468},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0912-5468.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HoangKLSS08,
author = {Ch{\'{\i}}nh T. Ho{\`{a}}ng and
Marcin Kaminski and
Vadim V. Lozin and
Joe Sawada and
Xiao Shu},
editor = {Edward Ochmanski and
Jerzy Tyszkiewicz},
title = {A Note on k-Colorability of P5-Free Graphs},
booktitle = {Mathematical Foundations of Computer Science 2008, 33rd International
Symposium, {MFCS} 2008, Torun, Poland, August 25-29, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5162},
pages = {387--394},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85238-4\_31},
doi = {10.1007/978-3-540-85238-4\_31},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HoangKLSS08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0812-4346,
author = {Marcin Kaminski and
Paul Medvedev and
Martin Milanic},
title = {The Plane-Width of Graphs},
journal = {CoRR},
volume = {abs/0812.4346},
year = {2008},
url = {http://arxiv.org/abs/0812.4346},
eprinttype = {arXiv},
eprint = {0812.4346},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0812-4346.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aor/KaminskiL07,
author = {Marcin Kaminski and
Vadim V. Lozin},
title = {Vertex 3-colorability of Claw-free Graphs},
journal = {Algorithmic Oper. Res.},
volume = {2},
number = {1},
year = {2007},
url = {http://journals.hil.unb.ca/index.php/AOR/article/view/2730},
timestamp = {Wed, 10 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/aor/KaminskiL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cdm/LozinK07,
author = {Vadim V. Lozin and
Marcin Kaminski},
title = {Coloring edges and vertices of graphs without short or long cycles},
journal = {Contributions Discret. Math.},
volume = {2},
number = {1},
year = {2007},
url = {https://doi.org/10.11575/cdm.v2i1.61890},
doi = {10.11575/CDM.V2I1.61890},
timestamp = {Tue, 01 Apr 2025 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cdm/LozinK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jco/CardosoKL07,
author = {Domingos Moreira Cardoso and
Marcin Kaminski and
Vadim V. Lozin},
title = {Maximum \emph{k} -regular induced subgraphs},
journal = {J. Comb. Optim.},
volume = {14},
number = {4},
pages = {455--463},
year = {2007},
url = {https://doi.org/10.1007/s10878-007-9045-9},
doi = {10.1007/S10878-007-9045-9},
timestamp = {Mon, 06 Nov 2017 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jco/CardosoKL07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/orl/CroceKP07,
author = {Federico Della Croce and
Marcin Jakub Kaminski and
Vangelis Th. Paschos},
title = {An exact algorithm for {MAX-CUT} in sparse graphs},
journal = {Oper. Res. Lett.},
volume = {35},
number = {3},
pages = {403--408},
year = {2007},
url = {https://doi.org/10.1016/j.orl.2006.04.001},
doi = {10.1016/J.ORL.2006.04.001},
timestamp = {Wed, 14 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/orl/CroceKP07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/DiazK07,
author = {Josep D{\'{\i}}az and
Marcin Kaminski},
title = {{MAX-CUT} and {MAX-BISECTION} are NP-hard on unit disk graphs},
journal = {Theor. Comput. Sci.},
volume = {377},
number = {1-3},
pages = {271--276},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2007.02.013},
doi = {10.1016/J.TCS.2007.02.013},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/DiazK07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0702043,
author = {Ch{\'{\i}}nh T. Ho{\`{a}}ng and
Marcin Kaminski and
Vadim V. Lozin and
Joe Sawada and
Xiao Shu},
title = {Deciding k-colourability of P{\_}5-free graphs in polynomial time},
journal = {CoRR},
volume = {abs/cs/0702043},
year = {2007},
url = {http://arxiv.org/abs/cs/0702043},
eprinttype = {arXiv},
eprint = {cs/0702043},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0702043.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0607115,
author = {Marcin Kaminski and
Vadim V. Lozin},
title = {Polynomial-time algorithm for vertex k-colorability of P{\_}5-free
graphs},
journal = {CoRR},
volume = {abs/cs/0607115},
year = {2006},
url = {http://arxiv.org/abs/cs/0607115},
eprinttype = {arXiv},
eprint = {cs/0607115},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0607115.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-cs-0609128,
author = {Josep D{\'{\i}}az and
Marcin Kaminski},
title = {Max-Cut and Max-Bisection are NP-hard on unit disk graphs},
journal = {CoRR},
volume = {abs/cs/0609128},
year = {2006},
url = {http://arxiv.org/abs/cs/0609128},
eprinttype = {arXiv},
eprint = {cs/0609128},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-cs-0609128.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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.
last updated on 2025-07-06 18:41 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
