◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Daniël Paulusma

3 papers here

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

author position
  • middle author1
  • last author2

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

fields
  • cs.CC2
  • cs.DM1
ORCID 0000-0001-5945-9287

identity via Semantic Scholar / OpenAlex

activity
20112025
most citedThe Computational Complexity of Disconnected Cut and 2K2-Partition

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

collaborators
Showing 2011Show all

1 paper · 1 filter

cs.CC2011★ 16 cited

The Computational Complexity of Disconnected Cut and 2K2-Partition

Barnaby Martin, Daniel Paulusma

For a connected graph G=(V,E), a subset U of V is called a disconnected cut if U disconnects the graph and the subgraph induced by U is disconnected as well. We show that the probl…

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