"Quasi-polynomial algorithms for list-coloring of nearly intersecting ..."

Khaled M. Elbassioni (2022)

> Home

Details and statistics

DOI: 10.1016/J.TCS.2021.12.009

access: closed

type: Journal Article

metadata version: 2022-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/tcs/Elbassioni22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Elbassioni22
Khaled M. Elbassioni:
Quasi-polynomial algorithms for list-coloring of nearly intersecting hypergraphs. Theor. Comput. Sci. 902: 64-75 (2022)

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.