yusuke1997/dblp-id-title huggingface dataset:
Coloring k-colorable graphs using relatively small palettes
The NP-Completeness Column: An Ongoing Guide
Searching and Sorting Real Numbers
Optimal Binary Split Trees
Fast Parallel Strong Orientation of Mixed Graphs and Related Augmentation Problems
Efficient Parallel Algorithms for Series Parallel Graphs
Edge Coloring Series Parallel Graphs
Digital Access to Comparison-Based Tree Data Structures and Algorithms
Algorithms for Degree Constrained Graph Factors of Minimum Deficiency
Monotonicity in Graph Searching
Efficient Algorithms for Finding the Maximum Number of Disjoint Paths in Grids
The Dyadic Stream Merging Algorithm
Scheduling Precedence Graphs of Bounded Height
A 2-Approximation Algorithm for Finding an Optimum 3-Vertex-Connected Spanning Subgraph
An Exact Analysis of Stable Allocation
Derandomization in Computational Geometry
On the Complexity of Calculating Factorials
On Linear Time Minor Tests with Depth-First Search
Isomorph-Free Exhaustive Generation
On efficient fixed-parameter algorithms for weighted vertex cover
On Finding the Core of a Tree with a Specified Length
On external-memory MST, SSSP and multi-way planar graph separation
A Better than "Best Possible" Algorithm to Edge Color Multigraphs
Computing the Convex Hull of Line Intersections
On a Dual Version of the One-Dimensional Bin Packing Problem
On-Line Paging Against Adversarially Biased Random Inputs
Polynomials over finite fields free from large and small degree irreducible factors
A Probabilistic Algorithm for Computing Hough Transforms
Selection on Mesh Connected Computers with Fixed and Reconfigurable Buses
A Subquadratic Algorithm for Constructing Approximately Optimal Binary Search Trees
Finding the Smallest Triangles Containing a Given Convex Polygon
Computing a Minimum Weightk-Link Path in Graphs with the Concave Monge Property
The Traveler's Problem
2-local 4/3-competitive algorithm for multicoloring hexagonal graphs
A Gray Code for the Ideals of a Forest Poset
Dispatching in perfectly-periodic schedules
Tree Powers
Some Open Problems in Computational Molecular Biology
Compact roundtrip routing in directed networks
The 2-Center Problem with Obstacles
Rectangular drawings of planar graphs
The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields
The Bit-Complexity of Arithmetic Algorithms
The Stable Roommates Problem with Ties
Algorithms for Page Retrieval and Hamiltonian Paths on Forward-Convex Line Graphs
A Classification of Algorithms for Multiplying Polynomials of Small Degree over Finite Fields
A Linear Algorithm for Nonhomogeneous Spectra of Numbers
A Non-Factorial Algorithm for Canonical Numbering of a Graph
Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs
Domination in Permutation Graphs
An Algorithmic Involution for p(n)
An Efficient Reconstruction of a Graph from its Line Graph in Parallel
Two Algorithms for Unranking Arborescences
The Guessing Secrets problem: a probabilistic approach
Analysis of Carry Propagation in Addition: An Elementary Approach
Worst-case time bounds for coloring and satisfiability problems
Packing and Covering the Plane with Translates of a Convex Polygon
The Shortest Network under a Given Topology
New Upper Bounds for Maximum Satisfiability
Algorithms for Graphic Polymatroids and Parametris s-Sets
Spreading Rumors Rapidly Despite an Adversary
Minimizing end-to-end delay in high-speed networks with a simple coordinated schedule
An Improved Algorithm for the Planar 3-Cut Problem
Corrigendum: A Note on Computing the Visibility Polygon from a Convex Chain
An efficient graph algorithm for dominance constraints
Approximate Indexed Lists
Efficient Maintenance of the Union of Intervals on a Line, with Applications
Implementation of Simultaneous Memory Address Access in Models That Forbid It
Fastest Pattern Matching in Strings
On generalized gossiping and broadcasting
Weighted Binary Trees for Concurrent Searching
Variable-Priority Queue and Doughnut Routing
Algorithms for optimal multi-resolution quantization
Improved Approximation Algorithms for Weighted 2- and 3-Vertex Connectivity Augmentation Problems
Parallel Strategies for Geometric Probing
Self-Organizing Lists and Independent References: A Statistical Synergy
On Selecting a Random Shifted Young Tableau
Improved Approximation Algorithms for MAX SAT
On the Number of Queries Necessary to Identify a Permutation
Fractional Cascading Revisited
Optimal Quantization by Matrix Searching
Approximate coloring of uniform hypergraphs
Circular arrangements and cyclic broadcast scheduling
Fast Algorithms forK4Immersion Testing
The Complexity of Dehn's Algorithm for Word Problems in Groups
Computing Normalizers in Permutation Groups
A Parallel Algorithm for Constructing Minimum Spanning Trees
Tighter Bounds on the Solution of a Divide-and-Conquer Maximin Recurrence
Efficient Dynamic Embeddings of Binary Trees into Hypercubes
Hypercube and Shuffle-Exchange Algorithms for Image Component Labeling
Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
Approximating Clique and Biclique Problems
A Necessary and Sufficient Condition for the Existence of a Complete Stable Matching
The Isomorphism Problem For Directed Path Graphs and For Rooted Directed Path Graphs
Biased Random Walks, Lyapunov Functions, and Stochastic Analysis of Best Fit Bin Packing
Time-Work Tradeoffs of the Single-Source Shortest Paths Problem
Cutwidth I: A linear time fixed parameter algorithm
Parallel Algorithms for Hierarchical Clustering and Applications to Split Decomposition and Parity Graph Recognition
Online Scheduling with Hard Deadlines
Two Algorithms for the Sieve Method
A New Algorithm for the Generation of Binary de Bruijn Sequences
Constructing Trees with Prescribed Cardinalities for the Components of Their Vertex Deleted Subgraphs
Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
The k-Client Problem
Constructing Optimal Trees from Quartets
A New Proof of the Garsia-Wachs Algorithm
Efficient Approximation Schemes for Maximization Problems on K 3,3 -free or K 5 -free Graphs
Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs
A Subquadratic Algorithm for Approximate Regular Expression Matching
Finding Scores in Tournaments
Computing a Segment Center for a Planar Point Set
An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle
In Memoriam: Paris C. Kanellakis (1953-1995)
Inverse Pattern Matching
On Markov Chains for Randomly H-Coloring a Graph
Constructing Reliable Communication Networks of Small Weight Online
Efficient parallel exponentiation in GF(qn) using normal basis representations
A Theoretical Analysis of Backtracking in the Graph Coloring Problem
Complexity Results for Scheduling Tasks with Discrete Starting Times
Efficient Preprocessing of Simple Binay Pattern Forests
A new kind of graph coloring
Processor Efficient Parallel Solution of Linear Systems of Equations
Superlinear Bounds for Matrix Searching Problems
A 3-Approximation Algorithm for Finding Optimum 4, 5-Vertex-Connected Spanning Subgraphs
Tree Compatibility and Inferring Evolutionary History
Corrigendum: Dynamization of Order Decomposable Set Problems
Edge Weight Reduction Problems in Directed Acyclic Graphs
The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform
Weighted Heuristic Search in Networks
Approximation Algorithms for Scheduling Arithmetic Expressions on Pipelined Machines
Probing Convex Polygons with Half-Planes
A Linear Algorithm for Edge-Coloring Series-Parallel Multigraphs
Analysis of the Space of Search Trees under the Random Insertion Algorithm
A Parallel Game Tree Search Algorithm with a Linear Speedup
Improving Minimum Cost Spanning Trees by Upgrading Nodes
A Polynomial Algorithm for Minimal Interval Representation
Optimal Time-Space Tradeoff for Shared Memory Leader Election
Robust Linear Algorithms for Cutsets
Heuristic Matching for Graphs Satisfying the Triangle Inequality
Directed Graph Pattern Matching and Topological Embedding
Cutwidth II: Algorithms for partial w-trees of bounded degree
Fault-Tolerant Broadcasting in Radio Networks
Optimality and Greed in Dynamic Allocation
On the Complexity of Searching Game Trees and Other Recursion Trees
Approximating Coloring and Maximum Independent Sets in 3-Uniform Hypergraphs
The Worst Case in Shellsort and Related Algorithms
A Tighter Upper Bound on the Worst Case Behavior of Conway's Parallel Sorting Algorithm
Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
Polynomial-Time Versions of Sylow's Theorem
Constructing set systems with prescribed intersection sizes
The Towers of Hanoi Rainbow Problem: Coloring the Rings
Faster Subtree Isomorphism
A Nonquadratic Minimal Algorithm for a System of Quadratic Forms
An algorithmic sign-reversing involution for special rim-hook tableaux
Deletion Algorithms for Hashing That Preserve Randomness
A Small Approximately Min-Wise Independent Family of Hash Functions
An O(n log m) Algorithm for the Josephus Problem
Compositional competitiveness for distributed algorithms
An O(n) Algorithm to Find a Near-Optimum Partition of a Convex Polygon
On approximating a geometric prize-collecting traveling salesman problem with time windows
A New Way of Using Semidefinite Programming with Applications to Linear Equations mod p
Algorithms with large domination ratio
Erratum: Finding the Contour of a Union of Iso-Oriented Rectangles
An improved approximation algorithm for the ATSP with parameterized triangle inequality
Parameterized complexity: exponential speed-up for planar graph problems
Generating Random Combinatorial Objects
Generalized Riemann Hypothesis and Factoring Polynomials over Finite Fields
The Exact Path Length Problem
A Uniform Approach to the Analysis of Trie Structures That Store Prefixing-Keys
A Weighted Matroid Intersection Algorithm
Corrigendum: Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph
The Optimal Representation of Disjoint Iso-Oriented Rectangles in Two-Dimensional Trees
Edge Separators of Planar and Outerplanar Graphs with Applications
Even Directed Cycles in H -Free Digraphs
An Algorithm to Determine When Certain Sets Have 0-Density
Refinements of Miller's algorithm for computing the Weil/Tate pairing
Complexity of preemptive minsum scheduling on unrelated parallel machines
On Assessing the Performance of Randomized Algorithms
Efficient Computation of Rectilinear Geodesic Voronoi Neighbor in the Presence of Obstacles
O(n^(2.55)) Time Algorithms for the Subgraph Homeomorphism Problem on Trees
Traversing Layered Graphs Using the Work Function Algorithm
Point Retrieval for Polygons
On Envelopes of Arrangements of Lines
Transposition invariant string matching
A Parallel Blocking Flow Algorithm for Acyclic Networks
Approximating Element-Weighted Vertex Deletion Problems for the Complete k-Partite Property
Gauss' Algorithm Revisited
Approximation of pathwidth of outerplanar graphs
Generating Random Regular Graphs
A formal framework for quantifying voter-controlled privacy
Solving satisfiability in the tile assembly model with a constant-size tileset
Deterministic Dictionaries
The Parametric Behavior of the First-Fit Decreasing Bin Packing Algorithm
Estimating all pairs shortest paths in restricted graph families: a unified approach
An Optimal Algorithm for Finding all the Jumps of a Monotone Step-Function
Generating the Acyclic Orientations of a Graph
Efficient Parallel Algorithms for Edge Coloring Problems
Optimum Split Trees
Ray Shooting Amidst Convex Polygons in 2D
Analysis of Hashing with Chaining in the Prime Area
The Concave Least-Weight Subsequence Problem Revisited
An O(n² log n) Parallel MAX-FLOW Algorithm
Fast Parallel Algorithms for Finding Hamiltonian Paths and Cycles in a Tournament
Lowest common ancestors in trees and directed acyclic graphs
A heuristic for the Stacker Crane Problem on trees which is almost surely exact
Broadcasting algorithms in radio networks with unknown topology
Analysis in distribution of two randomized algorithms for finding the maximum in a broadcast communication model
The Spanning Bound as a Measure of Range Query Complexity
A Linear Algorithm for a Core of a Tree
Computing Chow Forms and Some Applications
Efficient algorithms for a constrained k -tree core problem in a tree network
Erratum to "Some properties of nonstar steps in addition chains and new cases where the Scholz conjecture is true": [J. Algorithms 42 (2002) 304-316]
A Faster Algorithm for Finding the Minimum Cut in a Directed Graph
An O(n²) Algorithm for Undirected Split Decompositon
An Optimal Algorithm for Finding Minimal Enclosing Triangles
Multiterminal Flows in Outerplanar Networks
A Survey of Fast Exponentiation Methods
Multi-Dimensional Pattern Matching with Dimensional Wildcards: Data Structures and Optimal On-Line Search Algorithms
k-k Routing, k-k Sorting, and Cut-Through Routing on the Mesh
An Efficient Implementation of a Scaling Minimum-Cost Flow Algorithm
Corrigendum: Finding the Contour of a Union of Iso-Oriented Rectangles
A Theorem on the Expected Complexity of Dijkstra's Shortest Path Algorithm
A 2-approximation algorithm for path coloring on a restricted class of trees of rings
[Delta]-stepping: a parallelizable shortest path algorithm
Combinatorial Solutions of Multidimensional Divide-and-Conquer Recurrences
Logarithmic inapproximability of the radio broadcast problem
Approximating Layout Problems on Random Geometric Graphs
Batched Dynamic Solutions to Decomposable Searching Problems
Dynamical analysis of alpha-Euclidean algorithms
Modeling preferences and conditional preferences on resource consumption and production in ASP
Intensional dynamic programming. A Rosetta stone for structured dynamic programming
A Polynomial Time Algorithm for Finding a Cycle Covering a Given Set of Vertices in a Semicomplete Multipartite Digraph
Sequential and Distributed Graph Coloring Algorithms with Performance Analysis in Random Graph Spaces
3-coloring in time O(1.3289 n )
Covering Polygons Is Hard
A Probabilistic Analysis of the Next-Fit Bin Packing Algorithm
An Efficient Parallel Algorithm for Finding Hamiltonian Cycles in Dense Directed Graphs
Distributed Computing on Anonymous Hypercube Networks
The Graph Genus Problem is NP-Complete
Reversing Trains: A Turn of the Century Sorting Problem
Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network
Automatically Increasing the Fault-Tolerance of Distributed Algorithms
Techniques for scheduling with rejection
Factoring into coprimes in essentially linear time
Finding the Minimum-Cost Maximum Flow in a Series-Parallel Network
Rates of convergence for Quicksort
Finding Real-Valued Single-Source Shortest Paths in o(n 3 ) Expected Time
Self-Alignments in Words and Their Applications
Random Pseudo-Polynomial Algorithms for Exact Matroid Problems
An Improved Algorithm for the Rectangle Enclosure Problem
The Complexity of Congestion-1 Embedding in a Hypercube
An Improved Block-Interchange Algorithm
Posted price profit maximization for multicast by approximating fixed points
Approximating Node-Deletion Problems for Matroidal Properties
The Uniform Selection of Free Trees
Fixed-Bucket Binary Storage Trees
Efficient Minimum Cost Matching and Transportation Using the Quadrangle Inequality
An O(log* n) Approximation Algorithm for the Asymmetric p -Center Problem
Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms
A Polynomial Algorithm for Hamiltonian-Connectedness in Semicomplete Digraphs
Graph Minors. II. Algorithmic Aspects of Tree-Width
Recognizing Greedy Structures
Treewidth of Chordal Bipartite Graphs
Dynamic Orthogonal Segment Intersection Search
Edge-Coloring Bipartite Graphs
On Rotations and the Generation of Binary Trees
Polynomial-Time Algorithms for Finding Elements of Prime Order and Sylow Subgroups
On Separable Clusterings
Binary Tree Gray Codes
Finding Critical Sets
An 'All Pairs Shortest Paths' Distributed Algorithm Using 2n² Messages
Optimal Expected-Time Algorithms for Merging
On Computing the Subset Graph of a Collection of Sets
Rectangular Tiling in Multidimensional Arrays
Approximation Algorithms for Network Design Problems on Bounded Subsets
A Polynomial Time Approximation Scheme for Optimal Product-Requirement Communication Spanning Trees
On Optimal Arrangements of Keys with Double Hashing
Factorization of Polynomials over Finite Fields and Decomposition of Primes in Algebraic Number Fields
Characterizations of Totally Balanced Matrices
Unranking and Ranking Spanning Trees of a Graph
Large Deviations for Quicksort
An O(log n) Parallel Connectivity Algorithm
Depth-Size Trade-Offs for Parallel Prefix Computation
Fast Parallel and Serial Approximate String Matching
Efficient and Practical Algorithms for Sequential Modular Decomposition
On Dynamic Algorithms for Algebraic Problems
RCRA 2007: Experimental evaluation of algorithms for solving problems with combinatorial explosion
The 1-Steiner Tree Problem
Scheduling Transmissions in a Network
alpha-Connectivity: A Gradually Nonparallel Graph Problem
Sequence of Operations Analysis for Dynamic Data Structures
On the Set LCS and Set-Set LCS Problems
The Additive and Logical Complexities of Linear and Bilinear Arithmetic Algorithms
Dynamic Ray Shooting and Shortest Paths in Planar Subdivisions via Balanced Geodesic Triangulations
Hash Table Collision Resolution with Direct Chaining
Approximating the Minimum-Degree Steiner Tree to within One of Optimal
Strategies and simulations in a semantic framework
Conway's Parallel Sorting Algorithm
The Distributed k-Server Problem - A Competitive Distributed Translator for k-Server Algorithms
Khachiyan's Linear Programming Algorithm
Improved Routing Strategies with Succinct Tables
The moving-target traveling salesman problem
Diagnosability of regular systems
An Algorithmic Proof that Semiorders are Representable
Independent Sets in Circular-Arc Graphs
Last-Come-First-Served Hashing
Fast Algorithms for the Unit Cost Editing Distance Between Trees
Efficient Data Structures for Range Searching on a Grid
Rotations of Periodic Strings and Short Superstrings
Sequence Comparison with Mixed Convex and Concave Costs
Simplified Stable Merging Tasks
Enclosing a Set of Objects by Two Minimum Area Rectangles
Fast Algorithms for Edge-Coloring Planar Graphs
Nonpreemptive Ensemble Motion Planning on a Tree
Some Efficient Algorithms for Permutation Graphs
Constructing Piecewise Linear Homeomorphisms of Simple Polygons
Growing a Tree from Its Branches
Resource augmentation for online bounded space bin packing
A Linear Time Algorithm for Finding a k-Tree Core
Fast Algorithms for Direct Enclosures and Direct Dominances
Regular expression transformations to extend regular languages (with application to a Datalog XML schema validator)
Selecting the branches for an evolutionary tree.: A polynomial time approximation scheme
On Markov Chains for Independent Sets
Generating Necklaces
Convex Hulls for Random Lines
Minimum Coloring k-Colorable Graphs in Polynomial Average Time
Wavelength rerouting in optical networks, or the Venetian Routing problem
On the Comparison Complexity of the String Prefix-Matching Problem
An Optimal Algorithm for Geometrical Congruence
Minimum Bases for Permutation Groups: The Greedy Approximation
General Partitioning on Random Graphs
On Finding Minimal Two-Connected Subgraphs
Triply-Logarithmic Parallel Upper and Lower Bounds for Minimum and Range Minima over Small Domains
A Simpler Parallel Algorithm for Graph Conectivity
Analysis of Two Simple Heuristics on a Random Instance of k-SAT
Approximation Algorithms for Steiner and Directed Multicuts
Monte-Carlo Approximation Algorithms for Enumeration Problems
On Traversing Layered Graphs On-Line
Expected search duration for finite backtracking adaptive search
Genus g Graphs Have Pagenumber O(sqrt(g))
Algorithms for Leader Election by Cellular Automata
A normal form which preserves tautologies and contradictions in a class of fuzzy logics
Improved Dynamic Text Indexing
Shape from Probing
Two Fast GCD Algorithms
On the Distribution of Running Times of Certain Integer Factoring Algorithms
Sparse Dynamic Programming for Longest Common Subsequence from Fragments
On Bipartite and Multipartite Clique Problems
Parallel algorithms for P 4 -comparability graphs
Subadditive Lifting Methods for Partitioning and Knapsack Problems
Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles
A New Multichannel Recursive Least Squares Algorithm for Very Robust and Efficient Adaptive Filtering
Convolution of Vectors over the Real Field of Constants by Evaluation - Interpolation Algorithms
New Algorithm for Ordered Tree-to-Tree Correction Problem
Improved Approximation Algorithms for Uniform Connectivity Problems
Shifting Algorithms for Tree Partitioning with General Weighting Functions
Minimum Fill-in on Circle and Circular-Arc Graphs
z-Approximations
On the Best Case of Heapsort
A Separator Theorem for Graphs of Bounded Genus
The Complexity of Identifying Redundant and Essential Elements
Minimizing Maximum Weighted Error for Imprecise Computation Tasks
TSP with neighborhoods of varying size
On the Computational Complexity of Continuous Routing
Graphs with E Edges Have Pagenumber O(sqrt(E))
Toward Optimal epsilon-Approximate Nearest Neighbor Algorithms
Counting Minimum Weight Spanning Trees
Stochastic local search for large-scale instances of the haplotype inference problem by pure parsimony
Coloring Planar Graphs in Parallel
Kayles and Nimbers
An Almost-Greedy Search on Random Binary Vectors and Random Graphs
Bichromatic separability with two boxes: A general approach
Deterministic sorting in O( n loglog n ) time and linear space
The Algorithmic Aspects of the Regularity Lemma
An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment
Quadripartite Sort
Optimal Multiway Split Trees
Generating the Maximum Spanning Trees of a Weighted Graph
Placing Resources on a Growing Line
Minimum Color Sum of Bipartite Graphs
An improved data stream summary: the count-min sketch and its applications
Finding the Contour of a Union of Iso-Oriented Rectangles
Self-Organizing Doubly-Linked Lists
On a Special Case of Uniform Processor Scheduling
On Four-Connecting a Triconnected Graph
Graph Sandwich Problems
Using Homogeneous Weights for Approximating the Partial Cover Problem
Fast Canonization of Circular Strings
Open Problems Presented at SCG'98
Dynamic TCP acknowledgment in the LogP model
The Loading Time Scheduling Problem
Vector assignment problems: a general framework
Improved Edge-Coloring Algorithms for Planar Graphs
The Solution of Some Random NP-Hard Problems in Polynomial Expected Time
Better Expanders and Superconcentrators
On the Complexity of Dualization of Monotone Disjunctive Normal Forms
A Time/Space Tradeoff for In-Place Array Permutation
A Randomized Parallel Algorithm for Single-Source Shortest Paths
Speeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology
On-line Dynamic Programming with Applications to the Prediction of RNA Secondary Structure
Asymptotically Optimal Algorithms for Job Shop Scheduling and Packet Routing
A (2+epsilon)-approximation algorithm for the generalized preemptive open shop problem with minsum objective
Fast Distributed Construction of Small k -Dominating Sets and Applications
An asymptotic theory for Cauchy-Euler differential equations with applications to the analysis of algorithms
Fast broadcasting and gossiping in radio networks
Linear Probing: The Probable Largest Search Time Grows Logarithmically with the Number of Records
Partitioning with Two Lines in the Plane
Factorizing Words over an Ordered Alphabet
Online Navigation in a Room
The k -Steiner Ratio in the Rectilinear Plane
Baked-Potato Routing
Optimal Algorithm for the Nearest Common Dominator Problem
Algorithms for Two Bottleneck Optimization Problems
Cubesort: A Parallel Algorithm for Sorting N Data Items with S-Sorters
Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem
Finding a Minimum Feedback Arc Set in Reducible Flow Graphs
Inverse parametric sequence alignment
Thresholds and optimal binary comparison search trees
A Combinatorial Characterization of the Distributed 1-Solvable Tasks