The following pages link to Journal of Discrete Algorithms (Q350720):
Displaying 50 items.
- Approximation and hardness results for the maximum edge \(q\)-coloring problem (Q350721) (← links)
- An \(O(n^3 \log \log n / \log^2 n)\) time algorithm for all pairs shortest paths (Q350723) (← links)
- Reconstructing binary matrices with timetabling constraints (Q350725) (← links)
- Graph modification problem for some classes of graphs (Q350726) (← links)
- Solving the canonical representation and star system problems for proper circular-arc graphs in logspace (Q350727) (← links)
- Corrigendum to: ``On a lemma of Crochemore and Rytter'' (Q350728) (← links)
- Corrigendum to: ``On the negative cost girth problem in planar networks'' (Q350729) (← links)
- StringMasters 2011 Special Issue (Q396631) (← links)
- On-line construction of position heaps (Q396632) (← links)
- Computing a longest common subsequence that is almost increasing on sequences having no repeated elements (Q396635) (← links)
- Fine-tuning the search for microsatellites (Q396641) (← links)
- Infinite words containing the minimal number of repetitions (Q396642) (← links)
- A computational framework for determining run-maximal strings (Q396644) (← links)
- Tree template matching in unranked ordered trees (Q396647) (← links)
- A note on a simple computation of the maximal suffix of a string (Q396649) (← links)
- On parsing optimality for dictionary-based text compression -- the \texttt{Zip} case (Q396650) (← links)
- Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence (Q396653) (← links)
- The constrained shortest common supersequence problem (Q396654) (← links)
- All-maximum and all-minimum problems under some measures (Q396657) (← links)
- Improved approximations for TSP with simple precedence constraints (Q396660) (← links)
- On the approximability of dense Steiner problems (Q396661) (← links)
- Various improvements to text fingerprinting (Q396662) (← links)
- Approximation with a fixed number of solutions of some multiobjective maximization problems (Q396664) (← links)
- Minimum weight Euclidean \(t\)-spanner is NP-hard (Q396666) (← links)
- Exponential approximation schemata for some network design problems (Q396669) (← links)
- Embedding certain height-balanced trees and complete \(p^m\)-ary trees into hypercubes (Q396672) (← links)
- Finding dominators via disjoint set union (Q396673) (← links)
- Identifying path covers in graphs (Q396675) (← links)
- Degree associated edge reconstruction number of graphs (Q396679) (← links)
- Acyclic coloring with few division vertices (Q396683) (← links)
- Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs (Q396686) (← links)
- Lattices, whose incomparability graphs have horns (Q396689) (← links)
- On antimagic labeling of regular graphs with particular factors (Q396690) (← links)
- Weak heaps engineered (Q396692) (← links)
- The structural border array (Q396695) (← links)
- Computing the partial word avoidability indices of binary patterns (Q396698) (← links)
- Computing the partial word avoidability indices of ternary patterns (Q396699) (← links)
- A graph-theoretic model to solve the approximate string matching problem allowing for translocations (Q396701) (← links)
- Fuzzy local \(\omega\)-systems (Q396705) (← links)
- Large deviation properties for patterns (Q396708) (← links)
- Fast shortest-paths algorithms in the presence of few destinations of negative-weight arcs (Q396709) (← links)
- Multi-pattern matching with bidirectional indexes (Q396713) (← links)
- Cross-document pattern matching (Q396714) (← links)
- Algorithms for path-constrained sequence alignment (Q396718) (← links)
- Improving time-efficiency in blocking expanding ring search for mobile ad hoc networks (Q396722) (← links)
- Stringmasters 2012 \& 2013 special issue -- Volume 1 (Q405563) (← links)
- Suffix array and Lyndon factorization of a text (Q405567) (← links)
- Reverse engineering of compact suffix trees and links: a novel algorithm (Q405568) (← links)
- Layouts for improved hierarchical parallel computations (Q405569) (← links)
- The lexicographically smallest universal cycle for binary strings with minimum specified weight (Q405571) (← links)