◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

T. Sone

4 papers hereh-index 29 citations7 works total

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

author position
  • middle author1
  • last author1

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

fields
  • cs.DS2
  • hep-ex2
same name
  • T. Sone — 4 papers, h 4
  • T. Sone — 4 papers, h 0
  • T. Sone — 2 papers, h 0
  • T. Sone — 1 paper
  • T. Sone — 1 paper, h 4

Either other researchers who publish under this name, or the same person where the external sources have not merged their records.

identity via Semantic Scholar / OpenAlex

activity
20192026
most citedA (probably) optimal algorithm for Bisection on bounded-treewidth graphs

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

collaborators
Showing 2019Show all

1 paper · 1 filter

cs.DS2019

Algorithms and Hardness Results for the Maximum Balanced Connected Subgraph Problem

Yasuaki Kobayashi, Kensuke Kojima, Norihide Matsubara +2

The Balanced Connected Subgraph problem (BCS) was recently introduced by Bhore et al. (CALDAM 2019). In this problem, we are given a graph G whose vertices are colored by red or…

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