Computing Hitting Set Kernels By AC0-Circuits
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09941-z
The Operator Approach to Entropy Games
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09925-z
Comparing Linear Width Parameters for Directed Graphs
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09919-x
Lower Bounds for Several Online Variants of Bin Packing
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09915-1
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09910-6
On Conceptually Simple Algorithms for Variants of Online Bipartite Matching
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09916-0
Improving Selfish Routing for Risk-Averse Players
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09946-8
Optimal Dislocation with Persistent Errors in Subquadratic Time
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09957-5
Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09913-3
On the Stab Number of Rectangle Intersection Graphs
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09936-w
On Long Words Avoiding Zimin Patterns
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09914-2
Slopes of Multidimensional Subshifts
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09931-1
Quadratically Tight Relations for Randomized Query Complexity
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09935-x
Connecting Knowledge Compilation Classes Width Parameters
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09930-2
Enumeration Complexity of Conjunctive Queries with Functional Dependencies
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09937-9
New Bounds for Truthful Scheduling on Two Unrelated Selfish Machines
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09927-x
Advice Complexity of Priority Algorithms
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09955-7
Profit Maximization in Flex-Grid All-Optical Networks
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09943-x
Extension Complexity of Formal Languages
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09951-x
Online Random Sampling for Budgeted Settings
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09918-y
On the Parameterized Complexity of Graph Modification to First-Order Logic Properties
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09938-8
On Approximating the Stationary Distribution of Time-Reversible Markov Chains
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09921-3
On Limitations of Structured (Deterministic) DNNFs
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09960-w
On Normality in Shifts of Finite Type
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09953-9
Distribution Policies for Datalog
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09959-3
Optimal Path Discovery Problem with Homogeneous Knowledge
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09928-w
Bounds on the Bend Number of Split and Cocomparability Graphs
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09912-4
Lower Bound Techniques for QBF Expansion
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09940-0
Grammar-Based Compression of Unranked Trees
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09942-y
Evaluating Datalog via Tree Automata and Cycluits
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-018-9901-2
A More General Theory of Static Approximations for Conjunctive Queries
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09924-0
Periodicity in Data Streams with Wildcards
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09950-y
Parameterized Analysis of the Online Priority and Node-Weighted Steiner Tree Problems
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09922-2
Countable Sofic Shifts with a Periodic Direction
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09962-8
Scheduling MapReduce Jobs on Identical and Unrelated Processors
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09956-6
CSR 2018 Special Issue on TOCS
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09954-8
Fixed-Parameter Tractable Algorithm and Polynomial Kernel for Max-Cut Above Spanning Tree
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-018-09909-5
Optimizing Social Welfare for Network Bargaining Games in the Face of Instability, Greed and Idealism
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09958-4
Recognizing Read-Once Functions from Depth-Three Formulas
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09923-1
Algorithm for Online 3-Path Vertex Cover
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09944-w
Cache Me if You Can: Capacitated Selfish Replication Games in Networks
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09939-7
Space-Efficient Algorithms for Longest Increasing Subsequence
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-018-09908-6
Guest Editorial: Special Issue on Approximation and Online Algorithms
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09952-w
Guest Editorial: Special Issue on Algorithmic Game Theory
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09932-0
On-line Search in Two-Dimensional Environment
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09948-6
The Clever Shopper Problem
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09917-z
Weak Completeness Notions for Exponential Time
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09920-4
Efficient Dynamic Approximate Distance Oracles for Vertex-Labeled Planar Graphs
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09949-5
Guest Editorial: Special Issue on Database Theory
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09933-z
Guest Editorial: Special Issue on Theoretical Aspects of Computer Science
来源期刊:Theory of Computing SystemsDOI:10.1007/s00224-019-09934-y