Computing and Combinatorics 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings /
This book constitutes the refereed proceedings of the 18th Annual International Conference on Computing and Combinatorics, held in Sydney, Australia, in August 2012. The 50 revised full papers presented were carefully reviewed and selected from 121 submissions. Topics covered are algorithms and data...
| Corporate Authors: | COCOON 2012 Sydney, N.S.W.) |
|---|---|
| Other Authors: | COCOON 2012, Gudmundsson, Joachim., Mestre, Julián., Viglas, Taso., SpringerLink (Online service) |
| Format: | eBook |
| Language: | English |
| Published: |
Berlin ; New York :
Springer,
©2012.
Berlin ; New York : [2012] |
| Physical Description: |
1 online resource. |
| Series: |
Lecture notes in computer science ;
7434. LNCS sublibrary. Theoretical computer science and general issues. |
| Subjects: |
| LEADER | 11403cam a2201357 a 4500 | ||
|---|---|---|---|
| 001 | 808125330 | ||
| 003 | OCoLC | ||
| 005 | 20240223121953.0 | ||
| 006 | m o d | ||
| 007 | cr cnu---unuuu | ||
| 008 | 120824s2012 gw ob 101 0 eng d | ||
| 019 | |a 1058443431 | ||
| 020 | |a 9783642322419 |q (electronic bk.) | ||
| 020 | |a 3642322417 |q (electronic bk.) | ||
| 020 | |z 9783642322402 | ||
| 024 | 7 | |a 10.1007/978-3-642-32241-9 |2 doi | |
| 035 | |a (OCoLC)808125330 |z (OCoLC)1058443431 | ||
| 040 | |a GW5XE |b eng |e pn |c GW5XE |d COO |d ZMC |d OCLCQ |d E7B |d OCLCF |d BEDGE |d OCLCO |d YDXCP |d OCL |d OCLCO |d OCLCQ |d EBLCP |d OCLCQ |d MYUML |d ESU |d OCLCQ |d IOG |d NJR |d CEF |d OCLCQ |d U3W |d WYU |d YOU |d AU@ |d TKN |d LEAUB |d OCLCQ |d WURST |d AJS |d OCLCQ |d UKAHL |d OCLCQ |d OCLCO |d OCLCQ |d OCLCO |d OCLCL | ||
| 049 | |a COM6 | ||
| 050 | 4 | |a QA164 |b .C63 2012 | |
| 072 | 7 | |a UMB |2 bicssc | |
| 072 | 7 | |a COM051300 |2 bisacsh | |
| 082 | 0 | 4 | |a 511/.6 |2 23 |
| 111 | 2 | |a COCOON 2012 |d (2012 : |c Sydney, N.S.W.) | |
| 245 | 1 | 0 | |a Computing and Combinatorics : |b 18th Annual International Conference, COCOON 2012, Sydney, Australia, August 20-22, 2012. Proceedings / |c Joachim Gudmundsson, Julián Mestre, Taso Viglas (eds.). |
| 246 | 3 | |a COCOON 2012. | |
| 260 | |a Berlin ; |a New York : |b Springer, |c ©2012. | ||
| 264 | 1 | |a Berlin ; |a New York : |b Springer, |c [2012] | |
| 264 | 4 | |c ©2012. | |
| 300 | |a 1 online resource. | ||
| 336 | |a text |b txt |2 rdacontent. | ||
| 337 | |a computer |b c |2 rdamedia. | ||
| 338 | |a online resource |b cr |2 rdacarrier. | ||
| 347 | |a text file. | ||
| 347 | |b PDF. | ||
| 490 | 1 | |a Lecture notes in computer science, |x 0302-9743 ; |v 7434. | |
| 490 | 1 | |a LNCS sublibrary. SL 1, Theoretical computer science and general issues. | |
| 505 | 0 | 0 | |t A Linear Time Algorithm for Computing Minmax Regret 1-Median on a Tree / |r Binay Bhattacharya and Tsunehiko Kameda -- |t A Simple D2-Sampling Based PTAS for k-Means and other Clustering Problems / |r Ragesh Jaiswal, Amit Kumar and Sandeep Sen -- |t Speed Scaling for Maximum Lateness / |r Evripidis Bampis, Dimitrios Letsios, Ioannis Milis and Georgios Zois -- |t Induced Subgraph Isomorphism: Are Some Patterns Substantially Easier Than Others? / |r Peter Floderus, Mirosław Kowaluk, Andrzej Lingas and Eva-Marta Lundell -- |t Contiguous Minimum Single-Source-Multi-Sink Cuts in Weighted Planar Graphs / |r Ivona Bezáková and Zachary Langley -- |t Online Knapsack Problem with Removal Cost / |r Xin Han, Yasushi Kawase and Kazuhisa Makino -- |t An Improved Exact Algorithm for TSP in Degree-4 Graphs / |r Mingyu Xiao and Hiroshi Nagamochi -- |t Dynamic Programming for H-minor-free Graphs / |r Juanjo Rué, Ignasi Sau and Dimitrios M. Thilikos -- |t Restricted Max-Min Fair Allocations with Inclusion-Free Intervals / |r Monaldo Mastrolilli and Georgios Stamoulis -- |t An Improved Algorithm for Packing T-Paths in Inner Eulerian Networks / |r Maxim A. Babenko, Kamil Salikhov and Stepan Artamonov -- |t Towards Optimal and Expressive Kernelization for d-Hitting Set / |r René van Bevern. |
| 505 | 8 | 0 | |t Maximum Number of Minimal Feedback Vertex Sets in Chordal Graphs and Cographs / |r Jean-François Couturier, Pinar Heggernes, Pim van 't Hof and Yngve Villanger -- |t A Local Algorithm for Finding Dense Bipartite-Like Subgraphs / |r Pan Peng -- |t Algorithms for the Strong Chromatic Index of Halin Graphs, Distance-Hereditary Graphs and Maximal Outerplanar Graphs / |r Ton Kloks, Sheung-Hung Poon, Chin-Ting Ung and Yue-Li Wang -- |t On the Minimum Degree Hypergraph Problem with Subset Size Two and the Red-Blue Set Cover Problem with the Consecutive Ones Property / |r Biing-Feng Wang and Chih-Hsuan Li -- |t Rainbow Colouring of Split and Threshold Graphs / |r L. Sunil Chandran and Deepak Rajendraprasad -- |t Approximating the Rainbow -- Better Lower and Upper Bounds / |r Alexandru Popa -- |t Ramsey Numbers for Line Graphs and Perfect Graphs / |r Rémy Belmonte, Pinar Heggernes, Pim van 't Hof and Reza Saei -- |t Geodesic Order Types / |r Oswin Aichholzer, Matias Korman, Alexander Pilz and Birgit Vogtenhuber -- |t Computing Partitions of Rectilinear Polygons with Minimum Stabbing Number / |r Stephane Durocher and Saeed Mehrabi -- |t Monotone Paths in Planar Convex Subdivisions / |r Adrian Dumitrescu, Günter Rote and Csaba D. Tóth -- |t The Cost of Bounded Curvature / |r Hyo-Sil Kim and Otfried Cheong. |
| 505 | 8 | 0 | |t Optimally Solving a Transportation Problem Using Voronoi Diagrams / |r Darius Geiß, Rolf Klein and Rainer Penninger -- |t Unexplored Steiner Ratios in Geometric Networks / |r Paz Carmi and Lilach Chaitman-Yerushalmi -- |t Geometric RAC Simultaneous Drawings of Graphs / |r Evmorfia Argyriou, Michael Bekos, Michael Kaufmann and Antonios Symvonis -- |t Simultaneous Embeddings with Vertices Mapping to Pre-specified Points / |r Taylor Gordon -- |t Multilevel Drawings of Clustered Graphs / |r Fabrizio Frati -- |t Outerplanar Graph Drawings with Few Slopes / |r Kolja Knauer, Piotr Micek and Bartosz Walczak -- |t Fáry's Theorem for 1-Planar Graphs / |r Seok-Hee Hong, Peter Eades, Giuseppe Liotta and Sheung-Hung Poon -- |t Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application / |r Kunihiro Wasa, Yusaku Kaneta, Takeaki Uno and Hiroki Arimura -- |t External Memory Soft Heap, and Hard Heap, a Meldable Priority Queue / |r Alka Bhushan and Sajith Gopalan -- |t Partially Specified Nearest Neighbor Search / |r Tomas Hruz and Marcel Schöngens -- |t Multi-pattern Matching with Bidirectional Indexes / |r Simon Gog, Kalle Karhu, Juha Kärkkäinen, Veli Mäkinen and Niko Välimäki -- |t Succinct Representations of Binary Trees for Range Minimum Queries / |r Pooya Davoodi, Rajeev Raman and Srinivasa Rao Satti. |
| 505 | 8 | 0 | |t Lower Bounds against Weakly Uniform Circuits / |r Ruiwen Chen and Valentine Kabanets -- |t On TC0 Lower Bounds for the Permanent / |r Jeff Kinne -- |t Formula Complexity of Ternary Majorities / |r Kenya Ueno -- |t On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles / |r Fahad Panolan and Ashutosh Rai -- |t The Complexity of Unary Subset Sum / |r Nutan Limaye, Meena Mahajan and Karteek Sreenivasaiah -- |t On the Advice Complexity of Tournaments / |r Sebastian Ben Daniel -- |t A Remark on One-Wayness versus Pseudorandomness / |r Periklis A. Papakonstantinou and Guang Yang -- |t Integral Mixed Unit Interval Graphs / |r Van Bang Le and Dieter Rautenbach -- |t Complementary Vertices and Adjacency Testing in Polytopes / |r Benjamin A. Burton -- |t Online Coloring of Bipartite Graphs with and without Advice / |r Maria Paola Bianchi, Hans-Joachim Böckenhauer, Juraj Hromkovič and Lucia Keller -- |t Deep Coalescence Reconciliation with Unrooted Gene Trees: Linear Time Algorithms / |r Paweł Górecki and Oliver Eulenstein -- |t On the 2-Central Path Problem / |r Yongding Zhu and Jinhui Xu -- |t Making Profit in a Prediction Market / |r Jen-Hou Chou, Chi-Jen Lu and Mu-En Wu -- |t Computing Shapley Value in Supermodular Coalitional Games / |r David Liben-Nowell, Alexa Sharp, Tom Wexler and Kevin Woods -- |t Equilibria of GSP for Range Auction / |r H.F. Ting and Xiangzhong Xiang -- |t Stretch in Bottleneck Games / |r Costas Busch and Rajgopal Kannan. |
| 504 | |a Includes bibliographical references and author index. | ||
| 520 | |a This book constitutes the refereed proceedings of the 18th Annual International Conference on Computing and Combinatorics, held in Sydney, Australia, in August 2012. The 50 revised full papers presented were carefully reviewed and selected from 121 submissions. Topics covered are algorithms and data structures; algorithmic game theory and online algorithms; automata, languages, logic, and computability; combinatorics related to algorithms and complexity; complexity theory; computational learning theory and knowledge discovery; cryptography, reliability and security, and database theory; computational biology and bioinformatics; computational algebra, geometry, and number theory; graph drawing and information visualization; graph theory, communication networks, and optimization. | ||
| 546 | |a English. | ||
| 650 | 0 | |a Combinatorial analysis |x Data processing |v Congresses. | |
| 650 | 0 | |a Computer science |x Mathematics |v Congresses. | |
| 650 | 6 | |a Analyse combinatoire |x Informatique |v Congrès. | |
| 650 | 6 | |a Informatique |x Mathématiques |v Congrès. | |
| 650 | 7 | |a Informatique. |2 eclas. | |
| 650 | 7 | |a Combinatorial analysis |x Data processing. |2 fast. | |
| 650 | 7 | |a Computer science |x Mathematics. |2 fast. | |
| 653 | 4 | |a Computer science. | |
| 653 | 4 | |a Computer Communication Networks. | |
| 653 | 4 | |a Computer software. | |
| 653 | 4 | |a Computational complexity. | |
| 653 | 4 | |a Artificial intelligence. | |
| 653 | 4 | |a Computer graphics. | |
| 653 | 4 | |a Algorithm Analysis and Problem Complexity. | |
| 653 | 4 | |a Discrete Mathematics in Computer Science. | |
| 653 | 4 | |a Computation by Abstract Devices. | |
| 653 | 0 | 0 | |a computerwetenschappen. |
| 653 | 0 | 0 | |a computer sciences. |
| 653 | 0 | 0 | |a wiskunde. |
| 653 | 0 | 0 | |a mathematics. |
| 653 | 0 | 0 | |a algoritmen. |
| 653 | 0 | 0 | |a algorithms. |
| 653 | 0 | 0 | |a computeranalyse. |
| 653 | 0 | 0 | |a computer analysis. |
| 653 | 0 | 0 | |a kunstmatige intelligentie. |
| 653 | 0 | 0 | |a computational science. |
| 653 | 0 | 0 | |a computergrafie. |
| 653 | 0 | 0 | |a computernetwerken. |
| 653 | 0 | 0 | |a computer networks. |
| 653 | 1 | 0 | |a Information and Communication Technology (General) |
| 653 | 1 | 0 | |a Informatie- en communicatietechnologie (algemeen) |
| 655 | 7 | |a Conference papers and proceedings. |2 fast. | |
| 655 | 7 | |a Software. |2 lcgft. | |
| 655 | 7 | |a Conference papers and proceedings. |2 lcgft. | |
| 700 | 1 | |a Gudmundsson, Joachim. | |
| 700 | 1 | |a Mestre, Julián. | |
| 700 | 1 | |a Viglas, Taso. | |
| 710 | 2 | |a SpringerLink (Online service) | |
| 776 | 0 | 8 | |i Printed edition: |z 9783642322402. |
| 830 | 0 | |a Lecture notes in computer science ; |v 7434. | |
| 830 | 0 | |a LNCS sublibrary. |n SL 1, |p Theoretical computer science and general issues. | |
| 907 | |a .b3622358x |b multi |c - |d 120912 |e 240401 | ||
| 998 | |a (3)cue |a cu |b 240227 |c m |d z |e - |f eng |g gw |h 0 |i 2 | ||
| 948 | |a MARCIVE Overnight, in 2024.03 | ||
| 948 | |a MARCIVE Comprehensive, in 2023.06 | ||
| 948 | |a MARCIVE Comp, in 2022.12 | ||
| 948 | |a MARCIVE Over, 07/2021 | ||
| 948 | |a MARCIVE Comp, 2019.12 | ||
| 948 | |a MARCIVE Comp, 2018.05 | ||
| 948 | |a MARCIVE Comp, 2017.10 | ||
| 948 | |a MARCIVE August, 2017 | ||
| 948 | |a MARCIVE extract Aug, 5 2017 | ||
| 933 | |a Marcive found issue: "111 2 |a COCOON 2012 |d (2012 : |c Sydney, N.S.W.)" | ||
| 994 | |a 92 |b COM | ||
| 995 | |a Loaded with m2btab.ltiac in 2024.03 | ||
| 995 | |a Loaded with m2btab.elec in 2024.02 | ||
| 995 | |a Loaded with m2btab.ltiac in 2023.06 | ||
| 995 | |a Loaded with m2btab.ltiac in 2022.12 | ||
| 995 | |a Loaded with m2btab.ltiac in 2021.07 | ||
| 995 | |a Loaded with m2btab.elec in 2021.06 | ||
| 995 | |a Loaded with m2btab.ltiac in 2019.12 | ||
| 995 | |a Loaded with m2btab.ltiac in 2018.06 | ||
| 995 | |a Loaded with m2btab.ltiac in 2017.10 | ||
| 995 | |a Loaded with m2btab.ltiac in 2017.08 | ||
| 995 | |a Loaded with m2btab.elec in 2016 | ||
| 995 | |a Loaded with m2btab.elec in 2016 | ||
| 995 | |a OCLC offline update by CMU | ||
| 995 | |a Loaded with m2btab.auth in 2021.07 | ||
| 995 | |a Loaded with m2btab.auth in 2024.03 | ||
| 999 | |e z | ||
| 999 | |a cue | ||
| 989 | |d cueme |e - - |f - - |g - |h 0 |i 0 |j 200 |k 240227 |l $0.00 |m |n - - |o - |p 0 |q 0 |t 0 |x 0 |w SpringerLink |1 .i150322215 |u http://ezproxy.coloradomesa.edu/login?url=https://link.springer.com/10.1007/978-3-642-32241-9 |3 SpringerLink |z Click here for access | ||