Trading group theory for randomness
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Multi-prover interactive proofs: how to remove intractability assumptions
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Self-testing/correcting with applications to numerical problems
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Self-testing/correcting for polynomials and for approximate functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Approximating clique is almost NP-complete (preliminary version)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Fully parallelized multi prover protocols for NEXP-time (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
A mathematical theory of self-checking, self-testing and self-correcting programs
A mathematical theory of self-checking, self-testing and self-correcting programs
Two-prover one-round proof systems: their power and their problems (extended abstract)
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Self-testing polynomial functions efficiently and over rational domains
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
Algebraic methods for interactive proof systems
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Efficient probabilistically checkable proofs and applications to approximations
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Efficient checking of polynomials and proofs and the hardness of approximation problems
Efficient checking of polynomials and proofs and the hardness of approximation problems
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Testing of the long code and hardness for clique
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Some optimal inapproximability results
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Improved low-degree testing and its applications
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
Clique is hard to approximate within n1-
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Improved low-degree testing and its applications
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Proof verification and the hardness of approximation problems
Journal of the ACM (JACM)
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
PCP characterizations of NP: towards a polynomially-small error-probability
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Covering rectilinear polygons with axis-parallel rectangles
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A polylogarithmic approximation algorithm for the group Steiner tree problem
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A PCP characterization of NP with optimal amortized query complexity
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Converter Placement Supporting Broadcast in WDM Optical Networks
IEEE Transactions on Computers
The importance of being biased
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Vertex cover on 4-regular hyper-graphs is hard to approximate within 2 - &egr;
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Information and Computation
An approximation algorithm for the group Steiner problem
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Sublogarithmic approximation for telephone multicast: path out of jungle (extended abstract)
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation Algorithms for a Directed Network Design Problem
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Improved Approximation Algorithms for Capacitated Facility Location Problems
Proceedings of the 7th International IPCO Conference on Integer Programming and Combinatorial Optimization
Hardness of Set Cover with Intersection 1
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Small PCPs with Low Query Complexity
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
On the Domination Search Number
WG '00 Proceedings of the 26th International Workshop on Graph-Theoretic Concepts in Computer Science
Approximation Algorithms for the Traveling Purchaser Problem and its Variants in Network Design
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
Polylogarithmic inapproximability
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Randomness-efficient low degree tests and short PCPs via epsilon-biased sets
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Algebraic testing and weight distributions of codes
Theoretical Computer Science
Constraint Satisfaction: The Approximability of Minimization Problems
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
Hardness of Approximating Minimization Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
On the domination search number
Discrete Applied Mathematics
On a Minimum Linear Classification Problem
Journal of Global Optimization
Approximating covering integer programs with multiplicity constraints
Discrete Applied Mathematics
On the number of distributed measurement points for network tomography
Proceedings of the 3rd ACM SIGCOMM conference on Internet measurement
A new approach for approximating node deletion problems
Information Processing Letters
Algorithms for graphs with small octopus
Discrete Applied Mathematics
A Network Improvement Problem Under Different Norms
Computational Optimization and Applications
On the hardness of approximating label-cover
Information Processing Letters
A new PCP outer verifier with applications to homogeneous linear equations and max-bisection
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Concurrent open shop scheduling to minimize the weighted number of tardy jobs
Journal of Scheduling
Journal of Computer and System Sciences - Special issue on FOCS 2002
Approximating cost-based abduction is NP-hard
Artificial Intelligence
On the complexity of fixed parameter clique and dominating set
Theoretical Computer Science
Optimal covering designs: complexity results and new bounds
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Towards strong nonapproximability results in the Lovasz-Schrijver hierarchy
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Derandomizing polynomial identity tests means proving circuit lower bounds
Computational Complexity
Iterative Dutch combinatorial auctions
Annals of Mathematics and Artificial Intelligence
Quantum Information and the PCP Theorem
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Combination can be hard: approximability of the unique coverage problem
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The labeled perfect matching in bipartite graphs
Information Processing Letters
Approximation algorithms for covering/packing integer programs
Journal of Computer and System Sciences
On the complexity of approximating tsp with neighborhoods and related problems
Computational Complexity
Vertex covering by paths on trees with its applications in machine translation
Information Processing Letters
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
Sub-constant error low degree test of almost-linear size
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The minimum-entropy set cover problem
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
Robust locally testable codes and products of codes
Random Structures & Algorithms
On a Minimum Linear Classification Problem
Journal of Global Optimization
On the Independent Domination Number of Random Regular Graphs
Combinatorics, Probability and Computing
Randomized greedy algorithms for finding small k-dominating sets of regular graphs
Random Structures & Algorithms
Algorithmic construction of sets for k-restrictions
ACM Transactions on Algorithms (TALG)
Locally testable codes and PCPs of almost-linear length
Journal of the ACM (JACM)
Completeness in approximation classes beyond APX
Theoretical Computer Science
The approximability of non-Boolean satisfiability problems and restricted integer programming
Theoretical Computer Science
Designing small keyboards is hard
Theoretical Computer Science
New primal-dual algorithms for Steiner tree problems
Computers and Operations Research
Computer Networks: The International Journal of Computer and Telecommunications Networking
Tree-edges deletion problems with bounded diameter obstruction sets
Discrete Applied Mathematics
On-line optimal wavelength assignment in WDM networks with shared wavelength converter pool
IEEE/ACM Transactions on Networking (TON)
Admission control with advance reservations in simple networks
Journal of Discrete Algorithms
Decision trees for entity identification: approximation algorithms and hardness results
Proceedings of the twenty-sixth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Island hopping and path colouring with applications to WDM network design
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Constructing battery-aware virtual backbones in wireless sensor networks
EURASIP Journal on Wireless Communications and Networking
Computational Geometry: Theory and Applications
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
ACM Transactions on Algorithms (TALG)
Uniform direct product theorems: simplified, optimized, and derandomized
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Tight approximation algorithm for connectivity augmentation problems
Journal of Computer and System Sciences
A note on two source location problems
Journal of Discrete Algorithms
PCPs with small soundness error
ACM SIGACT News
Universal Attribute Reduction Problem
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Optimally Learning Social Networks with Activations and Suppressions
ALT '08 Proceedings of the 19th international conference on Algorithmic Learning Theory
The Minimum Substring Cover problem
Information and Computation
Commitment under uncertainty: Two-stage stochastic matching problems
Theoretical Computer Science
Hardness of approximate two-level logic minimization and PAC learning with membership queries
Journal of Computer and System Sciences
A Θ( logn)-approximation for the set cover problem with set ownership
Information Processing Letters
On the approximability of Dodgson and Young elections
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Universal Problem of Attribute Reduction
Transactions on Rough Sets IX
Reoptimization of Weighted Graph and Covering Problems
Approximation and Online Algorithms
Local PTAS for Dominating and Connected Dominating Set in Location Aware Unit Disk Graphs
Approximation and Online Algorithms
Reliable routings in networks with generalized link failure events
IEEE/ACM Transactions on Networking (TON)
Greedy Algorithm for Attribute Reduction
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Recent Developments in Algorithmic Teaching
LATA '09 Proceedings of the 3rd International Conference on Language and Automata Theory and Applications
PTAS for geometric hitting set problems via local search
Proceedings of the twenty-fifth annual symposium on Computational geometry
Greedy Algorithm for Construction of Partial Association Rules
Fundamenta Informaticae
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
Proceedings of the twenty-eighth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
On the Approximability of Some Haplotyping Problems
AAIM '09 Proceedings of the 5th International Conference on Algorithmic Aspects in Information and Management
On Construction of Partial Association Rules
RSKT '09 Proceedings of the 4th International Conference on Rough Sets and Knowledge Technology
Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Greedy Algorithms withWeights for Construction of Partial Association Rules
Fundamenta Informaticae
Approximating Some Network Design Problems with Node Costs
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Approximating connectivity augmentation problems
ACM Transactions on Algorithms (TALG)
ACM Transactions on Algorithms (TALG)
The Complexity of Probabilistic Lobbying
ADT '09 Proceedings of the 1st International Conference on Algorithmic Decision Theory
Approximation Algorithms for the Firefighter Problem: Cuts over Time and Submodularity
ISAAC '09 Proceedings of the 20th International Symposium on Algorithms and Computation
A greedy approximation algorithm for the group Steiner problem
Discrete Applied Mathematics
The labeled perfect matching in bipartite graphs
Information Processing Letters
Vertex covering by paths on trees with its applications in machine translation
Information Processing Letters
Pursuing a fast robber on a graph
Theoretical Computer Science
Optimization problems in multiple-interval graphs
ACM Transactions on Algorithms (TALG)
An improved approximation algorithm for vertex cover with hard capacities
Journal of Computer and System Sciences
Two-query PCP with subconstant error
Journal of the ACM (JACM)
Approximation algorithm for directed telephone multicast problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
On partial covers, reducts and decision rules with weights
Transactions on rough sets VI
On minimum power connectivity problems
ESA'07 Proceedings of the 15th annual European conference on Algorithms
Covering points by unit disks of fixed location
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Order scheduling models: hardness and algorithms
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Cost minimisation in unbounded multi-interface networks
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
New results on optimizing rooted triplets consistency
Discrete Applied Mathematics
Approximating minimum power covers of intersecting families and directed edge-connectivity problems
Theoretical Computer Science
The minimum substring cover problem
WAOA'07 Proceedings of the 5th international conference on Approximation and online algorithms
On partial covers, reducts and decision rules
Transactions on rough sets VIII
Local list-decoding and testing of random linear codes from high error
Proceedings of the forty-second ACM symposium on Theory of computing
Weighted geometric set cover via quasi-uniform sampling
Proceedings of the forty-second ACM symposium on Theory of computing
Optimally learning social networks with activations and suppressions
Theoretical Computer Science
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
On two restricted ancestors tree problems
Information Processing Letters
Scheduling to minimize power consumption using submodular functions
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Minimum factorization agreement of spliced ESTs
WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
On the hardness of approximating stopping and trapping sets
IEEE Transactions on Information Theory
On Regression-Based Stopping Times
Discrete Event Dynamic Systems
Brief announcement: exponential speed-up of local algorithms using non-local communication
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Augmenting edge-connectivity between vertex subsets
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Hardness of k-Vertex-Connected Subgraph Augmentation Problem
Journal of Combinatorial Optimization
Multi-document summarization via the minimum dominating set
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
Improved approximability and non-approximability results for graph diameter decreasing problems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Minimum dominating set approximation in graphs of bounded arboricity
DISC'10 Proceedings of the 24th international conference on Distributed computing
Decision trees for entity identification: Approximation algorithms and hardness results
ACM Transactions on Algorithms (TALG)
Information Processing Letters
An algorithmic treatment of strong queries
Proceedings of the fourth ACM international conference on Web search and data mining
Approximation algorithms for campaign management
WINE'10 Proceedings of the 6th international conference on Internet and network economics
Approximation algorithm for the minimum directed tree cover
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
An improved approximation algorithm for spanning star forest in dense graphs
COCOA'10 Proceedings of the 4th international conference on Combinatorial optimization and applications - Volume Part II
Complexity issues in vertex-colored graph pattern matching
Journal of Discrete Algorithms
Uniform unweighted set cover: The power of non-oblivious local search
Theoretical Computer Science
Teaching randomized learners with feedback
Information and Computation
Approximating covering problems by randomized search heuristics using multi-objective models*
Evolutionary Computation
Uniform Direct Product Theorems: Simplified, Optimized, and Derandomized
SIAM Journal on Computing
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
SIAM Journal on Computing
Guest column: testing linear properties: some general theme
ACM SIGACT News
Multi-VPN optimization for scalable routing via relaying
IEEE/ACM Transactions on Networking (TON)
On the discrete unit disk cover problem
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Clustering with internal connectedness
WALCOM'11 Proceedings of the 5th international conference on WALCOM: algorithms and computation
Approximation algorithms for the Fault-Tolerant Facility Placement problem
Information Processing Letters
How well can primal-dual and local-ratio algorithms perform?
ACM Transactions on Algorithms (TALG)
Limitation on the rate of families of locally testable codes
Property testing
Composition of low-error 2-query PCPs using decodable PCPs
Property testing
Some recent results on local testing of sparse linear codes
Property testing
Limitation on the rate of families of locally testable codes
Property testing
Composition of low-error 2-query PCPs using decodable PCPs
Property testing
Some recent results on local testing of sparse linear codes
Property testing
A truthful randomized mechanism for combinatorial public projects via convex optimization
Proceedings of the 12th ACM conference on Electronic commerce
Platform synthesis and partitioning of real-time tasks for energy efficiency
Journal of Systems Architecture: the EUROMICRO Journal
Approximating some network design problems with node costs
Theoretical Computer Science
Tight approximation bounds for greedy frugal coverage algorithms
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Minimum interval cover and its application to genome sequencing
COCOA'11 Proceedings of the 5th international conference on Combinatorial optimization and applications
Wireless coverage via dynamic programming
WASA'11 Proceedings of the 6th international conference on Wireless algorithms, systems, and applications
On the complexity of the l-diversity problem
MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Guard games on graphs: Keep the intruder out!
Theoretical Computer Science
A mathematical programming approach to marker-assisted gene pyramiding
WABI'11 Proceedings of the 11th international conference on Algorithms in bioinformatics
On the complexity of the regenerator placement problem in optical networks
IEEE/ACM Transactions on Networking (TON)
Internet shopping optimization problem
International Journal of Applied Mathematics and Computer Science
Journal of Combinatorial Optimization
Bounds on locally testable codes with unique tests
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
The node-weighted steiner problem in graphs of restricted node weights
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
The approximability of the exemplar breakpoint distance problem
AAIM'06 Proceedings of the Second international conference on Algorithmic Aspects in Information and Management
COLT'06 Proceedings of the 19th annual conference on Learning Theory
How well can primal-dual and local-ratio algorithms perform?
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Bucket game with applications to set multicover and dynamic page migration
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Minimum maximum-degree publish-subscribe overlay network design
IEEE/ACM Transactions on Networking (TON)
Improved approximability and non-approximability results for graph diameter decreasing problems
Theoretical Computer Science
Lower bounds on the approximation of the exemplar conserved interval distance problem of genomes
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
On complexity and approximability of the labeled maximum/perfect matching problems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On two-stage stochastic minimum spanning trees
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
The tensor product of two codes is not necessarily robustly testable
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Ranking with submodular valuations
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Tight approximation algorithm for connectivity augmentation problems
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Approximation algorithms and hardness results for labeled connectivity problems
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
Approximating the online set multicover problems via randomized winnowing
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
On the approximation ability of evolutionary optimization with application to minimum set cover
Artificial Intelligence
Guest column: algebraic construction of projection PCPs
ACM SIGACT News
Optimization problems in multiple subtree graphs
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
Approximating minimum power covers of intersecting families and directed connectivity problems
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Approximation algorithms for the k-median problem
Efficient Approximation and Online Algorithms
Approximating the unweighted k-set cover problem: greedy meets local search
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Designing hypergraph layouts to GMPLS routing strategies
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
Self-correctors for cryptographic modules
IMACC'11 Proceedings of the 13th IMA international conference on Cryptography and Coding
VSTTE'12 Proceedings of the 4th international conference on Verified Software: theories, tools, experiments
Towards certain fixes with editing rules and master data
The VLDB Journal — The International Journal on Very Large Data Bases
Adaptive submodularity: theory and applications in active learning and stochastic optimization
Journal of Artificial Intelligence Research
2log1-ε n hardness for the closest vector problem with preprocessing
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
On the approximability of Dodgson and Young elections
Artificial Intelligence
GMPLS label space minimization through hypergraph layouts
Theoretical Computer Science
Discrete sensor placement problems in distribution networks
Mathematical and Computer Modelling: An International Journal
Survey: A survey on the structure of approximation classes
Computer Science Review
Approximation of the Quadratic Set Covering problem
Discrete Optimization
An energy-efficient link quality monitoring scheme for wireless networks
Wireless Communications & Mobile Computing
SIAM Journal on Discrete Mathematics
Optimal manipulation of voting rules
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Greedy Algorithm for Construction of Partial Association Rules
Fundamenta Informaticae
Greedy Algorithms withWeights for Construction of Partial Association Rules
Fundamenta Informaticae
Greedy Algorithm for Attribute Reduction
Fundamenta Informaticae - Concurrency Specification and Programming (CS&P)
Commitment under uncertainty: two-stage stochastic matching problems
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
Fast vertex guarding for polygons with and without holes
Computational Geometry: Theory and Applications
PTAS for the minimum weighted dominating set in growth bounded graphs
Journal of Global Optimization
Differentially private data analysis of social networks via restricted sensitivity
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
New affine-invariant codes from lifting
Proceedings of the 4th conference on Innovations in Theoretical Computer Science
Multi-rooted greedy approximation of directed steiner trees with applications
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
A randomised approximation algorithm for the partial vertex cover problem in hypergraphs
MedAlg'12 Proceedings of the First Mediterranean conference on Design and Analysis of Algorithms
Constant-factor approximation of the domination number in sparse graphs
European Journal of Combinatorics
Improved approximation for spanning star forest in dense graphs
Journal of Combinatorial Optimization
On the concrete efficiency of probabilistically-checkable proofs
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Analysis of misinformation containment in online social networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Tight approximation bounds for combinatorial frugal coverage algorithms
Journal of Combinatorial Optimization
k-nearest keyword search in RDF graphs
Web Semantics: Science, Services and Agents on the World Wide Web
Unsolved problems in visibility graphs of points, segments, and polygons
ACM Computing Surveys (CSUR)
On the k-edge-incident subgraph problem and its variants
Discrete Applied Mathematics
The l-Diversity problem: Tractability and approximability
Theoretical Computer Science
On the connectivity preserving minimum cut problem
Journal of Computer and System Sciences
Dominating problems in swapped networks
Information Sciences: an International Journal
| Hi-index | 0.08 |