Daniel Goncalves

Documents

Publications

	Partitioning into degenerate graphs in linear time Timothée Corsini , Quentin Deschamps , Carl Feghali , Daniel Gonçalves , Hélène Langlois European Journal of Combinatorics, 2023, 114, pp.103771. ⟨10.1016/j.ejc.2023.103771⟩ Article dans une revue lirmm-03872198v1
	Complexity of some arc-partition problems for digraphs Jørgen Bang-Jensen , Stéphane Bessy , Daniel Gonçalves , Lucas Picasarri-Arrieta Theoretical Computer Science, 2022, 928, pp.167-182. ⟨10.1016/j.tcs.2022.06.023⟩ Article dans une revue hal-03699980v1
	Every Collinear Set in a Planar Graph is Free Vida Dujmović , Fabrizio Frati , Daniel Gonçalves , Pat Morin , Günter Rote Discrete and Computational Geometry, 2021, 65 (4), pp.999-1027. ⟨10.1007/s00454-019-00167-x⟩ Article dans une revue lirmm-03003445v1
	Not all planar graphs are in PURE-4-DIR Daniel Gonçalves Journal of Graph Algorithms and Applications, 2020, 24 (3), pp.293-301. ⟨10.7155/jgaa.00533⟩ Article dans une revue lirmm-03003499v1
	Dushnik–Miller dimension of TD-Delaunay complexes Daniel Gonçalves , Lucas Isenmann European Journal of Combinatorics, 2020, 88, pp.#103110. ⟨10.1016/j.ejc.2020.103110⟩ Article dans une revue lirmm-02900923v1
	On independent set in B1-EPG graphs Stéphane Bessy , Marin Bougeret , Steven Chaplick , Daniel Gonçalves , Christophe Paul Discrete Applied Mathematics, 2020, 278, pp.62-72. ⟨10.1016/j.dam.2019.10.019⟩ Article dans une revue lirmm-03027587v1
	Acyclic coloring of graphs and entropy compression method Daniel Gonçalves , Mickaël Montassier , Alexandre Pinlou Discrete Mathematics, 2020, 343 (4), pp.#111772. ⟨10.1016/j.disc.2019.111772⟩ Article dans une revue lirmm-02938618v1
	Homothetic triangle representations of planar graphs Daniel Gonçalves , Benjamin Lévêque , Alexandre Pinlou Journal of Graph Algorithms and Applications, 2019, 23 (4), pp.745-753. ⟨10.7155/jgaa.00509⟩ Article dans une revue lirmm-02407930v1
	On the structure of Schnyder woods on orientable surfaces Daniel Gonçalves , Kolja Knauer , Benjamin Lévêque Journal of Computational Geometry, 2019, 10 (1), pp.127-164. ⟨10.20382/jocg.v10i1a5⟩ Article dans une revue lirmm-02407874v1
	The $k$-strong induced arboricity of a graph Maria Axenovich , Daniel Gonçalves , Jonathan Rollin , Torsten Ueckerdt European Journal of Combinatorics, 2018, 67, pp.1-20. ⟨10.1016/j.ejc.2017.05.010⟩ Article dans une revue lirmm-01888032v1
	On triangles in $Kr$-minor free graphs Boris Albar , Daniel Gonçalves Journal of Graph Theory, 2018, 88 (1), pp.154-173. ⟨10.1002/jgt.22203⟩ Article dans une revue lirmm-01888027v1
	Encoding toroidal triangulations Vincent Despré , Daniel Gonçalves , Benjamin Lévêque Discrete and Computational Geometry, 2017, 57 (3), pp.507-544. ⟨10.1007/s00454-016-9832-0⟩ Article dans une revue hal-01488931v1
	A polynomial-time algorithm for Outerplanar Diameter Improvement Nathann Cohen , Daniel Gonçalves , Eun Jung Kim , Christophe Paul , Ignasi Sau Journal of Computer and System Sciences, 2017, 89, pp.315 - 327. ⟨10.1016/j.jcss.2017.05.016⟩ Article dans une revue hal-01592242v1
	Dushnik-Miller dimension of contact systems of d -dimensional boxes Mathew D. Francis , Daniel Gonçalves Electronic Notes in Discrete Mathematics, 2017, 61, pp.467-473. ⟨10.1016/j.endm.2017.06.075⟩ Article dans une revue lirmm-01693192v1
	Coloring non-crossing strings Louis Esperet , Daniel Gonçalves , Arnaud Labourel The Electronic Journal of Combinatorics, 2016, 23 (4), pp.4.4. ⟨10.37236/5710⟩ Article dans une revue hal-01480244v1
	Detecting minors in matroids through triangles Boris Albar , Daniel Gonçalves , Jorge Luis Ramírez Alfonsín European Journal of Combinatorics, 2016, 53, pp.50-58. ⟨10.1016/j.ejc.2015.10.010⟩ Article dans une revue lirmm-01263827v1
	Orienting Triangulations Boris Albar , Daniel Gonçalves , Kolja Knauer Journal of Graph Theory, 2016, 83 (4), pp.392-405. ⟨10.1002/jgt.22005⟩ Article dans une revue hal-01457782v1
	Two floor building needing eight colors Stéphane Bessy , Daniel Gonçalves , Jean-Sébastien Sereni Journal of Graph Algorithms and Applications, 2015, 19 (1), pp.1--9. ⟨10.7155/jgaa.00344⟩ Article dans une revue hal-00996709v2
	The Maximum Clique Problem in Multiple Interval Graphs Mathew C. Francis , Daniel Gonçalves , Pascal Ochem Algorithmica, 2015, 71 (4), pp.812-836. ⟨10.1007/s00453-013-9828-6⟩ Article dans une revue lirmm-01263898v1
	Parameterized domination in circle graphs Christophe Paul , Nicolas Bousquet , Daniel Gonçalves , George Mertzios , Ignasi Sau Theory of Computing Systems, 2014, 54 (1), pp.45-72. ⟨10.1007/s00224-013-9478-8⟩ Article dans une revue hal-01178188v1
	Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations Daniel Gonçalves , Benjamin Lévêque Discrete and Computational Geometry, 2014, 51 (1), pp.67-131. ⟨10.1007/s00454-013-9552-7⟩ Article dans une revue lirmm-01263819v1
	Partitioning the arcs of a digraph into a star forests of the underlying graph with prescribed orientation properties Jørgen Bang-Jensen , Daniel Gonçalves , Anders Yeo Theoretical Computer Science, 2013, 475, pp.13-20. ⟨10.1016/j.tcs.2012.12.007⟩ Article dans une revue lirmm-00807975v1
	Locally identifying coloring in bounded expansion classes of graphs Daniel Gonçalves , Aline Parreau , Alexandre Pinlou Discrete Applied Mathematics, 2013, 161 (18), pp.2946-2951. ⟨10.1016/j.dam.2013.07.003⟩ Article dans une revue hal-00768472v2
	On exact algorithms for the permutation CSP Eun Jung Kim , Daniel Gonçalves Theoretical Computer Science, 2013, 511, pp.109-116. ⟨10.1016/j.tcs.2012.10.035⟩ Article dans une revue lirmm-01263918v1
	On Spanning Galaxies in Digraphs Daniel Gonçalves , Frédéric Havet , Alexandre Pinlou , Stéphan Thomassé Discrete Applied Mathematics, 2012, 160 (6), pp.744-754. ⟨10.1016/j.dam.2011.07.013⟩ Article dans une revue hal-00749191v1
	Triangle Contact Representations and Duality Daniel Gonçalves , Benjamin Lévêque , Alexandre Pinlou Discrete and Computational Geometry, 2012, 48 (1), pp.239-254. ⟨10.1007/s00454-012-9400-1⟩ Article dans une revue lirmm-00715024v1
	The Domination Number of Grids Daniel Gonçalves , Alexandre Pinlou , Michaël Rao , Stéphan Thomassé SIAM Journal on Discrete Mathematics, 2011, 25, pp.1443-1453. ⟨10.1137/11082574⟩ Article dans une revue lirmm-00569256v1
	Diamond-Free Circle Graphs are Helly Circle Jean Daligault , Daniel Gonçalves , Michaël Rao Discrete Mathematics, 2010, 310 (4), pp.845-849. ⟨10.1016/j.disc.2009.09.022⟩ Article dans une revue lirmm-00432897v1
	Planar Graphs Have 1-string Representations Jérémie Chalopin , Daniel Gonçalves , Pascal Ochem Discrete and Computational Geometry, 2010, 43 ((3)), pp.626-647. ⟨10.1007/s00454-009-9196-9⟩ Article dans une revue lirmm-00433091v1
	On Vertex Partitions and some Minor-Monotone Parameters Daniel Gonçalves Journal of Graph Theory, 2010, 66 (1), pp.49-56. ⟨10.1002/jgt.20490⟩ Article dans une revue lirmm-00808034v1
	Covering Planar Graphs with Forests, one Having Bounded Maximum Degree Daniel Gonçalves Journal of Combinatorial Theory, Series B, 2009, 99 (2), pp.314-322. ⟨10.1016/j.jctb.2008.07.004⟩ Article dans une revue lirmm-00338319v1
	On Star and Caterpillar Arboricity Daniel Gonçalves , Pascal Ochem Discrete Mathematics, 2009, 309 (11), pp.3694-3702. ⟨10.1016/j.disc.2008.01.041⟩ Article dans une revue lirmm-00338327v1
	A Planar Linear Hypergraph Whose Edges Cannot be Represented as Straight Line Segments Daniel Gonçalves European Journal of Combinatorics, 2009, 30 (1), pp.280-282. ⟨10.1016/j.ejc.2007.12.004⟩ Article dans une revue lirmm-00338324v1
	On the L(p,1)-labelling of graphs Daniel Gonçalves Discrete Mathematics, 2008, 308 (8), pp.1405-1414. ⟨10.1016/j.disc.2007.07.075⟩ Article dans une revue lirmm-00250126v1
	Caterpillar arboricity of planar graphs Daniel Gonçalves Discrete Mathematics, 2007, 307 (16), pp.2112-2121. ⟨10.1016/j.disc.2005.12.055⟩ Article dans une revue lirmm-00250121v1
	Finding Well-Balanced Pairs of Edge-Disjoint Trees in Edge-Weighted Graphs Jørgen Bang-Jensen , Daniel Gonçalves , Inge Li Gørtz Discrete Optimization, 2007, 4 (3-4), pp.334-348. ⟨10.1016/j.disopt.2007.09.003⟩ Article dans une revue lirmm-00250124v1

	Nonrepetitive colorings of $R^d$ Kathleen Barsse , Daniel Gonçalves , Matthieu Rosenfeld Eurocom 2023 - 12th European Conference on Combinatorics, Graph Theory and Applications, Aug 2023, Prague, Czech Republic. pp.114-119, ⟨10.5817/CZ.MUNI.EUROCOMB23-016⟩ Communication dans un congrès lirmm-04308803v1
	On Comparable Box Dimension Zdeněk Dvořák , Daniel Gonçalves , Abhiruk Lahiri , Jane Tan , Torsten Ueckerdt SoCG 2022 - 38th International Symposium on Computational Geometry, Jun 2022, Berlin, Germany. pp.38:1--38:14, ⟨10.4230/LIPIcs.SoCG.2022.38⟩ Communication dans un congrès lirmm-03872134v1
	Every Collinear Set in a Planar Graph Is Free Vida Dujmović , Fabrizio Frati , Daniel Gonçalves , Pat Morin , Günter Rote SODA 2019 - 30th Annual ACM-SIAM Symposium on Discrete Algorithms, Jan 2019, San Diego, CA, United States. pp.1521-1538, ⟨10.1137/1.9781611975482.92⟩ Communication dans un congrès lirmm-02046476v1
	3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes Daniel Gonçalves WG 2019 - 45th International Workshop on Graph-Theoretic Concepts in Computer Science, Jun 2019, Vall de Núria, Spain. pp.351-363, ⟨10.1007/978-3-030-30786-8_27⟩ Communication dans un congrès lirmm-02407838v1
	Planar Graphs as L-intersection or L-contact graphs Daniel Gonçalves , Lucas Isenmann , Claire Pennarun SODA: Symposium on Discrete Algorithms, Jan 2018, New Orleans, United States. pp.172-184, ⟨10.1137/1.9781611975031.12⟩ Communication dans un congrès lirmm-01738150v1
	Dushnik-Miller dimension of TD-Delaunay complexes Daniel Gonçalves , Lucas Isenmann EuroCG: European Workshop on Computational Geometry, Apr 2017, Malmo, Sweden Communication dans un congrès lirmm-01888045v1
	Orienting triangulations Boris Albar , Daniel Gonçalves , Kolja Knauer EuroCG: European Workshop on Computational Geometry, Mar 2015, Ljubljana, Slovenia Communication dans un congrès lirmm-01264309v1
	A Polynomial-Time Algorithm for Outerplanar Diameter Improvement Nathann Cohen , Daniel Gonçalves , Eun Jung Kim , Christophe Paul , Ignasi Sau CSR: Computer Science in Russia, Jul 2015, Listvyanka, Russia. pp.123-142, ⟨10.1007/978-3-319-20297-6_9⟩ Communication dans un congrès hal-01178222v1
	On Independent Set on B1-EPG Graphs Marin Bougeret , Stéphane Bessy , Daniel Gonçalves , Christophe Paul WAOA 2015 - 13th International Workshop on Approximation and Online Algorithms, Sep 2015, Patras, Greece. pp.158-169, ⟨10.1007/978-3-319-28684-6_14⟩ Communication dans un congrès lirmm-01264022v1
	Detecting minors in matroids throughout triangles Boris Albar , Daniel Gonçalves , Jorge Luis Ramírez Alfonsín ICGT: International Colloquium on Graph Theory and combinatorics, Jun 2014, Grenoble, France Communication dans un congrès lirmm-01264288v1
	Entropy compression method applied to graph colorings Daniel Gonçalves , Mickaël Montassier , Alexandre Pinlou ICGT: International Colloquium on Graph Theory and Combinatorics, Jun 2014, Grenoble, France Communication dans un congrès lirmm-01233456v1
	Too many triangles Boris Albar , Daniel Gonçalves LAGOS: Latin-American Algorithms, Graphs, and Optimization Symposium, Apr 2013, Playa del Carmen, Mexico. pp.293-297, ⟨10.1016/j.endm.2013.10.046⟩ Communication dans un congrès lirmm-01263909v1
	The Maximum Clique Problem in Multiple Interval Graphs Mathew C. Francis , Daniel Gonçalves , Pascal Ochem WG 2012 - 38th International Workshop on Graph Theoretic-Concepts in Computer Science, Jun 2012, Jerusalem, Israel. pp.57-68 Communication dans un congrès lirmm-00738525v1
	On Exact Algorithms for Permutation CSP Daniel Gonçalves , Eunjung Kim APEX: Approximation, Parameterized and EXact Algorithms, Feb 2012, Paris, France Communication dans un congrès lirmm-00738536v1
	Modèles d'Intersections Géométriques pour les Graphes Planaires Daniel Gonçalves JGA'10: Journées Graphes et Algorithmes, France Communication dans un congrès lirmm-00738561v1
	Parameterized domination in circle graphs Nicolas Bousquet , Daniel Gonçalves , George B. Mertzios , Christophe Paul , Ignasi Sau WG 2012 - 38th International Workshop on Graph Theoretic-Concepts in Computer Science, Jun 2012, Jerusalem, Israel. pp.45-72, ⟨10.1007/s00224-013-9478-8⟩ Communication dans un congrès lirmm-00738534v1
	Planar Graphs as Intersection Graphs Daniel Gonçalves LAGOS: Latin-American Algorithms, Graphs and Optimization Symposium, Mar 2011, Bariloche, Argentina Communication dans un congrès lirmm-00808045v1
	Triangle Contact Representations and Duality Daniel Gonçalves , Benjamin Lévêque , Alexandre Pinlou 18th International Symposium on Graph Drawing (GD), Sep 2010, Konstanz, Germany. pp.262-273, ⟨10.1007/978-3-642-18469-7_24⟩ Communication dans un congrès lirmm-00620728v1
	Spanning galaxies in digraphs Daniel Gonçalves , Frédéric Havet , Alexandre Pinlou , Stéphan Thomassé EuroComb: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.139-143, ⟨10.1016/j.endm.2009.07.023⟩ Communication dans un congrès lirmm-00433050v1
	Every Planar Graph is the Intersection Graph of Segments in the Plane: Extended Abstract Jérémie Chalopin , Daniel Gonçalves STOC '09: 41st ACM Symposium on Theory of Computing, May 2009, France. pp.631-638 Communication dans un congrès lirmm-00395364v1
	Coloring a set of touching strings Louis Esperet , Daniel Gonçalves , Arnaud Labourel EuroComb'09: European Conference on Combinatorics, Graph Theory and Applications, Sep 2009, Bordeaux, France. pp.213-217 Communication dans un congrès lirmm-00433096v1
	Planar graphs are in 1-string Jérémie Chalopin , Daniel Gonçalves , Pascal Ochem SODA 2007, 2007, United States. pp.609--617 Communication dans un congrès hal-00308130v1
	Acyclic choosability of graphs with small maximum degree Daniel Gonçalves , Mickael Montassier WG 2005, 2005, France. pp.239--248 Communication dans un congrès hal-00307782v1
	On the $L(p,1)$-labelling of graphs Daniel Gonçalves 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.81-86, ⟨10.46298/dmtcs.3438⟩ Communication dans un congrès hal-01184395v1
	Edge Partition of Planar Graphs into Two Outerplanar Graphs Daniel Gonçalves Proceedings of STOC '05, 2005, United States. pp.504 - 512 Communication dans un congrès hal-00307781v1

	On oriented labelling parameters Daniel Gonçalves , André Raspaud , M.A. Shalu Formal Models, Languages and Applications, 66, pp.33-45, 2006, 978-981-277-303-6. ⟨10.1142/9789812773036_0003⟩ Chapitre d'ouvrage hal-00353655v1

	Subexponential parameterized algorithms for cycle-hitting problems in contact and intersection graphs of segments Gaétan Berthe , Marin Bougeret , Daniel Gonçalves , Jean-Florent Raymond 2023 Pré-publication, Document de travail hal-04149792v1
	Contact graphs of boxes with unidirectional contacts Daniel Gonçalves , Vincent Limouzy , Pascal Ochem 2023 Pré-publication, Document de travail hal-04216379v1
	Avoiding large squares in trees and planar graphs Daniel Gonçalves , Pascal Ochem , Matthieu Rosenfeld 2021 Pré-publication, Document de travail lirmm-03452602v1
	Planar graphs as L-intersection or L-contact graphs Daniel Gonçalves , Lucas Isenmann , Claire Pennarun 2017 Pré-publication, Document de travail hal-01569535v2

	Study of Schnyder Woods and Intersection Graphs Daniel Gonçalves Discrete Mathematics [cs.DM]. Université de Montpellier, 2018 HDR tel-02078613v1

