Piotr Micek

William T. Trotter

J. Comb. Theory, Ser. B, March, 2024

The Excluded Tree Minor Theorem Revisited.

[BibT_eX]

[DOI]

Comb. Probab. Comput., January, 2024

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

[BibT_eX]

[DOI]

CoRR, 2024

Cliquewidth and Dimension.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

The Grid-Minor Theorem Revisited.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Colouring bottomless rectangles and arborescences.

[BibT_eX]

[DOI]

Comput. Geom., December, 2023

Treedepth vs Circumference.

[BibT_eX]

[DOI]

Comb., August, 2023

2022

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

[BibT_eX]

[DOI]

Heather C. Smith Blake

William T. Trotter

CoRR, 2022

Improved Bounds for Weak Coloring Numbers.

[BibT_eX]

[DOI]

Electron. J. Comb., 2022

Excluding a Ladder.

[BibT_eX]

[DOI]

Comb., 2022

2021

Erdös-Hajnal Properties for Powers of Sparse Graphs.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2021

Adjacency Labelling for Planar Graphs (and Beyond).

[BibT_eX]

[DOI]

J. ACM, 2021

Tight Bounds on the Clique Chromatic Number.

[BibT_eX]

[DOI]

Electron. J. Comb., 2021

Reconfiguring Independent Sets on Interval Graphs.

[BibT_eX]

[DOI]

Proceedings of the 46th International Symposium on Mathematical Foundations of Computer Science, 2021

2020

Boolean Dimension, Components and Blocks.

[BibT_eX]

[DOI]

Tamás Mészáros

William T. Trotter

Order, 2020

Planar Graphs Have Bounded Queue-Number.

[BibT_eX]

[DOI]

J. ACM, 2020

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

[BibT_eX]

[DOI]

CoRR, 2020

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

[BibT_eX]

[DOI]

Comb., 2020

Boolean Dimension and Tree-Width.

[BibT_eX]

[DOI]

Stefan Felsner

Tamás Mészáros

Comb., 2020

Improved bounds for centered colorings.

[BibT_eX]

[DOI]

Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms, 2020

2019

Separating tree-chromatic number from path-chromatic number.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2019

A note on the minimum number of edges in hypergraphs with property O.

[BibT_eX]

[DOI]

Eur. J. Comb., 2019

Nowhere Dense Graph Classes and Dimension.

[BibT_eX]

[DOI]

Patrice Ossona de Mendez

Comb., 2019

2018

On an Extremal Problem for Poset Dimension.

[BibT_eX]

[DOI]

Grzegorz Guspiel

Adam Polak

Order, 2018

The queue-number of planar posets.

[BibT_eX]

[DOI]

Kolja Knauer

CoRR, 2018

Sparsity and Dimension.

[BibT_eX]

[DOI]

Comb., 2018

The Queue-Number of Posets of Bounded Width or Height.

[BibT_eX]

[DOI]

Kolja Knauer

Proceedings of the Graph Drawing and Network Visualization - 26th International Symposium, 2018

2017

Planar Posets Have Dimension at Most Linear in Their Height.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

On the Dimension of Posets with Cover Graphs of Treewidth 2.

[BibT_eX]

[DOI]

Order, 2017

Topological Minors of Cover Graphs and Dimension.

[BibT_eX]

[DOI]

J. Graph Theory, 2017

Graph Sharing Game and the Structure of Weighted Graphs with a Forbidden Subdivision.

[BibT_eX]

[DOI]

Adam Gagol

J. Graph Theory, 2017

Burling graphs, chromatic number, and orthogonal tree-decompositions.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

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

[BibT_eX]

[DOI]

Algorithmica, 2017

2016

A Note on Concurrent Graph Sharing Games.

[BibT_eX]

[DOI]

Integers, 2016

Pathwidth and Nonrepetitive List Coloring.

[BibT_eX]

[DOI]

Electron. J. Comb., 2016

Tree-width and dimension.

[BibT_eX]

[DOI]

Comb., 2016

2015

On-line Coloring between Two Lines.

[BibT_eX]

[DOI]

Stefan Felsner

Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014

Making Octants Colorful and Related Covering Decomposition Problems.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2014

Triangle-free intersection graphs of line segments with large chromatic number.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. B, 2014

An extremal problem on crossing vectors.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 2014

Towards an on-line version of Ohba's conjecture.

[BibT_eX]

[DOI]

Xuding Zhu

Eur. J. Comb., 2014

Coloring Intersection Graphs of Arc-Connected Sets in the Plane.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

Outerplanar graph drawings with few slopes.

[BibT_eX]

[DOI]

Kolja B. Knauer

Comput. Geom., 2014

An On-line Competitive Algorithm for Coloring P_8 -free Bipartite Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Lower Bounds for On-line Graph Colorings.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

2013

Nonrepetitive Choice Number of Trees.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2013

New approach to nonrepetitive sequences.

[BibT_eX]

[DOI]

Jaroslaw Grytczuk

Random Struct. Algorithms, 2013

On-line Chain Partitions of Up-growing Semi-orders.

[BibT_eX]

[DOI]

Order, 2013

On-Line Dimension of Semi-Orders.

[BibT_eX]

[DOI]

Order, 2013

Making Triangles Colorful.

[BibT_eX]

[DOI]

J. Comput. Geom., 2013

Triangle-Free Geometric Intersection Graphs with Large Chromatic Number.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

On the number of edges in families of pseudo-discs.

[BibT_eX]

[DOI]

Rom Pinchasi

CoRR, 2013

Coloring Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 13th International Symposium, 2013

2012

On-Line Chain Partitions of Orders: A Survey.

[BibT_eX]

[DOI]

Order, 2012

Parity in graph sharing games.

[BibT_eX]

[DOI]

Discret. Math., 2012

On-line version of Rabinovitch theorem for proper intervals.

[BibT_eX]

[DOI]

Discret. Math., 2012

2011

How to eat 4/9 of a pizza.

[BibT_eX]

[DOI]

Kolja B. Knauer

Discret. Math., 2011

A Graph-Grabbing Game.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2011

Towards on-line Ohba's conjecture

[BibT_eX]

[DOI]

Xuding Zhu

CoRR, 2011

Nonrepetitive games

[BibT_eX]

[DOI]

Jaroslaw Grytczuk

CoRR, 2011

2007

On-line Chain Partitioning of Up-growing Interval Orders.

[BibT_eX]

[DOI]

Patrick Baier

Bartlomiej Bosek

Order, 2007

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

[BibT_eX]

[DOI]

CoRR, 2007

2004

Variants of Online Chain Partition Problem of Posets.

[BibT_eX]

[DOI]

Bartlomiej Bosek