◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

V. Dujmović

64 papers hereh-index 302.5k citations135 works total

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

author position
  • sole author1
  • first author33
  • middle author28
  • last author1

Across the 63 of 64 papers where every author was matched, so the position is known.

fields
  • math.CO32
  • cs.CG22
  • cs.DM5
  • cs.DS3
  • math.PR1
  • math.ST1

identity via Semantic Scholar / OpenAlex

activity
20002024
most citedGraph Treewidth and Geometric Thickness Parameters

83 citations · 606 across the 54 of their papers we have counts for

collaborators
Showing 2012 · math.COShow all

3 papers · 2 filters

math.CO2012

Empty pentagons in point sets with collinearities

János Barát, Vida Dujmović, Gwenaël Joret +5

An empty pentagon in a point set P in the plane is a set of five points in P in strictly convex position with no other point of P in their convex hull. We prove that every finite s…

math.CO2012★ 18 cited

Nonrepetitive Colourings of Planar Graphs with O(logn) Colours

Vida Dujmović, Fabrizio Frati, Gwenaël Joret +1

A vertex colouring of a graph is \emph{nonrepetitive} if there is no path for which the first half of the path is assigned the same sequence of colours as the second half. The \emp…

math.CO2012★ 4 cited

A linear-time algorithm for finding a complete graph minor in a dense graph

Vida Dujmović, Daniel J. Harvey, Gwenaël Joret +2

Let g(t) be the minimum number such that every graph G with average degree d(G) \geq g(t) contains a K_{t}-minor. Such a function is known to exist, as originally shown by Mader. K…

◍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.