Daniel Gonçalves

88 papers A* 7A 1B 8Misc 1Journal 68Unranked 2
YearRankTypeTitle / Venue / Authors
2025 J jnl
Brooks-Type Colourings of Digraphs in Linear Time.
J. Graph Theory
Daniel Gonçalves, Lucas Picasarri-Arrieta, Amadeus Reinald
2025 J jnl
Plane Strong Connectivity Augmentation.
CoRR
Stéphane Bessy, Daniel Gonçalves, Amadeus Reinald, Dimitrios M. Thilikos
2025 A* conf
Pushing the Frontiers of Subexponential FPT Time for Feedback Vertex Set.
ICALP
Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond
2025 J jnl
Pushing the frontiers of subexponential FPT time for Feedback Vertex Set.
CoRR
Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond
2024 J jnl
Brooks-type colourings of digraphs in linear time.
CoRR
Daniel Gonçalves, Lucas Picasarri-Arrieta, Amadeus Reinald
2024 B conf
Feedback Vertex Set for Pseudo-disk Graphs in Subexponential FPT Time.
WG
Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond
2024 J jnl
Feedback Vertex Set for pseudo-disk graphs in subexponential FPT time.
CoRR
Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond
2024 B conf
Kick the Cliques.
IPEC
Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond
2024 J jnl
Kick the cliques.
CoRR
Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond
2024 B conf
Oriented Trees in $O(k \sqrt{k})$-Chromatic Digraphs, a Subquadratic Bound for Burr's Conjecture.
WG
Stéphane Bessy, Daniel Gonçalves, Amadeus Reinald
2024 J jnl
Oriented trees in O(k √k)-chromatic digraphs, a subquadratic bound for Burr's conjecture.
CoRR
Stéphane Bessy, Daniel Gonçalves, Amadeus Reinald
2024 — conf
Subexponential Algorithms in Geometric Graphs via the Subquadratic Grid Minor Property: The Role of Local Radius.
SWAT
Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond
2023 J jnl
Contact graphs of boxes with unidirectional contacts.
CoRR
Daniel Gonçalves, Vincent Limouzy, Pascal Ochem
2023 J jnl
Contact graphs of boxes with unidirectional contacts.
Discret. Math. Theor. Comput. Sci.
Daniel Gonçalves, Vincent Limouzy, Pascal Ochem
2023 J jnl
Subexponential parameterized algorithms for cycle-hitting problems in contact and intersection graphs of segments.
CoRR
Gaétan Berthe, Marin Bougeret, Daniel Gonçalves, Jean-Florent Raymond
2022 J jnl
Complexity of some arc-partition problems for digraphs.
Theor. Comput. Sci.
Jørgen Bang-Jensen, Stéphane Bessy, Daniel Gonçalves, Lucas Picasarri-Arrieta
2022 A* conf
On Comparable Box Dimension.
SoCG
Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt
2022 J jnl
On Comparable Box Dimension.
CoRR
Zdenek Dvorák, Daniel Gonçalves, Abhiruk Lahiri, Jane Tan, Torsten Ueckerdt
2021 J jnl
Every Collinear Set in a Planar Graph is Free.
Discret. Comput. Geom.
Vida Dujmovic, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote
2020 J jnl
Acyclic coloring of graphs and entropy compression method.
Discret. Math.
Daniel Gonçalves, Mickaël Montassier, Alexandre Pinlou
2020 J jnl
Dushnik-Miller dimension of TD-Delaunay complexes.
Eur. J. Comb.
Daniel Gonçalves, Lucas Isenmann
2020 J jnl
Not all planar graphs are in PURE-4-DIR.
J. Graph Algorithms Appl.
Daniel Gonçalves
2020 J jnl
On independent set in B1-EPG graphs.
Discret. Appl. Math.
Stéphane Bessy, Marin Bougeret, Steven Chaplick, Daniel Gonçalves, Christophe Paul
2019 B conf
3-Colorable Planar Graphs Have an Intersection Segment Representation Using 3 Slopes.
WG
Daniel Gonçalves
2019 A* conf
Every Collinear Set in a Planar Graph Is Free.
SODA
Vida Dujmovic, Fabrizio Frati, Daniel Gonçalves, Pat Morin, Günter Rote
2019 J jnl
Homothetic triangle representations of planar graphs.
CoRR
Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou
2019 J jnl
On the structure of Schnyder woods on orientable surfaces.
J. Comput. Geom.
Kolja Knauer, Daniel Gonçalves, Benjamin Lévêque
2018 J jnl
Dushnik-Miller dimension of TD-Delaunay complexes.
CoRR
Daniel Gonçalves, Lucas Isenmann
2018 J jnl
Dushnik-Miller dimension of d-dimensional tilings with boxes.
CoRR
Mathew C. Francis, Daniel Gonçalves
2018 J jnl
On triangles in -minor free graphs.
J. Graph Theory
Boris Albar, Daniel Gonçalves
2018 A* conf
Planar Graphs as L-intersection or L-contact graphs.
SODA
Daniel Gonçalves, Lucas Isenmann, Claire Pennarun
2018 — book
Study of Schnyder Woods and Intersection Graphs. (Étude des Bois de Schnyder et des Graphes d'Intersections).
Daniel Gonçalves
2018 J jnl
The k-strong induced arboricity of a graph.
Eur. J. Comb.
Maria Axenovich, Daniel Gonçalves, Jonathan Rollin, Torsten Ueckerdt
2017 J jnl
A polynomial-time algorithm for Outerplanar Diameter Improvement.
J. Comput. Syst. Sci.
Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
2017 J jnl
Dushnik-Miller dimension of contact systems of d-dimensional boxes.
Electron. Notes Discret. Math.
Mathew C. Francis, Daniel Gonçalves
2017 J jnl
Encoding Toroidal Triangulations.
Discret. Comput. Geom.
Vincent Despré, Daniel Gonçalves, Benjamin Lévêque
2017 J jnl
Planar graphs as L-intersection or L-contact graphs.
CoRR
Daniel Gonçalves, Lucas Isenmann, Claire Pennarun
2016 J jnl
Coloring Non-Crossing Strings.
Electron. J. Comb.
Louis Esperet, Daniel Gonçalves, Arnaud Labourel
2016 J jnl
Detecting minors in matroids through triangles.
Eur. J. Comb.
Boris Albar, Daniel Gonçalves, Jorge L. Ramírez Alfonsín
2016 J jnl
Orienting Triangulations.
J. Graph Theory
Boris Albar, Daniel Gonçalves, Kolja Knauer
2016 J jnl
The k-strong induced arboricity of a graph.
CoRR
Maria Axenovich, Daniel Gonçalves, Jonathan Rollin, Torsten Ueckerdt
2015 Misc conf
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement.
CSR
Nathann Cohen, Daniel Gonçalves, Eunjung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
2015 J jnl
Coloring non-crossing strings.
CoRR
Louis Esperet, Daniel Gonçalves, Arnaud Labourel
2015 J jnl
Encoding toroidal triangulations.
CoRR
Vincent Despré, Daniel Gonçalves, Benjamin Lévêque
2015 B conf
On Independent Set on B1-EPG Graphs.
WAOA
Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul
2015 J jnl
On independent set on B1-EPG graphs.
CoRR
Marin Bougeret, Stéphane Bessy, Daniel Gonçalves, Christophe Paul
2015 J jnl
Structure of Schnyder labelings on orientable surfaces.
CoRR
Daniel Gonçalves, Kolja B. Knauer, Benjamin Lévêque
2015 J jnl
The Maximum Clique Problem in Multiple Interval Graphs.
Algorithmica
Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
2015 J jnl
Two-floor buildings need eight colors.
J. Graph Algorithms Appl.
Stéphane Bessy, Daniel Gonçalves, Jean-Sébastien Sereni
2014 J jnl
A Polynomial-time Algorithm for Outerplanar Diameter Improvement.
CoRR
Nathann Cohen, Daniel Gonçalves, Eun Jung Kim, Christophe Paul, Ignasi Sau, Dimitrios M. Thilikos, Mathias Weller
2014 J jnl
Entropy compression method applied to graph colorings.
CoRR
Daniel Gonçalves, Mickaël Montassier, Alexandre Pinlou
2014 J jnl
Parameterized Domination in Circle Graphs.
Theory Comput. Syst.
Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé
2014 J jnl
Toroidal Maps: Schnyder Woods, Orthogonal Surfaces and Straight-Line Representations.
Discret. Comput. Geom.
Daniel Gonçalves, Benjamin Lévêque
2013 J jnl
Locally identifying coloring in bounded expansion classes of graphs.
Discret. Appl. Math.
Daniel Gonçalves, Aline Parreau, Alexandre Pinlou
2013 J jnl
On exact algorithms for the permutation CSP.
Theor. Comput. Sci.
Eun Jung Kim, Daniel Gonçalves
2013 J jnl
Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties.
Theor. Comput. Sci.
Jørgen Bang-Jensen, Daniel Gonçalves, Anders Yeo
2013 J jnl
Too many triangles.
Electron. Notes Discret. Math.
Boris Albar, Daniel Gonçalves
2012 J jnl
Locally identifying coloring in bounded expansion classes of graphs
CoRR
Daniel Gonçalves, Aline Parreau, Alexandre Pinlou
2012 J jnl
On Exact Algorithms for Permutation CSP
CoRR
Eun Jung Kim, Daniel Gonçalves
2012 J jnl
On spanning galaxies in digraphs.
Discret. Appl. Math.
Daniel Gonçalves, Frédéric Havet, Alexandre Pinlou, Stéphan Thomassé
2012 J jnl
Parameterized Domination in Circle Graphs
CoRR
Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé
2012 B conf
Parameterized Domination in Circle Graphs.
WG
Nicolas Bousquet, Daniel Gonçalves, George B. Mertzios, Christophe Paul, Ignasi Sau, Stéphan Thomassé
2012 J jnl
The Maximum Clique Problem in Multiple Interval Graphs
CoRR
Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
2012 B conf
The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract).
WG
Mathew C. Francis, Daniel Gonçalves, Pascal Ochem
2012 J jnl
Toroidal maps : Schnyder woods, orthogonal surfaces and straight-line representations
CoRR
Daniel Gonçalves, Benjamin Lévêque
2012 J jnl
Triangle Contact Representations and Duality.
Discret. Comput. Geom.
Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou
2011 J jnl
On vertex partitions and some minor-monotone graph parameters.
J. Graph Theory
Daniel Gonçalves
2011 J jnl
The Domination Number of Grids
CoRR
Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé
2011 J jnl
The Domination Number of Grids.
SIAM J. Discret. Math.
Daniel Gonçalves, Alexandre Pinlou, Michaël Rao, Stéphan Thomassé
2010 J jnl
Diamond-free circle graphs are Helly circle.
Discret. Math.
Jean Daligault, Daniel Gonçalves, Michaël Rao
2010 J jnl
Planar Graphs Have 1-string Representations.
Discret. Comput. Geom.
Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem
2010 A conf
Triangle Contact Representations and Duality.
GD
Daniel Gonçalves, Benjamin Lévêque, Alexandre Pinlou
2009 J jnl
A planar linear hypergraph whose edges cannot be represented as straight line segments.
Eur. J. Comb.
Daniel Gonçalves
2009 J jnl
Coloring a set of touching strings.
Electron. Notes Discret. Math.
Louis Esperet, Daniel Gonçalves, Arnaud Labourel
2009 J jnl
Covering planar graphs with forests, one having bounded maximum degree.
J. Comb. Theory B
Daniel Gonçalves
2009 A* conf
Every planar graph is the intersection graph of segments in the plane: extended abstract.
STOC
Jérémie Chalopin, Daniel Gonçalves
2009 J jnl
On star and caterpillar arboricity.
Discret. Math.
Daniel Gonçalves, Pascal Ochem
2009 J jnl
Spanning galaxies in digraphs.
Electron. Notes Discret. Math.
Daniel Gonçalves, Alexandre Pinlou, Stéphan Thomassé, Frédéric Havet
2008 J jnl
Covering planar graphs with forests, one having a bounded maximum degree.
Electron. Notes Discret. Math.
Daniel Gonçalves
2008 J jnl
On the L(p, 1)-labelling of graphs.
Discret. Math.
Daniel Gonçalves
2007 J jnl
Caterpillar arboricity of planar graphs.
Discret. Math.
Daniel Gonçalves
2007 J jnl
Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs.
Discret. Optim.
Jørgen Bang-Jensen, Daniel Gonçalves, Inge Li Gørtz
2007 — conf
On Oriented Labelling Parameters.
Formal Models, Languages and Applications
Daniel Gonçalves, André Raspaud, M. A. Shalu
2007 J jnl
On Vertex Partitions and the Colin de Verdière Parameter.
Electron. Notes Discret. Math.
Daniel Gonçalves
2007 A* conf
Planar graphs are in 1-STRING.
SODA
Jérémie Chalopin, Daniel Gonçalves, Pascal Ochem
2005 B conf
Acyclic Choosability of Graphs with Small Maximum Degree.
WG
Daniel Gonçalves, Mickaël Montassier
2005 A* conf
Edge partition of planar sraphs into two outerplanar graphs.
STOC
Daniel Gonçalves
2005 J jnl
On some arboricities in planar graphs.
Electron. Notes Discret. Math.
Daniel Gonçalves, Pascal Ochem