◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

D. Gonçalves

26 papers hereh-index 15831 citations62 works total

Matching runs newest-first, so older work may not be attached to this profile yet.

author position
  • sole author2
  • first author8
  • middle author12
  • last author2

Across the 24 of 26 papers where every author was matched, so the position is known.

fields
  • cs.DM12
  • math.CO7
  • cs.DS3
  • math.RA2
  • cs.CC1
  • cs.CG1
same name
  • D. Gonçalves — 59 papers, h 22
  • D. Gonçalves — 46 papers, h 15
  • D. Gonçalves — 31 papers, h 15
  • D. Gonçalves — 7 papers, h 14
  • D. Gonçalves — 6 papers, h 6
  • D. Gonçalves — 6 papers, h 14

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20112025
most citedThe Domination Number of Grids

115 citations · 178 across the 20 of their papers we have counts for

collaborators
Showing 2014Show all

4 papers · 1 filter

math.CO2014

Detecting minors in matroids through triangles

Boris Albar, Daniel Gonçalves, Jorge L. Ramírez Alfonsín

In this note we investigate some matroid minor structure results. In particular, we present sufficient conditions, in terms of {\em triangles}, for a matroid to have either $U_{2,4…

math.CO2014★ 2 cited

Orienting triangulations

Boris Albar, Daniel Gonçalves, Kolja Knauer

We prove that any triangulation of a surface different from the sphere and the projective plane admits an orientation without sinks such that every vertex has outdegree divisible b…

cs.DM2014★ 37 cited

Entropy compression method applied to graph colorings

Daniel Gonçalves, Mickaël Montassier, Alexandre Pinlou

Based on the algorithmic proof of Lovász local lemma due to Moser and Tardos, the works of Grytczuk et al. on words, and Dujmović et al. on colorings, Esperet and Parreau developed…

cs.DS2014

A Polynomial-time Algorithm for Outerplanar Diameter Improvement

Nathann Cohen, Daniel Gonçalves, Eun Jung Kim +4

The Outerplanar Diameter Improvement problem asks, given a graph G and an integer D, whether it is possible to add edges to G in a way that the resulting graph is outerplanar…

◍wovepaper

Papers, researchers and institutions, woven together.

Explore
  • Search
  • Researchers
  • Institutions
Account
  • Library
  • Chat
Data
  • arXiv.org
  • Semantic Scholar
  • OpenAlex
  • Latest RSS
AboutContactPrivacyDevelopersllms.txtopenapi.json
Not affiliated with arXiv. Researcher data from Semantic Scholar (ODC-BY) and OpenAlex.