Webpage of Marcin Briański

I am a PhD student at the Institute of Theoretical Computer Science of Jagiellonian University under supervision of Piotr Micek.

I am working as a mathematician at BEIT in Kraków.

My interests center around structural graph theory, graph colourings, graph algorithms and recently structural matroid theory.

Last updated on 22.11.2022

Treedepth vs circumference
with Gwenaël Joret, Konrad Majewski, Piotr Micek, Michał T. Seweryn, and Roohani Sharma
preprint
Characterization of matrices with bounded Graver bases and depth parameters and applications to integer programming
with Martin Koutecký, Daniel Kráľ, Kristýna Pekárková, and Felix Schröder
49th International Colloquium on Automata, Languages, and Programming (ICALP 2022), 29:1--29:20
Separating polynomial χ-boundedness from χ-boundedness
with James Davies, and Bartosz Walczak
preprint
Reconfiguring Independent Sets on Interval Graphs
with Stefan Felsner, Jędrzej Hodor, and Piotr Micek
46th International Symposium on Mathematical Foundations of Computer Science (MFCS 2021), 23:1--23:14
Benchmarking 16-element quantum search algorithms on superconducting quantum processors
with Jan Gwinner, Wojtek Burkot, Łukasz Czerwiński and Vladyslav Hlembotskyi
preprint
Introducing Structure to Expedite Quantum Search
with Jan Gwinner, Vladyslav Hlembotskyi, Witold Jarnicki, Szymon Pliś, and Adam Szady
Physical Review A, 2021, 103.6: 062425
Erdős-Hajnal properties for powers of sparse graphs
with Piotr Micek, Michał Pilipczuk, and Michał T. Seweryn
SIAM J. Discrete Math., 35(1), 447–464
A short note on graphs with long Thomason's chains
with Adam Szady
Discrete Mathematics, 2022, 345.1: 112624

Level of competence left unspecified.