Daniel Goncalves

Publications

Partitioning into degenerate graphs in linear time

Complexity of some arc-partition problems for digraphs

Every Collinear Set in a Planar Graph is Free

Not all planar graphs are in PURE-4-DIR

Dushnik–Miller dimension of TD-Delaunay complexes

On independent set in B1-EPG graphs

Acyclic coloring of graphs and entropy compression method

Homothetic triangle representations of planar graphs

On the structure of Schnyder woods on orientable surfaces

The $k$-strong induced arboricity of a graph

On triangles in $Kr$-minor free graphs

Encoding toroidal triangulations

A polynomial-time algorithm for Outerplanar Diameter Improvement

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

Coloring non-crossing strings

Detecting minors in matroids through triangles

Orienting Triangulations

Two floor building needing eight colors

The Maximum Clique Problem in Multiple Interval Graphs

Parameterized domination in circle graphs

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

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

Locally identifying coloring in bounded expansion classes of graphs

On exact algorithms for the permutation CSP

On Spanning Galaxies in Digraphs

Triangle Contact Representations and Duality

The Domination Number of Grids

Diamond-Free Circle Graphs are Helly Circle

Planar Graphs Have 1-string Representations

On Vertex Partitions and some Minor-Monotone Parameters

Covering Planar Graphs with Forests, one Having Bounded Maximum Degree

