Theory and Applications of Models of Computation : 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings

by Kratochvil, Jan; Li, Angsheng; Fiala, Jiri; Kolman, Petr

• ISBN13: 9783642135613
• ISBN10: 3642135617
• Format: Paperback
• Copyright: 2010-06-29
• Publisher: Springer Verlag
• More Book Details
• Purchase Benefits

Summary

This book constitutes the refereed proceedings of the 7th InternationalConference on Theory and Applications of Models of Computation, TAMC2010, held in Prague, Czech Republic, in June 2010.The 35 revised full papers presented together with 5 contributions ofspecial sessions as well as 2 plenary talks were carefully reviewed andselected from 76 submissions. The papers address the three main themesof the conference which were computability, complexity, and algorithmsand present current research in these fields with aspects to theoreticalcomputer science, algorithmic mathematics, and applications to thephysical sciences.

Table of Contents

Plenary Talks
New Research Directions in the Information Age	p. 1
The Laplacian Paradigm: Emerging Algorithms for Massive Graphs	p. 2
Special Sessions
Proof Complexity of Non-classical Logics	p. 15
Optimal Acceptors and Optimal Proof Systems	p. 28
The Complexity of Geometric Problems in High Dimension	p. 40
Different Approaches to Proof Systems	p. 50
Algebraic Proofs over Noncommutative Formulas	p. 60
Contributed Papers
Nonlocal Quantum XOR Games for Large Number of Players	p. 72
Nontriviality for Exponential Time w.r.t. Weak Reducibilities	p. 84
Streaming Algorithms for Some Problems in Log-Space	p. 94
Temperature Aware Online Scheduling with a Low Cooling Factor	p. 105
On Solution Concepts for Matching Games	p. 117
Binary De Bruijn Partial Words with One Hole	p. 128
Complexity Invariance of Real Interpretations	p. 139
Pivot and Loop Complementation on Graphs and Set Systems	p. 151
Revisiting the Minimum Breakpoint Linearization Problem	p. 163
An O(n2)-Time Algorithm for the Minimal Interval Completion Problem	p. 175
Centdian Computation for Sensor Networks	p. 187
Twisted Jacobi Intersections Curves	p. 199
L (2,1,1)-Labeling Is NP-Complete for Trees	p. 211
Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs	p. 222
The Max k-Cut Game and Its Strong Equilibria	p. 234
Kernel and Fast Algorithm for Dense Triplet Inconsistency	p. 247
Incremental List Coloring of Graphs, Parameterized by Conservation	p. 258
Schnyder Greedy Routing Algorithm	p. 271
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width	p. 284
A Note on the Testability of Ramsey's Class	p. 296
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words	p. 308
Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult	p. 320
A Dichotomy for k-Regular Graphs with {0,1}-Vertex Assignments and Real Edge Functions	p. 328
Graph Sharing Games: Complexity and Connectivity	p. 340
A Visual Model of Computation	p. 350
An Automata-Theoretic Characterization of the Chomsky-Hierarchy	p. 361
Maximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537n)	p. 373
Simultaneity in Event Structures	p. 385
Safety Verification of Non-linear Hybrid Systems is Quasi-Semidecidable	p. 397
Closed Rectangle-of-Influence Drawings for Irreducible Triangulations	p. 409
Recovering Social Networks from Contagion Information	p. 419
Two-Layer Planarization Parameterized by Feedback Edge Set	p. 431
A Categorical View of Timed Weak Bisimulation	p. 443
Community Structure in Large Complex Networks	p. 455
Generating Internally Triconnected Rooted Plane Graphs	p. 467
Author Index	p. 479
Table of Contents provided by Ingram. All Rights Reserved.