From post

New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies.

, , и . SIROCCO, том 8 из Proceedings in Informatics, стр. 77-88. Carleton Scientific, (2001)

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.

 

Другие публикации лиц с тем же именем

Efficient on-line communication in cellular networks., , и . SPAA, стр. 46-53. ACM, (2000)Optimal social choice functions: a utilitarian view., , , , , и . EC, стр. 197-214. ACM, (2012)Revenue Guarantees in the Generalized Second Price Auction., , , и . ACM Trans. Internet Techn., 14 (2-3): 17:1-17:19 (2014)Limitations of Deterministic Auction Design for Correlated Bidders., , и . TOCT, 8 (4): 13:1-13:18 (2016)Minority Becomes Majority in Social Networks., , , , и . WINE, том 9470 из Lecture Notes in Computer Science, стр. 74-88. Springer, (2015)Tight approximation bounds for combinatorial frugal coverage algorithms., , и . J. Comb. Optim., 26 (2): 292-309 (2013)New Bounds on the Size of the Minimum Feedback Vertex Set in Meshes and Butterflies., , и . SIROCCO, том 8 из Proceedings in Informatics, стр. 77-88. Carleton Scientific, (2001)An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling., и . Theory Comput. Syst., 63 (1): 114-127 (2019)Tight Bounds for Selfish and Greedy Load Balancing., , , , и . Algorithmica, 61 (3): 606-637 (2011)Improved Lower Bounds on the Price of Stability of Undirected Network Design Games., , , и . Theory Comput. Syst., 52 (4): 668-686 (2013)