default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosef Tkadlec
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2013
[b2]Titu Andreescu, Michal Rolínek, Josef Tkadlec:
106 Geometry Problems - From The AwesomeMath Summer Program. XYZ Press 2013, ISBN 978-0-9799269-4-5, pp. I-VIII, 1-174- [b1]Titu Andreescu, Michal Rolínek, Josef Tkadlec:
107 Geometry Problems - From The AwesomeMath Year-Round Program. XYZ Press 2013, ISBN 978-0-9799269-7-6, pp. I-VIII, 1-188
Journal Articles
- 2024
- [j9]Adrian Dumitrescu, Josef Tkadlec:
Piercing All Translates of a Set of Axis-Parallel Rectangles. Electron. J. Comb. 31(1) (2024) - 2022
- [j8]Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, Alexi Turcotte:
Token Swapping on Trees. Discret. Math. Theor. Comput. Sci. 24(2) (2022) - [j7]Oswin Aichholzer
, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber:
On Compatible Matchings. J. Graph Algorithms Appl. 26(2): 225-240 (2022) - 2020
- [j6]Josef Tkadlec, Andreas Pavlogiannis, Krishnendu Chatterjee, Martin A. Nowak:
Limits on amplifiers of natural selection under death-Birth updating. PLoS Comput. Biol. 16(1) (2020) - 2016
- [j5]Josef Tkadlec:
Distributivity and associativity in effect algebras. Fuzzy Sets Syst. 289: 151-156 (2016) - 2010
- [j4]Josef Tkadlec, Esko Turunen:
Commutative bounded integral residuated orthomodular lattices are Boolean algebras. Soft Comput. 15(4): 635-636 (2010) - 2009
- [j3]Karl Svozil, Josef Tkadlec:
On the solution of trivalent decision problems by quantum state identification. Nat. Comput. 8(3): 539-546 (2009) - 2003
- [j2]Ivan Bruha, Josef Tkadlec:
Rule quality for multiple-rule classifier: Empirical expertise and theoretical methodology. Intell. Data Anal. 7(2): 99-124 (2003) - [j1]Josef Tkadlec, Ivan Bruha:
Formal Aspects of a Multiple-Rule Classifier. Int. J. Pattern Recognit. Artif. Intell. 17(4): 581-600 (2003)
Conference and Workshop Papers
- 2024
- [c11]Petros Petsinis, Andreas Pavlogiannis, Josef Tkadlec, Panagiotis Karras:
Seed Selection in the Heterogeneous Moran Process. IJCAI 2024: 2297-2305 - 2023
- [c10]Guy Avni, Tobias Meggendorfer, Suman Sadhukhan, Josef Tkadlec, Dorde Zikelic:
Reachability Poorman Discrete-Bidding Games. ECAI 2023: 141-148 - 2022
- [c9]Joachim Brendborg, Panagiotis Karras, Andreas Pavlogiannis, Asger Ullersted Rasmussen, Josef Tkadlec:
Fixation Maximization in the Positional Moran Process. AAAI 2022: 9304-9312 - [c8]Joseph O'Rourke, Anna Lubiw, Ryuhei Uehara, Chie Nara, Thomas C. Hull, Klara Mundilova, Josef Tkadlec:
Quasi-Twisting Convex Polyhedra. CCCG 2022: 270-276 - [c7]Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec:
Long Plane Trees. SoCG 2022: 23:1-23:17 - [c6]Loke Durocher, Panagiotis Karras, Andreas Pavlogiannis, Josef Tkadlec:
Invasion Dynamics in the Biased Voter Process. IJCAI 2022: 265-271 - [c5]Oswin Aichholzer, Julia Obmann, Pavel Paták, Daniel Perz, Josef Tkadlec, Birgit Vogtenhuber:
Disjoint Compatibility via Graph Classes. WG 2022: 16-28 - 2021
- [c4]Adrian Dumitrescu, Josef Tkadlec:
Piercing All Translates of a Set of Axis-Parallel Rectangles. IWOCA 2021: 295-309 - [c3]Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber:
On Compatible Matchings. WALCOM 2021: 221-233 - 2020
- [c2]Guy Avni, Rasmus Ibsen-Jensen, Josef Tkadlec:
All-Pay Bidding Games on Graphs. AAAI 2020: 1798-1805 - 2016
- [c1]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Josef Tkadlec:
Robust Draws in Balanced Knockout Tournaments. IJCAI 2016: 172-179
Informal and Other Publications
- 2024
- [i19]Maarten Löffler, Tamara Mchedlidze, David Orden, Josef Tkadlec, Jules Wulms:
Flip Graphs of Pseudo-Triangulations With Face Degree at Most 4. CoRR abs/2402.12357 (2024) - [i18]Petros Petsinis, Andreas Pavlogiannis, Josef Tkadlec, Panagiotis Karras:
Seed Selection in the Heterogeneous Moran Process. CoRR abs/2404.15986 (2024) - [i17]Oswin Aichholzer, Julia Obmann, Pavel Paták, Daniel Perz, Josef Tkadlec, Birgit Vogtenhuber:
Disjoint Compatibility via Graph Classes. CoRR abs/2409.03579 (2024) - 2023
- [i16]Guy Avni, Tobias Meggendorfer, Suman Sadhukhan, Josef Tkadlec, Dorde Zikelic:
Reachability Poorman Discrete-Bidding Games. CoRR abs/2307.15218 (2023) - [i15]Sergio Cabello, Éva Czabarka, Ruy Fabila Monroy, Yuya Higashikawa, Raimund Seidel, László Székely, Josef Tkadlec, Alexandra Wesolek:
A Note on the 2-Colored Rectilinear Crossing Number of Random Point Sets in the Unit Square. CoRR abs/2312.01935 (2023) - 2022
- [i14]Joachim Brendborg, Panagiotis Karras, Andreas Pavlogiannis, Asger Ullersted Rasmussen, Josef Tkadlec:
Fixation Maximization in the Positional Moran Process. CoRR abs/2201.02248 (2022) - [i13]Loke Durocher, Panagiotis Karras, Andreas Pavlogiannis, Josef Tkadlec:
Invasion Dynamics in the Biased Voter Process. CoRR abs/2201.08207 (2022) - [i12]Eva-Maria Hainzl, Maarten Löffler, Daniel Perz, Josef Tkadlec, Markus Wallinger:
Finding a Battleship of Uncertain Shape. CoRR abs/2202.08747 (2022) - [i11]Adrian Dumitrescu, Josef Tkadlec:
Lattice and Non-lattice Piercing of Axis-Parallel Rectangles: Exact Algorithms and a Separation Result. CoRR abs/2204.10385 (2022) - [i10]Oswin Aichholzer, Brad Ballinger, Therese Biedl, Mirela Damian, Erik D. Demaine, Matias Korman, Anna Lubiw, Jayson Lynch, Josef Tkadlec, Yushi Uno:
Reconfiguration of Non-crossing Spanning Trees. CoRR abs/2206.03879 (2022) - [i9]Krishnendu Chatterjee, Jakub Svoboda, Dorde Zikelic, Andreas Pavlogiannis, Josef Tkadlec:
Social Balance on Networks: Local Minima and Best Edge Dynamics. CoRR abs/2210.02394 (2022) - 2021
- [i8]Sergio Cabello, Michael Hoffmann, Katharina Klost, Wolfgang Mulzer, Josef Tkadlec:
Long plane trees. CoRR abs/2101.00445 (2021) - [i7]Oswin Aichholzer, Alan Arroyo, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, Birgit Vogtenhuber:
On Compatible Matchings. CoRR abs/2101.03928 (2021) - [i6]Adrian Dumitrescu, Josef Tkadlec:
Piercing All Translates of a Set of Axis-Parallel Rectangles. CoRR abs/2106.07459 (2021) - 2019
- [i5]Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, Alexi Turcotte:
Token Swapping on Trees. CoRR abs/1903.06981 (2019) - [i4]Guy Avni, Rasmus Ibsen-Jensen, Josef Tkadlec:
All-Pay Bidding Games on Graphs. CoRR abs/1911.08360 (2019) - 2018
- [i3]Andreas Pavlogiannis, Josef Tkadlec, Krishnendu Chatterjee, Martin A. Nowak:
Strong Amplifiers of Natural Selection: Proofs. CoRR abs/1802.02509 (2018) - [i2]Josef Tkadlec, Andreas Pavlogiannis, Krishnendu Chatterjee, Martin A. Nowak:
Fixation probability and fixation time in structured populations. CoRR abs/1810.02687 (2018) - 2016
- [i1]Krishnendu Chatterjee, Rasmus Ibsen-Jensen, Josef Tkadlec:
Robust Draws in Balanced Knockout Tournaments. CoRR abs/1604.05090 (2016)
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-10-21 21:28 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:
