Michal Kotrbcík

According to our database1, Michal Kotrbcík authored at least 14 papers between 2011 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Relaxing the Irrevocability Requirement for Online Graph Algorithms.
Algorithmica, 2022

2019
Online Dominating Set.
Algorithmica, 2019

Simple Greedy 2-Approximation Algorithm for the Maximum Genus of a Graph.
Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

2018
Grünbaum colorings of even triangulations on surfaces.
J. Graph Theory, 2018

Linear Time Canonicalization and Enumeration of Non-Isomorphic 1-Face Embeddings.
Proceedings of the Twentieth Workshop on Algorithm Engineering and Experiments, 2018

2016
Equimatchable Graphs on Surfaces.
J. Graph Theory, 2016

A Practical Method for the Minimum Genus of a Graph: Models and Experiments.
Proceedings of the Experimental Algorithms - 15th International Symposium, 2016

Edge-Editing to a Dense and a Sparse Graph Class.
Proceedings of the LATIN 2016: Theoretical Informatics, 2016

2015
Genus of the Cartesian Product of Triangles.
Electron. J. Comb., 2015

Maximum genus, connectivity, and Nebeský's Theorem.
Ars Math. Contemp., 2015

2014
Genus distributions of cubic series-parallel graphs.
Discret. Math. Theor. Comput. Sci., 2014

2012
A note on disjoint cycles.
Inf. Process. Lett., 2012

Matchings, Cycle Bases, and the Maximum Genus of a Graph.
Electron. J. Comb., 2012

2011
Maximum genus of regular graphs.
Electron. Notes Discret. Math., 2011


  Loading...