• *Search*: Algorithmics for hard problems

*sublabel_EDS*

*custom_text_above_search_result**custom_text_above_search_result_EDS*

*Showing* 1 - 20 *of* 155*number_thousands_separator*366

1

Extending Robinson spaces: Complexity and algorithmic solutions for non-symmetric dissimilarity spaces.
Brucker, François ; Préa, Pascal ; Thraves Caro, Christopher
Discrete Applied Mathematics. May2026, Vol. 385, p306-317. 12p.

NP-hard problems NP-complete problems POLYNOMIAL time algorith... MATHEMATICAL optimizatio... COMBINATORIAL optimizati...
*Academic Journal*
*Add to favorites*
2

From P ≟ NP to Practice: Description Complexity and Certificate-First Algorithm Discovery for Hard Problems
Abela, John ; Cachia, Ernest ; Layfield, Colin
Mathematics. January, 2026, Vol. 14 Issue 1

*Academic Journal*
*Add to favorites*
3

*This result is not displayed to guests*

4

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*
*Add to favorites*
5

NP-Completeness of Hanabi Game with Minimal Parameters.
Onorpienko, A. A.
Doklady Mathematics. Aug2025, Vol. 112 Issue 1, p255-262. 8p.

NP-hard problems NP-complete problems CARD games COOPERATIVE game theory COMPUTATIONAL complexity
*Academic Journal*
*Add to favorites*
6

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*
*Add to favorites*
7

Algorithmics of NP-Hard Problems
Problems Reducing the Exhaustive Search
Freidzon, R. I.
AMERICAN MATHEMATICAL SOCIETY TRANSLATIONS. (178):1-4

*Periodical*
*Add to favorites*
8

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*
*Add to favorites*
9

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*
*Add to favorites*
10

Algorithmic Analysis ofQualitative and Quantitative Termination Problems for Affine Probabilistic Programs.
CHATTERJEE, KRISHNENDU ; HONGFEI FU ; NOVOTNÝ, PETR ; et al.
ACM Transactions on Programming Languages & Systems. May2018, Vol. 40 Issue 2, p7-45. 45p.

PROBABILISTIC inference NP-hard problems COMPUTATIONAL complexity MATHEMATICAL analysis MATHEMATICAL logic
*Academic Journal*
*Add to favorites*
11

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*
*Add to favorites*
12

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*
*Add to favorites*
13

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*
*Add to favorites*
14

(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*
*Add to favorites*
15

*This result is not displayed to guests*

16

Maximal universal width of an AFA is NP-hard.
Alajaji, John ; Salomaa, Kai
Theoretical Computer Science. Aug2025, Vol. 1045, pN.PAG-N.PAG. 1p.

POLYNOMIAL time algorith... NP-hard problems ROBOTS INTEGERS DECISION making
*Academic Journal*
*Add to favorites*
17

Disentangling the Computational Complexity of Network Untangling.
Froese, Vincent ; Kunz, Pascal ; Zschoche, Philipp
Theory of Computing Systems. Feb2024, Vol. 68 Issue 1, p103-121. 19p.

NP-hard problems COMPUTATIONAL complexity DATA mining MULTIVARIATE analysis
*Academic Journal*
*Add to favorites*
18

Algorithmic and Hardness Results for the Colorful Components Problems.
Adamaszek, Anna ; Popa, Alexandru
Algorithmica. Oct2015, Vol. 73 Issue 2, p371-388. 18p.

NP-hard problems GRAPH coloring MATHEMATICAL functions POLYNOMIAL time algorith... APPROXIMATION theory
*Academic Journal*
*Add to favorites*
19

Stabilization of capacitated matching games: Stabilization of capacitated matching games: M. Gerstbrein et al.
Gerstbrein, Matthew ; Sanità, Laura ; Verberk, Lucy
Mathematical Programming. Mar2025, Vol. 210 Issue 1, p313-334. 22p.

NP-hard problems GAME theory NEGOTIATION GAMES
*Academic Journal*
*Add to favorites*
20

Multistage graph problems on a global budget.
Heeger, Klaus ; Himmel, Anne-Sophie ; Kammer, Frank ; et al.
Theoretical Computer Science. May2021, Vol. 868, p46-64. 19p.

LOCAL budgets NP-hard problems
*Academic Journal*
*Add to favorites*
*Search Tools*: *Get RSS Feed* *Email this Search* *save_search*

*Filter*