Bartosz Walczak

Eur. J. Comb., March, 2024

Polynomial-time recognition and maximum independent set in Burling graphs.

[BibT_eX]

[DOI]

Pawel Rzazewski

CoRR, 2024

Separating Polynomial χ-Boundedness from χ-Boundedness.

[BibT_eX]

[DOI]

Marcin Brianski

James Davies

Comb., 2024

Cliquewidth and Dimension.

[BibT_eX]

[DOI]

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

Separator Theorem and Algorithms for Planar Hyperbolic Graphs.

[BibT_eX]

[DOI]

Proceedings of the 40th International Symposium on Computational Geometry, 2024

2023

Grounded L-Graphs Are Polynomially χ-Bounded.

[BibT_eX]

[DOI]

Discret. Comput. Geom., December, 2023

Coloring polygon visibility graphs and their generalizations.

[BibT_eX]

[DOI]

J. Comb. Theory B, July, 2023

Approximating Pathwidth for Graphs of Small Treewidth.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, April, 2023

Distinguishing Classes of Intersection Graphs of Homothets or Similarities of Two Convex Disks.

[BibT_eX]

[DOI]

Proceedings of the 39th International Symposium on Computational Geometry, 2023

2022

Degeneracy of Pt-free and C⩾t-free graphs with no large complete bipartite subgraphs.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2022

Clustered 3-colouring graphs of bounded degree.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2022

A Solution to Ringel's Circle Problem.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Subexponential-Time Algorithms for Finding Large Induced Sparse Subgraphs.

[BibT_eX]

[DOI]

Algorithmica, 2021

Coloring and Maximum Weight Independent Set of Rectangles.

[BibT_eX]

[DOI]

Parinya Chalermsook

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

Colouring Polygon Visibility Graphs and Their Generalizations.

[BibT_eX]

[DOI]

Proceedings of the 37th International Symposium on Computational Geometry, 2021

2020

Coloring triangle-free L-graphs with O(log log n) colors.

[BibT_eX]

[DOI]

CoRR, 2020

2019

Common Tangents of Two Disjoint Polygons in Linear Time and Constant Workspace.

[BibT_eX]

[DOI]

ACM Trans. Algorithms, 2019

Outerstring Graphs are χ-Bounded.

[BibT_eX]

[DOI]

Alexandre Rok

SIAM J. Discret. Math., 2019

Dimension of posets with planar cover graphs excluding two long incomparable chains.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2019

Coloring Curves that Cross a Fixed Curve.

[BibT_eX]

[DOI]

Alexandre Rok

Discret. Comput. Geom., 2019

Planar graphs have bounded nonrepetitive chromatic number.

[BibT_eX]

[DOI]

CoRR, 2019

2018

Realization of shift graphs as disjointness graphs of 1-intersecting curves in the plane.

[BibT_eX]

[DOI]

Torsten Mütze

Veit Wiechert

CoRR, 2018

Sparse Kneser graphs are Hamiltonian.

[BibT_eX]

[DOI]

Torsten Mütze

Jerri Nummenpalo

Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, 2018

2017

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

[BibT_eX]

[DOI]

Adam Gagol

J. Graph Theory, 2017

Minors and dimension.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2017

Boolean Dimension and Local Dimension.

[BibT_eX]

[DOI]

William T. Trotter

Electron. Notes Discret. Math., 2017

On the Beer Index of Convexity and Its Variants.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2017

On-Line Approach to Off-Line Coloring Problems on Graphs with Geometric Representations.

[BibT_eX]

[DOI]

Comb., 2017

Extending Partial Representations of Trapezoid Graphs.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2017

2016

Decomposition of Multiple Packings with Subquadratic Union Complexity.

[BibT_eX]

[DOI]

János Pach

Comb. Probab. Comput., 2016

Outer common tangents and nesting of convex hulls of two disjoint simple polygons in linear time and constant workspace.

[BibT_eX]

[DOI]

CoRR, 2016

Tree-width and dimension.

[BibT_eX]

[DOI]

Comb., 2016

Graph Drawings with One Bend and Few Slopes.

[BibT_eX]

[DOI]

Kolja Knauer

Proceedings of the LATIN 2016: Theoretical Informatics, 2016

Outer Common Tangents and Nesting of Convex Hulls in Linear Time and Constant Workspace.

[BibT_eX]

[DOI]

Proceedings of the 24th Annual European Symposium on Algorithms, 2016

2015

Asymmetric Coloring Games on Incomparability Graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2015

Triangle-Free Geometric Intersection Graphs with No Large Independent Sets.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2015

Coloring Triangle-Free Rectangle Overlap Graphs with $$O(\log \log n)$$ O ( log log n ) Colors.

[BibT_eX]

[DOI]

Arkadiusz Pawlik

Discret. Comput. Geom., 2015

Dimension and cut vertices: an application of Ramsey theory.

[BibT_eX]

[DOI]

William T. Trotter

Ruidong Wang

CoRR, 2015

Coloring curves intersecting a fixed line.

[BibT_eX]

[DOI]

Alexandre Rok

CoRR, 2015

New bounds on the maximum number of edges in k-quasi-planar graphs.

[BibT_eX]

[DOI]

Andrew Suk

Comput. Geom., 2015

2014

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

[BibT_eX]

[DOI]

J. Comb. Theory B, 2014

An extremal problem on crossing vectors.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2014

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

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

Triangle-free geometric intersection graphs with no big independent sets.

[BibT_eX]

[DOI]

CoRR, 2014

Outerplanar graph drawings with few slopes.

[BibT_eX]

[DOI]

Kolja B. Knauer

Comput. Geom., 2014

Coloring Relatives of Interval Overlap Graphs via On-line Games.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages, and Programming - 41st International Colloquium, 2014

2013

Triangle-Free Geometric Intersection Graphs with Large Chromatic Number.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2013

Coloring triangle-free rectangular frame intersection graphs with O(log log n) colors

[BibT_eX]

[DOI]

Arkadiusz Pawlik

CoRR, 2013

Coloring Triangle-Free Rectangular Frame Intersection Graphs with O(loglogn) Colors.

[BibT_eX]

[DOI]

Arkadiusz Pawlik

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2013

2012

Parity in graph sharing games.

[BibT_eX]

[DOI]

Discret. Math., 2012

Extending Partial Representations of Function Graphs and Permutation Graphs.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

2011

A Graph-Grabbing Game.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2011

2010

A simple representation of subwords of the Fibonacci word.

[BibT_eX]

[DOI]