| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling
|
Bonifaci, Vincenzo
|
|
2011
|
62 |
3-4 |
p. 1034-1049
|
article
|
| 2 |
Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs
|
Chepoi, Victor
|
|
2010
|
62 |
3-4 |
p. 713-732
|
article
|
| 3 |
A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners
|
Hong, Seok-Hee
|
|
2011
|
62 |
3-4 |
p. 1122-1158
|
article
|
| 4 |
An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants
|
Xiao, Jing
|
|
2011
|
62 |
3-4 |
p. 951-981
|
article
|
| 5 |
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs
|
Elmasry, Amr
|
|
2010
|
62 |
3-4 |
p. 754-766
|
article
|
| 6 |
Approximating Optimal Binary Decision Trees
|
Adler, Micah
|
|
2011
|
62 |
3-4 |
p. 1112-1121
|
article
|
| 7 |
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems
|
Frederickson, Greg N.
|
|
2011
|
62 |
3-4 |
p. 1198-1221
|
article
|
| 8 |
Approximation and Tidying—A Problem Kernel for s-Plex Cluster Vertex Deletion
|
Bevern, René van
|
|
2011
|
62 |
3-4 |
p. 930-950
|
article
|
| 9 |
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
|
Pirwani, Imran A.
|
|
2011
|
62 |
3-4 |
p. 1050-1072
|
article
|
| 10 |
Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window
|
Chan, Ho-Leung
|
|
2011
|
62 |
3-4 |
p. 1088-1111
|
article
|
| 11 |
Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks
|
Berenbrink, Petra
|
|
2010
|
62 |
3-4 |
p. 767-786
|
article
|
| 12 |
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems
|
Okumoto, Kazumasa
|
|
2010
|
62 |
3-4 |
p. 787-806
|
article
|
| 13 |
Efficient Observer-Dependent Simplification in Polygonal Domains
|
Zarei, Alireza
|
|
2011
|
62 |
3-4 |
p. 842-862
|
article
|
| 14 |
Euclidean Prize-Collecting Steiner Forest
|
Bateni, MohammadHossein
|
|
2011
|
62 |
3-4 |
p. 906-929
|
article
|
| 15 |
Exponential Lower Bounds on the Complexity of a Class of Dynamic Programs for Combinatorial Optimization Problems
|
Bompadre, Agustín
|
|
2010
|
62 |
3-4 |
p. 659-700
|
article
|
| 16 |
Fully Dynamic Geometric Spanners
|
Roditty, L.
|
|
2011
|
62 |
3-4 |
p. 1073-1087
|
article
|
| 17 |
Generalizing a Theorem of Wilber on Rotations in Binary Search Trees to Encompass Unordered Binary Trees
|
Fredman, Michael L.
|
|
2011
|
62 |
3-4 |
p. 863-878
|
article
|
| 18 |
Obtaining a Planar Graph by Vertex Deletion
|
Marx, Dániel
|
|
2011
|
62 |
3-4 |
p. 807-822
|
article
|
| 19 |
On Independent Sets and Bicliques in Graphs
|
Gaspers, Serge
|
|
2010
|
62 |
3-4 |
p. 637-658
|
article
|
| 20 |
On Smoothed Analysis of Quicksort and Hoare’s Find
|
Fouz, Mahmoud
|
|
2011
|
62 |
3-4 |
p. 879-905
|
article
|
| 21 |
On the Complexity of Optimal Hotlink Assignment
|
Jacobs, Tobias
|
|
2011
|
62 |
3-4 |
p. 982-1005
|
article
|
| 22 |
Partitioning a Weighted Tree into Subtrees with Weights in a Given Range
|
Ito, Takehiro
|
|
2011
|
62 |
3-4 |
p. 823-841
|
article
|
| 23 |
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles
|
Flocchini, Paola
|
|
2011
|
62 |
3-4 |
p. 1006-1033
|
article
|
| 24 |
Property Testing on k-Vertex-Connectivity of Graphs
|
Yoshida, Yuichi
|
|
2010
|
62 |
3-4 |
p. 701-712
|
article
|
| 25 |
Schnyder Decompositions for Regular Plane Graphs and Application to Drawing
|
Bernardi, Olivier
|
|
2011
|
62 |
3-4 |
p. 1159-1197
|
article
|
| 26 |
Stackelberg Network Pricing Games
|
Briest, Patrick
|
|
2010
|
62 |
3-4 |
p. 733-753
|
article
|
Journal description