( en | de | ru )

 

Disambiguation of "Lincoln, Andrea"

Author of the publication

copydeleteadd this publication to your clipboard
Quasipolynomiality of the Smallest Missing Induced Subgraph.

, , and . J. Graph Algorithms Appl., 27 (5): 329-339 (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ulrich Lincoln

Tania Lincoln

Tania Lincoln

Bryan Lincoln

Tania Lincoln

 

Other publications of authors with the same name

Deterministic Time-Space Trade-Offs for k-SUM., , , and . ICALP, volume 55 of LIPIcs, page 58:1-58:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Quasipolynomiality of the Smallest Missing Induced Subgraph., , and . CoRR, (2023)The one-out-of-k retrieval problem and linear network coding., , , , and . Adv. Math. Commun., 10 (1): 95-112 (2016)How Compression and Approximation Affect Efficiency in String Distance Measures., , , and . CoRR, (2021)Faster Random k-CNF Satisfiability., and . CoRR, (2019)Fine-grained I/O Complexity via Reductions: New Lower Bounds, Faster Algorithms, and a Time Hierarchy., , , , and . ITCS, volume 94 of LIPIcs, page 34:1-34:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Algorithms and Lower Bounds for Cycles and Walks: Small Space and Sparse Graphs., and . ITCS, volume 151 of LIPIcs, page 11:1-11:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Monochromatic Triangles, Intermediate Matrix Products, and Convolutions., , and . CoRR, (2020)Delegation for Search Problems., , and . ICALP, volume 229 of LIPIcs, page 73:1-73:18. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)Faster Random k-CNF Satisfiability., and . ICALP, volume 168 of LIPIcs, page 78:1-78:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)