English
 
User Manual Privacy Policy Disclaimer Contact us
  Advanced SearchBrowse

Item

ITEM ACTIONSEXPORT

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;

Fulltext (public)
There are no public fulltexts available
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: http://hdl.handle.net/21.11116/0000-0002-A8E9-A
Abstract
There is no abstract available