Pages that link to "Item:Q2830052"

The following pages link to Algorithmic Aspects in Information and Management (Q2830052):

Displaying 50 items.

• A general framework for path convexities (Q2156285) (← links)
• Efficient FPT algorithms for (strict) compatibility of unrooted phylogenetic trees (Q2408842) (← links)
• Item Pricing for Combinatorial Public Projects (Q2830053) (← links)
• Norm-Based Locality Measures of Two-Dimensional Hilbert Curves (Q2830055) (← links)
• On the Complexity of Clustering with Relaxed Size Constraints (Q2830056) (← links)
• Superstring Graph: A New Approach for Genome Assembly (Q2830057) (← links)
• A Very Fast String Matching Algorithm Based on Condensed Alphabets (Q2830059) (← links)
• Minimum-Density Identifying Codes in Square Grids (Q2830060) (← links)
• Separating Codes and Traffic Monitoring (Q2830061) (← links)
• Know When to Persist: Deriving Value from a Stream Buffer (Q2830062) (← links)
• Algorithmic Aspects of Upper Domination: A Parameterised Perspective (Q2830063) (← links)
• On Network Formation Games with Heterogeneous Players and Basic Network Creation Games (Q2830064) (← links)
• Parameterized Complexity of Team Formation in Social Networks (Q2830065) (← links)
• Reconstructing Cactus Graphs from Shortest Path Information (Q2830066) (← links)
• Near-Optimal Dominating Sets via Random Sampling (Q2830067) (← links)
• A Multivariate Approach for Checking Resiliency in Access Control (Q2830068) (← links)
• Efficient Algorithms for the Order Preserving Pattern Matching Problem (Q2830069) (← links)
• Computing the Line-Constrained k-center in the Plane for Small k (Q2830071) (← links)
• Online k-max Search Algorithms with Applications to the Secretary Problem (Q2830073) (← links)
• Double Partition: (6 + ε)-Approximation for Minimum Weight Dominating Set in Unit Disk Graphs (Q3511407) (← links)
• Nash Bargaining Via Flexible Budget Markets (Q3511408) (← links)
• On the Minimum Hitting Set of Bundles Problem (Q3511409) (← links)
• Speed Scaling with a Solar Cell (Q3511410) (← links)
• Engineering Label-Constrained Shortest-Path Algorithms (Q3511412) (← links)
• New Upper Bounds on Continuous Tree Edge-Partition Problem (Q3511413) (← links)
• A Meeting Scheduling Problem Respecting Time and Space (Q3511415) (← links)
• Fixed-Parameter Algorithms for Kemeny Scores (Q3511416) (← links)
• The Distributed Wireless Gathering Problem (Q3511417) (← links)
• Approximating Maximum Edge 2-Coloring in Simple Graphs Via Local Improvement (Q3511418) (← links)
• An Improved Randomized Approximation Algorithm for Maximum Triangle Packing (Q3511419) (← links)
• Line Facility Location in Weighted Regions (Q3511420) (← links)
• Algorithms for Temperature-Aware Task Scheduling in Microprocessor Systems (Q3511421) (← links)
• Engineering Comparators for Graph Clusterings (Q3511422) (← links)
• On the Fast Searching Problem (Q3511423) (← links)
• Confidently Cutting a Cake into Approximately Fair Pieces (Q3511425) (← links)
• Copeland Voting Fully Resists Constructive Control (Q3511426) (← links)
• The Complexity of Power-Index Comparison (Q3511427) (← links)
• Facility Location Problems: A Parameterized View (Q3511428) (← links)
• Shortest Path Queries in Polygonal Domains (Q3511429) (← links)
• A Fast 2-Approximation Algorithm for the Minimum Manhattan Network Problem (Q3511430) (← links)
• Minimum Cost Homomorphism Dichotomy for Oriented Cycles (Q3511431) (← links)
• Minimum Leaf Out-Branching Problems (Q3511432) (← links)
• Graphs and Path Equilibria (Q3511433) (← links)
• No l Grid-Points in Spaces of Small Dimension (Q3511434) (← links)
• The Secret Santa Problem (Q3511435) (← links)
• Finding Optimal Refueling Policies in Transportation Networks (Q3511436) (← links)
• Scale Free Interval Graphs (Q3511437) (← links)
• On Representation of Planar Graphs by Segments (Q3511438) (← links)
• An Optimal On-Line Algorithm for Preemptive Scheduling on Two Uniform Machines in the ℓ p Norm (Q3511439) (← links)
• An Optimal Strategy for Online Non-uniform Length Order Scheduling (Q3511440) (← links)