On Independent Sets and Bicliques in Graphs Serge GaspersDieter KratschMathieu Liedloff OriginalPaper 11 November 2010 Pages: 637 - 658
Exponential Lower Bounds on the Complexity of a Class of Dynamic Programs for Combinatorial Optimization Problems Agustín Bompadre OriginalPaper 01 December 2010 Pages: 659 - 700
Property Testing on k-Vertex-Connectivity of Graphs Yuichi YoshidaHiro Ito OriginalPaper 01 December 2010 Pages: 701 - 712
Additive Spanners and Distance and Routing Labeling Schemes for Hyperbolic Graphs Victor ChepoiFeodor F. DraganYang Xiang OriginalPaper 24 December 2010 Pages: 713 - 732
Stackelberg Network Pricing Games Patrick BriestMartin HoeferPiotr Krysta OriginalPaper 04 December 2010 Pages: 733 - 753
An O(n+m) Certifying Triconnnectivity Algorithm for Hamiltonian Graphs Amr ElmasryKurt MehlhornJens M. Schmidt OriginalPaper 08 December 2010 Pages: 754 - 766
Convergence to Equilibria in Distributed, Selfish Reallocation Processes with Weighted Tasks Petra BerenbrinkTom FriedetzkyZengjian Hu OriginalPaper 22 December 2010 Pages: 767 - 786
Divide-and-Conquer Algorithms for Partitioning Hypergraphs and Submodular Systems Kazumasa OkumotoTakuro FukunagaHiroshi Nagamochi OriginalPaper 21 December 2010 Pages: 787 - 806
Obtaining a Planar Graph by Vertex Deletion Dániel MarxIldikó Schlotter OriginalPaper 08 January 2011 Pages: 807 - 822
Partitioning a Weighted Tree into Subtrees with Weights in a Given Range Takehiro ItoTakao NishizekiXiao Zhou OriginalPaper 13 January 2011 Pages: 823 - 841
Efficient Observer-Dependent Simplification in Polygonal Domains Alireza ZareiMohammad Ghodsi OriginalPaper 14 January 2011 Pages: 842 - 862
Generalizing a Theorem of Wilber on Rotations in Binary Search Trees to Encompass Unordered Binary Trees Michael L. Fredman OriginalPaper 26 January 2011 Pages: 863 - 878
On Smoothed Analysis of Quicksort and Hoare’s Find Mahmoud FouzManfred KufleitnerNima Zeini Jahromi OriginalPaper Open access 26 January 2011 Pages: 879 - 905
Euclidean Prize-Collecting Steiner Forest MohammadHossein BateniMohammadTaghi Hajiaghayi OriginalPaper 22 January 2011 Pages: 906 - 929
Approximation and Tidying—A Problem Kernel for s-Plex Cluster Vertex Deletion René van BevernHannes MoserRolf Niedermeier OriginalPaper 01 February 2011 Pages: 930 - 950
An Efficient Algorithm for Haplotype Inference on Pedigrees with a Small Number of Recombinants Jing XiaoTiancheng LouTao Jiang OriginalPaper Open access 09 February 2011 Pages: 951 - 981
On the Complexity of Optimal Hotlink Assignment Tobias Jacobs OriginalPaper 09 February 2011 Pages: 982 - 1005
Ping Pong in Dangerous Graphs: Optimal Black Hole Search with Pebbles Paola FlocchiniDavid IlcinkasNicola Santoro OriginalPaper 11 February 2011 Pages: 1006 - 1033
A Constant-Approximate Feasibility Test for Multiprocessor Real-Time Scheduling Vincenzo BonifaciAlberto Marchetti-SpaccamelaSebastian Stiller OriginalPaper 05 February 2011 Pages: 1034 - 1049
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs Imran A. PirwaniMohammad R. Salavatipour OriginalPaper 17 March 2011 Pages: 1050 - 1072
Continuous Monitoring of Distributed Data Streams over a Time-Based Sliding Window Ho-Leung ChanTak-Wah LamHing-Fung Ting OriginalPaper 22 March 2011 Pages: 1088 - 1111
Approximating Optimal Binary Decision Trees Micah AdlerBrent Heeringa OriginalPaper 05 April 2011 Pages: 1112 - 1121
A Linear-Time Algorithm for Star-Shaped Drawings of Planar Graphs with the Minimum Number of Concave Corners Seok-Hee HongHiroshi Nagamochi OriginalPaper 29 April 2011 Pages: 1122 - 1158
Schnyder Decompositions for Regular Plane Graphs and Application to Drawing Olivier BernardiÉric Fusy OriginalPaper 21 April 2011 Pages: 1159 - 1197
Approximation Algorithms for the Traveling Repairman and Speeding Deliveryman Problems Greg N. FredericksonBarry Wittman OriginalPaper 22 April 2011 Pages: 1198 - 1221
