◍wovepaper
SearchResearchersInstitutions
Sign in
researcher

J. Lenchner

7 papers hereh-index 13682 citations63 works total

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

author position
  • sole author3
  • middle author3

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

fields
  • cs.AI3
  • cs.CC1
  • cs.DS1
  • math.CO1
  • math.LO1

identity via Semantic Scholar / OpenAlex

activity
20062022
most citedMinimum-Cost Coverage of Point Sets by Disks

27 citations · 33 across the 6 of their papers we have counts for

collaborators
Showing 2019Show all

2 papers · 1 filter

math.CO2019

On a Generalization of the Marriage Problem

Jonathan Lenchner

We present a generalization of the marriage problem underlying Hall's famous Marriage Theorem to what we call the Symmetric Marriage Problem, a problem that can be thought of as a…

cs.CC2019

From Hall's Marriage Theorem to Boolean Satisfiability and Back

Jonathan Lenchner

Motivated by the application of Hall's Marriage Theorem in various LP-rounding problems, we introduce a generalization of the classical marriage problem (CMP) that we call the Frac…

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