Almost tight lower bounds for hard cutting problems in embedded graphs
Cohen-Addad, V and de, Verdière É C and Marx, Dániel and de, Mesmay A (2019) Almost tight lower bounds for hard cutting problems in embedded graphs. In: 35th International Symposium on Computational Geometry, SoCG 2019. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, Dagstuhl, 27:1-27:16. ISBN 9783959771047 10.4230/LIPIcs.SoCG.2019.27
|
Text
Cohen_1_30798203_ny.pdf Download (590kB) | Preview |
Official URL: https://doi.org/10.4230%2FLIPIcs.SoCG.2019.27
| 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: | 12 Sep 2019 07:07 |
| Last Modified: | 17 Nov 2021 14:12 |
| URI: | https://eprints.sztaki.hu/id/eprint/9733 |
 |
Update Item |
