English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Journal Article

Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number

MPS-Authors
/persons/resource/persons255161

Sharma,  Roohani
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource
No external resources are shared
Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)

s00453-022-01093-w.pdf
(Publisher version), 475KB

Supplementary Material (public)
There is no public supplementary material available
Citation

Misra, P., Saket, S., Sharma, R., & Zehavi, M. (2023). Sub-exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number. Algorithmica. doi:10.1007/s00453-022-01093-w.


Cite as: https://hdl.handle.net/21.11116/0000-000C-9037-3
Abstract
There is no abstract available