Michal Kotrbčík

Available identifiers

Publication	Date of Publication	Type
Simple greedy 2-approximation algorithm for the maximum genus of a graph	2024-08-26	Paper
Relaxing the irrevocability requirement for online graph algorithms	2022-06-28	Paper
Linear time canonicalization and enumeration of non-isomorphic 1-face embeddings	2019-09-12	Paper
Online dominating set	2019-05-07	Paper
Grünbaum colorings of even triangulations on surfaces	2018-04-27	Paper
Online Dominating Set	2017-10-17	Paper
Relaxing the irrevocability requirement for online graph algorithms	2017-09-22	Paper
Edge-editing to a dense and a sparse graph class	2016-05-03	Paper
Equimatchable Graphs on Surfaces	2016-02-01	Paper
Maximum genus, connectivity, and Nebeský's theorem	2016-01-25	Paper
Genus of the Cartesian product of triangles	2015-11-02	Paper
Simple greedy 2-approximation algorithm for the maximum genus of a graph	2015-01-29	Paper
Equimatchable factor-critical graphs and independence number 2	2015-01-29	Paper
Genus distributions of cubic series-parallel graphs	2014-11-10	Paper
https://portal.mardi4nfdi.de/entity/Q5419968	2014-06-11	Paper
Maximum genus of regular graphs	2013-11-01	Paper
Matchings, cycle bases, and the maximum genus of a graph	2012-10-24	Paper
A note on disjoint cycles	2012-05-04	Paper

This page was built for person: Michal Kotrbčík