Algorithms – ESA 2011 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783642237188, 9783642237195

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Resource Allocation for Covering Time Varying Demands

Algorithms – ESA 2011 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-23719-5_46 ◽

2011 ◽

pp. 543-554 ◽

Cited By ~ 5

Author(s):

Venkatesan T. Chakaravarthy ◽

Amit Kumar ◽

Sambuddha Roy ◽

Yogish Sabharwal

Keyword(s):

Resource Allocation ◽

Time Varying

Improved Approximations for k-Exchange Systems

Algorithms – ESA 2011 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-23719-5_66 ◽

2011 ◽

pp. 784-798 ◽

Cited By ~ 6

Author(s):

Moran Feldman ◽

Joseph Naor ◽

Roy Schwartz ◽

Justin Ward

Optimal Discovery Strategies in White Space Networks

Algorithms – ESA 2011 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-23719-5_60 ◽

2011 ◽

pp. 713-722 ◽

Cited By ~ 5

Author(s):

Yossi Azar ◽

Ori Gurel-Gurevich ◽

Eyal Lubetzky ◽

Thomas Moscibroda

Keyword(s):

White Space ◽

Space Networks ◽

White Space Networks

Robust Algorithms for Preemptive Scheduling

Algorithms – ESA 2011 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-23719-5_48 ◽

2011 ◽

pp. 567-578 ◽

Cited By ~ 6

Author(s):

Leah Epstein ◽

Asaf Levin

Keyword(s):

Preemptive Scheduling ◽

Robust Algorithms

Near-Popular Matchings in the Roommates Problem

Algorithms – ESA 2011 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-23719-5_15 ◽

2011 ◽

pp. 167-179 ◽

Cited By ~ 2

Author(s):

Chien-Chung Huang ◽

Telikepalli Kavitha

Maximum Flows by Incremental Breadth-First Search

Algorithms – ESA 2011 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-23719-5_39 ◽

2011 ◽

pp. 457-468 ◽

Cited By ~ 26

Author(s):

Andrew V. Goldberg ◽

Sagi Hed ◽

Haim Kaplan ◽

Robert E. Tarjan ◽

Renato F. Werneck

Keyword(s):

Breadth First Search ◽

Maximum Flows

Tolerant Algorithms

Algorithms – ESA 2011 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-23719-5_62 ◽

2011 ◽

pp. 736-747 ◽

Cited By ~ 5

Author(s):

Rolf Klein ◽

Rainer Penninger ◽

Christian Sohler ◽

David P. Woodruff

Engineering Multilevel Graph Partitioning Algorithms

Algorithms – ESA 2011 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-23719-5_40 ◽

2011 ◽

pp. 469-480 ◽

Cited By ~ 52

Author(s):

Peter Sanders ◽

Christian Schulz

Keyword(s):

Graph Partitioning ◽

Multilevel Graph Partitioning ◽

Partitioning Algorithms

On the Approximation Performance of Fictitious Play in Finite Games

Algorithms – ESA 2011 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-23719-5_9 ◽

2011 ◽

pp. 93-105

Author(s):

Paul W. Goldberg ◽

Rahul Savani ◽

Troels Bjerre Sørensen ◽

Carmine Ventre

Keyword(s):

Fictitious Play ◽

Finite Games

Scheduling Partially Ordered Jobs Faster Than 2 n

Algorithms – ESA 2011 - Lecture Notes in Computer Science ◽

10.1007/978-3-642-23719-5_26 ◽

2011 ◽

pp. 299-310 ◽

Cited By ~ 5

Author(s):

Marek Cygan ◽

Marcin Pilipczuk ◽

Michał Pilipczuk ◽

Jakub Onufry Wojtaszczyk

Keyword(s):

Partially Ordered

Algorithms – ESA 2011 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Resource Allocation for Covering Time Varying Demands

Improved Approximations for k-Exchange Systems

Optimal Discovery Strategies in White Space Networks

Robust Algorithms for Preemptive Scheduling

Near-Popular Matchings in the Roommates Problem

Maximum Flows by Incremental Breadth-First Search

Tolerant Algorithms

Engineering Multilevel Graph Partitioning Algorithms

On the Approximation Performance of Fictitious Play in Finite Games

Scheduling Partially Ordered Jobs Faster Than 2 n

Algorithms – ESA 2011 - Lecture Notes in Computer Science
Latest Publications