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
Hilfe
Suche: Author="Korula, Nitish"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
A graph reduction step preserving element-connectivity and packing Steiner trees and forests
Chandra Chekuri
,
Nitish Korula
SIAM Journal on Discrete Mathematics
28
(2), 2014, pp. 577-597
Pruning 2-connected graphs
Chandra Chekuri
,
Nitish Korula
Algorithmica
62
(1-2), 2012, pp. 436-463
Overlap number of graphs
Daniel W. Cranston
,
Nitish Korula
,
Timothy D. LeSaulnier
,
Kevin G. Milans
,
Christopher J. Stocker
,
Jennifer Vandenbussche
,
Douglas B. West
Journal of Graph Theory
70
(1), 2012, pp. 10-28
Approximability of capacitated network design
Deeparnab Chakrabarty
,
Chandra Chekuri
,
Sanjeev Khanna
,
Nitish Korula
Lecture Notes in Computer Science
6655
, 2011, pp. 78-91
On
k
-column sparse packing programs
Nikhil Bansal
,
Nitish Korula
,
Viswanath Nagarajan
,
Aravind Srinivasan
Lecture Notes in Computer Science
6080
, 2010, pp. 369-382
Online stochastic packing applied to display ad allocation
Jon Feldman
,
Monika Henzinger
,
Nitish Korula
,
Vahab S. Mirrokni
,
Cliff Stein
Lecture Notes in Computer Science
6346
, 2010, pp. 182-194
A graph reduction step preserving element-connectivity and applications
Chandra Chekuri
,
Nitish Korula
Lecture Notes in Computer Science
5555
, 2009, pp. 254-265
Algorithms for secretary problems on graphs and hypergraphs
Nitish Korula
,
Martin Pál
Lecture Notes in Computer Science
5556
, 2009, pp. 508-520
Pruning 2-connected graphs
Chandra Chekuri
,
Nitish Korula
Leibniz International Proceedings in Informatics (LIPIcs)
2
, 2008
Single-sink network design with vertex connectivity requirements
Chandra Chekuri
,
Nitish Korula
Leibniz International Proceedings in Informatics (LIPIcs)
2
, 2008