default search action
Michal Kotrbcík
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j10]Joan Boyar
, Lene M. Favrholdt
Relaxing the Irrevocability Requirement for Online Graph Algorithms. Algorithmica 84(7): 1916-1951 (2022)
2010 – 2019
- 2019
- [j9]Joan Boyar
Online Dominating Set. Algorithmica 81(5): 1938-1964 (2019) - [c6]Michal Kotrbcík, Martin Skoviera:
Simple Greedy 2-Approximation Algorithm for the Maximum Genus of a Graph. SOSA 2019: 14:1-14:9 - 2018
- [j8]Michal Kotrbcík, Naoki Matsumoto, Bojan Mohar, Atsuhiro Nakamoto, Kenta Noguchi
Grünbaum colorings of even triangulations on surfaces. J. Graph Theory 87(4): 475-491 (2018) - [c5]Marc Hellmuth
Linear Time Canonicalization and Enumeration of Non-Isomorphic 1-Face Embeddings. ALENEX 2018: 154-168 - 2017
- [c4]Joan Boyar
Relaxing the Irrevocability Requirement for Online Graph Algorithms. WADS 2017: 217-228 - [i4]Joan Boyar, Lene M. Favrholdt, Kim S. Larsen, Michal Kotrbcík:
Relaxing the Irrevocability Requirement for Online Graph Algorithms. CoRR abs/1704.08835 (2017) - 2016
- [j7]Eduard Eiben, Michal Kotrbcík:
Equimatchable Graphs on Surfaces. J. Graph Theory 81(1): 35-49 (2016) - [c3]Michal Kotrbcík, Rastislav Královic
Edge-Editing to a Dense and a Sparse Graph Class. LATIN 2016: 562-575 - [c2]Joan Boyar
Online Dominating Set. SWAT 2016: 21:1-21:15 - [c1]Stephan Beyer
A Practical Method for the Minimum Genus of a Graph: Models and Experiments. SEA 2016: 75-88 - [i3]Joan Boyar, Stephan J. Eidenbenz, Lene M. Favrholdt, Michal Kotrbcík, Kim S. Larsen:
Online Dominating Set. CoRR abs/1604.05172 (2016) - 2015
- [j6]Dan Archdeacon, Michal Kotrbcík, Roman Nedela, Martin Skoviera:
Maximum genus, connectivity, and Nebeský's Theorem. Ars Math. Contemp. 9(1): 51-61 (2015) - [j5]Michal Kotrbcík, Tomaz Pisanski:
Genus of the Cartesian Product of Triangles. Electron. J. Comb. 22(4): 4 (2015) - [i2]Michal Kotrbcík, Martin Skoviera:
Simple greedy 2-approximation algorithm for the maximum genus of a graph. CoRR abs/1501.07460 (2015) - 2014
- [j4]Jonathan L. Gross, Michal Kotrbcík, Timothy Sun:
Genus distributions of cubic series-parallel graphs. Discret. Math. Theor. Comput. Sci. 16(3): 129-146 (2014) - [i1]Jonathan L. Gross, Michal Kotrbcík, Timothy Sun:
Genus Distributions of cubic series-parallel graphs. CoRR abs/1407.8031 (2014) - 2012
- [j3]Michal Kotrbcík, Martin Skoviera:
Matchings, Cycle Bases, and the Maximum Genus of a Graph. Electron. J. Comb. 19(3): 3 (2012) - [j2]Michal Kotrbcík:
A note on disjoint cycles. Inf. Process. Lett. 112(4): 135-137 (2012) - 2011
- [j1]Michal Kotrbcík:
Maximum genus of regular graphs. Electron. Notes Discret. Math. 38: 535-540 (2011)
Coauthor Index
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:59 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: