( en | de | ru )

 

Disambiguation of "Trimble, James"

Author of the publication

copydeleteadd this publication to your clipboard
On Maximum Weight Clique Algorithms, and How They Are Evaluated.

, , , and . CP, volume 10416 of Lecture Notes in Computer Science, page 206-225. Springer, (2017)

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.

Michael James

Audrein James

Katherine James

Ammini James-Mammoottil

Rojin James

 

Other publications of authors with the same name

When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases., , , and . J. Artif. Intell. Res., (2018)Connectivity Tracking Methods for a Network of Unmanned Aerial Vehicles., , and . CCWC, page 440-447. IEEE, (2019)Morphing Between Stable Matching Problems., , and . CP, volume 9892 of Lecture Notes in Computer Science, page 832-840. Springer, (2016)The Application of WebGIS Tools for Visualizing Coastal Flooding Vulnerability and Planning for Resiliency: The New Jersey Experience., , , and . ISPRS Int. J. Geo Inf., 3 (2): 408-429 (2014)A Constraint Model for the Tree Decomposition of a Graph., , and . CoRR, (2019)Partitioning algorithms for induced subgraph problems.. University of Glasgow, UK, (2023)British Library, EThOS.Position-Indexed Formulations for Kidney Exchange., , , , and . EC, page 25-42. ACM, (2016)PACE Solver Description: Tweed-Plus: A Subtree-Improving Heuristic Solver for Treedepth.. IPEC, volume 180 of LIPIcs, page 35:1-35:4. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)Heuristics and Really Hard Instances for Subgraph Isomorphism Problems., , and . IJCAI, page 631-638. IJCAI/AAAI Press, (2016)An Algorithm for the Exact Treedepth Problem.. SEA, volume 160 of LIPIcs, page 19:1-19:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2020)