default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndrzej Grzesik
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j30]Dmitriy Gorovoy, Andrzej Grzesik, Justyna Jaworska:
On Triangle-Free Graphs Maximizing Embeddings of Bipartite Graphs. Electron. J. Comb. 31(2) (2024)- [j29]Dániel Gerbner, Andrzej Grzesik, Cory Palmer, Magdalena Prorok
:
Directed Graphs Without Rainbow Stars. Electron. J. Comb. 31(4) (2024) - [j28]Andrzej Grzesik, Daniel Král', Oleg Pikhurko:
Forcing generalised quasirandom graphs efficiently. Comb. Probab. Comput. 33(1): 16-31 (2024) - [j27]János Barát, Andrzej Grzesik, Attila Jung, Zoltán Lóránt Nagy, Dömötör Pálvölgyi:
The double Hall property and cycle covers in bipartite graphs. Discret. Math. 347(9): 114079 (2024) - [j26]Sebastian Babinski, Andrzej Grzesik:
Maximal edge colorings of graphs. Eur. J. Comb. 117: 103824 (2024) - [j25]Sebastian Babinski, Andrzej Grzesik:
Graphs without a Rainbow Path of Length 3. SIAM J. Discret. Math. 38(1): 629-644 (2024) - 2023
- [j24]Andrzej Grzesik, Ervin Györi, Nika Salia, Casey Tompkins:
Subgraph Densities in $K_r$-Free Graphs. Electron. J. Comb. 30(1) (2023) - [j23]Andrzej Grzesik, Daniel Král', László Miklós Lovász, Jan Volec:
Cycles of a given length in tournaments. J. Comb. Theory B 158(Part): 117-145 (2023) - [j22]Andrzej Grzesik, Daniel Il'kovic, Bartlomiej Kielak, Daniel Král':
Quasirandom-Forcing Orientations of Cycles. SIAM J. Discret. Math. 37(4): 2689-2716 (2023) - 2022
- [j21]Andrzej Grzesik, Joonkyung Lee, Bernard Lidický, Jan Volec:
On tripartite common graphs. Comb. Probab. Comput. 31(5): 907-923 (2022) - [j20]Lukasz Bozyk, Andrzej Grzesik, Bartlomiej Kielak:
On the inducibility of oriented graphs on four vertices. Discret. Math. 345(7): 112874 (2022) - [j19]Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa:
Tuza's Conjecture for Threshold Graphs. Discret. Math. Theor. Comput. Sci. 24(1) (2022) - [j18]Jacob W. Cooper, Andrzej Grzesik, Adam Kabela, Daniel Král':
Packing and covering directed triangles asymptotically. Eur. J. Comb. 101: 103462 (2022) - [j17]Andrzej Grzesik, Oliver Janzer, Zoltán Lóránt Nagy:
The Turán number of blow-ups of trees. J. Comb. Theory B 156: 299-309 (2022) - [j16]Andrzej Grzesik, Bartlomiej Kielak:
On the maximum number of odd cycles in graphs without smaller odd cycles. J. Graph Theory 99(2): 240-246 (2022) - [j15]Andrzej Grzesik, Ervin Györi, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora:
The maximum number of paths of length three in a planar graph. J. Graph Theory 101(3): 493-510 (2022) - [j14]Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk:
Polynomial-time Algorithm for Maximum Weight Independent Set on P6-free Graphs. ACM Trans. Algorithms 18(1): 4:1-4:57 (2022) - 2021
- [j13]Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk:
Covering Minimal Separators and Potential Maximal Cliques in $P_t$-Free Graphs. Electron. J. Comb. 28(1): 1 (2021) - [j12]James Aaronson, Carla Groenland, Andrzej Grzesik, Tom Johnston, Bartlomiej Kielak:
Exact hyperplane covers for subsets of the hypercube. Discret. Math. 344(9): 112490 (2021) - [i6]Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa:
Tuza's Conjecture for Threshold Graphs. CoRR abs/2105.09871 (2021) - 2020
- [j11]Timothy F. N. Chan, Andrzej Grzesik, Daniel Král', Jonathan A. Noel:
Cycles of length three and four in tournaments. J. Comb. Theory A 175: 105276 (2020) - [i5]Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk:
Covering minimal separators and potential maximal cliques in Pt-free graphs. CoRR abs/2003.12345 (2020)
2010 – 2019
- 2019
- [j10]Andrzej Grzesik, Ping Hu, Jan Volec:
Minimum number of edges that occur in odd cycles. J. Comb. Theory B 137: 65-103 (2019) - [c2]Andrzej Grzesik, Daniel Král:
Analytic representations of large graphs. BCC 2019: 57-88 - [c1]Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk:
Polynomial-time algorithm for Maximum Weight Independent Set on P6-free graphs. SODA 2019: 1257-1271 - 2018
- [j9]Jacob W. Cooper, Andrzej Grzesik, Daniel Král':
Optimal-size clique transversals in chordal graphs. J. Graph Theory 89(4): 479-493 (2018) - [i4]Andrzej Grzesik, Daniel Král', László Miklós Lovász:
Elusive extremal graphs. CoRR abs/1807.01141 (2018) - 2017
- [j8]Andrzej Grzesik:
On the Caccetta-Häggkvist Conjecture with a Forbidden Transitive Tournament. Electron. J. Comb. 24(2): 2 (2017) - [j7]Andrzej Grzesik, Daniel Král', László Miklós Lovász:
Extremal graph theory and finite forcibility. Electron. Notes Discret. Math. 61: 541-547 (2017) - [i3]Andrzej Grzesik, Tereza Klimosová, Marcin Pilipczuk, Michal Pilipczuk:
Polynomial-time algorithm for Maximum Weight Independent Set on $P_6$-free graphs. CoRR abs/1707.05491 (2017) - 2016
- [i2]Andrzej Grzesik, Ping Hu, Jan Volec:
Minimum number of edges that occur in odd cycles. CoRR abs/1605.09055 (2016) - 2015
- [j6]Andrzej Grzesik, Mirjana Mikalacki, Zoltán Lóránt Nagy, Alon Naor, Balázs Patkós, Fiona Skerman:
Avoider-Enforcer star games. Discret. Math. Theor. Comput. Sci. 17(1): 145-160 (2015) - [j5]Roman Glebov, Andrzej Grzesik, Tereza Klimosová, Daniel Král:
Finitely forcible graphons and permutons. J. Comb. Theory B 110: 112-135 (2015) - [j4]Andrzej Grzesik, Michal Morayne, Malgorzata Sulkowska:
From Directed Path to Linear Order - The Best Choice Problem for Powers of Directed Path. SIAM J. Discret. Math. 29(1): 500-513 (2015) - 2014
- [j3]Andrzej Grzesik, Hrant Khachatrian:
Interval edge-colorings of K1, m, n. Discret. Appl. Math. 174: 140-145 (2014) - 2013
- [i1]Andrzej Grzesik, Hrant Khachatrian:
Interval edge-colorings of K_{1, m, n}. CoRR abs/1308.4431 (2013) - 2012
- [j2]Andrzej Grzesik:
Indicated coloring of graphs. Discret. Math. 312(23): 3467-3472 (2012) - [j1]Andrzej Grzesik:
On the maximum number of five-cycles in a triangle-free graph. J. Comb. Theory B 102(5): 1061-1066 (2012)
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-03-04 21:10 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:
