| Verification of Quantum Computation: An Overview of Existing Approaches |
11 |
| The Operator Approach to Entropy Games |
3 |
| Co-c.e. Sets with Disconnected Complements |
3 |
| Exploration of the T-Interval-Connected Dynamic Graphs: the Case of the Ring |
3 |
| Faster Algorithms for the Constrained k-means Problem |
3 |
| Testing Shape Restrictions of Discrete Distributions |
3 |
| Tighter Bounds and Optimal Algorithms for All Maximal alpha-gapped Repeats and Palindromes |
3 |
| Polynomial Kernels for Vertex Cover Parameterized by Small Degree Modulators |
3 |
| Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels |
3 |
| Designing Cost-Sharing Methods for Bayesian Games |
2 |
| Pattern Matching and Consensus Problems on Weighted Sequences and Profiles |
2 |
| On the Relative Succinctness of Sentential Decision Diagrams |
2 |
| Price of Anarchy for Highly Congested Routing Games in Parallel Networks |
2 |
| Improved Approximation Algorithms for Minimum Cost Node-Connectivity Augmentation Problems |
2 |
| Self-Stabilizing Byzantine Clock Synchronization with Optimal Precision |
2 |
| A Unifying Tool for Bounding the Quality of Non-Cooperative Solutions in Weighted Congestion Games |
2 |
| Knapsack in Graph Groups |
1 |
| Catalytic Space: Non-determinism and Hierarchy |
1 |
| The Algebraic Theory of Parikh Automata |
1 |
| Exact Localisations of Feedback Sets |
1 |
| Self-Stabilizing Metric Graphs |
1 |
| Counting Edge-injective Homomorphisms and Matchings on Restricted Graph Classes |
1 |
| Tight Bounds for Double Coverage Against Weak Adversaries |
1 |
| Opinion Formation Games with Aggregation and Negative Influence |
1 |
| Online Random Sampling for Budgeted Settings |
1 |
| Geometric Hitting Set for Segments of Few Orientations |
1 |
| Process Algebra with Strategic Interleaving |
1 |
| A Logic for Document Spanners |
1 |
| Limits of Schema Mappings |
1 |
| Better Streaming Algorithms for the Maximum Coverage Problem |
1 |
| On Black-Box Transformations in Downward-Closed Environments |
1 |
| An Adequacy Theorem for Dependent Type Theory |
1 |
| Minimax Regret 1-Median Problem in Dynamic Path Networks |
1 |
| Partial Covering Arrays: Algorithms and Asymptotics |
1 |
| An Almost Ideal Coordination Mechanism for Unrelated Machine Scheduling |
1 |
| The Stable Roommates Problem with Short Lists |
1 |
| Analyzing Power in Weighted Voting Games with Super-Increasing Weights |
1 |
| Tropically Convex Constraint Satisfaction |
1 |
| On Slepian-Wolf Theorem with Interaction |
1 |
| Parameterizing Edge Modification Problems Above Lower Bounds |
1 |
| Parameterized Complexity of Voter Control in Multi-Peaked Elections |
1 |
| Parameterised Algorithms for Deletion to Classes of DAGs |
1 |
| Space Efficient Linear Time Algorithms for BFS, DFS and Applications |
1 |
| Online Bin Packing with Advice of Small Size |
1 |
| Comparing Linear Width Parameters for Directed Graphs |
1 |
| Minimal Distance of Propositional Models |
0 |
| The Descriptive Complexity of Subgraph Isomorphism Without Numerics |
0 |
| Parameterized Analysis of the Online Priority and Node-Weighted Steiner Tree Problems |
0 |
| Weak Completeness Notions for Exponential Time |
0 |
| Logarithmic Query Complexity for Approximate Nash Computation in Large Games |
0 |
