Daniel Gonçalves

From MaRDI portal
Person:392030

Available identifiers

zbMath Open goncalves.daniel.1MaRDI QIDQ392030

List of research outcomes

PublicationDate of PublicationType
KK-duality for self-similar groupoid actions on graphs2023-02-08Paper
Complexity of some arc-partition problems for digraphs2022-10-07Paper
On Comparable Box Dimension2022-03-15Paper
Avoiding large squares in trees and planar graphs2021-06-02Paper
Every collinear set in a planar graph is free2021-04-29Paper
Not all planar graphs are in PURE-4-DIR2020-09-04Paper
Dushnik-Miller dimension of TD-Delaunay complexes2020-06-16Paper
On independent set in \(B_1\)-EPG graphs2020-04-21Paper
3-colorable planar graphs have an intersection segment representation using 3 slopes2020-02-24Paper
Acyclic coloring of graphs and entropy compression method2020-02-20Paper
Homothetic triangle representations of planar graphs2019-10-25Paper
Every collinear set in a planar graph is free2019-10-15Paper
On the structure of Schnyder woods on orientable surfaces2019-07-23Paper
On triangles in ‐minor free graphs2018-07-13Paper
https://portal.mardi4nfdi.de/entity/Q46078882018-03-15Paper
Dushnik-Miller dimension of contact systems of \(d\)-dimensional boxes2018-01-18Paper
The \(k\)-strong induced arboricity of a graph2017-10-10Paper
A polynomial-time algorithm for outerplanar diameter improvement2017-09-07Paper
Encoding toroidal triangulations2017-05-11Paper
Coloring non-crossing strings2016-12-06Paper
Orienting Triangulations2016-11-17Paper
On Independent Set on B1-EPG Graphs2016-02-26Paper
Detecting minors in matroids through triangles2015-12-23Paper
A Polynomial-Time Algorithm for Outerplanar Diameter Improvement2015-10-20Paper
The maximum clique problem in multiple interval graphs2015-06-25Paper
Every planar graph is the intersection graph of segments in the plane2015-02-04Paper
Two-floor buildings need eight colors2015-01-27Paper
https://portal.mardi4nfdi.de/entity/Q29346442014-12-18Paper
Entropy compression method applied to graph colorings2014-06-17Paper
Locally identifying coloring in bounded expansion classes of graphs2014-04-23Paper
Parameterized domination in circle graphs2014-03-25Paper
Toroidal maps: Schnyder woods, orthogonal surfaces and straight-line representations2014-03-25Paper
On exact algorithms for the permutation CSP2014-01-13Paper
Spanning galaxies in digraphs2013-10-10Paper
Coloring a set of touching strings2013-10-10Paper
Partitioning the arcs of a digraph into a star forest of the underlying graph with prescribed orientation properties2013-03-04Paper
The Maximum Clique Problem in Multiple Interval Graphs (Extended Abstract)2012-11-06Paper
Parameterized Domination in Circle Graphs2012-11-06Paper
Triangle contact representations and duality2012-08-13Paper
On spanning galaxies in digraphs2012-05-11Paper
The Domination Number of Grids2012-03-15Paper
Triangle Contact Representations and Duality2011-02-11Paper
Edge partition of planar sraphs into two outerplanar graphs2010-08-16Paper
https://portal.mardi4nfdi.de/entity/Q35766652010-07-30Paper
Diamond-free circle graphs are Helly circle2010-04-27Paper
Planar graphs have 1-string representations2010-04-12Paper
On star and caterpillar arboricity2009-06-19Paper
Covering planar graphs with forests, one having bounded maximum degree2009-03-04Paper
A planar linear hypergraph whose edges cannot be represented as straight line segments2009-01-27Paper
Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs2008-05-14Paper
On the \(L(p,1)\)-labelling of graphs2008-03-18Paper
Caterpillar arboricity of planar graphs2007-06-26Paper
On some arboricities in planar graphs2007-05-29Paper
Graph-Theoretic Concepts in Computer Science2006-11-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Daniel Gonçalves