Pages that link to "Item:Q2912704"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2012 (Q2912704):
Displaying 50 items.
- Pancake flipping is hard (Q494050) (← links)
- Maximum cliques in graphs with small intersection number and random intersection graphs (Q826323) (← links)
- Reductions to the set of random strings: The resource-bounded case (Q2878751) (← links)
- On the Complexity of Ontological Reasoning under Disjunctive Existential Rules (Q2912705) (← links)
- New Races in Parameterized Algorithmics (Q2912706) (← links)
- Scott Is Always Simple (Q2912707) (← links)
- Simple Models for Recursive Schemes (Q2912708) (← links)
- Unordered Constraint Satisfaction Games (Q2912709) (← links)
- A Polynomial-Time Algorithm for Computing the Maximum Common Subgraph of Outerplanar Graphs of Bounded Degree (Q2912710) (← links)
- Approximate Graph Isomorphism (Q2912712) (← links)
- Near-Optimal Expanding Generator Sets for Solvable Permutation Groups (Q2912713) (← links)
- Generating Functions of Timed Languages (Q2912714) (← links)
- The Robust Set Problem: Parameterized Complexity and Approximation (Q2912715) (← links)
- Mortality for 2 ×2 Matrices Is NP-Hard (Q2912716) (← links)
- Solving Counter Parity Games (Q2912718) (← links)
- Drawing Planar Graphs on Points Inside a Polygon (Q2912719) (← links)
- New Advances in Reoptimizing the Minimum Steiner Tree Problem (Q2912720) (← links)
- Abelian Pattern Avoidance in Partial Words (Q2912721) (← links)
- The Complexity of Rerouting Shortest Paths (Q2912722) (← links)
- Computing with Large Populations Using Interactions (Q2912723) (← links)
- In-place Heap Construction with Optimized Comparisons, Moves, and Cache Misses (Q2912725) (← links)
- Model Checking Stochastic Branching Processes (Q2912726) (← links)
- Parameterized Study of the Test Cover Problem (Q2912727) (← links)
- Sitting Closer to Friends Than Enemies, Revisited (Q2912728) (← links)
- A Dichotomy Theorem for Homomorphism Polynomials (Q2912729) (← links)
- Finite State Transducers for Modular Möbius Number Systems (Q2912730) (← links)
- Zero-Knowledge Proofs via Polynomial Representations (Q2912732) (← links)
- Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width (Q2912734) (← links)
- On the Impact of Fair Best Response Dynamics (Q2912735) (← links)
- Fast Balanced Partitioning Is Hard Even on Grids and Trees (Q2912736) (← links)
- A Characterization of Bispecial Sturmian Words (Q2912737) (← links)
- Online Sum-Radii Clustering (Q2912738) (← links)
- Observe and Remain Silent (Communication-Less Agent Location Discovery) (Q2912740) (← links)
- When Trees Grow Low: Shrubs and Fast MSO1 (Q2912741) (← links)
- Strategy Machines and Their Complexity (Q2912742) (← links)
- Coloring Graphs Characterized by a Forbidden Subgraph (Q2912743) (← links)
- Obtaining Planarity by Contracting Few Edges (Q2912744) (← links)
- Light Spanners in Bounded Pathwidth Graphs (Q2912746) (← links)
- Planarizing Gadgets for Perfect Matching Do Not Exist (Q2912747) (← links)
- Kernels for Edge Dominating Set: Simpler or Smaller (Q2912748) (← links)
- Categories of Coalgebraic Games (Q2912749) (← links)
- Quasi-recognizable vs MSO Definable Languages of One-Dimensional Overlapping Tiles (Q2912750) (← links)
- An Improved Approximation Scheme for Variable-Sized Bin Packing (Q2912752) (← links)
- Gathering an Even Number of Robots in an Odd Ring without Global Multiplicity Detection (Q2912753) (← links)
- Reversal Hierarchies for Small 2DFAs (Q2912754) (← links)
- Strictness of the Collapsible Pushdown Hierarchy (Q2912755) (← links)
- Computational Complexity of Smooth Differential Equations (Q2912757) (← links)
- The Lower Reaches of Circuit Uniformity (Q2912758) (← links)
- The Join Levels of the Trotter-Weil Hierarchy Are Decidable (Q2912759) (← links)
- Equations X + A = B and (X + X) + C = (X − X) + D over Sets of Natural Numbers (Q2912761) (← links)
