X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (1223) 1223
Conference Proceeding (230) 230
Publication (93) 93
Book Chapter (36) 36
Dissertation (5) 5
Book / eBook (1) 1
Magazine Article (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
np-completeness (1333) 1333
algorithms (342) 342
mathematics, applied (314) 314
computer science (299) 299
computer science, theory & methods (264) 264
complexity (202) 202
mathematics (194) 194
computational complexity (159) 159
graphs (127) 127
computer science, information systems (126) 126
computer science, hardware & architecture (106) 106
engineering, electrical & electronic (100) 100
analysis (90) 90
optimization (88) 88
polynomials (84) 84
operations research & management science (83) 83
approximation algorithms (82) 82
computer science, software engineering (82) 82
studies (79) 79
theoretical computer science (79) 79
mathematical analysis (78) 78
algorithm (74) 74
theory of computation (69) 69
approximation (66) 66
graph theory (63) 63
discrete mathematics and combinatorics (61) 61
research (61) 61
combinatorics (54) 54
networks (54) 54
scheduling (52) 52
computer science, interdisciplinary applications (51) 51
mathematical models (50) 50
applied mathematics (48) 48
artificial intelligence (48) 48
computation (47) 47
computer science, artificial intelligence (45) 45
algorithm analysis and problem complexity (43) 43
approximation algorithm (40) 40
mathematics of computing (34) 34
np completeness (34) 34
dynamic programming (33) 33
graph (33) 33
hardness (33) 33
operations research (32) 32
usage (32) 32
graph algorithms (30) 30
planar graphs (30) 30
discrete mathematics (29) 29
berechnungskomplexität (28) 28
np‐completeness (28) 28
operations research/decision theory (28) 28
telecommunications (28) 28
graph coloring (27) 27
computational theory and mathematics (26) 26
logic (25) 25
polynomial algorithm (25) 25
trees (25) 25
computer systems organization and communication networks (24) 24
satisfiability (24) 24
data structures, cryptology and information theory (23) 23
polynomial-time algorithm (23) 23
complexity theory (22) 22
domination (22) 22
routing (22) 22
statistics & probability (22) 22
[formula omitted]-completeness (21) 21
algorithm design and analysis (21) 21
computer networks (21) 21
graphentheorie (21) 21
integers (21) 21
algorithmus (20) 20
combinatorial optimization (20) 20
heuristic (20) 20
integer programming (20) 20
computational mathematics and numerical analysis (19) 19
computer science, software, graphics, programming (19) 19
biochemical research methods (18) 18
bipartite graph (18) 18
heuristic algorithms (18) 18
linear programming (18) 18
matching (18) 18
number (18) 18
time (18) 18
computer science - computational complexity (17) 17
computer science - discrete mathematics (17) 17
computer simulation (17) 17
heuristics (17) 17
index medicus (17) 17
mathematics, general (17) 17
computational geometry (16) 16
computer science, general (16) 16
convex and discrete geometry (16) 16
game theory (16) 16
mathematical & computational biology (16) 16
mathematical modeling and industrial mathematics (16) 16
wireless sensor networks (16) 16
games (15) 15
mathematics - combinatorics (15) 15
models (15) 15
biotechnology & applied microbiology (14) 14
more...
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


European Journal of Combinatorics, ISSN 0195-6698, 01/2019, Volume 75, pp. 55 - 65
Let G be a simple planar graph of maximum degree Δ, let t be a positive integer, and let L be an edge list assignment on G with L(e)≥Δ+t for all e∈E(G). We... 
NP-COMPLETENESS | MATHEMATICS | MAXIMUM DEGREE-7
Journal Article
Electronic Notes in Discrete Mathematics, ISSN 1571-0653, 11/2017, Volume 62, pp. 9 - 14
Correspondence homomorphisms are a common generalization of homomorphisms and of correspondence colourings. For a fixed reflexive target graph H, the problem... 
Homomorphism | dichotomy | NP-completeness
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 11/2015, Volume 607, pp. 83 - 95
This paper studies new complexity aspects of P3-convexity restricted to planar graphs with bounded maximum degree. More specifically, we are interested in... 
Parametrization | W-hard | FPT | NP-completeness
Journal Article
European Journal of Combinatorics, ISSN 0195-6698, 01/2016, Volume 51, pp. 336 - 346
A graph is H-free if it does not contain an induced subgraph isomorphic to H. We denote by P t and C t the path and the cycle on t vertices, respectively. In... 
NP-COMPLETENESS | MAXIMUM WEIGHT | MATHEMATICS | Hardness
Journal Article
Journal of Combinatorial Theory, Series B, ISSN 0095-8956, 03/2020, Volume 141, pp. 105 - 114
We disprove a conjecture of Frank [3] stating that each weakly 2k-connected graph has a k-vertex-connected orientation. For k≥3, we also prove that the problem... 
Graph | Vertex-connectivity | Orientation | NP-completeness | MATHEMATICS | 2-CONNECTED ORIENTATIONS
Journal Article
Transportation Research Part E, ISSN 1366-5545, 2008, Volume 44, Issue 1, pp. 124 - 135
Journal Article
Applied Mathematics and Computation, ISSN 0096-3003, 05/2019, Volume 349, pp. 214 - 220
A function f:V(G)→{0,1,…,k} is called a k-rainbow independent dominating function of G if Vi={x∈V(G):f(x)=i} is independent for 1 ≤ i ≤ k, and for every x ∈ V0... 
Domination | Lexicographic product | Algorithm | NP-completeness | Complexity | MATHEMATICS, APPLIED | NUMBER | Algorithms
Journal Article
European Journal of Operational Research, ISSN 0377-2217, 2011, Volume 213, Issue 3, pp. 489 - 497
► We consider a two stage production scheduling problem with outsourcing option. ► Each operation can be outsourced with a cost proportional to its processing... 
Scheduling | Outsourcing | Approximation algorithm | Flow shop scheduling | NP-completeness | CAPACITY | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | APPROXIMATION | PRODUCTION-INVENTORY SYSTEM | Scheduling Outsourcing Flow shop scheduling NP-completeness Approximation algorithm | Algorithms | Management science
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2013, Volume 8066, pp. 33 - 47
Conference Proceeding
Journal of Discrete Algorithms, ISSN 1570-8667, 07/2017, Volume 45, pp. 14 - 25
We study the problem of broadcasting a common, possibly large, content into a wireless mesh network consisting of N end-users and of one or multiple access... 
Single-hop | Broadcast | NP-completeness | Multi-interface | Monge property | Dynamic programming | Multi-rate | Mesh networks | Computer science
Journal Article
Journal of Machine Learning Research, ISSN 1532-4435, 04/2018, Volume 18, pp. 1 - 11
This paper presents NP-hardness and hardness of approximation results for maximum likelihood estimation of mixtures of spherical Gaussians. 
Mixtures of Gaussians | NP-completeness | Maximum likelihood | AUTOMATION & CONTROL SYSTEMS | COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE | maximum likelihood
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 08/2018, Volume 739, pp. 80 - 85
We revisit crown decomposition for the Vertex Cover problem by giving a simple 2k-kernelization algorithm. Previously, a 2k kernel was known but it was... 
Vertex cover | Crown decomposition | FPT algorithms | NP-completeness | Kernelization | COMPUTER SCIENCE, THEORY & METHODS | Algorithms
Journal Article
Automatica, ISSN 0005-1098, 12/2015, Volume 62, pp. 193 - 199
This paper studies the problem of, given the structure of a linear-time invariant system and a set of possible inputs, finding the smallest subset of input... 
Large-scale control systems design | Multi-agent networked control | Structural controllability | NP-completeness | CONTROLLABILITY | AUTOMATION & CONTROL SYSTEMS | ENGINEERING, ELECTRICAL & ELECTRONIC
Journal Article
International Journal of Approximate Reasoning, ISSN 0888-613X, 07/2018, Volume 98, pp. 177 - 195
The problem of optimal quantitative approximation of an arbitrary binary relation by a partial order is discussed and some solutions are provided. It is shown... 
Relation | Approximation | Partial order | NP-completeness | Rough Sets | RANKING | COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 02/2020, Volume 806, pp. 197 - 218
We investigate for temporal graphs the computational complexity of separating two distinct vertices s and z by vertex deletion. In a temporal graph, the vertex... 
Temporal paths | Dynamic programming | Temporal restrictions | Fixed-parameter tractability | Unit interval graphs | NP-completeness | COMPLEXITY | COMPUTER SCIENCE, THEORY & METHODS
Journal Article
Discrete Applied Mathematics, ISSN 0166-218X, 08/2018, Volume 245, pp. 183 - 189
Deciding if the edges of a graph with n vertices and maximum degree Δ can be coloured with Δ colours is an NP-complete problem, but a conjecture proposed by... 
Overfull conjecture | Join graphs | Edge-colouring | NP-COMPLETENESS | MATHEMATICS, APPLIED | STAR | EDGES | Algorithms
Journal Article
Artificial Intelligence, ISSN 0004-3702, 07/2017, Volume 248, pp. 112 - 122
The partner units problem is an acknowledged hard benchmark problem for the logic programming community with various industrial application fields like CCTV... 
Computational complexity | Partner Units Problem | NP-completeness | COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE
Journal Article
Theoretical Computer Science, ISSN 0304-3975, 06/2018, Volume 731, pp. 36 - 49
Lu and Boutilier [22] proposed a novel approach based on “minimax regret” to use classical score based voting rules in the setting where preferences can be any... 
Computational social choice | Incomplete election | Voting | Manipulation | NP-completeness | Elicitation | Algorithm | COMPUTER SCIENCE, THEORY & METHODS | Elections | Algorithms
Journal Article
Networks, ISSN 0028-3045, 01/2018, Volume 71, Issue 1, pp. 81 - 92
Let G=(V,E) be a graph and let w:V→ℝ>0 be a positive weight function on the vertices of G. For every subset X of V, let w(X):=∑v∈Gw(v). A non‐empty subset... 
approximation algorithm | NP‐completeness | network majority | centroid | safe set | weighted tree | NP-completeness | COMPUTER SCIENCE, HARDWARE & ARCHITECTURE | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | INTEGRITY | GRAPHS | Algorithms | Trees | Minimum weight | Set theory | Trees (mathematics) | Weighting functions | Data Structures and Algorithms | Computer Science
Journal Article
Proceedings of the nineteenth annual ACM symposium on parallel algorithms and architectures, 06/2007, pp. 289 - 298
In this paper we investigate algorithmic instruments leading to low powerconsumption in computing devices. While previous work on energy-efficient algorithms... 
approximation algorithms | online algorithms | multiprocessor scheduling | NP-completeness | energy efficiency | Multiprocessor scheduling | Online algorithms | Approximation algorithms | Energy efficiency
Conference Proceeding
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.