yusuke1997/dblp-id-title huggingface dataset:
The MSO+U Theory of (N, <) Is Undecidable
Some Remarks on Presentations by Finite Church-Rosser Thue Systems
Palindrome Recognition In The Streaming Model
Approximation Algorithms for the Bottleneck Stretch Factor Problem
Improving the Upper Bound on the Length of the Shortest Reset Word
A glimpse on constant delay enumeration (Invited Talk)
Small-depth Multilinear Formula Lower Bounds for Iterated Matrix Multiplication, with Applications
Deterministic Languages and Non-Generators
Lower Bounds for Arithmetic Circuits via the Hankel Matrix
Nonuniform Reductions and NP-Completeness
The Traveling Salesman Problem under Squared Euclidean Distances
The Subpower Membership Problem of 2-Nilpotent Algebras
Universal Distributions and Time-Bounded Kolmogorov Complexity
The Variable Membership Problem: Succinctness Versus Complexity
Deterministic Generalized Automata
Successive Approximation in Parallel Graph Algorithms
Dimension-Free Parameterized Approximation Schemes for Hybrid Clustering
STACS 2007, 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, February 22-24, 2007, Proceedings
Scheduling with Communication Delay in Near-Linear Time
Single-Source Shortest p-Disjoint Paths: Fast Computation and Sparse Preservers
Lossy Chains and Fractional Secret Sharing
Complexity classes on spatially periodic Cellular Automata
Büchi Complementation Made Tight
Membership in Plynomial Ideals over Q Is Exponential Space Complete
On Boolean closed full trios and rational Kripke frames
On the Consistency of Discrete Bayesian Learning
A Theory of Strict P-completeness
STACS 2001, 18th Annual Symposium on Theoretical Aspects of Computer Science, Dresden, Germany, February 15-17, 2001, Proceedings
Tropical Proof Systems: Between R(CP) and Resolution
Better Algorithms for Minimum Weight Vertex-Connectivity Problems
Efficient Algorithms for Membership in Boolean Hierarchies of Regular Languages
Knapsack Problems for Wreath Products
Lower bounds for adaptive linearity tests
On Minimizing the Total Weighted Tardiness on a Single Machine
Understanding Model Counting for beta-acyclic CNF-formulas
Towards the Formal Design of Self-Stabilizing Distributed Algorithms
Parameterized (Approximate) Defective Coloring
2-Nested Simulation Is Not Finitely Equationally Axiomatizable
Quantum and Classical Communication Complexity of Permutation-Invariant Functions
Playing Games of Incomplete Information
Results on H-Freeness Testing in Graphs of Bounded r-Admissibility
Covering Polygons with Minimum Number of Rectangles
Unifying Models
Discrete Logarithms in Small Characteristic Finite Fields: a Survey of Recent Advances (Invited Talk)
Non-Rectangular Convolutions and (Sub-)Cadences with Three Elements
Recognizable and Rational Languages of Finite and Infinite Traces
Two-Variable Word Equations
Complexity of Multi-dimensional Loop Alignment
Kolmogorov-Loveland Stochasticity and Kolmogorov Complexity
Chain Properties of Rule Closures
About Cube-Free Morphisms
On Long Words Avoiding Zimin Patterns
Matching Algorithms Are Fast in Sparse Random Graphs
On Shortest-Path All-Optical Networks without Wavelength Conversion Requirements
Playing Mastermind With Constant-Size Memory
On the Parameterized Intractability of CLOSEST SUBSTRINGsize and Related Problems
The Limits of Decidability for First Order Logic on CPDA Graphs
Are Homomorphisms Sufficient for Behavioural Implementations of Deterministic and Nondeterministic Data Types?
Dynamic Complexity Theory Revisited
Property Testing for Bounded Degree Databases
Tying up the loose ends in fully LZW-compressed pattern matching
On Implementations of Loose Abstract Data Type Specifications and Their Vertical Composition
Automorphisms of Finite Rings and Applications to Complexity of Problems
Pushdown Compression
Space Efficient Algorithms for Series-Parallel Graphs
Polygon Placement Under Translation and Rotation
The Determinacy of Context-Free Games
Construction of Non-intersecting Colored Flows Through a Planar Cellular Figure
Randomized Online Algorithms with High Probability Guarantees
Bottleneck Paths and Trees and Deterministic Graphical Games
Computing the Longest Common Prefix of a Context-free Language in Polynomial Time
Petri Nets and Algebraic Calculi of Processes
Equations over Sets of Natural Numbers with Addition Only
Randomness and Initial Segment Complexity for Probability Measures
Power of Uninitialized Qubits in Shallow Quantum Circuits
Computability of Convex Sets (Extended Abstract)
Solving Order Constraints in Logarithmic Space
Resource-Bounded Balanced Genericity, Stochasticity and Weak Randomness
Efficiently Testing Simon's Congruence
Secure Commitment Against A Powerful Adversary
Nearly Optimal Language Compression Using Extractors
Analytic aspects of the shuffle product
Private Computations in Networks: Topology versus Randomness
On Computations with Integer Division
Holant Problems for Regular Graphs with Complex Edge Functions
Efficient Checking of Computations
Quantum Identification of Boolean Oracles
On the Subword Equivalence Problem for Infinite Words
A Non-Probabilistic Switching Lemma for the Sipser Function
Refining the Hierarchy of Blind Multicounter Languages
Cryptographically Sound and Machine-Assisted Verification of Security Protocols
Computing the L1 Geodesic Diameter and Center of a Polygonal Domain
On the Complexity of Random Strings (Extended Abstract)
STACS 98, 15th Annual Symposium on Theoretical Aspects of Computer Science, Paris, France, February 25-27, 1998, Proceedings
Testing Convexity Properties of Tree Colorings
Design by Measure and Conquer, A Faster Exact Algorithm for Dominating Set
The Minimal Logically-Defined NP-Complete Problem
Wadge Degrees of omega-Languages of Deterministic Turing Machines
Grundy Coloring & Friends, Half-Graphs, Bicliques
Is Ramsey's Theorem omega-automatic?
Tight Approximation and Kernelization Bounds for Vertex-Disjoint Shortest Paths
The Hardness of Approximating Spanner Problems
Weak MSO+U over infinite trees
Polynomial Time Algorithms for Finding Integer Relations Among Real Numbers
Parallel Detection of all Palindromes in a String
The Complexity of Verifying Functional Programs
Algorithms Explained by Symmetries
On the Hardness of Permanent
Online Dial-a-Ride Problems: Minimizing the Completion Time
Limit complexities revisited
A Parallel Statistical Cooling Algorithm
Weighted Asynchronous Cellular Automata
Bounding Quantum-Classical Separations for Classes of Nonlocal Games
A Logical Characterisation of Linear Time on Nondeterministic Turing Machines
On Completing Latin Squares
Further Exploiting c-Closure for FPT Algorithms and Kernels for Domination Problems
A (k+3)/2-approximation algorithm for monotone submodular k-set packing and general k-exchange systems
Deterministic Regular Languages
Semantic Versus Syntactic Cutting Planes
The Union of Minimal Hitting Sets: Parameterized Combinatorial Bounds and Counting
Quantum Query Complexity of Subgraph Isomorphism and Homomorphism
Solovay functions and K-triviality
Parameterized Complexity of Connected Even/Odd Subgraph Problems
Parallel Architectures: Design and Efficient Use
The Isomorphism Problem for Plain Groups Is in Σ₃ 𝖯
Periodic Constant Depth Sorting Networks
Towards Specification and Proof of Asynchronous Systems
If VNP Is Hard, Then so Are Equations for It
Amortized Rigidness in Dynamic Cartesian Trees
Parallel Computation of Discrete Voronoi Diagrams (Extended Abstract)
The Log-Star Revolution
Computing Representations of Matroids of Bounded Branch-Width
One Binary Horn Clause is Enough
SPECI90: A Term Rewriting and Narrowing System
Local Equivalence of Stabilizer States: A Graphical Characterisation
On the Factorization Conjecture
Resolution with Symmetry Rule Applied to Linear Equations
Approximate Range Mode and Range Median Queries
Exploiting Storage Redundancy to Speed Up Randomized Shared Memory Simulations
Closure of Resource-Bounded Randomness Notions Under Polynomial-Time Permutations
The Granules, Blutton: An Idea, an Algorithm to Implement on Multiprocessor
Distance Labeling Schemes for Well-Separated Graph Classes
Complement Problems and Tree Automata in AC-like Theories (Extended Abstract)
Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products
The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs
Undecidable Properties of Limit Set Dynamics of Cellular Automata
Approximation Algorithms for Scheduling with Resource and Precedence Constraints
On the Classification of Computable Languages
Deterministic 1-k Routing on Meshes
Residual Finite State Automata
Undecidability Results on Two-Variable Logics
2-Stack Sorting is polynomial
Efficient algorithms for highly compressed data: The Word Problem in Higman's group is in P
Treewidth Reduction for Constrained Separation and Bipartization Problems
NP-Completeness, Proof Systems, and Disjoint NP-Pairs
On the Information Carried by Programs about the Objects They Compute
Optimal quantum query bounds for almost all Boolean functions
Compressibility and Resource Bounded Measure
Proof Complexity and Its Relations to SAT Solving (Invited Talk)
Airports and Railways: Facility Location Meets Network Design
A Simple Linear Time Algorithm for Triangulating Three-Colored Graphs
Approximating Bandwidth by Mixing Layouts of Interval Graphs
Groups, Codes and Unambiguous Automata
What Can Be Verified Locally?
On a Hierarchy of Spectral Invariants for Graphs
Quantum query complexity of minor-closed graph properties
An Automaton Group with PSPACE-Complete Word Problem
Simultaneous Messages vs. Communication
Cost Sharing Methods for Makespan and Completion Time Scheduling
Verification of Communicating Processes by Means of Automata Reduction and Abstraction
Efficiently Finding All Maximal alpha-gapped Repeats
Mutual Dimension
Optimal Proof Systems and Sparse Sets
Sorting the Sums (xi+yj) in O(n²) Comparisons
Markov Decision Processes and Stochastic Games with Total Effective Payoff
Structural Decomposition Methods and What They are Good For
Computing the Counting Function of Context-Free Languages
Definability and Regularity in Automatic Structures
Satisfiability of Circuits and Equations over Finite Malcev Algebras
Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter
An Information-Theoretic Upper Bound of Planar Graphs Using Triangulation
Computationally Convincing Proofs of Knowledge
Relaxed Spanners for Directed Disk Graphs
Beyond JWP: A Tractable Class of Binary VCSPs via M-Convex Intersection
The Theory of the Polynomial Many-One Degrees of Recursive Sets is Undecidable
Decidable Theories of Cayley-Graphs
Revisiting the Rice Theorem of Cellular Automata
A Generalization of Resource-Bounded Measure, With an Application (Extended Abstract)
Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs
Parameterized Pre-Coloring Extension and List Coloring Problems
The Owner Concept for PRAMs
New Exact and Approximation Algorithms for the Star Packing Problem in Undirected Graphs
Computational Social Choice (Tutorial)
Colorful Vertex Recoloring of Bipartite Graphs
The Returning Secretary
Exact Covers via Determinants
Sampling Sub-problems of Heterogeneous Max-cut Problems and Approximation Algorithms
A Complete and Tight Average-Case Analysis of Learning Monomials
An Optimal Strategy for Searching in Unknown Streets
Equality and Disequality Constraints on Direct Subterms in Tree Automata
Classifying Discrete Temporal Properties
Non-Adaptive Proper Learning Polynomials
Searching Constant Width Mazes Captures the AC 0 Hierarchy
Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure
An Automaton Characterization of Fairness in SCCS
Lower Bounds Against Sparse Symmetric Functions of ACC Circuits: Expanding the Reach of #SAT Algorithms
Proceedings of the 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, Freiburg, Germany, February 26-28, 2009
Deciding Unambiguity and Sequentiality of Polynomially Ambiguous Min-Plus Automata
On Critical Exponents in Fixed Points of Binary k -Uniform Morphisms
A First Order Logic for Partial Functions (Extended Abstract)
Contraction checking in graphs on surfaces
Exact and Approximation Algorithms for the Maximum Constraint Satisfaction Problem over the Point Algebra
Some Probabilistic Powerdomains in the Category SFP
Forbidden Patterns in Mixed Linear Layouts
Algorithmic Data Science (Invited Talk)
Factoring Polynomials over Finite Fields using Balance Test
New Combinatorial Complete One-Way Functions
Deterministic Truthful Approximation Mechanisms for Scheduling Related Machines
How Many Missing Answers Can Be Tolerated by Query Learners?
Nondeterminism in Patterns
The Expected Competitive Ratio for Weighted Completion Time Scheduling
Descriptive Complexity of Computable Sequences
Interactive Proof Systems with Public Coin: Lower Space Bounds and Hierarchies of Complexity Classes
On Codings of Traces
Fractional Coverings, Greedy Coverings, and Rectifier Networks
Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem
The Complexity of Graph Isomorphism for Colored Graphs with Color Classes of Size 2 and 3
Higher randomness and forcing with closed sets
On Word-Level Parallelism in Fault-Tolerant Computing
Fault-tolerant k-Supplier with Outliers
Optimal Node Routing
On the Enumerative Sequences of Regular Languages on k Symbols
A Deterministic Approach to Shortest Path Restoration in Edge Faulty Graphs
Computing 2-Walks in Polynomial Time
A Discrete Event Simulator of Communication Algorithms in Interconnection Networks
One-Way Communication Complexity and Non-Adaptive Decision Trees
Dynamic Binary Search Trees: Improved Lower Bounds for the Greedy-Future Algorithm
Expressive Quantale-Valued Logics for Coalgebras: An Adjunction-Based Approach
Characterizations of Some Complexity Classes Between Theta^p_2 and Delta^p_2
A New Bound for Pure Greedy Hot Potato Routing
Some Bounds on Multiparty Communication Complexity of Pointer Jumping
Computing Downward Closures for Stacked Counter Automata
Locally Synchronous Complexity in the Light of the Trans-Box Method
Making Distributed Spanning Tree Algorithms Fault-Resilient
Network Design Problems with Bounded Distances via Shallow-Light Steiner Trees
A Complexity Theoretic Approach to Incremental Computation
Complexity of Some Problems in Universal Algebra
Average Case Analysis of Unification Algorithms
Listing Spanning Trees of Outerplanar Graphs by Pivot-Exchanges
Relational Width of First-Order Expansions of Homogeneous Graphs with Bounded Strict Width
Small Resolution Proofs for QBF using Dependency Treewidth
Word Problems over TRaces Which are Solvable in Linear Time
Minimum Vertex Hulls for Polyhedral Domains
SAMPLE: A Language Dependent Prototyping Environment
Time-Space Tradeoff in Derandomizing Probabilistic Logspace
FPT Approximation of Generalised Hypertree Width for Bounded Intersection Hypergraphs
The Expressive Power of Second Order Horn Logic
Excluded vertex-minors for graphs of linear rank-width at most k
Sparsification of Binary CSPs
The Intrinsic Universality Problem of One-Dimensional Cellular Automata
Motion planning with pulley, rope, and baskets
One-To-Two-Player Lifting for Mildly Growing Memory
Towards Duality of Multicommodity Multiroute Cuts and Flows: Multilevel Ball-Growing
Everything you always wanted to know about the parameterized complexity of Subgraph Isomorphism (but were afraid to ask)
Reflections on Multivariate Algorithmics and Problem Parameterization
Bias Invariance of Small Upper Spans
Qualitative Reachability in Stochastic BPA Games
The Recognition of Triangle Graphs
A Classification of Symbolic Transition Systems
Generalized Scans and Tri-Diagonal Systems
Low Randomness Rumor Spreading via Hashing
Shortest Reconfiguration of Colorings Under Kempe Changes
Kolmogorov Complexity with Error
Strict Sequential P-completeness
Collapsing and Separating Completeness Notions under Average-Case and Worst-Case Hypotheses
Complexity of Semi-algebraic Proofs
NC^k(NP) = AC^(k-1)(NP)
A Theory for Valiant's Matchcircuits (Extended Abstract)
Nearly-Optimal Algorithm for Non-Clairvoyant Service with Delay
Enumerating Regular Languages with Bounded Delay
The Data Broadcast Problem with Preemption
Automorphism Groups of Geometrically Represented Graphs
On the Synchronisation Problem over Cellular Automata
Abstract Interpretation of Denotational Definions (A Survey)
Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs
On the Sizes of Permutation Networks and Consequences for Efficient Simulation of Hypercube Algorithms on Bounded-Degree Networks
Observation and Distinction. Representing Information in Infinite Games
Space-Efficient Algorithms for Longest Increasing Subsequence
Reachability in O(log n) Genus Graphs is in Unambiguous Logspace
Lower Bounds for Compact Routing (Extended Abstract)
Recompression: a simple and powerful technique for word equations
In How Many Steps the k Peg Version of the Towers of Hanoi Game Can Be Solved?
The Frobenius Problem in a Free Monoid
STACS 84, Symposium of Theoretical Aspects of Computer Science, Paris, France, 11-13 April, 1984, Proceedings
Solving Totally Unimodular LPs with the Shadow Vertex Algorithm
All Classical Adversary Methods are Equivalent for Total Functions
The Inference Problem for Propositional Circumscription of Affine Formulas Is coNP-Complete
On Büchi One-Counter Automata
Infinite Trees and Automaton Definable Relations over Omega-Words
Equivalence Test and Ordering Transformation for Parity-OBDDs of Different Variable Ordering
Nesting Until and Since in Linear Temporal Logic
Rational, Recognizable, and Aperiodic Sets in the Partially Lossy Queue Monoid
Parameterized and Approximation Results for Scheduling with a Low Rank Processing Time Matrix
Computing Minimum Spanning Forests on 1- and 2-Dimensional Processor Arrays
STACS 2006, 23rd Annual Symposium on Theoretical Aspects of Computer Science, Marseille, France, February 23-25, 2006, Proceedings
On Local Routing of Two-Terminal Nets
Fine-Grained Complexity of the List Homomorphism Problem: Feedback Vertex Set and Cutwidth
IPG - An Interactive Parser Generator
Fixed Parameter Polynomial Time Algorithms for Maximum Agreement and Compatible Supertrees
Digraphs Exploration with Little Memory
Transforming Constraint Logic Programs
Strongly Hyperbolic Unit Disk Graphs
The Complexity of Generating Test Instances
Generating Randomized Roundings with Cardinality Constraints and Derandomizations
Applications of Algorithmic Metatheorems to Space Complexity and Parallelism (Invited Talk)
Defying Upward and Downward Separation
Hypothesis Testing in Perfect Phylogeny for a Bounded Number of Characters
The Complexity of Weighted Boolean #CSP Modulo k
Polynomial Graph-Colorings
Canonical Labeling of Sparse Random Graphs
Compressed Membership for NFA (DFA) with Compressed Labels is in NP (P)
Hierarchies of Principal Twist-Closed Trios
Solving Parametric Problems on Trees
Pseudo-deterministic Algorithms (Invited Talk)
Space-efficient Basic Graph Algorithms
The Reduced Genus of a Multigraph
Universal Tilings
Kolmogorov-Loveland Randomness and Stochasticity
Two Refinements of the Polynomial Hierarcht
Minimizing Flow Time in the Wireless Gathering Problem
What Can be Efficiently Reduced to the K-Random Strings?
Non-autoreducible Sets for NEXP
On Finite Monoids over Nonnegative Integer Matrices and Short Killing Words
Optimal Average Case Sorting on Arrays
Deciding Circular-Arc Graph Isomorphism in Parameterized Logspace
The Complexity of Minimal Satisfiability Problems
Average-Case Completeness in Tag Systems
Satisfiability of Context-Free String Constraints with Subword-Ordering and Transducers
The PIGs Full Monty - A Floor Show of Minimal Separators
Suitability of the Propositional Temporal Logic to Express Properties of Real-Time Systems
Regular tree languages, cardinality predicates, and addition-invariant FO
Broadcast in the Rendezvous Model
A Fast Algorithm for Multi-Machine Scheduling Problems with Jobs of Equal Processing Times
Mortality of Iterated Piecewise Affine Functions over the Integers: Decidability and Complexity (extended abstract)
A Downward Translation in the Polynomial Hierarchy
Deterministic algorithms for skewed matrix products
Time is Not a Healer
A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
Lagrangian Relaxation and Partial Cover (Extended Abstract)
The Complexity of Modular Graph Automorphism
Branch-Width, Parse Trees, and Monadic Second-Order Logic for Matroids
One Drop of Non-Determinism in a Random Deterministic Automaton
Optimal Parallel Recognition of Bracket Languages on Hypercubes
Graphs Encoded by Regular Expressions
Closure Properties of Synchronized Relations
Sums of Palindromes: an Approach via Automata
An Ehrenfeucht-Fraïssé Approach to Collapse Results for First-Order Queries over Embedded Databases
Synchronizing Strongly Connected Partial DFAs
Automata based verification over linearly ordered data domains
Relating Hierarchies of Word and Tree Automata
On-line and Dynamic Algorithms for Shorted Path Problems
On the Two-Variable Fragment of the Equational Theory of the Max-Sum Algebra of the Natural Numbers
It is Undecidable Whether the Knuth-Bendix Completion Procedure Generates a Crossed Pair
On Equations over Sets of Integers
Fast Algorithms for Extended Regular Expression Matching and Searching
Complete Classifications for the Communication Complexity of Regular Languages
Evolving Multialgebras Unify All Usual Sequential Computation Models
Why Almost All k -Colorable Graphs Are Easy
First-order Fragments with Successor over Infinite Words
Proceedings of the 25th Annual Symposium on Theoretical Aspects of Computer Science, STACS 2008, Bordeaux, France, February 21-23, 2008
Depth-4 Lower Bounds, Determinantal Complexity: A Unified Approach
New Approximation Algorithms for Minimum Cycle Bases of Graphs
Hereditary History Preserving Bisimilarity Is Undecidable
Quantum Interactive Proofs with Competing Provers
On the Power of Tree-Depth for Fully Polynomial FPT Algorithms
The Power of Commuting with Finite Sets of Words
On the Difficulty of Some Shortest Path Problems
On Morphisms of Trace Monoids
STACS 97, 14th Annual Symposium on Theoretical Aspects of Computer Science, Lübeck, Germany, February 27 - March 1, 1997, Proceedings
Approximate comparison of distance automata
Transformations Realizing Fairness Assumptions for Parallel Programs
Axiomatizations of Temporal Logics on Trace Systems
How to Play the Accordion: Uniformity and the (Non-)Conservativity of the Linear Approximation of the λ-Calculus
Construction Sequences and Certifying 3-Connectedness
Efficient Graph Algorithm Using Limited Communication on a Fixed-Size Array of Processors
Lower Bounds on the Complexity of MSO_1 Model-Checking
Efficient Sublinear Time Parallel Algorithms for Dynamic Programming and Context-Free Recognition
Asymptotic Divergences and Strong Dichotomy
Randomized Polynomials, Threshold Circuits, and the Polynomial Hierarchy
Equilibria, Fixed Points, and Complexity Classes
An Approximate L p -Difference Algorithm for Massive Data Streams
Algorithms for Claims Trading
Efficient Quantum Walk on the Grid with Multiple Marked Elements
An Algorithm to Construct Minkowski-Reduced Lattice-Bases
Set Membership with Non-Adaptive Bit Probes
Tight Bounds For Distributed MST Verification
How Does Computer Science Change Molecular Biology?
Darwin: Computer Algebra and Enumerative Combinatorics
O(1/ε) Is the Answer in Online Weighted Throughput Maximization
A Generalization of Nemhauser and Trotter's Local Optimization Theorem
On the Acceptance Power of Regular Languages
The Tropical Double Description Method
Approximate Strong Separation with Application in Fractional Graph Coloring and Preemptive Scheduling
Semi-algebraic geometry in computational game theory - a consumer's perspective (Invited Talk)
Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games
Evasiveness of Subgraph Containment and Related Properties
Commutative ℕ-Rational Series of Polynomial Growth
Hypertransition Systems
Dynamic Unit-Disk Range Reporting
On the Exact Matching Problem in Dense Graphs
An Improved Approximation Algorithm for Dynamic Minimum Linear Arrangement