( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Convexity-increasing morphs of planar graphs.

, , , , , и . Comput. Geom., (2019)

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.

Darren Gould

Darren Goins

Darren Croton

Darren Parker

Darren Dancey

 

Другие публикации лиц с тем же именем

Linear-Time Algorithms for Geometric Graphs with Sublinearly Many Crossings, , и . CoRR, (2008)Extended dynamic subgraph statistics using h-index parameterized data structures., , , и . Theor. Comput. Sci., (2012)Extended Dynamic Subgraph Statistics Using h-Index Parameterized Data Structures., , , и . COCOA (1), том 6508 из Lecture Notes in Computer Science, стр. 128-141. Springer, (2010)Extended h-Index Parameterized Data Structures for Computing Dynamic Subgraph Statistics, , , и . CoRR, (2010)Boosting Data Reduction for the Maximum Weight Independent Set Problem Using Increasing Transformations., , , , и . CoRR, (2020)Exactly Solving the Maximum Weight Independent Set Problem on Large Real-World Graphs., , , , и . ALENEX, стр. 144-158. SIAM, (2019)Scalable Kernelization for Maximum Independent Sets., , и . ACM J. Exp. Algorithmics, 24 (1): 1.16:1-1.16:22 (2019)Solving Edge Clique Cover Exactly via Synergistic Data Reduction., , , , , и . ESA, том 274 из LIPIcs, стр. 61:1-61:19. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2023)Effective Data Reduction for the Vertex Clique Cover Problem., и . ALENEX, стр. 41-53. SIAM, (2022)Engineering Kernelization for Maximum Cut., , , , , и . ALENEX, стр. 27-41. SIAM, (2020)