Conferences in DBLP

(tamc)
2010 (conf/tamc/2010)

1. 
   New Research Directions in the Information Age. [Citation Graph (, )][DBLP]
   
   
2. 
   The Laplacian Paradigm: Emerging Algorithms for Massive Graphs. [Citation Graph (, )][DBLP]
   
   
3. 
   Proof Complexity of Non-classical Logics. [Citation Graph (, )][DBLP]
   
   
4. 
   Optimal Acceptors and Optimal Proof Systems. [Citation Graph (, )][DBLP]
   
   
5. 
   The Complexity of Geometric Problems in High Dimension. [Citation Graph (, )][DBLP]
   
   
6. 
   Different Approaches to Proof Systems. [Citation Graph (, )][DBLP]
   
   
7. 
   Algebraic Proofs over Noncommutative Formulas. [Citation Graph (, )][DBLP]
   
   
8. 
   Nonlocal Quantum XOR Games for Large Number of Players. [Citation Graph (, )][DBLP]
   
   
9. 
   Nontriviality for Exponential Time w.r.t. Weak Reducibilities. [Citation Graph (, )][DBLP]
   
   
10. 
    Streaming Algorithms for Some Problems in Log-Space. [Citation Graph (, )][DBLP]
    
    
11. 
    Temperature Aware Online Scheduling with a Low Cooling Factor. [Citation Graph (, )][DBLP]
    
    
12. 
    On Solution Concepts for Matching Games. [Citation Graph (, )][DBLP]
    
    
13. 
    Binary De Bruijn Partial Words with One Hole. [Citation Graph (, )][DBLP]
    
    
14. 
    Complexity Invariance of Real Interpretations. [Citation Graph (, )][DBLP]
    
    
15. 
    Pivot and Loop Complementation on Graphs and Set Systems. [Citation Graph (, )][DBLP]
    
    
16. 
    Revisiting the Minimum Breakpoint Linearization Problem. [Citation Graph (, )][DBLP]
    
    
17. 
    An O(n²){\mathcal{O}}(n^2)-time Algorithm for the Minimal Interval Completion Problem. [Citation Graph (, )][DBLP]
    
    
18. 
    Centdian Computation for Sensor Networks. [Citation Graph (, )][DBLP]
    
    
19. 
    Twisted Jacobi Intersections Curves. [Citation Graph (, )][DBLP]
    
    
20. 
    L(2, 1, 1)-Labeling Is NP-Complete for Trees. [Citation Graph (, )][DBLP]
    
    
21. 
    Complexity of Paths, Trails and Circuits in Arc-Colored Digraphs. [Citation Graph (, )][DBLP]
    
    
22. 
    The Max k-Cut Game and Its Strong Equilibria. [Citation Graph (, )][DBLP]
    
    
23. 
    Kernel and Fast Algorithm for Dense Triplet Inconsistency. [Citation Graph (, )][DBLP]
    
    
24. 
    Incremental List Coloring of Graphs, Parameterized by Conservation. [Citation Graph (, )][DBLP]
    
    
25. 
    Schnyder Greedy Routing Algorithm. [Citation Graph (, )][DBLP]
    
    
26. 
    Exploiting Restricted Linear Structure to Cope with the Hardness of Clique-Width. [Citation Graph (, )][DBLP]
    
    
27. 
    A Note on the Testability of Ramsey's Class. [Citation Graph (, )][DBLP]
    
    
28. 
    Deterministic Polynomial-Time Algorithms for Designing Short DNA Words. [Citation Graph (, )][DBLP]
    
    
29. 
    Hamiltonian Cycles in Subcubic Graphs: What Makes the Problem Difficult. [Citation Graph (, )][DBLP]
    
    
30. 
    A Dichotomy for k-Regular Graphs with {0, 1}-Vertex Assignments and Real Edge Functions. [Citation Graph (, )][DBLP]
    
    
31. 
    Graph Sharing Games: Complexity and Connectivity. [Citation Graph (, )][DBLP]
    
    
32. 
    A Visual Model of Computation. [Citation Graph (, )][DBLP]
    
    
33. 
    An Automata-Theoretic Characterization of the Chomsky-Hierarchy. [Citation Graph (, )][DBLP]
    
    
34. 
    Maximum Independent Set in Graphs of Average Degree at Most Three in O(1.08537ⁿ){\mathcal O}(1.08537^n). [Citation Graph (, )][DBLP]
    
    
35. 
    Simultaneity in Event Structures. [Citation Graph (, )][DBLP]
    
    
36. 
    Safety Verification of Non-linear Hybrid Systems Is Quasi-Semidecidable. [Citation Graph (, )][DBLP]
    
    
37. 
    Closed Rectangle-of-Influence Drawings for Irreducible Triangulations. [Citation Graph (, )][DBLP]
    
    
38. 
    Recovering Social Networks from Contagion Information. [Citation Graph (, )][DBLP]
    
    
39. 
    Two-Layer Planarization Parameterized by Feedback Edge Set. [Citation Graph (, )][DBLP]
    
    
40. 
    A Categorical View of Timed Weak Bisimulation. [Citation Graph (, )][DBLP]
    
    
41. 
    Community Structure in Large Complex Networks. [Citation Graph (, )][DBLP]
    
    
42. 
    Generating Internally Triconnected Rooted Plane Graphs. [Citation Graph (, )][DBLP]