◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

B. O’Sullivan

2 papers here

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

author position
  • last author2

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

fields
  • cs.DS2

identity via Semantic Scholar / OpenAlex

most citedAlmost 2-SAT is Fixed-Parameter Tractable

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

collaborators

2 papers

cs.DS2008★ 4 cited

Almost 2-SAT is Fixed-Parameter Tractable

Igor Razgon, Barry O'Sullivan

We consider the following problem. Given a 2-CNF formula, is it possible to remove at most k clauses so that the resulting 2-CNF formula is satisfiable? This problem is known to…

cs.DS2007

Directed Feedback Vertex Set is Fixed-Parameter Tractable

Igor Razgon, Barry O'Sullivan

We resolve positively a long standing open question regarding the fixed-parameter tractability of the parameterized Directed Feedback Vertex Set problem. In particular, we propose…

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