default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichal Tkác
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i1]Michal Tkác, Jakub Sieber, Lara Kuhlmann
, Matthias Brueggenolte, Alexandru Rinciog, Michael Henke, Artur M. Schweidtmann, Qinghe Gao, Maximilian F. Theisen, Radwa El Shawi:
MachineLearnAthon: An Action-Oriented Machine Learning Didactic Concept. CoRR abs/2401.16291 (2024)
2010 – 2019
- 2016
- [j16]Michal Tkác, Robert Verner:
Artificial neural networks in business: Two decades of research. Appl. Soft Comput. 38: 788-804 (2016) - 2011
- [c2]Michal Tkác:
Role of Trust Building Mechanisms as a Necessity Requirement of Entry to e-Business Environment. IDIMT 2011: 349-356 - 2010
- [c1]Radoslav Delina, Michal Tkác:
The Impacts of Specific ICT Solutions on Productivity. IDIMT 2010: 23-32
2000 – 2009
- 2006
- [j15]Camino Balbuena, Ewan Barker, Kinkar Chandra Das, Yuqing Lin, Mirka Miller, Joseph F. Ryan, Slamin, Kiki A. Sugeng, Michal Tkác:
On the degrees of a strongly vertex-magic graph. Discret. Math. 306(6): 539-551 (2006) - [j14]Tobias Gerlach, Frank Göring, Jochen Harant, Michal Tkác:
On cycles through specified vertices. Discret. Math. 306(8-9): 831-835 (2006) - 2002
- [j13]Michal Tkác, Heinz-Jürgen Voss:
On k-trestles in polyhedreal graphs. Discuss. Math. Graph Theory 22(1): 193-198 (2002)
1990 – 1999
- 1999
- [j12]Jochen Harant, Stanislav Jendrol', Michal Tkác:
On 3-Connected Plane Graphs without Triangular Faces. J. Comb. Theory B 77(1): 150-161 (1999) - [j11]Thomas Böhme, Jochen Harant, Michal Tkác:
On certain Hamiltonian cycles in planar graphs. J. Graph Theory 32(1): 81-96 (1999) - [j10]Thomas Böhme, Jochen Harant, Michal Tkác:
More than one tough chordal planar graphs are Hamiltonian. J. Graph Theory 32(4): 405-410 (1999) - 1998
- [j9]Peter Smutný, Michal Tkác:
On cubic polyhedral graphs with prescribed adjacency properties of their faces. Discret. Math. 191(1-3): 197-206 (1998) - 1996
- [j8]Jochen Harant, Peter J. Owens, Michal Tkác, Hansjoachim Walther:
5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one. Discret. Math. 150(1-3): 143-153 (1996) - [j7]Stanislav Jendrol', Michal Tkác, Zsolt Tuza:
The irregularity strength and cost of the union of cliques. Discret. Math. 150(1-3): 179-186 (1996) - [j6]Michal Tkác:
On the shortness exponent of 1-tough, maximal planar graphs. Discret. Math. 154(1-3): 321-328 (1996) - 1995
- [j5]Stanislav Jendrol', Michal Tkác:
The irregularity strength of tKp. Discret. Math. 145(1-3): 301-305 (1995) - 1994
- [j4]Michal Tkác:
On shortness coefficients of simple 3-polytopal graphs with only one type of faces besides triangles. Discret. Math. 128(1-3): 407-413 (1994) - 1992
- [j3]Michal Tkác:
Shortness coefficients of simple 3-polytopal graphs with edges of only two types. Discret. Math. 103(1): 103-110 (1992) - 1990
- [j2]Stanislav Jendrol', Michal Tkác:
Convex 3-polytopes with exactly two types of edges. Discret. Math. 84(2): 143-160 (1990)
1980 – 1989
- 1984
- [j1]Stanislav Jendrol', Michal Tkác:
On the simplicial 3-polytopes with only two types of edges. Discret. Math. 48(2-3): 229-241 (1984)
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 2025-01-09 13:11 CET 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:
