Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms
Latest Publications

TOTAL DOCUMENTS

141

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Society For Industrial And Applied Mathematics

9781611972108, 9781611973099

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Competitive Routing in the Half-θ6-Graph

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973099.104 ◽

2012 ◽

Cited By ~ 10

Author(s):

Prosenjit Bose ◽

Rolf Fagerberg ◽

André van Renssen ◽

Sander Verdonschot

Download Full-text

Sketching Valuation Functions

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973099.81 ◽

2012 ◽

Cited By ~ 10

Author(s):

Ashwinkumar Badanidiyuru ◽

Shahar Dobzinski ◽

Hu Fu ◽

Robert Kleinberg ◽

Noam Nisan ◽

...

Download Full-text

Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973099.102 ◽

2012 ◽

Cited By ~ 5

Author(s):

Yuri Faenza ◽

Gianpaolo Oriolo ◽

Gautier Stauffer

Keyword(s):

Linear Programs ◽

Stable Sets

Download Full-text

Constructing high order elements through subspace polynomials

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973099.115 ◽

2012 ◽

Cited By ~ 7

Author(s):

Qi Cheng ◽

Shuhong Gao ◽

Daqing Wan

Keyword(s):

High Order

Download Full-text

Physarum Can Compute Shortest Paths

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973099.21 ◽

2012 ◽

Cited By ~ 11

Author(s):

Vincenzo Bonifaci ◽

Kurt Mehlhorn ◽

Girish Varma

Keyword(s):

Shortest Paths

Download Full-text

Subexponential Parameterized Algorithm for Minimum Fill-in

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973099.138 ◽

2012 ◽

Cited By ~ 10

Author(s):

Fedor V. Fomin ◽

Yngve Villanger

Keyword(s):

Parameterized Algorithm

Download Full-text

Resource Augmentation for Weighted Flow-time explained by Dual Fitting

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973099.97 ◽

2012 ◽

Cited By ~ 36

Author(s):

S. Anand ◽

Naveen Garg ◽

Amit Kumar

Keyword(s):

Flow Time ◽

Resource Augmentation

Download Full-text

Structural and Logical Approaches to the Graph Isomorphism Problem

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973099.16 ◽

2012 ◽

Cited By ~ 1

Author(s):

Martin Grohe

Keyword(s):

Graph Isomorphism ◽

Isomorphism Problem ◽

Graph Isomorphism Problem

Download Full-text

Online Scheduling with General Cost Functions

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973099.99 ◽

2012 ◽

Cited By ~ 7

Author(s):

Sungjin Im ◽

Benjamin Moseley ◽

Kirk Pruhs

Keyword(s):

Online Scheduling ◽

Cost Functions ◽

General Cost Functions

Download Full-text

A Matroid Approach to Stable Matchings with Lower Quotas

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms ◽

10.1137/1.9781611973099.12 ◽

2012 ◽

Cited By ~ 11

Author(s):

Tamás Fleiner ◽

Naoyuki Kamiyama

Keyword(s):

Stable Matchings ◽

Lower Quotas

Download Full-text

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete AlgorithmsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Society For Industrial And Applied Mathematics

Competitive Routing in the Half-θ6-Graph

Sketching Valuation Functions

Separating stable sets in claw-free graphs via Padberg-Rao and compact linear programs

Constructing high order elements through subspace polynomials

Physarum Can Compute Shortest Paths

Subexponential Parameterized Algorithm for Minimum Fill-in

Resource Augmentation for Weighted Flow-time explained by Dual Fitting

Structural and Logical Approaches to the Graph Isomorphism Problem

Online Scheduling with General Cost Functions

A Matroid Approach to Stable Matchings with Lower Quotas

Proceedings of the Twenty-Third Annual ACM-SIAM Symposium on Discrete Algorithms
Latest Publications