default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDIda Kantor
Person information
- affiliation: Charles University, Prague, Czech Republic
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Vasek Chvátal, Noé de Rancourt, Guillermo Gamboa Quintero, Ida Kantor, Péter G. N. Szabó:
Metric spaces in which many triangles are degenerate. Discret. Appl. Math. 350: 97-99 (2024)- 2023
- [j12]Ida Kantor
:
Lines in the Plane with the L1 Metric. Discret. Comput. Geom. 70(3): 960-974 (2023) - 2020
- [j11]Vít Jelínek, Ida Kantor, Jan Kyncl, Martin Tancer:
On the growth of the Möbius function of permutations. J. Comb. Theory A 169 (2020)
2010 – 2019
- 2018
- [j10]Zoltán Füredi, Ida Kantor:
Kneser Ranks of Random Graphs and Minimum Difference Representations. SIAM J. Discret. Math. 32(2): 1016-1028 (2018) - 2017
- [j9]Zoltán Füredi, Ida Kantor:
Kneser ranks of random graphs and minimum difference representations. Electron. Notes Discret. Math. 61: 499-503 (2017) - 2016
- [j8]Zoltán Füredi, Ida Kantor:
List Colorings with Distinct List Sizes, the Case of Complete Bipartite Graphs. J. Graph Theory 82(2): 218-227 (2016) - 2014
- [p1]Béla Bollobás, Zoltán Füredi, Ida Kantor, Gyula O. H. Katona, Imre Leader:
A coding problem for pairs of subsets. Geometry, Structure and Randomness in Combinatorics 2014: 47-59 - 2013
- [j7]Ida Kantor, Balázs Patkós:
Towards a de Bruijn-Erdős Theorem in the L1-Metric. Discret. Comput. Geom. 49(3): 659-670 (2013) - 2012
- [j6]János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós:
Large Bd-Free and Union-free Subfamilies. SIAM J. Discret. Math. 26(1): 71-76 (2012) - 2011
- [j5]János Barát, Zoltán Füredi, Ida Kantor, Younjin Kim, Balázs Patkós:
Large Bd-free and union-free subfamilies. Electron. Notes Discret. Math. 38: 101-104 (2011) - [j4]Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri:
Reverse-free codes and permutations. Electron. Notes Discret. Math. 38: 383-387 (2011) - 2010
- [j3]Zoltán Füredi, Ida Kantor, Angelo Monti, Blerina Sinaimeri:
On Reverse-Free Codes and Permutations. SIAM J. Discret. Math. 24(3): 964-978 (2010)
2000 – 2009
- 2009
- [j2]Zoltán Füredi, Ida Kantor:
List colorings with distinct list sizes, the case of complete bipartite graphs. Electron. Notes Discret. Math. 34: 323-327 (2009) - 2007
- [j1]Jaroslav Nesetril, Ida Svejdarová:
Small Diameters of Duals. SIAM J. Discret. Math. 21(2): 374-384 (2007)
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-06-10 21:25 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:
