Matroid Representation of Clique Complexes (English)
- New search for: Kashiwabara, Kenji
- New search for: Okamoto, Yoshio
- New search for: Uno, Takeaki
- New search for: Warnow, Tandy
- New search for: Zhu, Binhai
- New search for: Kashiwabara, Kenji
- New search for: Okamoto, Yoshio
- New search for: Uno, Takeaki
In:
Computing and Combinatorics
: 9th Annual International Conference, COCOON 2003 Big Sky, MT, USA, July 25–28, 2003 Proceedings
;
Chapter: 21
;
192-201
;
2003
-
ISSN:
- Article/Chapter (Book) / Electronic Resource
-
Title:Matroid Representation of Clique Complexes
-
Contributors:Warnow, Tandy ( editor ) / Zhu, Binhai ( editor ) / Kashiwabara, Kenji ( author ) / Okamoto, Yoshio ( author ) / Uno, Takeaki ( author )
-
Conference:International Computing and Combinatorics Conference ; 2003 ; Big Sky, MT, USA
-
Published in:Computing and Combinatorics : 9th Annual International Conference, COCOON 2003 Big Sky, MT, USA, July 25–28, 2003 Proceedings ; Chapter: 21 ; 192-201Lecture Notes in Computer Science ; 2697 ; 192-201
-
Publisher:
- New search for: Springer Berlin Heidelberg
-
Place of publication:Berlin, Heidelberg
-
Publication date:2003-06-24
-
Size:10 pages
-
ISBN:
-
ISSN:
-
DOI:
-
Type of media:Article/Chapter (Book)
-
Type of material:Electronic Resource
-
Language:English
-
Keywords:
-
Source:
Table of contents eBook
The tables of contents are generated automatically and are based on the data records of the individual contributions available in the index of the TIB portal. The display of the Tables of Contents may therefore be incomplete.
- 1
-
LIAR!Spencer, Joel et al. | 2003
- 2
-
Experiments for Algorithm EngineeringBentley, Jon et al. | 2003
- 3
-
Empirical Exploration of Perfect Phylogeny Haplotyping and HaplotypersChung, Ren Hua / Gusfield, Dan et al. | 2003
- 4
-
Cylindrical Hierarchy for Deforming NecklacesBespamyatnikh, Sergei et al. | 2003
- 5
-
Geometric Algorithms for Agglomerative Hierarchical ClusteringChen, Danny Z. / Xu, Bin et al. | 2003
- 6
-
Traveling Salesman Problem of SegmentsXu, Jinhui / Yang, Yang / Lin, Zhiyong et al. | 2003
- 7
-
Subexponential-Time Algorithms for Maximum Independent Set and Related Problems on Box GraphsLingas, Andrzej / Wahlen, Martin et al. | 2003
- 8
-
A Space Efficient Algorithm for Sequence Alignment with InversionsGao, Yong / Wu, Junfeng / Niewiadomski, Robert / Wang, Yang / Chen, Zhi-Zhong / Lin, Guohui et al. | 2003
- 9
-
On the Similarity of Sets of Permutations and Its Applications to Genome ComparisonBergeron, Anne / Stoye, Jens et al. | 2003
- 10
-
On All-Substrings Alignment ProblemsFu, Wei / Hon, Wing-Kai / Sung, Wing-Kin et al. | 2003
- 11
-
The Specker-Blatter Theorem RevisitedFischer, E. / Makowsky, J. A. et al. | 2003
- 12
-
On the Divergence Bounded Computable Real NumbersZheng, Xizhong et al. | 2003
- 13
-
Sparse Parity-Check Matrices over Finite FieldsLefmann, Hanno et al. | 2003
- 122
-
On the Full and Bottleneck Full Steiner Tree ProblemsChen, Yen Hung / Lu, Chin Lung / Tang, Chuan Yi et al. | 2003
- 15
-
The Structure and Number of Global Roundings of a GraphAsano, Tetsuo / Katoh, Naoki / Tamaki, Hisao / Tokuyama, Takeshi et al. | 2003
- 16
-
On Even Triangulations of 2-Connected Embedded GraphsZhang, Huaming / He, Xin et al. | 2003
- 17
-
Petri Nets with Simple CircuitsYen, Hsu-Chun / Yu, Lien-Po et al. | 2003
- 18
-
Automatic Verification of Multi-queue Discrete Timed AutomataSan Pietro, Pierluigi / Dang, Zhe et al. | 2003
- 19
-
List Total Colorings of Series-Parallel GraphsZhou, Xiao / Matsuo, Yuki / Nishizeki, Takao et al. | 2003
- 20
-
Finding Hidden Independent Sets in Interval GraphsBiedl, Therese / Brejová, Broňa / Demaine, Erik D. / Hamel, Angèle M. / López-Ortiz, Alejandro / Vinař, Tomáš et al. | 2003
- 21
-
Matroid Representation of Clique ComplexesKashiwabara, Kenji / Okamoto, Yoshio / Uno, Takeaki et al. | 2003
- 22
-
On Proving Circuit Lower Bounds against the Polynomial-Time Hierarchy: Positive and Negative ResultsCai, Jin-Yi / Watanabe, Osamu et al. | 2003
- 23
-
The Complexity of Boolean Matrix Root ComputationKutz, Martin et al. | 2003
- 24
-
A Fast Bit-Parallel Algorithm for Matching Extended Regular ExpressionsYamamoto, Hiroaki / Miyazaki, Takashi et al. | 2003
- 25
-
Group Mutual Exclusion Algorithms Based on Ticket OrdersTakamura, Masataka / Igarashi, Yoshihide et al. | 2003
- 26
-
Distributed Algorithm for Better Approximation of the Maximum MatchingCzygrinow, A. / Hańćkowiak, M. et al. | 2003
- 27
-
Efficient Mappings for Parity-Declustered Data LayoutsSchwabe, Eric J. / Sutherland, Ian M. et al. | 2003
- 28
-
Approximate Rank AggregationDeng, Xiaotie / Fang, Qizhi / Zhu, Shanfeng et al. | 2003
- 29
-
Perturbation of the Hyper-Linked EnvironmentLee, Hyun Chul / Borodin, Allan et al. | 2003
- 30
-
Fast Construction of Generalized Suffix Trees over a Very Large AlphabetChen, Zhixiang / Fowler, Richard / Fu, Ada Wai-Chee / Wang, Chunyue et al. | 2003
- 31
-
Complexity Theoretic Aspects of Some Cryptographic FunctionsKiltz, Eike / Simon, Hans Ulrich et al. | 2003
- 32
-
Quantum Sampling for Balanced AllocationsIwama, Kazuo / Kawachi, Akinori / Yamashita, Shigeru et al. | 2003
- 33
-
Fault-Hamiltonicity of Product Graph of Path and CyclePark, Jung-Heum / Kim, Hee-Chul et al. | 2003
- 34
-
How to Obtain the Complete List of CaterpillarsKikuchi, Yosuke / Tanaka, Hiroyuki / Nakano, Shin-ichi / Shibata, Yukio et al. | 2003
- 35
-
Randomized Approximation of the Stable Marriage ProblemHalldórsson, Magnús / Iwama, Kazuo / Miyazaki, Shuichi / Yanagisawa, Hiroki et al. | 2003
- 36
-
Tetris is Hard, Even to ApproximateDemaine, Erik D. / Hohenberger, Susan / Liben-Nowell, David et al. | 2003
- 37
-
Approximate MST for UDG LocallyLi, Xiang-Yang et al. | 2003
- 38
-
Efficient Construction of Low Weight Bounded Degree Planar SpannerLi, Xiang-Yang / Wang, Yu et al. | 2003
- 39
-
Isoperimetric Inequalities and the Width Parameters of GraphsSunil Chandran, L. / Kavitha, T. / Subramanian, C. R. et al. | 2003
- 40
-
Graph Coloring and the Immersion OrderAbu-Khzam, Faisal N. / Langston, Michael A. et al. | 2003
- 41
-
Optimal MST Maintenance for Transient Deletion of Every Node in Planar GraphsGaibisso, Carlo / Proietti, Guido / Tan, Richard B. et al. | 2003
- 42
-
Scheduling Broadcasts with DeadlinesKim, Jae-Hoon / Chwa, Kyung-Yong et al. | 2003
- 43
-
Improved Competitive Algorithms for Online Scheduling with Partial Job ValuesChin, Francis Y. L. / Fung, Stanley P. Y. et al. | 2003
- 44
-
Majority Equilibrium for Public Facility AllocationChen, Lihua / Deng, Xiaotie / Fang, Qizhi / Tian, Feng et al. | 2003
- 45
-
On Constrained Minimum PseudotriangulationsRote, Günter / Wang, Cao An / Wang, Lusheng / Xu, Yinfeng et al. | 2003
- 46
-
Pairwise Data Clustering and ApplicationsWu, Xiaodong / Chen, Danny Z. / Mason, James J. / Schmid, Steven R. et al. | 2003
- 47
-
Covering a Set of Points with a Minimum Number of TurnsCollins, Michael J. et al. | 2003
- 48
-
Area-Efficient Order-Preserving Planar Straight-Line Drawings of Ordered TreesGarg, Ashim / Rusu, Adrian et al. | 2003
- 49
-
Bounds for Convex Crossing NumbersShahrokhi, Farhad / Sýkora, Ondrej / Székely, Laszlo A. / Vrt’o, Imrich et al. | 2003
- 50
-
On Spectral Graph DrawingKoren, Yehuda et al. | 2003
- 51
-
On a Conjecture on Wiener Indices in Combinatorial ChemistryBan, Yih-En Andrew / Bespamyatnikh, Sergei / Mustafa, Nabil H. et al. | 2003
- 52
-
Double Digest Revisited: Complexity and Approximability in the Presence of Noisy DataCieliebak, Mark / Eidenbenz, Stephan / Woeginger, Gerhard J. et al. | 2003
- 53
-
Fast and Space-Efficient Location of Heavy or Dense Segments in Run-Length Encoded SequencesGreenberg, Ronald I. et al. | 2003
- 54
-
Genomic Distances under Deletions and InsertionsMarron, Mark / Swenson, Krister M. / Moret, Bernard M. E. et al. | 2003
- 55
-
Minimal Unsatisfiable Formulas with Bounded Clause-Variable Difference are Fixed-Parameter TractableSzeider, Stefan et al. | 2003