182 citations · 670 across the 41 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.CC2011★ 11 cited
Inapproximability of Treewidth, One-Shot Pebbling, and Related Layout Problems
Per Austrin, Toniann Pitassi, Yu Wu
We study the approximability of a number of graph problems: treewidth and pathwidth of graphs, one-shot black (and black-white) pebbling costs of directed acyclic graphs, and a var…
cs.CC2011★ 40 cited
Fairness Through Awareness
Cynthia Dwork, Moritz Hardt, Toniann Pitassi +2
We study fairness in classification, where individuals are classified, e.g., admitted to a university, and the goal is to prevent discrimination against individuals based on their…