default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID7. TAMC 2010: Prague, Czech Republic
- Jan Kratochvíl, Angsheng Li, Jirí Fiala, Petr Kolman:
Theory and Applications of Models of Computation, 7th Annual Conference, TAMC 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings. Lecture Notes in Computer Science 6108, Springer 2010, ISBN 978-3-642-13561-3
Plenary Talks
- John E. Hopcroft:
New Research Directions in the Information Age. 1 - Shang-Hua Teng:
The Laplacian Paradigm: Emerging Algorithms for Massive Graphs. 2-14
Special Sessions
- Olaf Beyersdorff
:
Proof Complexity of Non-classical Logics. 15-27 - Edward A. Hirsch:
Optimal Acceptors and Optimal Proof Systems. 28-39 - Christian Knauer:
The Complexity of Geometric Problems in High Dimension. 40-49 - Olaf Beyersdorff, Sebastian Müller:
Different Approaches to Proof Systems. 50-59 - Iddo Tzameret:
Algebraic Proofs over Noncommutative Formulas. 60-71
Contributed Papers
- Andris Ambainis, Dmitry Kravchenko, Nikolajs Nahimovs, Alexander Rivosh:
Nonlocal Quantum XOR Games for Large Number of Players. 72-83 - Klaus Ambos-Spies, Timur Bakibayev:
Nontriviality for Exponential Time w.r.t. Weak Reducibilities. 84-93 - Ajesh Babu, Nutan Limaye, Girish Varma:
Streaming Algorithms for Some Problems in Log-Space. 94-104 - Martin Birks, Stanley P. Y. Fung:
Temperature Aware Online Scheduling with a Low Cooling Factor. 105-116 - Péter Biró, Walter Kern, Daniël Paulusma:
On Solution Concepts for Matching Games. 117-127 - Francine Blanchet-Sadri, Jarett Schwartz, Slater Stich, Benjamin J. Wyatt:
Binary De Bruijn Partial Words with One Hole. 128-138 - Guillaume Bonfante, Florian L. Deloup:
Complexity Invariance of Real Interpretations. 139-150 - Robert Brijder, Hendrik Jan Hoogeboom:
Pivot and Loop Complementation on Graphs and Set Systems. 151-162 - Laurent Bulteau, Guillaume Fertin, Irena Rusu:
Revisiting the Minimum Breakpoint Linearization Problem. 163-174 - Christophe Crespelle, Ioan Todinca:
An O(n2){\mathcal{O}}(n^2)-time Algorithm for the Minimal Interval Completion Problem. 175-186 - Boaz Ben-Moshe, Amit Dvir, Michael Segal, Arie Tamir:
Centdian Computation for Sensor Networks. 187-198 - Rongquan Feng, Menglong Nie, Hongfeng Wu:
Twisted Jacobi Intersections Curves. 199-210 - Petr A. Golovach, Bernard Lidický, Daniël Paulusma:
L(2, 1, 1)-Labeling Is NP-Complete for Trees. 211-221 - Laurent Gourvès, Adria Lyra, Carlos A. J. Martinhon, Jérôme Monnot:
Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs. 222-233 - Laurent Gourvès, Jérôme Monnot:
The Max k-Cut Game and Its Strong Equilibria. 234-246 - Sylvain Guillemot, Matthias Mnich:
Kernel and Fast Algorithm for Dense Triplet Inconsistency. 247-257 - Sepp Hartung, Rolf Niedermeier:
Incremental List Coloring of Graphs, Parameterized by Conservation. 258-270 - Xin He, Huaming Zhang:
Schnyder Greedy Routing Algorithm. 271-283 - Pinar Heggernes, Daniel Meister, Udi Rotics:
Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. 284-295 - Charles Jordan, Thomas Zeugmann:
A Note on the Testability of Ramsey's Class. 296-307 - Ming-Yang Kao, Henry C. M. Leung, He Sun, Yong Zhang:
Deterministic Polynomial-Time Algorithms for Designing Short DNA Words. 308-319 - Nicholas Korpelainen, Vadim V. Lozin, Alexander Tiskin:
Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult. 320-327 - Jin-yi Cai, Michael Kowalczyk:
A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions. 328-339 - Josef Cibulka, Jan Kyncl, Viola Mészáros, Rudolf Stolar, Pavel Valtr:
Graph Sharing Games: Complexity and Connectivity. 340-349 - Ian Mackie:
A Visual Model of Computation. 350-360 - Benedek Nagy:
An Automata-Theoretic Characterization of the Chomsky-Hierarchy. 361-372 - Nicolas Bourgeois, Bruno Escoffier, Vangelis Th. Paschos, Johan M. M. van Rooij:
Maximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537n){\mathcal O}(1.08537^n). 373-384 - G. Michele Pinna, Andrea Saba:
Simultaneity in Event Structures. 385-396 - Stefan Ratschan:
Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable. 397-408 - Sadish Sadasivam, Huaming Zhang:
Closed Rectangle-of-Influence Drawings for Irreducible Triangulations. 409-418 - Sucheta Soundarajan, John E. Hopcroft:
Recovering Social Networks from Contagion Information. 419-430 - Johannes Uhlmann, Mathias Weller:
Two-Layer Planarization Parameterized by Feedback Edge Set. 431-442 - Natalya Gribovskaya, Irina B. Virbitskaite:
A Categorical View of Timed Weak Bisimulation. 443-454 - Liaoruo Wang, John E. Hopcroft:
Community Structure in Large Complex Networks. 455-466 - Bingbing Zhuang, Hiroshi Nagamochi:
Generating Internally Triconnected Rooted Plane Graphs. 467-478
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-10-31 20:20 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
