The following pages link to Frontiers in Algorithmics (Q3188827):
Displaying 50 items.
- Complete submodularity characterization in the comparative independent cascade model (Q2319905) (← links)
- Broadcast Problem in Hypercube of Trees (Q3188828) (← links)
- Direct and Certifying Recognition of Normal Helly Circular-Arc Graphs in Linear Time (Q3188829) (← links)
- A Fixed-Parameter Approach for Privacy-Protection with Global Recoding (Q3188830) (← links)
- A Circular Matrix-Merging Algorithm with Application in VMAT Radiation Therapy (Q3188831) (← links)
- Engineering Algorithms for Workflow Satisfiability Problem with User-Independent Constraints (Q3188832) (← links)
- The Complexity of Zero-Visibility Cops and Robber (Q3188833) (← links)
- Combining Edge Weight and Vertex Weight for Minimum Vertex Cover Problem (Q3188836) (← links)
- Randomized Parameterized Algorithms for Co-path Set Problem (Q3188837) (← links)
- Improved LP-rounding Approximations for the k-Disjoint Restricted Shortest Paths Problem (Q3188838) (← links)
- Monotone Grid Drawings of Planar Graphs (Q3188839) (← links)
- Spanning Distribution Forests of Graphs (Q3188841) (← links)
- A (1.408+ε)-Approximation Algorithm for Sorting Unsigned Genomes by Reciprocal Translocations (Q3188842) (← links)
- Space-Efficient Approximate String Matching Allowing Inversions in Fast Average Time (Q3188843) (← links)
- Minimal Double Dominating Sets in Trees (Q3188844) (← links)
- Parallel-Machine Scheduling Problem under the Job Rejection Constraint (Q3188845) (← links)
- Approximation Algorithms on Consistent Dynamic Map Labeling (Q3188846) (← links)
- The PoA of Scheduling Game with Machine Activation Costs (Q3188847) (← links)
- Approximation Algorithms for Bandwidth Consecutive Multicolorings (Q3188848) (← links)
- Improved Approximation Algorithm for Maximum Agreement Forest of Two Trees (Q3188849) (← links)
- Oblivious Integral Routing for Minimizing the Quadratic Polynomial Cost (Q3188850) (← links)
- Finding Simple Paths on Given Points in a Polygonal Region (Q3188851) (← links)
- Near Optimal Algorithms for Online Maximum Weighted b-Matching (Q3188852) (← links)
- Tree Convex Bipartite Graphs: $\mathcal{NP}$ -Complete Domination, Hamiltonicity and Treewidth (Q3188853) (← links)
- Zero-Sum Flow Numbers of Triangular Grids (Q3188854) (← links)
- A Study of Pure Random Walk Algorithms on Constraint Satisfaction Problems with Growing Domains (Q3188855) (← links)
- Calculating the Crossing Probability on the Square Tessellation of a Connection Game with Random Move Order: The Algorithm and Its Complexity (Q3188856) (← links)
- On Star-Cover and Path-Cover of a Tree (Q3188857) (← links)
- On the Complexity of Constrained Sequences Alignment Problems (Q3188858) (← links)
- On the Advice Complexity of One-Dimensional Online Bin Packing (Q3188859) (← links)
- Dynamic Matchings in Left Weighted Convex Bipartite Graphs (Q3188860) (← links)
- Soft Subdivision Search in Motion Planning, II: Axiomatics (Q3452548) (← links)
- On r-Gatherings on the Line (Q3452549) (← links)
- A New Algorithm for Intermediate Dataset Storage in a Cloud-Based Dataflow (Q3452550) (← links)
- Efficient Computation of the Characteristic Polynomial of a Threshold Graph (Q3452551) (← links)
- A Fast and Practical Method to Estimate Volumes of Convex Polytopes (Q3452552) (← links)
- Social Models and Algorithms for Optimization of Contact Immunity of Oral Polio Vaccine (Q3452553) (← links)
- The Directed Dominating Set Problem: Generalized Leaf Removal and Belief Propagation (Q3452554) (← links)
- A Linear Time Algorithm for Ordered Partition (Q3452555) (← links)
- Machine Scheduling with a Maintenance Interval and Job Delivery Coordination (Q3452556) (← links)
- Lower and Upper Bounds for Random Mimimum Satisfiability Problem (Q3452557) (← links)
- On Solving Systems of Diagonal Polynomial Equations Over Finite Fields (Q3452558) (← links)
- Pattern Backtracking Algorithm for the Workflow Satisfiability Problem with User-Independent Constraints (Q3452559) (← links)
- On the Sound Covering Cycle Problem in Paired de Bruijn Graphs (Q3452560) (← links)
- Approximation Algorithms for the Multilevel Facility Location Problem with Linear/Submodular Penalties (Q3452561) (← links)
- Smaller Kernels for Several FPT Problems Based on Simple Observations (Q3452562) (← links)
- Parameterized Minimum Cost Partition of a Tree with Supply and Demand (Q3452563) (← links)
- The Online Storage Strategy for Automated Storage and Retrieval System with Single Open in One Dimension (Q3452565) (← links)
- Union Closed Tree Convex Sets (Q3452566) (← links)
- Fast Quantum Algorithms for Least Squares Regression and Statistic Leverage Scores (Q3452567) (← links)
