( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Partitioning algorithms for induced subgraph problems.

. University of Glasgow, UK, (2023)British Library, EThOS.

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.

Michael James

Audrein James

Katherine James

Ammini James-Mammoottil

Rojin James

 

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

Connectivity Tracking Methods for a Network of Unmanned Aerial Vehicles., , и . CCWC, стр. 440-447. IEEE, (2019)Certifying Solvers for Clique and Maximum Common (Connected) Subgraph Problems., , , , , и . CP, том 12333 из Lecture Notes in Computer Science, стр. 338-357. Springer, (2020)The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants., , и . ICGT, том 12150 из Lecture Notes in Computer Science, стр. 316-324. Springer, (2020)Induced universal graphs for families of small graphs.. CoRR, (2021)Sequential and Parallel Solution-Biased Search for Subgraph Algorithms., , , , , и . CPAIOR, том 11494 из Lecture Notes in Computer Science, стр. 20-38. Springer, (2019)A Partitioning Algorithm for Maximum Common Subgraph Problems., , и . IJCAI, стр. 712-719. ijcai.org, (2017)Position-Indexed Formulations for Kidney Exchange., , , , и . EC, стр. 25-42. ACM, (2016)Morphing Between Stable Matching Problems., , и . CP, том 9892 из Lecture Notes in Computer Science, стр. 832-840. Springer, (2016)Partitioning algorithms for induced subgraph problems.. University of Glasgow, UK, (2023)British Library, EThOS.PACE Solver Description: Tweed-Plus: A Subtree-Improving Heuristic Solver for Treedepth.. IPEC, том 180 из LIPIcs, стр. 35:1-35:4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)