Showing 1 - 20 of 148,189

1

Portfolio Optimization with Stochastic Return Functions: An Algorithmic Approach
Saxena, Aditya
2025 12th International Conference on Emerging Trends in Engineering & Technology - Signal and Information Processing (ICETET - SIP) Emerging Trends in Engineering & Technology - Signal and Information Processing (ICETET - SIP), 2025 12th International Conference on. :1-6 Aug, 2025

Conference
2

This result is not available to guest users.

3

Approximation Meets Quantum: A Parameterized Framework for Large-Scale Graph Coloring
Pitale, Rahul ; Tajane, Kapil ; Ahire, Prashant G. ; et al.
2025 5th Asian Conference on Innovation in Technology (ASIANCON) Innovation in Technology (ASIANCON), 2025 5th Asian Conference on. :1-9 Aug, 2025

Conference
4

Hybrid Metaheuristic Algorithms with Dynamic Clause Weight Adjustments for Efficient Optimization of NP-Hard Problems
Ishtaiwi, Abdelraouf ; HajYasien, Ahmed ; Quaddoura, Ruzayn ; et al.
2025 1st International Conference on Computational Intelligence Approaches and Applications (ICCIAA) Computational Intelligence Approaches and Applications (ICCIAA), 2025 1st International Conference on. :1-7 Apr, 2025

Conference
5

Algorithmics of NP-Hard Problems
Problems Reducing the Exhaustive Search

Freidzon, R. I.
AMERICAN MATHEMATICAL SOCIETY TRANSLATIONS. (178):1-4

Journal
6

Algorithmic results for weak Roman domination problem in graphs.
Paul, Kaustav ; Sharma, Ankit ; Pandey, Arti
Discrete Applied Mathematics. Dec2024, Vol. 359, p278-289. 12p.

POLYNOMIAL time algorith... GRAPH algorithms NP-hard problems NP-complete problems PROBLEM solving DOMINATING set
Academic journal
7

From P ≟ NP to Practice: Description Complexity and Certificate-First Algorithm Discovery for Hard Problems.
Abela, John ; Cachia, Ernest ; Layfield, Colin
Mathematics (2227-7390). Jan2026, Vol. 14 Issue 1, p41. 33p.

KOLMOGOROV complexity COMPUTATIONAL complexity COMPLEXITY (Philosophy) REPLICATION (Experimenta... HEURISTIC HEURISTIC algorithms
Academic journal
8

Total Completion Time Scheduling Under Scenarios.
Bosman, Thomas ; van Ee, Martijn ; Ergen, Ekin ; et al.
Theory of Computing Systems. Dec2025, Vol. 69 Issue 4, p1-41. 41p.

SCHEDULING NP-hard problems PARALLEL computers UNCERTAINTY (Information... POSSIBILITY
Academic journal
9

Finding maximum common contractions between phylogenetic networks.
Marchand, Bertrand ; Tahiri, Nadia ; Fard, Shohreh Golpaigani ; et al.
Algorithms for Molecular Biology. 10/1/2025, Vol. 20 Issue 1, p1-30. 30p.

PHYLOGENY NP-hard problems GRAPH theory COMPUTATIONAL complexity
Academic journal
10

Discerning Between the “Easy” and “Hard” Problems of AI Governance
Minkkinen, M. ; Mantymaki, M.
IEEE Transactions on Technology and Society IEEE Trans. Technol. Soc. Technology and Society, IEEE Transactions on. 4(2):188-194 Jun, 2023

Academic journal
11

The spanning tree congestion problem on interval graphs.
Lin, Lan ; Lin, Yixun
Discrete Applied Mathematics. Dec2025, Vol. 377, p147-153. 7p.

SPANNING trees POLYNOMIAL time algorith... NP-hard problems ALGORITHMS INTERSECTION graph theor... PARAMETERIZATION
Academic journal
12

Exact and approximation algorithms for covering timeline in temporal graphs.
Dondi, Riccardo ; Popa, Alexandru
Annals of Operations Research. Aug2025, Vol. 351 Issue 1, p609-628. 20p.

NP-hard problems APPROXIMATION algorithms PARAMETERIZATION GRAPH theory TIME-varying networks ALGORITHMS
Academic journal
14

Parameterized Algorithmics for Finding Exact Solutions of NP-Hard Biological Problems
Hüffner, Falk ; Komusiewicz, Christian ; Niedermeier, Rolf ; et al.
Methods in molecular biology. 1526:363-402

Journal
15

Hard Instances of the Constrained Discrete Logarithm Problem
Algorithmic number theory

Mironov, I. ; Mityagin, A. ; Nissim, K.
LECTURE NOTES IN COMPUTER SCIENCE. (4076):582-598

Conference
17

Student-project allocation with preferences over projects: Algorithmic and experimental results.
Manlove, David ; Milne, Duncan ; Olaosebikan, Sofiat
Discrete Applied Mathematics. Feb2022, Vol. 308, p220-234. 15p.

INTEGER programming NP-hard problems APPROXIMATION algorithms
Academic journal
18

(Re)packing Equal Disks into Rectangle.
Fomin, Fedor V. ; Golovach, Petr A. ; Inamdar, Tanmay ; et al.
Discrete & Computational Geometry. Dec2024, Vol. 72 Issue 4, p1596-1629. 34p.

COMPUTATIONAL geometry NP-hard problems COMPUTATIONAL complexity PROBLEM solving INTEGERS
Academic journal
19

Globally Linked Pairs and Cheapest Globally Rigid Supergraphs.
Jordán, Tibor ; Villányi, Soma
SIAM Journal on Discrete Mathematics. 2025, Vol. 39 Issue 3, p1520-1544. 25p.

GRAPH theory NP-hard problems APPROXIMATION algorithms
Academic journal
20

Asymptotic Analysis of Problem Formulations for Quantum Annealers
Auto, Julio ; Shi, Fred
2023 IEEE International Conference on Quantum Computing and Engineering (QCE) QCE Quantum Computing and Engineering (QCE), 2023 IEEE International Conference on. 01:385-396 Sep, 2023

Conference

Filter