yusuke1997/dblp-id-title huggingface dataset:
More on Advice on Structuring Compilers and Proving Them Correct
Tight Bounds on Adjacency Labels for Monotone Graph Classes
On the Complexity of String Folding
Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution
Asymptotically Optimal Hitting Sets Against Polynomials
Search-Space Size in Contraction Hierarchies
Extension Orderings
The Spectral Gap of Random Graphs with Given Expected Degrees
Nearly Optimal Independence Oracle Algorithms for Edge Estimation in Hypergraphs
Quantum Distributed Complexity of Set Disjointness on a Line
Normalizing and Accelerating RAM Computations and the Problem of Reasonable Space Measures
Holographic Reduction: A Domain Changed Application and Its Partial Converse Theorems
Beating Two-Thirds For Random-Order Streaming Matching
Games Characterizing Levy-Longo Trees
Automata, Languages and Programming: 31st International Colloquium, ICALP 2004, Turku, Finland, July 12-16, 2004. Proceedings
A 2(1/8)-Approximation Algorithm for Rectangle Tiling
Optimal Hashing in External Memory
Parameterized Algorithms for Matching Integer Programs with Additional Rows and Columns
A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method
The Complexity of Symmetric Boolean Parity Holant Problems - (Extended Abstract)
On Datalog vs. LFP
Automata, Languages, and Programming - 42nd International Colloquium, ICALP 2015, Kyoto, Japan, July 6-10, 2015, Proceedings, Part II
A Simple Dynamic Spanner via APSP
A Simple and Optimal Ancestry Labeling Scheme for Trees
Speeding-up Single-Tape Nondeterministic Computations by Single Alternation, with Separation Results
Generic Terms Having No Polymorphic Types
Approximation Algorithm for Directed Telephone Multicast Problem
Recognition and Isomorphism of Two Dimensional Partial Orders
Simplifying and Unifying Replacement Paths Algorithms in Weighted Directed Graphs
Rendezvous of Mobile Agents without Agreement on Local Orientation
Cross-Paradigm Graph Algorithms (Invited Talk)
Decremental Matching in General Weighted Graphs
A Comparison Between Two Variations of a Pebble Game on Graphs
Strictly Balancing Matrices in Polynomial Time Using Osborne's Iteration
High Probability Frequency Moment Sketches
Costs and Rewards in Priced Timed Automata
Online Packing with Gradually Improving Capacity Estimations and Applications to Network Lifetime Maximization
A Complete Gentzen-Style Axiomatization for Set Constraints
Solvability of a System of Bivariate Polynomial Equations over a Finite Field
Polylogarithmic Sketches for Clustering
Sparse Recovery for Orthogonal Polynomial Transforms
Border Rank of a pxqx2 Tensor and the Optimal Approximation od a Pair of Bilinear Forms
The Beta-Bernoulli process and algebraic effects
An Axiomatic Approach to the Korenjak-Hopcroft Algorithms
Non-Mergeable Sketching for Cardinality Estimation
Hitting Long Directed Cycles Is Fixed-Parameter Tractable
Fully Collusion Resistant Black-Box Traitor Revocable Broadcast Encryption with Short Private Keys
A Universal Domain Technique for Profinite Posets
Efficient Caching with Reserves via Marking
Processes and a Fair Semantics for the Ada Rendez-Vous
When Is a Bottom-Up Deterministic Tree Translation Top-Down Deterministic?
On O(N^4) Algorithm to Contstruct all Vornoi Diagrams for K Nearest Neighbor Searching
Parameterized Approximation For Robust Clustering in Discrete Geometric Spaces
A Complete Axiomatization for Observational Congruence of Prioritized Finite-State Behaviors
Revisiting the Direct Sum Theorem and Space Lower Bounds in Random Order Streams
Graph Minors for Preserving Terminal Distances Approximately - Lower and Upper Bounds
Floats and Ropes: A Case Study for Formal Numerical Program Verification
Minimum-Norm Load Balancing Is (Almost) as Easy as Minimizing Makespan
Optimal-Time Queries on BWT-Runs Compressed Indexes
Regular Languages of Words over Countable Linear Orderings
Homomorphism Tensors and Linear Equations
A New Characterization of the Regular Languages
A Linear Upper Bound on the Weisfeiler-Leman Dimension of Graphs of Bounded Genus
On the Complexity of Relational Problems for Finite State Processes (Extended Abstract)
Stochastic Graph Exploration
Almost-Linear-Time Weighted 𝓁 p -Norm Solvers in Slightly Dense Graphs via Sparsification
Changing Bases: Multistage Optimization for Matroids and Matchings
Random Allocations and Probabilistic Languages
The Tile Complexity of Linear Assemblies
Approximations by OBDDs and the Variable Ordering Problem
On Confluence in the pi-Calculus
Large Neighborhood Local Search for the Maximum Set Packing Problem
Minimizing Width in Linear Layouts
Problems on Group-Labeled Matroid Bases
Robust Independence Systems
Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras
Static on Random Trees
Hardness of Finding Combinatorial Shortest Paths on Graph Associahedra
Disjunctive Systems and L-Domains
Superpolynomial Lower Bounds for General Homogeneous Depth 4 Arithmetic Circuits
Bicriteria Network Design Problems
Applications of a Splitting Trick
The Complexity of Stochastic Rabin and Streett Games'
The Simultaneous Communication of Disjointness with Applications to Data Streams
Kernelization Dichotomies for Hitting Subgraphs Under Structural Parameterizations
Diameter and k-Center in Sliding Windows
Downsampling for Testing and Learning in Product Distributions
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden
On the Price of Stability for Designing Undirected Networks with Fair Cost Allocations
Rational Subsets and Submonoids of Wreath Products
Small Stretch Pairwise Spanners
Efficient Simulations by Queue Machines
Powerdomains as Algebraic Lattices (Preliminary Report)
Functions and References in the Pi-Calculus: Full Abstraction and Proof Techniques
Approximating Max-Cut on Bounded Degree Graphs: Tighter Analysis of the FKL Algorithm
Computing the Closure of Sets of Words Under Partial Commutations
Deterministic Truncation of Linear Matroids
Translation Validation for Synchronous Languages
Tight Sum-Of-Squares Lower Bounds for Binary Polynomial Optimization Problems
A Gentle Introduction to Semantic Subtyping
Brief Announcement: Bayesian Auctions with Efficient Queries
Analytic Analysis of Algorithms
Geometric Structures in Computational Geometry
Formalizing a Lazy Substitution Proof System for µ-calculus in the Calculus of Inductive Constructions
Application of Lempel-Ziv Encodings to the Solution of Words Equations
Termination of Linear Rewriting Systems (Preliminary Version)
Running Time to Recognize Nonregular Languages by 2-Way Probabilistic Automata
Steiner Transitive-Closure Spanners of Low-Dimensional Posets
Stability and Complexity of Minimising Probabilistic Automata
How Unsplittable-Flow-Covering Helps Scheduling with Job-Dependent Cost Functions
Decomposition of Map Graphs with Applications
On the Group Complexity of a Finite Language
Polynomial Time Preemptive Sum-Multicoloring on Paths
Control Message Aggregation in Group Communication Protocols
Positive and Monotone Fragments of FO and LTL
Selfish Unsplittable Flows
Clustering with Local Restrictions
A 3/2-Approximation Algorithm for General Stable Marriage
A Simple Proof of the Skolem-Mahler-Lech Theorem
Stepwise Specification and Implementation of Abstract Data Types
Local Optimization and the Traveling Salesman Problem
Optimal Decomposition of Linear Automata
Constructing Efficient Dictionaries in Close to Sorting Time
A Characterization of Temporal Locality and Its Portability across Memory Hierarchies
Tailoring Recursing for Complexity
Regular Methods for Operator Precedence Languages
Brief Announcement: Approximation Schemes for Geometric Coverage Problems
Reset Sequences for Finite Automata with Application to Design of Parts Orienters
Construction of Optimal Locally Recoverable Codes and Connection with Hypergraph
Efficient Analysis of Concurrent Constraint Logic Programs
The Complexity of the Counting Constraint Satisfaction Problem
A (Slightly) Improved Approximation Algorithm for the Metric Traveling Salesperson Problem (Invited Talk)
A Spectral Approach to Approximately Counting Independent Sets in Dense Bipartite Graphs
On the Complexity of Value Iteration
On the Degree of Boolean Functions as Polynomials over ℤ m
Hardness of Approximation for Quantum Problems
On Computing the k-Shortcut Fréchet Distance
Solvability of Equations in Free Partially Commutative Groups Is Decidable
On the Degree Automatability of Sum-Of-Squares Proofs
Codes: Unequal Probabilities, Unequal Letter Costs (Extended Abstract)
Matroid Coflow Scheduling
Deciding True Concurrency Equivalences on Finite Sate Nets (Preliminary Report)
Languages and Inverse Semigroups
(Almost-)Optimal FPT Algorithm and Kernel for T-Cycle on Planar Graphs
Simple Linear-Time Algorithms for Minimal Fixed Points (Extended Abstract)
Totality, Definability and Boolean Ciruits
A New Method for Balancing Binary Search Trees
Distributed Subgraph Finding: Progress and Challenges (Invited Talk)
Linear Time Algorithm for Quantum 2SAT
STORMED Hybrid Systems
An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes
Relationship between Pushdown Automata and Tape-Bounded Turing Machines
A Polar Type System
Two Level Grammars: CF-Grammars with Equation Schemes
Approximately Good and Modern Matchings (Invited Talk)
On the Use of Relational Expressions in the Design of Efficient Algorithms (Extended Abstract)
Physical Algorithms
Improved Constructions for Non-adaptive Threshold Group Testing
Physarum Can Compute Shortest Paths: Convergence Proofs and Complexity Bounds
An Algebraic Theory of Fair Asynchronous Communicating Processes
Simultaneously Approximating All 𝓁 p -Norms in Correlation Clustering
Polarized Process Algebra and Program Equivalence
Fully-Dynamic α + 2 Arboricity Decompositions and Implicit Colouring
Submonoid Membership in n-Dimensional Lamplighter Groups and S-Unit Equations
On a Family of Codes Related to Factorization of Cyclotomic Polynomials
Separate, Measure and Conquer: Faster Polynomial-Space Algorithms for Max 2-CSP and Counting Dominating Sets
A Simple Solution to Type Specialization
Pairwise Reachability Oracles and Preservers Under Failures
Small Sweeping 2NFAs Are Not Closed Under Complement
Efficient Consistency Proofs for Generalized Queries on a Committed Database
Single-Prover Concurrent Zero Knowledge in Almost Constant Rounds
Metrical Task Systems and the k -Server Problem on HSTs
On the Computational Completeness of Equations over Sets of Natural Numbers
Statistical Randomized Encodings: A Complexity Theoretic View
Tight Bounds on Online Checkpointing Algorithms
Concurrent Probabilistic Program, or: How to Schedule if You Must
Edge Fault Tolerance on Sparse Networks
Ambiguite Forte
Asymptotically Optimal Randomized Rumor Spreading
Computing the Girth of a Planar Graph in O ( n log n ) Time
Concatenable Graph Processes: Relating Processes and Derivation Traces
Deciding First Order Properties of Matroids
Near-Optimal Directed Low-Diameter Decompositions
Upper Bounds for a Theory of Queues
Anti-Powers in Infinite Words
Randomized Fast Design of Short DNA Words
Domain Algebras
Lower Bounds on 0-Extension with Steiner Nodes
Efficient Submodular Function Maximization under Linear Packing Constraints
Languages with Reducing Reflective Types
Deterministic Even-Cycle Detection in Broadcast CONGEST
A General Technique for Managing Strings in Comparison-Driven Data Structures
On Constructor Rewrite Systems and the Lambda-Calculus
Minimizing Symmetric Convex Functions over Hybrid of Continuous and Discrete Convex Sets
Query Complexity in Expectation
On the Streaming Complexity of Expander Decomposition
P-completeness of Cellular Automaton Rule 110
Fast FAST
Symbolic Model Checking for Probabilistic Processes
A Progress Measure for Explicit-State Probabilistic Model-Checkers
Decision Problems for Language Equations with Boolean Operations
Non-Interactive Zero-Knowledge: A Low-Randomness Characterization of NP
Bootstrap Percolation on Geometric Inhomogeneous Random Graphs
Nonmonotone Submodular Maximization via a Structural Continuous Greedy Algorithm - (Extended Abstract)
Social Distancing Network Creation
Preservation Under Extensions on Well-Behaved Finite Structures
Roundtrip Spanners with (2k-1) Stretch
Testing Triangle Freeness in the General Model in Graphs with Arboricity O(√n)
Delegation for Search Problems
An Accessible Approach to Behavioural Pseudometrics
The Complexity of Verifying Loop-Free Programs as Differentially Private
Solving Promise Equations over Monoids and Groups
Coordination Mechanisms
Efficient Plurality Consensus, Or: the Benefits of Cleaning up from Time to Time
Infinite Normal Forms (Preliminary Version)
Approximation Algorithms for Partial Covering Problems
Regular Solutions of Language Inequalities and Well Quasi-orders
Lower Bounds for Lovász-Schrijver Systems and Beyond Follow from Multiparty Communication Complexity
Approximation Schemes for Degree-Restricted MST and Red-Blue Separation Problem
Vertex Packing Algorithms
Algorithms and Hardness for Diameter in Dynamic Graphs
Placing Regenerators in Optical Networks to Satisfy Multiple Sets of Requests
Online Interval Coloring and Variants
The Name Discipline of Uniform Receptiveness (Extended Abstract)
The One Way to Quantum Computation
Deterministic Rounding of Dynamic Fractional Matchings
Generalized Rewrite Theories
Graph Reconstruction via Distance Oracles
Semantics and Termination of Nondeterministic Recursive Programs
A PTAS for Minimizing Weighted Completion Time on Uniformly Related Machines
Hoare's Logic for Nondeterministic Regular Programs: A Nonstandard Completeness Theorem
A Generalisation of Pre-logical Predicates to Simply Typed Formal Systems
Bisimulation Equivalence of Pushdown Automata Is Ackermann-Complete
Going Higher in the First-Order Quantifier Alternation Hierarchy on Words
On the Value of Penalties in Time-Inconsistent Planning
Asymptotically Optimal Inapproximability of Maxmin k-Cut Reconfiguration
Pseudorandom Graphs in Data Structures
Polynomial Levelability and Maximal Complexity Cores
Optimal Website Design with the Constrained Subtree Selection Problem
Rice's Theorem for μ -Limit Sets of Cellular Automata
The Complexity of Partition Functions
Detecting Disjoint Shortest Paths in Linear Time and More
Intersection Types and Topologies and Lambda Calculus
Automata, Languages and Programming, 13th International Colloquium, ICALP86, Rennes, France, July 15-19, 1986, Proceedings
An Optimal Minimum Spanning Tree Algorithm
On the Synthesis of an Asynchronous Reactive Module
Cell-Probe Proofs and Nondeterministic Cell-Probe Complexity
Minimizing Recourse in an Adaptive Balls and Bins Game
FO = FO 3 for Linear Orders with Monotone Binary Relations
On Lower Bounds of Approximating Parameterized k-Clique
Towards a Theory of Algorithmic Proof Complexity (Invited Talk)
Interactive Proofs with Approximately Commuting Provers
Text Compression Using Antidictionaries
One-Way Trail Orientations
Categorial Combinatory Logic
Fatal Errors in Conditional Expressions (Extended Abstract)
Robust Assignments via Ear Decompositions and Randomized Rounding
Studies in Abstract/Concrete Mappings in Proving Algorithm Correctness
On the Power of Randomized Branching Programs
On Percolation and NP-Hardness
Property Testing of Regular Tree Languages
Feasible Interpolation for Polynomial Calculus and Sums-Of-Squares
Lax Logical Relations
d-To-1 Hardness of Coloring 3-Colorable Graphs with O(1) Colors
Optimal Sampling Strategies in Quicksort
Bounded-Angle Spanning Tree: Modeling Networks with Angular Constraints
Erasure-Resilient Property Testing
Automatic Semigroups vs Automaton Semigroups
Constrained Level Planarity Is FPT with Respect to the Vertex Cover Number
Big Data on the Rise? - Testing Monotonicity of Distributions
Finding a Maximum Matching in a Sparse Random Graph in O(n) Expected Time
On Learning, Lower Bounds and (un)Keeping Promises
Testing Probability Distributions Underlying Aggregated Data
Extractable Perfectly One-Way Functions
How to Trim an MST: A 2-Approximation Algorithm for Minimum Cost Tree Cover
Boolean Closure and Unambiguity of Rational Sets
On the Complexity of Diameter and Related Problems in Permutation Groups
Noninterference for Concurrent Programs
Stochastic Control via Entropy Compression
A Complete Characterization of the Complete Intersection-Type Theories
Operators Reducing Generalized OL-Systems
Graph Sparsification in the Semi-streaming Model
Near-Optimal Hypergraph Sparsification in Insertion-Only and Bounded-Deletion Streams
A New Metric Between Polygons and How to Compute it
Elimination Graphs
Satisfiability of Commutative vs. Non-Commutative CSPs
Computing Boolean Functions on Anonymous Networks
Un resultat en theorie des groupes de permutations et son application au calcul effectif du groupe d'automorphismes d'un automate fini
Automata, Languages and Programming, 14th International Colloquium, ICALP87, Karlsruhe, Germany, July 13-17, 1987, Proceedings
Shared Randomness Helps with Local Distributed Problems
Group Spreading: A Protocol for Provably Secure Distributed Name Service
Competitive Algorithms for Due Date Scheduling
Context-Free Controlled ETOL Systems
Undecidability of Weak Bisimulation Equivalence for 1-Counter Processes
Hitting Sets Derandomize BPP
Polynomial Closure and Unambiguous Product
The Identity Problem in ℤ ≀ ℤ Is Decidable
Linear Logical Algorithms
On Minimum Flow and Transitive Reduction
Adaptive Sparsification for Matroid Intersection
A Study of Weisfeiler-Leman Colorings on Planar Graphs
Improved Approximation Algorithms for Capacitated Network Design and Flexible Graph Connectivity
A Refined Complexity Analysis of Degree Anonymization in Graphs
Un Algorithme Determinant les Melanges de Deux Mots
Linear Problem Kernels for NP-Hard Problems on Planar Graphs
Hardness Results for Intersection Non-Emptiness
Exploration of High-Dimensional Grids by Finite Automata
Contention Resolution under Selfishness
Universal Complexity Bounds Based on Value Iteration and Application to Entropy Games
Random Numbers and an Incomplete Immune Recursive Set
Algorithms, Graph Theory, and the Solution of Laplacian Linear Equations
Sparse Networks Supporting Efficient Reliable Broadcasting
Komplexitätsmaße für Ausdrücke
A Tight Linear Bound on the Neighborhood of Inverse Cellular Automata
Trading Static for Adaptive Security in Universally Composable Zero-Knowledge
Approximation Hardness of TSP with Bounded Metrics
Improved Space Bounds for Strongly Competitive Randomized Paging Algorithms
Factoring Groups Efficiently
Dynamic Routing Schemes for General Graphs
Noetherian Spaces in Verification
Exponential Structures for Efficient Cache-Oblivious Algorithms
Deterministic Leader Election in Programmable Matter
Approximating Semi-matchings in Streaming and in Two-Party Communication
Program Checkers for Probability Generation
Privacy-Preserving Access of Outsourced Data via Oblivious RAM Simulation
An Expansion Tester for Bounded Degree Graphs
Leader Election in Unreliable Radio Networks
Subspace Designs Based on Algebraic Function Fields
Privately Solving Linear Programs
Nondeterministic Computations in Sublogarithmic Space and Space Constructibility
The Post Correspondence Problem and Equalisers for Certain Free Group and Monoid Morphisms
Symmetry and Similarity (Invited Talk)
Approximations of Infinitary Objects
Data Stream Algorithms for Codeword Testing
Efficient Construction of Probabilistic Tree Embeddings
Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model
New Results Concerning Synchronized Finite Automata
The Complexity of Somewhat Approximation Resistant Predicates
Quantum Hardcore Functions by Complexity-Theoretical Quantum List Decoding
Scheduling to Approximate Minimization Objectives on Identical Machines
The Simple Roots of Real-Time Computation Hierarchies (Preliminary Version)
Graphs Shortcuts: New Bounds and Algorithms (Invited Talk)
A Faster Parameterized Algorithm for Treedepth
Algebraic Independence and Blackbox Identity Testing
The Wrong Direction of Jensen's Inequality Is Algorithmically Right
Maintaining Minimum Spanning Trees in Dynamic Graphs
Improved Algorithms for MST and Metric-TSP Interdiction
On the Height of Derivation Trees
The Decimation Process in Random k -SAT
Computationally Sound Implementations of Equational Theories Against Passive Adversaries
Relating Computational Effects by ⊤ ⊤-Lifting
On the Time and Tape Complexity of Hyper(1)-AFL's
Semantic Equivalence of Program Schemes and its Syntactic Characterization
Reordering Buffer Management for Non-uniform Cost Models
An Almost Cubic Lower Bound for Depth Three Arithmetic Circuits
Fast n-Fold Boolean Convolution via Additive Combinatorics
Finite Automata with Generalized Acceptance Criteria
Dynamic Algorithms for Submodular Matching
Wavelength Assignment in Optical Networks with Fixed Fiber Capacity
String Matching with Preprocessing of Text and Pattern
Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing
Algebraic Models for Contextual Nets
Complexity of Model Checking Recursion Schemes for Fragments of the Modal Mu-Calculus
Tight Approximation Algorithms for Bichromatic Graph Diameter and Related Problems
The Semantics of Nondeterminism
On Computing the Vertex Connectivity of 1-Plane Graphs
Sparsity - an Algorithmic Perspective (Invited Paper)
Near-Optimal Trace Reconstruction for Mildly Separated Strings
Universal Framework for Wireless Scheduling Problems
The Limit of Split_n-Language Equivalence
Initial Index: A New Complexity Function for Languages
Amplification of One-Way Information Complexity via Codes and Noise Sensitivity
Optimal Competitiveness for Symmetric Rectilinear Steiner Arborescence and Related Problems
Co-Logic Programming: Extending Logic Programming with Coinduction
Wythoff Games, Continued Fractions, Cedar Trees and Fibonacci Searches
Decompositions of Nondeterministic Reductions (Extended Abstract)
Necessary and Sufficient Assumptions for Non-iterative Zero-Knowledge Proofs of Knowledge for All NP Relations
An Efficient Strongly Connected Components Algorithm in the Fault Tolerant Model
Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract)
Unification in Non-Classical Logics, UNCL 2002, ICALP 2002 Satellite Workshop, Málaga, Spain, July 12-13, 2002
Bounds on the Size of Small Depth Circuits for Approximating Majority
51st International Colloquium on Automata, Languages, and Programming, ICALP 2024, Tallinn, Estonia, July 8-12, 2024
Close to Uniform Prime Number Generation with Fewer Random Bits
Quantum SDP Solvers: Large Speed-Ups, Optimality, and Applications to Quantum Learning
Constraint Automata and the Complexity of Recursive Subtype Entailment
Towards a Theory of Time-Bounded Verification
Integration of the Phase-Difference Relations in Asynchronous Sequential Networks
NC Algorithms for Weighted Planar Perfect Matching and Related Problems
Liveness-Preserving Atomicity Abstraction
Solving Trace Equations Using Lexicographical Normal Forms
Sparse Reliable Graph Backbones
A Linear Algorithm for Testing Isomorphism of Planar Graphs
Functional Characterization of Some Semantic Equalities inside Lambda-Calculus
Analysis of a Simple Evolutionary Algorithm for Minimization in Euclidean Spaces
The Decision Problem for Perfect Matchings in Dense Hypergraphs
On p -Optimal Proof Systems and Logics for PTIME
Automata, Languages and Programming, 6th Colloquium, Graz, Austria, July 16-20, 1979, Proceedings
Streaming and Sketching Complexity of CSPs: A Survey (Invited Talk)
Automata with Storage on Infinite Words
Fourier Analysis of Iterative Algorithms
On Reductions of Parallel Programs
Fault-Tolerant Compact Routing Schemes for General Graphs
Core Size and Densification in Preferential Attachment Networks
Semi-Streaming Set Cover - (Extended Abstract)
A Completion Algorithm for Codes with Bounded Synchronization Delay
Cost Preserving Dependent Rounding for Allocation Problems
On Logics, Tilings, and Automata
Popular Mixed Matchings
Reordering Buffer Management with a Logarithmic Guarantee in General Metric Spaces
Streaming Algorithms for Connectivity Augmentation
Approximation Algorithms for the Capacitated Minimum Spanning Tree Problem and Its Variants in Network Design