E-LIB Suche - Ergebnisse für: Kavitha, Telikepalli

1

Stable Matchings, One-Sided Ties, and Approximate Popularit:

Kavitha, Telikepalli
Algorithmica. 86 (2024) 6 - p. 1888-1920 , 2024

Link: https://doi.org/10.1007/..

2

Maximum Matchings and Popularity:

Kavitha, Telikepalli
SIAM Journal on Discrete Mathematics. 38 (2024) 2 - p. 1202-1221 , 2024

Link: https://doi.org/10.1137/..

3

Popular Matchings with One-Sided Bias:

Kavitha, Telikepalli
ACM Transactions on Algorithms. 20 (2024) 1 - p. 1-22 , 2024

Link: https://doi.org/10.1145/..

4

Envy-free relaxations for goods, chores, and mixed items:

Bérczi, Kristóf ; Bérczi-Kovács, Erika R. ; Boros, Endre...
Theoretical Computer Science. 1002 (2024) - p. 114596 , 2024

Link: https://doi.org/10.1016/..

5

Understanding Popular Matchings via Stable Matchings:

Cseh, Ágnes ; Faenza, Yuri ; Kavitha, Telikepalli.
SIAM Journal on Discrete Mathematics. 36 (2022) 1 - p. 188-213 , 2022

Link: https://doi.org/10.1137/..

6

A Little Charity Guarantees Almost Envy-Freeness:

Chaudhury, Bhaskar Ray ; Kavitha, Telikepalli ; Mehlhorn, Kurt.
SIAM Journal on Computing. 50 (2021) 4 - p. 1336-1358 , 2021

Link: https://doi.org/10.1137/..

7

Popular branchings and their dual certificates:

Kavitha, Telikepalli ; Király, Tamás ; Matuschke, Jannik..
Mathematical Programming. 192 (2021) 1-2 - p. 567-595 , 2021

Link: https://doi.org/10.1007/..

8

Popular Matchings in Complete Graphs:

Cseh, Ágnes ; Kavitha, Telikepalli
Algorithmica. 83 (2021) 5 - p. 1493-1523 , 2021

Link: https://doi.org/10.1007/..

9

Quasi-popular matchings, optimality, and extended formulati..:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,

Faenza, Yuri ; Kavitha, Telikepalli - p. 325-344 , 2020

Link: https://dl.acm.org/doi/1..

10

Popular Branchings and Their Dual Certificates:

, In: Integer Programming and Combinatorial Optimization; Lecture Notes in Computer Science,

Kavitha, Telikepalli ; Király, Tamás ; Matuschke, Jannik.. - p. 223-237 , 2020

Link: https://doi.org/10.1007/..

11

A little charity guarantees almost envy-freeness:

, In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms,

Chaudhury, Bhaskar Ray ; Kavitha, Telikepalli ; Mehlhorn, Kurt. - p. 2658-2672 , 2020

Link: https://dl.acm.org/doi/1..

12

Popular matchings and limits to tractability:

, In: Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms,

Faenza, Yuri ; Kavitha, Telikepalli ; Powers, Vladlena. - p. 2790-2809 , 2019

Link: https://dl.acm.org/doi/1..

13

Two Problems in Max-Size Popular Matchings:

Brandl, Florian ; Kavitha, Telikepalli
Algorithmica. 81 (2019) 7 - p. 2738-2764 , 2019

Link: https://doi.org/10.1007/..

14

Popular Matchings of Desired Size:

, In: Graph-Theoretic Concepts in Computer Science; Lecture Notes in Computer Science,

Kavitha, Telikepalli - p. 306-317 , 2018

Link: https://doi.org/10.1007/..

15

Popularity, mixed matchings, and self-duality:

, In: Proceedings of the Twenty-Eighth Annual ACM-SIAM Symposium on Discrete Algorithms,

Huang, Chien-Chung ; Kavitha, Telikepalli - p. 2294-2310 , 2017

Link: https://dl.acm.org/doi/1..