The following pages link to Algorithms – ESA 2012 (Q2912820):
Displayed 20 items.
- Approximation of Minimum Cost Homomorphisms (Q2912876) (← links)
- Property Testing in Sparse Directed Graphs: Strong Connectivity and Subgraph-Freeness (Q2912878) (← links)
- Improved Implementation of Point Location in General Two-Dimensional Subdivisions (Q2912879) (← links)
- Parameterized Complexity of Induced H-Matching on Claw-Free Graphs (Q2912880) (← links)
- Solving Simple Stochastic Games with Few Coin Toss Positions (Q2912881) (← links)
- Efficient Communication Protocols for Deciding Edit Distance (Q2912882) (← links)
- Approximation Algorithms for Wireless Link Scheduling with Flexible Data Rates (Q2912883) (← links)
- Extending Partial Representations of Function Graphs and Permutation Graphs (Q2912884) (← links)
- A Fast and Simple Subexponential Fixed Parameter Algorithm for One-Sided Crossing Minimization (Q2912885) (← links)
- Minimum Average Distance Triangulations (Q2912886) (← links)
- Colouring AT-Free Graphs (Q2912887) (← links)
- Succinct Posets (Q2912889) (← links)
- Polynomial-Time Approximation Schemes for Shortest Path with Alternatives (Q2912890) (← links)
- On Computing Straight Skeletons by Means of Kinetic Triangulations (Q2912891) (← links)
- A Self-adjusting Data Structure for Multidimensional Point Sets (Q2912893) (← links)
- TSP Tours in Cubic Graphs: Beyond 4/3 (Q2912895) (← links)
- FPT Algorithms for Domination in Biclique-Free Graphs (Q2912896) (← links)
- Maximum Flow Networks for Stability Analysis of LEGO®Structures (Q2912898) (← links)
- Average Case Analysis of Java 7’s Dual Pivot Quicksort (Q2912899) (← links)
- Steiner Forest Orientation Problems (Q5891382) (← links)