Conferences in DBLP
Joel Spencer LIAR! [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:1-2 [Conf ] Jon Louis Bentley Experiments for Algorithm Engineering. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:3-4 [Conf ] Ren Hua Chung , Dan Gusfield Empirical Exploration of Perfect Phylogeny Haplotyping and Haplotypers. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:5-19 [Conf ] Sergei Bespamyatnikh Cylindrical Hierarchy for Deforming Necklaces. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:20-29 [Conf ] Danny Z. Chen , Bin Xu Geometric Algorithms for Agglomerative Hierarchical Clustering. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:30-39 [Conf ] Jinhui Xu , Yang Yang , Zhiyong Lin Traveling Salesman Problem of Segments. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:40-49 [Conf ] Andrzej Lingas , Martin Wahlen Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:50-56 [Conf ] Yong Gao , Junfeng Wu , Robert Niewiadomski , Yang Wang , Zhi-Zhong Chen , Guohui Lin A Space Efficient Algorithm for Sequence Alignment with Inversions. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:57-67 [Conf ] Anne Bergeron , Jens Stoye On the Similarity of Sets of Permutations and Its Applications to Genome Comparison. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:68-79 [Conf ] Wei Fu , Wing-Kai Hon , Wing-Kin Sung On All-Substrings Alignment Problems. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:80-89 [Conf ] Eldar Fischer , Johann A. Makowsky The Specker-Blatter Theorem Revisited. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:90-101 [Conf ] Xizhong Zheng On the Divergence Bounded Computable Real Numbers. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:102-111 [Conf ] Hanno Lefmann Sparse Parity-Check Matrices over Finite Fields (Extended Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:112-121 [Conf ] Yen Hung Chen , Chin Lung Lu , Chuan Yi Tang On the Full and Bottleneck Full Steiner Tree Problems. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:122-129 [Conf ] Tetsuo Asano , Naoki Katoh , Hisao Tamaki , Takeshi Tokuyama The Structure and Number of Global Roundings of a Graph. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:130-138 [Conf ] Huaming Zhang , Xin He On Even Triangulations of 2-Connected Embedded Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:139-148 [Conf ] Hsu-Chun Yen , Lien-Po Yu Petri Nets with Simple Circuits. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:149-158 [Conf ] Pierluigi San Pietro , Zhe Dang Automatic Verification of Multi-queue Discrete Timed Automata. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:159-171 [Conf ] Xiao Zhou , Yuki Matsuo , Takao Nishizeki List Total Colorings of Series-Parallel Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:172-181 [Conf ] Therese C. Biedl , Brona Brejová , Erik D. Demaine , Angèle M. Hamel , Alejandro López-Ortiz , Tomás Vinar Finding Hidden Independent Sets in Interval Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:182-191 [Conf ] Kenji Kashiwabara , Yoshio Okamoto , Takeaki Uno Matroid Representation of Clique Complexes. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:192-201 [Conf ] Jin-yi Cai , Osamu Watanabe On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative Results. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:202-211 [Conf ] Martin Kutz The Complexity of Boolean Matrix Root Computation. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:212-221 [Conf ] Hiroaki Yamamoto , Takashi Miyazaki A Fast Bit-Parallel Algorithm for Matching Extended Regular Expressions. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:222-231 [Conf ] Masataka Takamura , Yoshihide Igarashi Group Mutual Exclusion Algorithms Based on Ticket Orders. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:232-241 [Conf ] Andrzej Czygrinow , Michal Hanckowiak Distributed Algorithm for Better Approximation of the Maximum Matching. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:242-251 [Conf ] Eric J. Schwabe , Ian M. Sutherland Efficient Mappings for Parity-Declustered Data Layouts. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:252-261 [Conf ] Xiaotie Deng , Qizhi Fang , Shanfeng Zhu Approximate Rank Aggregation (Preliminary Version). [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:262-271 [Conf ] Hyun Chul Lee , Allan Borodin Perturbation of the Hyper-Linked Environment. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:272-283 [Conf ] Zhixiang Chen , Richard H. Fowler , Ada Wai-Chee Fu , Chunyue Wang Fast Construction of Generalized Suffix Trees Over a Very Large Alphabet. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:284-293 [Conf ] Eike Kiltz , Hans-Ulrich Simon Complexity Theoretic Aspects of Some Cryptographic Functions. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:294-303 [Conf ] Kazuo Iwama , Akinori Kawachi , Shigeru Yamashita Quantum Sampling for Balanced Allocations. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:304-318 [Conf ] Jung-Heum Park , Hee-Chul Kim Fault-Hamiltonicity of Product Graph of Path and Cycle. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:319-328 [Conf ] Yosuke Kikuchi , Hiroyuki Tanaka , Shin-Ichi Nakano , Yukio Shibata How to Obtain the Complete List of Caterpillars (Extended Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:329-338 [Conf ] Magnús M. Halldórsson , Kazuo Iwama , Shuichi Miyazaki , Hiroki Yanagisawa Randomized Approximation of the Stable Marriage Problem. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:339-350 [Conf ] Erik D. Demaine , Susan Hohenberger , David Liben-Nowell Tetris is Hard, Even to Approximate. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:351-363 [Conf ] Xiang-Yang Li Approximate MST for UDG Locally. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:364-373 [Conf ] Xiang-Yang Li , Yu Wang Efficient Construction of Low Weight Bounded Degree Planar Spanner. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:374-384 [Conf ] L. Sunil Chandran , Telikepalli Kavitha , C. R. Subramanian Isoperimetric Inequalities and the Width Parameters of Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:385-393 [Conf ] Faisal N. Abu-Khzam , Michael A. Langston Graph Coloring and the Immersion Order. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:394-403 [Conf ] Carlo Gaibisso , Guido Proietti , Richard B. Tan Optimal MST Maintenance for Transient Deletion of Every Node in Planar Graphs. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:404-414 [Conf ] Jae-Hoon Kim , Kyung-Yong Chwa Scheduling Broadcasts with Deadlines. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:415-424 [Conf ] Francis Y. L. Chin , Stanley P. Y. Fung Improved Competitive Algorithms for Online Scheduling with Partial Job Values. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:425-434 [Conf ] Lihua Chen , Xiaotie Deng , Qizhi Fang , Feng Tian Majority Equilibrium for Public Facility Allocation (Preliminary Version). [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:435-444 [Conf ] Günter Rote , Cao An Wang , Lusheng Wang , Yin-Feng Xu On Constrained Minimum Pseudotriangulations. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:445-454 [Conf ] Xiaodong Wu , Danny Z. Chen , James J. Mason , Steven R. Schmid Pairwise Data Clustering and Applications. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:455-466 [Conf ] Michael J. Collins Covering a Set of Points with a Minimum Number of Turns. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:467-474 [Conf ] Ashim Garg , Adrian Rusu Area-Efficient Order-Preserving Planar Straight-Line Drawings of Ordered Trees. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:475-486 [Conf ] Farhad Shahrokhi , Ondrej Sýkora , László A. Székely , Imrich Vrto Bounds for Convex Crossing Numbers. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:487-495 [Conf ] Yehuda Koren On Spectral Graph Drawing. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:496-508 [Conf ] Yih-En Andrew Ban , Sergei Bespamyatnikh , Nabil H. Mustafa On a Conjecture on Wiener Indices in Combinatorial Chemistry. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:509-518 [Conf ] Mark Cieliebak , Stephan Eidenbenz , Gerhard J. Woeginger Double Digest Revisited: Complexity and Approximability in the Presence of Noisy Data. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:519-527 [Conf ] Ronald I. Greenberg Fast and Space-Efficient Location of Heavy or Dense Segments in Run-Length Encoded Sequences: (Extended Abstract). [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:528-536 [Conf ] Mark Marron , Krister M. Swenson , Bernard M. E. Moret Genomic Distances under Deletions and Insertions. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:537-547 [Conf ] Stefan Szeider Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter Tractable. [Citation Graph (0, 0)][DBLP ] COCOON, 2003, pp:548-558 [Conf ]