On approximation algorithms for local multiple alignment
RECOMB '00 Proceedings of the fourth annual international conference on Computational molecular biology
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
Convex quadratic and semidefinite programming relaxations in scheduling
Journal of the ACM (JACM)
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
A polynomial-time approximation scheme for base station positioning in UMTS networks
DIALM '01 Proceedings of the 5th international workshop on Discrete algorithms and methods for mobile computing and communications
The hardness of cache conscious data placement
POPL '02 Proceedings of the 29th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Matrix Multiplication on Heterogeneous Platforms
IEEE Transactions on Parallel and Distributed Systems
A Proposal for a Heterogeneous Cluster ScaLAPACK (Dense Linear Solvers)
IEEE Transactions on Computers
An 8/13-approximation algorithm for the asymmetric maximum TSP
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
A survey of graph layout problems
ACM Computing Surveys (CSUR)
Packing triangles in bounded degree graphs
Information Processing Letters
On the Hamming distance of constraint satisfaction problems
Theoretical Computer Science - Complexity and logic
Computational Complexity for Physicists
Computing in Science and Engineering
The inapproximability of non-NP-hard optimization problems
Theoretical Computer Science
Logical analysis of data with decomposable structures
Theoretical Computer Science
Partition-driven standard cell thermal placement
Proceedings of the 2003 international symposium on Physical design
Efficient rule-based haplotyping algorithms for pedigree data
RECOMB '03 Proceedings of the seventh annual international conference on Research in computational molecular biology
The Distribution of Values in the Quadratic Assignment Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
Approximating the Advertisement Placement Problem
Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Optimum Inapproximability Results for Finding Minimum Hidden Guard Sets in Polygons and Terrains
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Search and Optimization Problems in Datalog
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
Finding Worst-Case Instances of, and Lower Bounds for, Online Algorithms Using Genetic Algorithms
AI '02 Proceedings of the 15th Australian Joint Conference on Artificial Intelligence: Advances in Artificial Intelligence
Towards a Predictive Computational Complexity Theory
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
How Many People Can Hide in a Terrain?
ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane
ISAAC '00 Proceedings of the 11th International Conference 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 '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Approximation of a Geometric Set Covering Problem
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Non-approximability of Weighted Multiple Sequence Alignment
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
A New Measure of Edit Distance between Labeled Trees
COCOON '01 Proceedings of the 7th Annual International Conference on Computing and Combinatorics
The Full Steiner Tree Problem in Phylogeny
COCOON '02 Proceedings of the 8th Annual International Conference on Computing and Combinatorics
On Approximability of the Independent/Connected Edge Dominating Set Problems
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
FST TCS '02 Proceedings of the 22nd Conference Kanpur on Foundations of Software Technology and Theoretical Computer Science
Optimization Problems Categories
Computer Aided Systems Theory - EUROCAST 2001-Revised Papers
From Algorithm to Program to Software Library
Informatics - 10 Years Back. 10 Years Ahead.
Sharper Bounds for the Hardness of Prototype and Feature Selection
ALT '00 Proceedings of the 11th International Conference on Algorithmic Learning Theory
A Proposal of DNA Computing on Beads with Application to SAT Problems
DNA 7 Revised Papers from the 7th International Workshop on DNA-Based Computers: DNA Computing
Greedy Algorithms for Minimisation Problems in Random Regular Graphs
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
Computing Cycle Covers without Short Cycles
ESA '01 Proceedings of the 9th Annual European Symposium on Algorithms
The Complexity of Maximum Matroid-Greedoid Intersection
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Exponential Speedup of Fixed-Parameter Algorithms on K3, 3-Minor-Free or K5-Minor-Free Graphs
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
On Salesmen, Repairmen, Spiders, and Other Traveling Agents
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Simple Algorithms for a Weighted Interval Selection Problem
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Non-approximability of weighted multiple sequence alignment
Theoretical Computer Science - Computing and combinatorics
Computing small partial coverings
Information Processing Letters
Interval selection: applications, algorithms, and lower bounds
Journal of Algorithms
Transforming rapid prototypes to efficient parallel programs
Patterns and skeletons for parallel and distributed computing
The distribution of values in the quadratic assignment problem
Mathematics of Operations Research
An algorithm for the induction of defeasible logic theories from databases
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
Parameterized complexity: the main ideas and connections to practical computing
Experimental algorithmics
On efficient fixed-parameter algorithms for weighted vertex cover
Journal of Algorithms
Clustering Binary Fingerprint Vectors with Missing Values for DNA Array Data Analysis
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Multicast time maximization in energy constrained wireless networks
DIALM-POMC '03 Proceedings of the 2003 joint workshop on Foundations of mobile computing
Domination analysis of combinatorial optimization problems
Discrete Applied Mathematics
An efficient fixed-parameter algorithm for 3-hitting set
Journal of Discrete Algorithms
Worst-case upper bounds for MAX-2-SAT with an application to MAX-CUT
Discrete Applied Mathematics - The renesse issue on satisfiability
Theoretical Computer Science
ICDM '03 Proceedings of the Third IEEE International Conference on Data Mining
Scheduling divisible workloads on heterogeneous platforms
Parallel Computing - Parallel matrix algorithms and applications (PMAA '02)
Algorithms for graphs with small octopus
Discrete Applied Mathematics
A Network Improvement Problem Under Different Norms
Computational Optimization and Applications
Proceedings of the 2004 ACM symposium on Applied computing
Hardness results and approximation algorithms of k-tuple domination in graphs
Information Processing Letters
The Difficulty of Reduced Error Pruning of Leveled Branching Programs
Annals of Mathematics and Artificial Intelligence
On the power assignment problem in radio networks
Mobile Networks and Applications - Discrete algorithms and methods for mobile computing and communications
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)
The minimum likely column cover problem
Information Processing Letters
An 8/13-approximation algorithm for the asymmetric maximum TSP
Journal of Algorithms
Theoretical Computer Science
Efficient Graph-Based Image Segmentation
International Journal of Computer Vision
Hardness of approximation for non-overlapping local alignments
Discrete Applied Mathematics
Packing cycles in undirected graphs
Journal of Algorithms - Special issue: Twelfth annual ACM-SIAM symposium on discrete algorithms
Polynomial-time data reduction for dominating set
Journal of the ACM (JACM)
Experiments on the minimum linear arrangement problem
Journal of Experimental Algorithmics (JEA)
Linear FPT reductions and computational lower bounds
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Privacy: A Machine Learning View
IEEE Transactions on Knowledge and Data Engineering
Approximating the Advertisement Placement Problem
Journal of Scheduling
Proximity and priority: applying a gene expression algorithm to the Traveling Salesperson Problem
Parallel Computing - Special issue: Parallel and nature-inspired computational paradigms and applications
Resource constrained scheduling on multiple machines
Information Processing Letters
On achieving software diversity for improved network security using distributed coloring algorithms
Proceedings of the 11th ACM conference on Computer and communications security
On the complexity of vertex-disjoint length-restricted path problems
Computational Complexity
Learning Local Transductions Is Hard
Journal of Logic, Language and Information
Induction of defeasible logic theories in the legal domain
ICAIL '03 Proceedings of the 9th international conference on Artificial intelligence and law
Optimal covering designs: complexity results and new bounds
Discrete Applied Mathematics - Fun with algorithms 2 (FUN 2001)
Energy-aware variable partitioning and instruction scheduling for multibank memory architectures
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2k-SAT
Theoretical Computer Science
Approximation hardness of optimization problems in intersection graphs of d-dimensional boxes
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Designing optimally multiplexed SNP genotyping assays
Journal of Computer and System Sciences - Special issue on bioinformatics II
Efficient trigger-broadcasting in heterogeneous clusters
Journal of Parallel and Distributed Computing
The complexity of base station positioning in cellular networks
Discrete Applied Mathematics
Understanding planning with incomplete information and sensing
Artificial Intelligence
Scalable discovery of hidden emails from large folders
Proceedings of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining
VLDB '05 Proceedings of the 31st international conference on Very large data bases
The intractability of computing the Hamming distance
Theoretical Computer Science
Non-approximability of weighted multiple sequence alignment for arbitrary metrics
Information Processing Letters
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
Single-minded unlimited supply pricing on sparse instances
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A Short Proof that Phylogenetic Tree Reconstruction by Maximum Likelihood Is Hard
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
On the typical case complexity of graph optimization
Discrete Applied Mathematics - Special issue: Typical case complexity and phase transitions
Load balancing and OpenMP implementation of nested parallelism
Parallel Computing - OpenMp
Theoretical Computer Science - Parameterized and exact computation
The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization
Discrete Applied Mathematics - Special issue: Efficient algorithms
On the probabilistic minimum coloring and minimum k-coloring
Discrete Applied Mathematics
Mobility profile based routing within intermittently connected mobile ad hoc networks (ICMAN)
Proceedings of the 2006 international conference on Wireless communications and mobile computing
The hardness of cache conscious data placement
Nordic Journal of Computing
On approximate learning by multi-layered feedforward circuits
Theoretical Computer Science - Algorithmic learning theory (ALT 2000)
Completeness in approximation classes beyond APX
Theoretical Computer Science
The approximability of the weighted Hamiltonian path completion problem on a tree
Theoretical Computer Science
Theoretical Computer Science
On the differential approximation of MIN SET COVER
Theoretical Computer Science
Energetic performance of service-oriented multi-radio networks: issues and perspectives
WOSP '07 Proceedings of the 6th international workshop on Software and performance
On product covering in 3-tier supply chain models: natural complete problems for W[3] and W[4]
Theoretical Computer Science - Algorithmic applications in management
A heuristic for the Stacker Crane Problem on trees which is almost surely exact
Journal of Algorithms
Strong computational lower bounds via parameterized complexity
Journal of Computer and System Sciences
Polynomial time approximation schemes and parameterized complexity
Discrete Applied Mathematics
Metaheuristics for optimization problems in computer communications
Computer Communications
Bound sets for biobjective combinatorial optimization problems
Computers and Operations Research
Engineering graph clustering: Models and experimental evaluation
Journal of Experimental Algorithmics (JEA)
On the computational rationale for generative models
Computer Vision and Image Understanding
Domination analysis for minimum multiprocessor scheduling
Discrete Applied Mathematics
On the uniform edge-partition of a tree
Discrete Applied Mathematics
Maximum H-colourable subdigraphs and constraint optimization with arbitrary weights
Journal of Computer and System Sciences
Data-independent neighborhood functions and strict local optima
Discrete Applied Mathematics
Complexity and approximation of the minimum recombinant haplotype configuration problem
Theoretical Computer Science
Haplotyping Populations by Pure Parsimony: Complexity of Exact and Approximation Algorithms
INFORMS Journal on Computing
On the Complexity of Removing Z-Cycles from a Checkpoints and Communication Pattern
IEEE Transactions on Computers
Genus characterizes the complexity of certain graph problems: Some tight results
Journal of Computer and System Sciences
Intractability and clustering with constraints
Proceedings of the 24th international conference on Machine learning
ILP and heuristic techniques for system-level design on network processor architectures
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Buying cheap is expensive: hardness of non-parametric multi-product pricing
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Acyclic type-of-relationship problems on the internet: an experimental analysis
Proceedings of the 7th ACM SIGCOMM conference on Internet measurement
Constrained sequence alignment: A general model and the hardness results
Discrete Applied Mathematics
Packing vertices and edges in random regular graphs
Random Structures & Algorithms
Approximate and online multi-issue negotiation
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
A randomized method for the shapley value for the voting game
Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
The phasing of heterozygous traits: Algorithms and complexity
Computers & Mathematics with Applications
Fully polynomial time approximation schemes for stochastic dynamic programs
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A framework for scalable greedy coloring on distributed-memory parallel computers
Journal of Parallel and Distributed Computing
Finding the population variance of costs over the solution space of the TSP in polynomial time
MATH'07 Proceedings of the 11th WSEAS International Conference on Applied Mathematics
Logic-based automated multi-issue bilateral negotiation in peer-to-peer e-marketplaces
Autonomous Agents and Multi-Agent Systems
On complexity of optimal recombination for binary representations of solutions
Evolutionary Computation
Approximation results for the weighted P4 partition problem
Journal of Discrete Algorithms
Mapping pipeline skeletons onto heterogeneous platforms
Journal of Parallel and Distributed Computing
On the Approximation of Correlation Clustering and Consensus Clustering
Journal of Computer and System Sciences
Categorical skylines for streaming data
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Maximum thick paths in static and dynamic environments
Proceedings of the twenty-fourth annual symposium on Computational geometry
Parameterized complexity of the clique partition problem
CATS '08 Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77
The approximability of MAX CSP with fixed-value constraints
Journal of the ACM (JACM)
A linear approximation method for the Shapley value
Artificial Intelligence
Red-blue covering problems and the consecutive ones property
Journal of Discrete Algorithms
Partition into cliques for cubic graphs: Planar case, complexity and approximation
Discrete Applied Mathematics
Data reduction and exact algorithms for clique cover
Journal of Experimental Algorithmics (JEA)
Large independent sets in general random intersection graphs
Theoretical Computer Science
The Pk Partition Problem and Related Problems in Bipartite Graphs
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Approximating Alternative Solutions
COCOON '08 Proceedings of the 14th annual international conference on Computing and Combinatorics
Integer Maximum Flow in Wireless Sensor Networks with Energy Constraint
SWAT '08 Proceedings of the 11th Scandinavian workshop on Algorithm Theory
Placement Inference for a Client-Server Calculus
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Vertex-Uncertainty in Graph-Problems
COCOA 2008 Proceedings of the 2nd international conference on Combinatorial Optimization and Applications
Routing to reduce the cost of wavelength conversion
Discrete Applied Mathematics
On the minimum common integer partition problem
ACM Transactions on Algorithms (TALG)
Approximation hardness of dominating set problems in bounded degree graphs
Information and Computation
Fast payment schemes for truthful mechanisms with verification
Theoretical Computer Science
Note: On the inapproximability of independent domination in 2P3-free perfect graphs
Theoretical Computer Science
Introduction to the Maximum Solution Problem
Complexity of Constraints
Proof of the local REM conjecture for number partitioning. I: Constant energy scales
Random Structures & Algorithms
Concise finite-domain representations for PDDL planning tasks
Artificial Intelligence
Mean analysis of an online algorithm for the vertex cover problem
Information Processing Letters
Approximation algorithms and hardness results for the clique packing problem
Discrete Applied Mathematics
Minimum-weight cycle covers and their approximability
Discrete Applied Mathematics
Hardness of approximation for orthogonal rectangle packing and covering problems
Journal of Discrete Algorithms
Factor Analysis of Incidence Data via Novel Decomposition of Matrices
ICFCA '09 Proceedings of the 7th International Conference on Formal Concept Analysis
A logic-based framework to compute Pareto agreements in one-shot bilateral negotiation
Proceedings of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy
Prototype-based Domain Description
Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Optimization and NP_R-completeness of certain fewnomials
Proceedings of the 2009 conference on Symbolic numeric computation
Multicast Trees for Collaborative Applications
CCGRID '09 Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid
On the complexity of the regenerator placement problem in optical networks
Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
Hard constraint satisfaction problems have hard gaps at location 1
Theoretical Computer Science
MAX-2-SAT: how good is Tabu search in the worst-case?
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Integer Programming: Optimization and Evaluation Are Equivalent
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Approximability of the Maximum Solution Problem for Certain Families of Algebras
CSR '09 Proceedings of the Fourth International Computer Science Symposium in Russia on Computer Science - Theory and Applications
Systematic Exploration of Efficient Query Plans for Automated Database Restructuring
ADBIS '09 Proceedings of the 13th East European Conference on Advances in Databases and Information Systems
Computational complexity of weighted threshold games
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Purely epistemic markov decision processes
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 2
The computational complexity of dominance and consistency in CP-Nets
Journal of Artificial Intelligence Research
Hardness results and approximation algorithms for (weighted) paired-domination in graphs
Theoretical Computer Science
(r,p)-centroid problems on paths and trees
Theoretical Computer Science
On the approximability of the Simplified Partial Digest Problem
Discrete Applied Mathematics
Understanding planning with incomplete information and sensing
Artificial Intelligence
Journal of Discrete Algorithms
Approximability of Edge Matching Puzzles
SOFSEM '10 Proceedings of the 36th Conference on Current Trends in Theory and Practice of Computer Science
Selfish Scheduling with Setup Times
WINE '09 Proceedings of the 5th International Workshop on Internet and Network Economics
Supermodular functions and the complexity of MAX CSP
Discrete Applied Mathematics - Special issue: Boolean and pseudo-boolean funtions
The complexity of base station positioning in cellular networks
Discrete Applied Mathematics
Data-independent neighborhood functions and strict local optima
Discrete Applied Mathematics
On the typical case complexity of graph optimization
Discrete Applied Mathematics
On the probabilistic minimum coloring and minimum k-coloring
Discrete Applied Mathematics
The complexity of maximum matroid-greedoid intersection and weighted greedoid maximization
Discrete Applied Mathematics - Special issue: Efficient algorithms
Probabilistically Checkable Proofs Over the Reals
Electronic Notes in Theoretical Computer Science (ENTCS)
Non-approximability of weighted multiple sequence alignment for arbitrary metrics
Information Processing Letters
Controlling the losing probability in a monotone game
Information Sciences: an International Journal
Simple negotiation schemes for agents with simple preferences: sufficiency, necessity and maximality
Autonomous Agents and Multi-Agent Systems
The finite-dimensional Witsenhausen counterexample
WiOPT'09 Proceedings of the 7th international conference on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks
minimum dominating set of queens: A trivial programming exercise?
Discrete Applied Mathematics
An incremental algorithm for distributed minimum weight triangulation
PDCN '08 Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks
On the computational complexity of weighted voting games
Annals of Mathematics and Artificial Intelligence
A fully linear-time approximation algorithm for grammar-based compression
CPM'03 Proceedings of the 14th annual conference on Combinatorial pattern matching
A computational model for watermark robustness
IH'06 Proceedings of the 8th international conference on Information hiding
Genus characterizes the complexity of graph problems: some tight results
ICALP'03 Proceedings of the 30th international conference on Automata, languages and programming
EvoWorkshops'03 Proceedings of the 2003 international conference on Applications of evolutionary computing
Approximation and fixed-parameter algorithms for consecutive ones submatrix problems
Journal of Computer and System Sciences
Playing monotone games to understand learning behaviors
Theoretical Computer Science
Complexity and approximation results for the connected vertex cover problem
WG'07 Proceedings of the 33rd international conference on Graph-theoretic concepts in computer science
Bounded tree-width and CSP-related problems
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Inverse booking problem: inverse chromatic number problem in interval graphs
WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
The k-anonymity problem is hard
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
The longest haplotype reconstruction problem revisited
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Understanding planning tasks: domain complexity and heuristic decomposition
Understanding planning tasks: domain complexity and heuristic decomposition
On the aggregation problem for synthesized web services
Proceedings of the 13th International Conference on Database Theory
Algorithms for sensor and ad hoc networks: advanced lectures
Algorithms for sensor and ad hoc networks: advanced lectures
Minimum factorization agreement of spliced ESTs
WABI'09 Proceedings of the 9th international conference on Algorithms in bioinformatics
A local 2-approximation algorithm for the vertex cover problem
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Planning with h+in theory and practice
KI'09 Proceedings of the 32nd annual German conference on Advances in artificial intelligence
Repetition-free longest common subsequence
Discrete Applied Mathematics
Multi-objective optimization of multicast overlays for collaborative applications
Computer Networks: The International Journal of Computer and Telecommunications Networking
Bandwidth allocation in cellular networks with multiple interferences
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Decision-theoretic Optimal Sampling in Hidden Markov Random Fields
Proceedings of the 2010 conference on ECAI 2010: 19th European Conference on Artificial Intelligence
Analytical and experimental comparison of six algorithms for the vertex cover problem
Journal of Experimental Algorithmics (JEA)
Multiple genome alignment based on longest path in directed acyclic graphs
International Journal of Bioinformatics Research and Applications
Real time robot path planning and cleaning
ICIC'10 Proceedings of the Advanced intelligent computing theories and applications, and 6th international conference on Intelligent computing
Algorithmic issues in grid computing
Algorithms and theory of computation handbook
Configuring software product line feature models based on Stakeholders' soft and hard requirements
SPLC'10 Proceedings of the 14th international conference on Software product lines: going beyond
Haplotype inference on pedigrees with recombinations and mutations
WABI'10 Proceedings of the 10th international conference on Algorithms in bioinformatics
On the performance of fitness uniform selection for non-deceptive problems
Proceedings of the 48th Annual Southeast Regional Conference
Computational Optimization and Applications
Journal of Parallel and Distributed Computing
Shortest path and maximum flow problems in networks with additive losses and gains
Theoretical Computer Science
On the approximability of the minimum strictly fundamental cycle basis problem
Discrete Applied Mathematics
The transposition median problem is NP-complete
Theoretical Computer Science
Teaching randomized learners with feedback
Information and Computation
Submodularity of Influence in Social Networks: From Local to Global
SIAM Journal on Computing
On the competitive ratio of evaluating priced functions
Journal of the ACM (JACM)
3-Hitting set on bounded degree hypergraphs: upper and lower bounds on the kernel size
TAPAS'11 Proceedings of the First international ICST conference on Theory and practice of algorithms in (computer) systems
Approximation algorithms for grooming in optical network design
Theoretical Computer Science
Anonymizing binary and small tables is hard to approximate
Journal of Combinatorial Optimization
Improved approximations for hard optimization problems via problem instance classification
Rainbow of computer science
On minimum changeover cost arborescences
SEA'11 Proceedings of the 10th international conference on Experimental algorithms
Deterministic algorithms for multi-criteria TSP
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Local search heuristics for robotic routing planner
ISNN'11 Proceedings of the 8th international conference on Advances in neural networks - Volume Part III
On the complexity of core, kernel, and bargaining set
Artificial Intelligence
Optimizing distributed computing workflows in heterogeneous network environments
ICDCN'10 Proceedings of the 11th international conference on Distributed computing and networking
On some geometric problems of color-spanning sets
FAW-AAIM'11 Proceedings of the 5th joint international frontiers in algorithmics, and 7th international conference on Algorithmic aspects in information and management
Joint task assignment and cache partitioning with cache locking for WCET minimization on MPSoC
Journal of Parallel and Distributed Computing
Discrete Applied Mathematics
Almost transparent short proofs for NPR
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
On the complexity of the regenerator placement problem in optical networks
IEEE/ACM Transactions on Networking (TON)
An Efficient Algorithm for Haplotype Inference on Pedigrees with Recombinations and Mutations
IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB)
A membrane algorithm for the min storage problem
WMC'06 Proceedings of the 7th international conference on Membrane Computing
Approximation classes for real number optimization problems
UC'06 Proceedings of the 5th international conference on Unconventional Computation
Approximability of integer programming with generalised constraints
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
Approximation algorithms for restricted cycle covers based on cycle decompositions
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
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
Mining top-k frequent closed itemsets is not in APX
PAKDD'06 Proceedings of the 10th Pacific-Asia conference on Advances in Knowledge Discovery and Data Mining
An optimal rebuilding strategy for a decremental tree problem
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
Approximability of minimum AND-Circuits
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Optimization and approximation problems related to polynomial system solving
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Fingerprint clustering with bounded number of missing values
CPM'06 Proceedings of the 17th Annual conference on Combinatorial Pattern Matching
Inapproximability results for the lateral gene transfer problem
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Approximation complexity of min-max (regret) versions of shortest path, spanning tree, and knapsack
ESA'05 Proceedings of the 13th annual European conference on Algorithms
On approximating restricted cycle covers
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
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
A general data reduction scheme for domination in graphs
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Nonblocker: parameterized algorithmics for minimum dominating set
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Lower bounds and parameterized approach for longest common subsequence
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
MAX-SNP hardness and approximation of selected-internal steiner trees
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Correlation clustering and consensus clustering
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Dense subgraph problems with output-density conditions
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Complexity and approximation of the minimum recombination haplotype configuration problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
On complexity and approximability of the labeled maximum/perfect matching problems
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Greedy differential approximations for min set cover
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
On product covering in supply chain models: natural complete problems for W[3] and W[4]
AAIM'05 Proceedings of the First international conference on Algorithmic Applications in Management
Inapproximability results for orthogonal rectangle packing problems with rotations
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
On the minimum common integer partition problem
CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
Distributed approximation allocation resources algorithm for connecting groups
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
Generalised integer programming based on logically defined relations
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Approximability of bounded occurrence max ones
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Finding exact and maximum occurrences of protein complexes in protein-protein interaction graphs
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Two logical hierarchies of optimization problems over the real numbers
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Optimizing locationing of multiple masters for master-worker grid applications
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Computing minimal multi-homogeneous bézout numbers is hard
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Approximation problems categories
EUROCAST'05 Proceedings of the 10th international conference on Computer Aided Systems Theory
Approximation algorithms for unit disk graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Off-line admission control for advance reservations in star networks
WAOA'04 Proceedings of the Second international conference on Approximation and Online Algorithms
Conservative computations in energy–based p systems
WMC'04 Proceedings of the 5th international conference on Membrane Computing
On the complexity of several haplotyping problems
WABI'05 Proceedings of the 5th International conference on Algorithms in Bioinformatics
Approximate distance oracles for graphs with dense clusters
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Poly-APX- and PTAS-Completeness in standard and differential approximation
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Efficient algorithms for the longest path problem
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
Cuts and disjoint paths in the valley-free path model of internet BGP routing
CAAN'04 Proceedings of the First international conference on Combinatorial and Algorithmic Aspects of Networking
Logspace optimization problems and their approximability properties
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Improved algorithms and complexity results for power domination in graphs
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Approximation results for the weighted P4 partition problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Average-case non-approximability of optimisation problems
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Inferring AS relationships: dead end or lively beginning?
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
Some new directions and questions in parameterized complexity
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
Fixed-parameter approximation: conceptual framework and approximability results
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
On the effective enumerability of NP problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Robustness of the internet at the topology and routing level
Dependable Systems
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
Algorithms of discrete optimization and their application to problems with fuzzy coefficients
Information Sciences: an International Journal
New results for the Longest Haplotype Reconstruction problem
Discrete Applied Mathematics
Two-Server network disconnection problem
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part III
Improving time and space complexity for compressed pattern matching
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Approximation algorithms for multi-criteria traveling salesman problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Differential approximation of MIN SAT, MAX SAT and related problems
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
On some relations between approximation problems and PCPs over the real numbers
CiE'05 Proceedings of the First international conference on Computability in Europe: new Computational Paradigms
On the complexity of the regenerator cost problem in general networks with traffic grooming
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Approximability of 3- and 4-hop bounded disjoint paths problems
IPCO'10 Proceedings of the 14th international conference on Integer Programming and Combinatorial Optimization
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Mathematical and Computer Modelling: An International Journal
The path partition problem and related problems in bipartite graphs
Operations Research Letters
An approximation scheme for the two-stage, two-dimensional knapsack problem
Discrete Optimization
Approximability results for the maximum and minimum maximal induced matching problems
Discrete Optimization
Greedy-type resistance of combinatorial problems
Discrete Optimization
Repairing XML functional dependency violations
Information Sciences: an International Journal
When the greedy algorithm fails
Discrete Optimization
NP-completeness and APX-completeness of restrained domination in graphs
Theoretical Computer Science
On the inapproximability of maximum intersection problems
Information Processing Letters
Buying Cheap Is Expensive: Approximability of Combinatorial Pricing Problems
SIAM Journal on Computing
Approximating MAX SAT by moderately exponential and parameterized algorithms
TAMC'12 Proceedings of the 9th Annual international conference on Theory and Applications of Models of Computation
Towards tractable Boolean games
Proceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 2
Parameterized complexity and subexponential-time computability
The Multivariate Algorithmic Revolution and Beyond
Deterministic algorithms for multi-criteria Max-TSP
Discrete Applied Mathematics
Dense and sparse graph partition
Discrete Applied Mathematics
Algorithmic aspects of k-tuple total domination in graphs
Information Processing Letters
Complexity of distance paired-domination problem in graphs
Theoretical Computer Science
Approximate counting for complex-weighted Boolean constraint satisfaction problems
Information and Computation
Task scheduling for parallel multifrontal methods
Euro-Par'07 Proceedings of the 13th international Euro-Par conference on Parallel Processing
Ruling out polynomial-time approximation schemes for hard constraint satisfaction problems
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Improved algorithms for weighted and unweighted set splitting problems
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Parameterized top-K algorithms
Theoretical Computer Science
Partitioning sporadic task systems upon memory-constrained multiprocessors
ACM Transactions on Embedded Computing Systems (TECS)
New results on maximum induced matchings in bipartite graphs and beyond
Theoretical Computer Science
Job-shop scheduling in a body shop
Journal of Scheduling
On the aggregation problem for synthesized Web services
Journal of Computer and System Sciences
Test pin count reduction for NoC-based test delivery in multicore SOCs
DATE '12 Proceedings of the Conference on Design, Automation and Test in Europe
The constrained shortest common supersequence problem
Journal of Discrete Algorithms
Parameterized complexity of k-anonymity: hardness and tractability
Journal of Combinatorial Optimization
The maximum flow problem with disjunctive constraints
Journal of Combinatorial Optimization
Parameterized complexity of weak odd domination problems
FCT'13 Proceedings of the 19th international conference on Fundamentals of Computation Theory
Discrete Applied Mathematics
Lower bounds for treewidth of product graphs
Discrete Applied Mathematics
The l-Diversity problem: Tractability and approximability
Theoretical Computer Science
Layout decomposition with pairwise coloring for multiple patterning lithography
Proceedings of the International Conference on Computer-Aided Design
Reoptimization of maximum weight induced hereditary subgraph problems
Theoretical Computer Science
Online XOR packet coding: Efficient single-hop wireless multicasting with low decoding delay
Computer Communications
Flip distance between triangulations of a planar point set is APX-hard
Computational Geometry: Theory and Applications
A heuristic approximation method for the Banzhaf index for voting games
Multiagent and Grid Systems
Hardness results and approximation algorithm for total liar's domination in graphs
Journal of Combinatorial Optimization
| Hi-index | 0.03 |
From the Publisher:In the last ten years the area concerned with the design of approximation algorithms and with the study of the approximability properties of NP-hard combinatorial optimization problems has been one of the most active in computer science, and its scientific developments have considerably enriched our understanding of problem complexity and our ability to cope with difficult applications." "This textbook features a compendium documenting the results on the approximability of more than 200 problems; thus the book is also a source of reference for professionals applying advanced optimization and approximation techniques in practice. The CD-ROM included contains a lot of valuable information, such as lecture slides in various data formats, the compendium in electronic version, and the algorithms visualization toolkit JAZ.