◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

G. Bacsó

3 papers hereh-index 11513 citations46 works total

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

author position
  • first author3

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

fields
  • cs.DM1
  • cs.DS1
  • math.CO1

identity via Semantic Scholar / OpenAlex

activity
20132023
most citedSubexponential-time Algorithms for Maximum Independent Set in Pt​-free and Broom-free Graphs

2 citations · 2 across the 3 of their papers we have counts for

collaborators
Showing 2023Show all

1 paper · 1 filter

math.CO2023

The robust chromatic number of graphs

Gábor Bacsó, Balázs Patkós, Zsolt Tuza +1

A 1-removed subgraph Gf​ of a graph G=(V,E) is obtained by (i) selecting at most one edge f(v) for each vertex v∈V, such that v∈f(v)∈E (the mapping $f:V\to E \…

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