Stop the war!

Остановите войну!

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs."

Nathaniel Lahn, Sharath Raghvendra (2019)

> Home

Details and statistics

DOI: 10.1137/1.9781611975482.36

access: open

type: Conference or Workshop Paper

metadata version: 2023-09-30

- view
  - electronic edition via DOI (open access)
  - electronic edition @ acm.org
  authority control:
- export record
  dblp key:
  - conf/soda/LahnR19
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/LahnR19
Nathaniel Lahn, Sharath Raghvendra:
A Faster Algorithm for Minimum-Cost Bipartite Matching in Minor-Free Graphs. SODA 2019: 569-588

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.