Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Garg, Naveen"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Minimizing maximum (weighted) flow-time on related and unrelated machines
S. Anand
,
Karl Bringmann
,
Tobias Friedrich
,
Naveen Garg
,
Amit Kumar
Lecture Notes in Computer Science
7965
, 2013, pp. 13-24
A 5-approximation for capacitated facility location
Manisha Bansal
,
Naveen Garg
,
Neelima Gupta
Lecture Notes in Computer Science
7501
, 2012, pp. 133-144
Approximation algorithms for the unsplittable flow problem on paths and trees
Khaled Elbassioni
,
Naveen Garg
,
Divya Gupta
,
Amit Kumar
,
Vishal Narula
,
Arindam Pal
Leibniz International Proceedings in Informatics (LIPIcs)
18
, 2012, pp. 267-275
Meeting deadlines: How much speed suffices?
S. Anand
,
Naveen Garg
,
Nicole Megow
Lecture Notes in Computer Science
6755
, 2011, pp. 232-243
A 3-approximation for facility location with uniform capacities
Ankit Aggarwal
,
L. Anand
,
Manisha Bansal
,
Naveen Garg
,
Neelima Gupta
,
Shubham Gupta
,
Surabhi Jain
Lecture Notes in Computer Science
6080
, 2010, pp. 149-162
Assigning papers to referees
Naveen Garg
,
Telikepalli Kavitha
,
Amit Kumar
,
Kurt Mehlhorn
,
Julián Mestre
Algorithmica
58
(1), 2010, pp. 119-136
A competitive algorithm for minimizing weighted flow time on unrelated machines with speed augmentation
Jivitej S. Chadha
,
Naveen Garg
,
Amit Kumar
,
V.N. Muralidhara
Proceedings of the 41st International ACM Symposium on Theory of Computing, STOC'2009 (Bethesda, Maryland, USA, May 31 - June 2, 2009)
, 2009, pp. 679-683
Minimizing total flow-time: The unrelated case
Naveen Garg
,
Amit Kumar
,
V.N. Muralidhara
Lecture Notes in Computer Science
5369
, 2008, pp. 424-435
Faster and simpler algorithms for multicommodity flow and other fractional packing problems
Naveen Garg
,
Jochen Könemann
SIAM Journal on Computing
37
(2), 2007, pp. 630-652
Order scheduling models: Hardness and algorithms
Naveen Garg
,
Amit Kumar
,
Vinayaka Pandit
Lecture Notes in Computer Science
4855
, 2007, pp. 96-107
Computing a center-transversal line
Pankaj K. Agarwal
,
Sergio Cabello
,
J. Antoni Sellarès
,
Micha Sharir
Lecture Notes in Computer Science
4337
, 2006, pp. 93-104
Context-sensitive dependency pairs
Beatriz Alarcón
,
Raúl Gutiérrez
,
Salvador Lucas
Lecture Notes in Computer Science
4337
, 2006, pp. 297-308
Branching pushdown tree automata
Rajeev Alur
,
Swarat Chaudhuri
Lecture Notes in Computer Science
4337
, 2006, pp. 393-404
Monitoring of real-time properties
Andreas Bauer
,
Martin Leucker
,
Christian Schallhart
Lecture Notes in Computer Science
4337
, 2006, pp. 260-272
Self-assemblying classes of shapes with a minimum number of tiles, and in optimal time
Florent Becker
,
Ivan Rapaport
,
Éric Rémila
Lecture Notes in Computer Science
4337
, 2006, pp. 45-56
Multi-stack boundary labeling problems
Michael A. Bekos
,
Michael Kaufmann
,
Katerina Potika
,
Antonios Symvonis
Lecture Notes in Computer Science
4337
, 2006, pp. 81-92
Shared-variable concurrency: A proposal
Gérard Boudol
Lecture Notes in Computer Science
4337
, 2006, pp. 1-3
Almost optimal strategies in one clock priced timed games
Patricia Bouyer
,
Kim G. Larsen
,
Nicolas Markey
,
Jacob Illum Rasmussen
Lecture Notes in Computer Science
4337
, 2006, pp. 345-356
On decidability of LTL model checking for process rewrite systems
Laura Bozzelli
,
Mojmír Kȓetínský
,
Vojtȇch Ȓehák
,
Jan Strejc̑ek
Lecture Notes in Computer Science
4337
, 2006, pp. 248-259
Tree automata make ordinal theory easy
Thierry Cachat
Lecture Notes in Computer Science
4337
, 2006, pp. 285-296
Fast edge colorings with fixed number of colors to minimize imbalance
Gruia Calinescu
,
Michael Pelsmajer
Lecture Notes in Computer Science
4337
, 2006, pp. 117-128
One-input-face MPCVP is hard for
L
, but in LogDCFL
Tanmoy Chakraborty
,
Samir Datta
Lecture Notes in Computer Science
4337
, 2006, pp. 57-68
Zero error list-decoding capacity of the
q/(q - 1)
channel
Sourav Chakraborty
,
Jaikumar Radhakrishnan
,
Nandakumar Raghunathan
,
Prashant Sasatte
Lecture Notes in Computer Science
4337
, 2006, pp. 129-138
On continuous timed automata with input-determined guards
Fabrice Chevalier
,
Deepak D'Souza
,
Pavithra Prabhakar
Lecture Notes in Computer Science
4337
, 2006, pp. 369-380
Computationally sound symbolic secrecy in the presence of hash functions
Véronique Cortier
,
Steve Kremer
,
Ralf Küsters
,
Bogdan Warinschi
Lecture Notes in Computer Science
4337
, 2006, pp. 176-187
Seiten 1
2
3
4
>