default search action
Matija Bucic
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j20]Matija Bucic
, Benny Sudakov:
Large Independent Sets from Local Considerations. Comb. 43(3): 505-546 (2023) - [j19]Matija Bucic
The ( t - 1 ) $(t-1)$ -chromatic Ramsey number for paths. J. Graph Theory 102(4): 784-796 (2023) - [j18]Domagoj Bradac
Covering random graphs with monochromatic trees. Random Struct. Algorithms 62(3): 545-563 (2023) - [c2]Matija Bucic
Towards the Erdős-Gallai Cycle Decomposition Conjecture. STOC 2023: 839-852 - 2022
- [j17]Matija Bucic
Clique minors in graphs with a forbidden subgraph. Random Struct. Algorithms 60(3): 327-338 (2022) - 2021
- [j16]Matija Bucic
Tournament Quasirandomness from Local Counting. Comb. 41(2): 175-208 (2021) - [j15]Matija Bucic
Covering Graphs by Monochromatic Trees and Helly-Type Results for Hypergraphs. Comb. 41(3): 319-352 (2021) - [j14]Matija Bucic
Universal and unavoidable graphs. Comb. Probab. Comput. 30(6): 942-955 (2021) - [j13]Matija Bucic
Unavoidable hypergraphs. J. Comb. Theory B 151: 307-338 (2021) - [j12]Noga Alon, Matija Bucic
List Ramsey numbers. J. Graph Theory 96(1): 109-128 (2021) - [j11]Matija Bucic
Perfect matchings and derangements on graphs. J. Graph Theory 97(2): 340-354 (2021) - 2020
- [j10]Matija Bucic
Monochromatic trees in random tournaments. Comb. Probab. Comput. 29(3): 318-345 (2020) - [j9]Matija Bucic
2-factors with k cycles in Hamiltonian graphs. J. Comb. Theory B 144: 150-166 (2020)
2010 – 2019
- 2019
- [j8]Matija Bucic
Multicolour Bipartite Ramsey Number of Paths. Electron. J. Comb. 26(3): 3 (2019) - [j7]Matija Bucic
Directed Ramsey number for trees. J. Comb. Theory B 137: 145-177 (2019) - [j6]Matija Bucic
Partition problems in high dimensional boxes. J. Comb. Theory A 166: 315-336 (2019) - [j5]Matija Bucic
3-Color bipartite Ramsey number of cycles and paths. J. Graph Theory 92(4): 445-459 (2019) - [j4]Matija Bucic
Monochromatic paths in random tournaments. Random Struct. Algorithms 54(1): 69-81 (2019) - 2018
- [j3]Matija Bucic
An improved bound for disjoint directed cycles. Discret. Math. 341(8): 2231-2236 (2018) - [c1]Matija Bucic, Melkior Ornik, Ufuk Topcu
Graph-Based Controller Synthesis for Safety-Constrained, Resilient Systems. Allerton 2018: 297-304 - 2017
- [j2]Matija Bucic
Directed Ramsey number for trees. Electron. Notes Discret. Math. 61: 169-175 (2017) - [j1]Matija Bucic
Monochromatic paths in random tournaments. Electron. Notes Discret. Math. 61: 177-183 (2017)
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-07 21:23 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: