◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

K. Dabrowski

10 papers hereh-index 11342 citations26 works total

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

author position
  • first author7
  • middle author3

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

fields
  • cs.DM6
  • cs.DS3
  • math.CO1

identity via Semantic Scholar / OpenAlex

activity
20142017
most citedBounding the Clique-Width of H-free Chordal Graphs

6 citations · 13 across the 7 of their papers we have counts for

collaborators
Showing cs.DSShow all

3 papers · 1 filter

cs.DS2017

On the (parameterized) complexity of recognizing well-covered (r,l)-graphs

Sancrey R. Alves, Konrad K. Dabrowski, Luerbio Faria +3

An (r,ℓ)-partition of a graph G is a partition of its vertex set into r independent sets and ℓ cliques. A graph is (r,ℓ) if it admits an (r,ℓ)-partition.…

cs.DS2015

Editing to a Planar Graph of Given Degrees

Konrad K. Dabrowski, Petr A. Golovach, Pim van 't Hof +2

We consider the following graph modification problem. Let the input consist of a graph G=(V,E), a weight function w:V∪E→N, a cost function $c\colo…

cs.DS2015

Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs

Konrad K. Dabrowski, Francois Dross, Matthew Johnson +1

A colouring of a graph G=(V,E) is a function c:V→{1,2,…} such that c(u)=c(v) for every uv∈E. A k-regular list assignment of G is a function $L…

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