Michal Kotrbcík

Publication Activity (10 Years)

Years Active: 2011-2022
Publications (10 Years): 12

Top Topics

Online Learning

Cartesian Product

Top Venues

J. Graph Theory

Publications

Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
Relaxing the Irrevocability Requirement for Online Graph Algorithms. Algorithmica 84 (7) (2022)
Michal Kotrbcík, Martin Skoviera
Simple Greedy 2-Approximation Algorithm for the Maximum Genus of a Graph. SOSA (2019)
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
Online Dominating Set. Algorithmica 81 (5) (2019)
Marc Hellmuth, Anders S. Knudsen, Michal Kotrbcík, Daniel Merkle, Nikolai Nøjgaard
Linear Time Canonicalization and Enumeration of Non-Isomorphic 1-Face Embeddings. ALENEX (2018)
Michal Kotrbcík, Naoki Matsumoto, Bojan Mohar, Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki, Andrej Vodopivec
Grünbaum colorings of even triangulations on surfaces. J. Graph Theory 87 (4) (2018)
Joan Boyar, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
Relaxing the Irrevocability Requirement for Online Graph Algorithms. WADS (2017)
Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Michal Kotrbcík
Relaxing the Irrevocability Requirement for Online Graph Algorithms. CoRR (2017)
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
Online Dominating Set. CoRR (2016)
Eduard Eiben, Michal Kotrbcík
Equimatchable Graphs on Surfaces. J. Graph Theory 81 (1) (2016)
Stephan Beyer, Markus Chimani, Ivo Hedtke, Michal Kotrbcík
A Practical Method for the Minimum Genus of a Graph: Models and Experiments. SEA (2016)
Michal Kotrbcík, Rastislav Královic, Sebastian Ordyniak
Edge-Editing to a Dense and a Sparse Graph Class. LATIN (2016)
Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen
Online Dominating Set. SWAT (2016)
Dan Archdeacon, Michal Kotrbcík, Roman Nedela, Martin Skoviera
Maximum genus, connectivity, and Nebeský's Theorem. Ars Math. Contemp. 9 (1) (2015)
Michal Kotrbcík, Tomaz Pisanski
Genus of the Cartesian Product of Triangles. Electron. J. Comb. 22 (4) (2015)
Michal Kotrbcík, Martin Skoviera
Simple greedy 2-approximation algorithm for the maximum genus of a graph. CoRR (2015)
Jonathan L. Gross, Michal Kotrbcík, Timothy Sun
Genus Distributions of cubic series-parallel graphs. CoRR (2014)
Jonathan L. Gross, Michal Kotrbcík, Timothy Sun
Genus distributions of cubic series-parallel graphs. Discret. Math. Theor. Comput. Sci. 16 (3) (2014)
Michal Kotrbcík, Martin Skoviera
Matchings, Cycle Bases, and the Maximum Genus of a Graph. Electron. J. Comb. 19 (3) (2012)
Michal Kotrbcík
A note on disjoint cycles. Inf. Process. Lett. 112 (4) (2012)
Michal Kotrbcík
Maximum genus of regular graphs. Electron. Notes Discret. Math. 38 (2011)