Author of the publication

Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs.

, , , , , , and . SODA, page 3664-3683. SIAM, (2023)

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.

 

Other publications of authors with the same name

Matchings Under Diversity Constraints., , , and . CoRR, (2022)Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs., , , , , , and . SODA, page 3664-3683. SIAM, (2023)Matchings with Group Fairness Constraints: Online and Offline Algorithms., , , and . IJCAI, page 377-383. ijcai.org, (2021)Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part I: Algorithmic Results., , , , , , and . CoRR, (2022)Anti-Factor is FPT Parameterized by Treewidth and List Size (but Counting is Hard)., , and . CoRR, (2021)Online Algorithms for Matchings with Proportional Fairness Constraints and Diversity Constraints., , , and . ECAI, volume 372 of Frontiers in Artificial Intelligence and Applications, page 1601-1608. IOS Press, (2023)Optimal Matchings with One-Sided Preferences: Fixed and Cost-Based Quotas., , and . AAMAS, page 696-704. International Foundation for Autonomous Agents and Multiagent Systems (IFAAMAS), (2022)Approximation Algorithms for School Assignment: Group Fairness and Multi-criteria Optimization., , , and . CoRR, (2024)Data Exchange Markets via Utility Balancing., , , , , and . WWW, page 57-65. ACM, (2024)Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs Part II: Hardness Results., , , , , , and . CoRR, (2023)