default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMatej Konecný
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j7]David Bradley-Williams, Peter J. Cameron, Jan Hubicka, Matej Konecný:
EPPA numbers of graphs. J. Comb. Theory B 170: 203-224 (2025)- 2024
- [i24]Jan Hubicka, Colin Jahel, Matej Konecný, Marcin Sabok:
Extension property for partial automorphisms of the n-partite and semigeneric tournaments. CoRR abs/2401.12153 (2024) - 2023
- [i23]Samuel Braunfeld
, David Chodounský, Noé de Rancourt, Jan Hubicka, Jamal Kawach, Matej Konecný:
Big Ramsey degrees and infinite languages. CoRR abs/2301.13116 (2023) - [i22]Martin Balko, David Chodounský, Natasha Dobrinen, Jan Hubicka, Matej Konecný, Lluís Vena, Andy Zucker:
Characterisation of the big Ramsey degrees of the generic partial order. CoRR abs/2303.10088 (2023) - [i21]Andrés Aranda, Samuel Braunfeld, David Chodounský, Jan Hubicka, Matej Konecný, Jaroslav Nesetril, Andy Zucker:
Type-respecting amalgamation and big Ramsey degrees. CoRR abs/2303.12679 (2023) - [i20]Tristan Bice, Noé de Rancourt, Jan Hubicka, Matej Konecný:
Big Ramsey degrees in the metric setting. CoRR abs/2303.14577 (2023) - [i19]Martin Balko, David Chodounský, Natasha Dobrinen, Jan Hubicka, Matej Konecný, Jaroslav Nesetril, Andy Zucker:
Ramsey theorem for trees with successor operation. CoRR abs/2311.06872 (2023) - [i18]David Bradley-Williams, Peter J. Cameron, Jan Hubicka, Matej Konecný:
EPPA numbers of graphs. CoRR abs/2311.07995 (2023) - 2022
- [j6]Martin Balko, David Chodounský, Jan Hubicka, Matej Konecný, Lluís Vena:
Big Ramsey Degrees of 3-Uniform Hypergraphs Are Finite. Comb. 42(5): 659-672 (2022) - 2021
- [j5]Jan Hubicka, Matej Konecný, Jaroslav Nesetril:
Conant's generalised metric spaces are Ramsey. Contributions Discret. Math. 16(2): 46-70 (2021) - [j4]Andrés Aranda, David Bradley-Williams, Eng Keat Hng, Jan Hubicka, Miltiadis Karamanlis, Michael Kompatscher, Matej Konecný, Micheal Pawliuk:
Completing graphs to metric spaces. Contributions Discret. Math. 16(2): 71-89 (2021) - [i17]Martin Balko, David Chodounský, Natasha Dobrinen, Jan Hubicka, Matej Konecný, Lluís Vena, Andy Zucker:
Big Ramsey degrees of the generic partial order. CoRR abs/2105.10542 (2021) - [i16]Martin Balko, David Chodounský, Jan Hubicka, Matej Konecný, Jaroslav Nesetril, Lluís Vena:
Big Ramsey degrees and forbidden cycles. CoRR abs/2105.12184 (2021) - 2020
- [j3]Matej Konecný:
Extending partial isometries of antipodal graphs. Discret. Math. 343(1): 111633 (2020) - [i15]Martin Balko, David Chodounský, Jan Hubicka, Matej Konecný, Lluís Vena:
Big Ramsey degrees of 3-uniform hypergraphs are finite. CoRR abs/2008.00268 (2020)
2010 – 2019
- 2019
- [i14]Matej Konecný:
Extending partial isometries of antipodal graphs. CoRR abs/1901.04426 (2019) - [i13]Jan Hubicka, Matej Konecný, Jaroslav Nesetril:
All those EPPA classes (Strengthenings of the Herwig-Lascar theorem). CoRR abs/1902.03855 (2019) - [i12]Jan Hubicka, Colin Jahel, Matej Konecný, Marcin Sabok:
Extending partial automorphisms of n-partite tournaments. CoRR abs/1903.07476 (2019) - [i11]Martin Balko, David Chodounský, Jan Hubicka, Matej Konecný, Lluís Vena:
Big Ramsey degrees of 3-uniform hypergraphs. CoRR abs/1906.03888 (2019) - 2018
- [j2]Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer:
Minimal sum labeling of graphs. J. Discrete Algorithms 52-53: 29-37 (2018) - [c4]Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Martin Smolík, Jakub Tetek, Martin Töpfer:
On the Simultaneous Minimum Spanning Trees Problem. CALDAM 2018: 235-248 - [i10]Matej Konecný:
Combinatorial Properties of Metrically Homogeneous Graphs. CoRR abs/1805.07425 (2018) - [i9]Jan Hubicka, Matej Konecný, Jaroslav Nesetril:
A combinatorial proof of the extension property for partial isometries. CoRR abs/1807.10976 (2018) - [i8]Jan Hubicka, Michael Kompatscher, Matej Konecný:
Forbidden cycles in metrically homogeneous graphs. CoRR abs/1808.05177 (2018) - [i7]David M. Evans, Jan Hubicka, Matej Konecný, Jaroslav Nesetril:
EPPA for two-graphs and antipodal metric spaces. CoRR abs/1812.11157 (2018) - 2017
- [j1]Andrés Aranda, David Bradley-Williams, Eng Keat Hng, Jan Hubicka, Miltiadis Karamanlis, Michael Kompatscher, Matej Konecný, Micheal Pawliuk:
Completing graphs to metric spaces. Electron. Notes Discret. Math. 61: 53-60 (2017) - [c3]Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer:
Minimal Sum Labeling of Graphs. IWOCA 2017: 252-263 - [i6]Andrés Aranda, David Bradley-Williams, Eng Keat Hng, Jan Hubicka, Miltiadis Karamanlis, Michael Kompatscher, Matej Konecný, Micheal Pawliuk:
Completing graphs to metric spaces. CoRR abs/1706.00295 (2017) - [i5]Andrés Aranda, David Bradley-Williams, Jan Hubicka, Miltiadis Karamanlis, Michael Kompatscher, Matej Konecný, Micheal Pawliuk:
Ramsey expansions of metrically homogeneous graphs. CoRR abs/1707.02612 (2017) - [i4]Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Stepán Simsa, Martin Töpfer:
Minimal Sum Labeling of Graphs. CoRR abs/1708.00552 (2017) - [i3]Jan Hubicka, Matej Konecný, Jaroslav Nesetril:
Conant's generalised metric spaces are Ramsey. CoRR abs/1710.04690 (2017) - [i2]Matej Konecný, Stanislav Kucera, Jana Novotná, Jakub Pekárek, Martin Smolík, Jakub Tetek, Martin Töpfer:
On the Simultaneous Minimum Spanning Trees Problem. CoRR abs/1712.00253 (2017) - 2016
- [c2]Matej Konecný, Stanislav Kucera, Michal Opler, Jakub Sosnovec, Stepán Simsa, Martin Töpfer:
Squarability of rectangle arrangements. CCCG 2016: 101-106 - [i1]Matej Konecný, Stanislav Kucera, Michal Opler, Jakub Sosnovec, Stepán Simsa, Martin Töpfer:
Squarability of rectangle arrangements. CoRR abs/1611.07073 (2016)
2000 – 2009
- 2007
- [c1]David A. van Leeuwen, Matej Konecný:
Progress in the AMIDA Speaker Diarization System for Meeting Data. CLEAR 2007: 475-483
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-15 21:40 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:
