Marcin Brianski

Orcid: 0000-0002-1695-0188

According to our database1, Marcin Brianski authored at least 17 papers between 2020 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
On Integer Programs That Look Like Paths.
CoRR, October, 2025

Burling graphs in graphs with large chromatic number.
CoRR, October, 2025

Boolean Dimension of a Boolean Lattice.
Order, April, 2025

Excluding a Clique or a Biclique in Graphs of Bounded Induced Matching Treewidth.
SIAM J. Discret. Math., 2025

2024
Pathwidth Versus Cocircumference.
SIAM J. Discret. Math., March, 2024

Erdös-Pósa property of tripods in directed graphs.
CoRR, 2024

Branch-depth is minor closure of contraction-deletion-depth.
CoRR, 2024

Separating Polynomial χ-Boundedness from χ-Boundedness.
Comb., 2024

2023
Treedepth vs Circumference.
Comb., August, 2023

Closure property of contraction-depth of matroids.
CoRR, 2023

Pathwidth vs cocircumference.
CoRR, 2023

2022
A short note on graphs with long Thomason chains.
Discret. Math., 2022

Characterization of Matrices with Bounded Graver Bases and Depth Parameters and Applications to Integer Programming.
Proceedings of the 49th International Colloquium on Automata, Languages, and Programming, 2022

2021
Erdös-Hajnal Properties for Powers of Sparse Graphs.
SIAM J. Discret. Math., 2021

Reconfiguring Independent Sets on Interval Graphs.
Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020
Benchmarking 16-element quantum search algorithms on IBM quantum processors.
CoRR, 2020

Introducing Structure to Expedite Quantum Search.
CoRR, 2020


  Loading...