"Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and ..."

Erik D. Demaine, Mohammad Taghi Hajiaghayi (2004)

> Home

Details and statistics

DOI: 10.1007/978-3-540-31843-9_57

access: open

type: Conference or Workshop Paper

metadata version: 2022-11-13

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/gd/DemaineH04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/gd/DemaineH04
Erik D. Demaine, Mohammad Taghi Hajiaghayi:
Fast Algorithms for Hard Graph Problems: Bidimensionality, Minors, and Local Treewidth. GD 2004: 517-533

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.