Pages that link to "Item:Q5405022"
From MaRDI portal
The following pages link to LATIN 2014: Theoretical Informatics (Q5405022):
Displaying 50 items.
- On the stability of generalized second price auctions with budgets (Q315522) (← links)
- A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters (Q727968) (← links)
- Conjugacy in Baumslag's group, generic case complexity, and division in power circuits (Q727969) (← links)
- Biased predecessor search (Q727976) (← links)
- Algorithmic and hardness results for the colorful components problems (Q747623) (← links)
- Hierarchical complexity of 2-clique-colouring weakly chordal graphs and perfect graphs having cliques of size at least 3 (Q2634675) (← links)
- A 3-Approximation Algorithm for Guarding Orthogonal Art Galleries with Sliding Cameras (Q2946049) (← links)
- The Flip Diameter of Rectangulations and Convex Subdivisions (Q2965976) (← links)
- The Computational Complexity of the Game of Set and Its Theoretical Applications (Q5405025) (← links)
- Independent and Hitting Sets of Rectangles Intersecting a Diagonal Line (Q5405026) (← links)
- Approximating Vector Scheduling: Almost Matching Upper and Lower Bounds (Q5405027) (← links)
- False-Name Manipulation in Weighted Voting Games Is Hard for Probabilistic Polynomial Time (Q5405028) (← links)
- A Natural Generalization of Bounded Tree-Width and Bounded Clique-Width (Q5405029) (← links)
- Optimal Algorithms for Constrained 1-Center Problems (Q5405030) (← links)
- Upper Bounds on the Spanning Ratio of Constrained Theta-Graphs (Q5405032) (← links)
- Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time (Q5405033) (← links)
- The Planar Slope Number of Subcubic Graphs (Q5405034) (← links)
- Smooth Orthogonal Drawings of Planar Graphs (Q5405035) (← links)
- Drawing HV-Restricted Planar Graphs (Q5405036) (← links)
- Periodic Planar Straight-Frame Drawings with Polynomial Resolution (Q5405037) (← links)
- A Characterization of Those Automata That Structurally Generate Finite Groups (Q5405038) (← links)
- Linear Grammars with One-Sided Contexts and Their Automaton Representation (Q5405039) (← links)
- On the Computability of Relations on λ-Terms and Rice’s Theorem - The Case of the Expansion Problem for Explicit Substitutions (Q5405040) (← links)
- Computing in the Presence of Concurrent Solo Executions (Q5405041) (← links)
- Combining All Pairs Shortest Paths and All Pairs Bottleneck Paths Problems (Q5405042) (← links)
- (Total) Vector Domination for Graphs with Bounded Branchwidth (Q5405043) (← links)
- Computing the Degeneracy of Large Graphs (Q5405044) (← links)
- Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems (Q5405045) (← links)
- An Improved Data Stream Algorithm for Clustering (Q5405046) (← links)
- Approximation Algorithms for the Gromov Hyperbolicity of Discrete Metric Spaces (Q5405047) (← links)
- Helly-Type Theorems in Property Testing (Q5405049) (← links)
- New Bounds for Online Packing LPs (Q5405051) (← links)
- Improved Minmax Regret 1-Center Algorithms for Cactus Networks with c Cycles (Q5405052) (← links)
- Collision-Free Network Exploration (Q5405053) (← links)
- Powers of Hamilton Cycles in Pseudorandom Graphs (Q5405054) (← links)
- Local Update Algorithms for Random Graphs (Q5405055) (← links)
- Odd Graphs Are Prism-Hamiltonian and Have a Long Cycle (Q5405057) (← links)
- Relatively Bridge-Addable Classes of Graphs (Q5405058) (← links)
- O(n) Time Algorithms for Dominating Induced Matching Problems (Q5405059) (← links)
- Coloring Graph Powers: Graph Product Bounds and Hardness of Approximation (Q5405060) (← links)
- Convexity in Partial Cubes: The Hull Number (Q5405061) (← links)
- Connected Greedy Colourings (Q5405062) (← links)
- On the Number of Prefix and Border Tables (Q5405063) (← links)
- Probabilities of 2-Xor Functions (Q5405064) (← links)
- Equivalence Classes of Random Boolean Trees and Application to the Catalan Satisfiability Problem (Q5405065) (← links)
- Weighted Staircase Tableaux, Asymmetric Exclusion Process, and Eulerian Type Recurrences (Q5405067) (← links)
- Counting and Generating Permutations Using Timed Languages (Q5405068) (← links)
- Semantic Word Cloud Representations: Hardness and Approximation Algorithms (Q5405069) (← links)
- The Complexity of Homomorphisms of Signed Graphs and Signed Constraint Satisfaction (Q5405070) (← links)
- Complexity of Coloring Graphs without Paths and Cycles (Q5405071) (← links)
