Author of the publication

A Fully Polynomial Time Approximation Scheme for Refutations in Weighted Difference Constraint Systems.

, , , , and . CALDAM, volume 10743 of Lecture Notes in Computer Science, page 45-58. Springer, (2018)

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

On Singleton Congestion Games with Resilience Against Collusion., , and . CoRR, (2020)New Results on Test-Cost Minimization in Database Migration., , , and . ALGOCLOUD, volume 13084 of Lecture Notes in Computer Science, page 38-55. Springer, (2021)Algorithmic Analysis of Priority-Based Bin Packing., , , and . CALDAM, volume 12601 of Lecture Notes in Computer Science, page 359-372. Springer, (2021)Hedonic Expertise Games., , and . ISAIM, (2022)On Existence of Equilibrium Under Social Coalition Structures., , and . TAMC, volume 12337 of Lecture Notes in Computer Science, page 263-274. Springer, (2020)On approximate Nash equilibria of the two-source connection game., , , and . Turkish J. Electr. Eng. Comput. Sci., 30 (6): 2206-2220 (2022)On efficient computation of equilibrium under social coalition structures., , and . Turkish J. Electr. Eng. Comput. Sci., 28 (3): 1686-1698 (2020)Priority-based bin packing with subset constraints., , , and . Discret. Appl. Math., (January 2024)On Singleton Congestion Games with Resilience Against Collusion., , and . COCOON, volume 13025 of Lecture Notes in Computer Science, page 37-48. Springer, (2021)Partition Equilibrium Always Exists in Resource Selection Games., , and . SAGT, volume 6386 of Lecture Notes in Computer Science, page 42-53. Springer, (2010)