Abstract is missing.
- Bidding on Configurations in Internet Ad AuctionsS. Muthukrishnan. 1-6 [doi]
- An Attacker-Defender Game for HoneynetsJin-yi Cai, Vinod Yegneswaran, Chris Alfeld, Paul Barford. 7-16 [doi]
- On the Performances of Nash Equilibria in Isolation GamesVittorio Bilò, Michele Flammini, Gianpiero Monaco, Luca Moscardelli. 17-26 [doi]
- Limits to List Decoding Random CodesAtri Rudra. 27-36 [doi]
- Algorithm for Finding ::::k::::-Vertex Out-trees and Its Application to ::::k::::-Internal Out-branching ProblemNathann Cohen, Fedor V. Fomin, Gregory Gutin, Eun Jung Kim, Saket Saurabh, Anders Yeo. 37-46 [doi]
- A (4::::n:::: - 4)-Bit Representation of a Rectangular Drawing or FloorplanToshihiko Takahashi, Ryo Fujimaki, Youhei Inoue. 47-55 [doi]
- Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal ProblemTomoko Izumi, Taisuke Izumi, Hirotaka Ono, Koichi Wada. 56-65 [doi]
- Coordinate Assignment for Cyclic Level GraphsChristian Bachmaier, Franz-Josef Brandenburg, Wolfgang Brunner, Raymund Fülöp. 66-75 [doi]
- Crossing-Optimal Acyclic HP-Completion for Outerplanar ::::st::::-DigraphsTamara Mchedlidze, Antonios Symvonis. 76-85 [doi]
- Edge-Intersection Graphs of ::::k::::-Bend Paths in GridsTherese C. Biedl, Michal Stern. 86-95 [doi]
- Efficient Data Structures for the Orthogonal Range Successor ProblemChih-Chiang Yu, Wing-Kai Hon, Biing-Feng Wang. 96-105 [doi]
- Reconstruction of Interval GraphsMasashi Kiyomi, Toshiki Saitoh, Ryuhei Uehara. 106-115 [doi]
- A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced ConditionsAkiyoshi Shioura, Mutsunori Yagiura. 116-126 [doi]
- Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key ModelGiovanni Di Crescenzo. 127-137 [doi]
- Efficient Non-interactive Range ProofTsz Hon Yuen, Qiong Huang, Yi Mu, Willy Susilo, Duncan S. Wong, Guomin Yang. 138-147 [doi]
- Approximation Algorithms for Key Management in Secure MulticastAgnes Hui Chan, Rajmohan Rajaraman, Zhifeng Sun, Feng Zhu. 148-157 [doi]
- On Smoothed Analysis of Quicksort and Hoare s FindMahmoud Fouz, Manfred Kufleitner, Bodo Manthey, Nima Zeini Jahromi. 158-167 [doi]
- On an Online Traveling Repairman Problem with Flowtimes: Worst-Case and Average-Case AnalysisAxel Simroth, Alexander Souza. 168-177 [doi]
- Three New Algorithms for Regular Language EnumerationMargareta Ackerman, Erkki Mäkinen. 178-191 [doi]
- Convex Partitions with 2-Edge Connected Dual GraphsMarwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaque, Diane L. Souvaine, Csaba D. Tóth. 192-204 [doi]
- The Closest Pair Problem under the Hamming MetricKerui Min, Ming-Yang Kao, Hong Zhu. 205-214 [doi]
- Space Efficient Multi-dimensional Range ReportingMarek Karpinski, Yakov Nekrich. 215-224 [doi]
- Approximation Algorithms for a Network Design ProblemBinay K. Bhattacharya, Yuzhuang Hu, Qiaosheng Shi. 225-237 [doi]
- An FPTAS for the Minimum Total Weighted Tardiness Problem with a Fixed Number of Distinct Due DatesGeorge Karakostas, Stavros G. Kolliopoulos, Jing Wang. 238-248 [doi]
- On the Hardness and Approximability of Planar Biconnectivity AugmentationCarsten Gutwenger, Petra Mutzel, Bernd Zey. 249-257 [doi]
- Determination of Glycan Structure from Tandem Mass SpectraSebastian Böcker, Birte Kehr, Florian Rasche. 258-267 [doi]
- On the Generalised Character Compatibility Problem for Non-branching Character TreesJán Manuch, Murray Patterson, Arvind Gupta. 268-276 [doi]
- Inferring Peptide Composition from Molecular FormulasSebastian Böcker, Anton Pervukhin. 277-286 [doi]
- Optimal Transitions for Targeted Protein Quantification: Best Conditioned Submatrix SelectionRastislav Srámek, Bernd Fischer, Elias Vicari, Peter Widmayer. 287-296 [doi]
- Computing Bond Types in Molecule GraphsSebastian Böcker, Quang Bao Anh Bui, Patrick Seeber, Anke Truß. 297-306 [doi]
- On the Diaconis-Gangolli Markov Chain for Sampling Contingency Tables with Cell-Bounded EntriesIvona Bezáková, Nayantara Bhatnagar, Dana Randall. 307-316 [doi]
- Finding a Level Ideal of a PosetShuji Kijima, Toshio Nemoto. 317-327 [doi]
- A Polynomial-Time Perfect Sampler for the Q-Ising with a Vertex-Independent NoiseMasaki Yamamoto, Shuji Kijima, Yasuko Matsui. 328-337 [doi]
- Extracting Computational Entropy and Learning Noisy Linear FunctionsChia-Jung Lee, Chi-Jen Lu, Shi-Chun Tsai. 338-347 [doi]
- HITS Can Converge Slowly, but Not Too Slowly, in Score and RankEnoch Peserico, Luca Pretto. 348-357 [doi]
- Online Tree Node Assignment with Resource AugmentationJoseph Wun-Tat Chan, Francis Y. L. Chin, Hing-Fung Ting, Yong Zhang. 358-367 [doi]
- Why Locally-Fair Maximal Flows in Client-Server Networks Perform WellKenneth A. Berman, Chad Yoshikawa. 368-377 [doi]
- On Finding Small 2-Generating SetsIsabelle Fagnot, Guillaume Fertin, Stéphane Vialette. 378-387 [doi]
- Convex Recoloring Revisited: Complexity and Exact AlgorithmsIyad A. Kanj, Dieter Kratsch. 388-397 [doi]
- Strongly Chordal and Chordal Bipartite Graphs Are Sandwich MonotonePinar Heggernes, Federico Mancini, Charis Papadopoulos, R. Sritharan. 398-407 [doi]
- Hierarchies and Characterizations of Stateless Multicounter MachinesOscar H. Ibarra, Ömer Egecioglu. 408-417 [doi]
- Efficient Universal Quantum CircuitsDebajyoti Bera, Stephen A. Fenner, Frederic Green, Steven Homer. 418-428 [doi]
- An Improved Time-Space Lower Bound for TautologiesScott Diehl, Dieter van Melkebeek, Ryan Williams. 429-438 [doi]
- Multiple Round Random Ball Placement: Power of Second ChanceXiang-Yang Li, Yajun Wang, Wangsen Feng. 439-448 [doi]
- The Weighted Coupon Collector s Problem and ApplicationsPetra Berenbrink, Thomas Sauerwald. 449-458 [doi]
- Sublinear-Time Algorithms for Tournament GraphsStefan S. Dantchev, Tom Friedetzky, Lars Nagel. 459-471 [doi]
- Classification of a Class of Counting Problems Using Holographic ReductionsMichael Kowalczyk. 472-485 [doi]
- Separating NE from Some Nonuniform Nondeterministic Complexity ClassesBin Fu, Angsheng Li, Liyu Zhang. 486-495 [doi]
- On the Readability of Monotone Boolean FormulaeKhaled M. Elbassioni, Kazuhisa Makino, Imran Rauf. 496-505 [doi]
- Popular Matchings: Structure and AlgorithmsEric McDermid, Robert W. Irving. 506-515 [doi]
- Graph-Based Data Clustering with OverlapsMichael R. Fellows, Jiong Guo, Christian Komusiewicz, Rolf Niedermeier, Johannes Uhlmann. 516-526 [doi]
- Directional Geometric Routing on Mobile Ad Hoc NetworksKazushige Sato, Takeshi Tokuyama. 527-537 [doi]