A framework for ETH-Tight algorithms and lower bounds in geometric intersection graphs

De, Berg M and Bodlaender, HL and Kisfaludi-Bak, S and Marx, Dániel and Van, Der Zanden TC (2018) A framework for ETH-Tight algorithms and lower bounds in geometric intersection graphs. In: 50th Annual ACM Symposium on Theory of Computing, STOC 2018. Association for Computing Machinery, New York, pp. 51-64. ISBN 9781450355599 10.1145/3188745.3188854

[img] Text
DeBerg_51_3424409_ny.pdf

Download (1MB)
Item Type: Book Section
Subjects: Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány
Divisions: Informatics Laboratory
SWORD Depositor: MTMT Injector
Depositing User: MTMT Injector
Date Deposited: 08 Jan 2019 21:00
Last Modified: 08 Jan 2019 21:00
URI: http://eprints.sztaki.hu/id/eprint/9571

Update Item Update Item