( en | de | ru )

 

Disambiguation of "Prosser, Patrick"

Author of the publication

copydeleteadd this publication to your clipboard
Greedy Graph Colouring is a Misleading Heuristic.

, and . CoRR, (2013)

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

Greedy Graph Colouring is a Misleading Heuristic., and . CoRR, (2013)Understanding the Empirical Hardness of Random Optimisation Problems., , and . CP, volume 11802 of Lecture Notes in Computer Science, page 333-349. Springer, (2019)A case study of mutual routing-scheduling reformulation., , and . J. Sched., 9 (5): 469-491 (2006)An Empirical Study of the Stable Marriage Problem with Ties and Incomplete Lists., and . ECAI, page 141-145. IOS Press, (2002)Scaling Effects in the CSP Phase Transition., , , and . CP, volume 976 of Lecture Notes in Computer Science, page 70-87. Springer, (1995)Vehicle Routing and Job Shop Scheduling: What's the Difference?, , and . ICAPS, page 267-276. AAAI, (2003)Trying Again to Fail-First., , and . CSCLP, volume 3419 of Lecture Notes in Computer Science, page 41-55. Springer, (2004)Finding Maximum k-Cliques Faster Using Lazy Global Domination., and . SOCS, page 72-80. AAAI Press, (2016)A Hybrid Genetic Algorithm for Pallet Loading.. ECAI, page 159-164. Pitmann Publishing, London, (1988)Heuristics and Really Hard Instances for Subgraph Isomorphism Problems., , and . IJCAI, page 631-638. IJCAI/AAAI Press, (2016)