yusuke1997/dblp-id-title huggingface dataset:
To fill or not to fill: The gas station problem
Sparse Euclidean Spanners with Tiny Diameter
An Optimal Algorithm for ℓ 1 -Heavy Hitters in Insertion Streams and Related Problems
Computing rank-convolutions with a mask
A linear algorithm for computing convex hulls for random lines
Randomized fast design of short DNA words
On the minimum common integer partition problem
Near-Optimal Time-Energy Tradeoffs for Deterministic Leader Election
On network design problems: fixed cost flows and the covering steiner problem
Windows scheduling as a restricted version of bin packing
Families with Infants: Speeding Up Algorithms for NP-Hard Problems Using FFT
Envy-free pricing in multi-item markets
An approximation algorithm for scheduling malleable tasks under general precedence constraints
Faster and Simpler Sketches of Valuation Functions
Fully compressed suffix trees
Online Optimization with Uncertain Information
An Improved Drift Theorem for Balanced Allocations
Shortest vertex-disjoint two-face paths in planar graphs
Maintaining the Union of Unit Discs under Insertions with Near-Optimal Overhead
Approximating corridors and tours via restriction and relaxation techniques
The traveling salesman problem in bounded degree graphs
Tight Space Bounds for Two-Dimensional Approximate Range Counting
Fully dynamic algorithms for chordal graphs and split graphs
Entropy-based bounds for online algorithms
Enumerating Minimal Dominating Sets in Kt-free Graphs and Variants
A Learned Approach to Design Compressed Rank/Select Data Structures
Tabulating Pseudoprimes and Tabulating Liars
Getting the best response for your erg
Constant factor approximations for the hotlink assignment problem
Breaking the Barrier of 2 for the Competitiveness of Longest Queue Drop
Peeling Close to the Orientability Threshold Spatial Coupling in Hashing-Based Data Structures
Approximating the distance to monotonicity in high dimensions
A maiden analysis of longest wait first
Scale-Free Compact Routing Schemes in Networks of Low Doubling Dimension
Known Algorithms on Graphs of Bounded Treewidth Are Probably Optimal
Faster Approximation Schemes for the Two-Dimensional Knapsack Problem
A Data Structure for Nearest Common Ancestors with Linking
The fréchet distance revisited and extended
Algorithms to Approximate Column-sparse Packing Problems
Geometric clustering: Fixed-parameter tractability and lower bounds with respect to the dimension
Competitive buffer management for shared-memory switches
Perfect Phylogenies via Branchings in Acyclic Digraphs and a Generalization of Dilworth's Theorem
Detecting Feedback Vertex Sets of Size k in O ⋆ (2.7 k ) Time
Addendum to "Dominator Tree Certification and Divergent Spanning Trees"
Polynomial-time Algorithm for Maximum Weight Independent Set on P 6 -free Graphs
A new upper bound 2.5545 on 2D Online Bin Packing
Finding equitable convex partitions of points in a polygon efficiently
Individual displacements for linear probing hashing with different insertion policies
Computing MEMs and Relatives on Repetitive Text Collections
Smoothed analysis of left-to-right maxima with applications
Sparse Fault-Tolerant BFS Structures
Optimal Partitioning for Dual-Pivot Quicksort
A better approximation ratio for the vertex cover problem
Parallel Algorithms and Concentration Bounds for the Lovász Local Lemma via Witness DAGs
Fully dynamic randomized algorithms for graph spanners
Improved Deterministic Algorithms for Decremental Reachability and Strongly Connected Components
Compacting cuts: A new linear formulation for minimum cut
Introduction to the ACM-SIAM Symposium on Discrete Algorithms (SODA) 2019 Special Issue
Analysis of linear combination algorithms in cryptography
PTAS for Sparse General-valued CSPs
Dynamic programming for graphs on surfaces
Distributed weighted vertex cover via maximal matchings
A New Algorithm for Fast Generalized DFTs
Counting occurrences for a finite set of words: Combinatorial methods
A Fast and Simple Surface Reconstruction Algorithm
How to probe for an extreme value
Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions
A 4 k 2 kernel for feedback vertex set
Elimination graphs
Optimally scheduling video-on-demand to minimize delay when sender and receiver bandwidth may differ
Inverse auctions: Injecting unique minima into random sets
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2023 Special Issue
The relative worst order ratio for online algorithms
Prize-collecting steiner network problems
Hopcroft's Problem, Log* Shaving, Two-dimensional Fractional Cascading, and Decision Trees
Improved online algorithms for the sorting buffer problem on line metrics
Finding 3-shredders efficiently
Minimizing movement in mobile facility location problems
The collective memory of amnesic processes
Smaller Cuts, Higher Lower Bounds
k -apices of Minor-closed Graph Classes. II. Parameterized Algorithms
Memoryless facility location in one pass
Foreword to special issue on SODA 2002
Polynomial constraint satisfaction problems, graph bisection, and the Ising partition function
Maximizing k -Submodular Functions and Beyond
Routing selfish unsplittable traffic
Faster Replacement Paths and Distance Sensitivity Oracles
How well can primal-dual and local-ratio algorithms perform?
Clustering lines in high-dimensional space: Classification of incomplete data
Combinatorial Generation via Permutation Languages. IV. Elimination Trees
Approximating Rooted Steiner Networks
Online Vertex-Weighted Bipartite Matching: Beating 1-1/ e with Random Arrivals
Faster Algorithms for Semi-Matching Problems
Improved Approximation Algorithm for Steiner k -Forest with Nearly Uniform Weights
Exploring the Complexity of Layout Parameters in Tournaments and Semicomplete Digraphs
Foreword to the Special Issue on SODA'11
Bypassing UGC from Some Optimal Geometric Inapproximability Results
An optimal decomposition algorithm for tree edit distance
Computing the Distance between Piecewise-Linear Bivariate Functions
Improved approximation results for the stable marriage problem
Labeling schemes for vertex connectivity
Dynamic entropy-compressed sequences and full-text indexes
Dominator Tree Certification and Divergent Spanning Trees
Fixed-parameter algorithms for ( k , r )-center in planar graphs and map graphs
Constraint Solving via Fractional Edge Covers
Tight Complexity Bounds for Counting Generalized Dominating Sets in Bounded-Treewidth Graphs - Part I: Algorithmic Results
Average-case lower bounds for the plurality problem
An O ( n log n ) approximation scheme for Steiner tree in planar graphs
Kernels for (Connected) Dominating Set on Graphs with Excluded Topological Minors
Introduction to SODA 2002 and 2003 special issue
A Simpler and Parallelizable \(\boldsymbol{O(\sqrt{\log n})}\)-Approximation Algorithm for Sparsest Cut
Succinct indexable dictionaries with applications to encoding k -ary trees, prefix sums and multisets
The tree inclusion problem: In linear space and faster
An Improved Isomorphism Test for Bounded-tree-width Graphs
The NP-completeness column: The many limits on approximation
Generating rooted and free plane trees
Geometric optimization and sums of algebraic functions
Constructing pairwise disjoint paths with few links
An improved algorithm for radio broadcast
An Optimal O ( nm ) Algorithm for Enumerating All Walks Common to All Closed Edge-covering Walks of a Graph
Minimizing mean flow time for UET tasks
Completeness for First-order Properties on Sparse Structures with Algorithmic Applications
Adversarial Queuing on the Multiple Access Channel
Convergence time to Nash equilibrium in load balancing
Online scheduling of packets with agreeable deadlines
Finding a Shortest Odd Hole
Flow-augmentation II: Undirected Graphs
Structure Learning of H-Colorings
I/O-efficient shortest path algorithms for undirected graphs with random or bounded edge lengths
Algorithmic aspects of bandwidth trading
Data structures for mergeable trees
Submatrix Maximum Queries in Monge and Partial Monge Matrices Are Equivalent to Predecessor Search
A Simple and Efficient Algorithm for Computing Market Equilibria
A Time- and Message-Optimal Distributed Algorithm for Minimum Spanning Trees
Analyzing Node-Weighted Oblivious Matching Problem via Continuous LP with Jump Discontinuity
Perfect Resolution of Strong Conflict-Free Colouring of Interval Hypergraphs
Distributed Algorithms for End-to-End Packet Scheduling in Wireless Ad Hoc Networks
Dynamic routing schemes for graphs with low local density
Ramsey Spanning Trees and Their Applications
Point-Width and Max-CSPs
Linear-time String Indexing and Analysis in Small Space
Mechanism design for fractional scheduling on unrelated machines
How to trim a MST: A 2-Approximation algorithm for minimum cost-tree cover
Recognizing k -Leaf Powers in Polynomial Time, for Constant k
Computing equilibria for a service provider game with (Im)perfect information
Replacement paths and k simple shortest paths in unweighted directed graphs
Pricing multicasting in more flexible network models
Faster Spectral Sparsification and Numerical Algorithms for SDD Matrices
Distributed Online and Stochastic Queueing on a Multiple Access Channel
Randomized Contractions Meet Lean Decompositions
On the difficulty of some shortest path problems
Optimal Pattern Matching in LZW Compressed Strings
4 vs 7 Sparse Undirected Unweighted Diameter Is SETH-hard at Time n 4/3
Shortest paths in directed planar graphs with negative lengths: A linear-space O ( n log 2 n )-time algorithm
Segmentation of Trajectories on Nonmonotone Criteria
Randomized minimum spanning tree algorithms using exponentially fewer random bits
Counting Thin Subgraphs via Packings Faster than Meet-in-the-Middle Time
Efficient Constructions of the Prefer-Same and Prefer-Opposite de Bruijn Sequences
Tight Bounds for ℓ 1 Oblivious Subspace Embeddings
Holant Clones and the Approximability of Conservative Holant Problems
Sharing the cost more efficiently: Improved approximation for multicommodity rent-or-buy
Nearest-Neighbor Searching Under Uncertainty II
Optimal Bounds for Johnson-Lindenstrauss Transforms and Streaming Problems with Subconstant Error
Persistent Predecessor Search and Orthogonal Point Location on the Word RAM
Asymptotically Optimal Encodings of Range Data Structures for Selection and Top- k Queries
Parameterized Approximation Schemes for Biclique-Free Max k -Weight SAT and Max Coverage
The compressed permuterm index
Strongly stable matchings in time O ( nm ) and extension to the hospitals-residents problem
Sum edge coloring of multigraphs via configuration LP
Tight Bounds on Vertex Connectivity Under Sampling
Online Coalition Formation under Random Arrival or Coalition Dissolution
SETH-based Lower Bounds for Subset Sum and Bicriteria Path
Sublinear-Time Maintenance of Breadth-First Spanning Trees in Partially Dynamic Networks
The Complexity of Independent Set Reconfiguration on Bipartite Graphs
A linear-time approximation algorithm for weighted matchings in graphs
On exact algorithms for treewidth
Compressed representations of sequences and full-text indexes
Dense subgraph problems with output-density conditions
Sparse Text Indexing in Small Space
An FPTAS for the minimum total weighted tardiness problem with a fixed number of distinct due dates
Generating Random Permutations by Coin Tossing: Classical Algorithms, New Analysis, and Modern Implementation
Fixed-Parameter Algorithms for Minimum-Cost Edge-Connectivity Augmentation
Stream Sampling Framework and Application for Frequency Cap Statistics
Jitter regulation for multiple streams
Maximizing the Minimum Load for Random Processing Times
The cyclic multi-peg Tower of Hanoi
A linear-time algorithm to find a separator in a graph excluding a minor
Fast Zeta Transforms for Lattices with Few Irreducibles
Optimal branch-decomposition of planar graphs in O ( n 3 ) Time
On the hardness of losing weight
On an infinite family of solvable Hanoi graphs
Hierarchical bin buffering: Online local moments for dynamic external memory arrays
Clique-width III: Hamiltonian Cycle and the Odd Case of Graph Coloring
Algorithms for capacitated rectangle stabbing and lot sizing with joint set-up costs
Lopsidependency in the Moser-Tardos Framework: Beyond the Lopsided Lovász Local Lemma
Scheduling When You Do Not Know the Number of Machines
S-T connectivity on digraphs with a known stationary distribution
Compact dictionaries for variable-length keys and data with applications
Approximating Geometric Knapsack via L-packings
Optimality of an algorithm solving the Bottleneck Tower of Hanoi problem
Metastability of the Logit Dynamics for Asymptotically Well-Behaved Potential Games
Online Service with Delay
Approximation Schemes for Low-rank Binary Matrix Approximation Problems
Succinct indexes for strings, binary relations and multilabeled trees
The register function for t -ary trees
Balanced families of perfect hash functions and their applications
An Improved Approximation for k -Median and Positive Correlation in Budgeted Optimization
Cost-Oblivious Storage Reallocation
Tight Approximation Algorithms for 2D Guillotine Strip Packing
On approximating multicriteria TSP
Exact and Asymptotic Solutions of a Divide-and-Conquer Recurrence Dividing at Half: Theory and Applications
Polynomial-time Trace Reconstruction in the Smoothed Complexity Model
Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
r -Simple k -Path and Related Problems Parameterized by k / r
Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs
The Minset-Poset Approach to Representations of Graph Connectivity
An improved approximation algorithm for resource allocation
Faster algorithms for sorting by transpositions and sorting by block interchanges
Minimum+1 ( s, t )-cuts and Dual-edge Sensitivity Oracle
An Improved Algorithm for The k -Dyck Edit Distance Problem
Approximation algorithms for the sex-equal stable marriage problem
Parallel pipelined filter ordering with precedence constraints
Quasiconvex analysis of multivariate recurrence equations for backtracking algorithms
A Lottery Model for Center-Type Problems With Outliers
Succinct ordinal trees based on tree covering
Compression via Matroids: A Randomized Polynomial Kernel for Odd Cycle Transversal
CoveringLSH: Locality-Sensitive Hashing without False Negatives
Generic Non-recursive Suffix Array Construction
Quasipolynomial Multicut-mimicking Networks and Kernels for Multiway Cut Problems
A Dual Descent Algorithm for Node-capacitated Multiflow Problems and Its Applications
Set connectivity problems in undirected graphs and the directed steiner network problem
Clustering, community partition and disjoint spanning trees
Dynamic Beats Fixed: On Phase-based Algorithms for File Migration
Generic Techniques for Building Top- k Structures
The NP-completeness column: Finding needles in haystacks
Submatrix Maximum Queries in Monge Matrices and Partial Monge Matrices, and Their Applications
Improved approximations for the hotlink assignment problem
Online conflict-free coloring for halfplanes, congruent disks, and axis-parallel rectangles
Exponential Separations in the Energy Complexity of Leader Election
Carry propagation in multiplication by constants
Finding the k shortest simple paths: A new algorithm and its implementation
Submodular secretary problem and extensions
Ordered Level Planarity and Its Relationship to Geodesic Planarity, Bi-Monotonicity, and Variations of Level Planarity
Even Faster Exact Bandwidth
LIMITS and Applications of Group Algebras for Parameterized Problems
Distributed Private Data Analysis: Lower Bounds and Practical Constructions
Compressed Cache-Oblivious String B-Tree
Low distortion spanners
Cycle detection and correction
Approximation Algorithms for Minimum-Load k -Facility Location
Alternation and redundancy analysis of the intersection problem
Scalable High-Quality Hypergraph Partitioning
k -center Clustering under Perturbation Resilience
Approximation algorithms for the capacitated minimum spanning tree problem and its variants in network design
Linear time 3-approximation for the MAST problem
Approximate Single-Source Fault Tolerant Shortest Path
Online Submodular Maximization with Free Disposal
The relative worst order ratio applied to seat reservation
The smoothed complexity of edit distance
Approximate parameterized matching
Average Case and Distributional Analysis of Dual-Pivot Quicksort
Kernelization Lower Bounds Through Colors and IDs
Network Design for s - t Effective Resistance
All-pairs shortest paths for unweighted undirected graphs in o ( mn ) time
Constant-time Dynamic (Δ +1)-Coloring
Time Dependent Biased Random Walks
Ordinal embeddings of minimum relaxation: General properties, trees, and ultrametrics
Updating relaxed K -d trees
Minimizing flow time in the wireless gathering problem
Parametric analysis for ungapped Markov models of evolution
Mapping Simple Polygons: The Power of Telling Convex from Reflex
The role of ontologies in smart contracts: A systematic literature review
Understanding information needs of agile teams to improve requirements communication
A Novel graph-embedded musical chairs optimization with secure elliptic encryption framework for intelligent edge computing in healthcare iot networks
An outranking method with Dombi aggregation operators based on multi-polar fuzzy Z-numbers for selection of best rehabilitation center
Proximal policy optimization with population-based variable neighborhood search algorithm for coordinating photo-etching and acid-etching processes in sustainable storage chip manufacturing
Manufacturing process scheduling method based on multi-level and cross-chain collaboration under industrial internet environment
Data-driven invariant modelling patterns for digital twin design
An EMD-based forecasting framework integrating GMM and BiLSTM for helicopter engine anomaly detection
Analysis of relevant standards for industrial systems to support zero defects manufacturing process
Rail surface defect detection using a transformer-based network
A comprehensive review of AI-driven plant stress monitoring and embedded sensor technology: Agriculture 5.0
Improving efficiency and quality of operational industrial production assets information management in customer-vendor interaction
Ontology-based solutions for interoperability among product lifecycle management systems: A systematic literature review
Design of a federated ensemble model for intrusion detection in distributed IIoT networks for enhancing cybersecurity
Securing the digital world: Protecting smart infrastructures and digital industries with artificial intelligence (AI)-enabled malware and intrusion detection
Sustainable building material supplier assessment in Pythagorean neutrosophic setting using ITARA and MACONT methods
Anomaly detection in NetFlow network traffic using supervised machine learning algorithms
Bill-of-materials visualization for aerospace & defense: A digital transformation retrospective
Multi-agent digital twinning for collaborative logistics: Framework and implementation
Sustainable planning battery electric buses charging station under two decision-making criteria
Certificateless anti-quantum blind signcryption for e-cash
Blockchain-based quality management for a digital additive manufacturing part record
Multi-dimensional modeling and abnormality handling of digital twin shop floor
Intelligent optimization of particle size distribution in unscreened recycled coarse aggregates using 3D surface analysis
OCEAN: A multi agent system dedicated to knowledge management
Managing lifecycle of product information with an ontology-based knowledge framework
A cost-efficient one time password-based authentication in cloud environment using equal length cellular automata
The reviews and analysis of the state-of-the-art service workflow specification languages
Structural information integration for predicting damages in bridges
Hybrid flow-shop scheduling in collaborative manufacturing with a multi-crossover-operator genetic algorithm
Information integration framework for a public-private partnership system of an urban railway transit project (Part B: An empirical application)
Graph neural networks to model and optimize the operation of Water Distribution Networks: A review
Surfing twin transition in agri-food supply chains: The role of iot and data analytics in sustainable decision-making
Agent based web service composition using Q-learning algorithm with puffer fish optimization and petri net model
Artificial intelligence use in collaborative network processes
A review of logistics Internet-of-Things: Current trends and scope for future research
Bottom-up green manufacturing strategy in the wire and cable industry: A Z-DEMATEL approach for identifying critical success criteria
Exploring how to use virtual tours to create an interactive customer remote experience
Analysis of models and methods and perspectives for corridor allocation problem: a literature review
Graph reinforcement learning based dynamic scheduling for human-machine symbiosis manufacturing considering multi-type disturbance events
Dynamic modelling and multidisciplinary injury-based design optimization of driver workspace in high-speed train collisions
Internet of Everything and Digital Twin enabled Service Platform for Cold Chain Logistics
A Secure Scheme for Network Coding with Deep Learning in Industrial Internet of Things
Data enabling technology in digital twin and its frameworks in different industrial applications
A data-driven scheduling approach to smart manufacturing
Industrial blockchain threshold signatures in federated learning for unified space-air-ground-sea model training
Quantum machine learning: Classifications, challenges, and solutions
Assessment model for Industry 5.0: A holistic approach to readiness and integration
Real-Time implementation and performance analysis of robust 2-DOF PID controller for Maglev system using pole search technique
Combining blockchain and IoT for safe and transparent nuclear waste management: A prototype implementation
Information integration framework for a public-private partnership system of an urban railway transit project (Part A: System architecture)
Energy-efficient open-shop scheduling with multiple automated guided vehicles and deteriorating jobs
A Blockchain assisted fog computing for secure distributed storage system for IoT Applications
Integrated location and routing for cold chain logistics networks with heterogeneous customer demand
Evaluating digital transformation readiness in prefabricated construction supply chains: A multi-level model and fairness-aware optimization approach
Development of a model for the dynamic formation of supplier networks
Mixed time-triggered and event-triggered industrial controller in IoT environment
An application-time-window based credibility assessment method for equipment digital twins in manufacturing
Ontology network to support the integration of planning and scheduling activities in batch process industries
Reliability estimation using an integrated support vector regression - variable neighborhood search model
Efficient large-scale biomedical ontology matching with anchor-based biomedical ontology partitioning and compact geometric semantic genetic programming
CPSD 2 : A new approach for cyber-physical systems design and development
Digital Twin-driven cross-domain fault diagnosis for axial piston pumps via deep transfer learning under small-sample condition
Fault detection in Tennessee Eastman process with temporal deep learning models
Geometric deep learning as an enabler for data consistency and interoperability in manufacturing
A hybrid MCDM approach for order distribution in a multiple-supplier supply chain: A case study
Integrating digital transformation with human-centric factors strategies to enhance organisational process performance: The H.O.P.E. model
Enhancing semantic search using ontologies: A hybrid information retrieval approach for industrial text
Overview: Application status and prospects of digital twin technology in mechanical cutting processing
Real-time force monitoring of smart grippers for Internet of Things (IoT) applications
Logistics-involved task scheduling in cloud manufacturing with offline deep reinforcement learning