Search Results - "NP-complete problems"

Recognizing distance-count matrices.

Authors: Boldi, Paolo Prezioso, Chiara Furia, Flavio et al.

Source: PLoS ONE. 7/8/2026, Vol. 21 Issue 7, p1-27. 27p.

Algorithmic results on independent Roman {2}-domination.

Authors: Liu, Qiyun Song, Yonghao Shao, Zehui et al.

Source: Communications in Combinatorics & Optimization. Jun2026, Vol. 12 Issue 2, p599-627. 29p.

On the complexity of perfect Roman domination and perfect double Roman domination.

Authors: Mirhoseini, Seyed Hosein Rad, Nader Jafari A'lawiah Abd Aziz, Noor et al.

Source: Discrete Mathematics, Algorithms & Applications. Jun2026, Vol. 18 Issue 5, p1-15. 15p.

L-STEP DOMINATION NUMBER AND ITS COMPUTATION.

Authors: Zhao, Yancai Xia, Peng

Source: Advances & Applications in Discrete Mathematics. Apr2026, Vol. 43 Issue 3, p381-399. 19p.

Subjects: Dominating set, NP-complete problems, Algorithms, Graph theory, Tree graphs

A note on the computational complexity of chain rule differentiation.

Authors: Naumann, U.¹ (AUTHOR) naumann@stce.rwth-aachen.de

Source: Optimization Methods & Software. Apr2026, Vol. 41 Issue 2, p386-393. 8p.

Subjects: NP-complete problems, Jacobian matrices, Floating-point arithmetic, Differentiation (Mathematics), Computational complexity

DETERMINISTIC SUFFIX-READING AUTOMATA.

Authors: KEERTHAN, R. SRIVATHSAN, B. VENKATESH, R. et al.

Source: Logical Methods in Computer Science (LMCS); 2026, Vol. 22 Issue 2, p1-31, 31p

Italian Domination Number of Graphs Generated by Various Corona Product.

Authors: Prakash, Amritha P., Ragukumar

Source: Proyecciones - Journal of Mathematics. Apr2026, Vol. 45 Issue 2, p271-289. 19p.

Fair Domination on Extended Supergrid Graphs: Complexity, Linear-Time Algorithms, and ILP Formulations †.

Authors: Hung, Ruo-Wei¹ (AUTHOR)

Source: Mathematics (2227-7390). Mar2026, Vol. 14 Issue 6, p947. 28p.

An efficient SAT encoding for solving The Social Golfer Problem.

Authors: Van Kieu, Tuyen Nguyen, Nguyen Tan Van To, Khanh

Source: RAIRO: Operations Research (2804-7303). 2026, Vol. 60 Issue 1, p173-199. 27p.

Subjects: Combinatorial optimization, NP-complete problems, Constraint satisfaction, Benchmark problems (Computer science), Proposition (Logic)

SITS: an efficient tabu search algorithm for the tool indexing problem without tool duplication.

Authors: Mohan, Deepti Ghosh, Diptesh

Source: International Journal of Production Research. Dec2025, Vol. 63 Issue 24, p10586-10607. 22p.

Subjects: NP-complete problems, Metaheuristic algorithms, Numerical control of machine tools, Algorithms, Computer simulation, Rapid tooling

Is All Math Solvable?

Authors: MURTAGH, JACK (AUTHOR)

Source: Scientific American. Feb2026, Vol. 334 Issue 2, p74-76. 3p. 1 Color Photograph.

Dominator Coloring in Brick Product Graphs: Bounds, Constructions, and Applications.

Authors: A. C., Chaitra Murali, R. Padmanabhan, S. et al.

Source: IAENG International Journal of Computer Science; Jan2026, Vol. 53 Issue 1, p93-102, 10p

The LEAFED INDUCED SUBTREE in chordal and bounded treewidth graphs.

Authors: Baste, Julien¹

Source: Discrete Mathematics & Theoretical Computer Science (DMTCS); 2026, Vol. 28 Issue 2, p1-11, 11p

Total Roman domination and total domination in unit disk graphs.

Authors: Rout, Sasmita Mishra, Pawan Kumar Das, Gautam Kumar

Source: Communications in Combinatorics & Optimization. Dec2025, Vol. 10 Issue 4, p803-823. 21p.

Transitions in dynamic point labeling.

Authors: Depian, Thomas Li, Guangping Nöllenburg, Martin et al.

Source: Cartography & Geographic Information Science. Nov2025, p1-26. 26p. 17 Illustrations.

求解抽象辩论框架稳定扩充的长记忆禁忌搜索算法.

Alternate Title: Long-memory tabu search algorithm for stable extensions in abstract argumentation frameworks.

Authors: 吴歆韵 孙俊杰 熊才权 et al.

Source: Application Research of Computers / Jisuanji Yingyong Yanjiu. Nov2025, Vol. 42 Issue 11, p3316-3324. 9p.

On sum edge-colorings of graph products.

Authors: Mikaelyan, Hamlet V. Petrosyan, Petros A.

Source: Ars Combinatoria. 2025, Vol. 165, p141-162. 22p.

On error-detecting open-locating-dominating sets.

Authors: Jean, Devin C. Seo, Suk J.

Source: Ars Combinatoria. 2025, Vol. 165, p63-77. 15p.

Total Outer-Connected Domination on Convex Split Graphs — Classical, Parameterized and Approximation Complexity Results.

Authors: Mohanapriya, A. Renjith, P. Sadagopan, N.

Source: International Journal of Foundations of Computer Science. May2026, p1-20. 20p.

The Price of Upwardness.

Authors: Angelini, Patrizio Biedl, Therese Chimani, Markus et al.

Source: Discrete Mathematics & Theoretical Computer Science (DMTCS). 2025, Vol. 27 Issue 3, p1-30. 30p.

Subjects: Directed acyclic graphs, NP-complete problems