◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Konrad Majewski

9 papers hereh-index 548 citations10 works total

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

author position
  • first author4
  • middle author3
  • last author1

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

fields
  • cs.DS7
  • cs.DM1
  • math.CO1

identity via Semantic Scholar / OpenAlex

activity
20202026
most citedTreedepth vs circumference

4 citations · 5 across the 6 of their papers we have counts for

collaborators
Showing 2022Show all

2 papers · 1 filter

math.CO2022★ 4 cited

Treedepth vs circumference

Marcin Briański, Gwenaël Joret, Konrad Majewski +3

The circumference of a graph G is the length of a longest cycle in G, or +∞ if G has no cycle. Birmelé (2003) showed that the treewidth of a graph G is at most its c…

cs.DS2022★ 1 cited

Max Weight Independent Set in graphs with no long claws: An analog of the Gyárfás' path argument

Konrad Majewski, Tomáš Masařík, Jana Novotná +4

We revisit recent developments for the Maximum Weight Independent Set problem in graphs excluding a subdivided claw St,t,t​ as an induced subgraph [Chudnovsky, Pilipczuk, Pilip…

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