Kurt Mehlhorn
7 papers · 2000–2025 · 6 venues · across top CS/AI venues
Authors are matched by name, so researchers who share a name ("Yang Liu", "Wei Wang") appear as a single profile and their paper counts, venues and achievements are combined. How identity is handled.
Achievements
Jump to papers ↓+2 more ↓ Show less ↑
π Interdisciplinary Bridge Β· Bronze π Academic Marathon Β· Ultra πΊοΈ Taxonomy Completionist (11) π£ Hot Topic Early Bird π Conference Polyglot Β· Silver
π
Conference Pioneer
π
Trend Setter
Top co-authors
Research topics
Keywords
fair division
(3)
approximation algorithm
(2)
combinatorial optimization
(2)
resource allocation
(1)
query complexity
(1)
pareto optimality
(1)
graph isomorphism
(1)
nash social welfare
(1)
truthful mechanism
(1)
graph kernel
(1)
potential function
(1)
social welfare
(1)
indivisible good
(1)
proportional allocation
(1)
indivisible chore
(1)
additive valuation
(1)
envy-freeness up to one item
(1)
matching algorithm
(1)
weisfeiler-lehman algorithm
(1)
subtree pattern
(1)
Papers
Welfare-Optimal Serial Dictatorships Have Polynomial Query Complexity
AAAI 2025
Fair and Efficient Allocation of Indivisible Chores with Surplus
IJCAI 2023
Randomized and Deterministic Maximin-share Approximations for Fractionally Subadditive Valuations
NeurIPS 2023
Maximizing Nash Social Welfare in 2-Value Instances
AAAI 2022
Weisfeiler-Lehman Graph Kernels
JMLR 2011
Efficient graphlet kernels for large graph comparison
AISTATS 2005
A Polynomial-Time Fragment of Dominance Constraints
ACL 2000