◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Seongbeom Park

2 papers hereh-index 00 citations4 works total

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

author position
  • sole author2

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

fields
  • cs.DM2
same name
  • Seongbeom Park — 1 paper
  • Seongbeom Park — 1 paper, h 18

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

collaborators
Showing cs.DMShow all

2 papers · 1 filter

cs.DM2025

Reducing Profile-Based Matching to the Maximum Weight Matching Problem

Seongbeom Park

The profile-based matching problem is the problem of finding a matching that optimizes profile from an instance (G,r,⟨u1​,…,ur​⟩), where G is a bipartite…

cs.DM2024

Stable Marriage with One-Sided Preference

Seongbeom Park

Many countries around the world, including Korea, use the school choice lottery system. However, this method has a problem in that many students are assigned to less-preferred scho…

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