The following pages link to (Q3651735):
Displaying 50 items.
- The critical node detection problem in networks: a survey (Q1750314) (← links)
- An algorithmic framework for labeling network maps (Q1750356) (← links)
- Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
- Geometric medians in reconciliation spaces of phylogenetic trees (Q1751430) (← links)
- An adapted ant colony optimization algorithm for the minimization of the travel distance of pickers in manual warehouses (Q1754220) (← links)
- Service location grouping and pricing in transportation: application in air cargo (Q1754269) (← links)
- An optimization model for freight transport using urban rail transit (Q1754289) (← links)
- A hybrid metaheuristic for the minimum labeling spanning tree problem (Q1755227) (← links)
- An optimal algorithm for minimum-link rectilinear paths in triangulated rectilinear domains (Q1755791) (← links)
- String covering with optimal covers (Q1757464) (← links)
- Shorthand universal cycles for permutations (Q1759661) (← links)
- Parameterized complexity of the spanning tree congestion problem (Q1759686) (← links)
- Global search algorithms using a combinatorial unranking-based problem representation for the critical node detection problem (Q1761226) (← links)
- Efficient algorithms for heavy-tail analysis under interval uncertainty (Q1761865) (← links)
- Improved pattern-scan-order algorithms for string matching (Q1784983) (← links)
- Balanced splitting on weighted intervals (Q1785388) (← links)
- Analysis of a key exchange protocol based on tropical matrix algebra (Q1787191) (← links)
- Reconstructing gene trees from Fitch's xenology relation (Q1789081) (← links)
- An algorithm for constructing single processor static-dynamic schedules (Q1789208) (← links)
- Decomposition of data mining algorithms into unified functional blocks (Q1793631) (← links)
- Inverse Lyndon words and inverse Lyndon factorizations of words (Q1795498) (← links)
- Scheduling in multiprocessor systems with additional restrictions (Q1795622) (← links)
- New efficient algorithms for multiple change-point detection with reproducing kernels (Q1796951) (← links)
- Dynamic path queries in linear space (Q1799220) (← links)
- Sorting, linear time and the satisfiability problem (Q1817067) (← links)
- Balancing minimum spanning trees and shortest-path trees (Q1899219) (← links)
- An optimal parallel algorithm for planar cycle separators (Q1900892) (← links)
- Reconstructing a graph from its arc incidence graph (Q1926018) (← links)
- The weak-heap data structure: variants and applications (Q1932363) (← links)
- On conditional decomposability (Q1932746) (← links)
- A note on ordinal DFAs (Q1943687) (← links)
- Cluster detection in networks using percolation (Q1952439) (← links)
- An adaptive test sheet generation mechanism using genetic algorithm (Q1955233) (← links)
- On approximation of dominating tree in wireless sensor networks (Q1958639) (← links)
- Finding temporal paths under waiting time constraints (Q1979453) (← links)
- On scheduling multiple two-stage flowshops (Q1985613) (← links)
- On the tree conjecture for the network creation game (Q1987511) (← links)
- Weighted dependency graphs (Q1990226) (← links)
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization (Q1991103) (← links)
- Processing secure, verifiable and efficient SQL over outsourced database (Q1991841) (← links)
- Diagnostic model for a distributed computer system in real time (Q1995352) (← links)
- Analysis of critical damage in the communication network. I: Model and computational experiment (Q1995357) (← links)
- SoC implementation of a photovoltaic reconfiguration algorithm by exploiting a HLS-based architecture (Q1997501) (← links)
- Direct product primality testing of graphs is GI-hard (Q1998840) (← links)
- Colored operads, series on colored operads, and combinatorial generating systems (Q1999730) (← links)
- A hybrid VNS/tabu search algorithm for solving the vehicle routing problem with drones and en route operations (Q2003572) (← links)
- Maximum weighted matching with few edge crossings for 2-layered bipartite graph (Q2004074) (← links)
- Two-dimensional closest pair problem: a closer look (Q2004080) (← links)
- \texttt{FASTSET}: a fast data structure for the representation of sets of integers (Q2004853) (← links)
- Slow recurrences (Q2004951) (← links)
