Stop the war!

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

for scientists:

default search action

combined dblp search
author search
venue search
publication search

ask others

"Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are ..."

Karl Bringmann, Jasper Slusallek (2021)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ICALP.2021.40

access: open

type: Conference or Workshop Paper

metadata version: 2021-07-06

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/icalp/BringmannS21
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/BringmannS21
Karl Bringmann, Jasper Slusallek:
Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal. ICALP 2021: 40:1-40:16

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.