Pages that link to "Item:Q3557003"
From MaRDI portal
The following pages link to LATIN 2010: Theoretical Informatics (Q3557003):
Displayed 50 items.
- Optimal polygonal representation of planar graphs (Q2429359) (← links)
- The complexity of counting Eulerian tours in 4-regular graphs (Q2429360) (← links)
- Gradual sub-lattice reduction and a new complexity for factoring polynomials (Q2429362) (← links)
- Colorful Strips (Q3557004) (← links)
- The Mono- and Bichromatic Empty Rectangle and Square Problems in All Dimensions (Q3557005) (← links)
- Connectivity Is Not a Limit for Kernelization: Planar Connected Dominating Set (Q3557006) (← links)
- Randomized Truthful Algorithms for Scheduling Selfish Tasks on Parallel Machines (Q3557007) (← links)
- Almost Linear Time Computation of the Chromatic Polynomial of a Graph of Bounded Tree-Width (Q3557008) (← links)
- Average Parameterization and Partial Kernelization for Computing Medians (Q3557009) (← links)
- Sharp Separation and Applications to Exact and Parameterized Algorithms (Q3557010) (← links)
- Finding the Minimum-Distance Schedule for a Boundary Searcher with a Flashlight (Q3557011) (← links)
- The Language Theory of Bounded Context-Switching (Q3557012) (← links)
- Local Search Performance Guarantees for Restricted Related Parallel Machine Scheduling (Q3557013) (← links)
- Packet Routing on the Grid (Q3557014) (← links)
- Faithful Representations of Graphs by Islands in the Extended Grid (Q3557016) (← links)
- The I/O Complexity of Sparse Matrix Dense Matrix Multiplication (Q3557017) (← links)
- Optimal Succinctness for Range Minimum Queries (Q3557018) (← links)
- Compact Rich-Functional Binary Relation Representations (Q3557019) (← links)
- Radix Cross-Sections for Length Morphisms (Q3557020) (← links)
- Pairs of Complementary Unary Languages with “Balanced” Nondeterministic Automata (Q3557021) (← links)
- Quotient Complexity of Ideal Languages (Q3557022) (← links)
- Complexity of Operations on Cofinite Languages (Q3557023) (← links)
- Fast Set Intersection and Two-Patterns Matching (Q3557024) (← links)
- A Larger Lower Bound on the OBDD Complexity of the Most Significant Bit of Multiplication (Q3557025) (← links)
- Modelling the LLL Algorithm by Sandpiles (Q3557026) (← links)
- Communication-Efficient Construction of the Plane Localized Delaunay Graph (Q3557027) (← links)
- Time Complexity of Distributed Topological Self-stabilization: The Case of Graph Linearization (Q3557028) (← links)
- Randomised Broadcasting: Memory vs. Randomness (Q3557029) (← links)
- Limit Theorems for Random MAX-2-XORSAT (Q3557030) (← links)
- On Quadratic Threshold CSPs (Q3557031) (← links)
- Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming (Q3557032) (← links)
- Finding the Best CAFE Is NP-Hard (Q3557033) (← links)
- The Size and Depth of Layered Boolean Circuits (Q3557034) (← links)
- Lipschitz Unimodal and Isotonic Regression on Paths and Trees (Q3557035) (← links)
- Ambiguity and Deficiency in Costas Arrays and APN Permutations (Q3557036) (← links)
- Minimum-Perimeter Intersecting Polygons (Q3557038) (← links)
- Finding the Smallest Gap between Sums of Square Roots (Q3557039) (← links)
- Matching Points with Things (Q3557040) (← links)
- Homotopic Rectilinear Routing with Few Links and Thick Edges (Q3557041) (← links)
- Tilings Robust to Errors (Q3557042) (← links)
- Visiting a Sequence of Points with a Bevel-Tip Needle (Q3557043) (← links)
- Euclidean Prize-Collecting Steiner Forest (Q3557044) (← links)
- Prize-Collecting Steiner Networks via Iterative Rounding (Q3557046) (← links)
- Kernelization through Tidying (Q3557047) (← links)
- The Power of Fair Pricing Mechanisms (Q3557049) (← links)
- Quasi-Proportional Mechanisms: Prior-Free Revenue Maximization (Q3557050) (← links)
- Some Observations on Holographic Algorithms (Q3557051) (← links)
- The Interval Constrained 3-Coloring Problem (Q3557052) (← links)
- Counting Hexagonal Patches and Independent Sets in Circle Graphs (Q3557053) (← links)
- Approximating Maximum Diameter-Bounded Subgraphs (Q3557054) (← links)