On Star and Caterpillar Arboricity

A Planar Linear Hypergraph Whose Edges Cannot be Represented as Straight Line Segments

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

Caterpillar arboricity of planar graphs

Finding Well-Balanced Pairs of Edge-Disjoint Trees in Edge-Weighted Graphs

Nonrepetitive colorings of $R^d$

On Comparable Box Dimension

Every Collinear Set in a Planar Graph Is Free

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

Planar Graphs as L-intersection or L-contact graphs

Dushnik-Miller dimension of TD-Delaunay complexes

Orienting triangulations

A Polynomial-Time Algorithm for Outerplanar Diameter Improvement

On Independent Set on B1-EPG Graphs

Detecting minors in matroids throughout triangles

Entropy compression method applied to graph colorings

Too many triangles

The Maximum Clique Problem in Multiple Interval Graphs

On Exact Algorithms for Permutation CSP

Modèles d'Intersections Géométriques pour les Graphes Planaires

Parameterized domination in circle graphs

Planar Graphs as Intersection Graphs

Triangle Contact Representations and Duality

Spanning galaxies in digraphs

Every Planar Graph is the Intersection Graph of Segments in the Plane: Extended Abstract

Coloring a set of touching strings

Planar graphs are in 1-string

Acyclic choosability of graphs with small maximum degree

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

Edge Partition of Planar Graphs into Two Outerplanar Graphs

On oriented labelling parameters

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

Contact graphs of boxes with unidirectional contacts

Avoiding large squares in trees and planar graphs

Planar graphs as L-intersection or L-contact graphs

Study of Schnyder Woods and Intersection Graphs