Pascal and Francis Bibliographic Databases

Help

Search results

Your search

ti.\*:("Computing and combinatorics (12th annual international conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006)")

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 53

  • Page / 3
Export

Selection :

  • and

Computing and combinatorics (12th annual international conference, COCOON 2006, Taipei, Taiwan, August 15-18, 2006)Chen, Danny Z; Lee, D.T.Lecture notes in computer science. 2006, issn 0302-9743, isbn 3-540-36925-2, 1Vol, XIV-528 p, isbn 3-540-36925-2Conference Proceedings

Overlap-Free Regular LanguagesHAN, Yo-Sub; WOOD, Derick.Lecture notes in computer science. 2006, pp 469-478, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

Robust Quantum Algorithms with ε-Biased OraclesSUZUKI, Tomoya; YAMASHITA, Shigeru; NAKANISHI, Masaki et al.Lecture notes in computer science. 2006, pp 116-125, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

Sequences Characterizing k-TreesLOTKER, Zvi; MAJUMDAR, Debapriyo; NARAYANASWAMY, N. S et al.Lecture notes in computer science. 2006, pp 216-225, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

The Complexity of Black-Box Ring ProblemsARVIND, V; DAS, Bireswar; MUKHOPADHYAY, Partha et al.Lecture notes in computer science. 2006, pp 126-135, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

Aggregating Strategy for Online AuctionsHARADA, Shigeaki; TAKIMOTO, Eiji; MARUOKA, Akira et al.Lecture notes in computer science. 2006, pp 33-41, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 9 p.Conference Paper

On the Combinatorial Representation of InformationRATSABY, Joel.Lecture notes in computer science. 2006, pp 479-488, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

Restricted Mesh Simplification Using Edge ContractionsANDERSSON, Mattias; GUDMUNDSSON, Joachim; LEVCOPOULOS, Christos et al.Lecture notes in computer science. 2006, pp 196-204, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 9 p.Conference Paper

Bimodal Crossing MinimizationBUCHHEIM, Christoph; JÜNGER, Michael; MENZE, Annette et al.Lecture notes in computer science. 2006, pp 497-506, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

Enumerating Non-crossing Minimally Rigid FrameworksAVIS, David; KATOH, Naoki; OHSAKI, Makoto et al.Lecture notes in computer science. 2006, pp 205-215, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 11 p.Conference Paper

On Indecomposability Preserving Elimination SequencesDUBEY, Chandan K; MEHTA, Shashank K.Lecture notes in computer science. 2006, pp 42-51, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

On Lazy Bin Covering and Packing ProblemsMINGEN LIN; YANG YANG; JINHUI XU et al.Lecture notes in computer science. 2006, pp 340-349, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

On Incentive Compatible Competitive Selection ProtocolXI CHEN; XIAOTIE DENG; LIU, Becky Jie et al.Lecture notes in computer science. 2006, pp 13-22, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

Geometric Representation of Graphs in Low DimensionSUNIL CHANDRAN, L; SIVADASAN, Naveen.Lecture notes in computer science. 2006, pp 398-407, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

Improved On-Line Broadcast Scheduling with DeadlinesFEIFENG ZHENG; FUNG, Stanley P. Y; CHAN, Wun-Tat et al.Lecture notes in computer science. 2006, pp 320-329, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

Reconciling Gene Trees with Apparent PolytomiesCHANG, Wen-Chieh; EULENSTEIN, Oliver.Lecture notes in computer science. 2006, pp 235-244, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

A PTAS for Cutting Out Polygons with LinesBEREG, Sergey; DAESCU, Ovidiu; MINGHUI JIANG et al.Lecture notes in computer science. 2006, pp 176-185, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

An Edge Ordering Problem of Regular HypergraphsHONGBING FAN; KALBFLEISCH, Robert.Lecture notes in computer science. 2006, pp 368-377, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

The On-Line Heilbronn's Triangle Problem in d DimensionsBAREQUET, Gill; SHAIKHET, Alina.Lecture notes in computer science. 2006, pp 408-417, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

Computing Maximum-Scoring Segments in Almost Linear TimeBENGTSSON, Fredrik; JINGSEN CHEN.Lecture notes in computer science. 2006, pp 255-264, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

On the Threshold of Having a Linear Treewidth in Random GraphsYONG GAO.Lecture notes in computer science. 2006, pp 226-234, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 9 p.Conference Paper

A Rigorous Analysis for Set-Up Time Models : A Metric PerspectiveBACHMAT, Eitan; TAO KAI LAM; MAGEN, Avner et al.Lecture notes in computer science. 2006, pp 387-397, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 11 p.Conference Paper

Creation and Growth of Components in a Random Hypergraph ProcessRAVELOMANANA, Vlady; LAZA RIJAMAMY, Alphonse.Lecture notes in computer science. 2006, pp 350-359, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

Enumerate and Expand : New Runtime Bounds for Vertex Cover VariantsMÖLLE, Daniel; RICHTER, Stefan; ROSSMANITH, Peter et al.Lecture notes in computer science. 2006, pp 265-273, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 9 p.Conference Paper

On Unfolding Lattice Polygons/Trees and Diameter-4 TreesPOON, Sheung-Hung.Lecture notes in computer science. 2006, pp 186-195, issn 0302-9743, isbn 3-540-36925-2, 1Vol, 10 p.Conference Paper

  • Page / 3