An O(20.304n) Algorithm for Solving Maximum Independent Set Problem
IEEE Transactions on Computers
On selecting a satisfying truth assignment (extended abstract)
SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
New methods for 3-SAT decision and worst-case analysis
Theoretical Computer Science
Finding maximum independent sets in sparse and general graphs
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
What are the least tractable instances of max independent set?
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Computing Partitions with Applications to the Knapsack Problem
Journal of the ACM (JACM)
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Journal of Computer and System Sciences - Special issue on the fourteenth annual IEE conference on computational complexity
Algorithms for quantified Boolean formulas
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search
Theoretical Computer Science
Satisfiability - Algorithms and Logic
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Deciding 3-Colourability in Less Than O(1.415^n) Steps
WG '93 Proceedings of the 19th International Workshop on Graph-Theoretic Concepts in Computer Science
Solving 3-Satisfiability in Less Then 1, 579n Steps
CSL '92 Selected Papers from the Workshop on Computer Science Logic
Faster Exact Solutions for Some NP-Hard Problems
ESA '99 Proceedings of the 7th Annual European Symposium on Algorithms
A New Approach on Solving 3-Satisfiability
AISMC-3 Proceedings of the International Conference AISMC-3 on Artificial Intelligence and Symbolic Mathematical Computation
3-coloring in time 0(1.3446^n): a no-MIS algorithm
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
An Improved Exponential-Time Algorithm for k-SAT
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
Which Problems Have Strongly Exponential Complexity?
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Parameterized Complexity
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
Measure and conquer: a simple O(20.288n) independent set algorithm
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
Locally consistent constraint satisfaction problems
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
A new algorithm for optimal 2-constraint satisfaction and its implications
Theoretical Computer Science - Automata, languages and programming: Algorithms and complexity (ICALP-A 2004)
A fixed-parameter tractability result for multicommodity demand flow in trees
Information Processing Letters
Optimal 2-constraint satisfaction via sum-product algorithms
Information Processing Letters
An improved exact algorithm for the domatic number problem
Information Processing Letters
Core Stability of Minimum Coloring Games
Mathematics of Operations Research
On exact algorithms for treewidth
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Improved fixed parameter tractable algorithms for two “edge” problems: MAXCUT and MAXDAG
Information Processing Letters
An exact algorithm for the minimum dominating clique problem
Theoretical Computer Science
Tree decomposition and discrete optimization problems: A survey
Cybernetics and Systems Analysis
Open problems around exact algorithms
Discrete Applied Mathematics
Finding a dominating set on bipartite graphs
Information Processing Letters
Exact Max 2-Sat: Easier and Faster
SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications
ACM Transactions on Algorithms (TALG)
Parameterized algorithmics for linear arrangement problems
Discrete Applied Mathematics
Efficiency in exponential time for domination-type problems
Discrete Applied Mathematics
A heuristic approach for the max-min diversity problem based on max-clique
Computers and Operations Research
Efficient approximation of min set cover by moderately exponential algorithms
Theoretical Computer Science
Journal of Discrete Algorithms
Sort and Search: Exact algorithms for generalized domination
Information Processing Letters
A measure & conquer approach for the analysis of exact algorithms
Journal of the ACM (JACM)
Computing branchwidth via efficient triangulations and blocks
Discrete Applied Mathematics
Deconstructing Intractability: A Case Study for Interval Constrained Coloring
CPM '09 Proceedings of the 20th Annual Symposium on Combinatorial Pattern Matching
Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms
WADS '09 Proceedings of the 11th International Symposium on Algorithms and Data Structures
Exponential time algorithms for the minimum dominating set problem on some graph classes
ACM Transactions on Algorithms (TALG)
Complexity issues in color-preserving graph embeddings
Theoretical Computer Science
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
A fixed-parameter tractability result for multicommodity demand flow in trees
Information Processing Letters
Optimal 2-constraint satisfaction via sum--product algorithms
Information Processing Letters
Iterative compression and exact algorithms
Theoretical Computer Science
Cooperative multi-robot reinforcement learning: a framework in hybrid state space
IROS'09 Proceedings of the 2009 IEEE/RSJ international conference on Intelligent robots and systems
Note: On exponential time lower bound of Knapsack under backtracking
Theoretical Computer Science
Note: On maximum independent sets in P5-free graphs
Discrete Applied Mathematics
An O*(1.0977n) exact algorithm for MAX INDEPENDENT SET in sparse graphs
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Exact algorithms for edge domination
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Solving NP-complete problems with quantum search
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Optimal parameterized rectangular coverings
ICCSA'07 Proceedings of the 2007 international conference on Computational science and its applications - Volume Part I
A novel strategy for multi-resource load balancing in agent-based systems
International Journal of Intelligent Information and Database Systems
On the possibility of faster SAT algorithms
SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Parameterized modal satisfiability
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Feedback vertex sets in tournaments
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
Partition into triangles on bounded degree graphs
SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
Improving efficiency of 3-SAT-solving tile systems
DNA'10 Proceedings of the 16th international conference on DNA computing and molecular programming
Breaking the 2n-barrier for Irredundance: Two lines of attack
Journal of Discrete Algorithms
An exact algorithm for the Boolean connectivity problem for k-CNF
Theoretical Computer Science
Restricted dynamic programming: A flexible framework for solving realistic VRPs
Computers and Operations Research
Discrete Applied Mathematics
Exact algorithms for dominating set
Discrete Applied Mathematics
Algorithms and constraint programming
CP'06 Proceedings of the 12th international conference on Principles and Practice of Constraint Programming
A branch-and-reduce algorithm for finding a minimum independent dominating set in graphs
WG'06 Proceedings of the 32nd international conference on Graph-Theoretic Concepts in Computer Science
Fast exponential algorithms for maximum γ-regular induced subgraph problems
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Solving connected dominating set faster than 2n
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Co-nondeterminism in compositions: a kernelization lower bound for a Ramsey-type problem
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Exponential time algorithms for the minimum dominating set problem on some graph classes
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Exact computation of maximum induced forest
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Fast subexponential algorithm for non-local problems on graphs of bounded genus
SWAT'06 Proceedings of the 10th Scandinavian conference on Algorithm Theory
Improved exact exponential algorithms for vertex bipartization and other problems
ICTCS'05 Proceedings of the 9th Italian conference on Theoretical Computer Science
Measure and conquer: domination – a case study
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
An O(2O(k)n3) FPT algorithm for the undirected feedback vertex set problem*
COCOON'05 Proceedings of the 11th annual international conference on Computing and Combinatorics
Investigating the performance of an adiabatic quantum optimization processor
Quantum Information Processing
Bounding the number of minimal dominating sets: a measure and conquer approach
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Computing optimal solutions for the MIN 3-SET COVERING problem
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
SOFSEM'05 Proceedings of the 31st international conference on Theory and Practice of Computer Science
Exact algorithms for exact satisfiability and number of perfect matchings
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Nondeterministic graph searching: from pathwidth to treewidth
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
An exact 2.9416n algorithm for the three domatic number problem
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Locally consistent constraint satisfaction problems with binary constraints
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Computing branchwidth via efficient triangulations and blocks
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Algorithms based on the treewidth of sparse graphs
WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Bicolored independent sets and bicliques
Information Processing Letters
The traveling salesman problem in bounded degree graphs
ACM Transactions on Algorithms (TALG)
Algorithm engineering for optimal graph bipartization
WEA'05 Proceedings of the 4th international conference on Experimental and Efficient Algorithms
A bottom-up method and fast algorithms for MAX INDEPENDENT SET
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Capacitated domination faster than O(2n)
SWAT'10 Proceedings of the 12th Scandinavian conference on Algorithm Theory
Finding k disjoint triangles in an arbitrary graph
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
Exact (exponential) algorithms for the dominating set problem
WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science
An exact algorithm for the minimum dominating clique problem
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
An exact algorithm for the boolean connectivity problem for k-CNF
SAT'10 Proceedings of the 13th international conference on Theory and Applications of Satisfiability Testing
Complexity analysis of heuristic CSP search algorithms
CSCLP'05 Proceedings of the 2005 Joint ERCIM/CoLogNET international conference on Constraint Solving and Constraint Logic Programming
Branching and treewidth based exact algorithms
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
Polynomial space algorithms for counting dominating sets and the domatic number
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Irredundant set faster than O(2n)
CIAC'10 Proceedings of the 7th international conference on Algorithms and Complexity
Improved exponential-time algorithms for treewidth and minimum fill-in
LATIN'06 Proceedings of the 7th Latin American conference on Theoretical Informatics
Efficient self-organized backbone formation in mobile ad hoc networks (MANETs)
Computers and Electrical Engineering
Improved worst-case complexity for the MIN 3-SET COVERING problem
Operations Research Letters
The traveling salesman problem with few inner points
Operations Research Letters
Exact algorithms for the Hamiltonian cycle problem in planar graphs
Operations Research Letters
Efficient 3-SAT algorithms in the tile assembly model
Natural Computing: an international journal
Parameterized complexity and subexponential-time computability
The Multivariate Algorithmic Revolution and Beyond
Cluster editing with locally bounded modifications
Discrete Applied Mathematics
Journal of Combinatorial Optimization
Feedback Vertex Sets in Tournaments
Journal of Graph Theory
On exact algorithms for treewidth
ACM Transactions on Algorithms (TALG)
An improved exact algorithm for cubic graph TSP
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Counting minimum weighted dominating sets
COCOON'07 Proceedings of the 13th annual international conference on Computing and Combinatorics
Branch and recharge: exact algorithms for generalized domination
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Communications of the ACM
Touching triangle representations for 3-connected planar graphs
GD'12 Proceedings of the 20th international conference on Graph Drawing
Fast hamiltonicity checking via bases of perfect matchings
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Exploiting application dynamism and cloud elasticity for continuous dataflows
SC '13 Proceedings of the International Conference on High Performance Computing, Networking, Storage and Analysis
Faster exponential-time algorithms in graphs of bounded average degree
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
On an extension of the Sort & Search method with application to scheduling theory
Theoretical Computer Science
Moderately exponential approximation for makespan minimization on related machines
Theoretical Computer Science
A Localized Computing Approach for Connectivity Improvement Analysis in Wireless Personal Networks
Wireless Personal Communications: An International Journal
| Hi-index | 0.02 |
We discuss fast exponential time solutions for NP-complete problems. We survey known results and approaches, we provide pointers to the literature, and we discuss several open problems in this area. The list of discussed NP-complete problems includes the travelling salesman problem, scheduling under precedence constraints, satisfiability, knapsack, graph coloring, independent sets in graphs, bandwidth of a graph, and many more.