yusuke1997/dblp-id-title huggingface dataset:
On position restricted substring searching in succinct space
A condensation-based application of Cramer's rule for solving large-scale linear systems
A derandomization using min-wise independent permutations
Near optimal line segment queries in simple polygons
Approximate labelled subtree homeomorphism
An approximation algorithm for a bottleneck traveling salesman problem
Identifying path covers in graphs
Skip lift: A probabilistic alternative to red-black trees
Bounded max-colorings of graphs
Corrigendum to "On a lemma of Crochemore and Rytter" [Journal of Discrete Algorithms 34 (2015) 18-22]
Efficient codon optimization with motif engineering
Minimal sum labeling of graphs
Irreversible conversion processes with deadlines
A cost-aggregating integer linear program for motif finding
Faster computation of maximum independent set and parameterized vertex cover for graphs with maximum degree 3
Fast parameterized matching with q-grams
Approximability of partitioning graphs with supply and demand
A note on the longest common compatible prefix problem for partial words
Failed disk recovery in double erasure RAID arrays
An efficient dynamic programming algorithm for the generalized LCS problem with multiple substring exclusive constraints
Acyclic coloring with few division vertices
An efficient Variable-to-Fixed length encoding using multiplexed parse trees
Some string matching problems from Bioinformatics which still need better solutions
Track assignment
Approximate similarity search: A multi-faceted problem
Improved Steiner tree algorithms for bounded treewidth
Quantum protocols for untrusted computations
Phase transition of random non-uniform hypergraphs
Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes
An O(n 3/2 sqrt(log(n))) algorithm for sorting by reciprocal translocations
Finding all sorting tandem duplication random loss operations
Stable marriage with ties and bounded length preference lists
A faster algorithm for the resource allocation problem with convex cost functions
A note on data structures for maintaining bipartitions
Computing input multiplicity in anonymous synchronous networks with dynamic faults
Approximation with a fixed number of solutions of some multiobjective maximization problems
Large deviation properties for patterns
Pivot selection: Dimension reduction for distance-based indexing
String shuffle: Circuits and graphs
Finite automata based algorithms on subsequences and supersequences of degenerate strings
A space efficient direct access data structure
A heuristic algorithm for finding cost-effective solutions to real-world school bus routing problems
A priority queue with the time-finger property
Algorithms for computing parameters of graph-based extensions of BCH codes
Fast and flexible packed string matching
On the parameterized complexity of coloring graphs in the absence of a linear forest
Gene tree correction for reconciliation and species tree inference: Complexity and algorithms
Space efficient data structures for nearest larger neighbor
An optimal algorithm to generate tilings
SAT and IP based algorithms for magic labeling including a complete search for total magic labelings
Approximate one-to-one point pattern matching
Subsequence automata with default transitions
A separation between RLSLPs and LZ77
A loop-free two-close Gray-code algorithm for listing k -ary Dyck words
Efficient one-dimensional real scaled matching
Matching subsequences in trees
An improved algorithm for the all-pairs suffix-prefix problem
Computing with membranes and picture arrays
p-Suffix sorting as arithmetic coding
A note on a simple computation of the maximal suffix of a string
A linear time algorithm for the inversion median problem in circular bacterial genomes
On the approximability of Dense Steiner Problems
Linear time algorithm for the longest common repeat problem
Cut problems in graphs with a budget constraint
Fixed-parameter tractability results for feedback set problems in tournaments
The eight variable homogeneous degree three bent functions
Distributed colorings for collision-free routing in sink-centric sensor networks
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
Excessive index for mesh derived networks
Fixed parameter algorithms for one-sided crossing minimization revisited
Steiner diagrams and k-star hubs
A linear algorithm for string reconstruction in the reverse complement equivalence model
The longest common subsequence problem for arc-annotated sequences
Adaptive text mining: inferring structure from sequences
Straight-path queries in trajectory data
On left and right seeds of a string
On a conjecture of Erdős for multiplicities of cliques
An exact algorithm for connected red-blue dominating set
Tight bounds for online stable sorting
Subexponential parameterized algorithms for degree-constrained subgraph problems on planar graphs
Sampling Eulerian orientations of triangular lattice graphs
On the analysis of a dynamic evolutionary algorithm
Polar SAT and related graphs
On minimizing pattern splitting in multi-track string matching
Approximation algorithms for the Label-Cover MAX and Red-Blue Set Cover problems
Character sets of strings
Modelling efficient novelty-based search result diversification in metric spaces
Discrete algorithms and methods for security of statistical databases related to the work of Mirka Miller
Pruning spanners and constructing well-separated pair decompositions in the presence of memory hierarchies
Counting and computing the Rand and block distances of pairs of set partitions
A parallel extended GCD algorithm
String matching with alphabet sampling
Distance-hereditary digraphs
The non-approximability of bicriteria network design problems
An improved algorithm for generalized comparison of minisatellites
On the communication complexity of Bar-Yehuda, Goldreich and Itai's randomized broadcasting algorithm
Pattern matching in pseudo real-time
Choose the damping, choose the ranking?
Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem
Optimal cover time for a graph-based coupon collector process
Succinct representations of weighted trees supporting path queries
On-line scheduling of parallel jobs on two machines
Structural properties and tractability results for linear synteny
Compressed text indexing with wildcards
On the hardness of maximum rank aggregation problems
Improving time-efficiency in blocking expanding ring search for mobile ad hoc networks
Fast detection of common sequence structure patterns in RNAs
The greedy approach to dictionary-based static text compression on a distributed system
Chains-into-bins processes
Testing the simultaneous embeddability of two graphs whose intersection is a biconnected or a connected graph
Perspectives: Journal of Discrete Algorithms Special StringMasters Issue (2015)
A computational framework for determining run-maximal strings
Efficient total domination in digraphs
Realizing partitions respecting full and partial order information
Efficient algorithms and methods to solve dynamic MINs stability problem using stable matching with complete ties
Model Based Comparison of Discounted Cumulative Gain and Average Precision
Admission control with advance reservations in simple networks
Parametric multiple sequence alignment and phylogeny construction
Mass spectra alignments and their significance
On the complexity of making a distinguished vertex minimum or maximum degree by vertex deletion
A new constrained edit distance between quotiented ordered trees
On the maximum independent set problem in subclasses of subcubic graphs
Two algorithms for the Student-Project Allocation problem
An architecture independent study of parallel segment trees
CHECKCOL: Improved local search for graph coloring
Packing two disks into a polygonal environment
Strengthening hash families and compressive sensing
Location tracking in mobile ad hoc networks using particle filters
An improved algorithm for the shortest descending path on a convex terrain
Improved and self-tuned occurrence heuristics
Petri net modelling of biological regulatory networks
HSAGA and its application for the construction of near-Moore digraphs
A succinct data structure for self-indexing ternary relations
Symbolic topological sorting with OBDDs
Probabilistic proximity searching algorithms based on compact partitions
The union of minimal hitting sets: Parameterized combinatorial bounds and counting
On shredders and vertex connectivity augmentation
Structural properties of subdivided-line graphs
The Steiner Forest Problem revisited
A PTAS for the sparsest 2-spanner of 4-connected planar triangulations
Fine-tuning the search for microsatellites
Guarding monotone art galleries with sliding cameras in linear time
Special Issue of the Sixteenth Australasian Workshop on Combinatorial Algorithms (AWOCA 2005) September 18-21, 2005, Ballarat, Australia
On stable cutsets in claw-free graphs and planar graphs
Computing the Burrows-Wheeler transform in place and in small space
Running time analysis of Ant Colony Optimization for shortest path problems
Upper bounds on the bisection width of 3- and 4-regular graphs
The structural border array
Fair cost-sharing methods for scheduling jobs on parallel machines
Acyclic colorings of graph subdivisions revisited
Breaking the 2 n -barrier for Irredundance: Two lines of attack
On the complexity of multi-parameterized cluster editing
A primal-dual algorithm for online non-uniform facility location
More efficient left-to-right matching for overlapping pattern
Crossing-constrained hierarchical drawings
Optimally computing all solutions of Stackelberg with parametric prices and of general monotonous gain functions on a tree
A novel approach for leveraging co-occurrence to improve the false positive error in signature files
Fast q-gram mining on SLP compressed strings
Towards a theory of patches
Approximate colored range and point enclosure queries
The knapsack problem with neighbour constraints
Converting suffix trees into factor/suffix oracles
Computing the partial word avoidability indices of binary patterns
Maximizing the overall end-user satisfaction of data broadcast in wireless mesh networks
Special issue on WALCOM 2015
Parallel query processing on distributed clustering indexes
On the hardness of full Steiner tree problems
Computing the rooted triplet distance between galled trees by counting triangles
The longest common extension problem revisited and applications to approximate string searching
Applying an edit distance to the matching of tree ring sequences in dendrochronology
A new upper bound for Max-2-SAT: A graph-theoretic approach
On the number of shortest descending paths on the surface of a convex terrain
Approximate search of short patterns with high error rates using the 01 ⁎ 0 lossless seeds
List total colorings of series-parallel graphs
Fast RNA structure alignment for crossing input structures
Efficient exponential-time algorithms for edit distance between unordered trees
Computing a longest common subsequence that is almost increasing on sequences having no repeated elements
Recognizing graphs without asteroidal triples
Searching for a set of correlated patterns
Approximating the k-traveling repairman problem with repairtimes
The consensus string problem for a metric is NP-complete
Practical algorithms for transposition-invariant string-matching
On strategy improvement algorithms for simple stochastic games
The shortest path problem in the Knödel graph
Position-restricted substring searching over small alphabets
Counting solutions to CSP using generating polynomials
Missing pattern discovery
Optimizing bandwidth allocation in elastic optical networks with application to scheduling
Complexity and lowers bounds for Power Edge Set Problem
On the approximation of the generalized capacitated tree-routing problem
Improved random graph isomorphism
Generating all cycles, chordless cycles, and Hamiltonian cycles with the principle of exclusion
The three squares lemma revisited
Adaptive search over sorted sets
Editorial: Combinatiorial Pattern Matching
Finding dominators via disjoint set union
On the structure of compacted subword graphs of Thue-Morse words and their applications
On parsing optimality for dictionary-based text compression - the Zip case
Gathering six oblivious robots on anonymous symmetric rings
Area-preserving approximations of polygonal paths
The incidence game chromatic number of (a, d)-decomposable graphs
Vertex and edge covers with clustering properties: Complexity and algorithms
Utilitarian resource assignment
Near optimal algorithm for the shortest descending path on the surface of a convex terrain
An algorithm for enumerating all infinite repetitions in a D0L-system
A linear size index for approximate pattern matching
Simple and efficient LZW-compressed multiple pattern matching
Intersection representations of matrices by subtrees and unicycles on graphs
Bit-parallel approximate string matching algorithms with transposition
On the approximation of the single source k-splittable flow problem
On the number of elements to reorder when updating a suffix array
An improved upper bound and algorithm for clique covers
Improved pattern-scan-order algorithms for string matching
Foreword: Special Issue of Journal of Discrete Algorithms on the 26th International Workshop on Graph-Theoretic Concepts in Computer Science (WG '2000) held June 15-17, 2000 in Konstanz, Germany
Non-metric similarity search of tandem mass spectra including posttranslational modifications
Bit-parallel ( delta , gamma )-matching and suffix automata
Range search on tuples of points
The weak-heap data structure: Variants and applications
Selecting distances in arrangements of hyperplanes spanned by points
Student-Project Allocation with preferences over Projects
Bounds from a card trick
Detecting induced star-like minors in polynomial time
The complexity of string partitioning
Sigma-local graphs
On minimum power connectivity problems
An algorithm for road coloring
Improved approximation algorithms for the single-sink buy-at-bulk network design problems
On the expected longest length probe sequence for hashing with separate chaining
Approximating minimum cost source location problems with local vertex-connectivity demands
Convex drawings of hierarchical planar graphs and clustered planar graphs
Extended to multi-tilde-bar regular expressions and efficient finite automata constructions
Testing connectivity of faulty networks in sublinear time
Sparse RNA folding: Time and space efficient algorithms
Efficient offline algorithms for the bicriteria k -server problem and online applications
Efficient Lagrangian heuristics for the two-stage flow shop with job dependent buffer requirements
Space-efficient indexes for forbidden extension queries
Approximation algorithms for shortest descending paths in terrains
xkcd -repeats: A new taxonomy of repeats defined by their context diversity
Corrigendum to "On the negative cost girth problem in planar networks" [Journal of Discrete Algorithms 35 (2015) 40-50]
Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs
Succinct data structures for flexible text retrieval systems
An O(n 3 log⁡log⁡n/log 2 ⁡n) time algorithm for all pairs shortest paths
Power domination in certain chemical structures
On minimum k-modal partitions of permutations
Path coupling without contraction
Dominating induced matchings in graphs without a skew star
On the kernel size of clique cover reductions for random intersection graphs
Approximating vertex cover in dense hypergraphs
d-Transversals of stable sets and vertex covers in weighted bipartite graphs
Regular expression constrained sequence alignment
Bottom-k document retrieval
Burrows-Wheeler transform and LCP array construction in constant space
On-line algorithms for networks of temporal constraints
New applications of interval generators to genome comparison
Randomized algorithm for the k-server problem on decomposable spaces
Improving the algorithm of Bafna and Pevzner for the problem of sorting by transpositions: a practical approach
Computational determination of (3, 11) and (4, 7) cages
Computing sharp 2-factors in claw-free graphs
Preface - Compact Data Structures
Searching for smallest grammars on large sequences and application to DNA
Reducing structural changes in van Emde Boas' data structure to the lower bound for the dynamic predecessor problem
Finding occurrences of protein complexes in protein-protein interaction graphs
On-line suffix tree construction with reduced branching
Approximate string matching on Ziv-Lempel compressed text
Partially dynamic maintenance of minimum weight hyperpaths
Bounded list injective homomorphism for comparative analysis of protein-protein interaction graphs
Subset feedback vertex sets in chordal graphs
Upper and lower I/O bounds for pebbling r-pyramids
Spanners of additively weighted point sets
Popular matchings in the weighted capacitated house allocation problem
Linear time isotonic and unimodal regression in the L 1 and L infinity norms
A pathfinding problem for search trees with unknown edge length
On-line construction of position heaps
Efficient text fingerprinting via Parikh mapping
On weighted efficient total domination
Unranking of small combinations from large sets
Dense trees: a new look at degenerate graphs
Lower bounds for weak sense of direction
Approximate regular expression matching with multi-strings
Bandwidth of bipartite permutation graphs in polynomial time
A subquadratic algorithm for minimum palindromic factorization
On the minimum load coloring problem
Completely connected clustered graphs
Grammar compressed sequences with rank/select support
Tighter approximation bounds for LPT scheduling in two special cases
Crossing minimization in weighted bipartite graphs
Yet another optimal algorithm for 3-edge-connectivity
Exact arithmetic on the Stern-Brocot tree
On the complexity of determining the irregular chromatic index of a graph
Complexity issues in vertex-colored graph pattern matching
A golden ratio parameterized algorithm for Cluster Editing
The lexicographically smallest universal cycle for binary strings with minimum specified weight
Inapproximability and approximability of minimal tree routing and coloring
Computing role assignments of proper interval graphs in polynomial time
Approximating schedules for dynamic process graphs efficiently
HyperQuick algorithm for discrete hypergeometric distribution
Suffix array and Lyndon factorization of a text
A new view on Rural Postman based on Eulerian Extension and Matching
Faster algorithms for computing longest common increasing subsequences
Delay optimization of linear depth boolean circuits with prescribed input arrival times
Approximation results for the weighted P 4 partition problem
Using TPA to count linear extensions
Computing the partial word avoidability indices of ternary patterns
Approximating the 3-period Incremental Knapsack Problem
Cache placement in sensor networks under an update cost constraint
On antimagic labeling of regular graphs with particular factors
Cardinality constrained and multicriteria (multi)cut problems
An efficient Gray code algorithm for generating all permutations with a given major index
Algorithms for shortest paths and d-cycle problems
Prefix and suffix transreversals on binary and ternary strings
Alphabet-independent algorithms for finding context-sensitive repeats in linear time
New dynamic construction techniques for M-tree
Planar bichromatic minimum spanning trees
Path-based supports for hypergraphs
Reverse engineering of compact suffix trees and links: A novel algorithm
Infinite words containing the minimal number of repetitions
On the negative cost girth problem in planar networks
Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences
A tight upper bound on the (2, 1)-total labeling number of outerplanar graphs
A unifying look at the Apostolico-Giancarlo string-matching algorithm
Linear ordering based MIP formulations for the vertex separation or pathwidth problem
Worst-case efficient single and multiple string matching on packed texts in the word-RAM model
Optimizing cost flows by edge cost and capacity upgrade
Threshold behaviour of discordant voting on the complete graph
A note on maximum differential coloring of planar graphs
Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies
String covering with optimal covers
A faster implementation of online RLBWT and its application to LZ77 parsing
The complexity of minimum difference cover
On the analysis of a simple evolutionary algorithm on quadratic pseudo-boolean functions
Parameterized complexity of finding regular induced subgraphs
Bottleneck Steiner tree with bounded number of Steiner vertices
Dynamic shortest paths and transitive closure: Algorithmic techniques and data structures
Cross-document pattern matching
Computing upward topological book embeddings of upward planar digraphs
Constructing non-cyclic pandiagonal Latin squares of prime orders
Lyndon-like and V-order factorizations of strings
Leader election and gathering for asynchronous fat robots without common chirality
Parameterized complexity of finding small degree-constrained subgraphs
Time-space trade-offs for longest common extensions
A suffix tree or not a suffix tree?
Fast index for approximate string matching
Designing optimal- and fast-on-average pattern matching algorithms
Routing permutations and involutions on optical ring networks: complexity results and solution to an open problem
Saturated fully leafed tree-like polyforms and polycubes
Verifiable pattern matching on outsourced texts
Boolean circuit programming: A new paradigm to design parallel algorithms
Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks
Maximum spectral radius of graphs with given connectivity, minimum degree and independence number
Insertion and sorting in a sequence of numbers minimizing the maximum sum of a contiguous subsequence
Exact counting of Euler tours for generalized series-parallel graphs
Fast reoptimization for the minimum spanning tree problem
Computing the Burrows-Wheeler transform of a string and its reverse in parallel
k-Abelian pattern matching
Integer representations towards efficient counting in the bit probe model
Algorithms for generating convex sets in acyclic digraphs
Efficient index for retrieving top-k most frequent documents
Near real-time suffix tree construction via the fringe marked ancestor problem
Indexing text using the Ziv-Lempel trie
Edit distance with move operations
Random generation and enumeration of bipartite permutation graphs
On relating edges in graphs without cycles of length 4
Variations of the parameterized longest previous factor
Number of holes in unavoidable sets of partial words I
Reoptimization of minimum and maximum traveling salesman's tours
Corrections to "Finding dominators via disjoint set union" [J. Discrete Algorithms 23 (2013) 2-20]
Off-line and on-line guaranteed start-up delay for Media-on-Demand with stream merging
Necklaces and Lyndon words in colexicographic and binary reflected Gray code order
Fast equation automaton computation
Approximation schemes for generalized two-dimensional vector packing with application to data placement
Lattices, whose incomparability graphs have horns
DAG reversal is NP-complete
Solving the canonical representation and Star System Problems for proper circular-arc graphs in logspace
Practical and flexible pattern matching over Ziv-Lempel compressed text
All-maximum and all-minimum problems under some measures
Improved approximations for TSP with simple precedence constraints
Approximating Huffman codes in parallel
Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number
Extending common intervals searching from permutations to sequences
Pancake flipping and sorting permutations
Correcting gene tree by removal and modification: Tractability and approximability
A station strategy to deter backoff attacks in IEEE 802.11 LANs
Weak heaps engineered
Fast searching in packed strings