The following pages link to Algorithmica (Q96582):
Displaying 50 items.
- Maximum likelihood analysis of the Ford-Fulkerson method on special graphs (Q289909) (← links)
- Configurations and minority in the string consensus problem (Q289911) (← links)
- Outer 1-planar graphs (Q289919) (← links)
- A closer look at multiple forking: leveraging (in)dependence for a tighter bound (Q289922) (← links)
- On resilient graph spanners (Q289925) (← links)
- A `stochastic safety radius' for distance-based tree reconstruction (Q289927) (← links)
- Distance oracles for time-dependent networks (Q289929) (← links)
- Assigning channels via the meet-in-the-middle approach (Q289931) (← links)
- Structural parameterizations for boxicity (Q289935) (← links)
- Erratum to: ``Signature theory in holographic algorithms'' (Q289936) (← links)
- Coding techniques for handling failures in large disk arrays (Q297238) (← links)
- String layouts for a redundant array of inexpensive disks (Q297239) (← links)
- A parameterized study of maximum generalized pattern matching problems (Q300450) (← links)
- Matroid and knapsack center problems (Q300451) (← links)
- New approximation algorithms for the unsplittable capacitated facility location problem (Q300454) (← links)
- A fast algorithm for permutation pattern matching based on alternating runs (Q300457) (← links)
- Chordal editing is fixed-parameter tractable (Q300460) (← links)
- Computing directed pathwidth in \(O(1.89^n)\) time (Q300464) (← links)
- Two-page book embeddings of 4-planar graphs (Q300468) (← links)
- Guest editorial: Selected papers from WG 2014 (Q300469) (← links)
- Separation dimension of graphs and hypergraphs (Q300474) (← links)
- A new characterization of \(P_k\)-free graphs (Q300476) (← links)
- Between treewidth and clique-width (Q300479) (← links)
- Guest editorial: Theory of evolutionary computation (Q306484) (← links)
- Runtime analysis of non-elitist populations: from classical optimisation to partial information (Q306486) (← links)
- Robustness of populations in stochastic environments (Q306488) (← links)
- Concentration of first hitting times under additive drift (Q306489) (← links)
- Superpolynomial lower bounds for the \((1+1)\) EA on some easy combinatorial problems (Q306491) (← links)
- The impact of random initialization on the runtime of randomized search heuristics (Q306492) (← links)
- MMAS versus population-based EA on a family of dynamic fitness functions (Q306495) (← links)
- Introduction for S.I. AofA14 (Q308941) (← links)
- An asymptotic analysis of labeled and unlabeled \(k\)-trees (Q308942) (← links)
- Compositions into powers of \(b\): asymptotic enumeration and parameters (Q308944) (← links)
- Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme (Q308946) (← links)
- On the cost of fixed partial match queries in \(K\)-d trees (Q308949) (← links)
- A unified approach to linear probing hashing with buckets (Q308951) (← links)
- Asymptotic lattice path enumeration using diagonals (Q308954) (← links)
- Complexity of anticipated rejection algorithms and the Darling-Mandelbrot distribution (Q308957) (← links)
- Foreword: Special issue on IPEC 2014 (Q309784) (← links)
- The parameterized complexity of geometric graph isomorphism (Q309786) (← links)
- On the read-once property of branching programs and CNFs of bounded treewidth (Q309788) (← links)
- Finding shortest paths between graph colourings (Q309791) (← links)
- Solving linear equations parameterized by Hamming weight (Q309792) (← links)
- The relative exponential time complexity of approximate counting satisfying assignments (Q309794) (← links)
- Graph isomorphism parameterized by elimination distance to bounded degree (Q309797) (← links)
- Polynomial kernels and user reductions for the workflow satisfiability problem (Q309799) (← links)
- AND-compression of NP-complete problems: streamlined proof and minor observations (Q309801) (← links)
- Approximate well-supported Nash equilibria below two-thirds (Q329276) (← links)
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments (Q329279) (← links)
- It's a small world for random surfers (Q329281) (← links)
