Piotr Micek

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Product structure extension of the Alon--Seymour--Thomas theorem
(available as arXiv preprint)
N/APaper
The Excluded Tree Minor Theorem Revisited
(available as arXiv preprint)
N/APaper
Tight bound for the Erd\H{o}s-P\'osa property of tree minors
(available as arXiv preprint)
N/APaper
Vertex Ranking of Degenerate Graphs
(available as arXiv preprint)
N/APaper
Quickly excluding an apex-forest
(available as arXiv preprint)
N/APaper
Erdös-Pósa property of cycles that are far apart
Journal of the London Mathematical Society. Second Series
2026-09-03Paper
Shallow brambles
Discrete Mathematics and Theoretical Computer Science. DMTCS
2026-06-04Paper
Quickly excluding an apex-forest
SIAM Journal on Discrete Mathematics
2026-04-01Paper
The Grid-Minor theorem revisited
Combinatorica
2026-01-20Paper
Cliquewidth and dimension
Proceedings of the London Mathematical Society. Third Series
2026-01-16Paper
Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets
Discrete Mathematics
2026-01-15Paper
Tight bound for the Erdős-Pósa property of tree minors
Combinatorics, Probability and Computing
2025-12-29Paper
Adjacency labelling for planar graphs (and beyond)2025-08-12Paper
Planar graphs have bounded queue-number2025-08-12Paper
Boolean dimension of a Boolean lattice
Order
2025-06-30Paper
The Grid-Minor theorem revisited2024-11-28Paper
Cliquewidth and dimension2024-11-28Paper
The excluded tree minor theorem revisited
Combinatorics, Probability and Computing
2024-11-05Paper
Bounded-degree planar graphs do not have bounded-degree product structure
The Electronic Journal of Combinatorics
2024-07-18Paper
Product structure extension of the Alon-Seymour-Thomas theorem
SIAM Journal on Discrete Mathematics
2024-07-16Paper
Dimension is polynomial in height for posets with planar cover graphs
Journal of Combinatorial Theory. Series B
2024-01-15Paper
Treedepth vs circumference
Combinatorica
2023-10-04Paper
Cliquewidth and dimension2023-08-23Paper
Reconfiguring Independent Sets on Interval Graphs
(available as arXiv preprint)
2023-08-08Paper
Colouring bottomless rectangles and arborescences
Computational Geometry
2023-07-31Paper
Boolean dimension of a Boolean lattice2023-07-31Paper
The grid-minor theorem revisited2023-07-06Paper
Tight bound on treedepth in terms of pathwidth and longest path2023-02-06Paper
Adjacency Labelling for Planar Graphs (and Beyond)
Journal of the ACM
2022-12-08Paper
Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure2022-12-05Paper
Excluding a ladder
Combinatorica
2022-11-09Paper
Boolean dimension and dim-boundedness: Planar cover graph with a zero2022-06-14Paper
Improved bounds for weak coloring numbers
The Electronic Journal of Combinatorics
2022-04-04Paper
Improved bounds for centered colorings
Advances in Combinatorics
2021-11-05Paper
Tight bounds on the clique chromatic number
The Electronic Journal of Combinatorics
2021-09-28Paper
Seymour's conjecture on 2-connected graphs of large pathwidth
Combinatorica
2021-04-16Paper
Erdös-Hajnal properties for powers of sparse graphs
SIAM Journal on Discrete Mathematics
2021-03-30Paper
Boolean dimension and tree-width
Combinatorica
2021-03-20Paper
Improved bounds for centered colorings
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms
2021-02-02Paper
Planar graphs have bounded queue-number
Journal of the ACM
2020-11-11Paper
Boolean dimension, components and blocks
Order
2020-07-17Paper
Tight Bounds on the Clique Chromatic Number
(available as arXiv preprint)
2020-06-19Paper
Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets2020-04-15Paper
Excluding a ladder
(available as arXiv preprint)
2020-02-02Paper
Nowhere dense graph classes and dimension
Combinatorica
2020-01-17Paper
Planar cubic graphs of small diameter2019-08-15Paper
Separating tree-chromatic number from path-chromatic number
Journal of Combinatorial Theory. Series B
2019-07-17Paper
Making octants colorful and related covering decomposition problems
Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-06-20Paper
The queue-number of posets of bounded width or height
(available as arXiv preprint)
2019-02-15Paper
Sparsity and dimension
Combinatorica
2019-02-01Paper
Sparsity and dimension
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms
2018-07-16Paper
Burling graphs, chromatic number, and orthogonal tree-decompositions
The Electronic Journal of Combinatorics
2018-02-22Paper
Burling graphs, chromatic number, and orthogonal tree-decompositions
Electronic Notes in Discrete Mathematics
2018-01-18Paper
Planar Posets Have Dimension at Most Linear in Their Height
SIAM Journal on Discrete Mathematics
2018-01-04Paper
Topological minors of cover graphs and dimension
Journal of Graph Theory
2017-12-01Paper
On-line coloring between two lines
(available as arXiv preprint)
2017-10-10Paper
On the dimension of posets with cover graphs of treewidth 2
Order
2017-10-06Paper
Tree-width and dimension
Combinatorica
2017-08-25Paper
Graph sharing game and the structure of weighted graphs with a forbidden subdivision
Journal of Graph Theory
2017-06-30Paper
An on-line competitive algorithm for coloring bipartite graphs without long induced paths
Algorithmica
2017-05-02Paper
Making triangles colorful
(available as arXiv preprint)
2017-03-09Paper
Pathwidth and nonrepetitive list coloring
The Electronic Journal of Combinatorics
2017-01-18Paper
Pathwidth and nonrepetitive list coloring
The Electronic Journal of Combinatorics
2017-01-18Paper
A note on concurrent graph sharing games
Integers
2016-10-28Paper
A note on concurrent graph sharing games
Integers
2016-10-28Paper
Lower bounds for on-line graph colorings
Algorithms and Computation
2015-09-11Paper
An on-line competitive algorithm for coloring P₈-free bipartite graphs
Algorithms and Computation
2015-09-11Paper
Making Octants Colorful and Related Covering Decomposition Problems
SIAM Journal on Discrete Mathematics
2015-04-17Paper
Coloring intersection graphs of arc-connected sets in the plane
Discrete & Computational Geometry
2014-10-29Paper
An extremal problem on crossing vectors.
Journal of Combinatorial Theory. Series A
2014-10-07Paper
Triangle-free intersection graphs of line segments with large chromatic number
Journal of Combinatorial Theory. Series B
2014-08-27Paper
Coloring intersection graphs of arcwise connected sets in the plane2014-06-11Paper
Outerplanar graph drawings with few slopes
Computational Geometry
2014-04-09Paper
Towards an on-line version of Ohba's conjecture
European Journal of Combinatorics
2014-03-25Paper
Note on the number of edges in families with linear union-complexity2013-12-05Paper
Triangle-free geometric intersection graphs with large chromatic number
Discrete & Computational Geometry
2013-11-06Paper
Variants of online chain partition problem of posets2013-10-02Paper
Coloring hypergraphs induced by dynamic point sets and bottomless rectangles
Lecture Notes in Computer Science
2013-08-12Paper
Nonrepetitive choice number of trees
SIAM Journal on Discrete Mathematics
2013-06-27Paper
On-line dimension of semi-orders
Order
2013-06-26Paper
On-line chain partitions of up-growing semi-orders
Order
2013-03-20Paper
New approach to nonrepetitive sequences
Random Structures & Algorithms
2013-03-12Paper
On-line version of Rabinovitch theorem for proper intervals
Discrete Mathematics
2012-11-15Paper
Outerplanar graph drawings with few slopes
Lecture Notes in Computer Science
2012-09-25Paper
Parity in graph sharing games
Discrete Mathematics
2012-05-30Paper
On-line chain partitions of orders: a survey
Order
2012-03-23Paper
A Graph-Grabbing Game
Combinatorics, Probability and Computing
2011-08-16Paper
How to eat 4/9 of a pizza
Discrete Mathematics
2011-08-08Paper
scientific article; zbMATH DE number 5762570 (Why is no real title available?)2010-07-28Paper
On-line coloring of \(I_{s}\)-free graphs2010-07-28Paper
On-line chain partitioning of up-growing interval orders
Order
2007-10-12Paper


Research outcomes over time


This page was built for person: Piotr Micek