×
Author ID: kotrbcik.michal Recent zbMATH articles by "Kotrbčík, Michal"
Published as: Kotrbčík, Michal; Kotrbcik, Michal; Kotrbčik, Michal; Kotrbčík, M.

Publications by Year

Citations contained in zbMATH Open

11 Publications have been cited 34 times in 31 Documents Cited by Year
Equimatchable graphs on surfaces. Zbl 1330.05126
Eiben, Eduard; Kotrbčík, Michal
7
2016
Grünbaum colorings of even triangulations on surfaces. Zbl 1386.05061
Kotrbčík, Michal; Matsumoto, Naoki; Mohar, Bojan; Nakamoto, Atsuhiro; Noguchi, Kenta; Ozeki, Kenta; Vodopivec, Andrej
6
2018
Online dominating set. Zbl 1421.68239
Boyar, Joan; Eidenbenz, Stephan J.; Favrholdt, Lene M.; Kotrbčík, Michal; Larsen, Kim S.
5
2019
Relaxing the irrevocability requirement for online graph algorithms. Zbl 1491.68139
Boyar, Joan; Favrholdt, Lene M.; Kotrbčík, Michal; Larsen, Kim S.
4
2017
Online dominating set. Zbl 1378.68196
Boyar, Joan; Eidenbenz, Stephan J.; Favrholdt, Lene M.; Kotrbcik, Michal; Larsen, Kim S.
2
2016
Genus of the Cartesian product of triangles. Zbl 1323.05108
Kotrbčík, Michal; Pisanski, Tomaž
2
2015
Genus distributions of cubic series-parallel graphs. Zbl 1301.05233
Gross, Jonathan L.; Kotrbčík, Michal; Sun, Timothy
2
2014
Matchings, cycle bases, and the maximum genus of a graph. Zbl 1252.05179
Kotrbčík, Michal; Škoviera, Martin
2
2012
Relaxing the irrevocability requirement for online graph algorithms. Zbl 1492.68145
Boyar, Joan; Favrholdt, Lene M.; Kotrbčík, Michal; Larsen, Kim S.
2
2022
Maximum genus, connectivity, and Nebeský’s theorem. Zbl 1329.05074
Archdeacon, Dan; Kotrbčík, Michal; Nedela, Roman; Škoviera, Martin
1
2015
Edge-editing to a dense and a sparse graph class. Zbl 1475.68247
Kotrbčík, Michal; Královič, Rastislav; Ordyniak, Sebastian
1
2016
Relaxing the irrevocability requirement for online graph algorithms. Zbl 1492.68145
Boyar, Joan; Favrholdt, Lene M.; Kotrbčík, Michal; Larsen, Kim S.
2
2022
Online dominating set. Zbl 1421.68239
Boyar, Joan; Eidenbenz, Stephan J.; Favrholdt, Lene M.; Kotrbčík, Michal; Larsen, Kim S.
5
2019
Grünbaum colorings of even triangulations on surfaces. Zbl 1386.05061
Kotrbčík, Michal; Matsumoto, Naoki; Mohar, Bojan; Nakamoto, Atsuhiro; Noguchi, Kenta; Ozeki, Kenta; Vodopivec, Andrej
6
2018
Relaxing the irrevocability requirement for online graph algorithms. Zbl 1491.68139
Boyar, Joan; Favrholdt, Lene M.; Kotrbčík, Michal; Larsen, Kim S.
4
2017
Equimatchable graphs on surfaces. Zbl 1330.05126
Eiben, Eduard; Kotrbčík, Michal
7
2016
Online dominating set. Zbl 1378.68196
Boyar, Joan; Eidenbenz, Stephan J.; Favrholdt, Lene M.; Kotrbcik, Michal; Larsen, Kim S.
2
2016
Edge-editing to a dense and a sparse graph class. Zbl 1475.68247
Kotrbčík, Michal; Královič, Rastislav; Ordyniak, Sebastian
1
2016
Genus of the Cartesian product of triangles. Zbl 1323.05108
Kotrbčík, Michal; Pisanski, Tomaž
2
2015
Maximum genus, connectivity, and Nebeský’s theorem. Zbl 1329.05074
Archdeacon, Dan; Kotrbčík, Michal; Nedela, Roman; Škoviera, Martin
1
2015
Genus distributions of cubic series-parallel graphs. Zbl 1301.05233
Gross, Jonathan L.; Kotrbčík, Michal; Sun, Timothy
2
2014
Matchings, cycle bases, and the maximum genus of a graph. Zbl 1252.05179
Kotrbčík, Michal; Škoviera, Martin
2
2012

Citations by Year