The following pages link to Introduction to algorithms (Q2747613):
Displaying 50 items.
- Strictly chordal graphs are leaf powers (Q866539) (← links)
- Linear time isotonic and unimodal regression in the \(L_{1}\) and \(L_{\infty }\) norms (Q866553) (← links)
- Generalising the array split obfuscation (Q867610) (← links)
- The interval-merging problem (Q867634) (← links)
- A combinatorial strongly subexponential strategy improvement algorithm for mean payoff games (Q867862) (← links)
- An intersection-sensitive algorithm for snap rounding (Q868103) (← links)
- Distance-preserving approximations of polygonal paths (Q868106) (← links)
- Longest common subsequence problem for unoriented and cyclic strings (Q868937) (← links)
- Obtaining shorter regular expressions from finite-state automata (Q868946) (← links)
- An automata-theoretic approach to the word problem for \(\omega\)-terms over R (Q868948) (← links)
- Maximum transversal in partial Latin squares and rainbow matchings (Q869577) (← links)
- Compact and tractable automaton-based representations of time granularities (Q875518) (← links)
- A review of metrics on permutations for search landscape analysis (Q878593) (← links)
- Data-dependency graph transformations for instruction scheduling (Q880512) (← links)
- Interval linear systems: the state of the art (Q880921) (← links)
- A new measure of symmetry and its application to classification of bifurcating structures (Q882262) (← links)
- Space-efficient geometric divide-and-conquer algorithms (Q883238) (← links)
- Link test -- a statistical method for finding prostate cancer biomarkers (Q884272) (← links)
- Area-efficient planar straight-line drawings of outerplanar graphs (Q885284) (← links)
- Answering ``why empty?'' and ``why so many?'' queries in graph databases (Q891677) (← links)
- Incorporating weights into real-time heuristic search (Q891790) (← links)
- Modular robotic systems: methods and algorithms for abstraction, planning, control, and synchronization (Q892190) (← links)
- Efficient nonconvex sparse group feature selection via continuous and discrete optimization (Q892230) (← links)
- Design and analysis of migration in parallel evolutionary algorithms (Q894073) (← links)
- Parameterized and subexponential-time complexity of satisfiability problems and applications (Q896108) (← links)
- Deciding determinism of unary languages (Q897659) (← links)
- Linear-time superbubble identification algorithm for genome assembly (Q897907) (← links)
- Efficient approximation algorithms for bandwidth consecutive multicolorings of graphs (Q897950) (← links)
- Fractional-order embedding canonical correlation analysis and its applications to multi-view dimensionality reduction and recognition (Q898383) (← links)
- Efficient networks for a class of games with global spillovers (Q898687) (← links)
- Efficient algorithms for game-theoretic betweenness centrality (Q899439) (← links)
- On the complexity of the constrained input selection problem for structural linear systems (Q901120) (← links)
- Runtime analysis of the \((1+1)\) EA on computing unique input output sequences (Q903582) (← links)
- A constraint programming approach to the additional relay placement problem in wireless sensor networks (Q903915) (← links)
- Efficient transformations for Klee's measure problem in the streaming model (Q904110) (← links)
- Efficient algorithms for computing Reeb graphs (Q924077) (← links)
- Scheme inclusion verification algorithm in algebraic model of programs with constants (Q927457) (← links)
- On the generalized Wolf problem: preprocessing of nonnegative large-scale linear programming problems with group constraints (Q927521) (← links)
- Matching heterogeneous traders in quantity-regulated markets (Q928160) (← links)
- Two-tier relaxed heaps (Q929299) (← links)
- Inferring (biological) signal transduction networks via transitive reductions of directed graphs (Q930591) (← links)
- Mantaining dynamic matrices for fully dynamic transitive closure (Q930605) (← links)
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- Efficient algorithms for counting parameterized list \(H\)-colorings (Q931733) (← links)
- Property matching and weighted matching (Q932325) (← links)
- Computationally-feasible truthful auctions for convex bundles (Q932809) (← links)
- A non-linear dimension reduction methodology for generating data-driven stochastic input models (Q933330) (← links)
- Approximation algorithms for forests augmentation ensuring two disjoint paths of bounded length (Q935155) (← links)
- On the limits of cache-oblivious rational permutations (Q935473) (← links)
- New algorithms for text fingerprinting (Q935841) (← links)
