Abstract is missing.
- Clairvoyant Mechanisms for Online AuctionsPhilipp Brandes, Zengfeng Huang, Hsin-Hao Su, Roger Wattenhofer. 3-14 [doi]
- Truthfulness for the Sum of Weighted Completion TimesEric Angel, Evripidis Bampis, Fanny Pascual, Nicolas Thibault. 15-26 [doi]
- Network Topologies for Weakly Pareto Optimal Nonatomic Selfish RoutingXujin Chen, Zhuo Diao. 27-38 [doi]
- New Results for Network Pollution GamesEleftherios Anastasiadis, Xiaotie Deng, Piotr Krysta, Minming Li, Han Qiao, Jinshan Zhang. 39-51 [doi]
- Polynomial-Time Algorithm for Isomorphism of Graphs with Clique-Width at Most ThreeBireswar Das, Murali Krishna Enduri, I. Vinod Reddy. 55-66 [doi]
- Fixed Parameter Complexity of Distance Constrained Labeling and Uniform Channel Assignment Problems - (Extended Abstract)Jirí Fiala, Tomás Gavenciak, Dusan Knop, Martin Koutecký, Jan Kratochvíl. 67-78 [doi]
- A Parameterized Algorithm for Bounded-Degree Vertex DeletionMingyu Xiao. 79-91 [doi]
- The Monotone Circuit Value Problem with Bounded Genus Is in NCFaisal N. Abu-Khzam, Shouwei Li, Christine Markarian, Friedhelm Meyer auf der Heide, Pavel Podlipyan. 92-102 [doi]
- Locality-Sensitive Hashing Without False Negatives for l_pAndrzej Pacuk, Piotr Sankowski, Karol Wegrzycki, Piotr Wygocki. 105-118 [doi]
- Improved Space Efficient Algorithms for BFS, DFS and ApplicationsNiranka Banerjee, Sankardeep Chakraborty, Venkatesh Raman 0001. 119-130 [doi]
- Metric 1-Median Selection: Query Complexity vs. Approximation RatioChing-Lueh Chang. 131-142 [doi]
- Frequent-Itemset Mining Using Locality-Sensitive HashingDebajyoti Bera, Rameshwar Pratap. 143-155 [doi]
- On the Hardness of Switching to a Small Number of EdgesVít Jelínek, Eva Jelínková, Jan Kratochvíl. 159-170 [doi]
- On Hard Instances of Non-Commutative PermanentChristian Engels, B. V. Raghavendra Rao. 171-181 [doi]
- The Effect of Range and Bandwidth on the Round Complexity in the Congested Clique ModelFlorent Becker, Antonio Fernández Anta, Ivan Rapaport, Eric Rémila. 182-193 [doi]
- Minimum Cost Homomorphisms with Constrained CostsPavol Hell, Mayssam Mohammadi Nevisi. 194-206 [doi]
- An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting ProblemSharareh Alipour, Mohammad Ghodsi, Amir Jafari. 209-221 [doi]
- Approximation Algorithms for the Star k-Hub Center Problem in Metric GraphsLi-Hsuan Chen, Dun-Wei Cheng, Sun-Yuan Hsieh, Ling-Ju Hung, Chia-Wei Lee, Bang Ye Wu. 222-234 [doi]
- Balls and Funnels: Energy Efficient Group-to-Group AnycastsJennifer Iglesias, Rajmohan Rajaraman, R. Ravi 0001, Ravi Sundaram. 235-246 [doi]
- Assigning Proximity Facilities for GatheringsShin-Ichi Nakano. 247-253 [doi]
- Combiners for Chosen-Ciphertext SecurityCong Zhang, David Cash, Xiuhua Wang, Xiaoqi Yu, Sherman S. M. Chow. 257-268 [doi]
- Homomorphic Evaluation of Lattice-Based Symmetric Encryption SchemesPierre-Alain Fouque, Benjamin Hadjibeyli, Paul Kirchner. 269-280 [doi]
- Four-Round Zero-Knowledge Arguments of Knowledge with Strict Polynomial-Time Simulation from Differing-Input Obfuscation for CircuitsNing Ding, Yanli Ren, Dawu Gu. 281-292 [doi]
- Inferring Sequences Produced by a Linear Congruential Generator on Elliptic Curves Using Coppersmith's MethodsThierry Mefenza. 293-304 [doi]
- The Routing of Complex Contagion in Kleinberg's Small-World NetworksWei Chen, Qiang Li, Xiaoming Sun, Jialin Zhang. 307-318 [doi]
- The Maximum Disjoint Routing ProblemFarhad Shahmohammadi, Amir Sharif-Zadeh, Hamid Zarrabi-Zadeh. 319-329 [doi]
- Balanced Allocation on Graphs: A Random Walk ApproachAli Pourmiri. 330-341 [doi]
- On the Power of Simple Reductions for the Maximum Independent Set ProblemDarren Strash. 345-356 [doi]
- Deterministic Algorithms for Unique Sink Orientations of GridsLuis Barba, Malte Milatz, Jerri Nummenpalo, Antonis Thomas. 357-369 [doi]
- From Graph Orientation to the Unweighted Maximum CutWalid Ben-Ameur, Antoine Glorieux, José Neto. 370-384 [doi]
- Maximum Weight Independent Sets in ( S_1, 1, 3 , bull)-free GraphsT. Karthick, Frédéric Maffray. 385-392 [doi]
- Decomposing Cubic Graphs into Connected Subgraphs of Size ThreeLaurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu. 393-404 [doi]
- Automorphisms of the Cube n^dPavel Dvorák, Tomás Valla. 405-416 [doi]
- Hadwiger's Conjecture and Squares of Chordal GraphsL. Sunil Chandran, Davis Issac, Sanming Zhou. 417-428 [doi]
- Minimum Width Color Spanning AnnulusAnkush Acharyya, Subhas C. Nandy, Sasanka Roy. 431-442 [doi]
- Computing a Minimum-Width Square or Rectangular Annulus with Outliers - [Extended Abstract]Sang Won Bae. 443-454 [doi]
- Approximating the Maximum Rectilinear Crossing NumberSamuel Bald, Matthew P. Johnson, Ou Liu. 455-467 [doi]
- An Improved Approximation Algorithm for rSPR DistanceZhi-Zhong Chen, Eita Machida, Lusheng Wang. 468-479 [doi]
- Online Non-preemptive Scheduling to Optimize Max Stretch on a Single MachinePierre-François Dutot, Erik Saule, Abhinav Srivastav, Denis Trystram. 483-495 [doi]
- Complex-Demand Scheduling Problem with Application in Smart GridMajid Khonji, Areg Karapetyan, Khaled M. Elbassioni, Sid Chi-Kin Chau. 496-509 [doi]
- From Preemptive to Non-preemptive Scheduling Using RejectionsGiorgio Lucarelli, Abhinav Srivastav, Denis Trystram. 510-519 [doi]
- Flow Shop for Dual CPUs in Dynamic Voltage ScalingVincent Chau, Ken C. K. Fong, Minming Li, Kai Wang. 520-531 [doi]
- Algorithms for k-median Clustering over Distributed StreamsSutanu Gayen, N. V. Vinodchandran. 535-546 [doi]
- Polygon Simplification by Minimizing Convex CornersYeganeh Bahoo, Stephane Durocher, J. Mark Keil, Saeed Mehrabi 0001, Sahar Mehrpour, Debajyoti Mondal. 547-559 [doi]
- Combinatorial Scoring of Phylogenetic NetworksNikita Alexeev, Max A. Alekseyev. 560-572 [doi]
- Highly Bi-Connected Subgraphs for Computational Protein Function AnnotationJucheol Moon, Iddo Friedberg, Oliver Eulenstein. 573-584 [doi]
- Cost Register Automata for Nested WordsAndreas Krebs, Nutan Limaye, Michael Ludwig. 587-598 [doi]
- Extending MSVL with SemaphoreXinfeng Shu, Zhenhua Duan. 599-610 [doi]
- Satisfiability of Linear Time Mu-Calculus on Finite TracesYao Liu, Zhenhua Duan, Cong Tian, Bin Cui. 611-622 [doi]
- On the Complexity of Insertion Propagation with Functional Dependency ConstraintsDongjing Miao, Zhipeng Cai, Xianmin Liu, Jianzhong Li. 623-632 [doi]