↓ Skip to main content

SOFSEM 2015: Theory and Practice of Computer Science

Overview of attention for book
Cover of 'SOFSEM 2015: Theory and Practice of Computer Science'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 What is Computation: An Epistemic Approach
  3. Altmetric Badge
    Chapter 2 Progress (and Lack Thereof) for Graph Coloring Approximation Problems
  4. Altmetric Badge
    Chapter 3 Recent Results in Scalable Multi-Party Computation
  5. Altmetric Badge
    Chapter 4 Online Bipartite Matching in Offline Time (Abstract)
  6. Altmetric Badge
    Chapter 5 Quo Vadis Explicit-State Model Checking
  7. Altmetric Badge
    Chapter 6 The Dos and Dont’s of Crowdsourcing Software Development
  8. Altmetric Badge
    Chapter 7 Adaptively Approximate Techniques in Distributed Architectures
  9. Altmetric Badge
    Chapter 8 Back to the Future – Should SQL Surrender to SPARQL?
  10. Altmetric Badge
    Chapter 9 Balancing Energy Consumption for the Establishment of Multi-interface Networks
  11. Altmetric Badge
    Chapter 10 The Maximum k-Differential Coloring Problem
  12. Altmetric Badge
    Chapter 11 Exact Algorithms for 2-Clustering with Size Constraints in the Euclidean Plane
  13. Altmetric Badge
    Chapter 12 Local Routing in Convex Subdivisions
  14. Altmetric Badge
    Chapter 13 Nondeterministic Modal Interfaces
  15. Altmetric Badge
    Chapter 14 Group Search on the Line
  16. Altmetric Badge
    Chapter 15 Online Makespan Scheduling with Sublinear Advice
  17. Altmetric Badge
    Chapter 16 Deterministic Rendezvous in Restricted Graphs
  18. Altmetric Badge
    Chapter 17 Fastest, Average and Quantile Schedule
  19. Altmetric Badge
    Chapter 18 Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP
  20. Altmetric Badge
    Chapter 19 Maximally Permissive Controlled System Synthesis for Modal Logic
  21. Altmetric Badge
    Chapter 20 Approximation Hardness of the Cross-Species Conserved Active Modules Detection Problem
  22. Altmetric Badge
    Chapter 21 Finding Highly Connected Subgraphs
  23. Altmetric Badge
    Chapter 22 Fixing Improper Colorings of Graphs
  24. Altmetric Badge
    Chapter 23 Efficient Online Strategies for Renting Servers in the Cloud
  25. Altmetric Badge
    Chapter 24 Pal k is Linear Recognizable Online
  26. Altmetric Badge
    Chapter 25 Two Grammatical Equivalents of Flip-Pushdown Automata
  27. Altmetric Badge
    Chapter 26 On the Hierarchy Classes of Finite Ultrametric Automata
  28. Altmetric Badge
    Chapter 27 Nash-Williams-type and Chvátal-type Conditions in One-Conflict Graphs
  29. Altmetric Badge
    Chapter 28 Optimal State Reductions of Automata with Partially Specified Behaviors
  30. Altmetric Badge
    Chapter 29 Quantum Pushdown Automata with a Garbage Tape
  31. Altmetric Badge
    Chapter 30 Towards a Characterization of Leaf Powers by Clique Arrangements
  32. Altmetric Badge
    Chapter 31 Filling Logarithmic Gaps in Distributed Complexity for Global Problems
  33. Altmetric Badge
    Chapter 32 On Visibly Pushdown Trace Languages
  34. Altmetric Badge
    Chapter 33 Dominating an s - t -Cut in a Network
  35. Altmetric Badge
    Chapter 34 Lower Bounds for Linear Decision Trees with Bounded Weights
  36. Altmetric Badge
    Chapter 35 A Model-Driven Approach to Generate External DSLs from Object-Oriented APIs
  37. Altmetric Badge
    Chapter 36 Function Based Requirements Engineering and Design –Towards Efficient and Transparent Plant Engineering
  38. Altmetric Badge
    Chapter 37 Software Developer Activity as a Source for Identifying Hidden Source Code Dependencies
  39. Altmetric Badge
    Chapter 38 Discovering Motifs in Real-World Social Networks
  40. Altmetric Badge
    Chapter 39 Exploiting Semantic Activity Labels to Facilitate Consistent Specialization of Abstract Process Activities
  41. Altmetric Badge
    Chapter 40 Efficient Similarity Search by Combining Indexing and Caching Strategies
  42. Altmetric Badge
    Chapter 41 Retrieving Documents Related to Database Queries
  43. Altmetric Badge
    Chapter 42 Advantages of Dependency Parsing for Free Word Order Natural Languages
  44. Altmetric Badge
    Chapter 43 Detecting Identical Entities in the Semantic Web Data
  45. Altmetric Badge
    Chapter 44 Conducting a Web Browsing Behaviour Study – An Educational Scenario
  46. Altmetric Badge
    Chapter 45 A Uniform Programmning Language for Implementing XML Standards
  47. Altmetric Badge
    Chapter 46 OntoSDM: An Approach to Improve Quality on Spatial Data Mining Algorithms
  48. Altmetric Badge
    Chapter 47 Attribute-Based Encryption Optimized for Cloud Computing
  49. Altmetric Badge
    Chapter 48 Trustworthy Virtualization of the ARMv7 Memory Subsystem
  50. Altmetric Badge
    Chapter 49 True Random Number Generators Secure in a Changing Environment: Improved Security Bounds
  51. Altmetric Badge
    Chapter 50 Java Loops Are Mainly Polynomial
Attention for Chapter 18: Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
1 Mendeley
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Chapter title
Machine Characterizations for Parameterized Complexity Classes Beyond Para-NP
Chapter number 18
Book title
SOFSEM 2015: Theory and Practice of Computer Science
Published by
Springer, Berlin, Heidelberg, January 2015
DOI 10.1007/978-3-662-46078-8_18
Book ISBNs
978-3-66-246077-1, 978-3-66-246078-8
Authors

Ronald de Haan, Stefan Szeider

Mendeley readers

The data shown below were compiled from readership statistics for 1 Mendeley reader of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 100%
Readers by discipline Count As %
Unknown 1 100%