◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

Gabe Schoenbach

5 papers hereh-index 364 citations8 works total

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

author position
  • middle author2
  • last author3

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

fields
  • cs.CR1
  • cs.CY1
  • cs.DM1
  • cs.DS1
  • physics.soc-ph1

identity via Semantic Scholar / OpenAlex

activity
20202026
most citedRedistricting for Proportionality

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

collaborators
Showing cs.DSShow all

1 paper · 1 filter

cs.DS2026

Optimal Hardness of Online Algorithms for Large Common Induced Subgraphs

David Gamarnik, Miklós Z. Rácz, Gabe Schoenbach

We study the problem of efficiently finding large common induced subgraphs of two independent Erdős--Rényi random graphs G1​,G2​∼G(n,1/2). Recently, Chatterjee and…

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