Research Publications
Research Publication
A Dichotomy Theorem for the General Minimum Cost Homomorphism Problem
DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)Jan 1, 201044 OpenAlex citationsMatched to OpenAlex
DOI: 10.4230/lipics.stacs.2010.2493
Publication summary
Matched to OpenAlexNo abstract is available yet. The publication is shown because it is linked to an approved public researcher profile.
Advanced Graph Theory ResearchConstraint Satisfaction and OptimizationComplexity and Algorithms in Graphsdichotomy theoremconstraint satisfactioncomplexity classificationalgebraic methodsdirected graphs
Authors
Related publications
Connected through authors and topics already present in the Research Hub.
Analysis of Images, Social Networks and TextsLecture notes in computer science · 2026 · 0 OpenAlex citationsSame author: Rustem TakhanovPosterior Frequencies and the Cost of Not Fitting: A Correction to a Memorization Lower BoundarXiv (Cornell University) · 2026 · 0 OpenAlex citationsSame author: Rustem TakhanovNew lower bounds for kissing numbers in dimensions $25$--$31$arXiv (Cornell University) · 2026 · 0 OpenAlex citationsSame author: Rustem TakhanovA quaternionic construction behind $841$-point kissing arrangement in ${\mathbb R}^{12}$arXiv (Cornell University) · 2026 · 0 OpenAlex citationsSame author: Rustem Takhanov