Abstract is missing.
- Understanding and Inductive InferenceManuel Blum. 1 [doi]
- Computing with Cells: Membrane SystemsOscar H. Ibarra. 2 [doi]
- Boxicity and Poset DimensionAbhijin Adiga, Diptendu Bhowmick, L. Sunil Chandran. 3-12 [doi]
- On the Hardness against Constant-Depth Linear-Size CircuitsChi-Jen Lu, Hsin-Lung Wu. 13-22 [doi]
- A K-Provers Parallel Repetition Theorem for a Version of No-Signaling ModelRicky Rosen. 23-33 [doi]
- The Curse of Connectivity: ::::t::::-Total Vertex (Edge) CoverHenning Fernau, Fedor V. Fomin, Geevarghese Philip, Saket Saurabh. 34-43 [doi]
- Counting Paths in VPA Is Complete for #NC:::1:::Andreas Krebs, Nutan Limaye, Meena Mahajan. 44-53 [doi]
- Depth-Independent Lower Bounds on the Communication Complexity of Read-Once Boolean FormulasRahul Jain, Hartmut Klauck, Shengyu Zhang. 54-59 [doi]
- Multiplying Pessimistic Estimators: Deterministic Approximation of Max TSP and Maximum Triangle PackingAnke van Zuylen. 60-69 [doi]
- Clustering with or without the ApproximationFrans Schalekamp, Michael Yu, Anke van Zuylen. 70-79 [doi]
- A Self-stabilizing 3-Approximation for the Maximum Leaf Spanning Tree Problem in Arbitrary NetworksSayaka Kamei, Hirotsugu Kakugawa, Stéphane Devismes, Sébastien Tixeuil. 80-89 [doi]
- Approximate Weighted Farthest Neighbors and Minimum Dilation StarsJohn Augustine, David Eppstein, Kevin A. Wortman. 90-99 [doi]
- Approximated Distributed Minimum Vertex Cover Algorithms for Bounded Degree GraphsYong Zhang, Francis Y. L. Chin, Hing-Fung Ting. 100-109 [doi]
- Maximum Upward Planar Subgraph of a Single-Source Embedded DigraphAimal Rextin, Patrick Healy. 110-119 [doi]
- Triangle-Free 2-Matchings RevisitedMaxim A. Babenko, Alexey Gusakov, Ilya P. Razenshteyn. 120-129 [doi]
- The Cover Time of Deterministic Random WalksTobias Friedrich, Thomas Sauerwald. 130-139 [doi]
- Finding Maximum Edge Bicliques in Convex Bipartite GraphsDoron Nussbaum, Shuye Pu, Jörg-Rüdiger Sack, Takeaki Uno, Hamid Zarrabi-Zadeh. 140-149 [doi]
- A Note on Vertex Cover in Graphs with Maximum Degree 3Mingyu Xiao. 150-159 [doi]
- Computing Graph Spanners in Small Memory: Fault-Tolerance and StreamingGiorgio Ausiello, Paolo Giulio Franciosa, Giuseppe F. Italiano, Andrea Ribichini. 160-172 [doi]
- Factorization of Cartesian Products of HypergraphsAlain Bretto, Yannick Silvestre. 173-181 [doi]
- Minimum-Segment Convex Drawings of 3-Connected Cubic Plane GraphsSudip Biswas, Debajyoti Mondal, Rahnuma Islam Nishat, Md. Saidur Rahman. 182-191 [doi]
- On Three Parameters of Invisibility GraphsJosef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr. 192-198 [doi]
- Imbalance Is Fixed Parameter TractableDaniel Lokshtanov, Neeldhara Misra, Saket Saurabh. 199-208 [doi]
- The Ramsey Number for a Linear Forest versus Two Identical Copies of Complete GraphsI. W. Sudarsana, Adiwijaya, S. Musdalifah. 209-215 [doi]
- Optimal Binary Space Partitions in the PlaneMark de Berg, AmirAli Khosravi. 216-225 [doi]
- Exact and Approximation Algorithms for Geometric and Capacitated Set Cover ProblemsPiotr Berman, Marek Karpinski, Andrzej Lingas. 226-234 [doi]
- Effect of Corner Information in Simultaneous Placement of ::::K:::: Rectangles and TableauxShinya Anzai, Jinhee Chun, Ryosei Kasai, Matias Korman, Takeshi Tokuyama. 235-243 [doi]
- Detecting Areas Visited RegularlyBojan Djordjevic, Joachim Gudmundsson. 244-253 [doi]
- Tile-Packing Tomography Is /mathbb::::NP::::{/mathbb{NP}}-hardMarek Chrobak, Christoph Dürr, Flavio Guiñez, Antoni Lozano, Nguyen Kim Thang. 254-263 [doi]
- The Rectilinear ::::k::::-Bends TSPVladimir Estivill-Castro, Apichat Heednacram, Francis Suraweera. 264-277 [doi]
- Tracking a Generator by PersistenceOleksiy Busaryev, Tamal K. Dey, Yusu Wang. 278-287 [doi]
- Auspicious Tatami Mat ArrangementsAlejandro Erickson, Frank Ruskey, Mark Schurch, Jennifer Woodcock. 288-297 [doi]
- Faster Generation of Shorthand Universal Cycles for PermutationsAlexander E. Holroyd, Frank Ruskey, Aaron Williams. 298-307 [doi]
- The Complexity of Word CircuitsXue Chen, Guangda Hu, Xiaoming Sun. 308-317 [doi]
- On the Density of Regular and Context-Free LanguagesMichael Hartwig. 318-327 [doi]
- Extensions of the Minimum Cost Homomorphism ProblemRustem Takhanov. 328-337 [doi]
- The Longest Almost-Increasing SubsequenceAmr Elmasry. 338-347 [doi]
- Universal Test Sets for Reversible CircuitsSatoshi Tayu, Shota Fukuyama, Shuichi Ueno. 348-357 [doi]
- Approximate Counting with a Floating-Point CounterMiklós Csürös. 358-367 [doi]
- Broadcasting in Heterogeneous Tree NetworksYu-Hsuan Su, Ching-Chi Lin, D. T. Lee. 368-377 [doi]
- Contention Resolution in Multiple-Access Channels: ::::k::::-Selection in Radio NetworksAntonio Fernández Anta, Miguel A. Mosteiro. 378-388 [doi]
- Online Preemptive Scheduling with Immediate Decision or Notification and PenaltiesStanley P. Y. Fung. 389-398 [doi]
- Discovering Pairwise Compatibility GraphsMuhammad Nur Yanhaona, Md. Shamsuzzoha Bayzid, Md. Saidur Rahman. 399-408 [doi]
- Near Optimal Solutions for Maximum Quasi-bicliquesLusheng Wang. 409-418 [doi]
- Fast Coupled Path Planning: From Pseudo-Polynomial to PolynomialYunlong Liu, Xiaodong Wu. 419-428 [doi]
- Constant Time Approximation Scheme for Largest Well Predicted SubsetBin Fu, Lusheng Wang. 429-438 [doi]
- On Sorting Permutations by Double-Cut-and-JoinsXin Chen. 439-448 [doi]
- A Three-String Approach to the Closest String ProblemZhi-Zhong Chen, Bin Ma, Lusheng Wang. 449-458 [doi]
- A 2::::k:::: Kernel for the Cluster Editing ProblemJianer Chen, Jie Meng. 459-468 [doi]
- On the Computation of 3D Visibility SkeletonsSylvain Lazard, Christophe Weibel, Sue Whitesides, Linqiao Zhang. 469-478 [doi]
- The Violation Heap: A Relaxed Fibonacci-Like HeapAmr Elmasry. 479-488 [doi]
- Threshold Rules for Online Sample SelectionEric Bach, Shuchi Chawla, Seeun Umboh. 489-499 [doi]
- Heterogeneous Subset SamplingMeng-Tsung Tsai, Da-Wei Wang, Churn-Jung Liau, Tsan-sheng Hsu. 500-509 [doi]
- Identity-Based Authenticated Asymmetric Group Key Agreement ProtocolLei Zhang 0009, Qianhong Wu, Bo Qin, Josep Domingo-Ferrer. 510-519 [doi]
- Zero-Knowledge Argument for Simultaneous Discrete LogarithmsSherman S. M. Chow, Changshe Ma, Jian Weng. 520-529 [doi]
- Directed Figure Codes: Decidability FrontierMichal Kolarz. 530-539 [doi]