default search action

combined dblp search
author search
venue search
publication search

ask others

"The Complexity of Perfect Matching Problems on Dense Hypergraphs."

Marek Karpinski, Andrzej Rucinski, Edyta Szymanska (2009)

> Home

Details and statistics

DOI: 10.1007/978-3-642-10631-6_64

access: closed

type: Conference or Workshop Paper

metadata version: 2021-09-23

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/isaac/KarpinskiRS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/isaac/KarpinskiRS09
Marek Karpinski, Andrzej Rucinski, Edyta Szymanska:
The Complexity of Perfect Matching Problems on Dense Hypergraphs. ISAAC 2009: 626-636

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.