Daniel Gonçalves

Lucas Picasarri-Arrieta

Amadeus Reinald

CoRR, 2024

Oriented trees in O(k √k)-chromatic digraphs, a subquadratic bound for Burr's conjecture.

[BibT_eX]

[DOI]

Stéphane Bessy

Amadeus Reinald

CoRR, 2024

Subexponential Algorithms in Geometric Graphs via the Subquadratic Grid Minor Property: The Role of Local Radius.

[BibT_eX]

[DOI]

Proceedings of the 19th Scandinavian Symposium and Workshops on Algorithm Theory, 2024

2023

Subexponential parameterized algorithms for cycle-hitting problems in contact and intersection graphs of segments.

[BibT_eX]

[DOI]

CoRR, 2023

Contact graphs of boxes with unidirectional contacts.

[BibT_eX]

[DOI]

Vincent Limouzy

CoRR, 2023

2022

Complexity of some arc-partition problems for digraphs.

[BibT_eX]

[DOI]

Jørgen Bang-Jensen

Stéphane Bessy

Lucas Picasarri-Arrieta

Theor. Comput. Sci., 2022

On Comparable Box Dimension.

[BibT_eX]

[DOI]

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

2021

Every Collinear Set in a Planar Graph is Free.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2021

2020

Not all planar graphs are in PURE-4-DIR.

[BibT_eX]

[DOI]

J. Graph Algorithms Appl., 2020

Dushnik-Miller dimension of TD-Delaunay complexes.

[BibT_eX]

[DOI]

Lucas Isenmann

Eur. J. Comb., 2020

Acyclic coloring of graphs and entropy compression method.

[BibT_eX]

[DOI]

Mickaël Montassier

Discret. Math., 2020

On independent set in B1-EPG graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2020

2019

On the structure of Schnyder woods on orientable surfaces.

[BibT_eX]

[DOI]

Kolja Knauer

J. Comput. Geom., 2019

Homothetic triangle representations of planar graphs.

[BibT_eX]

[DOI]

CoRR, 2019

3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes.

[BibT_eX]

[DOI]

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

2018

On triangles in -minor free graphs.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

The k-strong induced arboricity of a graph.

[BibT_eX]

[DOI]

Eur. J. Comb., 2018

Dushnik-Miller dimension of d-dimensional tilings with boxes.

[BibT_eX]

[DOI]

CoRR, 2018

Planar Graphs as L-intersection or L-contact graphs.

[BibT_eX]

[DOI]

Lucas Isenmann

Claire Pennarun

Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, 2018

Study of Schnyder Woods and Intersection Graphs. (Étude des Bois de Schnyder et des Graphes d'Intersections).

[BibT_eX]

[DOI]

, 2018

2017

A polynomial-time algorithm for Outerplanar Diameter Improvement.

[BibT_eX]

[DOI]

Dimitrios M. Thilikos

Mathias Weller

J. Comput. Syst. Sci., 2017

Dushnik-Miller dimension of contact systems of d-dimensional boxes.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2017

Encoding Toroidal Triangulations.

[BibT_eX]

[DOI]

Vincent Despré

Discret. Comput. Geom., 2017

2016

Orienting Triangulations.

[BibT_eX]

[DOI]

Kolja Knauer

J. Graph Theory, 2016

Detecting minors in matroids through triangles.

[BibT_eX]

[DOI]

Jorge L. Ramírez Alfonsín

Eur. J. Comb., 2016

Coloring Non-Crossing Strings.

[BibT_eX]

[DOI]

Louis Esperet

Arnaud Labourel

Electron. J. Comb., 2016

2015

Two-floor buildings need eight colors.

[BibT_eX]

[DOI]

Stéphane Bessy

Jean-Sébastien Sereni

J. Graph Algorithms Appl., 2015

Structure of Schnyder labelings on orientable surfaces.

[BibT_eX]

[DOI]

Kolja B. Knauer

CoRR, 2015

The Maximum Clique Problem in Multiple Interval Graphs.

[BibT_eX]

[DOI]

Algorithmica, 2015

On Independent Set on B1-EPG Graphs.

[BibT_eX]

[DOI]

Proceedings of the Approximation and Online Algorithms - 13th International Workshop, 2015

2014

Parameterized Domination in Circle Graphs.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2014

Entropy compression method applied to graph colorings.

[BibT_eX]

[DOI]

Mickaël Montassier

CoRR, 2014

2013

On exact algorithms for the permutation CSP.

[BibT_eX]

[DOI]

Eun Jung Kim

Theor. Comput. Sci., 2013

Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties.

[BibT_eX]

[DOI]

Jørgen Bang-Jensen

Anders Yeo

Theor. Comput. Sci., 2013

Too many triangles.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2013

Locally identifying coloring in bounded expansion classes of graphs.

[BibT_eX]

[DOI]

Aline Parreau

Discret. Appl. Math., 2013

2012

Triangle Contact Representations and Duality.

[BibT_eX]

[DOI]

Discret. Comput. Geom., 2012

On spanning galaxies in digraphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2012

The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract).

[BibT_eX]

[DOI]

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

2011

The Domination Number of Grids.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2011

On vertex partitions and some minor-monotone graph parameters.

[BibT_eX]

[DOI]

J. Graph Theory, 2011

2010

Diamond-free circle graphs are Helly circle.

[BibT_eX]

[DOI]

Jean Daligault

Michaël Rao

Discret. Math., 2010

Planar Graphs Have 1-string Representations.

[BibT_eX]

[DOI]

Jérémie Chalopin

Discret. Comput. Geom., 2010

2009

Covering planar graphs with forests, one having bounded maximum degree.

[BibT_eX]

[DOI]

J. Comb. Theory B, 2009

Coloring a set of touching strings.

[BibT_eX]

[DOI]

Louis Esperet

Arnaud Labourel

Electron. Notes Discret. Math., 2009

A planar linear hypergraph whose edges cannot be represented as straight line segments.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

On star and caterpillar arboricity.

[BibT_eX]

[DOI]

Discret. Math., 2009

Every planar graph is the intersection graph of segments in the plane: extended abstract.

[BibT_eX]

[DOI]

Jérémie Chalopin

Proceedings of the 41st Annual ACM Symposium on Theory of Computing, 2009

2008

On the L(p, 1)-labelling of graphs.

[BibT_eX]

[DOI]

Discret. Math., 2008

2007

On Vertex Partitions and the Colin de Verdière Parameter.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2007

Caterpillar arboricity of planar graphs.

[BibT_eX]

[DOI]

Discret. Math., 2007

Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs.

[BibT_eX]

[DOI]

Jørgen Bang-Jensen

Inge Li Gørtz

Discret. Optim., 2007

Planar graphs are in 1-STRING.

[BibT_eX]

[DOI]

Jérémie Chalopin

Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

On Oriented Labelling Parameters.

[BibT_eX]

[DOI]

André Raspaud

M. A. Shalu

Proceedings of the Formal Models, 2007

2005

On some arboricities in planar graphs.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2005

Acyclic Choosability of Graphs with Small Maximum Degree.

[BibT_eX]

[DOI]

Mickaël Montassier

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

Edge partition of planar sraphs into two outerplanar graphs.

[BibT_eX]

[DOI]