Pages that link to "Item:Q2921996"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2014 (Q2921996):
Displayed 49 items.
- $\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability (Q2922595) (← links)
- Forbidden Induced Subgraphs and the Price of Connectivity for Feedback Vertex Set (Q2922596) (← links)
- Network-Based Dissolution (Q2922597) (← links)
- On Unification of QBF Resolution-Based Calculi (Q2922598) (← links)
- Minimum Planar Multi-sink Cuts with Connectivity Priors (Q2922599) (← links)
- The Price of Envy-Freeness in Machine Scheduling (Q2922600) (← links)
- On the Complexity of Some Ordering Problems (Q2922601) (← links)
- The Relationship between Multiplicative Complexity and Nonlinearity (Q2922602) (← links)
- Dual Connectedness of Edge-Bicolored Graphs and Beyond (Q2922603) (← links)
- Combinatorial Voter Control in Elections (Q2922604) (← links)
- An Improved Deterministic #SAT Algorithm for Small De Morgan Formulas (Q2922605) (← links)
- On the Limits of Depth Reduction at Depth 3 Over Small Finite Fields (Q2922606) (← links)
- Hitting Forbidden Subgraphs in Graphs of Bounded Treewidth (Q2922607) (← links)
- Probabilistic Analysis of Power Assignments (Q2922608) (← links)
- Existence of Secure Equilibrium in Multi-player Games with Perfect Information (Q2922609) (← links)
- An Efficient Quantum Algorithm for Finding Hidden Parabolic Subgroups in the General Linear Group (Q2922610) (← links)
- A Note on the Minimum Distance of Quantum LDPC Codes (Q2922612) (← links)
- Minimum Bisection Is NP-hard on Unit Disk Graphs (Q2922613) (← links)
- Query-Competitive Algorithms for Cheapest Set Problems under Uncertainty (Q2922614) (← links)
- Streaming Kernelization (Q2922615) (← links)
- A Reconfigurations Analogue of Brooks’ Theorem (Q2922616) (← links)
- Intersection Graphs of L-Shapes and Segments in the Plane (Q2922617) (← links)
- Autoreducibility and Mitoticity of Logspace-Complete Sets for NP and Other Classes (Q2922618) (← links)
- Editing to a Connected Graph of Given Degrees (Q2922619) (← links)
- Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth (Q2922620) (← links)
- On Characterizations of Randomized Computation Using Plain Kolmogorov Complexity (Q2922621) (← links)
- New Results for Non-Preemptive Speed Scaling (Q2922622) (← links)
- Lower Bounds for Splittings by Linear Combinations (Q2922623) (← links)
- On the Complexity of List Ranking in the Parallel External Memory Model (Q2922625) (← links)
- Knocking Out P k -free Graphs (Q2922626) (← links)
- Relating the Time Complexity of Optimization Problems in Light of the Exponential-Time Hypothesis (Q2922627) (← links)
- Affine Consistency and the Complexity of Semilinear Constraints (Q2922628) (← links)
- Small Complexity Classes for Computable Analysis (Q2922629) (← links)
- Two Results about Quantum Messages (Q2922630) (← links)
- Parameterized Approximations via d-Skew-Symmetric Multicut (Q2922631) (← links)
- On the Clique Editing Problem (Q2922634) (← links)
- On the Complexity of Symbolic Verification and Decision Problems in Bit-Vector Logic (Q2922635) (← links)
- Computational Complexity of Covering Three-Vertex Multigraphs (Q2922636) (← links)
- Finding Maximum Common Biconnected Subgraphs in Series-Parallel Graphs (Q2922637) (← links)
- On Coloring Resilient Graphs (Q2922638) (← links)
- Document Retrieval with One Wildcard (Q2922639) (← links)
- An H n/2 Upper Bound on the Price of Stability of Undirected Network Design Games (Q2922640) (← links)
- Traveling Salesman Problems in Temporal Graphs (Q2922641) (← links)
- Inferring Strings from Lyndon Factorization (Q2922642) (← links)
- Betweenness Centrality – Incremental and Faster (Q2922644) (← links)
- Deterministic Parameterized Algorithms for the Graph Motif Problem (Q2922645) (← links)
- The Two Queries Assumption and Arthur-Merlin Classes (Q2922647) (← links)
- Flexible Bandwidth Assignment with Application to Optical Networks (Q2922648) (← links)
- Approximation Algorithms for Bounded Color Matchings via Convex Decompositions (Q2922649) (← links)