◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Konrad K. Dabrowski

Newcastle University

30 papers hereh-index 10372 citations52 works total

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

author position
  • first author21
  • middle author9

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

fields
  • cs.DS14
  • cs.DM7
  • math.CO6
  • cs.CC2
  • cs.AI1
affiliations
  • Newcastle University
Homepage

identity via Semantic Scholar / OpenAlex

activity
20132026
most citedClique-Width for Hereditary Graph Classes

25 citations · 34 across the 16 of their papers we have counts for

collaborators
Showing 2014Show all

1 paper · 1 filter

cs.DM2014

Combinatorics and algorithms for augmenting graphs

Konrad K. Dabrowski, Dominique de Werra, Vadim V. Lozin +1

The notion of augmenting graphs generalizes Berge's idea of augmenting chains, which was used by Edmonds in his celebrated solution of the maximum matching problem. This problem is…

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