Piotr Micek

Orcid: 0000-0001-9796-5375

According to our database1, Piotr Micek authored at least 70 papers between 2004 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Tight Bound on Treedepth in Terms of Pathwidth and Longest Path.
Comb., April, 2024

Dimension is polynomial in height for posets with planar cover graphs.
J. Comb. Theory B, March, 2024

The Excluded Tree Minor Theorem Revisited.
Comb. Probab. Comput., January, 2024

Product Structure Extension of the Alon-Seymour-Thomas Theorem.
SIAM J. Discret. Math., 2024

Planar graphs in blowups of fans.
CoRR, 2024

Weak coloring numbers of minor-closed graph classes.
CoRR, 2024

Quickly excluding an apex-forest.
CoRR, 2024

Vertex Ranking of Degenerate Graphs.
CoRR, 2024

Tight bound for the Erdős-Pósa property of tree minors.
CoRR, 2024

Bounded-Degree Planar Graphs Do Not Have Bounded-Degree Product Structure.
Electron. J. Comb., 2024

Cliquewidth and Dimension.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

The Grid-Minor Theorem Revisited.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Colouring bottomless rectangles and arborescences.
Comput. Geom., December, 2023

Treedepth vs Circumference.
Comb., August, 2023

2022
Boolean dimension and dim-boundedness: Planar cover graph with a zero.
CoRR, 2022

Improved Bounds for Weak Coloring Numbers.
Electron. J. Comb., 2022

Excluding a Ladder.
Comb., 2022

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

Adjacency Labelling for Planar Graphs (and Beyond).
J. ACM, 2021

Tight Bounds on the Clique Chromatic Number.
Electron. J. Comb., 2021

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

2020
Boolean Dimension, Components and Blocks.
Order, 2020

Planar Graphs Have Bounded Queue-Number.
J. ACM, 2020

Enumerating minimal dominating sets in the (in)comparability graphs of bounded dimension posets.
CoRR, 2020

Seymour's Conjecture on 2-Connected Graphs of Large Pathwidth.
Comb., 2020

Boolean Dimension and Tree-Width.
Comb., 2020

Improved bounds for centered colorings.
Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019
Separating tree-chromatic number from path-chromatic number.
J. Comb. Theory B, 2019

A note on the minimum number of edges in hypergraphs with property O.
Eur. J. Comb., 2019

Nowhere Dense Graph Classes and Dimension.
Comb., 2019

2018
On an Extremal Problem for Poset Dimension.
Order, 2018

The queue-number of planar posets.
CoRR, 2018

Sparsity and Dimension.
Comb., 2018

The Queue-Number of Posets of Bounded Width or Height.
Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2017
Planar Posets Have Dimension at Most Linear in Their Height.
SIAM J. Discret. Math., 2017

On the Dimension of Posets with Cover Graphs of Treewidth 2.
Order, 2017

Topological Minors of Cover Graphs and Dimension.
J. Graph Theory, 2017

Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision.
J. Graph Theory, 2017

Burling graphs, chromatic number, and orthogonal tree-decompositions.
Electron. Notes Discret. Math., 2017

An On-line Competitive Algorithm for Coloring Bipartite Graphs Without Long Induced Paths.
Algorithmica, 2017

2016
A Note on Concurrent Graph Sharing Games.
Integers, 2016

Pathwidth and Nonrepetitive List Coloring.
Electron. J. Comb., 2016

Tree-width and dimension.
Comb., 2016

2015
On-line Coloring between Two Lines.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
Making Octants Colorful and Related Covering Decomposition Problems.
SIAM J. Discret. Math., 2014

Triangle-free intersection graphs of line segments with large chromatic number.
J. Comb. Theory B, 2014

An extremal problem on crossing vectors.
J. Comb. Theory A, 2014

Towards an on-line version of Ohba's conjecture.
Eur. J. Comb., 2014

Coloring Intersection Graphs of Arc-Connected Sets in the Plane.
Discret. Comput. Geom., 2014

Outerplanar graph drawings with few slopes.
Comput. Geom., 2014

An On-line Competitive Algorithm for Coloring P_8 -free Bipartite Graphs.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Lower Bounds for On-line Graph Colorings.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013
Nonrepetitive Choice Number of Trees.
SIAM J. Discret. Math., 2013

New approach to nonrepetitive sequences.
Random Struct. Algorithms, 2013

On-line Chain Partitions of Up-growing Semi-orders.
Order, 2013

On-Line Dimension of Semi-Orders.
Order, 2013

Making Triangles Colorful.
J. Comput. Geom., 2013

Triangle-Free Geometric Intersection Graphs with Large Chromatic Number.
Discret. Comput. Geom., 2013

On the number of edges in families of pseudo-discs.
CoRR, 2013

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles.
Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

2012
On-Line Chain Partitions of Orders: A Survey.
Order, 2012

Parity in graph sharing games.
Discret. Math., 2012

On-line version of Rabinovitch theorem for proper intervals.
Discret. Math., 2012

2011
How to eat 4/9 of a pizza.
Discret. Math., 2011

A Graph-Grabbing Game.
Comb. Probab. Comput., 2011

Towards on-line Ohba's conjecture
CoRR, 2011

Nonrepetitive games
CoRR, 2011

2007
On-line Chain Partitioning of Up-growing Interval Orders.
Order, 2007

On-line chain partitioning of up-growing orders: The case of 2-dimensional orders and semi-orders
CoRR, 2007

2004
Variants of Online Chain Partition Problem of Posets.
Proceedings of the Second Workshop on Computational Logic and Applications, 2004


  Loading...