( en | de | ru )

 

Disambiguation of "Prosser, Patrick"

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.

Egfrid Prosser

Andreas Prosser

Franziska Prosser

Nicole Prößer

Patrick Pfeffer

Optimiertes Design kombinatorischer Verbindungsbibliotheken durch genetische Algorithmen und deren Bewertung anhand wissensbasierter Protein-Ligand-Bindungsprofile. Uni Marburg, (2009)
 

Other publications of authors with the same name

Heuristics and Really Hard Instances for Subgraph Isomorphism Problems., , and . IJCAI, page 631-638. IJCAI/AAAI Press, (2016)Variable Ordering Heuristics Show Promise., , and . CP, volume 3258 of Lecture Notes in Computer Science, page 711-715. Springer, (2004)The Dynamics of Dynamic Variable Ordering Heuristics.. CP, volume 1520 of Lecture Notes in Computer Science, page 17-23. Springer, (1998)Clique and Constraint Models for Maximum Common (Connected) Subgraph Problems., , , and . CP, volume 9892 of Lecture Notes in Computer Science, page 350-368. Springer, (2016)A Hybrid Genetic Algorithm for Pallet Loading.. ECAI, page 159-164. Pitmann Publishing, London, (1988)Finding Maximum k-Cliques Faster using Lazy Global Domination., and . CoRR, (2014)The Shape of the Search Tree for the Maximum Clique Problem and the Implications for Parallel Branch and Bound., and . ACM Trans. Parallel Comput., 2 (1): 8:1-8:27 (2015)A distributed asynchronous system for predictive and reactive scheduling., and . Artif. Intell. Eng., 6 (3): 106-124 (1991)A parallel branch and bound algorithm for the maximum labelled clique problem., and . Optim. Lett., 9 (5): 949-960 (2015)Finding Maximum k-Cliques Faster Using Lazy Global Domination., and . SOCS, page 72-80. AAAI Press, (2016)