Pages that link to "Item:Q2894447"
From MaRDI portal
The following pages link to LATIN 2012: Theoretical Informatics (Q2894447):
Displaying 50 items.
- Parameterized complexity of MaxSat above average (Q392026) (← links)
- On the bend-number of planar and outerplanar graphs (Q477341) (← links)
- A generalization of the convex Kakeya problem (Q486985) (← links)
- On plane constrained bounded-degree spanners (Q1739100) (← links)
- Low Complexity Scheduling Algorithm Minimizing the Energy for Tasks with Agreeable Deadlines (Q2894449) (← links)
- Bichromatic 2-Center of Pairs of Points (Q2894450) (← links)
- Erdős-Rényi Sequences and Deterministic Construction of Expanding Cayley Graphs (Q2894451) (← links)
- A Better Approximation Ratio and an IP Formulation for a Sensor Cover Problem (Q2894453) (← links)
- On the Advice Complexity of the Knapsack Problem (Q2894454) (← links)
- Reoptimization of Some Maximum Weight Induced Hereditary Subgraph Problems (Q2894455) (← links)
- Space-Efficient Approximation Scheme for Circular Earth Mover Distance (Q2894457) (← links)
- Density Classification on Infinite Lattices and Trees (Q2894458) (← links)
- Coloring Planar Homothets and Three-Dimensional Hypergraphs (Q2894459) (← links)
- An Equivariance Theorem with Applications to Renaming (Q2894460) (← links)
- Renaming Is Weaker Than Set Agreement But for Perfect Renaming: A Map of Sub-consensus Tasks (Q2894461) (← links)
- Pseudorandomness of a Random Kronecker Sequence (Q2894462) (← links)
- Revisiting the Cache Miss Analysis of Multithreaded Algorithms (Q2894463) (← links)
- Solving the 2-Disjoint Connected Subgraphs Problem Faster Than 2 n (Q2894465) (← links)
- A O(1/ε 2) n -Time Sieving Algorithm for Approximate Integer Programming (Q2894466) (← links)
- Two-Dimensional Range Diameter Queries (Q2894467) (← links)
- An Improved Upper Bound on the Density of Universal Random Graphs (Q2894468) (← links)
- Logspace Computations in Graph Groups and Coxeter Groups (Q2894469) (← links)
- Approximating the Edge Length of 2-Edge Connected Planar Geometric Graphs on a Set of Points (Q2894470) (← links)
- On the Radon Number for P 3-Convexity (Q2894471) (← links)
- Computing Minimum Geodetic Sets of Proper Interval Graphs (Q2894472) (← links)
- Hausdorff Rank of Scattered Context-Free Linear Orders (Q2894473) (← links)
- Opportunistic Information Dissemination in Mobile Ad-Hoc Networks: Adaptiveness vs. Obliviousness and Randomization vs. Determinism (Q2894474) (← links)
- On the Non-progressive Spread of Influence through Social Networks (Q2894476) (← links)
- Forbidden Patterns (Q2894477) (← links)
- Structural Complexity of Multiobjective NP Search Problems (Q2894478) (← links)
- k-Gap Interval Graphs (Q2894479) (← links)
- Decidability Classes for Mobile Agents Computing (Q2894480) (← links)
- NE Is Not NP Turing Reducible to Nonexponentially Dense NP Sets (Q2894481) (← links)
- Efficient Arbitrary and Resolution Proofs of Unsatisfiability for Restricted Tree-Width (Q2894482) (← links)
- Indexed Multi-pattern Matching (Q2894483) (← links)
- New Lower Bound on Max Cut of Hypergraphs with an Application to r -Set Splitting (Q2894484) (← links)
- Cache Me If You Can: Capacitated Selfish Replication Games (Q2894485) (← links)
- The Efficiency of MapReduce in Parallel External Memory (Q2894486) (← links)
- Algorithms for Some H-Join Decompositions (Q2894487) (← links)
- Hiring above the m-th Best Candidate: A Generalization of Records in Permutations (Q2894489) (← links)
- On the Performance of Smith’s Rule in Single-Machine Scheduling with Nonlinear Cost (Q2894490) (← links)
- Advantage of Overlapping Clusters for Minimizing Conductance (Q2894491) (← links)
- Independence of Tabulation-Based Hash Classes (Q2894493) (← links)
- Oblivious Two-Way Finite Automata: Decidability and Complexity (Q2894494) (← links)
- Clique-Colouring and Biclique-Colouring Unichord-Free Graphs (Q2894495) (← links)
- Random Walks and Bisections in Random Circulant Graphs (Q2894496) (← links)
- The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem (Q2894497) (← links)
- Fully Analyzing an Algebraic Pólya Urn Model (Q2894499) (← links)
- Degree-Constrained Node-Connectivity (Q2894500) (← links)
- Survivable Network Activation Problems (Q2894501) (← links)
