yusuke1997/dblp-id-title huggingface dataset:
Learning of shared attention in sociable robotics
Algorithms for Polyhedral Approximation of Multidimensional Ellipsoids
Sum Multicoloring of Graphs
On Bipartite Matchings of Minimum Density
A Fast Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems
Generating Huffman sequences
Connecting the Maximum Number of Nodes in the Grid to the Boundary with Nonintersecting Line Segments
The Parallel Complexity of TSP Heuristics
Simple constant amortized time generation of fixed length numeric partitions
The complexity of finding small triangulations of convex 3-polytopes
Generating Multiset Permutations in Constant Time
A Stochastic Analysis of the NFD Bin-Packing Algorithm
Improved Bandwidth Approximation for Trees and Chordal Graphs
Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures
A Deterministic Method for Computing Splitting Elements in Simple Algebras over Q
Optimal Randomized EREW PRAM Algorithms for Finding Spanning Forests
Computing with Snakes in Directed Networks of Automata
Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets
A General Best First Search Algorithm in AND/OR Graphs
Dynamization of Order Decomposable Set Problems
An Algorithmic Proof of Tutte's f-Factor Theorem
Solving necklace constraint problems
Convex Hulls of Piecewise-Smooth Jordan Curves
Determining the Evolutionary Tree Using Experiments
Centralized broadcast in multihop radio networks
Approximation algorithms for partial covering problems
Fast Randomized Consensus Using Shared Memory
Design of Practical and Provably Good Random Number Generators
Insufficiency of four known necessary conditions on string unavoidability
Algorithmic Aspects of Tree Amalgamation
Generating Coset Representatives for Permutation Groups
Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops
A modular integer GCD algorithm
Sub-Linear Distributed Algorithms for Sparse Certificates and Biconnected Components
Partial alphabetic trees
Cyclic Interlaced Quadtree Algorithms for Quincunx Multiresolution
Finding Sylow Normalizers in Polynomial Time
Optimal Coarsening of Unstructured Meshes
A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph
Bounds for Naive Multiple Machine Scheduling with Release Times and Deadlines
Minimum Range Balanced Cuts via Dynamic Subset Sums
An Algorithm for Early Unlocking of Entities in Database Transactions
Two-Connected Augmentation Problems in Planar Graphs
Parallel and On-Line Graph Coloring
A General Upper Bound for the Satisfiability Threshold of Random r-SAT Formulae
Edge-Disjoint (s, t)-Paths in Undirected Planar Graphs in Linear Time
Special issue: LSFA'06
Detecting tetrahedralizations of a set of line segments
A Reliable Randomized Algorithm for the Closest-Pair Problem
Splitting Off Edges within a Specified Subset Preserving the Edge-Connectivity of the Graph
Algorithms for Maximum Independent Sets
A (2+epsilon)-Approximation Scheme for Minimum Domination on Circle Graphs
An Even Faster and More Unifying Algorithm for Comparing Trees via Unbalanced Bipartite Matchings
An Algorithm for Finding Hamilton Cycles in Random Directed Graphs
A Heuristic Triangulation Algorithm
Optimal Algorithms for Probabilistic Solitude Detection on Anonymous Rings
New text indexing functionalities of the compressed suffix arrays
Experimental studies of variable selection strategies based on constraint weights
An Analysis of (h, k, 1)-Shellsort
Fast Compact Prime Number Sieves (among Others)
A Simple Parallel Tree Contraction Algorithm
Exhaustive Checking of Sparse Algebras
A Noninductive GL(n, Z) Algorithm That Constructs Integral Linear Relations for n Z-Linearly Dependent Real Numbers
Multiple Optima in Local Search
Faster Parallel String Matching via Larger Deterministic Samples
Approximate Tree Matching in the Presence of Variable Length Don't Cares
Generating Lyndon brackets.: An addendum to: Fast algorithms to generate necklaces, unlabeled necklaces and irreducible polynomials over GF(2)
The Cost Distribution of Queue-Mergesort, Optimal Mergesorts, and Power-of-2 Rules
Repetitive Hidden Surface Removal for Polyhedra
Finding the Maximum, Merging, and Sorting in a Parallel Computation Model
Uniform Generation of Random Regular Graphs of Moderate Degree
Solution to a Linear Diophantine Equation for Nonnegative Integers
Randomized Routing and Sorting on Fixed-Connection Networks
Diameters of Weighted Double Loop Networks
Computing Jacobi Symbols modulo Sparse Integers and Polynomials and Some Applications
A polynomial-time algorithm for near-unanimity graphs
The RPR 2 rounding technique for semidefinite programs
Unsuccessful Search in Self-Adjusting Data Structures
Fast Approximation Algorithms for a Nonconvex Covering Problem
Greedy Packet Scheduling on Shortest Paths
Reconstructing noisy polynomial evaluation in residue rings
NP-Completeness for Minimizing Maximum Edge Length in Grid Embeddings
Complexity of Recognizing Equal Unions in Families of Sets
Edge-Coloring Partial k-Trees
Approximating Maximum Leaf Spanning Trees in Almost Linear Time
Almost All k-Colorable Graphs are Easy to Color
A test suite for the evaluation of mixed multi-unit combinatorial auctions
Computing the Extreme Distances Between Two Convex Polygons
On Crossing Sets, Disjoint Sets, and Pagenumber
NP Completeness of Finding the Chromatic Index of Regular Graphs
On Symmetric Algorithms for Bilinear Forms over Finite Fields
A Polynomial Algorithm for Homomorphisms to Oriented Cycles
The Minimum-Length Generator Sequence Problem is NP-Hard
Polynomial-Time Analysis of Toroidal Periodic Graphs
Polynomial-time approximation schemes for packing and piercing fat objects
Sorting on a Ring of Processors
Parallel Recognition of the Consecutive Ones Property with Applications
On a Conjecture by Plaisted and Hong
Finding Intersection of Rectangles by Range Search
Polygon Containment under Translation
Permutation graphs, fast forward permutations, and sampling the cycle structure of a permutation
Multiway cuts in node weighted graphs
Fast Algorithms for Generating All Maximal Independent Sets of Interval, Circular-Arc and Chordal Graphs
On Linear-Time Deterministic Algorithms for Optimization Problems in Fixed Dimension
FFT-based algorithms for the string matching with mismatches problem
Triangulating a Polygon in Parallel
Largest empty rectangle among a point set
Linear time algorithms for the ring loading problem with demand splitting
SAT graph-based representation: A new perspective
An Algorithm for Parallel Evaluation of Functions
Clausal resolution for normal modal logics
Minimum Path Bases
Parallel Algorithms for Parity Graphs
Analogs & duals of the MAST problem for sequences & trees
The Analysis of a Fringe Heuristic for Binary Search Trees
Exact algorithms for finding minimum transversals in rank-3 hypergraphs
Faster Computation of Bernoulli Numbers
Randomized Online Graph Coloring
An Algorithm for Polynomial Multiplication that Does Not Depend on the Ring Constants
On the Routability of a Convex Grid
Competitive queue policies for differentiated services
A Mixed-Integer Linear Programming Problem which is Efficiently Solvable
Fast Algorithms for k-Shredders and k-Node Connectivity Augmentation
Static and Dynamic Algorithms for k -Point Clustering Problems
Universal Traversal Sequences for Paths and Cycles
Analysis of queueing policies in QoS switches
Nearly On-Line Scheduling of Multiprocessor Systems with Memories
Easy Problems for Tree-Decomposable Graphs
Neuroevolution strategies for episodic reinforcement learning
Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane
Interval Routing on k -Trees
The Probability of Splitters in a List
A linear time algorithm for recognizing regular Boolean functions
Intersection Queries in Curved Objects
Extended Hilbert Irreducibility and Its Applications
Reflected Brownian Bridge area conditioned on its local time at the origin
Approximation Algorithms for Maximization Problems Arising in Graph Partitioning
Approximations for minimum and min-max vehicle routing problems
Algorithms for a Core and k-Tree Core of a Tree
Cycles in random k-ary maps and the poor performance of random number generation
The Virtues of Locking by Symbolic Names
Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs
On the Diameter of the Pancake Network
Improving Greedy Algorithms by Lookahead-Search
On-Line Bin Packing in Linear Time
Linearity and Unprovability of Set Union Problem Strategies. I. Linearity of Strong Postorder
Hash Table Reorganization
An Asynchronous Parallel Algorithm for Undirected Graph Connectivity
A Lower Bound for Elementary Oblivious Routing on Three-Dimensional Meshes
The Parallel Complexity of Tree Embedding Problems
A Static 2-Approximation Algorithm for Vertex Connectivity and Incremental Approximation Algorithms for Edge and Vertex Connectivity
Bipartite Graph Matching for Points on a Line or a Circle
Embedding Graphs with Bounded Treewidth into Their Optimal Hypercubes
Parameterizing above Guaranteed Values: MaxSat and MaxCut
Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems
How to Get a Perfectly Random Sample from a Generic Markov Chain and Generate a Random Spanning Tree of a Directed Graph
Faster Construction of Optimal Binary Split Trees
Eliminating Migration in Multi-processor Scheduling
Data migration to minimize the total completion time
Finding k Points with Minimum Diameter and Related Problems
A Polynomial-Time Algorithm for Finding Regular Simple Paths in Outerplanar Graphs
Augmenting Outerplanar Graphs
Small-Rank Selection in Parallel, with Applications to Heap Construction
An Algorithm for the Modular Decomposition of Hypergraphs
Recovery in Distributed Systems Using Optimistic Message Logging and Checkpointing
Domino Treewidth
Ultafast Expected Time Parallel Algorithms
Augmenting Edge-Connectivity over the Entire Range in Õ(nm) Time
Interval selection: Applications, algorithms, and lower bounds
Optimal Partitioning of Sequences
Finding Approximate Patterns in Strings
On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs
Approximation algorithms for array partitioning problems
An efficient parameterized algorithm for m -set packing
Efficient Merging and Construction of Evolutionary Trees
Minimal String Difference Encodings
A Linear Algorithm for Determining the Separation of Convex Polyhedra
External selection
A Faster Implementation of a Parallel Tree Contraction Scheme and Its Application on Distance-Hereditary Graphs
The Analysis of a Simple In-Place Merging Algorithm
Efficient Algorithms for Finding a Core of a Tree with a Specified Length
Maximum Matchings in General Graphs Through Randomization
Irreducibility testing of lacunary 0, 1-polynomials
On the Complexity of Circulations
Efficient Algorithms for Listing Unlabeled Graphs
Linear Expected-Time Algorithms for Connectivity Problems
The Random Selection of Unlabeled Graphs
A 5/4 Algorithm for Two-Dimensional Packing
Parallel Algorithms with Processor Failures and Delays
Finding the Number of Factors of a Polynomial
Finding the Edge Connectivity of Directed Graphs
A New Upper Bound for Shellsort
Problems Complete for Deterministic Logarithmic Space
Pattern Matching in Hypertext
On-Line Planar Graph Embedding
Algorithms for non-uniform size data placement on parallel disks
Recognizing Visibility Graphs of Spiral Polygons
A multivariate view of random bucket digital search trees
How Many Comparisons Does Quicksort Use?
Simpler and faster biconnectivity augmentation
Fly Cheaply: On the Minimum Fuel Consumption Problem
Lower Bounds for Combinatorial Problems on Graphs
Efficient Approximation Algorithms for Tiling and Packing Problems with Rectangles
An Approximate Probabilistic Model for Structured Gaussian Elimination
A Personnel Assignment Problem
Dynamic Text Indexing under String Updates
Graph minimum linear arrangement by multilevel weighted edge contractions
Transformations on Words
A Loopless Gray-Code Algorithm for Listing k-ary Trees
A Polynomial Time Algorithm for Unidimensional Unfolding Representations
A probabilistic model for the degree of the cancellation polynomial in Gosper's algorithm
A 4/3-approximation for the minimum 2-local-vertex-connectivity augmentation in a connected graph
Objective Bayesian probabilistic logic
Polynomial time approximation schemes for general multiprocessor job shop scheduling
The Recognition of Double Euler Trails in Series-Parallel Networks
Parallel Shortcutting of Rooted Trees
Fault-Local Distributed Mending
Generation of Maximum Independent Sets of a Bipartite Graph and Maximum Cliques of a Circular-Arc Graph
Gossip is synteny: Incomplete gossip and the syntenic distance between genomes
Construction of linear tree-layouts which are optimal with respect to vertex separation in linear time
Probability-Based Game Tree Pruning
An Efficient Algorithm for the "Stable Roommates" Problem
A Simple Algorithm for the Planar Multiway Cut Problem
Ranking and Unranking of B-Trees
The Complexity of Data Reduction on a Reconfigurable Linear Array
Scheduling with Concurrency-Based Constraints
On the Average-Case Complexity of "Bucketing" Algorithms
Parallel Algorithms for Cographs and Parity Graphs with Applications
A Fast Parallel Algorithm to Color a Graph with Delta Colors
Average Costs of a Graph Exploration: Upper and Lower Bounds
A Poset Dimension Algorithm
On-Line Load Balancing for Related Machines
A polynomial time approximation scheme for the two-source minimum routing cost spanning trees
Fast Solution of Linear Systems with Polynomial Coefficients over the Ring of Integers
Approximation algorithms for MAX-MIN tiling
Scheduling data transfers in a network and the set scheduling problem
An online throughput-competitive algorithm for multicast routing and admission control
Dynamic Huffman Coding
Polynomial time recognition of unit circular-arc graphs
Virtual logarithms
A linear time algorithm for scheduling outforests with communication delays on three processors
Computing shortest paths with uncertainty
An Efficient Algorithm for Controller Synthesis under Full Observation
On Finding Non-Intersecting Straightline Connections of Grid Points to the Boundary
Very Fast Approximation of the Matrix Chain Product Problem
New Algorithms for Selection
A New Approximation Algorithm for the Steiner Tree Problem with Performance Ratio 5/3
The Complexity of Generating an Exponentially Distributed Variate
Computing pi(x): An Analytic Method
Zero Divisors in Quaternion Algebras
A constructive enumeration of fusenes and benzenoids
Minimizing the total completion time on-line on a single machine, using restarts
On the Minimum Number of Additions Required to Compute a Quadratic Form
The Greedy Coloring Is a Bad Probabilistic Algorithm
A constant factor approximation algorithm for the fault-tolerant facility location problem
Geometric separation and exact solutions for the parameterized independent set problem on disk graphs
On-Line Load Balancing of Temporary Tasks
Approximation Algorithms for Dispersion Problems
A New Memoryless Algorithm for De Bruijn Sequences
Single Round Simulation on Radio Networks
Designing Least-Cost Nonblocking Broadband Networks
Building Heaps Fast
Tight Bounds for the Maximum Acyclic Subgraph Problem
Semi-matchings for bipartite graphs and load balancing
Searching and Storing Similar Lists
The Expected Length of the Longest Probe Sequence for Bucket Searching when the Distribution is Not Uniform
Gray Codes for the Ideals of Interval Orders
Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence
Slide-The Key to Polynomial End-to-End Communication
On Finding and Updating Shortest Paths Distributively
Parameterized self-adjusting heaps
Estimating the maximum
Fitting points on the real line and its application to RH mapping
Worst-Case Complexity Bounds for Algorithms in the Theory of Integral Quadratic Forms
Cut Tree Algorithms: An Experimental Study
On Parallel Hashing and Integer Sorting
Compact floor-planning via orderly spanning trees
More Efficient Algorithm for Ordered Tree Inclusion
Adjacent Interchange Generation of Combinations
A Faster Algorithm for the Inverse Spanning Tree Problem
Optimal mappings with minimum number of connected components in tree-to-tree comparison problems
Efficient Parallel Algorithms for Graphs of Bounded Tree-Width
Security, Verifiability, and Universality in Distributed Computing
Irreducible Polynomials with Integral Coefficients Have Succinct Certificates
On the average performance of orthogonal range search in multidimensional data structures
An Algorithm for Constructing m-ary de Bruijn Sequences
Recognizing Disguised NR(1) Instances of the Satisfiability Problem
Graphs with Branchwidth at Most Three
Searching Ordered Structures
An approximation algorithm for finding long paths in Hamiltonian graphs
An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs
The Set of Minimal Braids is co-NP-Complete
On an Efficient Dynamic Programming Technique of F. F. Yao
The Complexity of Partial Match Retrieval in a Dynamic Setting
A better algorithm for sequencing with release and delivery times on identical machines
Twist-Rotation Transformations of Binary Trees and Arithmetic Expressions
Efficient and Robust Sharing of Memory in Message-Passing Systems
An Efficient Algorithm for Generating All k-Subsets (1 <= k <= m <= n) of the Set { 1, 2, ..., n } in Lexicographical Order
Randomized Sorting in O(n log log n) Time and Linear Space Using Addition, Shift, and Bit-wise Boolean Operations
Computing the Principal Branch of log-Gamma
Uniform consensus is harder than consensus
Approximation algorithms for spreading points
Computing the Visibility Polygon from a Convex Set and Related Problems
The Minimum Spanning Strong Subdigraph Problem for Extended Semicomplete Digraphs and Semicomplete Bipartite Digraphs
The dominating set problem is fixed parameter tractable for graphs of bounded genus
Simple Optimal Parallel Multiple Pattern Matching
Gauss Codes, Planar Hamiltonian Graphs, and Stack-Sortable Permutations
Competitive Algorithms for Server Problems
Past-future separation and normal forms in temporal predicate logic specifications
Computational Complexities of Diophantine Equations with Parameters
A Generalization of the Fast LUP Matrix Decomposition Algorithm and Applications
Model checking with Boolean Satisfiability
On the complexity of bicoloring clique hypergraphs of graphs
A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
Parallel Complexity of Sorting Problems
Competitive Paging Algorithms
Calculating the 2-Variable Polynomial for Knots Presented as Closed Braids
Solving NP-hard semirandom graph problems in polynomial expected time
The Theory and Computation of Evolutionary Distances: Pattern Recognition
Generating and Counting Hamilton Cycles in Random Regular Graphs
The Measure Problem for Rectangular Ranges in d-Space
Oblivious Gossiping on Tori
The Complexity of Scheduling Trees with Communication Delays
How to Allocate Network Centers
Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is True
Splay trees: a reweighing lemma and a proof of competitiveness vs. dynamic balanced trees
Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets
On-Line Coloring of Sparse Random Graphs and Random Trees
Improved Constants for Some Separator Theorems
Tight bounds for the performance of Longest In System on DAGs
Generosity Helps or an 11-Competitive Algorithm for Three Servers
Binary Tree Algebraic Computation and Parallel Algorithms for Simple Graphs
Improved approximation of Max-Cut on graphs of bounded degree
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
Seat reservation allowing seat changes
Logarithmic Depth Circuits for Hermite Interpolation
On the Common Substring Alignment Problem
Packing cycles in undirected graphs
Chordless Paths, Odd Holes, and Kernels in Graphs without m-Obstructions
A More Efficient Algorithm for Lattice Basis Reduction
Linear Time Algorithms for Knapsack Problems with Bounded Weights
Optimal non-preemptive semi-online scheduling on two related machines
Probabilistic Analysis of Algorithms for Dual Bin Packing Problems
A primal-dual schema based approximation algorithm for the element connectivity problem
The Byzantine Generals Strike Again
Distance and routing labeling schemes for non-positively curved plane graphs
Searching in 2-Dimensional Partial Orders
More Efficient Parallel Totally Monotone Matrix Searching
Approximate Set Covering in Uniform Hypergraphs
Average Running Time of the Fast Fourier Transform
Transitive Compaction in Parallel via Branchings
Circle Shooting in a Simple Polygon
Dictionary Look-Up with One Error
A Parallel Fault Identification Algorithm
Adaptive Heapsort
Multicuts in unweighted graphs and digraphs with bounded degree and bounded tree-width
A General Approach to Dominance in the Plane
Degree constrained book embeddings
Sorting with Minimum Data Movement
On Deletion in Threaded Binary Trees
Computing the Diameter in Multiple-Loop Networks
Alphabet-Independent and Scaled Dictionary Matching
Fast Algorithms to Generate Necklaces, Unlabeled Necklaces, and Irreducible Polynomials over GF(2)
On the Asymptotic Worst Case Behavior of Harmonic Fit
Direct-Chaining with Coalescing Lists
Low Energy and Mutually Distant Sampling
Repeated Random Insertion into a Priority Queue
Acyclic Hypergraph Projections
Polygon Graph Recognition
Sylow Subgroups in Parallel
Reliable Broadcasting in Logarithmic Time with Byzantine Link Failures
Counting the Integers Factorable via Cyclotomic Methods
Efficient communication in an ad-hoc network
A Constructive Enumeration of Fullerenes
A "Retraction" Method for Planning the Motion of a Disc
Multiplying Schur functions
Sequential and Parallel Approximation of Shortest Superstrings
Coins with Arbitrary Weights
A wide-range algorithm for minimal triangulation from an arbitrary ordering
Single-Machine Scheduling to Minimize a Function of Two or Three Maximum Cost Criteria
Multiobjektive Heuristic Search in AND/OR Graphs
A Lower Bound for Probabilistic Distributed Algorithms
A Contraction Algorithm for Finding Small Cycle Cutsets
Addition Requirements for Matrix and Transposed Matrix Products
A Delaunay Refinement Algorithm for Quality 2-Dimensional Mesh Generation
Maintenance of a Minimum Spanning Forest in a Dynamic Plane Graph
How Helpers Hasten h-Relations
On the Generation of All Topological Sortings
A Two-Dimensional Bin-Packing Model of Preemptive, FIFO Storage Allocation
Probabilistic Computation of Integer Polynomial GCDs
A Better Approximation Ratio for the Minimum Size k -Edge-Connected Spanning Subgraph Problem
On fairness in the carpool problem
On the 2-Chain Subgraph Cover and Related Problems
Optimal Space Distributed Order-Preserving Lists
Fast Distributed Algorithms for Brooks-Vizing Colorings
Single Bend Wiring
Conditional location of path and tree shaped facilities on trees
Off-Line Maintenance of Planar Configurations
Average-case complexity of single-source shortest-paths algorithms: lower and upper bounds
The Rotation Graph of Binary Trees is Hamiltonian
An Analysis of Optimum Caching
Choosing Subsets with Maximum Weighted Average
Experimenting with parallelism for the instantiation of ASP programs
A Space-Efficient On-Line Method of Computing Quantile Estimates
Generating Sparse 2-Spanners
Finding the Convex Hull Facet by Facet
Certain Systems of Bilinear Forms Whose Minimal Algorithms Are All Quadratic
On Rectangular Visibility
CTL AgentSpeak(L): A specification language for agent programs
Factoring Polynomials Over Finite Fields
Fault Tolerant Distributed Majority Commitment
Text Indexing and Dictionary Matching with One Error
Evaluation of a MULTIFIT-Based Scheduling Algorithm
Lower Bounds for Shellsort
A Unified Approach to the Analysis of Bilinear Algorithms
Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers
NP-Complete Stable Matching Problems
A Linear 5-Coloring Algorithm of Planar Graphs
Heuristic Algorithms for On-Line Packing in Three Dimensions