Pages that link to "Item:Q2897976"
From MaRDI portal
The following pages link to Frontiers in Algorithmics and Algorithmic Aspects in Information and Management (Q2897976):
Displaying 50 items.
- Optimal Binary Representation of Mosaic Floorplans and Baxter Permutations (Q2897977) (← links)
- Succinct Strictly Convex Greedy Drawing of 3-Connected Plane Graphs (Q2897978) (← links)
- Weighted Inverse Minimum Cut Problem under the Sum-Type Hamming Distance (Q2897979) (← links)
- Voronoi Diagram with Visual Restriction (Q2897980) (← links)
- Minimization of the Maximum Distance between the Two Guards Patrolling a Polygonal Region (Q2897981) (← links)
- On Envy-Free Pareto Efficient Pricing (Q2897983) (← links)
- Online Pricing for Multi-type of Items (Q2897984) (← links)
- Algorithms with Limited Number of Preemptions for Scheduling on Parallel Machines (Q2897985) (← links)
- Computing Maximum Non-crossing Matching in Convex Bipartite Graphs (Q2897986) (← links)
- Algorithms for Bandwidth Consecutive Multicolorings of Graphs (Q2897987) (← links)
- Independent Domination on Tree Convex Bipartite Graphs (Q2897988) (← links)
- On-Line Scheduling of Parallel Jobs in Heterogeneous Multiple Clusters (Q2897989) (← links)
- On Multiprocessor Temperature-Aware Scheduling Problems (Q2897990) (← links)
- Online Minimum Makespan Scheduling with a Buffer (Q2897991) (← links)
- A Dense Hierarchy of Sublinear Time Approximation Schemes for Bin Packing (Q2897992) (← links)
- Multivariate Polynomial Integration and Differentiation Are Polynomial Time Inapproximable Unless P=NP (Q2897993) (← links)
- Some Remarks on the Incompressibility of Width-Parameterized SAT Instances (Q2897994) (← links)
- Kernels for Packing and Covering Problems (Q2897995) (← links)
- The Worst-Case Upper Bound for Exact 3-Satisfiability with the Number of Clauses as the Parameter (Q2897996) (← links)
- Fixed-Parameter Tractability of almost CSP Problem with Decisive Relations (Q2897997) (← links)
- On Editing Graphs into 2-Club Clusters (Q2897998) (← links)
- Solving Generalized Optimization Problems Subject to SMT Constraints (Q2897999) (← links)
- Solving Difficult SAT Problems by Using OBDDs and Greedy Clique Decomposition (Q2898000) (← links)
- Zero-Sum Flow Numbers of Regular Graphs (Q2898002) (← links)
- More Efficient Parallel Integer Sorting (Q2898003) (← links)
- Fast Relative Lempel-Ziv Self-index for Similar Sequences (Q2898004) (← links)
- A Comparison of Performance Measures via Online Search (Q2898005) (← links)
- Online Exploration of All Vertices in a Simple Polygon (Q2898006) (← links)
- In-Place Algorithms for Computing a Largest Clique in Geometric Intersection Graphs (Q2898007) (← links)
- The Black-and-White Coloring Problem on Distance-Hereditary Graphs and Strongly Chordal Graphs (Q2898008) (← links)
- An Improved Approximation Algorithm for the Bandpass Problem (Q2898009) (← links)
- Partial Degree Bounded Edge Packing Problem (Q2898010) (← links)
- Erratum: The Approximability of the Exemplar Breakpoint Distance Problem (Q2898011) (← links)
- Progress in Complexity of Counting Problems (Q3004647) (← links)
- Recent Developments in the Theory of Pre-processing (Q3004648) (← links)
- Recent Developments in the Mechanism Design Problem for Scheduling (Q3004649) (← links)
- Degree-Driven Design for Correct Geometric Algorithms (Q3004650) (← links)
- Approximation Algorithm for the Uniform Bounded Facility Problem (Q3004651) (← links)
- The k-Canadian Travelers Problem with Communication (Q3004652) (← links)
- An Improved Competitive Algorithm for One-Dimensional Incremental Median Problem (Q3004653) (← links)
- Approximation Scheme for Scheduling Resumable Proportionally Deteriorating Jobs (Q3004654) (← links)
- An Improved Approximation Algorithm for the Complementary Maximal Strip Recovery Problem (Q3004655) (← links)
- Greedy Routing via Embedding Graphs onto Semi-metric Spaces (Q3004656) (← links)
- On Variants of the Spanning Star Forest Problem (Q3004657) (← links)
- An Implicit Degree Condition for Cyclability in Graphs (Q3004658) (← links)
- Parallel Enumeration of Lattice Animals (Q3004659) (← links)
- Parameterized Edge Dominating Set in Cubic Graphs (Q3004660) (← links)
- On Some Geometric Problems of Color-Spanning Sets (Q3004661) (← links)
- Approximation Algorithms for Cutting a Convex Polyhedron Out of a Sphere (Q3004662) (← links)
- An Algorithm for Optimal Acyclic Edge-Colouring of Cubic Graphs (Q3004663) (← links)
