Algorithmic complexity in coding theory and the minimum distance problem
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
Approximation schemes for Euclidean k-medians and related problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
The approximability of NP-hard problems
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
ACM SIGACT News
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Journal of the ACM (JACM)
Optimal buy-and-hold strategies for financial markets with bounded daily returns
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Algorithmic mechanism design (extended abstract)
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
Efficient recovery from power outage (extended abstract)
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
On the complexity of the view-selection problem
PODS '99 Proceedings of the eighteenth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Scheduling multicasts on unit-capacity trees and meshes
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
On approximating rectangle tiling and packing
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Greedy strikes back: improved facility location algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Efficient approximation algorithms for the Hamming center problem
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computing nearest neighbors for moving points and applications to clustering
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Network design and improvement
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
A matter of degree: improved approximation algorithms for degree-bounded minimum spanning trees
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Strengthening integrality gaps for capacitated network design and covering problems
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
An experimental study of a simple, distributed edge coloring algorithm
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Complexity of finite-horizon Markov decision process problems
Journal of the ACM (JACM)
Key management for restricted multicast using broadcast encryption
IEEE/ACM Transactions on Networking (TON)
Space efficient bitmap indexing
Proceedings of the ninth international conference on Information and knowledge management
Generalized map coloring for use in geographical information systems
Proceedings of the 8th ACM international symposium on Advances in geographic information systems
Scheduling Classes on a College Campus
Computational Optimization and Applications
Algorithms for facility location problems with outliers
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Design and analysis of physical design algorithms
Proceedings of the 2001 international symposium on Physical design
Optimal aggregation algorithms for middleware
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
PREFER: a system for the efficient execution of multi-parametric ranked queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
A robust, optimization-based approach for approximate answering of aggregate queries
SIGMOD '01 Proceedings of the 2001 ACM SIGMOD international conference on Management of data
Latency effects on reachability in large-scale peer-to-peer networks
Proceedings of the thirteenth annual ACM symposium on Parallel algorithms and architectures
Simplifying a polygonal subdivision while keeping it simple
SCG '01 Proceedings of the seventeenth annual symposium on Computational geometry
(1 + &egr;&Bgr;)-spanner constructions for general graphs
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Approximation algorithms for constrained for constrained node weighted steiner tree problems
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Private approximation of NP-hard functions
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Algorithms for provisioning virtual private networks in the hose model
Proceedings of the 2001 conference on Applications, technologies, architectures, and protocols for computer communications
Proceedings of the 2001 international symposium on Symbolic and algebraic computation
Hardness and methods to solve CLIQUE
Journal of Computer Science and Technology
On balancing the load in a clustered web farm
ACM Transactions on Internet Technology (TOIT)
The hardness of cache conscious data placement
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Algorithm for optimal winner determination in combinatorial auctions
Artificial Intelligence
Broadcast scheduling for TDMA in wireless multihop networks
Handbook of wireless networks and mobile computing
Winner determination in combinatorial auction generalizations
Proceedings of the first international joint conference on Autonomous agents and multiagent systems: part 1
Slice and dice: a simple, improved approximate tiling recipe
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Capacitated vertex covering with applications
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Algorithms column: the vertex cover problem
ACM SIGACT News
SPARTAN: using constrained models for guaranteed-error semantic compression
ACM SIGKDD Explorations Newsletter
Minimum-energy broadcast in all-wireless networks: NP-completeness and distribution issues
Proceedings of the 8th annual international conference on Mobile computing and networking
Efficient integration of multi-hop wireless and wired networks with QoS constraints
Proceedings of the 8th annual international conference on Mobile computing and networking
Hierarchical scattered data filtering for multilevel interpolation schemes
Mathematical Methods for Curves and Surfaces
Algorithms for provisioning virtual private networks in the hose model
IEEE/ACM Transactions on Networking (TON)
Simplicity and Robustness of Fast and Frugal Heuristics
Minds and Machines
Seamster: inconspicuous low-distortion texture seam layout
Proceedings of the conference on Visualization '02
Why is Combinational ATPG Efficiently Solvable for Practical VLSI Circuits?
Journal of Electronic Testing: Theory and Applications
Journal of Electronic Testing: Theory and Applications
Scheduling Algorithms for the Broadcast Delivery of Digital Products
IEEE Transactions on Knowledge and Data Engineering
Theoretical Computer Science - Natural computing
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
Approximation algorithms for clustering to minimize the sum of diameters
Nordic Journal of Computing
On the Boosting Pruning Problem
ECML '00 Proceedings of the 11th European Conference on Machine Learning
A 2-Approximation for Minimum Cost {0, 1, 2} Vertex Connectivity
Proceedings of the 8th International IPCO Conference on Integer Programming and Combinatorial Optimization
A New Approach to Fault-Tolerant Wormhole Routing for Mesh-Connected Parallel Computers
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Computational and Structural Aspects of Openly Specified Type Hierarchies
LACL '98 Selected papers from the Third International Conference, on Logical Aspects of Computational Linguistics
New Algorithms for k -SAT Based on the Local Search Principle
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Approximability of the Minimum Bisection Problem: An Algorithmic Challenge
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Approximation Algorithms for the Label-CoverMAX and Red-Blue Set Cover Problems
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Approximation Algorithms for Clustering to Minimize the Sum of Diameters
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Fixed Parameter Algorithms for PLANAR DOMINATING SET and Related Problems
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Linear Time Approximation Schemes for Vehicle Scheduling
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Fast Optimal Genome Tiling with Applications to Microarray Design and Homology Search
WABI '02 Proceedings of the Second International Workshop on Algorithms in Bioinformatics
Seller-Focused Algorithms for Online Auctioning
WADS '01 Proceedings of the 7th International Workshop on Algorithms and Data Structures
Adaptive Outsourcing in Cross-Organizational Workflows
CAiSE '99 Proceedings of the 11th International Conference on Advanced Information Systems Engineering
Fast Approximation Schemes for Euclidean Multi-connectivity Problems
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Strong Inapproximability of the Basic k-Spanner Problem
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Theoretical Aspects of Evolutionary Algorithms
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Reverse Center Location Problem
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
On Efficient Fixed Parameter Algorithms for WEIGHTED VERTEX COVER
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Tight Bounds for Online Class-Constrained Packing
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
The Hardness of Approximating Spanner Problems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Approximating Maximum Edge Coloring in Multigraphs
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Quantitative Observables and Averages in Probabilistic Constraint Programming
Selected papers from the Joint ERCIM/Compulog Net Workshop on New Trends in Contraints
Value Prediction in Engineering Applications
Proceedings of the 14th International conference on Industrial and engineering applications of artificial intelligence and expert systems: engineering of intelligent systems
Approximation Schemes for Geometric NP-Hard Problems: A Survey
FST TCS '01 Proceedings of the 21st Conference on Foundations of Software Technology and Theoretical Computer Science
Exact Sampling in Machine Scheduling Problems
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
On the Equivalence between the Primal-Dual Schema and the Local-Ratio Technique
APPROX '01/RANDOM '01 Proceedings of the 4th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems and 5th International Workshop on Randomization and Approximation Techniques in Computer Science: Approximation, Randomization and Combinatorial Optimization
Optimization Problems Categories
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
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
Some Prospects for Efficient Fixed Parameter Algorithms
SOFSEM '98 Proceedings of the 25th Conference on Current Trends in Theory and Practice of Informatics: Theory and Practice of Informatics
Stability of Approximation Algorithms for Hard Optimization Problems
SOFSEM '99 Proceedings of the 26th Conference on Current Trends in Theory and Practice of Informatics on Theory and Practice of Informatics
From Algorithm to Program to Software Library
Informatics - 10 Years Back. 10 Years Ahead.
Towards Making Broadcast Encryption Practical
FC '99 Proceedings of the Third International Conference on Financial Cryptography
A Fast Multi-scale Method for Drawing Large Graphs
GD '00 Proceedings of the 8th International Symposium on Graph Drawing
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Cluster Graph Modification Problems
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Budgeted Maximum Graph Coverage
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Approximation Algorithms for Hamming Clustering Problems
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
Improving Static Compression Schemes by Alphabet Extension
COM '00 Proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching
A 2 1/10-Approximation Algorithm for a Generalization of the Weighted Edge-Dominating Set Problem
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
ESA '00 Proceedings of the 8th Annual European Symposium on Algorithms
Strongly Competitive Algorithms for Caching with Pipelined Prefetching
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
On the Approximability of the Minimum Test Collection Problem
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Combining Arithmetic and Geometric Rounding Techniques for Knapsack Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope
AISC '02/Calculemus '02 Proceedings of the Joint International Conferences on Artificial Intelligence, Automated Reasoning, and Symbolic Computation
The Hardness of Placing Street Names in a Manhattan Type Map
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Graph Drawing by High-Dimensional Embedding
GD '02 Revised Papers from the 10th International Symposium on Graph Drawing
Simple Algorithms for a Weighted Interval Selection Problem
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
The competitive ratio for on-line dual bin packing with restricted input sequences
Nordic Journal of Computing
Interval selection: applications, algorithms, and lower bounds
Journal of Algorithms
The view selection problem for XML content based routing
Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Combinatorial algorithms for feedback problems in directed graphs
Information Processing Letters
On the solution of reroute sequence planning problem in MPLS networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
A Short Guide To Approximation Preserving Reductions
CCC '97 Proceedings of the 12th Annual IEEE Conference on Computational Complexity
A Method for Real-Time Scheduling Problems
WORDS '97 Proceedings of the 3rd Workshop on Object-Oriented Real-Time Dependable Systems - (WORDS '97)
Scheduling multicasts on unit-capacity trees and meshes
Journal of Computer and System Sciences
On efficient fixed-parameter algorithms for weighted vertex cover
Journal of Algorithms
Optimal aggregation algorithms for middleware
Journal of Computer and System Sciences - Special issu on PODS 2001
Billboard clouds for extreme model simplification
ACM SIGGRAPH 2003 Papers
Machine learning with data dependent hypothesis classes
The Journal of Machine Learning Research
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
Progressive scattered data filtering
Journal of Computational and Applied Mathematics
Guaranteed scheduling for switches with configuration overhead
IEEE/ACM Transactions on Networking (TON)
Graphical Models - Special issue on SMI 2002
Algorithms and applications for answering ranked queries using ranked views
The VLDB Journal — The International Journal on Very Large Data Bases
Hardness results and approximation algorithms of k-tuple domination in graphs
Information Processing Letters
A New Approach to Fault-Tolerant Wormhole Routing for Mesh-Connected Parallel Computers
IEEE Transactions on Computers
On approximability of linear ordering and related NP-optimization problems on graphs
Discrete Applied Mathematics - The 1st cologne-twente workshop on graphs and combinatorial optimization (CTW 2001)
Approximation schemes for Metric Bisection and partitioning
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A general approach to online network optimization problems
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
A 2-approximation NC algorithm for connected vertex cover and tree cover
Information Processing Letters
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Scheduling data transfers in a network and the set scheduling problem
Journal of Algorithms
Approximation schemes for parallel machine scheduling problems with controllable processing times
Computers and Operations Research
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Tight bounds for online class-constrained packing
Theoretical Computer Science - Latin American theorotical informatics
Approximating a collection of frequent sets
Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining
Dynamic abstraction in reinforcement learning via clustering
ICML '04 Proceedings of the twenty-first international conference on Machine learning
Strongly competitive algorithms for caching with pipelined prefetching
Information Processing Letters - Devoted to the rapid publication of short contributions to information processing
Parameterized complexity: exponential speed-up for planar graph problems
Journal of Algorithms
Index Selection for Databases: A Hardness Study and a Principled Heuristic Solution
IEEE Transactions on Knowledge and Data Engineering
Approximation algorithms for partial covering problems
Journal of Algorithms
Finding the most interesting correlations in a database: how hard can it be?
Information Systems
Linear time approximation schemes for vehicle scheduling problems
Theoretical Computer Science - Special issue: Online algorithms in memoriam, Steve Seiden
Cluster graph modification problems
Discrete Applied Mathematics - Discrete mathematics & data mining (DM & DM)
An experimental study of a simple, distributed edge-coloring algorithm
Journal of Experimental Algorithmics (JEA)
Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 1935-2004
ACM Computing Surveys (CSUR)
Efficient integration of multihop wireless and wired networks with QoS constraints
IEEE/ACM Transactions on Networking (TON)
Floating-point sparse matrix-vector multiply for FPGAs
Proceedings of the 2005 ACM/SIGDA 13th international symposium on Field-programmable gate arrays
The Korean Journal of Computational & Applied Mathematics
Adaptive Caching for Continuous Queries
ICDE '05 Proceedings of the 21st International Conference on Data Engineering
A Realistic Network/Application Model for Scheduling Divisible Loads on Large-Scale Platforms
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Distributed approximation: a survey
ACM SIGACT News
Computational Geometry: Theory and Applications - Special issue on the 19th European workshop on computational geometry - EuroCG 03
An Analysis of Totally Clairvoyant Scheduling
Journal of Scheduling
Approximation algorithm for weighted weak vertex cover
Journal of Computer Science and Technology
Proceedings of the 27th international conference on Software engineering
Some remarks on Hajós' conjecture
Journal of Combinatorial Theory Series B
Substructure similarity search in graph databases
Proceedings of the 2005 ACM SIGMOD international conference on Management of data
An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
Information Processing Letters
The effect of machine availability on the worst-case performance of LPT
Discrete Applied Mathematics
Meta-RaPs approach for the 0-1 multidimensional Knapsack problem
Computers and Industrial Engineering - Special issue: Selected papers from the 31st international conference on computers & industrial engineering
A general approach for incremental approximation and hierarchical clustering
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Target tracking with distributed sensors: the focus of attention problem
Computer Vision and Image Understanding - Special issue: Attention and performance in computer vision
On the typical case complexity of graph optimization
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Approximation and streaming algorithms for histogram construction problems
ACM Transactions on Database Systems (TODS)
Wavelength assignment for multicast in all-optical WDM networks with splitting constraints
IEEE/ACM Transactions on Networking (TON)
APX-hardness of domination problems in circle graphs
Information Processing Letters
Broadcasting in unstructured peer-to-peer overlay networks
Theoretical Computer Science - Complex networks
Hybrid rounding techniques for knapsack problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
The hardness of cache conscious data placement
Nordic Journal of Computing
Energy-efficient broadcasting in all-wireless networks
Wireless Networks
On the multi-radius cover problem
Information Processing Letters
AIA'06 Proceedings of the 24th IASTED international conference on Artificial intelligence and applications
Efficient approximation algorithms for the achromatic number
Theoretical Computer Science - Approximation and online algorithms
Finding diversity in remote code injection exploits
Proceedings of the 6th ACM SIGCOMM conference on Internet measurement
A new family of proximity graphs: class cover catch digraphs
Discrete Applied Mathematics
The averaged mappings problem: statement, applications, and approximate solution
Proceedings of the 44th annual Southeast regional conference
Feature-based similarity search in graph structures
ACM Transactions on Database Systems (TODS)
Extracting Actionable Knowledge from Decision Trees
IEEE Transactions on Knowledge and Data Engineering
Designing small keyboards is hard
Theoretical Computer Science
A general approach to online network optimization problems
ACM Transactions on Algorithms (TALG)
Rectangle covers revisited computationally
Journal of Experimental Algorithmics (JEA)
The maximum resource bin packing problem
Theoretical Computer Science
The strong metric dimension of graphs and digraphs
Discrete Applied Mathematics
Polynomial time approximation schemes and parameterized complexity
Discrete Applied Mathematics
Approximation algorithms for the Label-CoverMAX and Red-Blue Set Cover problems
Journal of Discrete Algorithms
The inverse protein folding problem on 2D and 3D lattices
Discrete Applied Mathematics
Linear Complementarity as a General Solution Method to Combinatorial Problems
INFORMS Journal on Computing
Optimized stratified sampling for approximate query processing
ACM Transactions on Database Systems (TODS)
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
Theoretical Computer Science
Approximating minimum bounded degree spanning trees to within one of optimal
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Primal-dual approximation algorithms for the Prize-Collecting Steiner Tree Problem
Information Processing Letters
An Empirical Study of Test Case Filtering Techniques Based on Exercising Information Flows
IEEE Transactions on Software Engineering
Multiobjective network design for realistic traffic models
Proceedings of the 9th annual conference on Genetic and evolutionary computation
Efficient approximation of convex recolorings
Journal of Computer and System Sciences
A two-phase approach to interactivity enhancement for large-scale distributed virtual environments
Computer Networks: The International Journal of Computer and Telecommunications Networking
A lower bound for scheduling mechanisms
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Approximation algorithms for node-weighted buy-at-bulk network design
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Maximizing throughput for optical burst switching networks
IEEE/ACM Transactions on Networking (TON)
Energy efficient multicast routing in ad hoc wireless networks
Computer Communications
Example-driven design of efficient record matching queries
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Towards graph containment search and indexing
VLDB '07 Proceedings of the 33rd international conference on Very large data bases
Batch processing with interval graph compatibilities between tasks
Discrete Applied Mathematics
Set connectivity problems in undirected graphs and the directed Steiner network problem
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Proceedings of the 2008 Asia and South Pacific Design Automation Conference
An overlay network for replica placement within a P2P VoD network
International Journal of High Performance Computing and Networking
An improved approximation algorithm for maximum edge 2-coloring in simple graphs
Journal of Discrete Algorithms
Self-monitoring for sensor networks
Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing
Hardness of optimal spaced seed design
Journal of Computer and System Sciences
Simultaneous matchings: Hardness and approximation
Journal of Computer and System Sciences
Group-strategyproof cost sharing mechanisms for makespan and other scheduling problems
Theoretical Computer Science
The Generalized Maximum Coverage Problem
Information Processing Letters
Optimal combinatorial electricity markets
Web Intelligence and Agent Systems
Locating dependence structures using search-based slicing
Information and Software Technology
Computer Vision and Image Understanding
An Improved Approximation Algorithm for Maximum Edge 2-Coloring in Simple Graphs
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement
AAIM '08 Proceedings of the 4th international conference on Algorithmic Aspects in Information and Management
An Efficient Algorithm for 2D Euclidean 2-Center with Outliers
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Resource optimization algorithms for virtual private networks using the hose model
Computer Networks: The International Journal of Computer and Telecommunications Networking
The VLDB Journal — The International Journal on Very Large Data Bases
On effective presentation of graph patterns: a structural representative approach
Proceedings of the 17th ACM conference on Information and knowledge management
Inter-domain policy violations in multi-hop overlay routes: Analysis and mitigation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Maintaining CDS in Mobile Ad Hoc Networks
WASA '08 Proceedings of the Third International Conference on Wireless Algorithms, Systems, and Applications
Algorithms for the coalitional manipulation problem
Artificial Intelligence
Improved approximation algorithms for scheduling with fixed jobs
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
The maximum weight hierarchy matching problem
Information Fusion
Proceedings of the Second ACM International Conference on Web Search and Data Mining
Object Caching for Queries and Updates
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
On approximating optimum repairs for functional dependency violations
Proceedings of the 12th International Conference on Database Theory
Towards a covered and connected body sensor network for healthcare applications
Proceedings of the 2nd International Workshop on Systems and Networking Support for Health Care and Assisted Living Environments
A theory-based decision heuristic for DPLL(T)
Proceedings of the 2008 International Conference on Formal Methods in Computer-Aided Design
Optimal monitoring in multi-channel multi-radio wireless mesh networks
Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing
Note: Minimal achievable approximation ratio for MAX-MQ in finite fields
Theoretical Computer Science
Instance optimal query processing in spatial networks
The VLDB Journal — The International Journal on Very Large Data Bases
The Journal of Supercomputing
Cartesian contour: a concise representation for a collection of frequent sets
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining
Routing and Aggregation Strategies for Contour Map Applications in Sensor Networks
WWIC 2009 Proceedings of the 7th International Conference on Wired/Wireless Internet Communications
Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation
Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability
Algorithmics of Large and Complex Networks
The Design of Competitive Online Algorithms via a Primal: Dual Approach
Foundations and Trends® in Theoretical Computer Science
ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Parsimony Score of Phylogenetic Networks: Hardness Results and a Linear-Time Heuristic
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
Efficient approximation algorithms for clustering point-sets
Computational Geometry: Theory and Applications
Sample selection for statistical parsers: cognitively driven algorithms and evaluation measures
CoNLL '09 Proceedings of the Thirteenth Conference on Computational Natural Language Learning
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
On the value of good advice: the complexity of A* search with accurate heuristics
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
Approximating maximum edge 2-coloring in simple graphs via local improvement
Theoretical Computer Science
Quincy: fair scheduling for distributed computing clusters
Proceedings of the ACM SIGOPS 22nd symposium on Operating systems principles
Hardness results and approximation algorithms for (weighted) paired-domination in graphs
Theoretical Computer Science
Approximating the maximum 2- and 3-edge-colorable subgraph problems
Discrete Applied Mathematics
Target tracking with distributed sensors: The focus of attention problem
Computer Vision and Image Understanding - Special issue: Attention and performance in computer vision
Journal of Discrete Algorithms
Drawing graphs by eigenvectors: theory and practice
Computers & Mathematics with Applications
Clustered population differential evolution approach to quadratic assignment problem
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Subspace Discovery for Promotion: A Cell Clustering Approach
DS '09 Proceedings of the 12th International Conference on Discovery Science
Covering Games: Approximation through Non-cooperation
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
A mean field approach for optimization in particle systems and applications
Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
The effect of machine availability on the worst-case performance of LPT
Discrete Applied Mathematics
Cluster graph modification problems
Discrete Applied Mathematics
On the typical case complexity of graph optimization
Discrete Applied Mathematics
Hybrid rounding techniques for knapsack problems
Discrete Applied Mathematics - Special issue: Efficient algorithms
An LP rounding algorithm for approximating uncapacitated facility location problem with penalties
Information Processing Letters
APX-hardness of domination problems in circle graphs
Information Processing Letters
Coverage and connected coverage problems for sensors embedded in a temperature-sensitive environment
International Journal of Sensor Networks
An improved approximation algorithm for vertex cover with hard capacities
Journal of Computer and System Sciences
Multicriteria network design using evolutionary algorithm
GECCO'03 Proceedings of the 2003 international conference on Genetic and evolutionary computation: PartII
maximizing the guarded boundary of an art gallery is APX-complete
CIAC'03 Proceedings of the 5th Italian conference on Algorithms and complexity
From digital plane segmentation to polyhedral representation
Proceedings of the 11th international conference on Theoretical foundations of computer vision
An improved approximation algorithm for vertex cover with hard capacities
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
Approximation schemes for degree-restricted MST and red-blue separation problem
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
ISBRA'07 Proceedings of the 3rd international conference on Bioinformatics research and applications
A generic program for minimal subsets with applications
LOPSTR'02 Proceedings of the 12th international conference on Logic based program synthesis and transformation
Cost sharing methods for makespan and completion time scheduling
STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Euclidean shortest paths in simple cube curves at a glance
CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
Proceedings of the 19th international conference on World wide web
Exploiting query reformulations for web search result diversification
Proceedings of the 19th international conference on World wide web
On the running time analysis of the (1+1) evolutionary algorithm for the subset sum problem
LSMS'07 Proceedings of the Life system modeling and simulation 2007 international conference on Bio-Inspired computational intelligence and applications
Approximation of partial capacitated vertex cover
ESA'07 Proceedings of the 15th annual European conference on Algorithms
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Approximation algorithm for the kinetic robust K-center problem
Computational Geometry: Theory and Applications
Integer optimization by local search: a domain-independent approach
Integer optimization by local search: a domain-independent approach
Optimal parameterized rectangular coverings
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
More efficient algorithms for closest string and substring problems
RECOMB'08 Proceedings of the 12th annual international conference on Research in computational molecular biology
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Computational analysis and efficient algorithms for micro and macro OFDMA downlink scheduling
IEEE/ACM Transactions on Networking (TON)
IEEE/ACM Transactions on Networking (TON)
Fast connected dominating set construction in mobile ad hoc networks
ICC'09 Proceedings of the 2009 IEEE international conference on Communications
There is no EPTAS for two-dimensional knapsack
Information Processing Letters
Message-efficient CDS construction in MANETs
ISWPC'10 Proceedings of the 5th IEEE international conference on Wireless pervasive computing
Approximating maximum edge 2-coloring in simple graphs
Discrete Applied Mathematics
Analytical and experimental comparison of six algorithms for the vertex cover problem
Journal of Experimental Algorithmics (JEA)
Expansion and search in networks
CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
A game-theoretic method of fair resource allocation for cloud computing services
The Journal of Supercomputing
Multiple genome alignment based on longest path in directed acyclic graphs
International Journal of Bioinformatics Research and Applications
Approximating maximum edge 2-coloring in simple graphs
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Some results on incremental vertex cover problem
AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Bayesian reasoning for software testing
Proceedings of the FSE/SDP workshop on Future of software engineering research
Algorithms and theory of computation handbook
Advanced combinatorial algorithms
Algorithms and theory of computation handbook
Approximation algorithms for NP-hard optimization problems
Algorithms and theory of computation handbook
Solving MINONES-2-SAT as fast as VERTEX COVER
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Exploiting conflict structures in inconsistent databases
ADBIS'10 Proceedings of the 14th east European conference on Advances in databases and information systems
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Minimum vertex cover in rectangle graphs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Polyhedral and algorithmic properties of quantified linear programs
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Pipelining-based tradeoffs for hardware/software codesign of multimedia systems
EURO-PDP'00 Proceedings of the 8th Euromicro conference on Parallel and distributed processing
Set connectivity problems in undirected graphs and the directed steiner network problem
ACM Transactions on Algorithms (TALG)
Fault-tolerant routing: k-inconnected many-to-one routing in wireless networks
Theoretical Computer Science
Shortest path and maximum flow problems in networks with additive losses and gains
Theoretical Computer Science
Information Processing Letters
A mean field approach for optimization in discrete time
Discrete Event Dynamic Systems
Pareto optimality and multiobjective trajectory planning for a 7-DOF redundant manipulator
IEEE Transactions on Robotics
Uniform unweighted set cover: The power of non-oblivious local search
Theoretical Computer Science
On-the-fly elimination of dynamic irregularities for GPU computing
Proceedings of the sixteenth international conference on Architectural support for programming languages and operating systems
More Efficient Algorithms for Closest String and Substring Problems
SIAM Journal on Computing
Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design
SIAM Journal on Computing
Buy-at-Bulk Network Design with Protection
Mathematics of Operations Research
Competitive ratio of List Scheduling on uniform machines and randomized heuristics
Journal of Scheduling
An approximation algorithm for computing minimum-length polygons in 3D images
ACCV'10 Proceedings of the 10th Asian conference on Computer vision - Volume Part IV
Minimum vertex cover in rectangle graphs
Computational Geometry: Theory and Applications
How well can primal-dual and local-ratio algorithms perform?
ACM Transactions on Algorithms (TALG)
Introduction to testing graph properties
Property testing
Transitive-closure spanners: a survey
Property testing
Introduction to testing graph properties
Property testing
Transitive-closure spanners: a survey
Property testing
Video distribution under multiple constraints
Theoretical Computer Science
A full derandomization of schöning's k-SAT algorithm
Proceedings of the forty-third annual ACM symposium on Theory of computing
Selecting a comprehensive set of reviews
Proceedings of the 17th ACM SIGKDD international conference on Knowledge discovery and data mining
Entity matching: how similar is similar
Proceedings of the VLDB Endowment
A dynamic data middleware cache for rapidly-growing scientific repositories
Proceedings of the ACM/IFIP/USENIX 11th International Conference on Middleware
A generalization of Nemhauser and Trotter's local optimization theorem
Journal of Computer and System Sciences
Primal-dual approximation algorithms for node-weighted steiner forest on planar graphs
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Studies in complexity and cryptography
Introduction to testing graph properties
Studies in complexity and cryptography
Studies in complexity and cryptography
Contemplations on testing graph properties
Studies in complexity and cryptography
Discrete Applied Mathematics
Selection of the most suitable measurement path for router abnormality detection
CSCS '11 Proceedings of the 2nd international conference on Circuits, systems, control, signals
The price of optimum in a matching game
SAGT'11 Proceedings of the 4th international conference on Algorithmic game theory
Approximation of Partial Capacitated Vertex Cover
SIAM Journal on Discrete Mathematics
A General Approach for Incremental Approximation and Hierarchical Clustering
SIAM Journal on Computing
Hardness of approximation results for the problem of finding the stopping distance in tanner graphs
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
On the rectangular subset closure of point sets
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and its Applications - Volume Part I
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
An optimal rebuilding strategy for a decremental tree problem
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
How to place efficiently guards and paintings in an art gallery
PCI'05 Proceedings of the 10th Panhellenic conference on Advances in Informatics
Efficiently passive monitoring flow bandwidth
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
Distributed active measuring link bandwidth in IP networks
NPC'05 Proceedings of the 2005 IFIP international conference on Network and Parallel Computing
DCOSS'06 Proceedings of the Second IEEE international conference on Distributed Computing in Sensor Systems
Complexity and approximation of fixing numerical attributes in databases under integrity constraints
DBPL'05 Proceedings of the 10th international conference on Database Programming Languages
A faster combinatorial approximation algorithm for scheduling unrelated parallel machines
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Algorithmic and complexity issues of three clustering methods in microarray data analysis
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Voronoi-Based improved algorithm for connected coverage problem in wireless sensor networks
EUC'05 Proceedings of the 2005 international conference on Embedded and Ubiquitous Computing
Walrasian equilibrium: hardness, approximations and tractable instances
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Algorithms for rectangular covering problems
ICCSA'06 Proceedings of the 6th international conference on Computational Science and Its Applications - Volume Part I
International Journal of Sensor Networks
Explicit search result diversification through sub-queries
ECIR'2010 Proceedings of the 32nd European conference on Advances in Information Retrieval
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On approximating complex quadratic optimization problems via semidefinite programming relaxations
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
A primal-dual approximation algorithm for partial vertex cover: making educated guesses
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
Efficient approximation of convex recolorings
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
The pipelined set cover problem
ICDT'05 Proceedings of the 10th international conference on Database Theory
Test case filtering and prioritization based on coverage of combinations of program elements
WODA '09 Proceedings of the Seventh International Workshop on Dynamic Analysis
An approximation algorithm for weak vertex cover problem in network management
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Multiobjective EA approach for improved quality of solutions for spanning tree problem
EMO'05 Proceedings of the Third international conference on Evolutionary Multi-Criterion Optimization
Worst-case and average-case approximations by simple randomized search heuristics
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Totally clairvoyant scheduling with relative timing constraints
VMCAI'06 Proceedings of the 7th international conference on Verification, Model Checking, and Abstract Interpretation
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Efficient algorithms for the longest path problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Algorithms for detecting significantly mutated pathways in cancer
RECOMB'10 Proceedings of the 14th Annual international conference on Research in Computational Molecular Biology
Optimizing the stretch of independent tasks on a cluster: From sequential tasks to moldable tasks
Journal of Parallel and Distributed Computing
The maximum resource bin packing problem
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Running time analysis of a multiobjective evolutionary algorithm on simple and hard problems
FOGA'05 Proceedings of the 8th international conference on Foundations of Genetic Algorithms
Rectangle covers revisited computationally
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Vertex cover approximations: experiments and observations
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Fixed-parameter approximation: conceptual framework and approximability results
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Theoretical Computer Science
The power of semidefinite programming relaxations for MAX-SAT
CPAIOR'06 Proceedings of the Third international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
CPAIOR'10 Proceedings of the 7th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Matching based augmentations for approximating connectivity problems
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
SDSAT: tight integration of small domain encoding and lazy approaches in a separation logic solver
TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Optimizing budget allocation among channels and influencers
Proceedings of the 21st international conference on World Wide Web
Approximation algorithm for security games with costly resources
WINE'11 Proceedings of the 7th international conference on Internet and Network Economics
A population-based iterated greedy algorithm for the minimum weight vertex cover problem
Applied Soft Computing
Tight approximation algorithms for scheduling with fixed jobs and nonavailability
ACM Transactions on Algorithms (TALG)
Approximation of the Quadratic Set Covering problem
Discrete Optimization
On approximation of the vertex cover problem in hypergraphs
Discrete Optimization
Approximation algorithms for fractional knapsack problems
Operations Research Letters
Local ratio with negative weights
Operations Research Letters
crdbrd: Shape Fabrication by Sliding Planar Slices
Computer Graphics Forum
NP-completeness and APX-completeness of restrained domination in graphs
Theoretical Computer Science
Parameterized approximation via fidelity preserving transformations
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Combination of parallel machine scheduling and vertex cover
Theoretical Computer Science
On the role of novelty for search result diversification
Information Retrieval
A lower bound of 1 + ϕ for truthful scheduling mechanisms
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Generating ontologies via language components and ontology reuse
NLDB'07 Proceedings of the 12th international conference on Applications of Natural Language to Information Systems
Resolving spatial inconsistencies in chromosome conformation data
WABI'12 Proceedings of the 12th international conference on Algorithms in Bioinformatics
Approximating infeasible 2VPI-systems
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Efficient location-based decision-supporting content distribution to mobile groups
IEEE/ACM Transactions on Networking (TON)
Secure local algorithm for establishing a virtual backbone in 3D ad hoc network
International Journal of Networking and Virtual Organisations
Approximation Algorithms for Capacitated Location Routing
Transportation Science
Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming
The time complexity of A* with approximate heuristics on multiple-solution search spaces
Journal of Artificial Intelligence Research
A Two-Stage Approach for Network Monitoring
Journal of Network and Systems Management
On some network design problems with degree constraints
Journal of Computer and System Sciences
Approximating vertex cover using edge-based representations
Proceedings of the twelfth workshop on Foundations of genetic algorithms XII
Future Generation Computer Systems
Diversified recommendation on graphs: pitfalls, measures, and algorithms
Proceedings of the 22nd international conference on World Wide Web
A survey of pipelined workflow scheduling: Models and algorithms
ACM Computing Surveys (CSUR)
Using maximum coverage to optimize recommendation systems in e-commerce
Proceedings of the 7th ACM conference on Recommender systems
Topic diversity in tag recommendation
Proceedings of the 7th ACM conference on Recommender systems
Most Tensor Problems Are NP-Hard
Journal of the ACM (JACM)
Hierarchical community decomposition via oblivious routing techniques
Proceedings of the first ACM conference on Online social networks
Anytime algorithms for mining groups with maximum coverage
AusDM '12 Proceedings of the Tenth Australasian Data Mining Conference - Volume 134
Solving min ones 2-sat as fast as vertex cover
Theoretical Computer Science
Computers and Operations Research
Minimal broker overlay design for content-based publish/subscribe systems
CASCON '13 Proceedings of the 2013 Conference of the Center for Advanced Studies on Collaborative Research
Scalable skyline computation using a balanced pivot selection technique
Information Systems
A novel parameterised approximation algorithm for minimum vertex cover
Theoretical Computer Science
| Hi-index | 0.02 |