( en | de | ru )

 

Disambiguation of "Lynch, Jayson"

Author of the publication

copydeleteadd this publication to your clipboard
Who Needs Crossings? Hardness of Plane Graph Rigidity.

, , , , , and . SoCG, volume 51 of LIPIcs, page 3:1-3:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)

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.

Philip Lynch

John Lynch

Matthew Lynch

Grit Lynch

Donal Lynch

 

Other publications of authors with the same name

Folding Equilateral Plane Graphs., , , , , , and . ISAAC, volume 7074 of Lecture Notes in Computer Science, page 574-583. Springer, (2011)An Efficient Reversible Algorithm for Linear Regression., , and . ICRC, page 103-108. IEEE, (2021)The Computational Complexity of Finding Hamiltonian Cycles in Grid Graphs of Semiregular Tessellations., and . CCCG, page 114-128. (2018)This Game Is Not Going To Analyze Itself., , , , , , , and . CoRR, (2023)Traversability, Reconfiguration, and Reachability in the Gadget Framework., , , , and . WALCOM, volume 13174 of Lecture Notes in Computer Science, page 47-58. Springer, (2022)Who witnesses The Witness? Finding witnesses in The Witness is hard and sometimes impossible., , , , , , , and . FUN, volume 100 of LIPIcs, page 3:1-3:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)The Computational Complexity of Portal and Other 3D Video Games., , and . FUN, volume 100 of LIPIcs, page 19:1-19:22. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)Arithmetic Expression Construction., , , , , , , , , and 3 other author(s). ISAAC, volume 181 of LIPIcs, page 12:1-12:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)A Dataset for Learning University STEM Courses at Scale and Generating Questions at a Human Level., , , , , , , , , and 14 other author(s). AAAI, page 15921-15929. AAAI Press, (2023)Push-Pull Block Puzzles are Hard., , and . CIAC, volume 10236 of Lecture Notes in Computer Science, page 177-195. (2017)