- On the Hardness of Approximating the Chromatic Number Sanjeev Khanna
- Network Bargaining: Algorithms and Structural Results Tanmoy Chakraborty
- On Allocating Goods to Maximize Fairness Deeparnab Chakrabarty
- log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design
- Dynamic and Non-Uniform Pricing Strategies for Revenue Maximization Tanmoy Chakraborty Zhiyi Huang Sanjeev Khanna
- An Optimal Labeling Scheme for Workflow Provenance Using Skeleton Labels
- Privacy Issues in Scientific Workflow Provenance [Position Paper]
- Discrete Algorithms, 448454, 1993. item in the big bin and obtains a profit of 1 while OPT = 2.
- (4) Else if F is 0valid then Sat(F) is in P but finding a solution of positive value is NPhard. (5) Else finding any feasible solution to Max Ones(F) is NPhard.
- Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data
- Provenance Views for Module Privacy Susan B. Davidson
- On Approximating Rectangle Tiling and Packing Sanjeev Khanna \Lambda S. Muthukrishnan y Mike Paterson z
- Randomized PursuitEvasion with Limited Visibility Volkan Isler # Sampath Kannan + Sanjeev Khanna #
- New Hardness Results for Undirected Edge Disjoint Paths Julia Chuzhoy # Sanjeev Khanna +
- Approximation Algorithms for the Largest Common Subtree Problem
- Polynomial Flow-Cut Gaps and Hardness of Directed Cut Problems Julia Chuzhoy
- Hardness of Directed Routing with Congestion Julia Chuzhoy
- current phase. Algorithm Integral: Given a request sequence, the
- Perfect Matchings in O(n log n) Time in Regular Bipartite Ashish Goel
- Approximating Pure Nash Equilibrium in Cut, Party Affiliation, and Satisfiability Games
- In the following, we discuss the effect of the above de scribed form of adjacent channel interference on distance1
- Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates
- Compression without a common prior: an information-theoretic justification for ambiguity in
- [5] T. Feder and M. Vardi. Monotone monadic SNP and constraint satisfaction. Proceedings of the 25th Annual Symposium on Theory of Computing, ACM, 1993.
- Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems
- [4] H. Okamura and P. D. Seymour. Multicommodity Flow in Planar Graphs. In J. Combin. Theory Ser. B, 31:75--81, 1981.
- This article was processed using the L A T E X macro package with LLNCS style [v77] P. van Emde Boas. Preserving order in a forest in less than logarithmic time and
- On the Hardness of 4coloring a 3colorable Graph \Lambda Venkatesan Guruswami y Sanjeev Khanna z
- [18] D. D. Sleator and R. E. Tarjan. Amortized efficiency of list update and paging rules. Com munications of the ACM, 28:202--208, 1985.
- Multiprocessor Scheduling to Minimize Flow Time with # Resource Augmentation
- On Certificates and Lookahead in Dynamic Graph Problems Sanjeev Khanna \Lambda Rajeev Motwani y Randall H. Wilson z
- Approximation Algorithms for the Metric Labeling Problem via a New Linear Programming Formulation
- Selection with Monotone Comparison Costs Sampath Kannan Sanjeev Khanna y
- Towards a Syntactic Characterization of PTAS Sanjeev Khanna \Lambda Rajeev Motwani y
- On the Complexity of Graph Self-assembly in Accretive Systems
- Time-Constrained Scheduling of Weighted Packets on Trees and Meshes
- A Deterministic Algorithm for the COSTDISTANCE Problem Chandra Chekuri \Lambda Sanjeev Khanna y Joseph (Seffi) Naor z
- Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing
- Archiving Scientific Data PETER BUNEMAN
- The AllorNothing Multicommodity Flow Problem Chandra Chekuri
- Asymmetric kCenter is log # nHard to Approximate Julia Chuzhoy # Sudipto Guha + Eran Halperin # Sanjeev Khanna
- The Approximability of Constraint Satisfaction Sanjeev Khanna y Madhu Sudan z Luca Trevisan x David P. Williamson {
- [21] N. Vaidya and S. Hameed, ``Improved Algorithms for Scheduling Data Broadcast'', Technical Report 96029, Dept. of Computer Science, texas A&M University, 1996.
- Differencing Provenance in Scientific Workflows Zhuowei Bao #1
- umn in a path connecting the two gadgets would incur a cost of \Omega\Gamma N \Gamma3 ).) Similarly, the cycle that covers the
- [1] N. Alon, J. Csirik, S. V. Sevastianov, A. P. A. Vest jens, and G. J. Woeginger. Online and offline ap
- A Graph Partitioning Approach to Sequential Diagnosis
- Directed Network Design with Orientation Constraints \Lambda Sanjeev Khanna y Joseph (Seffi) Naor z F. Bruce Shepherd x
- Polynomial Flow-Cut Gaps and Hardness of Directed Cut [Extended Abstract]
- Edge-Disjoint Paths in Planar Graphs with Constant Congestion
- On Multidimensional Packing Problems \Lambda Chandra Chekuri y Sanjeev Khanna z
- On Syntactic versus Computational Views of Approximability SANJEEV KHANNA \Lambda RAJEEV MOTWANI \Lambda MADHU SUDAN y UMESH VAZIRANI z
- On the Hardness of Approximating Max kCut and its Dual Viggo Kann \Lambda Sanjeev Khanna y Jens Lagergren \Lambda Alessandro Panconesi z
- Hardness of Cut Problems in Directed Graphs [Extended Abstract]
- Machine Minimization for Scheduling Jobs with Interval Constraints Julia Chuzhoy # Sudipto Guha + Sanjeev Khanna # Joseph (Seffi) Naor
- On the Network Coding Advantage for Wireless Multicast in Euclidean Space Ashish Goel
- JOURNAL OF COMPUTATIONAL BIOLOGY Volume 14, Number 6, 2007
- Approximability of Capacitated Network Design Deeparnab Chakrabarty1
- Social Welfare in One-Sided Matching Markets without Money
- Optimal Lower Bounds for Universal and Differentially Private Steiner Trees and TSPs
- Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs
- Algorithms for the Generalized Sorting Problem Zhiyi Huang
- Queries with Difference on Probabilistic Databases Sanjeev Khanna
- Adaptive Selective Verification Sanjeev Khanna and Santosh S. Venkatesh, University of Pennsylvania
- Optimizing User Views for Workflows Olivier Biton
- A Formal Investigation of Diff3 Sanjeev Khanna1
- Delays and the Capacity of Continuous-time Channels Sanjeev Khanna
- On Provenance and Privacy Susan B. Davidson, Sanjeev Khanna, Sudeepa Roy, Julia Stoyanovich, Val Tannen
- Foundations of Software Technology and Theoretical Computer Science (Bangalore) 2008. Editors: R. Hariharan, M. Mukund, V. Vinay; pp 256-267
- Robust Self-assembly of Graphs Stanislav Angelov1
- COMBINATORICA Bolyai Society Springer-Verlag
