The following pages link to Frontiers in Algorithmics (Q3188827):
Displayed 50 items.
- A New Distributed Algorithm for Computing a Dominating Set on Grids (Q3452568) (← links)
- Approximate Model Counting via Extension Rule (Q3452569) (← links)
- Improved Information Set Decoding for Code-Based Cryptosystems with Constrained Memory (Q3452571) (← links)
- Truthful Strategy and Resource Integration for Multi-tenant Data Center Demand Response (Q3452573) (← links)
- Local Search to Approximate Max NAE-$$k$$-Sat Tightly (Q3452574) (← links)
- Faster Computation of the Maximum Dissociation Set and Minimum 3-Path Vertex Cover in Graphs (Q3452575) (← links)
- Enumeration, Counting, and Random Generation of Ladder Lotteries (Q3452576) (← links)
- Efficient Modular Reduction Algorithm Without Correction Phase (Q3452578) (← links)
- Super Solutions of Random Instances of Satisfiability (Q3452579) (← links)
- Optimal Field Splitting, with Applications in Intensity-Modulated Radiation Therapy (Q3507314) (← links)
- A Practical Parameterized Algorithm for Weighted Minimum Letter Flips Model of the Individual Haplotyping Problem (Q3507315) (← links)
- A PTAS for the k-Consensus Structures Problem Under Euclidean Squared Distance (Q3507316) (← links)
- Haplotype Assembly from Weighted SNP Fragments and Related Genotype Information (Q3507318) (← links)
- Estimating Hybrid Frequency Moments of Data Streams (Q3507319) (← links)
- Constraint Bipartite Vertex Cover Simpler Exact Algorithms and Implementations (Q3507320) (← links)
- NP-Completeness of (k-SAT,r-UNk-SAT) and (LSAT ≥ k ,r-UNLSAT ≥ k ) (Q3507322) (← links)
- Absorbing Random Walks and the NAE2SAT Problem (Q3507323) (← links)
- Versioning Tree Structures by Path-Merging (Q3507324) (← links)
- A Linear In-situ Algorithm for the Power of Cyclic Permutation (Q3507325) (← links)
- Multi-bidding Strategy in Sponsored Keyword Auction (Q3507326) (← links)
- A CSP-Based Approach for Solving Parity Game (Q3507327) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
- Efficient First-Order Model-Checking Using Short Labels (Q3507329) (← links)
- Matching for Graphs of Bounded Degree (Q3507330) (← links)
- Searching Trees with Sources and Targets (Q3507331) (← links)
- Ranking of Closeness Centrality for Large-Scale Social Networks (Q3507332) (← links)
- Mixed Search Number of Permutation Graphs (Q3507333) (← links)
- The 2-Terminal-Set Path Cover Problem and Its Polynomial Solution on Cographs (Q3507334) (← links)
- A Distributed Algorithm to Approximate Node-Weighted Minimum α-Connected (θ,k)-Coverage in Dense Sensor Networks (Q3507337) (← links)
- Optimal Surface Flattening (Q3507338) (← links)
- Visiting a Polygon on the Optimal Way to a Query Point (Q3507339) (← links)
- Constraint Abstraction in Verification of Security Protocols (Q3507341) (← links)
- Fast Convergence of Variable-Structure Congestion Control Protocol with Explicit Precise Feedback (Q3507344) (← links)
- The Parameterized Complexity of the Rectangle Stabbing Problem and Its Variants (Q3507345) (← links)
- Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach (Q3507347) (← links)
- A Scalable Algorithm for Graph-Based Active Learning (Q3507348) (← links)
- A Supervised Feature Extraction Algorithm for Multi-class (Q3507349) (← links)
- An Incremental Feature Learning Algorithm Based on Least Square Support Vector Machine (Q3507350) (← links)
- Progress on Certifying Algorithms (Q3587331) (← links)
- Mechanism Design for Multi-slot Ads Auction in Sponsored Search Markets (Q3587332) (← links)
- Truthful Auction for CPU Time Slots (Q3587333) (← links)
- Top-d Rank Aggregation in Web Meta-search Engine (Q3587334) (← links)
- Minimum Common String Partition Revisited (Q3587335) (← links)
- Inapproximability of Maximal Strip Recovery: II (Q3587336) (← links)
- Minimizing Total Variation for Field Splitting with Feathering in Intensity-Modulated Radiation Therapy (Q3587337) (← links)
- Approximation Schemes for Scheduling with Availability Constraints (Q3587338) (← links)
- An $\Omega(\frac{1}{\varepsilon} \log \frac{1}{\varepsilon})$ Space Lower Bound for Finding ε-Approximate Quantiles in a Data Stream (Q3587339) (← links)
- Improved Sublinear Time Algorithm for Width-Bounded Separators (Q3587340) (← links)
- Constant Time Generation of Biconnected Rooted Plane Graphs (Q3587341) (← links)
- Solving General Lattice Puzzles (Q3587343) (← links)