default search action

combined dblp search
author search
venue search
publication search

ask others

S. Anand 0002

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Naveen Garg 0001

> Home > Persons > S. Anand 0002

Publications

2017
[j1]
- view
  authority control:
- export record
  dblp key:
  - journals/algorithmica/0002B0G017
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/0002B0G017
S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar:
Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. Algorithmica 77(2): 515-536 (2017)
2013
[c3]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/0002BFGK13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/0002BFGK13
S. Anand, Karl Bringmann, Tobias Friedrich, Naveen Garg, Amit Kumar:
Minimizing Maximum (Weighted) Flow-Time on Related and Unrelated Machines. ICALP (1) 2013: 13-24
2012
[c2]
- view
  authority control:
- export record
  dblp key:
  - conf/soda/AnandGK12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/soda/AnandGK12
S. Anand, Naveen Garg, Amit Kumar:
Resource augmentation for weighted flow-time explained by dual fitting. SODA 2012: 1228-1241
2011
[c1]
- view
  authority control:
- export record
  dblp key:
  - conf/icalp/AnandGM11
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/AnandGM11
S. Anand, Naveen Garg, Nicole Megow:
Meeting Deadlines: How Much Speed Suffices? ICALP (1) 2011: 232-243

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.