yusuke1997/dblp-id-title huggingface dataset:
Securing Two-factor Authentication for Smartphones in a Usable Way by Adding a Connected Token
KISS On My List: Improving Platform Security and User Privacy by Simplifying the Android Permissions Model
Simplified Harvest Moon is NP-Complete
I Aver: Providing Declarative Experiment Specifications Facilitates the Evaluation of Computer Systems Research
Recency is good: expanding with fresh news improves event detection in Twitter
Detecting DNS Censorship without an internal vantage point
Extending Simultaneous Localization and Mapping to Resource Limited Micro-Aerial Vehicle Swarms
Data Publishing Using Nanopublications
On the Security of Conference and Journal Submission Sites
Punctuation has a point, so use it!
An Upper-Bound on Information Contained Within a Tweet
How to aggregate software metrics?
Adaptation is a Game
On Regular Expression Matching and Deterministic Finite Automata
Bots are Users, Too! Rethinking the Roles of Software Agents in HCI
The end of TinyToCS is nigh
Experienced old eyes can look young in HCI research
Cognitive computing leads to the next level of answering questions on the Web
Impact of Mobility on Link Quality and Packet Loss in Low-Power Radios
Fake Emulation Environment to Prevent Malware from Executing
On finding cross-lingual article pairs
Conceptualizing Transparency on Online Social Networks
The More the Merrier: Leveraging on the Bug Inflow to Guide Software Maintenance
The Full Mont(olog)y: Using Ontologies to Optimize the CS Literature Review
Non-transparent recommender system evaluation leads to misleading results
Towards Secure Decoy Routing by Using SDN
Drawing Insights from "Big Data" Machine Learning Literature using Textual Features Why are some novels considered to be literature? A. predictive model of literary judgments shows that textual features are important. Andreas van Cranenburgh: Reducing Mobile Throttling from Temperature by Offloading Apps
Effects of Centralized and Distributed Version Control on Commit Granularity
First-order theorem proving in the exploration of Andrews-Curtis conjecture
Narrowing the Readability Gap Between Scientific Papers and the World Wide Web
How to Authenticate any Data Structure
A Framework for Testing Properties of Discrete Distributions: Monotonicity, Independence, and More
C/C++ Causal Cycles Confound Compositionality
A Novel Approach for Fault Diagnosis on Computational Grids
HW Databases, Where art Thou?
Smart Thread Scheduling is the Key for OLTP
A Network-Aware Access Control System for Providing Good Enough Security to Low Value Information
TinyTOCS as an Experimental Laboratory
Preimage Attacks Against Spectral Hash and PTX Functions
Collecting Things Under Time Pressure is Hard
33 Bits of Entropy: Myths and Fallacies of "Personally Identifiable Information"
Discriminating Similar Languages: Persian and Dari
Relative Comfort of People with Acting Robots by Theatre and Technology Experience
Fast sparse matrix multiplication
Partial convex recolorings of trees and galled networks: Tight upper and lower bounds
All-Or-Nothing Generalized Assignment with Application to Scheduling Advertising Campaigns
Combinatorial bounds via measure and conquer: Bounding minimal dominating sets and applications
Fast Sampling via Spectral Independence Beyond Bounded-degree Graphs
Approximation Schemes for Machine Scheduling with Resource (In-)dependent Processing Times
Randomized rendezvous with limited memory
Melding priority queues
Wireless scheduling with power control
Graph Reconstruction and Verification
Subcubic Equivalences between Graph Centrality Problems, APSP, and Diameter
Approximation Algorithms for a Minimization Variant of the Order-Preserving Submatrices and for Biclustering Problems
Balanced parentheses strike back
Approximation algorithms for a facility location problem with service capacities
Solving the Sigma-Tau Problem
Broadcast scheduling: Algorithms and complexity
Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts
Multiplierless multiple constant multiplication
Assignment problem in content distribution networks: Unsplittable hard-capacitated facility location
Primal Dual Gives Almost Optimal Energy-Efficient Online Algorithms
Fault-Tolerant Approximate BFS Structures
Distributed Dominating Set Approximations beyond Planar Graphs
An O ( n 2.75 ) algorithm for incremental topological ordering
Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond
Nearly ETH-tight Algorithms for Planar Steiner Tree with Terminals on Few Faces
Improving the Smoothed Complexity of FLIP for Max Cut Problems
Latency-constrained aggregation in sensor networks
A Linear-Time Algorithm for Seeds Computation
Subexponential Parameterized Algorithm for Interval Completion
The Traveling Salesman Problem for Lines, Balls, and Planes
Editorial to the Special Issue on SODA'12
Max-Sum Diversification, Monotone Submodular Functions, and Dynamic Updates
Range searching on uncertain data
Combinatorial dominance guarantees for problems with infeasible solutions
A Colored Path Problem and Its Applications
Uniform deterministic dictionaries
Introduction to the Special Issue on SODA'18
The optimality of the online greedy algorithm in carpool and chairman assignment problems
A Mazing 2+ϵ Approximation for Unsplittable Flow on a Path
Semi-Streaming Set Cover
An explicit universal cycle for the ( n -1)-permutations of an n -set
Deciding the Confusability of Words under Tandem Repeats in Linear Time
Label Cover Instances with Large Girth and the Hardness of Approximating Basic k -Spanner
On the matrix berlekamp-massey algorithm
Optimizing throughput and energy in online deadline scheduling
Ranked Document Retrieval in External Memory
Inapproximability of the Multilevel Uncapacitated Facility Location Problem
A 1.8 approximation algorithm for augmenting edge-connectivity of a graph from 1 to 2
A near-linear-time algorithm for computing replacement paths in planar directed graphs
Approximating ( k,ℓ )-Median Clustering for Polygonal Curves
Entropy and Optimal Compression of Some General Plane Trees
Deterministic Sparse Suffix Sorting in the Restore Model
Race to idle: New algorithms for speed scaling with a sleep state
Geodesic delaunay triangulations in bounded planar domains
Geodesic Fréchet distance inside a simple polygon
Cache-Oblivious Buffer Heap and Cache-Efficient Computation of Shortest Paths in Graphs
Approximating the distance to properties in bounded-degree and general sparse graphs
Minimum cycle bases: Faster and simpler
Periods of Iterations of Functions with Restricted Preimage Sizes
Derandomized Concentration Bounds for Polynomials, and Hypergraph Maximal Independent Set
Combinatiorial algorithms for wireless information flow
How to meet asynchronously (almost) everywhere
Minimum Makespan Multi-Vehicle Dial-a-Ride
Node-weighted Network Design in Planar and Minor-closed Families of Graphs
Forbidden-Set Distance Labels for Graphs of Bounded Doubling Dimension
Clustering for metric and nonmetric distance measures
Enumeration of isolated cliques and pseudo-cliques
Faster fixed parameter tractable algorithms for finding feedback vertex sets
An O ( VE ) algorithm for ear decompositions of matching-covered graphs
A Complexity Theoretical Study of Fuzzy K -Means
On the Expected Complexity of Voronoi Diagrams on Terrains
Finding witnesses by peeling
Computing the Inverse Geodesic Length in Planar Graphs and Graphs of Bounded Treewidth
Determining plurality
Principles of Robust Medium Access and an Application to Leader Election
Agnostic Learning in Permutation-Invariant Domains
Kinetic and dynamic data structures for closest pair and all nearest neighbors
Min st -Cut Oracle for Planar Graphs with Near-Linear Preprocessing Time
Approximating minimum-cost connectivity problems via uncrossable bifamilies
Limitations of cross-monotonic cost-sharing schemes
Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020
A New Approach to Incremental Cycle Detection and Related Problems
Problems column
Improved bounds for scheduling conflicting jobs with minsum criteria
Energy-efficient algorithms for flow time minimization
A Simple Algorithm for Optimal Search Trees with Two-way Comparisons
A Face Cover Perspective to ℓ 1 Embeddings of Planar Graphs
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts
Navigating in Trees with Permanently Noisy Advice
Online Throughput Maximization on Unrelated Machines: Commitment is No Burden
On hard instances of approximate vertex cover
Deletion Without Rebalancing in Binary Search Trees
Time- and Space-optimal Algorithm for the Many-visits TSP
Optimal Substring Equality Queries with Applications to Sparse Text Indexing
Streaming and fully dynamic centralized algorithms for constructing and maintaining sparse spanners
Cluster Editing Parameterized above Modification-disjoint P 3 -packings
Maximum Cardinality f -Matching in Time O ( n 2/3 m )
Gathering Despite Mischief
Improved algorithms for optimal embeddings
Almost-Optimal Deterministic Treasure Hunt in Unweighted Graphs
On the online unit clustering problem
Multidimensional online tracking
Max-coloring and online coloring with bandwidths on interval graphs
Black box for constant-time insertion in priority queues (note)
Data Structures for Path Queries
Improved Learning-Augmented Algorithms and (Tight) Lower Bounds for Multi-Option Ski Rental Problem
An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two
Optimal-Time Dictionary-Compressed Indexes
Near-optimal Algorithms for Stochastic Online Bin Packing
Fine-grained Complexity Analysis of Two Classic TSP Variants
Faster Pseudopolynomial Time Algorithms for Subset Sum
A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs
Speed Scaling with an Arbitrary Power Function
Dial a Ride from k -forest
The Query Complexity of Searching Trees with Permanently Noisy Advice
Tree Containment above Minimum Degree Is FPT
Polylogarithmic Approximation Algorithms for Weighted-ℱ-deletion Problems
Optimal Las Vegas Approximate Near Neighbors in ℓ p
An O (log k )-Competitive Algorithm for Generalized Caching
Partial fillup and search time in LC tries
Novel architectures for P2P applications: The continuous-discrete approach
Writing-all deterministically and optimally using a nontrivial number of asynchronous processors
Time-dependent multi-scheduling of multicast
Smoothed Analysis of the 2-Opt Algorithm for the General TSP
Packing element-disjoint steiner trees
Approximation Algorithms and Hardness of the k -Route Cut Problem
Width of Points in the Streaming Model
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2021 Special Issue
Nondecreasing paths in a weighted graph or: How to optimally read a train schedule
Zeros of Holant Problems: Locations and Algorithms
Polynomial-time algorithms for minimum energy scheduling
The Non-Uniform k -Center Problem
An online scalable algorithm for average flow time in broadcast scheduling
Erratum: Approximating Minimum-Cost Connectivity Problems via Uncrossable Bifamilies
On the Complexity of Symmetric vs. Functional PCSPs
Oblivious Resampling Oracles and Parallel Algorithms for the Lopsided Lovász Local Lemma
Approximation schemes for wireless networks
Spider Covers for Prize-Collecting Network Activation Problem
Approximation Algorithms for Stochastic Submodular Set Cover with Applications to Boolean Function Evaluation and Min-Knapsack
Representative Families of Product Families
Nearest-neighbor-preserving embeddings
Randomized Memoryless Algorithms for the Weighted and the Generalized k -server Problems
Counting List Homomorphisms from Graphs of Bounded Treewidth: Tight Complexity Bounds
A generalized minimum cost k -clustering
Pattern matching for arc-annotated sequences
Map Matching Queries on Realistic Input Graphs Under the Fréchet Distance
Optimal lower bounds for projective list update algorithms
Fast Constructions of Lightweight Spanners for General Graphs
Improved algorithms for weakly chordal graphs
Foreword to special issue on SODA 2008
Testing nilpotence of galois groups in polynomial time
Exponential Separations in Local Privacy
Classification via Two-Way Comparisons
Decision trees for entity identification: Approximation algorithms and hardness results
Quasirandom Rumor Spreading
On Computing the k -Shortcut Fréchet Distance
A Bounded Budget Network Creation Game
Bootstrapping a hop-optimal network in the weak sensor model
Rectangular layouts and contact graphs
Discrete Fréchet Distance under Translation: Conditional Hardness and an Improved Algorithm
Fast computation of small cuts via cycle space sampling
Compressed indexes for dynamic text collections
Finding small separators in linear time via treewidth reduction
A 4/3-Approximation Algorithm for the Minimum 2-Edge Connected Subgraph Problem
Sparse Sums of Positive Semidefinite Matrices
Testing Bounded Arboricity
Approximating the minimum quadratic assignment problems
The effectiveness of stackelberg strategies and tolls for network congestion games
Periodicity testing with sublinear samples and space
Random Walks on Small World Networks
Weighted popular matchings
Fast asynchronous Byzantine agreement and leader election with full information
Incremental Cycle Detection, Topological Ordering, and Strong Component Maintenance
Average-case analysis of some plurality algorithms
Bicriteria approximation tradeoff for the node-cost budget problem
Online nonpreemptive scheduling of equal-length jobs on two identical machines
Toward Optimal Self-Adjusting Heaps
Sublinear estimation of entropy and information distances
The Complexity of Approximately Counting Retractions to Square-free Graphs
Popular Arborescences and Their Matroid Generalization
Faster Parameterized Algorithms Using Linear Programming
Algorithmic construction of sets for k -restrictions
An O(log n)-Approximation Algorithm for the Edge-Disjoint Paths Problem in Eulerian Planar Graphs
Constrained pattern matching
Path decomposition under a new cost measure with applications to optical network design
Tight Lower Bound for the Channel Assignment Problem
Additive spanners and (alpha, beta)-spanners
A Cubic Algorithm for Computing the Hermite Normal Form of a Nonsingular Integer Matrix
Improved online algorithms for buffer management in QoS switches
Fully Dynamic (Δ +1)-Coloring in O (1) Update Time
Length-bounded cuts and flows
Strict Fibonacci Heaps
Binary Adder Circuits of Asymptotically Minimum Depth, Linear Size, and Fan-Out Two
Phase changes in random point quadtrees
Fully Functional Static and Dynamic Succinct Trees
Kernel(s) for problems with no kernel: On out-trees with many leaves
A Tractable Class of Binary VCSPs via M-Convex Intersection
A loopless Gray code for rooted trees
Approximating parameterized convex optimization problems
Waste Makes Haste: Bounded Time Algorithms for Envy-Free Cake Cutting with Free Disposal
Editorial: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2016 Special Issue
Approximate Privacy: Foundations and Quantification
Maximum Quadratic Assignment Problem: Reduction from Maximum Label Cover and LP-based Approximation Algorithm
A fast algorithm to generate open meandric systems and meanders
Cheeger-Type Approximation for Sparsest st -Cut
Adaptive Uncertainty Resolution in Bayesian Combinatorial Optimization Problems
Label-guided graph exploration by a finite automaton
Locating Errors in Faulty Formulas
Delays Induce an Exponential Memory Gap for Rendezvous in Trees
Quantum algorithms for Simon's problem over nonabelian groups
Odd Cycle Transversal on P 5 -free Graphs in Polynomial Time
No sorting? better searching!
Lower Bounds for the Parameterized Complexity of Minimum Fill-in and Other Completion Problems
Incremental Exact Min-Cut in Polylogarithmic Amortized Update Time
A Simplified 1.5-Approximation Algorithm for Augmenting Edge-Connectivity of a Graph from 1 to 2
Tree Edit Distance Cannot be Computed in Strongly Subcubic Time (Unless APSP Can)
Robust subgraphs for trees and paths
Maximum Matching in the Online Batch-arrival Model
Deterministic Rendezvous, Treasure Hunts, and Strongly Universal Exploration Sequences
Tight approximation algorithms for scheduling with fixed jobs and nonavailability
Common Tangents of Two Disjoint Polygons in Linear Time and Constant Workspace
Approximation algorithms and hardness results for cycle packing problems
All-pairs shortest paths with a sublinear additive error
Resilient dictionaries
Fast and Small Subsampled R-indexes
Efficiency of Self-Adjusting Heaps
Improved results for data migration and open shop scheduling
Santa claus meets hypergraph matchings
Matching on the Line Admits no o(√log n)-Competitive Algorithm
A \(\boldsymbol{O}(\textbf{log}\,\boldsymbol{k})\)-Approximation for Directed Steiner Tree in Planar Graphs
The greedy algorithm for the minimum common string partition problem
Shortest Cycles with Monotone Submodular Costs
On the query complexity of testing orientations for being Eulerian
On Coalescence Time in Graphs: When Is Coalescing as Fast as Meeting?
On the Tradeoff between Stability and Fit
Routing (un-) splittable flow in games with player-specific affine latency functions
A polynomial-time approximation scheme for embedding hypergraph in a cycle
The minimum generalized vertex cover problem
Distributed Edge Coloring and a Special Case of the Constructive Lovász Local Lemma
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy
The Complexity of Finding Fair Many-to-One Matchings
Introduction to the Special Issue on SODA 2017
Memory-Adjustable Navigation Piles with Applications to Sorting and Convex Hulls
Thin heaps, thick heaps
Philippe flajolet, the father of analytic combinatorics
How Good Is Multi-Pivot Quicksort?
The k -traveling repairmen problem
The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection
Online Metric Algorithms with Untrusted Predictions
Dynamic Ray Stabbing
Minimum Cut and Minimum k -Cut in Hypergraphs via Branching Contractions
Improved Fixed-Parameter Algorithms for Minimum-Flip Consensus Trees
Algorithms for distributional and adversarial pipelined filter ordering problems
Algorithms and complexity for periodic real-time scheduling
Adaptive sampling strategies for quickselects
Approximating Sparsest Cut in Low-treewidth Graphs via Combinatorial Diameter
Multicommodity demand flow in a tree and packing integer programs
Finding heaviest H -subgraphs in real weighted graphs, with applications
A faster algorithm for computing the girth of planar and bounded genus graphs
Data Structures for Weighted Matching and Extensions to b -matching and f -factors
Computing Shortest Paths among Curved Obstacles in the Plane
Iterative Expansion and Color Coding: An Improved Algorithm for 3D-Matching
On the set multicover problem in geometric settings
On a generalization of the stable roommates problem
Distribution-free Junta Testing
Time Complexity of Link Reversal Routing
Discovering almost any hidden motif from multiple sequences
A data structure for a sequence of string accesses in external memory
Introduction: ACM-SIAM Symposium on Discrete Algorithms (SODA) 2022 Special Issue
Efficient Decoding up to a Constant Fraction of the Code Length for Asymptotically Good Quantum Codes
Querying priced information in databases: The conjunctive case
Edge-disjoint paths revisited
Approximate Counting of k -Paths: Simpler, Deterministic, and in Polynomial Space
Competitive analysis of flash memory algorithms
Oracles for bounded-length shortest paths in planar graphs
Foreword to special issue on SODA 2007
Interval Deletion Is Fixed-Parameter Tractable
Optimal Lower and Upper Bounds for Representing Sequences
Foreword to special issue SODA 2009
Atomic congestion games among coalitions
A near-optimal algorithm for estimating the entropy of a stream
An approximation algorithm for the maximum leaf spanning arborescence problem
The Knuth-Yao quadrangle-inequality speedup is a consequence of total monotonicity
More Logarithmic-factor Speedups for 3SUM, (median, +)-convolution, and Some Geometric 3SUM-hard Problems
Querying a Matrix through Matrix-Vector Products
Randomized Embeddings with Slack and High-Dimensional Approximate Nearest Neighbor
A precise analysis of Cuckoo hashing
Maintaining information in fully dynamic trees with top trees
New Extremal Bounds for Reachability and Strong-Connectivity Preservers under Failures
Structure and linear-time recognition of 4-leaf powers
Approximating rank-width and clique-width quickly
Two-Dimensional Parameterized Matching
Replacement Paths and Distance Sensitivity Oracles via Fast Matrix Multiplication
The speed of convergence in congestion games under best-response dynamics
Co-Nondeterminism in Compositions: A Kernelization Lower Bound for a Ramsey-Type Problem
Sparse Backbone and Optimal Distributed SINR Algorithms
Price-based protocols for fair resource allocation: Convergence time analysis and extension to leontief utilities
Simultaneous source location
Simple Deterministic Algorithms for Fully Dynamic Maximal Matching
Sparse Dynamic Programming on DAGs with Small Width
Rate vs. buffer size-greedy information gathering on the line
Improved algorithms for the minmax-regret 1-center and 1-median problems
Polynomial Kernel for Interval Vertex Deletion
Multipartite priority queues
Improving the Dilation of a Metric Graph by Adding Edges
The Simplex Algorithm Is NP-Mighty
Max Flows in Planar Graphs with Vertex Capacities
The Two-Edge Connectivity Survivable-Network Design Problem in Planar Graphs
The ( h, k )-Server Problem on Bounded Depth Trees
Dotted interval graphs
Exponential time algorithms for the minimum dominating set problem on some graph classes
A compact routing scheme and approximate distance oracle for power-law graphs
Quasi-Polynomial Local Search for Restricted Max-Min Fair Allocation
Exact distribution of individual displacements in linear probing hashing
Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
Secure multiparty computation of approximations
Dynamic text and static pattern matching
Corrigendum: Improved results for data migration and open shop scheduling
Proximity Results and Faster Algorithms for Integer Programming Using the Steinitz Lemma
Deterministic Parallel Algorithms for Fooling Polylogarithmic Juntas and the Lovász Local Lemma
On the External Validity of Average-case Analyses of Graph Algorithms
A (2+ε)-Approximation for Maximum Weight Matching in the Semi-streaming Model
Approximate distance oracles for geometric spanners
Faster Carry Bit Computation for Adder Circuits with Prescribed Arrival Times
Monotone Edge Flips to an Orientation of Maximum Edge-Connectivity à la Nash-Williams
Efficient and Near-optimal Algorithms for Sampling Small Connected Subgraphs
Entropy, triangulation, and point location in planar subdivisions
Minimizing total completion time on uniform machines with deadline constraints
Approximate distance oracles for unweighted graphs in expected O ( n 2 ) time
Testing Euclidean minimum spanning trees in the plane
Taxes for linear atomic congestion games
On the bicriteria k -server problem
Deterministic conflict-free coloring for intervals: From offline to online
Algorithms for Weighted Independent Transversals and Strong Colouring
An algorithm for deciding zero equivalence of nested polynomially recurrent sequences
Socially desirable approximations for dodgson's voting rule
Fully Polynomial-Time Parameterized Computations for Graphs and Matrices of Low Treewidth
Low-dimensional lattice basis reduction revisited
Quantum Speed-Ups for String Synchronizing Sets, Longest Common Substring, and k -mismatch Matching
Optimal Streaming and Tracking Distinct Elements with High Probability
Robust and MaxMin Optimization under Matroid and Knapsack Uncertainty Sets
The NP-completeness column
Polynomial Formulations as a Barrier for Reduction-Based Hardness Proofs
Squarepants in a tree: Sum of subtree clustering and hyperbolic pants decomposition
On Hierarchical Routing in Doubling Metrics
The priority R-tree: A practically efficient and worst-case optimal R-tree
Computing the inverse sort transform in linear time
When indexing equals compression: Experiments with compressing suffix arrays and applications