English
 
Help Privacy Policy Disclaimer
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT
Add to Basket
  Local TagsRelease HistoryDetailsSummary

Released
Conference Paper

Tight Conditional Lower Bounds for Longest Common Increasing Subsequence

MPS-Authors
/persons/resource/persons44857

Künnemann,  Marvin
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

http://drops.dagstuhl.de/opus/volltexte/2018/8570/
(Publisher version)

http://drops.dagstuhl.de/doku/urheberrecht1.html
(Copyright transfer agreement)

Fulltext (restricted access)
There are currently no full texts shared for your IP range.
Fulltext (public)
There are no public fulltexts stored in PuRe
Supplementary Material (public)
There is no public supplementary material available
Citation

Duraj, L., Künnemann, M., & Polak, A. (2017). Tight Conditional Lower Bounds for Longest Common Increasing Subsequence. In D. Lokshtanov, & N. Nishimura (Eds.), 12th International Symposium on Parameterized and Exact Computation (pp. 1-13). Wadern: Schloss Dagstuhl. doi:10.4230/LIPIcs.IPEC.2017.15.


Cite as: https://hdl.handle.net/21.11116/0000-0002-A8E9-A
Abstract
There is no abstract available