Improved approximation algorithms for shop scheduling problems
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
e-approximations with minimum packing constraint violation (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Approximations for the disjoint paths problem in high-diameter planar networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Improved approximations of packing and covering problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Polynomial time approximation schemes for dense instances of NP-hard problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Allocating bandwidth for bursty connections
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Algorithms for computing and integrating physical maps using unique probes
RECOMB '97 Proceedings of the first annual international conference on Computational molecular biology
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Scheduling data transfers in a network and the set scheduling problem
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Packet routing with arbitrary end-to-end delay requirements
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
HERO: hierarchical EMC-constrained routing
ICCAD '92 Proceedings of the 1992 IEEE/ACM international conference on Computer-aided design
Randomized rounding without solving the linear program
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
An extension of the Lovász local lemma, and its applications to integer programming
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
LP based approach to optimal stable matchings
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
On multi-dimensional packing problems
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Generating low-degree 2-spanners
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A polylogarithmic approximation algorithm for the group Steiner tree problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
New algorithmic aspects of the Local Lemma with applications to routing and partitioning
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
A deterministic approximation algorithm for a minmax integer programming problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Provably good global routing by a new approximation algorithm for multicommodity flow
ISPD '00 Proceedings of the 2000 international symposium on Physical design
ISPD '00 Proceedings of the 2000 international symposium on Physical design
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Randomized metarounding (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Off-line admission control for general scheduling problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Finding the closest lattice vector when it's unusually close
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Web caching using access statistics
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
New approaches to covering and packing problems
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Minimizing stand-by leakage power in static CMOS circuits
Proceedings of the conference on Design, automation and test in Europe
Provably good global buffering by multi-terminal multicommodity flow approximation
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
Convex quadratic and semidefinite programming relaxations in scheduling
Journal of the ACM (JACM)
Simple on-line algorithms for the maximum disjoint paths problem
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Improved bounds for the unsplittable flow problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Wavelet synopses with error guarantees
Proceedings of the 2002 ACM SIGMOD international conference on Management of data
Network Design for Express Shipment Delivery
Computational Optimization and Applications
Approximating Scheduling Unrelated Parallel Machines in Parallel
Computational Optimization and Applications
Provably good global buffering using an available buffer block plan
Proceedings of the 2000 IEEE/ACM international conference on Computer-aided design
Random Structures & Algorithms - Probabilistic methods in combinatorial optimization
Sublogarithmic approximation for telephone multicast: path out of jungle (extended abstract)
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Non-independent randomized rounding
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Experimental Evaluation of Approximation Algorithms for Single-Source Unsplittable Flow
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
On Preemptive Resource Constrained Scheduling: Polynomial-Time Approximation Schemes
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Practical Approximation Algorithms for Separable Packing Linear Programs
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
The RPR2 Rounding Technique for Semidefinite Programs
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Approximating Multicast Congestion
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
Positive Linear Programming Extensions: Parallel Complexity and Applications (Research Note)
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Approximation algorithms for facility location problems
APPROX '00 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization
On Constrained Hypergraph Coloring and Scheduling
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Approximation Algorithms for the Unsplittable Flow Problem
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Algorithms Based on Randomization and Linear and Semidefinite Programming
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Approximation Algorithms for Restoration Capacity Planning
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Non-independent Randomized Rounding and an Application to Digital Halftoning
ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Approximation Algorithms for MAX 4-SAT and Rounding Procedures for Semidefinite Programs
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Using the Pseudo-Dimension to Analyze Approximation Algorithms for Integer Programming
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Randomized approximations of the constraint satisfaction problem
Nordic Journal of Computing
Discrete Applied Mathematics
Minimum majority classification and boosting
Eighteenth national conference on Artificial intelligence
A practical algorithm for constructing oblivious routing schemes
Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architectures
The side-chain positioning problem: a semidefinite programming formulation with new rounding schemes
PCK50 Proceedings of the Paris C. Kanellakis memorial workshop on Principles of computing & knowledge: Paris C. Kanellakis memorial workshop on the occasion of his 50th birthday
Meet and merge: approximation algorithms for confluent flows
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Optimal oblivious routing in polynomial time
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Floorplan Evaluation with Timing-Driven Global Wireplanning, Pin Assignment and Buffer/Wire Sizing
ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
Using Randomized Rounding to Satisfy Timing Constraints of Real-Time Preemptive Tasks
ASP-DAC '02 Proceedings of the 2002 Asia and South Pacific Design Automation Conference
Optimizing Processing of Query Subscription in an WDM Network Environment
ITCC '00 Proceedings of the The International Conference on Information Technology: Coding and Computing (ITCC'00)
Approximating covering integer programs with multiplicity constraints
Discrete Applied Mathematics
Journal of Computer and System Sciences
On polynomial complexity of a stochastic algorithm for mixed zero-one programs
Discrete Applied Mathematics
On Concurrent Error Detection with Bounded Latency in FSMs
Proceedings of the conference on Design, automation and test in Europe - Volume 1
Probabilistic wavelet synopses
ACM Transactions on Database Systems (TODS)
End-to-end packet-scheduling in wireless ad-hoc networks
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Integer programming models for computational biology problems
Journal of Computer Science and Technology - Special issue on bioinformatics
Scheduling data transfers in a network and the set scheduling problem
Journal of Algorithms
New hardness results for congestion minimization and machine scheduling
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
The all-or-nothing multicommodity flow problem
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
DATE '03 Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Crossing number, pair-crossing number, and expansion
Journal of Combinatorial Theory Series B
Optimal oblivious routing in polynomial time
Journal of Computer and System Sciences - Special issue: STOC 2003
Approximate and dynamic rank aggregation
Theoretical Computer Science - Special papers from: COCOON 2003
Optimal Oblivious Path Selection on the Mesh
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Approximation techniques for utilitarian mechanism design
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Multicommodity flow, well-linked terminals, and routing problems
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Hardness of the undirected congestion minimization problem
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Adaptivity and approximation for stochastic packing problems
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
On the locality of bounded growth
Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
Oblivious routing on geometric networks
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
Resource mapping and scheduling for heterogeneous network processor systems
Proceedings of the 2005 ACM symposium on Architecture for networking and communications systems
Hardness of the Undirected Edge-Disjoint Paths Problem with Congestion
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Approximation Algorithms for Scheduling on Multiple Machines
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
An Approximation Algorithm for the Disjoint Paths Problem in Even-Degree Planar Graphs
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Approximation algorithms for covering/packing integer programs
Journal of Computer and System Sciences
SPIN-PAC: test compaction for speed-independent circuits
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Logarithmic hardness of the directed congestion minimization problem
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Meet and merge: Approximation algorithms for confluent flows
Journal of Computer and System Sciences - Special issue on network algorithms 2005
Constant-time distributed dominating set approximation
Distributed Computing
Dependent rounding and its applications to approximation algorithms
Journal of the ACM (JACM)
The RPR2 rounding technique for semidefinite programs
Journal of Algorithms
The NP-completeness column: The many limits on approximation
ACM Transactions on Algorithms (TALG)
New hardness results for congestion minimization and machine scheduling
Journal of the ACM (JACM)
Logarithmic hardness of the undirected edge-disjoint paths problem
Journal of the ACM (JACM)
Positive Influence and Negative Dependence
Combinatorics, Probability and Computing
Short length Menger's theorem and reliable optical routing
Theoretical Computer Science
The approximability of non-Boolean satisfiability problems and restricted integer programming
Theoretical Computer Science
Optimizing yield in global routing
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
A Semidefinite Programming Approach to Side Chain Positioning with New Rounding Strategies
INFORMS Journal on Computing
Approximation algorithms for multiprocessor scheduling under uncertainty
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Distributed approximation of capacitated dominating sets
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Truthful unsplittable flow for large capacity networks
Proceedings of the nineteenth annual ACM symposium on Parallel algorithms and architectures
Hardness of routing with congestion in directed graphs
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Approximation algorithms for stochastic and risk-averse optimization
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Cross-layer latency minimization in wireless networks with SINR constraints
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
ACM Transactions on Algorithms (TALG)
Efficient bufferless packet switching on trees and leveled networks
Journal of Parallel and Distributed Computing
Step decision rules for multistage stochastic programming: A heuristic approach
Automatica (Journal of IFAC)
On routing in VLSI design and communication networks
Discrete Applied Mathematics
On the computational complexity and effectiveness of N-hub shortest-path routing
IEEE/ACM Transactions on Networking (TON)
Infrastructure Leasing Problems
IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Computing Approximate Nash Equilibria in Network Congestion Games
SIROCCO '08 Proceedings of the 15th international colloquium on Structural Information and Communication Complexity
A Preemptive Algorithm for Maximizing Disjoint Paths on Trees
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Flows with Unit Path Capacities and Related Packing and Covering Problems
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Almost-tight hardness of directed congestion minimization
Journal of the ACM (JACM)
Expanders via random spanning trees
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Max-Weight Integral Multicommodity Flow in Spiders and High-Capacity Trees
Approximation and Online Algorithms
Near-perfect load balancing by randomized rounding
Proceedings of the forty-first annual ACM symposium on Theory of computing
Online Primal-Dual Algorithms for Covering and Packing
Mathematics of Operations Research
Scan-chain design and optimization for three-dimensional integrated circuits
ACM Journal on Emerging Technologies in Computing Systems (JETC)
A unified approach to scheduling on unrelated parallel machines
Journal of the ACM (JACM)
SEA '09 Proceedings of the 8th International Symposium on Experimental Algorithms
Improved Algorithms for Latency Minimization in Wireless Networks
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
Approximation algorithms for time-constrained scheduling on line networks
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Resource Minimization Job Scheduling
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Provably good and practically efficient algorithms for CMP dummy fill
Proceedings of the 46th Annual Design Automation Conference
A simple non-interactive pairwise key establishment scheme in sensor networks
SECON'09 Proceedings of the 6th Annual IEEE communications society conference on Sensor, Mesh and Ad Hoc Communications and Networks
X-align: improving the scan cell observability of response compactors
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Truthful unsplittable flow for large capacity networks
ACM Transactions on Algorithms (TALG)
Minimizing maximum fiber requirement in optical networks
Journal of Computer and System Sciences
Message-passing for Graph-structured Linear Programs: Proximal Methods and Rounding Schemes
The Journal of Machine Learning Research
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Combinatorial and geometric problems related to digital halftoning
Proceedings of the 11th international conference on Theoretical foundations of computer vision
Discrepancy-based digital halftoning: automatic evaluation and optimization
Proceedings of the 11th international conference on Theoretical foundations of computer vision
Approximation algorithm for directed telephone multicast problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Wavelength management in WDM rings to maximize the number of connections
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Randomly rounding rationals with cardinality constraints and derandomizations
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Convex combinations of single source unsplittable flows
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Geometric aspects of online packet buffering: an optimal randomized algorithm for two buffers
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Routing for energy minimization in the speed scaling model
INFOCOM'10 Proceedings of the 29th conference on Information communications
On the Application of Dynamic Scan Chain Partitioning for Reducing Peak Shift Power
Journal of Electronic Testing: Theory and Applications
Noninteractive pairwise key establishment for sensor networks
IEEE Transactions on Information Forensics and Security
Test-access mechanism optimization for core-based three-dimensional SOCs
Microelectronics Journal
ACM Transactions on Algorithms (TALG)
Flow-cut gaps for integer and fractional multiflows
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Top-d rank aggregation in web meta-search engine
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Algorithms and theory of computation handbook
Network-wide deployment of intrusion detection and prevention systems
Proceedings of the 6th International COnference
Edge Disjoint Paths in Moderately Connected Graphs
SIAM Journal on Computing
OR PRACTICE---Scheduling of Dynamic In-Game Advertising
Operations Research
Soft-error tolerance and mitigation in asynchronous burst-mode circuits
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
The disjoint paths problem: algorithm and structure
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Inapproximability of b-matching in k-uniform hypergraphs
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Improved algorithms for latency minimization in wireless networks
Theoretical Computer Science
Breaking o(n1/2)-approximation algorithms for the edge-disjoint paths problem with congestion two
Proceedings of the forty-third annual ACM symposium on Theory of computing
Directed spanners via flow-based linear programs
Proceedings of the forty-third annual ACM symposium on Theory of computing
Minimum congestion mapping in a cloud
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Cross-layer survivability in WDM-based networks
IEEE/ACM Transactions on Networking (TON)
Time-Slot Energy-Efficient Scheduling Algorithm for Capacity Limited Networks
GREENCOM '11 Proceedings of the 2011 IEEE/ACM International Conference on Green Computing and Communications
Geometric rounding: a dependent randomized rounding scheme
Journal of Combinatorial Optimization
The entropy rounding method in approximation algorithms
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Concentration inequalities for nonlinear matroid intersection
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Generating randomized roundings with cardinality constraints and derandomizations
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Online primal-dual algorithms for covering and packing problems
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Approximating integer quadratic programs and MAXCUT in subdense graphs
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Interference in cellular networks: the minimum membership set cover problem
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Packing trees in communication networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Heuristic approaches to service level agreements in packet networks
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Randomized rounding for routing and covering problems: experiments and improvements
SEA'10 Proceedings of the 9th international conference on Experimental Algorithms
On routing in VLSI design and communication networks
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Multi-budgeted matchings and matroid intersection via dependent rounding
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
MVP: capture-power reduction with minimum-violations partitioning for delay testing
Proceedings of the International Conference on Computer-Aided Design
Edge disjoint paths in moderately connected graphs
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Greedy approximation via duality for packing, combinatorial auctions and routing
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Roundings respecting hard constraints
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Derandomization of dimensionality reduction and SDP based algorithms
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Implementation of approximation algorithms for the multicast congestion problem
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Comparison of recovery schemes to maximize restorable throughput in multicast networks
Journal of Network and Computer Applications
Disjoint edges in topological graphs
IJCCGGT'03 Proceedings of the 2003 Indonesia-Japan joint conference on Combinatorial Geometry and Graph Theory
Approximation algorithms for edge-disjoint paths and unsplittable flow
Efficient Approximation and Online Algorithms
The lovász-local-lemma and scheduling
Efficient Approximation and Online Algorithms
An experimental study of the misdirection algorithm for combinatorial auctions
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
ViNEYard: virtual network embedding algorithms with coordinated node and link mapping
IEEE/ACM Transactions on Networking (TON)
Routing for power minimization in the speed scaling model
IEEE/ACM Transactions on Networking (TON)
Generalizing evolutionary coupling with stochastic dependencies
ASE '11 Proceedings of the 2011 26th IEEE/ACM International Conference on Automated Software Engineering
Approximation algorithms and hardness of integral concurrent flow
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Routing in undirected graphs with constant congestion
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Near-optimal solutions to large-scale facility location problems
Discrete Optimization
On dependent randomized rounding algorithms
Operations Research Letters
Approximation Techniques for Utilitarian Mechanism Design
SIAM Journal on Computing
Efficient submodular function maximization under linear packing constraints
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
On the complexity and approximation of the min-sum and min-max disjoint paths problems
ESCAPE'07 Proceedings of the First international conference on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies
Flow-cut gaps for integer and fractional multiflows
Journal of Combinatorial Theory Series B
Proceedings of the 2nd International Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications
Journal of Parallel and Distributed Computing
SPARSI: partitioning sensitive data amongst multiple adversaries
Proceedings of the VLDB Endowment
A derandomized approximation algorithm for the critical node detection problem
Computers and Operations Research
| Hi-index | 0.01 |