The following pages link to Algorithmica (Q96582):
Displaying 50 items.
- Line-distortion, bandwidth and path-length of a graph (Q521805) (← links)
- I/O-efficient path traversal in succinct planar graphs (Q521807) (← links)
- Combinatorial auctions without money (Q521808) (← links)
- Efficient algorithms for clique-colouring and biclique-colouring unichord-free graphs (Q521809) (← links)
- Combinatorial relaxation algorithm for the entire sequence of the maximum degree of minors (Q521811) (← links)
- The price of optimum: complexity and approximation for a matching game (Q521813) (← links)
- Online square-into-square packing (Q521815) (← links)
- Improved approximation algorithms for box contact representations (Q521820) (← links)
- The price of anarchy in bilateral network formation in an adversary model (Q521821) (← links)
- Exclusive graph searching (Q521823) (← links)
- Local computation algorithms for graphs of non-constant degrees (Q524360) (← links)
- Improved pseudo-polynomial bound for the value problem and optimal strategy synthesis in mean payoff games (Q524362) (← links)
- Strip planarity testing for embedded planar graphs (Q524364) (← links)
- An on-line competitive algorithm for coloring bipartite graphs without long induced paths (Q524365) (← links)
- Extending partial representations of proper and unit interval graphs (Q524367) (← links)
- A constant factor approximation algorithm for the storage allocation problem (Q524369) (← links)
- Finding a shortest non-zero path in group-labeled graphs via permanent computation (Q524371) (← links)
- Short sequences of improvement moves lead to approximate equilibria in constraint satisfaction games (Q524372) (← links)
- A generalization of multiple choice balls-into-bins: tight bounds (Q524374) (← links)
- Efficient indexes for jumbled pattern matching with constant-sized alphabet (Q524375) (← links)
- A tight algorithm for strongly connected Steiner subgraph on two terminals with demands (Q524378) (← links)
- Optimal program-size complexity for self-assembled squares at temperature 1 in 3D (Q524381) (← links)
- Finding dominating induced matchings in \(P_8\)-free graphs in polynomial time (Q524382) (← links)
- Binary pattern tile set synthesis is NP-hard (Q527409) (← links)
- Minimizing the aggregate movements for interval coverage (Q527411) (← links)
- Steiner trees with bounded RC-delay (Q527413) (← links)
- List H-coloring a graph by removing few vertices (Q527415) (← links)
- Approximating the maximum overlap of polygons under translation (Q527417) (← links)
- A combinatorial certifying algorithm for linear feasibility in UTVPI constraints (Q527418) (← links)
- Distribution-sensitive construction of the greedy spanner (Q527422) (← links)
- Computing the center of uncertain points on tree networks (Q527423) (← links)
- Optimization with uniform size queries (Q527424) (← links)
- On the parameterized complexity of reconfiguration problems (Q527426) (← links)
- The maximum labeled path problem (Q527429) (← links)
- Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (Q527430) (← links)
- Linear rank-width of distance-hereditary graphs. I. A polynomial-time algorithm (Q527431) (← links)
- Sex-equal stable matchings: complexity and exact algorithms (Q528851) (← links)
- Ranking-based black-box complexity (Q528852) (← links)
- On Cartesian trees and range minimum queries (Q528853) (← links)
- Efficient computation of the characteristic polynomial of a tree and related tasks (Q528854) (← links)
- A distributed O(1)-approximation algorithm for the uniform facility location problem (Q528857) (← links)
- On the complexity of the regenerator cost problem in general networks with traffic grooming (Q528858) (← links)
- Scheduling partially ordered jobs faster than \(2^n\) (Q528859) (← links)
- On making a distinguished vertex of minimum degree by vertex deletion (Q528861) (← links)
- Fixed-parameter tractability of satisfying beyond the number of variables (Q528862) (← links)
- A 25/17-approximation algorithm for the stable marriage problem with one-sided ties (Q528863) (← links)
- Multicommodity flow in trees: packing via covering and iterated relaxation (Q528864) (← links)
- Common intervals of multiple permutations (Q534763) (← links)
- Constructing the simplest possible phylogenetic network from triplets (Q534764) (← links)
- Location-oblivious distributed unit disk graph coloring (Q534767) (← links)
