The SCEAS System
| |||||||

## Search the dblp DataBase
Sanjeev Khanna:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Sanjeev Khanna, S. Muthukrishnan, Steven Skiena
**Efficient Array Partitioning.**[Citation Graph (2, 0)][DBLP] ICALP, 1997, pp:616-626 [Conf] - Sanjeev Khanna, S. Muthukrishnan, Mike Paterson
**On Approximating Rectangle Tiling and Packing.**[Citation Graph (2, 0)][DBLP] SODA, 1998, pp:384-393 [Conf] - Sanjeev Khanna, Rajeev Motwani
**Towards a Syntactic Characterization of PTAS.**[Citation Graph (1, 0)][DBLP] STOC, 1996, pp:329-337 [Conf] - Stanislav Angelov, Sanjeev Khanna, Keshav Kunal
**The Network as a Storage Device: Dynamic Routing with Bounded Buffers.**[Citation Graph (0, 0)][DBLP] APPROX-RANDOM, 2005, pp:1-13 [Conf] - Venkatesan Guruswami, Sanjeev Khanna
**On the Hardness of 4-Coloring a 3-Colorable Graph.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 2000, pp:188-197 [Conf] - Sanjeev Khanna, Madhu Sudan, Luca Trevisan
**Constraint Satisfaction: The Approximability of Minimization Problems.**[Citation Graph (0, 0)][DBLP] IEEE Conference on Computational Complexity, 1997, pp:282-296 [Conf] - Stanislav Angelov, Sanjeev Khanna, Mirkó Visontai
**On the Complexity of Graph Self-assembly in Accretive Systems.**[Citation Graph (0, 0)][DBLP] DNA, 2006, pp:95-110 [Conf] - Foto N. Afrati, Evripidis Bampis, Chandra Chekuri, David R. Karger, Claire Kenyon, Sanjeev Khanna, Ioannis Milis, Maurice Queyranne, Martin Skutella, Clifford Stein, Maxim Sviridenko
**Approximation Schemes for Minimizing Average Weighted Completion Time with Release Dates.**[Citation Graph (0, 0)][DBLP] FOCS, 1999, pp:32-44 [Conf] - Matthew Andrews, Julia Chuzhoy, Sanjeev Khanna, Lisa Zhang
**Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion.**[Citation Graph (0, 0)][DBLP] FOCS, 2005, pp:226-244 [Conf] - Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
**Edge-Disjoint Paths in Planar Graphs.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:71-80 [Conf] - Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor
**Machine Minimization for Scheduling Jobs with Interval Constraints.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:81-90 [Conf] - Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh V. Vazirani
**On Syntactic versus Computational Views of Approximability**[Citation Graph (0, 0)][DBLP] FOCS, 1994, pp:819-830 [Conf] - Peter Buneman, Sanjeev Khanna, Wang Chiew Tan
**Data Provenance: Some Basic Issues.**[Citation Graph (0, 0)][DBLP] FSTTCS, 2000, pp:87-93 [Conf] - Kurt Maly, Sanjeev Khanna, Ravi Mukkamala, C. Michael Overstreet, Ramesh Yerraballi, Edwin C. Foudriat, B. Madan
**Parallel TCP/IP for Multiprocessor Workstations.**[Citation Graph (0, 0)][DBLP] HPN, 1992, pp:103-118 [Conf] - Andreas Björklund, Thore Husfeldt, Sanjeev Khanna
**Approximating Longest Directed Paths and Cycles.**[Citation Graph (0, 0)][DBLP] ICALP, 2004, pp:222-233 [Conf] - Chandra Chekuri, Sanjeev Khanna
**A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines.**[Citation Graph (0, 0)][DBLP] ICALP, 2001, pp:848-861 [Conf] - Yevgeniy Dodis, Sanjeev Khanna
**Space Time Tradeoffs for Graph Properties.**[Citation Graph (0, 0)][DBLP] ICALP, 1999, pp:291-300 [Conf] - Sanjeev Khanna, Joseph Naor, Danny Raz
**Control Message Aggregation in Group Communication Protocols.**[Citation Graph (0, 0)][DBLP] ICALP, 2002, pp:135-146 [Conf] - Sanjeev Khanna
**Logic Programming for Software Testing.**[Citation Graph (0, 0)][DBLP] ICCI, 1990, pp:225-234 [Conf] - Kurt Maly, Frank Paterra, C. Michael Overstreet, Ravi Mukkamala, Sanjeev Khanna
**Concurrent Use of Parallel Communication to Enable Remote Visualization.**[Citation Graph (0, 0)][DBLP] ICCI, 1992, pp:449-452 [Conf] - Peter Buneman, Sanjeev Khanna, Wang Chiew Tan
**Why and Where: A Characterization of Data Provenance.**[Citation Graph (0, 8)][DBLP] ICDT, 2001, pp:316-330 [Conf] - Kurt Maly, Sanjeev Khanna, C. Michael Overstreet, Ravi Mukkamala, Mohammad Zubair, Y. S. Sekhar
**Multiprocessor Architectures for High Speed Networks: A Performance Study.**[Citation Graph (0, 0)][DBLP] IFIP Congress (1), 1992, pp:645-651 [Conf] - Matthew Andrews, Sanjeev Khanna, Krishnan Kumaran
**Integrated Scheduling of Unicast and Multicast Traffic in an Input-Queued Switch.**[Citation Graph (0, 0)][DBLP] INFOCOM, 1999, pp:1144-1151 [Conf] - Krishnan Kumaran, Sanjeev Khanna
**On Wireless Spectrum Estimation and Generalized Graph Coloring.**[Citation Graph (0, 0)][DBLP] INFOCOM, 1998, pp:1273-1283 [Conf] - Sanjeev Khanna, Nathan Linial, Shmuel Safra
**On the Hardness of Approximating the Chromatic Number.**[Citation Graph (0, 0)][DBLP] ISTCS, 1993, pp:250-260 [Conf] - Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi
**On the Hardness of Approximating Max k-Cut and Its Dual.**[Citation Graph (0, 0)][DBLP] ISTCS, 1996, pp:61-67 [Conf] - Carl A. Gunter, Sanjeev Khanna, Kaijun Tan, Santosh S. Venkatesh
**DoS Protection for Reliably Authenticated Broadcast.**[Citation Graph (0, 0)][DBLP] NDSS, 2004, pp:- [Conf] - Peter Buneman, Sanjeev Khanna, Wang Chiew Tan
**On Propagation of Deletions and Annotations Through Views.**[Citation Graph (0, 0)][DBLP] PODS, 2002, pp:150-158 [Conf] - Michael Greenwald, Sanjeev Khanna
**Power-Conserving Computation of Order-Statistics over Sensor Networks.**[Citation Graph (0, 0)][DBLP] PODS, 2004, pp:275-285 [Conf] - Sanjeev Khanna, Wang Chiew Tan
**On Computing Functions with Uncertainty.**[Citation Graph (0, 0)][DBLP] PODS, 2001, pp:- [Conf] - Stanislav Angelov, Boulos Harb, Sampath Kannan, Sanjeev Khanna, Junhyong Kim
**Efficient Enumeration of Phylogenetically Informative Substrings.**[Citation Graph (0, 0)][DBLP] RECOMB, 2006, pp:248-264 [Conf] - Maria Adamou, Sanjeev Khanna, Insup Lee, Insik Shin, Shiyu Zhou
**Fair Real-Time Traffic Scheduling over a Wireless LA.**[Citation Graph (0, 0)][DBLP] IEEE Real-Time Systems Symposium, 2001, pp:279-288 [Conf] - Peter Buneman, Sanjeev Khanna, Keishi Tajima, Wang Chiew Tan
**Archiving scientific data.**[Citation Graph (0, 0)][DBLP] SIGMOD Conference, 2002, pp:1-12 [Conf] - Michael Greenwald, Sanjeev Khanna
**Space-Efficient Online Computation of Quantile Summaries.**[Citation Graph (0, 0)][DBLP] SIGMOD Conference, 2001, pp:58-66 [Conf] - Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber
**The Angular-Metric Traveling Salesman Problem.**[Citation Graph (0, 0)][DBLP] SODA, 1997, pp:221-229 [Conf] - Susanne Albers, Sanjeev Arora, Sanjeev Khanna
**Page Replacement for General Caching Problems.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:31-40 [Conf] - Nikhil Bansal, Moses Charikar, Sanjeev Khanna, Joseph Naor
**Approximating the average response time in broadcast scheduling.**[Citation Graph (0, 0)][DBLP] SODA, 2005, pp:215-221 [Conf] - Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andrew McGregor
**Reconstructing strings from random traces.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:910-918 [Conf] - Chandra Chekuri, Sanjeev Khanna
**A PTAS for the multiple knapsack problem.**[Citation Graph (0, 0)][DBLP] SODA, 2000, pp:213-222 [Conf] - Chandra Chekuri, Sanjeev Khanna
**Edge disjoint paths revisited.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:628-637 [Conf] - Chandra Chekuri, Sanjeev Khanna
**On Multi-Dimensional Packing Problems.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:185-194 [Conf] - Chandra Chekuri, Sanjeev Khanna, Joseph Naor
**A deterministic algorithm for the cost-distance problem.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:232-233 [Conf] - Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin
**Approximation algorithms for the metric labeling problem via a new linear programming formulation.**[Citation Graph (0, 0)][DBLP] SODA, 2001, pp:109-118 [Conf] - Yevgeniy Dodis, Venkatesan Guruswami, Sanjeev Khanna
**The 2-Catalog Segmentation Problem.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:897-898 [Conf] - Leana Golubchik, Sanjeev Khanna, Samir Khuller, Ramakrishna Thurimella, An Zhu
**Approximation algorithms for data placement on parallel disks.**[Citation Graph (0, 0)][DBLP] SODA, 2000, pp:223-232 [Conf] - Volkan Isler, Sampath Kannan, Sanjeev Khanna
**Randomized pursuit-evasion with limited visibility.**[Citation Graph (0, 0)][DBLP] SODA, 2004, pp:1060-1069 [Conf] - Sampath Kannan, Sanjeev Khanna
**Selection with monotone comparison cost.**[Citation Graph (0, 0)][DBLP] SODA, 2003, pp:10-17 [Conf] - Sanjeev Khanna, Rajeev Motwani, Randall H. Wilson
**On Certificates and Lookahead in Dynamic Graph Problems.**[Citation Graph (0, 0)][DBLP] SODA, 1996, pp:222-231 [Conf] - Sanjeev Khanna, Joseph Naor, F. Bruce Shepherd
**Directed network design with orientation constraints.**[Citation Graph (0, 0)][DBLP] SODA, 2000, pp:663-671 [Conf] - Sanjeev Khanna, Francis Zane
**Watermarking maps: hiding information in structured data.**[Citation Graph (0, 0)][DBLP] SODA, 2000, pp:596-605 [Conf] - Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, Adi Rosén
**Time-Constrained Scheduling of Weighted Packets on Trees and Meshes.**[Citation Graph (0, 0)][DBLP] SPAA, 1999, pp:1-12 [Conf] - Chandra Chekuri, Ashish Goel, Sanjeev Khanna, Amit Kumar
**Multi-processor scheduling to minimize flow time with epsilon resource augmentation.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:363-372 [Conf] - Chandra Chekuri, Sanjeev Khanna
**Approximation schemes for preemptive weighted flow time.**[Citation Graph (0, 0)][DBLP] STOC, 2002, pp:297-305 [Conf] - Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
**The all-or-nothing multicommodity flow problem.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:156-165 [Conf] - Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
**Multicommodity flow, well-linked terminals, and routing problems.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:183-192 [Conf] - Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
**Edge-disjoint paths in Planar graphs with constant congestion.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:757-766 [Conf] - Chandra Chekuri, Sanjeev Khanna, An Zhu
**Algorithms for minimizing weighted flow time.**[Citation Graph (0, 0)][DBLP] STOC, 2001, pp:84-93 [Conf] - Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Joseph Naor
**Asymmetric k-center is log**[Citation Graph (0, 0)][DBLP]^{*}*n*-hard to approximate. STOC, 2004, pp:21-27 [Conf] - Julia Chuzhoy, Sanjeev Khanna
**Hardness of cut problems in directed graphs.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:527-536 [Conf] - Yevgeniy Dodis, Sanjeev Khanna
**Design Networks with Bounded Pairwise Distance.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:750-759 [Conf] - Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, F. Bruce Shepherd, Mihalis Yannakakis
**Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:19-28 [Conf] - Sanjeev Khanna, Vincenzo Liberatore
**On Broadcast Disk Paging.**[Citation Graph (0, 0)][DBLP] STOC, 1998, pp:634-643 [Conf] - Sanjeev Khanna, Madhu Sudan, David P. Williamson
**A Complete Classification of the Approximability of Maximization Problems Derived from Boolean Constraint Satisfaction.**[Citation Graph (0, 0)][DBLP] STOC, 1997, pp:11-20 [Conf] - Sanjeev Khanna, Shiyu Zhou
**On Indexed Data Broadcast.**[Citation Graph (0, 0)][DBLP] STOC, 1998, pp:463-472 [Conf] - Stanislav Angelov, Boulos Harb, Sampath Kannan, Sanjeev Khanna, Junhyong Kim, Li-San Wang
**Genome Identification and Classification by Short Oligo Arrays.**[Citation Graph (0, 0)][DBLP] WABI, 2004, pp:400-411 [Conf] - Stanislav Angelov, Sanjeev Khanna, Li Li, Fernando Pereira
**ATDD: An Algorithmic Tool for Domain Discovery in Protein Sequences.**[Citation Graph (0, 0)][DBLP] WABI, 2004, pp:206-217 [Conf] - Michael B. Greenwald, Sanjeev Khanna, Keshav Kunal, Benjamin C. Pierce, Alan Schmitt
**Agreeing to Agree: Conflict Resolution for Optimistically Replicated Data.**[Citation Graph (0, 0)][DBLP] DISC, 2006, pp:269-283 [Conf] - Micah Adler, Sanjeev Khanna, Rajmohan Rajaraman, Adi Rosén
**Time-Constrained Scheduling of Weighted Packets on Trees and Meshes.**[Citation Graph (0, 0)][DBLP] Algorithmica, 2003, v:36, n:2, pp:123-152 [Journal] - Sanjeev Khanna, Rajeev Motwani, Randall H. Wilson
**On Certificates and Lookahead in Dynamic Graph Problems.**[Citation Graph (0, 0)][DBLP] Algorithmica, 1998, v:21, n:4, pp:377-394 [Journal] - Sanjeev Khanna
**Logic Programming for Software Verification and Testing.**[Citation Graph (0, 0)][DBLP] Comput. J., 1991, v:34, n:4, pp:350-357 [Journal] - Viggo Kann, Sanjeev Khanna, Jens Lagergren, Alessandro Panconesi
**On the Hardness of Approximating Max k-Cut and its Dual.**[Citation Graph (0, 0)][DBLP] Chicago J. Theor. Comput. Sci., 1997, v:1997, n:, pp:- [Journal] - Sanjeev Khanna, Nathan Linial, Shmuel Safra
**On the Hardness of Approximating the Chromatic Number.**[Citation Graph (0, 0)][DBLP] Combinatorica, 2000, v:20, n:3, pp:393-415 [Journal] - Volkan Isler, Sanjeev Khanna, John R. Spletzer, Camillo J. Taylor
**Target tracking with distributed sensors: The focus of attention problem.**[Citation Graph (0, 0)][DBLP] Computer Vision and Image Understanding, 2005, v:100, n:1-2, pp:225-247 [Journal] - Venkatesan Guruswami, Sanjeev Khanna
**On the Hardness of 4-coloring a 3-colorable Graph**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:73, pp:- [Journal] - Andreas Björklund, Thore Husfeldt, Sanjeev Khanna
**Approximating Longest Directed Path**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 2003, v:10, n:032, pp:- [Journal] - Julia Chuzhoy, Sudipto Guha, Sanjeev Khanna, Joseph Naor
**Asymmetric k-center is log**[Citation Graph (0, 0)][DBLP]^{*}n-hard to Approximate Electronic Colloquium on Computational Complexity (ECCC), 2003, v:, n:038, pp:- [Journal] - Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh V. Vazirani
**On Syntactic versus Computational Views of Approximability**[Citation Graph (0, 0)][DBLP] Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:23, pp:- [Journal] - Julia Chuzhoy, Sudipto Guha, Eran Halperin, Sanjeev Khanna, Guy Kortsarz, Robert Krauthgamer, Joseph Naor
**Asymmetric**[Citation Graph (0, 0)][DBLP]*k*-center is log^{*}*n*-hard to approximate. J. ACM, 2005, v:52, n:4, pp:538-551 [Journal] - Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, F. Bruce Shepherd, Mihalis Yannakakis
**Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2003, v:67, n:3, pp:473-496 [Journal] - Sanjeev Khanna
**Guest Editor's Foreword.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2002, v:64, n:4, pp:749- [Journal] - Sanjeev Khanna, Aravind Srinivasan
**Special issue: 35th Annual ACM Symposium on Theory of Computing.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2004, v:69, n:3, pp:305-0 [Journal] - Sanjeev Khanna, Shiyu Zhou
**On Indexed Data Broadcast**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2000, v:60, n:3, pp:575-591 [Journal] - Sanjeev Khanna, W. Kent Fuchs
**A Linear Time Algorithm for Sequential Diagnosis in Hypercubes.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 1995, v:26, n:1, pp:48-53 [Journal] - Alok Aggarwal, Don Coppersmith, Sanjeev Khanna, Rajeev Motwani, Baruch Schieber
**The Angular-Metric Traveling Salesman Problem.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1999, v:29, n:3, pp:697-711 [Journal] - Chandra Chekuri, Sanjeev Khanna
**On Multidimensional Packing Problems.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2004, v:33, n:4, pp:837-851 [Journal] - Chandra Chekuri, Sanjeev Khanna
**A Polynomial Time Approximation Scheme for the Multiple Knapsack Problem.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2005, v:35, n:3, pp:713-728 [Journal] - Sanjeev Khanna, Vincenzo Liberatore
**On Broadcast Disk Paging.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:29, n:5, pp:1683-1702 [Journal] - Sanjeev Khanna, Rajeev Motwani, Madhu Sudan, Umesh V. Vazirani
**On Syntactic versus Computational Views of Approximability.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:28, n:1, pp:164-191 [Journal] - Sanjeev Khanna, Madhu Sudan, Luca Trevisan, David P. Williamson
**The Approximability of Constraint Satisfaction Problems.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 2000, v:30, n:6, pp:1863-1920 [Journal] - Chandra Chekuri, Sanjeev Khanna, Joseph Naor, Leonid Zosin
**A Linear Programming Formulation and Approximation Algorithms for the Metric Labeling Problem.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2004, v:18, n:3, pp:608-625 [Journal] - Venkatesan Guruswami, Sanjeev Khanna
**On the Hardness of 4-Coloring a 3-Colorable Graph.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2004, v:18, n:1, pp:30-40 [Journal] - Volkan Isler, Sampath Kannan, Sanjeev Khanna
**Randomized Pursuit-Evasion with Local Visibility.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2006, v:20, n:1, pp:26-41 [Journal] - Sanjeev Khanna, W. Kent Fuchs
**A Graph Partitioning Approach to Sequential Diagnosis.**[Citation Graph (0, 0)][DBLP] IEEE Trans. Computers, 1997, v:46, n:1, pp:39-47 [Journal] - Peter Buneman, Sanjeev Khanna, Keishi Tajima, Wang Chiew Tan
**Archiving scientific data.**[Citation Graph (0, 0)][DBLP] ACM Trans. Database Syst., 2004, v:29, n:, pp:2-42 [Journal] - Julia Chuzhoy, Venkatesan Guruswami, Sanjeev Khanna, Kunal Talwar
**Hardness of routing with congestion in directed graphs.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:165-178 [Conf] - Julia Chuzhoy, Sanjeev Khanna
**Polynomial flow-cut gaps and hardness of directed cut problems.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:179-188 [Conf] **Robust Self-assembly of Graphs.**[Citation Graph (, )][DBLP]**Algorithms for Single-Source Vertex Connectivity.**[Citation Graph (, )][DBLP]**On Allocating Goods to Maximize Fairness.**[Citation Graph (, )][DBLP]**An O(k^3 log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design.**[Citation Graph (, )][DBLP]**Dynamic and Non-uniform Pricing Strategies for Revenue Maximization.**[Citation Graph (, )][DBLP]**A Formal Investigation of.**[Citation Graph (, )][DBLP]**STCON in Directed Unique-Path Graphs.**[Citation Graph (, )][DBLP]**Algorithms for 2-Route Cut Problems.**[Citation Graph (, )][DBLP]**Differencing Provenance in Scientific Workflows.**[Citation Graph (, )][DBLP]**Optimizing user views for workflows.**[Citation Graph (, )][DBLP]**Adaptive SelectiveVerification.**[Citation Graph (, )][DBLP]**On the Network Coding Advantage for Wireless Multicast in Euclidean Space.**[Citation Graph (, )][DBLP]**Approximating pure nash equilibrium in cut, party affiliation, and satisfiability games.**[Citation Graph (, )][DBLP]**Network bargaining: algorithms and structural results.**[Citation Graph (, )][DBLP]**An optimal labeling scheme for workflow provenance using skeleton labels.**[Citation Graph (, )][DBLP]**The ratio index for budgeted learning, with applications.**[Citation Graph (, )][DBLP]**Perfect matchings via uniform sampling in regular bipartite graphs.**[Citation Graph (, )][DBLP]**Network design for vertex connectivity.**[Citation Graph (, )][DBLP]**Perfect matchings in o(**[Citation Graph (, )][DBLP]*n*log*n*) time in regular bipartite graphs.**Nash Dynamics in Congestion Games with Similar Resources.**[Citation Graph (, )][DBLP]**Automatic construction of a minimum size motion graph.**[Citation Graph (, )][DBLP]**Nash Dynamics in Constant Player and Bounded Jump Congestion Games.**[Citation Graph (, )][DBLP]**A Note on Multiflows and Treewidth.**[Citation Graph (, )][DBLP]**The Network as a Storage Device: Dynamic Routing with Bounded Buffers.**[Citation Graph (, )][DBLP]**The Ratio Index for Budgeted Learning, with Applications**[Citation Graph (, )][DBLP]**Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs**[Citation Graph (, )][DBLP]**An O(k**[Citation Graph (, )][DBLP]^{3}log n)-Approximation Algorithm for Vertex-Connectivity Survivable Network Design**On Allocating Goods to Maximize Fairness**[Citation Graph (, )][DBLP]**Perfect Matchings in Õ(n**[Citation Graph (, )][DBLP]^{1.5}) Time in Regular Bipartite Graphs**Dynamic and Non-Uniform Pricing Strategies for Revenue Maximization**[Citation Graph (, )][DBLP]**Perfect Matchings in O(n \log n) Time in Regular Bipartite Graphs**[Citation Graph (, )][DBLP]**Improved Hardness of Approximation for Stackelberg Shortest-Path Pricing**[Citation Graph (, )][DBLP]**Graph Sparsification via Refinement Sampling**[Citation Graph (, )][DBLP]**Preserving Module Privacy in Workflow Provenance**[Citation Graph (, )][DBLP]**Inapproximability of edge-disjoint paths and low congestion routing on undirected graphs.**[Citation Graph (, )][DBLP]**Hardness of Directed Routing with Congestion.**[Citation Graph (, )][DBLP]
Search in 0.104secs, Finished in 0.111secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |