default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarcin Brianski
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j6]Marcin Brianski, James Davies, Bartosz Walczak:
Separating Polynomial χ-Boundedness from χ-Boundedness. Comb. 44(1): 1-8 (2024)- [j5]Marcin Brianski, Martin Koutecký, Daniel Král', Kristýna Pekárková
, Felix Schröder:
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming. Math. Program. 208(1): 497-531 (2024) - [j4]Marcin Brianski, Gwenaël Joret, Michal T. Seweryn:
Pathwidth Versus Cocircumference. SIAM J. Discret. Math. 38(1): 857-866 (2024) - [i9]Marcin Brianski, Daniel Král, Kristýna Pekárková:
Branch-depth is minor closure of contraction-deletion-depth. CoRR abs/2402.16215 (2024) - [i8]Marcin Brianski, Meike Hatzel, Karolina Okrasa, Michal Pilipczuk:
Erdös-Pósa property of tripods in directed graphs. CoRR abs/2408.16733 (2024) - 2023
- [j3]Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma:
Treedepth vs Circumference. Comb. 43(4): 659-664 (2023) - [i7]Marcin Brianski, Gwenaël Joret, Michal T. Seweryn:
Pathwidth vs cocircumference. CoRR abs/2306.03621 (2023) - [i6]Marcin Brianski, Daniel Král, Ander Lamaison:
Closure property of contraction-depth of matroids. CoRR abs/2311.01945 (2023) - 2022
- [j2]Marcin Brianski, Adam Szady:
A short note on graphs with long Thomason chains. Discret. Math. 345(1): 112624 (2022) - [c2]Marcin Brianski, Martin Koutecký, Daniel Král', Kristýna Pekárková, Felix Schröder:
Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming. ICALP 2022: 29:1-29:20 - [i5]Marcin Brianski, James Davies, Bartosz Walczak:
Separating polynomial χ-boundedness from χ-boundedness. CoRR abs/2201.08814 (2022) - [i4]Marcin Brianski, Martin Koutecký, Daniel Král, Kristýna Pekárková, Felix Schröder:
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming. CoRR abs/2202.05299 (2022) - [i3]Marcin Brianski, Gwenaël Joret, Konrad Majewski, Piotr Micek, Michal T. Seweryn, Roohani Sharma:
Treedepth vs circumference. CoRR abs/2211.11410 (2022) - 2021
- [j1]Marcin Brianski, Piotr Micek, Michal Pilipczuk, Michal T. Seweryn:
Erdös-Hajnal Properties for Powers of Sparse Graphs. SIAM J. Discret. Math. 35(1): 447-464 (2021) - [c1]Marcin Brianski, Stefan Felsner, Jedrzej Hodor, Piotr Micek:
Reconfiguring Independent Sets on Interval Graphs. MFCS 2021: 23:1-23:14 - 2020
- [i2]Marcin Brianski, Jan Gwinner, Vladyslav Hlembotskyi, Witold Jarnicki, Szymon Plis, Adam Szady:
Introducing Structure to Expedite Quantum Search. CoRR abs/2006.05828 (2020) - [i1]Jan Gwinner, Marcin Brianski, Wojciech Burkot, Lukasz Czerwinski, Vladyslav Hlembotskyi:
Benchmarking 16-element quantum search algorithms on IBM quantum processors. CoRR abs/2007.06539 (2020)
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-11-07 20:33 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:
